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

org.antlr.v4.runtime.atn.ATNState
The following images show the relation of states and {@link ATNState#transitions} for various grammar constructs.
- Solid edges marked with an ε indicate a required {@link EpsilonTransition}.
- Dashed edges indicate locations where any transition derived from {@link Transition} might appear.
- Dashed nodes are place holders for either a sequence of linked {@link BasicState} states or the inclusion of a block representing a nestedconstruct in one of the forms below.
- Nodes showing multiple outgoing alternatives with a {@code ...} supportany number of alternatives (one or more). Nodes without the {@code ...} onlysupport the exact number of alternatives shown in the diagram.
Basic Blocks

Rule

Block of 1 or more alternatives

Greedy Loops

Greedy Closure: {@code (...)*}

Greedy Positive Closure: {@code (...)+}

Greedy Optional: {@code (...)?}

Non-Greedy Loops

Non-Greedy Closure: {@code (...)*?}

Non-Greedy Positive Closure: {@code (...)+?}

Non-Greedy Optional: {@code (...)??}


  /** From label {@code A} build graph {@code o-A->o}. */
  @NotNull
  @Override
  public Handle tokenRef(@NotNull TerminalAST node) {
    ATNState left = newState(node);
    ATNState right = newState(node);
    int ttype = g.getTokenType(node.getText());
    left.addTransition(new AtomTransition(right, ttype));
    node.atnState = left;
    return new Handle(left, right);
  }

View Full Code Here

   *  This also handles {@code ~A}, converted to {@code ~{A}} set.
     */
  @NotNull
  @Override
  public Handle set(@NotNull GrammarAST associatedAST, @NotNull List<GrammarAST> terminals, boolean invert) {
    ATNState left = newState(associatedAST);
    ATNState right = newState(associatedAST);
    IntervalSet set = new IntervalSet();
    for (GrammarAST t : terminals) {
      int ttype = g.getTokenType(t.getText());
      set.add(ttype);
    }

View Full Code Here

    if ( r==null ) {
      g.tool.errMgr.grammarError(ErrorType.INTERNAL_ERROR, g.fileName, node.getToken(), "Rule "+node.getText()+" undefined");
      return null;
    }
    RuleStartState start = atn.ruleToStartState[r.index];
    ATNState left = newState(node);
    ATNState right = newState(node);
    int precedence = 0;
    if (((GrammarASTWithOptions)node).getOptionString(LeftRecursiveRuleTransformer.PRECEDENCE_OPTION_NAME) != null) {
      precedence = Integer.parseInt(((GrammarASTWithOptions)node).getOptionString(LeftRecursiveRuleTransformer.PRECEDENCE_OPTION_NAME));
    }
    RuleTransition call = new RuleTransition(start, r.index, precedence, right);

View Full Code Here


  /** From an empty alternative build {@code o-e->o}. */
  @NotNull
  @Override
  public Handle epsilon(@NotNull GrammarAST node) {
    ATNState left = newState(node);
    ATNState right = newState(node);
    epsilon(left, right);
    node.atnState = left;
    return new Handle(left, right);
  }

View Full Code Here

   */
  @NotNull
  @Override
  public Handle sempred(@NotNull PredAST pred) {
    //System.out.println("sempred: "+ pred);
    ATNState left = newState(pred);
    ATNState right = newState(pred);


    AbstractPredicateTransition p;
    if (pred.getOptionString(LeftRecursiveRuleTransformer.PRECEDENCE_OPTION_NAME) != null) {
      int precedence = Integer.parseInt(pred.getOptionString(LeftRecursiveRuleTransformer.PRECEDENCE_OPTION_NAME));
      p = new PrecedencePredicateTransition(right, precedence);

View Full Code Here

   */
  @NotNull
  @Override
  public Handle action(@NotNull ActionAST action) {
    //System.out.println("action: "+action);
    ATNState left = newState(action);
    ATNState right = newState(action);
    ActionTransition a = new ActionTransition(right, currentRule.index);
    left.addTransition(a);
    action.atnState = left;
    return new Handle(left, right);
  }

View Full Code Here

   */
  @NotNull
  @Override
  public Handle optional(@NotNull GrammarAST optAST, @NotNull Handle blk) {
    BlockStartState blkStart = (BlockStartState)blk.left;
    ATNState blkEnd = blk.right;
    preventEpsilonOptionalBlocks.add(new Triple<Rule, ATNState, ATNState>(currentRule, blkStart, blkEnd));


    boolean greedy = ((QuantifierAST)optAST).isGreedy();
    blkStart.nonGreedy = !greedy;
    epsilon(blkStart, blk.right, !greedy);

View Full Code Here


  /** Build an atom with all possible values in its label. */
  @NotNull
  @Override
  public Handle wildcard(@NotNull GrammarAST node) {
    ATNState left = newState(node);
    ATNState right = newState(node);
    left.addTransition(new WildcardTransition(right));
    node.atnState = left;
    return new Handle(left, right);
  }

View Full Code Here

   *  not invoked by another rule (they can only be invoked from outside).
   *  These are the start rules.
     */
  public int addEOFTransitionToStartRules() {
    int n = 0;
    ATNState eofTarget = newState(null); // one unique EOF target for all rules
    for (Rule r : g.rules.values()) {
      ATNState stop = atn.ruleToStopState[r.index];
      if ( stop.getNumberOfTransitions()>0 ) continue;
      n++;
      Transition t = new AtomTransition(eofTarget, Token.EOF);
      stop.addTransition(t);
    }
    return n;
  }

View Full Code Here

    throw new UnsupportedOperationException(message, cause);
  }


  @NotNull
  public ATNState newState(@Nullable GrammarAST node) {
    ATNState n = new BasicState();
    n.setRuleIndex(currentRule.index);
    atn.addState(n);
    return n;
  }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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

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.

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

Basic Blocks

Rule

Block of 1 or more alternatives

Greedy Loops

Greedy Closure: {@code (...)*}

Greedy Positive Closure: {@code (...)+}

Greedy Optional: {@code (...)?}

Non-Greedy Loops

Non-Greedy Closure: {@code (...)*?}

Non-Greedy Positive Closure: {@code (...)+?}

Non-Greedy Optional: {@code (...)??}

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