AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
graph/Tokenizer.java
Go to the documentation of this file.
1package aud.example.graph;
2
4
5import java.util.regex.Pattern;
6
10public class Tokenizer extends LexicalScanner {
11
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(",");
20
21 public static final int LEFT_BRACE='[';
22 public static final int RIGHT_BRACE=']';
23 public static final int LEFT_PAREN='(';
24 public static final int RIGHT_PAREN=')';
25 public static final int AT='@';
26 public static final int COMMA=',';
27
28 public static final int IDENTIFIER=0x100;
29 public static final int NUMBER=0x101;
30 public static final int EDGE=0x102;
31 public static final int DEDGE=0x103;
32
33
34 protected static final LexicalScanner.Rule[] RULES =
35 {
46 };
47
49 public Tokenizer(String input) {
50 super(RULES,input);
51 }
52}
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
Tokenizer(String input)
create new tokenizer for input
static final Pattern P_DEDGE
static final Pattern P_LEFTBRACE
static final Pattern P_AT
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)
Definition: Colormap.java:1
AuD lecture: Data structures, algorithms, examples.
Definition: A234Tree.java:1