Package org.antlr.v4.tool.ast

Examples of org.antlr.v4.tool.ast.BlockAST

241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
   *       (ALT {3 >= $_p}? '++') (ALT {2 >= $_p}? '--'))))))
   * </pre>
   */
  public void setAltASTPointers(LeftRecursiveRule r, RuleAST t) {
//    System.out.println("RULE: "+t.toStringTree());
    BlockAST ruleBlk = (BlockAST)t.getFirstChildWithType(ANTLRParser.BLOCK);
    AltAST mainAlt = (AltAST)ruleBlk.getChild(0);
    BlockAST primaryBlk = (BlockAST)mainAlt.getChild(0);
    BlockAST opsBlk = (BlockAST)mainAlt.getChild(1).getChild(0); // (* BLOCK ...)
    for (int i = 0; i < r.recPrimaryAlts.size(); i++) {
      LeftRecursiveRuleAltInfo altInfo = r.recPrimaryAlts.get(i);
      altInfo.altAST = (AltAST)primaryBlk.getChild(i);
      altInfo.altAST.leftRecursiveAltInfo = altInfo;
      altInfo.originalAltAST.leftRecursiveAltInfo = altInfo;
//      altInfo.originalAltAST.parent = altInfo.altAST.parent;
//      System.out.println(altInfo.altAST.toStringTree());
    }
    for (int i = 0; i < r.recOpAlts.size(); i++) {
      LeftRecursiveRuleAltInfo altInfo = r.recOpAlts.getElement(i);
      altInfo.altAST = (AltAST)opsBlk.getChild(i);
      altInfo.altAST.leftRecursiveAltInfo = altInfo;
      altInfo.originalAltAST.leftRecursiveAltInfo = altInfo;
//      altInfo.originalAltAST.parent = altInfo.altAST.parent;
//      System.out.println(altInfo.altAST.toStringTree());
    }
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
160
161
162
    AltAST altTree = (AltAST)originalAltTree.dupTree();
    String altLabel = altTree.altLabel!=null ? altTree.altLabel.getText() : null;

    String label = null;
    boolean isListLabel = false;
    GrammarAST lrlabel = stripLeftRecursion(altTree);
    if ( lrlabel!=null ) {
      label = lrlabel.getText();
      isListLabel = lrlabel.getParent().getType() == PLUS_ASSIGN;
      leftRecursiveRuleRefLabels.add(new Pair<GrammarAST,String>(lrlabel,altLabel));
    }

    stripAltLabel(altTree);
View Full Code Here
197
198
199
200
201
202
203
204
205
206
207
208
209
210
    AltAST altTree = (AltAST)originalAltTree.dupTree();
    String altLabel = altTree.altLabel!=null ? altTree.altLabel.getText() : null;

    String label = null;
    boolean isListLabel = false;
    GrammarAST lrlabel = stripLeftRecursion(altTree);
    if ( lrlabel!=null ) {
      label = lrlabel.getText();
      isListLabel = lrlabel.getParent().getType() == PLUS_ASSIGN;
      leftRecursiveRuleRefLabels.add(new Pair<GrammarAST,String>(lrlabel,altLabel));
    }
    stripAltLabel(altTree);
    String altText = text(altTree);
    altText = altText.trim();
View Full Code Here
269
270
271
272
273
274
275
276
277
278
279
    for (GrammarAST x : outerAltRuleRefs) {
      RuleRefAST rref = (RuleRefAST)x;
      boolean recursive = rref.getText().equals(ruleName);
      boolean rightmost = rref == outerAltRuleRefs.get(outerAltRuleRefs.size()-1);
      if ( recursive && rightmost ) {
        GrammarAST dummyValueNode = new GrammarAST(new CommonToken(ANTLRParser.INT, ""+prec));
        rref.setOption(LeftRecursiveRuleTransformer.PRECEDENCE_OPTION_NAME, dummyValueNode);
      }
    }
    return t;
  }
