Package | Description |
---|---|
jflex |
Modifier and Type | Class and Description |
---|---|
class |
RegExp1
Stores a regular expression from the rules section of a JFlex specification.
|
class |
RegExp2
Regular expression with two children (e.g.
|
Modifier and Type | Field and Description |
---|---|
(package private) RegExp |
RegExp2.r1 |
(package private) RegExp |
RegExp2.r2 |
Modifier and Type | Field and Description |
---|---|
(package private) java.util.List<RegExp> |
RegExps.look
the lookahead expression
|
private java.util.Map<java.lang.String,RegExp> |
Macros.macros
Maps names of macros to their definition
|
(package private) java.util.List<RegExp> |
RegExps.regExps
the regexp
|
Modifier and Type | Method and Description |
---|---|
RegExp |
RegExp.anyChar()
Returns a regexp that matches any character:
[^] |
private RegExp |
Macros.expandMacro(java.lang.String name,
RegExp definition)
Expands the specified macro by replacing each macro usage
with the stored definition.
|
RegExp |
Macros.getDefinition(java.lang.String name)
Fetches the definition of the macro with the specified name,
|
RegExp |
RegExps.getLookAhead(int num) |
RegExp |
RegExps.getRegExp(int num) |
private RegExp |
LexParse.CUP$LexParse$actions.makeNL() |
private RegExp |
LexParse.CUP$LexParse$actions.makeRepeat(RegExp r,
int n1,
int n2,
int line,
int col) |
RegExp |
RegExp.resolveTilde(Macros macros)
Recursively convert tilde (upto) expressions into negation and star.
|
RegExp |
RegExp.rev(Macros macros)
Create a new regexp that matches the reverse text of this one.
|
Modifier and Type | Method and Description |
---|---|
private RegExp |
Macros.expandMacro(java.lang.String name,
RegExp definition)
Expands the specified macro by replacing each macro usage
with the stored definition.
|
int |
RegExps.insert(int line,
java.util.List<java.lang.Integer> stateList,
RegExp regExp,
Action action,
java.lang.Boolean isBOL,
RegExp lookAhead) |
boolean |
Macros.insert(java.lang.String name,
RegExp definition)
Stores a new macro and its definition.
|
private void |
NFA.insertCCLNFA(RegExp regExp,
int start,
int end)
Constructs a two state NFA for char class regexps,
such that the NFA has
exactly one start state,
exactly one end state,
no transitions leading out of the end state
no transitions leading into the start state
Assumes that regExp.isCharClass(macros) == true
|
private void |
NFA.insertLookAheadChoices(int baseEnd,
Action a,
RegExp lookAhead)
Insert NFAs for the (finitely many) fixed length lookahead choices.
|
IntPair |
NFA.insertNFA(RegExp regExp)
Constructs an NFA for regExp such that the NFA has
exactly one start state,
exactly one end state,
no transitions leading out of the end state
no transitions leading into the start state
|
private boolean |
LexParse.CUP$LexParse$actions.isDotOrNewlinePattern(RegExp r1,
RegExp r2) |
static boolean |
SemCheck.isFiniteChoice(RegExp re)
Returns true iff the expression is a finite choice of fixed length
expressions.
|
private boolean |
LexParse.CUP$LexParse$actions.isNewline(RegExp r) |
static int |
SemCheck.length(RegExp re)
Returns length if expression has fixed length, -1 otherwise.
|
private RegExp |
LexParse.CUP$LexParse$actions.makeRepeat(RegExp r,
int n1,
int n2,
int line,
int col) |
static boolean |
SemCheck.maybeEmtpy(RegExp re)
Checks if the expression potentially matches the empty string.
|
Constructor and Description |
---|
RegExp2(int type,
RegExp r1,
RegExp r2) |