Package net.sourceforge.chaperon.model.grammar

Examples of net.sourceforge.chaperon.model.grammar.Production

484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
      if (reduceactions.length>0)
      {
        for (int i = 0; i<reduceactions.length; i++)
        {
          Production production = reduceactions[i].production;

          if ((log!=null) && (log.isDebugEnabled()))
            log.debug(
            /*"State "+node.state+*/
            " reduce "+production.getSymbol());

          /*+
                                   " ("+production+")");*/
          ProductionNode productionnode = new ProductionNode(production);
          TreeNode[] descendants = new TreeNode[production.getDefinition().getSymbolCount()];

          StateNode ancestor = statenode;

          for (int j = production.getDefinition().getSymbolCount()-1; j>=0; j--)
          {
            descendants[j] = ancestor.treenode;
            ancestor = ancestor.ancestor;
          }

View Full Code Here
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
      if (reduceactions.length>0)
      {
        for (int i = 0; i<reduceactions.length; i++)
        {
          Production production = reduceactions[i].production;

          ProductionNode productionnode = new ProductionNode(production);
          TreeNode[] descendants = new TreeNode[production.getDefinition().getSymbolCount()];

          StateNode ancestor = statenode;

          for (int j = production.getDefinition().getSymbolCount()-1; j>=0; j--)
          {
            descendants[j] = ancestor.treenode;
            ancestor = ancestor.ancestor;
          }

          productionnode.descendants = descendants;

          ShiftAction shiftaction = ancestor.state.getShiftAction(productionnode.symbol);

          //System.out.println("current state:\n"+ancestor.state+"\ntransition for "+productionnode.symbol+" = "+shiftaction);
          if ((automaton.getState(0)==ancestor.state) &&
              (productionnode.symbol.equals(grammar.getStartSymbol())))
          {
            if ((log!=null) && (log.isDebugEnabled()))
              log.debug("State "+state+" accept");

            StateNode newstatenode = getStateNode(next, null, ancestor);

            if (newstatenode==null)
            {
              newstatenode = new StateNode(null, ancestor, productionnode);
              next.push(newstatenode);
            }
            else
            {
              System.out.println("merging state node");

              ProductionNode oldproductionnode = (ProductionNode)newstatenode.treenode;

              if (grammar.getPriority(oldproductionnode.production)>grammar.getPriority(production))
              {
                System.out.println("priority("+production+") < priority("+
                                   oldproductionnode.production+")");
                newstatenode.treenode = productionnode;
              }
              else
                System.out.println("priority("+production+") >= priority("+
                                   oldproductionnode.production+")");
            }
          }
          else
          {
            if ((log!=null) && (log.isDebugEnabled()))
              log.debug(
              /*"State "+node.state+*/
              " reduce "+production.getSymbol()+" ("+production+")");

            /*          StateNode newstatenode = new
            StateNode(ancestor.state.getShiftAction(productionnode.symbol).state, ancestor, productionnode);

                      current.push(newstatenode);*/
 
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
    F = new Nonterminal("F");

    grammar = new Grammar();

    // E -> E + T
    Production production = new Production(E);
    production.getDefinition().addSymbol(E);
    production.getDefinition().addSymbol(plus);
    production.getDefinition().addSymbol(T);
    grammar.addProduction(production);

    // E -> T
    production = new Production(E);
    production.getDefinition().addSymbol(T);
    grammar.addProduction(production);

    // T -> T * F
    production = new Production(T);
    production.getDefinition().addSymbol(T);
    production.getDefinition().addSymbol(mult);
    production.getDefinition().addSymbol(F);
    grammar.addProduction(production);

    // T -> F
    production = new Production(T);
    production.getDefinition().addSymbol(F);
    grammar.addProduction(production);

    // F -> ( E )
    production = new Production(F);
    production.getDefinition().addSymbol(bopen);
    production.getDefinition().addSymbol(E);
    production.getDefinition().addSymbol(bclose);
    grammar.addProduction(production);

    production = new Production(F);
    production.getDefinition().addSymbol(id);
    grammar.addProduction(production);

    grammar.setStartSymbol(E);
  }
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
  public boolean contains(State state)
  {
    int i;
    int j;
    int position;
    Production production;
    boolean found;

    for (i = 0; i<state.productions.length; i++)
    {
      production = state.productions[i];
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
    grammar = new Grammar();

    grammar.setStartSymbol(E);

    // E -> T E'
    Production production = new Production(E);
    production.getDefinition().addSymbol(T);
    production.getDefinition().addSymbol(Eprime);
    grammar.addProduction(production);

    // E' -> + T E'
    production = new Production(Eprime);
    production.getDefinition().addSymbol(plus);
    production.getDefinition().addSymbol(T);
    production.getDefinition().addSymbol(Eprime);
    grammar.addProduction(production);

    // E' ->
    production = new Production(Eprime);
    grammar.addProduction(production);

    // T -> F T'
    production = new Production(T);
    production.getDefinition().addSymbol(F);
    production.getDefinition().addSymbol(Tprime);
    grammar.addProduction(production);

    // T' -> * F T'
    production = new Production(Tprime);
    production.getDefinition().addSymbol(mult);
    production.getDefinition().addSymbol(F);
    production.getDefinition().addSymbol(Tprime);
    grammar.addProduction(production);

    // T' ->
    production = new Production(Tprime);
    grammar.addProduction(production);

    // F -> bopen E bclose
    production = new Production(F);
    production.getDefinition().addSymbol(bopen);
    production.getDefinition().addSymbol(E);
    production.getDefinition().addSymbol(bclose);
    grammar.addProduction(production);

    // F -> id
    production = new Production(F);
    production.getDefinition().addSymbol(id);
    grammar.addProduction(production);
  }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
    F = new Nonterminal("F");
    G = new Nonterminal("G");

    grammar = new Grammar();

    p1 = new Production(F);
    p1.getDefinition().addSymbol(E);
    p1.getDefinition().addSymbol(a);
    p1.getDefinition().addSymbol(E);
    grammar.addProduction(p1);

    p2 = new Production(F);
    p2.getDefinition().addSymbol(E);
    p2.getDefinition().addSymbol(b);
    p2.getDefinition().addSymbol(E);
    grammar.addProduction(p2);

    p3 = new Production(G);
    p3.getDefinition().addSymbol(E);
    p3.getDefinition().addSymbol(F);
    grammar.addProduction(p3);
  }
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
79
80
81
    assertTrue("Test if grammar contains productions", grammar.contains(p1));
    assertTrue("Test if grammar contains productions", grammar.contains(p2));

    assertTrue("Test if production are not equal", !p1.equals(p2));

    Production p3 = new Production(F);
    p3.getDefinition().addSymbol(E);
    p3.getDefinition().addSymbol(a);
    p3.getDefinition().addSymbol(E);

    assertEquals("Test if production are equal", p1, p3);
    assertTrue("Test if grammar contains productions", grammar.contains(p3));

    assertEquals("Test production indices", 0, grammar.indexOf(p1));
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
    S = new Nonterminal("S");
    C = new Nonterminal("C");

    grammar = new Grammar();

    Production production = new Production(S);
    production.getDefinition().addSymbol(C);
    production.getDefinition().addSymbol(C);
    grammar.addProduction(production);

    production = new Production(C);
    production.getDefinition().addSymbol(c);
    production.getDefinition().addSymbol(C);
    grammar.addProduction(production);

    production = new Production(C);
    production.getDefinition().addSymbol(d);
    grammar.addProduction(production);

    grammar.setStartSymbol(S);

    firstsets = new FirstSetCollection(grammar);
View Full Code Here
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
    Nonterminal C = new Nonterminal("C");
    Nonterminal D = new Nonterminal("D");

    grammar = new Grammar();

    Production production = new Production(A);
    production.getDefinition().addSymbol(B);
    production.getDefinition().addSymbol(a);
    grammar.addProduction(production);

    production = new Production(B);
    production.getDefinition().addSymbol(b);
    grammar.addProduction(production);

    production = new Production(C);
    production.getDefinition().addSymbol(B);
    production.getDefinition().addSymbol(D);
    grammar.addProduction(production);

    production = new Production(D);

    // empty
    grammar.addProduction(production);

    firstsets = new FirstSetCollection(grammar);

    set = new ItemSet(grammar, firstsets);
    set.addItem(0, 0, c);

    result = new ItemSet(grammar, firstsets);
    result.addItem(0, 0, c);
    result.addItem(1, 0, a);

    assertEquals("Test if sets are equal", result, set.closure());

    set = new ItemSet(grammar, firstsets);
    set.addItem(2, 0, a);

    result = new ItemSet(grammar, firstsets);
    result.addItem(2, 0, a);
    result.addItem(1, 0, a);

    assertEquals("Test if sets are equal", result, set.closure());

    // ---- Case 3 ----
    grammar = new Grammar();

    production = new Production(A);
    production.getDefinition().addSymbol(B);
    production.getDefinition().addSymbol(D);
    grammar.addProduction(production);

    production = new Production(B);
    production.getDefinition().addSymbol(C);
    grammar.addProduction(production);

    production = new Production(C);
    production.getDefinition().addSymbol(d);
    grammar.addProduction(production);

    production = new Production(D);
    production.getDefinition().addSymbol(b);
    grammar.addProduction(production);

    firstsets = new FirstSetCollection(grammar);

    set = new ItemSet(grammar, firstsets);
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
    F = new Nonterminal("F");

    grammar = new Grammar();

    // E -> T E'
    Production production = new Production(E);
    production.getDefinition().addSymbol(T);
    production.getDefinition().addSymbol(Eprime);
    grammar.addProduction(production);

    // E' -> + T E'
    production = new Production(Eprime);
    production.getDefinition().addSymbol(plus);
    production.getDefinition().addSymbol(T);
    production.getDefinition().addSymbol(Eprime);
    grammar.addProduction(production);

    // E' ->
    production = new Production(Eprime);
    grammar.addProduction(production);

    // T -> F T'
    production = new Production(T);
    production.getDefinition().addSymbol(F);
    production.getDefinition().addSymbol(Tprime);
    grammar.addProduction(production);

    // T' -> * F T'
    production = new Production(Tprime);
    production.getDefinition().addSymbol(mult);
    production.getDefinition().addSymbol(F);
    production.getDefinition().addSymbol(Tprime);
    grammar.addProduction(production);

    // T' ->
    production = new Production(Tprime);
    grammar.addProduction(production);

    // F -> bopen E bclose
    production = new Production(F);
    production.getDefinition().addSymbol(bopen);
    production.getDefinition().addSymbol(E);
    production.getDefinition().addSymbol(bclose);
    grammar.addProduction(production);

    // F -> id
    production = new Production(F);
    production.getDefinition().addSymbol(id);
    grammar.addProduction(production);
  }
View Full Code Here
TOP

Related Classes of net.sourceforge.chaperon.model.grammar.Production

  • net.sourceforge.chaperon.build.State
  • net.sourceforge.chaperon.model.symbol.SymbolSet
  • net.sourceforge.chaperon.model.Violations
  • net.sourceforge.chaperon.process.GeneralParserProcessor
  • net.sourceforge.chaperon.test.AutomatonTestCase
  • net.sourceforge.chaperon.test.FirstSetTestCase
  • net.sourceforge.chaperon.test.FollowSetTestCase
  • net.sourceforge.chaperon.test.GrammarTestCase
  • net.sourceforge.chaperon.test.ItemSetTestCase
    • 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.