Package net.sourceforge.chaperon.model.symbol

Examples of net.sourceforge.chaperon.model.symbol.SymbolSet

415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
    buffer.append(super.toString());
    buffer.append("\n");

    buffer.append("Terminal symbols:\n");
    SymbolSet tsymbols = getSymbols().getTerminals();
    for (int i = 0; i < tsymbols.getSymbolCount(); i++)
    {
      buffer.append(String.valueOf(i));
      buffer.append(".Terminal: ");
      buffer.append(tsymbols.getSymbol(i));
      buffer.append(" Priority=");
      buffer.append(String.valueOf(getPriority((Terminal)tsymbols.getSymbol(i))));
      buffer.append(" Associativity=");
      buffer.append(String.valueOf(getAssociativity((Terminal)tsymbols.getSymbol(i))));
      buffer.append("\n");
    }

    buffer.append("Produktions:\n");
    for (int i = 0; i < getProductionCount(); i++)
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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
  {
    this.grammar = grammar;
    this.firstsets = firstsets;
    this.log = log;

    SymbolSet symbols = grammar.getSymbols();

    tsymbols = symbols.getTerminals();
    ntsymbols = symbols.getNonterminals();

    // C = closure( [S'=^S,EOF] )
    IntegerList changedState = new IntegerList();  // 0=not changed 1=changed

    addItemSet(getStartItemSet());
    changedState.add(CHANGED);

    boolean mustrepeat = false;
    for (int i = 0; i<getItemSetCount(); i++)
    {
      changedState.set(i, NOTCHANGED);

      ItemSet I = getItemSet(i);

      // J = goto(I,X) add to C, for all nonterminal and terminal symbols X
      // for the non terminal symbols
      SymbolSet nextnonterminals = I.getNextNonterminals();
      for (int j = 0; j<nextnonterminals.getSymbolCount(); j++)
      {
        ItemSet J = I.jump(nextnonterminals.getSymbol(j));

        if (!J.isEmpty())
        {
          int index = indexOfCore(J);
          if (index<0)  // if C doesn't contain J
          {
            index = addItemSet(J);

            changedState.add(CHANGED);
          }
          else  // otherwise the found state extends through J
          {
            if (getItemSet(index).addItemSet(J))  // if the found state change
            {
              if (index<changedState.getCount())
                changedState.set(index, CHANGED);
              else
                changedState.add(CHANGED);

              if (index<=i)  // if J before I, and J


                // was changed then must the loop repeat
                mustrepeat = true;
            }
          }

          I.setTransition(nextnonterminals.getSymbol(j), index);  // stores the transition for this symbol
        }
      }

      // and for the terminal symbols
      SymbolSet nextterminals = I.getNextTerminals();
      for (int j = 0; j<nextterminals.getSymbolCount(); j++)
      {
        ItemSet J = I.jump(nextterminals.getSymbol(j));

        if (!J.isEmpty())
        {
          int index = indexOfCore(J);
          if (index<0)  // if C doesn't contain J
          {
            index = addItemSet(J);

            changedState.add(CHANGED);
          }
          else  // otherwise the found state extends through J
          {
            if (getItemSet(index).addItemSet(J))  // if the found state change
            {
              if (index<changedState.getCount())
                changedState.set(index, CHANGED);
              else
                changedState.add(CHANGED);

              if (index<=i)  // if J before I, and J


                // was changed then must the loop repeat
                mustrepeat = true;
            }
          }

          I.setTransition(nextterminals.getSymbol(j), index);  // stores the transition for this symbol
        }
      }
    }

    do
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
    for (int i = 0; i<elementCount; i++)
      if ((productions[i]==production) && (positions[i]==position))
      {
        if (lookaheads[i]==null)
          lookaheads[i] = new SymbolSet();

        return lookaheads[i].addSymbol(lookahead);
      }

    ensureCapacity(elementCount+1);
    productions[elementCount] = production;
    positions[elementCount] = position;
    lookaheads[elementCount] = new SymbolSet();
    lookaheads[elementCount++].addSymbol(lookahead);

    return true;
  }