View Full Code Here
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
   * Match (RULE RULE_REF (BLOCK (ALT .*) (ALT RULE_REF[self] .*) (ALT .*)))
   * Match (RULE RULE_REF (BLOCK (ALT .*) (ALT (ASSIGN ID RULE_REF[self]) .*) (ALT .*)))
   */
  public static boolean hasImmediateRecursiveRuleRefs(GrammarAST t, String ruleName) {
    if ( t==null ) return false;
    GrammarAST blk = (GrammarAST)t.getFirstChildWithType(BLOCK);
    if ( blk==null ) return false;
    int n = blk.getChildren().size();
    for (int i = 0; i < n; i++) {
      GrammarAST alt = (GrammarAST)blk.getChildren().get(i);
      Tree first = alt.getChild(0);
      if ( first==null ) continue;
      if (first.getType() == ELEMENT_OPTIONS) {
        first = alt.getChild(1);
        if (first == null) {
          continue;
        }
      }
      if ( first.getType()==RULE_REF && first.getText().equals(ruleName) ) return true;
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
    createRuleStartAndStopATNStates();

    GrammarASTAdaptor adaptor = new GrammarASTAdaptor();
    for (Rule r : rules) {
      // find rule's block
      GrammarAST blk = (GrammarAST)r.ast.getFirstChildWithType(ANTLRParser.BLOCK);
      CommonTreeNodeStream nodes = new CommonTreeNodeStream(adaptor,blk);
      ATNBuilder b = new ATNBuilder(nodes,this);
      try {
        setCurrentRuleName(r.name);
        Handle h = b.ruleBlock(null);
View Full Code Here
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
  // TODO: this strips the tree properly, but since text()
  // uses the start of stop token index and gets text from that
  // ineffectively ignores this routine.
  public GrammarAST stripLeftRecursion(GrammarAST altAST) {
    GrammarAST lrlabel=null;
    GrammarAST first = (GrammarAST)altAST.getChild(0);
    int leftRecurRuleIndex = 0;
    if ( first.getType() == ELEMENT_OPTIONS ) {
      first = (GrammarAST)altAST.getChild(1);
      leftRecurRuleIndex = 1;
    }
    Tree rref = first.getChild(1); // if label=rule
    if ( (first.getType()==RULE_REF && first.getText().equals(ruleName)) ||
       (rref!=null && rref.getType()==RULE_REF && rref.getText().equals(ruleName)) )
    {
      if ( first.getType()==ASSIGN || first.getType()==PLUS_ASSIGN ) lrlabel = (GrammarAST)first.getChild(0);
      // remove rule ref (first child unless options present)
      altAST.deleteChild(leftRecurRuleIndex);
      // reset index so it prints properly (sets token range of
      // ALT to start to right of left recur rule we deleted)
      GrammarAST newFirstChild = (GrammarAST)altAST.getChild(leftRecurRuleIndex);
      altAST.setTokenStartIndex(newFirstChild.getTokenStartIndex());
    }
    return lrlabel;
  }
View Full Code Here
377
378
379
380
381
382
383
384
385
386
387
      Token tok = tokenStream.get(i);

      StringBuilder elementOptions = new StringBuilder();
      if (!noOptions.contains(i)) {
        GrammarAST node = t.getNodeWithTokenIndex(tok.getTokenIndex());
        if ( node!=null &&
           (tok.getType()==TOKEN_REF ||
            tok.getType()==STRING_LITERAL ||
            tok.getType()==RULE_REF) )
        {
View Full Code Here
387
388
389
390
391
392
393
394
395
396
397
398
        {
          elementOptions.append("tokenIndex=").append(tok.getTokenIndex());
        }

        if ( node instanceof GrammarASTWithOptions ) {
          GrammarASTWithOptions o = (GrammarASTWithOptions)node;
          for (Map.Entry<String, GrammarAST> entry : o.getOptions().entrySet()) {
            if (elementOptions.length() > 0) {
              elementOptions.append(',');
            }

            elementOptions.append(entry.getKey());
View Full Code Here
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
  public AltAST addPrecedenceArgToRules(AltAST t, int prec) {
    if ( t==null ) return null;
    // get all top-level rule refs from ALT
    List<GrammarAST> outerAltRuleRefs = t.getNodesWithTypePreorderDFS(IntervalSet.of(RULE_REF));
    for (GrammarAST x : outerAltRuleRefs) {
      RuleRefAST rref = (RuleRefAST)x;
      boolean recursive = rref.getText().equals(ruleName);
      boolean rightmost = rref == outerAltRuleRefs.get(outerAltRuleRefs.size()-1);
      if ( recursive && rightmost ) {
        GrammarAST dummyValueNode = new GrammarAST(new CommonToken(ANTLRParser.INT, ""+prec));
        rref.setOption(LeftRecursiveRuleTransformer.PRECEDENCE_OPTION_NAME, dummyValueNode);
      }
    }
    return t;
  }
View Full Code Here
TOP

Related Classes of org.antlr.v4.tool.ast.BlockAST

  • org.antlr.runtime.ANTLRFileStream
  • org.antlr.runtime.ANTLRStringStream
  • org.antlr.runtime.CharStream
  • org.antlr.runtime.CommonToken
  • org.antlr.runtime.Token
  • org.antlr.runtime.tree.CommonTree
  • org.antlr.runtime.tree.CommonTreeNodeStream
  • org.antlr.runtime.tree.Tree
  • org.antlr.runtime.tree.TreeVisitor
  • org.antlr.runtime.tree.TreeVisitorAction
    • 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.