Package org.antlr.analysis

Examples of org.antlr.analysis.DFA

70
71
72
73
74
75
76
77
78
79
80
        Grammar g = new Grammar(
                "lexer grammar t;\n"+
                "A : 'a' 'b' | 'a' 'c' | 'd' 'e' ;");
    g.buildNFA();
        g.createLookaheadDFAs(false);
        DFA dfa = g.getLookaheadDFA(1);
        checkPrediction(dfa,"ab",1);
        checkPrediction(dfa,"ac",2);
        checkPrediction(dfa,"de",3);
        checkPrediction(dfa,"q", NFA.INVALID_ALT_NUMBER);
    }
View Full Code Here
84
85
86
87
88
89
90
91
92
93
                "lexer grammar t;\n"+
                "A : (DIGIT)+ '.' DIGIT | (DIGIT)+ ;\n" +
                "fragment DIGIT : '0'..'9' ;\n");
    g.buildNFA();
        g.createLookaheadDFAs(false);
        DFA dfa = g.getLookaheadDFA(3);
        checkPrediction(dfa,"32",2);
        checkPrediction(dfa,"999.2",1);
        checkPrediction(dfa,".2", NFA.INVALID_ALT_NUMBER);
    }
View Full Code Here
290
291
292
293
294
295
296
297
298
299
300
  protected String getDFALocations(Set dfas) {
    Set decisions = new HashSet();
    StringBuffer buf = new StringBuffer();
    Iterator it = dfas.iterator();
    while ( it.hasNext() ) {
      DFA dfa = (DFA) it.next();
      // if we aborted a DFA and redid with k=1, the backtrackin
      if ( decisions.contains(Utils.integer(dfa.decisionNumber)) ) {
        continue;
      }
      decisions.add(Utils.integer(dfa.decisionNumber));
View Full Code Here
257
258
259
260
261
262
263
264
265
266
267
    if ( g.getNumberOfDecisions()==0 ) {
      g.buildNFA();
      g.createLookaheadDFAs(false);
    }

    DFA dfa = g.getLookaheadDFA(1);
    assertEquals(null, dfa); // can't analyze.

    /*
    String result = serializer.serialize(dfa.startState);
    assertEquals(expecting, result);
View Full Code Here
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
    }

    assertEquals("unexpected number of expected problems",
           expectingNumWarnings, equeue.size());

    DFA dfa = g.getLookaheadDFA(decision);
    FASerializer serializer = new FASerializer(g);
    String result = serializer.serialize(dfa.startState);
    //System.out.print(result);
    List unreachableAlts = dfa.getUnreachableAlts();

    // make sure unreachable alts are as expected
    if ( expectingUnreachableAlts!=null ) {
      BitSet s = new BitSet();
      s.addAll(expectingUnreachableAlts);
View Full Code Here
740
741
742
743
744
745
746
747
748
749
  }

  protected ST genSemanticPredicateExpr(STGroup templates,
                            Transition edge)
  {
    DFA dfa = ((DFAState)edge.target).dfa; // which DFA are we in
    Label label = edge.label;
    SemanticContext semCtx = label.getSemanticContext();
    return semCtx.genExpr(this,templates,dfa);
  }
View Full Code Here
218
219
220
221
222
223
224
225
226
227
    // This is ok because we've already verified there are no problems
    // with the enter/exit decision
    DFAOptimizer optimizer = new DFAOptimizer(g);
    optimizer.optimize();
    FASerializer serializer = new FASerializer(g);
    DFA dfa = g.getLookaheadDFA(1);
    String result = serializer.serialize(dfa.startState);
    expecting = ".s0-'x'->:s1=>1\n";
    assertEquals(expecting, result);
  }
View Full Code Here
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
      g.setCodeGenerator(generator);
      g.buildNFA();
      g.createLookaheadDFAs(false);
    }

    DFA dfa = g.getLookaheadDFA(decision);
    assertNotNull("unknown decision #"+decision, dfa);
    FASerializer serializer = new FASerializer(g);
    String result = serializer.serialize(dfa.startState);
    //System.out.print(result);
    List nonDetAlts = dfa.getUnreachableAlts();
    //System.out.println("alts w/o predict state="+nonDetAlts);

    // first make sure nondeterministic alts are as expected
    if ( expectingUnreachableAlts==null ) {
      if ( nonDetAlts!=null && nonDetAlts.size()!=0 ) {
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
        Grammar g = new Grammar(
                "lexer grammar t;\n"+
                "A : {;}'a' | 'b' | 'c';");
    g.createNFAs();
    g.createLookaheadDFAs();
        DFA dfa = g.getLookaheadDFA(1);
        checkPrediction(dfa,"a",1);
        checkPrediction(dfa,"b",2);
        checkPrediction(dfa,"c",3);
        checkPrediction(dfa,"d", NFA.INVALID_ALT_NUMBER);
    }
View Full Code Here
55
56
57
58
59
60
61
62
63
64
65
        Grammar g = new Grammar(
                "lexer grammar t;\n"+
                "A : {;}'a'..'z' | ';' | '0'..'9' ;");
    g.createNFAs();
        g.createLookaheadDFAs();
        DFA dfa = g.getLookaheadDFA(1);
        checkPrediction(dfa,"a",1);
        checkPrediction(dfa,"q",1);
        checkPrediction(dfa,"z",1);
        checkPrediction(dfa,";",2);
        checkPrediction(dfa,"9",3);
View Full Code Here
TOP

Related Classes of org.antlr.analysis.DFA

  • org.antlr.codegen.CodeGenerator
  • org.antlr.misc.IntervalSet
  • org.antlr.stringtemplate.StringTemplate
  • org.antlr.test.TestCharDFAConversion
  • org.antlr.test.TestDFAConversion
  • org.antlr.test.TestDFAMatching
  • org.antlr.test.TestSemanticPredicates
  • org.antlr.tool.Grammar
  • org.antlr.tool.GrammarReport
  • org.antlr.tool.Interpreter
    • 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.