Lines Matching defs:set
68 static void consumeUntilSet (pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_BITSET set);
206 // Free any rule memoization we set up
411 /// rule. Rule would recover by resynchronizing to the set of
464 // we just set the failed flag and return.
562 // follow set and does not indicate a missing token. We will just consume this
595 // and make them part of the follow set.
601 /// if current token is consistent with what could come after set
606 /// in follow set to indicate that the fall of the start symbol is
607 /// in the set (EOF can follow).
714 /// 3. consume until token found in resynch set
785 /// Compute the error recovery set for the current rule.
788 /// During rule invocation, the parser pushes the set of tokens that can
791 /// enclosing rule. This local follow set only includes tokens
801 /// You don't want the exact set of viable next tokens because the
815 /// At each rule invocation, the set of tokens that could follow
829 /// depth local follow set after call to rule
839 /// (context-sensitive or otherwise). We need the combined set of
840 /// all context-sensitive FOLLOW sets--the set of all tokens that
845 /// In this case, for input "[]", LA(1) is in this set so we would
850 /// set). The rule exception handler tries to recover, but finds
851 /// the same recovery set and doesn't consume anything. Rule b
856 /// for the token that was a member of the recovery set.
884 /// Compute the context-sensitive FOLLOW set for current rule.
887 /// This is the set of token types that can follow a specific rule
888 /// reference given a specific call chain. You get the set of
895 /// where x in T* and alpha, beta in V*; T is set of terminals and
896 /// V is the set of terminals and non terminals. In other words,
897 /// FOLLOW(r) is the set of all tokens that can possibly follow
901 /// than covering superset) set of following tokens.
932 /// You want the exact viable token set when recovering from a
934 /// the viable next token set, then you know there is most likely
971 // Only leave EOR in the set if at top (start rule); this lets us know
1192 // token set and the last token and so on. The error following
1193 // bitmaps do a good job of reducing the set that we were looking
1234 // This means we were able to deal with one of a set of
1236 // member of that set.
1251 // not useful to print ALL of the set here. I arbitrarily chose 8
1257 // TODO: This doesn;t look right - should be asking if the bit is set!!
1322 // Used to compute the follow set of tokens
1360 // where LT(1) is in the recovery token set so nothing is
1371 // Work out the follows set for error recovery
1379 // Consume tokens until we have resynced to something in the follows set
1424 /// is in the set of tokens that can follow the ')' token
1428 /// sorted in the recognizer exception stack in the C version. To 'throw' it we set the
1429 /// error flag and rules cascade back when this is set.
1613 /// This code is factored out from mismatched token and mismatched set
1657 /* The follow set is NULL, which means we don't know what can come
1665 /* We have a bitmap for the follow set, hence we can compute
1679 /* We now have the computed set of what can follow the current token
1683 /* We can now see if the current token works with the set of tokens
1763 /// belongs to the supplied set.
1766 consumeUntilSet (pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_BITSET set)
1805 while (ttype != ANTLR3_TOKEN_EOF && set->isMember(set, ttype) == ANTLR3_FALSE)
2146 // Install a new following set