Lines Matching refs:grammar
84 !dfa.nfa.grammar.NFAToDFAConversionExternallyAborted() )
87 if ( dfa.nfa.grammar.composite.watchNFAConversion ) {
156 int numAltsIncludingExitBranch = dfa.nfa.grammar
252 if ( dfa.nfa.grammar.type==Grammar.LEXER && containsEOT ) {
253 String filterOption = (String)dfa.nfa.grammar.getOption("filter");
278 label.toString(dfa.nfa.grammar)+"->"+t);
295 // for analysis of Java grammar from 11.5s to 2s! Wow.
301 label.toString(dfa.nfa.grammar)+
413 //System.out.println(d.stateNumber+"-"+label.toString(dfa.nfa.grammar)+"->"+targetState.stateNumber);
420 //System.out.println("extra transition to "+tI+" upon "+label.toString(dfa.nfa.grammar));
433 //System.out.println("label updated to be "+oldTransition.label.toString(dfa.nfa.grammar));
505 * grammar from which it was built. We must add an implicit (i.e.,
516 * rule, r, in the grammar from which NFA was built. In this case,
739 dfa.nfa.grammar.getNFAStateForAltOfDecision(dfa.decisionNFAStartState,walkAlt);
806 * Changing back to Set from List. Changed a large grammar from 8 minutes
849 //System.out.println("reach "+label.toString(dfa.nfa.grammar)+" from "+d.stateNumber);
864 // by design of the grammar->NFA conversion, only transition 0
1039 * report a problem to the grammar designer and resolve the issue
1068 * Consider the following grammar where alts 1 and 2 are no
1080 * Here is a (slightly reduced) NFA of this grammar:
1331 * this amounts to suppressing grammar error messages to the
1450 // notify grammar that we've used the preds contained in semCtx
1452 dfa.nfa.grammar.synPredUsedInDFA(dfa, semCtx);
1582 FASerializer serializer = new FASerializer(dfa.nfa.grammar);
1600 " incident "+(s.incidentEdgeLabel!=null?s.incidentEdgeLabel.toString(dfa.nfa.grammar):null));