View Full Code Here
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
    for (int i = 0; i<elementCount; i++)
      if ((productions[i]==production) && (positions[i]==position))
      {
        if (this.lookaheads[i]==null)
          this.lookaheads[i] = new SymbolSet();

        return this.lookaheads[i].addSymbol(lookaheads);
      }

    ensureCapacity(elementCount+1);
    productions[elementCount] = production;
    positions[elementCount] = position;
    this.lookaheads[elementCount] = new SymbolSet();
    this.lookaheads[elementCount++].addSymbol(lookaheads);

    return true;
  }
View Full Code Here
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
    return EMPTYLIST;
  }

  public SymbolSet getNextTerminals()
  {
    SymbolSet set = new SymbolSet();

    SymbolList productiondefinition;
    for (int item = 0; item<elementCount; item++)
      if ((positions[item]<((productiondefinition =
                            grammar.getProduction(productions[item]).getDefinition()).getSymbolCount())) &&
          (productiondefinition.getSymbol(positions[item]) instanceof Terminal))
        set.addSymbol(productiondefinition.getSymbol(positions[item]));

    return set;
  }
View Full Code Here
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
    return set;
  }

  public SymbolSet getNextNonterminals()
  {
    SymbolSet set = new SymbolSet();

    SymbolList productiondefinition;
    for (int item = 0; item<elementCount; item++)
      if ((positions[item]<((productiondefinition =
                            grammar.getProduction(productions[item]).getDefinition()).getSymbolCount())) &&
          (productiondefinition.getSymbol(positions[item]) instanceof Nonterminal))
        set.addSymbol(productiondefinition.getSymbol(positions[item]));

    return set;
  }
