int LA29_5 = input.LA(1); int index29_5 = input.index(); input.rewind(); s = -1;
int LA28_5 = input.LA(1); int index28_5 = input.index(); input.rewind(); s = -1;
/** Record whether or not this rule parsed the input at this position * successfully. Use a standard java hashtable for now. */ public void memoize(IntStream input, int ruleIndex, int ruleStartIndex) { int stopTokenIndex = state.failed?MEMO_RULE_FAILED:input.index()-1; if ( state.ruleMemo==null ) { System.err.println("!!!!!!!!! memo array is null for "+ getGrammarFileName()); } if ( ruleIndex >= state.ruleMemo.length ) { System.err.println("!!!!!!!!! memo size is "+state.ruleMemo.length+", but rule index is "+ruleIndex); } if ( state.ruleMemo[ruleIndex]!=null ) { state.ruleMemo[ruleIndex].put(ruleStartIndex, stopTokenIndex); } }
/** Record whether or not this rule parsed the input at this position * successfully. Use a standard java hashtable for now. */ public void memoize(IntStream input, int ruleIndex, int ruleStartIndex) { int stopTokenIndex = state.failed?MEMO_RULE_FAILED:input.index()-1; if ( state.ruleMemo==null ) { System.err.println("!!!!!!!!! memo array is null for "+ getGrammarFileName()); } if ( ruleIndex >= state.ruleMemo.length ) { System.err.println("!!!!!!!!! memo size is "+state.ruleMemo.length+", but rule index is "+ruleIndex); } if ( state.ruleMemo[ruleIndex]!=null ) { state.ruleMemo[ruleIndex].put(ruleStartIndex, stopTokenIndex); } }
/** Record whether or not this rule parsed the input at this position * successfully. Use a standard java hashtable for now. */ public void memoize(IntStream input, int ruleIndex, int ruleStartIndex) { int stopTokenIndex = state.failed?MEMO_RULE_FAILED:input.index()-1; if ( state.ruleMemo==null ) { System.err.println("!!!!!!!!! memo array is null for "+ getGrammarFileName()); } if ( ruleIndex >= state.ruleMemo.length ) { System.err.println("!!!!!!!!! memo size is "+state.ruleMemo.length+", but rule index is "+ruleIndex); } if ( state.ruleMemo[ruleIndex]!=null ) { state.ruleMemo[ruleIndex].put(ruleStartIndex, stopTokenIndex); } }
/** Record whether or not this rule parsed the input at this position * successfully. Use a standard java hashtable for now. */ public void memoize(IntStream input, int ruleIndex, int ruleStartIndex) { int stopTokenIndex = state.failed?MEMO_RULE_FAILED:input.index()-1; if ( state.ruleMemo==null ) { System.err.println("!!!!!!!!! memo array is null for "+ getGrammarFileName()); } if ( ruleIndex >= state.ruleMemo.length ) { System.err.println("!!!!!!!!! memo size is "+state.ruleMemo.length+", but rule index is "+ruleIndex); } if ( state.ruleMemo[ruleIndex]!=null ) { state.ruleMemo[ruleIndex].put(ruleStartIndex, stopTokenIndex); } }
/** Record whether or not this rule parsed the input at this position * successfully. Use a standard java hashtable for now. */ public void memoize(IntStream input, int ruleIndex, int ruleStartIndex) { int stopTokenIndex = state.failed?MEMO_RULE_FAILED:input.index()-1; if ( state.ruleMemo==null ) { System.err.println("!!!!!!!!! memo array is null for "+ getGrammarFileName()); } if ( ruleIndex >= state.ruleMemo.length ) { System.err.println("!!!!!!!!! memo size is "+state.ruleMemo.length+", but rule index is "+ruleIndex); } if ( state.ruleMemo[ruleIndex]!=null ) { state.ruleMemo[ruleIndex].put(ruleStartIndex, stopTokenIndex); } }
/** Record whether or not this rule parsed the input at this position * successfully. Use a standard java hashtable for now. */ public void memoize(IntStream input, int ruleIndex, int ruleStartIndex) { int stopTokenIndex = state.failed?MEMO_RULE_FAILED:input.index()-1; if ( state.ruleMemo==null ) { System.err.println("!!!!!!!!! memo array is null for "+ getGrammarFileName()); } if ( ruleIndex >= state.ruleMemo.length ) { System.err.println("!!!!!!!!! memo size is "+state.ruleMemo.length+", but rule index is "+ruleIndex); } if ( state.ruleMemo[ruleIndex]!=null ) { state.ruleMemo[ruleIndex].put( new Integer(ruleStartIndex), new Integer(stopTokenIndex) ); } }
/** Recover from an error found on the input stream. This is * for NoViableAlt and mismatched symbol exceptions. If you enable * single token insertion and deletion, this will usually not * handle mismatched symbol exceptions but there could be a mismatched * token that the match() routine could not recover from. */ public void recover(IntStream input, RecognitionException re) { if ( state.lastErrorIndex==input.index() ) { // uh oh, another error at same token index; must be a case // where LT(1) is in the recovery token set so nothing is // consumed; consume a single token so at least to prevent // an infinite loop; this is a failsafe. input.consume(); } state.lastErrorIndex = input.index(); BitSet followSet = computeErrorRecoverySet(); beginResync(); consumeUntil(input, followSet); endResync(); }
/** Recover from an error found on the input stream. This is * for NoViableAlt and mismatched symbol exceptions. If you enable * single token insertion and deletion, this will usually not * handle mismatched symbol exceptions but there could be a mismatched * token that the match() routine could not recover from. */ public void recover(IntStream input, RecognitionException re) { if ( state.lastErrorIndex==input.index() ) { // uh oh, another error at same token index; must be a case // where LT(1) is in the recovery token set so nothing is // consumed; consume a single token so at least to prevent // an infinite loop; this is a failsafe. input.consume(); } state.lastErrorIndex = input.index(); BitSet followSet = computeErrorRecoverySet(); beginResync(); consumeUntil(input, followSet); endResync(); }
/** Recover from an error found on the input stream. This is * for NoViableAlt and mismatched symbol exceptions. If you enable * single token insertion and deletion, this will usually not * handle mismatched symbol exceptions but there could be a mismatched * token that the match() routine could not recover from. */ public void recover(IntStream input, RecognitionException re) { if ( state.lastErrorIndex==input.index() ) { // uh oh, another error at same token index; must be a case // where LT(1) is in the recovery token set so nothing is // consumed; consume a single token so at least to prevent // an infinite loop; this is a failsafe. input.consume(); } state.lastErrorIndex = input.index(); BitSet followSet = computeErrorRecoverySet(); beginResync(); consumeUntil(input, followSet); endResync(); }
/** Recover from an error found on the input stream. This is * for NoViableAlt and mismatched symbol exceptions. If you enable * single token insertion and deletion, this will usually not * handle mismatched symbol exceptions but there could be a mismatched * token that the match() routine could not recover from. */ public void recover(IntStream input, RecognitionException re) { if ( state.lastErrorIndex==input.index() ) { // uh oh, another error at same token index; must be a case // where LT(1) is in the recovery token set so nothing is // consumed; consume a single token so at least to prevent // an infinite loop; this is a failsafe. input.consume(); } state.lastErrorIndex = input.index(); BitSet followSet = computeErrorRecoverySet(); beginResync(); consumeUntil(input, followSet); endResync(); }
/** Recover from an error found on the input stream. This is * for NoViableAlt and mismatched symbol exceptions. If you enable * single token insertion and deletion, this will usually not * handle mismatched symbol exceptions but there could be a mismatched * token that the match() routine could not recover from. */ public void recover(IntStream input, RecognitionException re) { if ( state.lastErrorIndex==input.index() ) { // uh oh, another error at same token index; must be a case // where LT(1) is in the recovery token set so nothing is // consumed; consume a single token so at least to prevent // an infinite loop; this is a failsafe. input.consume(); } state.lastErrorIndex = input.index(); BitSet followSet = computeErrorRecoverySet(); beginResync(); consumeUntil(input, followSet); endResync(); }
/** Recover from an error found on the input stream. This is * for NoViableAlt and mismatched symbol exceptions. If you enable * single token insertion and deletion, this will usually not * handle mismatched symbol exceptions but there could be a mismatched * token that the match() routine could not recover from. */ public void recover(IntStream input, RecognitionException re) { if ( state.lastErrorIndex==input.index() ) { // uh oh, another error at same token index; must be a case // where LT(1) is in the recovery token set so nothing is // consumed; consume a single token so at least to prevent // an infinite loop; this is a failsafe. input.consume(); } state.lastErrorIndex = input.index(); BitSet followSet = computeErrorRecoverySet(); beginResync(); consumeUntil(input, followSet); endResync(); }
public RecognitionException(IntStream input) { this.input = input; this.index = input.index(); if ( input instanceof TokenStream ) { this.token = ((TokenStream)input).LT(1); this.line = token.getLine(); this.charPositionInLine = token.getCharPositionInLine(); } if ( input instanceof TreeNodeStream ) { extractInformationFromTreeNodeStream(input); } else if ( input instanceof CharStream ) { this.c = input.LA(1); this.line = ((CharStream)input).getLine(); this.charPositionInLine = ((CharStream)input).getCharPositionInLine(); } else { this.c = input.LA(1); } }
public RecognitionException(IntStream input) { this.input = input; this.index = input.index(); if ( input instanceof TokenStream ) { this.token = ((TokenStream)input).LT(1); this.line = token.getLine(); this.charPositionInLine = token.getCharPositionInLine(); } if ( input instanceof TreeNodeStream ) { extractInformationFromTreeNodeStream(input); } else if ( input instanceof CharStream ) { this.c = input.LA(1); this.line = ((CharStream)input).getLine(); this.charPositionInLine = ((CharStream)input).getCharPositionInLine(); } else { this.c = input.LA(1); } }
public RecognitionException(IntStream input) { this.input = input; this.index = input.index(); if ( input instanceof TokenStream ) { this.token = ((TokenStream)input).LT(1); this.line = token.getLine(); this.charPositionInLine = token.getCharPositionInLine(); } if ( input instanceof TreeNodeStream ) { extractInformationFromTreeNodeStream(input); } else if ( input instanceof CharStream ) { this.c = input.LA(1); this.line = ((CharStream)input).getLine(); this.charPositionInLine = ((CharStream)input).getCharPositionInLine(); } else { this.c = input.LA(1); } }
public RecognitionException(IntStream input) { this.input = input; this.index = input.index(); if ( input instanceof TokenStream ) { this.token = ((TokenStream)input).LT(1); this.line = token.getLine(); this.charPositionInLine = token.getCharPositionInLine(); } if ( input instanceof TreeNodeStream ) { extractInformationFromTreeNodeStream(input); } else if ( input instanceof CharStream ) { this.c = input.LA(1); this.line = ((CharStream)input).getLine(); this.charPositionInLine = ((CharStream)input).getCharPositionInLine(); } else { this.c = input.LA(1); } }
public RecognitionException(IntStream input) { this.input = input; this.index = input.index(); if ( input instanceof TokenStream ) { this.token = ((TokenStream)input).LT(1); this.line = token.getLine(); this.charPositionInLine = token.getCharPositionInLine(); } if ( input instanceof TreeNodeStream ) { extractInformationFromTreeNodeStream(input); } else if ( input instanceof CharStream ) { this.c = input.LA(1); this.line = ((CharStream)input).getLine(); this.charPositionInLine = ((CharStream)input).getCharPositionInLine(); } else { this.c = input.LA(1); } }
public RecognitionException(IntStream input) { this.input = input; this.index = input.index(); if ( input instanceof TokenStream ) { this.token = ((TokenStream)input).LT(1); this.line = token.getLine(); this.charPositionInLine = token.getCharPositionInLine(); } if ( input instanceof TreeNodeStream ) { extractInformationFromTreeNodeStream(input); } else if ( input instanceof CharStream ) { this.c = input.LA(1); this.line = ((CharStream)input).getLine(); this.charPositionInLine = ((CharStream)input).getCharPositionInLine(); } else { this.c = input.LA(1); } }