org.antlr.runtime.DFA Class Reference
List of all members.
Detailed Description
A
DFA implemented as a set of transition tables.
Any state that has a semantic predicate edge is special; those states are generated with if-then-else structures in a specialStateTransition() which is generated by cyclicDFA template.
There are at most 32767 states (16-bit signed short). Could get away with byte sometimes but would have to generate different types and the simulation code too. For a point of reference, the Java lexer's Tokens rule DFA has 326 states roughly.
Definition at line 41 of file DFA.java.
Member Function Documentation
From the input stream, predict what alternative will succeed using this DFA (representing the covering regular approximation to the underlying CFL). Return an alternative number 1..n. Throw an exception upon error.
Definition at line 62 of file DFA.java.
A hook for debugging interface
Definition at line 168 of file DFA.java.
| String org.antlr.runtime.DFA.getDescription |
( |
|
) |
|
| static short [] org.antlr.runtime.DFA.unpackEncodedString |
( |
String |
encodedString |
) |
[static] |
Given a String that has a run-length-encoding of some unsigned shorts like "\1\2\3\9", convert to short[] {2,9,9,9}. We do this to avoid static short[] which generates so much init code that the class won't compile. :(
Definition at line 185 of file DFA.java.
| static char [] org.antlr.runtime.DFA.unpackEncodedStringToUnsignedChars |
( |
String |
encodedString |
) |
[static] |
Hideous duplication of code, but I need different typed arrays out :(
Definition at line 205 of file DFA.java.
Member Data Documentation
Which recognizer encloses this DFA? Needed to check backtracking
Definition at line 53 of file DFA.java.
The documentation for this class was generated from the following file:
- /Users/parrt/antlr/code/antlr/main/runtime/Java/src/org/antlr/runtime/DFA.java