View Full Code Here
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
424
425
426
427
428
   */
  public ItemSet closure()
  {
    ItemSet J = new ItemSet(grammar, firstsets, this);  // J=I

    SymbolSet b = new SymbolSet();
    SymbolSet b2 = new SymbolSet();

    boolean changed = false;
    do
    {
      changed = false;

      // for every item in itemset I
      for (int i = 0; i<J.elementCount; i++)
      {
        SymbolList productiondefinition = grammar.getProduction(J.productions[i]).getDefinition();

        // and not A=XYZ^
        if (J.positions[i]<productiondefinition.getSymbolCount())
        {
          Symbol symbol = productiondefinition.getSymbol(J.positions[i]);  // A=X ^symbol Z

          // for every item [A=u^Bv,a] in J and production B=w in G
          if (symbol instanceof Nonterminal)
          {
            int pos = J.positions[i]+1;  // for the FIRST set from (va)

            b.clear();

            // if [A=u^Bv,a]
            if (pos<productiondefinition.getSymbolCount())
            {
              // then is b the list of all terminal symbols from FIRST(va)
              do
              {
                if (productiondefinition.getSymbol(pos) instanceof Terminal)
                {
                  b2.clear();
                  b2.addSymbol(productiondefinition.getSymbol(pos));
                }
                else
                {
                  b2.clear();
                  b2.addSymbol(firstsets.getFirstSet(productiondefinition.getSymbol(pos)));
                }

                b.addSymbol(b2);
                pos++;
              }
              while ((b2.contains(EMPTYLIST)) && (pos<productiondefinition.getSymbolCount()));

              if (b.contains(EMPTYLIST))
                b.addSymbol(J.lookaheads[i]);

              b.removeSymbol(EMPTYLIST);
View Full Code Here
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
   *
   * @return Set of symbols.
   */
  public SymbolSet getReduceSymbols()
  {
    SymbolSet reducesymbols = new SymbolSet();

    for (int i = 0; i<elementCount; i++)
    {
      if (getItemNext(i).equals(EMPTYLIST))  // for all A=u^ and all symbols in FOLLOW(A)

        reducesymbols.addSymbol(lookaheads[i]);
    }

    return reducesymbols;
  }
View Full Code Here
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
            break;
          }
      }
    }

    SymbolSet set = getShiftSymbols();

    for (int index = 0; index<set.getSymbolCount(); index++)
    {
      buffer.append("Transition for ");
      buffer.append(set.getSymbol(index));
      buffer.append(" -> State ");
      buffer.append(String.valueOf(getTransition(set.getSymbol(index))));
      buffer.append("\n");
    }

    return buffer.toString();
  }
View Full Code Here
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
    Violations violations = grammar.validate();

    if ((violations!=null) && (violations.getViolationCount()>0))
      throw new IllegalArgumentException("Grammar is not valid: "+violations.getViolation(0));

    SymbolSet symbols = grammar.getSymbols();

    tsymbols = symbols.getTerminals();
    ntsymbols = symbols.getNonterminals();

    //long time = System.currentTimeMillis();
    // generate all first sets
    if ((log!=null) && (log.isDebugEnabled()))
      log.debug("Generating first sets");

    firstsets = new FirstSetCollection(grammar, log);
    if ((log!=null) && (log.isDebugEnabled()))
      log.debug(firstsets.toString());

    // calculation of alle states and transitions
    if ((log!=null) && (log.isDebugEnabled()))
      log.debug("Building states and transitions");

    itemsets = new ItemSetCollection(grammar, firstsets, log);
    if ((log!=null) && (log.isDebugEnabled()))
      log.debug(itemsets.toString());

    if ((log!=null) && (log.isDebugEnabled()))
      log.debug("Building parser automaton");

    automaton =
      new ParserAutomaton(tsymbols.getSymbolCount(), ntsymbols.getSymbolCount(),
                          grammar.getProductionCount(), 0, itemsets.getItemSetCount());

    // for alle terminal symbols
    for (int i = 0; i<tsymbols.getSymbolCount(); i++)
      automaton.setTerminal(i, tsymbols.getSymbol(i).getName());

    // for the non terminal symbols
    for (int i = 0; i<ntsymbols.getSymbolCount(); i++)
      automaton.setNonterminal(i, ntsymbols.getSymbol(i).getName());

    // for all productions
    for (int i = 0; i<grammar.getProductionCount(); i++)
    {
      automaton.setProductionSymbol(i, ntsymbols.indexOf(grammar.getProduction(i).getSymbol()));
      automaton.setProductionLength(i, grammar.getProduction(i).getLength());
    }

    // for all itemsets I in itemsets C
    for (int state = 0; state<itemsets.getItemSetCount(); state++)
    {
      ItemSet I = itemsets.getItemSet(state);

      SymbolSet shiftsymbols = I.getShiftSymbols();  // Transition symbols for shift actions
      SymbolSet reducesymbols = I.getReduceSymbols();  // Lookahead symbols for reduce actions

      for (int symbol = 0; symbol<tsymbols.getSymbolCount(); symbol++)
      {
        IntegerSet reduceproductions = I.getReduceProductions(tsymbols.getSymbol(symbol));
        int productionpriority = -1;
        int highestproduction = -1;
        for (int k = 0; k<reduceproductions.getCount(); k++)
        {
          ReduceReduceConflict reduceconflict = null;

          if (k>0)
          {
            reduceconflict =
              new ReduceReduceConflict(grammar, itemsets, state,
                                       (Terminal)tsymbols.getSymbol(symbol),
                                       reduceproductions.get(k-1), reduceproductions.get(k));

            conflicts.addConflict(reduceconflict);
          }

          if (grammar.getPriority(grammar.getProduction(reduceproductions.get(k)))>productionpriority)
          {
            highestproduction = reduceproductions.get(k);
            productionpriority = grammar.getPriority(grammar.getProduction(highestproduction));

            if ((log!=null) && (reduceconflict!=null))
              log.info(reduceconflict.toString());
          }
          else if (grammar.getPriority(grammar.getProduction(reduceproductions.get(k)))==productionpriority)
          {
            if (log!=null)
              log.warn(reduceconflict.toString());
          }
        }

        if (reduceproductions.getCount()>1)
          if ((log!=null) && (log.isInfoEnabled()))
            log.info("The parser will reduce the production "+
                     grammar.getProduction(highestproduction));

        boolean errorreduce = reducesymbols.contains(Error.instance);

        if (shiftsymbols.contains(tsymbols.getSymbol(symbol)))
        {
          if ((errorreduce) || (reducesymbols.contains(tsymbols.getSymbol(symbol))))
          {
            int tokenpriority = grammar.getPriority((Terminal)tsymbols.getSymbol(symbol));

            ShiftReduceConflict shiftconflict =
              new ShiftReduceConflict(grammar, itemsets, state,
                                      (Terminal)tsymbols.getSymbol(symbol), highestproduction);

            if (tokenpriority>productionpriority)
            {
              automaton.setShiftAction(state, symbol, I.getTransition(tsymbols.getSymbol(symbol)));

              if (log!=null)
              {
                log.info(shiftconflict.toString());
                log.info("The parser will shift");
              }
            }
            else if (tokenpriority<productionpriority)
            {
              automaton.setReduceAction(state, symbol, highestproduction);

              if (log!=null)
              {
                log.info(shiftconflict.toString());
                log.info("The parser will reduce");
              }
            }
            else
            {
              if (log!=null)
                log.warn(shiftconflict.toString());

              Associativity associativity =
                grammar.getAssociativity((Terminal)tsymbols.getSymbol(symbol));
              if (associativity.equals(Associativity.RIGHT))
              {
                // if the terminal has a right associativity
                automaton.setShiftAction(state, symbol, I.getTransition(tsymbols.getSymbol(symbol)));

                if (log!=null)
                  log.warn("The parser will shift");
              }
              else if (associativity.equals(Associativity.LEFT))
              {
                // if the terminal has a left associativity
                automaton.setReduceAction(state, symbol, highestproduction);

                if (log!=null)
                  log.warn("The parser will reduce");
              }
              else
              {
                // SHIFT should be always prefered
                automaton.setShiftAction(state, symbol, I.getTransition(tsymbols.getSymbol(symbol)));

                if (log!=null)
                  log.warn("The parser will shift");
              }
            }
          }
          else
            automaton.setShiftAction(state, symbol, I.getTransition(tsymbols.getSymbol(symbol)));
        }
        else if ((errorreduce) || (reducesymbols.contains(tsymbols.getSymbol(symbol))))
          automaton.setReduceAction(state, symbol, highestproduction);
        else
          for (int i = 0; i<shiftsymbols.getSymbolCount(); i++)
            if (shiftsymbols.getSymbol(i) instanceof Error)
              automaton.setErrorAction(state, symbol, I.getTransition(shiftsymbols.getSymbol(i)));
      }

      // create all actions for the end of file.
      if (reducesymbols.contains(EOF))
      {
        IntegerSet reduceproductions = I.getReduceProductions(EOF);
        int productionpriority = -1;
        int highestproduction = -1;
        for (int k = 0; k<reduceproductions.getCount(); k++)
View Full Code Here
TOP

Related Classes of net.sourceforge.chaperon.model.symbol.SymbolSet

  • net.sourceforge.chaperon.build.Automaton
  • net.sourceforge.chaperon.build.FirstSetCollection
  • net.sourceforge.chaperon.build.FollowSetCollection
  • net.sourceforge.chaperon.build.ItemSet
  • net.sourceforge.chaperon.build.ItemSetCollection
  • net.sourceforge.chaperon.build.ParserAutomatonBuilder
  • net.sourceforge.chaperon.build.State
  • net.sourceforge.chaperon.model.grammar.Grammar
  • net.sourceforge.chaperon.model.grammar.Production
  • net.sourceforge.chaperon.test.FirstSetTestCase
    • 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.