protected Set<Integer> getNonDeterministicAlts() { int user_k = dfa.getUserMaxLookahead(); if ( user_k>0 && user_k==k ) { // if fixed lookahead, then more than 1 alt is a nondeterminism // if we have hit the max lookahead return getAltSet(); } else if ( abortedDueToMultipleRecursiveAlts || abortedDueToRecursionOverflow ) { // if we had to abort for non-LL(*) state assume all alts are a problem return getAltSet(); } else { return getConflictingAlts(); } }
protected Set<Integer> getNonDeterministicAlts() { int user_k = dfa.getUserMaxLookahead(); if ( user_k>0 && user_k==k ) { // if fixed lookahead, then more than 1 alt is a nondeterminism // if we have hit the max lookahead return getAltSet(); } else if ( abortedDueToMultipleRecursiveAlts || abortedDueToRecursionOverflow ) { // if we had to abort for non-LL(*) state assume all alts are a problem return getAltSet(); } else { return getConflictingAlts(); } }
protected Set getNonDeterministicAlts() { int user_k = dfa.getUserMaxLookahead(); if ( user_k>0 && user_k==k ) { // if fixed lookahead, then more than 1 alt is a nondeterminism // if we have hit the max lookahead return getAltSet(); } else if ( abortedDueToMultipleRecursiveAlts || abortedDueToRecursionOverflow ) { // if we had to abort for non-LL(*) state assume all alts are a problem return getAltSet(); } else { return getConflictingAlts(); } }
protected Set getNonDeterministicAlts() { int user_k = dfa.getUserMaxLookahead(); if ( user_k>0 && user_k==k ) { // if fixed lookahead, then more than 1 alt is a nondeterminism // if we have hit the max lookahead return getAltSet(); } else if ( abortedDueToMultipleRecursiveAlts || abortedDueToRecursionOverflow ) { // if we had to abort for non-LL(*) state assume all alts are a problem return getAltSet(); } else { return getConflictingAlts(); } }
public static void danglingState(DecisionProbe probe, DFAState d) { getErrorState().errors++; Message msg = new GrammarDanglingStateMessage(probe,d); getErrorState().errorMsgIDs.add(msg.msgID); Set<String> seen = emitSingleError.get("danglingState"); if ( !seen.contains(d.dfa.decisionNumber+"|"+d.getAltSet()) ) { getErrorListener().error(msg); // we've seen this decision and this alt set; never again seen.add(d.dfa.decisionNumber+"|"+d.getAltSet()); } }
public static void danglingState(DecisionProbe probe, DFAState d) { getErrorState().errors++; Message msg = new GrammarDanglingStateMessage(probe,d); getErrorState().errorMsgIDs.add(msg.msgID); Set seen = (Set)emitSingleError.get("danglingState"); if ( !seen.contains(d.dfa.decisionNumber+"|"+d.getAltSet()) ) { getErrorListener().error(msg); // we've seen this decision and this alt set; never again seen.add(d.dfa.decisionNumber+"|"+d.getAltSet()); } }
public static void danglingState(DecisionProbe probe, DFAState d) { getErrorState().errors++; Message msg = new GrammarDanglingStateMessage(probe,d); getErrorState().errorMsgIDs.add(msg.msgID); Set<String> seen = emitSingleError.get("danglingState"); if ( !seen.contains(d.dfa.decisionNumber+"|"+d.getAltSet()) ) { getErrorListener().error(msg); // we've seen this decision and this alt set; never again seen.add(d.dfa.decisionNumber+"|"+d.getAltSet()); } }
public static void danglingState(DecisionProbe probe, DFAState d) { getErrorState().errors++; Message msg = new GrammarDanglingStateMessage(probe,d); getErrorState().errorMsgIDs.add(msg.msgID); Set seen = (Set)emitSingleError.get("danglingState"); if ( !seen.contains(d.dfa.decisionNumber+"|"+d.getAltSet()) ) { getErrorListener().error(msg); // we've seen this decision and this alt set; never again seen.add(d.dfa.decisionNumber+"|"+d.getAltSet()); } }
Set<Integer> alts = ((DFAState)s).getAltSet(); if ( alts!=null ) { buf.append("\\n");
Set alts = ((DFAState)s).getAltSet(); if ( alts!=null ) { buf.append("\\n");
Set alts = ((DFAState)s).getAltSet(); if ( alts!=null ) { buf.append("\\n");
Set<Integer> alts = ((DFAState)s).getAltSet(); if ( alts!=null ) { buf.append("\\n");
public String toString() { GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); line = decisionASTNode.getLine(); column = decisionASTNode.getColumn(); String fileName = probe.dfa.nfa.grammar.getFileName(); if ( fileName!=null ) { file = fileName; } List labels = probe.getSampleNonDeterministicInputSequence(problemState); String input = probe.getInputSequenceDisplay(labels); StringTemplate st = getMessageTemplate(); List alts = new ArrayList(); alts.addAll(problemState.getAltSet()); Collections.sort(alts); st.setAttribute("danglingAlts", alts); st.setAttribute("input", input); return super.toString(st); }
@Override public String toString() { GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); line = decisionASTNode.getLine(); column = decisionASTNode.getCharPositionInLine(); String fileName = probe.dfa.nfa.grammar.getFileName(); if ( fileName!=null ) { file = fileName; } List<Label> labels = probe.getSampleNonDeterministicInputSequence(problemState); String input = probe.getInputSequenceDisplay(labels); ST st = getMessageTemplate(); List<Integer> alts = new ArrayList<Integer>(); alts.addAll(problemState.getAltSet()); Collections.sort(alts); st.add("danglingAlts", alts); st.add("input", input); return super.toString(st); }
@Override public String toString() { GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); line = decisionASTNode.getLine(); column = decisionASTNode.getCharPositionInLine(); String fileName = probe.dfa.nfa.grammar.getFileName(); if ( fileName!=null ) { file = fileName; } List<Label> labels = probe.getSampleNonDeterministicInputSequence(problemState); String input = probe.getInputSequenceDisplay(labels); ST st = getMessageTemplate(); List<Integer> alts = new ArrayList<Integer>(); alts.addAll(problemState.getAltSet()); Collections.sort(alts); st.add("danglingAlts", alts); st.add("input", input); return super.toString(st); }
public String toString() { GrammarAST decisionASTNode = probe.dfa.getDecisionASTNode(); line = decisionASTNode.getLine(); column = decisionASTNode.getColumn(); String fileName = probe.dfa.nfa.grammar.getFileName(); if ( fileName!=null ) { file = fileName; } List labels = probe.getSampleNonDeterministicInputSequence(problemState); String input = probe.getInputSequenceDisplay(labels); StringTemplate st = getMessageTemplate(); List alts = new ArrayList(); alts.addAll(problemState.getAltSet()); Collections.sort(alts); st.setAttribute("danglingAlts", alts); st.setAttribute("input", input); return super.toString(st); }
Set<Integer> allAlts = d.getAltSet();
Set allAlts = d.getAltSet();
Set<Integer> allAlts = d.getAltSet();
Set allAlts = d.getAltSet();