Examples of org.antlr.v4.runtime.atn.LexerActionExecutor

org.antlr.v4.codegen.model.LeftRecursiveRuleFunction
Represents an executor for a sequence of lexer actions which traversed during the matching operation of a lexer rule (token).
The executor tracks position information for position-dependent lexer actions efficiently, ensuring that actions appearing only at the end of the rule do not cause bloating of the {@link DFA} created for the lexer.
@author Sam Harwell @since 4.2


  @Override
  public Choice getComplexEBNFBlock(GrammarAST ebnfRoot, List<CodeBlockForAlt> alts) {
    int ebnf = 0;
    if ( ebnfRoot!=null ) ebnf = ebnfRoot.getType();
    Choice c = null;
    switch ( ebnf ) {
      case ANTLRParser.OPTIONAL :
        c = new OptionalBlock(this, ebnfRoot, alts);
        break;
      case ANTLRParser.CLOSURE :

View Full Code Here

  }


  @Override
  public CodeBlockForAlt alternative(Alternative alt, boolean outerMost) {
    if ( outerMost ) return new CodeBlockForOuterMostAlt(this, alt);
    return new CodeBlockForAlt(this);
  }

View Full Code Here

    return alternative(alt, outerMost);
  }


  @Override
  public CodeBlockForAlt alternative(Alternative alt, boolean outerMost) {
    if ( outerMost ) return new CodeBlockForOuterMostAlt(this, alt);
    return new CodeBlockForAlt(this);
  }

View Full Code Here

  @Override
  public List<SrcOp> sempred(ActionAST ast) { return list(new SemPred(this, ast)); }


  @Override
  public List<SrcOp> ruleRef(GrammarAST ID, GrammarAST label, GrammarAST args) {
    InvokeRule invokeOp = new InvokeRule(this, ID, label);
    // If no manual label and action refs as token/rule not label, we need to define implicit label
    if ( controller.needsImplicitLabel(ID, invokeOp) ) defineImplicitLabel(ID, invokeOp);
    AddToLabelList listLabelOp = getAddToListOpIfListLabelPresent(invokeOp, label);
    return list(invokeOp, listLabelOp);
  }

View Full Code Here

    return getComplexEBNFBlock(ebnfRoot, alts);
  }


  @Override
  public Choice getLL1ChoiceBlock(BlockAST blkAST, List<CodeBlockForAlt> alts) {
    return new LL1AltBlock(this, blkAST, alts);
  }

View Full Code Here

    if ( ebnfRoot!=null ) ebnf = ebnfRoot.getType();
    Choice c = null;
    switch ( ebnf ) {
      case ANTLRParser.OPTIONAL :
        if ( alts.size()==1 ) c = new LL1OptionalBlockSingleAlt(this, ebnfRoot, alts);
        else c = new LL1OptionalBlock(this, ebnfRoot, alts);
        break;
      case ANTLRParser.CLOSURE :
        if ( alts.size()==1 ) c = new LL1StarBlockSingleAlt(this, ebnfRoot, alts);
        else c = getComplexEBNFBlock(ebnfRoot, alts);
        break;

View Full Code Here

    int ebnf = 0;
    if ( ebnfRoot!=null ) ebnf = ebnfRoot.getType();
    Choice c = null;
    switch ( ebnf ) {
      case ANTLRParser.OPTIONAL :
        if ( alts.size()==1 ) c = new LL1OptionalBlockSingleAlt(this, ebnfRoot, alts);
        else c = new LL1OptionalBlock(this, ebnfRoot, alts);
        break;
      case ANTLRParser.CLOSURE :
        if ( alts.size()==1 ) c = new LL1StarBlockSingleAlt(this, ebnfRoot, alts);
        else c = getComplexEBNFBlock(ebnfRoot, alts);

View Full Code Here

      case ANTLRParser.CLOSURE :
        if ( alts.size()==1 ) c = new LL1StarBlockSingleAlt(this, ebnfRoot, alts);
        else c = getComplexEBNFBlock(ebnfRoot, alts);
        break;
      case ANTLRParser.POSITIVE_CLOSURE :
        if ( alts.size()==1 ) c = new LL1PlusBlockSingleAlt(this, ebnfRoot, alts);
        else c = getComplexEBNFBlock(ebnfRoot, alts);
        break;
    }
    return c;
  }

View Full Code Here

      case ANTLRParser.OPTIONAL :
        if ( alts.size()==1 ) c = new LL1OptionalBlockSingleAlt(this, ebnfRoot, alts);
        else c = new LL1OptionalBlock(this, ebnfRoot, alts);
        break;
      case ANTLRParser.CLOSURE :
        if ( alts.size()==1 ) c = new LL1StarBlockSingleAlt(this, ebnfRoot, alts);
        else c = getComplexEBNFBlock(ebnfRoot, alts);
        break;
      case ANTLRParser.POSITIVE_CLOSURE :
        if ( alts.size()==1 ) c = new LL1PlusBlockSingleAlt(this, ebnfRoot, alts);
        else c = getComplexEBNFBlock(ebnfRoot, alts);

View Full Code Here

  }


  @Override
  public RuleFunction rule(Rule r) {
    if ( r instanceof LeftRecursiveRule ) {
      return new LeftRecursiveRuleFunction(this, (LeftRecursiveRule)r);
    }
    else {
      RuleFunction rf = new RuleFunction(this, r);
      return rf;
    }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.antlr.v4.runtime.atn.LexerActionExecutor

org.antlr.runtime.ANTLRFileStream

org.antlr.runtime.ANTLRStringStream

org.antlr.runtime.CharStream

org.antlr.runtime.CommonToken

org.antlr.runtime.Token

org.antlr.runtime.tree.CommonTree

org.antlr.runtime.tree.CommonTreeNodeStream

org.antlr.runtime.tree.Tree

org.antlr.runtime.tree.TreeVisitor

org.antlr.runtime.tree.TreeVisitorAction

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.