Package org.antlr.analysis

Examples of org.antlr.analysis.NFAState

1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
    //System.out.println("### create DFAs");
    int numDecisions = getNumberOfDecisions();
    if ( NFAToDFAConverter.SINGLE_THREADED_NFA_CONVERSION ) {
      for (int decision=1; decision<=numDecisions; decision++) {
        NFAState decisionStartState = getDecisionNFAStartState(decision);
        if ( leftRecursiveRules.contains(decisionStartState.enclosingRule) ) {
          // don't bother to process decisions within left recursive rules.
          if ( composite.watchNFAConversion ) {
            System.out.println("ignoring decision "+decision+
                       " within left-recursive rule "+decisionStartState.enclosingRule.name);
          }
          continue;
        }
        if ( !externalAnalysisAbort && decisionStartState.getNumberOfTransitions()>1 ) {
          Rule r = decisionStartState.enclosingRule;
          if ( r.isSynPred && !synPredNamesUsedInDFA.contains(r.name) ) {
            continue;
          }
          DFA dfa = null;
View Full Code Here
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
  public DFA createLL_1_LookaheadDFA(int decision) {
    Decision d = getDecision(decision);
    String enclosingRule = d.startState.enclosingRule.name;
    Rule r = d.startState.enclosingRule;
    NFAState decisionStartState = getDecisionNFAStartState(decision);

    if ( composite.watchNFAConversion ) {
      System.out.println("--------------------\nattempting LL(1) DFA (d="
                 +decisionStartState.getDecisionNumber()+") for "+
                 decisionStartState.getDescription());
    }

    if ( r.isSynPred && !synPredNamesUsedInDFA.contains(enclosingRule) ) {
      return null;
    }

    // compute lookahead for each alt
    int numAlts = getNumberOfAltsForDecisionNFA(decisionStartState);
    LookaheadSet[] altLook = new LookaheadSet[numAlts+1];
    for (int alt = 1; alt <= numAlts; alt++) {
      int walkAlt =
        decisionStartState.translateDisplayAltToWalkAlt(alt);
      NFAState altLeftEdge = getNFAStateForAltOfDecision(decisionStartState, walkAlt);
      NFAState altStartState = (NFAState)altLeftEdge.transition[0].target;
      //System.out.println("alt "+alt+" start state = "+altStartState.stateNumber);
      altLook[alt] = ll1Analyzer.LOOK(altStartState);
      //System.out.println("alt "+alt+": "+altLook[alt].toString(this));
    }
View Full Code Here
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
    Decision d = getDecision(decision);
    String enclosingRule = d.startState.enclosingRule.name;
    Rule r = d.startState.enclosingRule;

    //System.out.println("createLookaheadDFA(): "+enclosingRule+" dec "+decision+"; synprednames prev used "+synPredNamesUsedInDFA);
    NFAState decisionStartState = getDecisionNFAStartState(decision);
    long startDFA=0,stopDFA;
    if ( composite.watchNFAConversion ) {
      System.out.println("--------------------\nbuilding lookahead DFA (d="
                 +decisionStartState.getDecisionNumber()+") for "+
                 decisionStartState.getDescription());
      startDFA = System.currentTimeMillis();
    }

    DFA lookaheadDFA = new DFA(decision, decisionStartState);
    // Retry to create a simpler DFA if analysis failed (non-LL(*),
 
View Full Code Here
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
    }
    return user_k;
  }

  public boolean getAutoBacktrackMode(int decision) {
    NFAState decisionNFAStartState = getDecisionNFAStartState(decision);
    String autoBacktrack =
      (String)getBlockOption(decisionNFAStartState.associatedASTNode, "backtrack");

    if ( autoBacktrack==null ) {
      autoBacktrack = (String)nfa.grammar.getOption("backtrack");
View Full Code Here
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
  public int getNumberOfAltsForDecisionNFA(NFAState decisionState) {
    if ( decisionState==null ) {
      return 0;
    }
    int n = 1;
    NFAState p = decisionState;
    while ( p.transition[1] !=null ) {
      n++;
      p = (NFAState)p.transition[1].target;
    }
    return n;
View Full Code Here
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
  public NFAState getNFAStateForAltOfDecision(NFAState decisionState, int alt) {
    if ( decisionState==null || alt<=0 ) {
      return null;
    }
    int n = 1;
    NFAState p = decisionState;
    while ( p!=null ) {
      if ( n==alt ) {
        return p;
      }
      n++;
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
                             listOfRecursiveCycles);
        // we're back from visiting that rule
        visitedDuringRecursionCheck.remove(refRuleDef);
        // must keep going in this rule then
        if ( callReachedAcceptState ) {
          NFAState followingState =
            ((RuleClosureTransition) t0).followState;
          stateReachesAcceptState |=
            traceStatesLookingForLeftRecursion(followingState,
                               visitedStates,
                               listOfRecursiveCycles);
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
      for (int i = 0; i < alts.size(); i++) {
        Integer altI = alts.get(i);
        String tokenName =
          probe.getTokenNameForTokensRuleAlt(altI);
        // reset the line/col to the token definition
        NFAState ruleStart =
          probe.dfa.nfa.grammar.getRuleStartState(tokenName);
        line = ruleStart.associatedASTNode.getLine();
        column = ruleStart.associatedASTNode.getCharPositionInLine();
        st.add("tokens", tokenName);
      }
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
                             listOfRecursiveCycles);
        // we're back from visiting that rule
        visitedDuringRecursionCheck.remove(refRuleDef);
        // must keep going in this rule then
        if ( callReachedAcceptState ) {
          NFAState followingState =
            ((RuleClosureTransition) t0).followState;
          stateReachesAcceptState |=
            traceStatesLookingForLeftRecursion(followingState,
                               visitedStates,
                               listOfRecursiveCycles);
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
      for (int i = 0; i < alts.size(); i++) {
        Integer altI = (Integer) alts.get(i);
        String tokenName =
          probe.getTokenNameForTokensRuleAlt(altI.intValue());
        // reset the line/col to the token definition
        NFAState ruleStart =
          probe.dfa.nfa.grammar.getRuleStartState(tokenName);
        line = ruleStart.associatedASTNode.getLine();
        column = ruleStart.associatedASTNode.getCharPositionInLine();
        st.add("tokens", tokenName);
      }
View Full Code Here
TOP

Related Classes of org.antlr.analysis.NFAState

  • org.antlr.tool.Grammar
  • org.antlr.tool.GrammarNonDeterminismMessage
  • org.antlr.tool.GrammarSanity
  • org.antlr.tool.GrammarUnreachableAltsMessage
  • org.antlr.tool.RandomPhrase
  • org.antlr.works.grammar.antlr.ANTLRGrammarEngineImpl
  • org.antlr.works.grammar.decisiondfa.DecisionDFAEngine
  • org.antlr.works.grammar.TokensDFA
  • org.antlr.works.visualization.fa.FAAnalysis
  • org.antlr.works.visualization.fa.FAFactory
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.