Examples of org.antlr.analysis.RuleClosureTransition

org.antlr.analysis.RuleClosureTransition
A transition used to reference another rule. It tracks two targets really: the actual transition target and the state following the state that refers to the other rule. Conversion of an NFA that falls off the end of a rule will be able to figure out who invoked that rule because of these special transitions.

        return transition instanceof RuleClosureTransition;
    }


    public String nameOfExternalReferencedRule(Transition transition) {
        if(transition instanceof RuleClosureTransition) {
            RuleClosureTransition rct = (RuleClosureTransition)transition;
            return g.getRuleName(rct.rule.index);
        } else
            return null;
    }

View Full Code Here

    }


    public NFAState targetStateOfTransition(Transition transition) {
        NFAState target;
        if(transition instanceof RuleClosureTransition) {
            RuleClosureTransition rct = (RuleClosureTransition)transition;
            target = rct.followState;
        } else {
            target = (NFAState)transition.target;
        }
        return target;

View Full Code Here

      // end of rule node
      if ( state.isAcceptState() ) {
        NFAState invokingState = ruleInvocationStack.pop();
        if ( debug ) System.out.println("pop invoking state "+invokingState);
        //System.out.println("leave "+state.enclosingRule.name);
        RuleClosureTransition invokingTransition =
          (RuleClosureTransition)invokingState.transition[0];
        // move to node after state that invoked this rule
        state = invokingTransition.followState;
        continue;
      }

View Full Code Here

    }
    visitedStates.add(s);
    boolean stateReachesAcceptState = false;
    Transition t0 = s.transition[0];
    if ( t0 instanceof RuleClosureTransition ) {
      RuleClosureTransition refTrans = (RuleClosureTransition)t0;
      Rule refRuleDef = refTrans.rule;
      //String targetRuleName = ((NFAState)t0.target).getEnclosingRule();
      if ( visitedDuringRecursionCheck.contains(refRuleDef) ) {
        // record left-recursive rule, but don't go back in
        grammar.leftRecursiveRules.add(refRuleDef);

View Full Code Here

    }
    visitedStates.add(s);
    boolean stateReachesAcceptState = false;
    Transition t0 = s.transition[0];
    if ( t0 instanceof RuleClosureTransition ) {
      RuleClosureTransition refTrans = (RuleClosureTransition)t0;
      Rule refRuleDef = refTrans.rule;
      //String targetRuleName = ((NFAState)t0.target).getEnclosingRule();
      if ( visitedDuringRecursionCheck.contains(refRuleDef) ) {
        // record left-recursive rule, but don't go back in
        grammar.leftRecursiveRules.add(refRuleDef);

View Full Code Here

      // end of rule node
      if ( state.isAcceptState() ) {
        NFAState invokingState = (NFAState)ruleInvocationStack.pop();
        if ( debug ) System.out.println("pop invoking state "+invokingState);
        //System.out.println("leave "+state.enclosingRule.name);
        RuleClosureTransition invokingTransition =
          (RuleClosureTransition)invokingState.transition[0];
        // move to node after state that invoked this rule
        state = invokingTransition.followState;
        continue;
      }

View Full Code Here

    }
    visitedStates.add(s);
    boolean stateReachesAcceptState = false;
    Transition t0 = s.transition[0];
    if ( t0 instanceof RuleClosureTransition ) {
      RuleClosureTransition refTrans = (RuleClosureTransition)t0;
      Rule refRuleDef = refTrans.rule;
      //String targetRuleName = ((NFAState)t0.target).getEnclosingRule();
      if ( visitedDuringRecursionCheck.contains(refRuleDef) ) {
        // record left-recursive rule, but don't go back in
        grammar.leftRecursiveRules.add(refRuleDef);

View Full Code Here

      }
      // end of rule node
      if ( state.isAcceptState() ) {
        NFAState invokingState = (NFAState)ruleInvocationStack.pop();
        // System.out.println("pop invoking state "+invokingState);
        RuleClosureTransition invokingTransition =
          (RuleClosureTransition)invokingState.transition(0);
        // move to node after state that invoked this rule
        state = invokingTransition.getFollowState();
        continue;
      }
      if ( state.getNumberOfTransitions()==1 ) {
        // no branching, just take this path
        Transition t0 = state.transition(0);

View Full Code Here

    }
    visitedStates.add(s);
    boolean stateReachesAcceptState = false;
    Transition t0 = s.transition[0];
    if ( t0 instanceof RuleClosureTransition ) {
      RuleClosureTransition refTrans = (RuleClosureTransition)t0;
      Rule refRuleDef = refTrans.rule;
      //String targetRuleName = ((NFAState)t0.target).getEnclosingRule();
      if ( visitedDuringRecursionCheck.contains(refRuleDef) ) {
        // record left-recursive rule, but don't go back in
        grammar.leftRecursiveRules.add(refRuleDef);

View Full Code Here

    }
    visitedStates.add(s);
    boolean stateReachesAcceptState = false;
    Transition t0 = s.transition[0];
    if ( t0 instanceof RuleClosureTransition ) {
      RuleClosureTransition refTrans = (RuleClosureTransition)t0;
      Rule refRuleDef = refTrans.rule;
      //String targetRuleName = ((NFAState)t0.target).getEnclosingRule();
      if ( visitedDuringRecursionCheck.contains(refRuleDef) ) {
        // record left-recursive rule, but don't go back in
        grammar.leftRecursiveRules.add(refRuleDef);

View Full Code Here

TOP

Related Classes of org.antlr.analysis.RuleClosureTransition

org.antlr.tool.GrammarSanity

org.antlr.tool.RandomPhrase

org.antlr.works.visualization.fa.FAFactory

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.