1package aud.example.graph;
5import java.util.regex.Pattern;
12 protected static final Pattern
P_LEFTBRACE= Pattern.compile(
"\\[");
13 protected static final Pattern
P_RIGHTBRACE = Pattern.compile(
"\\]");
14 protected static final Pattern
P_LEFTPAREN = Pattern.compile(
"\\(");
15 protected static final Pattern
P_RIGHTPAREN = Pattern.compile(
"\\)");
16 protected static final Pattern
P_EDGE = Pattern.compile(
"--");
17 protected static final Pattern
P_DEDGE = Pattern.compile(
"->");
18 protected static final Pattern
P_AT = Pattern.compile(
"@");
19 protected static final Pattern
P_COMMA = Pattern.compile(
",");
25 public static final int AT=
'@';
26 public static final int COMMA=
',';
29 public static final int NUMBER=0x101;
30 public static final int EDGE=0x102;
31 public static final int DEDGE=0x103;
Breaks input string into pieces ("tokens").
static final Pattern P_LEFTPAREN
static final Pattern P_COMMA
static final Pattern P_RIGHTBRACE
static final Pattern P_EDGE
static final LexicalScanner.Rule[] RULES
static final int IDENTIFIER
Tokenizer(String input)
create new tokenizer for input
static final int LEFT_BRACE
static final int LEFT_PAREN
static final Pattern P_DEDGE
static final int RIGHT_BRACE
static final Pattern P_LEFTBRACE
static final Pattern P_AT
static final int RIGHT_PAREN
static final Pattern P_RIGHTPAREN
Base class for a simple lexical scanner.
static final Pattern P_IDENTIFIER
identifiers
static final Pattern P_FLOAT
floating point number
utilities (not related to AuD lecture)
AuD lecture: Data structures, algorithms, examples.