37083709371037113712371337143715371637173718
if ( depth == GrammarAnalyzer.NONDETERMINISTIC ) { depth = grammar.maxk; } for (int i=1; i<=depth && i<=maxDepth; i++) { BitSet p = alt.cache[i].fset; if (p.degree() != 0) { return false; } } return true; }
44514452445344544455445644574458445944604461
983984985986987988989990991992993
*/ public static boolean lookaheadEquivForApproxAndFullAnalysis(Lookahead[] bset, int k) { // first k-1 sets degree 1? for (int i = 1; i <= k - 1; i++) { BitSet look = bset[i].fset; if (look.degree() > 1) { return false; } } return true; }
35043505350635073508350935103511351235133514
if (depth == GrammarAnalyzer.NONDETERMINISTIC) { depth = grammar.maxk; } for (int i = 1; i <= depth && i <= maxDepth; i++) { BitSet p = alt.cache[i].fset; if (p.degree() != 0) { return false; } } return true; }
34583459346034613462346334643465346634673468
41044105410641074108410941104111411241134114
964965966967968969970971972973974
36523653365436553656365736583659366036613662
32143215321632173218321932203221322232233224