Searched refs:FOLLOW (Results 1 – 7 of 7) sorted by relevance
385 * FOLLOW(b1_in_a) = FIRST(']') = ']'386 * FOLLOW(b2_in_a) = FIRST(')') = ')'387 * FOLLOW(c_in_b) = FIRST('^') = '^'404 * For error recovery, we cannot consider FOLLOW(c)406 * all context-sensitive FOLLOW sets--the set of all tokens that408 * resync to one of those tokens. Note that FOLLOW(c)='^' and if441 * Like Grosch I implemented local FOLLOW sets that are combined448 /** Compute the context-sensitive FOLLOW set for current rule.453 * definition of plain FOLLOW for rule r:455 * FOLLOW(r)={x | S=>*alpha r beta in G and x in FIRST(beta)}[all …]
31 * good enough to handle runtime requirements such as FOLLOW sets
550 * FOLLOW(b1_in_a) = FIRST(']') = ']'551 * FOLLOW(b2_in_a) = FIRST(')') = ')'552 * FOLLOW(c_in_b) = FIRST('^') = '^'569 * For error recovery, we cannot consider FOLLOW(c)571 * all context-sensitive FOLLOW sets--the set of all tokens that573 * resync to one of those tokens. Note that FOLLOW(c)='^' and if606 * Like Grosch I implemented local FOLLOW sets that are combined614 /** Compute the context-sensitive FOLLOW set for current rule.619 * definition of plain FOLLOW for rule r:621 * FOLLOW(r)={x | S=>*alpha r beta in G and x in FIRST(beta)}[all …]
158 public LookaheadSet FOLLOW(Rule r) { in FOLLOW() method in LL1Analyzer179 LookaheadSet f = FOLLOW(s.enclosingRule); in LOOK()
123 // find last link in FOLLOW chain emanating from rule598 // don't add FOLLOW transitions in the lexer;
676 * FOLLOW set computations altered constant FOLLOW bit sets.1075 * Moved FIRST/FOLLOW computations to a separate class LL1Analyzer to3135 * bitsets are dumped in hex not decimal now for FOLLOW sets
1494 * bitsets are dumped in hex not decimal now for FOLLOW sets