org.antlr.codegen.templates.JavaScript.ASTTreeParser.stg Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of antlr-complete Show documentation
Complete distribution for ANTLR 3
There is a newer version: 3.5.3
/** Templates for building ASTs during tree parsing.
 *
 *  Deal with many combinations.  Dimensions are:
 *  Auto build or rewrite
 *    no label, label, list label  (label/no-label handled together)
 *    child, root
 *    token, set, rule, wildcard
 *
 *  Each combination has its own template except that label/no label
 *  is combined into tokenRef, ruleRef, ...
 */
group ASTTreeParser;

/** Add a variable to track last element matched */
ruleDeclarations() ::= <<

var _first_0 = null;
var _last = null;<\n>
>>

/** What to emit when there is no rewrite rule.  For auto build
 *  mode, does nothing.
 */
noRewrite(rewriteBlockLevel, treeLevel) ::= <<
if (  ) {

retval.tree = _first_0;
if ( this.adaptor.getParent(retval.tree) && this.adaptor.isNil( this.adaptor.getParent(retval.tree) ) )
    retval.tree = this.adaptor.getParent(retval.tree);

}
>>

/** match ^(root children) in tree parser; override here to
 *  add tree construction actions.
 */
tree(root, actionsAfterRoot, children, nullableChildList,
     enclosingTreeLevel, treeLevel) ::= <<
_last = this.input.LT(1);
{
var _save_last_ = _last;
var _first_ = null;

var root_ = this.adaptor.nil();



if (  )

if ( !_first_ ) _first_ = .tree;

if ( !_first_ ) _first_ = ;




if ( this.input.LA(1)==org.antlr.runtime.Token.DOWN ) {
    this.match(this.input, org.antlr.runtime.Token.DOWN, null); 
    
    this.match(this.input, org.antlr.runtime.Token.UP, null); 
}

this.match(this.input, org.antlr.runtime.Token.DOWN, null); 

this.match(this.input, org.antlr.runtime.Token.UP, null); 


this.adaptor.addChild(root_, root_);

_last = _save_last_;
}<\n>
>>

// TOKEN AST STUFF

/** ID! and output=AST (same as plain tokenRef) 'cept add
 *  setting of _last
 */
tokenRefBang(token,label,elementIndex) ::= <<
_last = this.input.LT(1);

>>

/** ID auto construct */
tokenRef(token,label,elementIndex,terminalOptions) ::= <<
_last = this.input.LT(1);


if (  ) {

_tree = new ();

_tree = this.adaptor.dupNode();
<\n>
this.adaptor.addChild(root_, _tree);
}
 
if (  )
if ( !_first_ ) _first_ = ;

>>

/** label+=TOKEN auto construct */
tokenRefAndListLabel(token,label,elementIndex,terminalOptions) ::= <<


>>

/** ^(ID ...) auto construct */
tokenRefRuleRoot(token,label,elementIndex,terminalOptions) ::= <<
_last = this.input.LT(1);


if (  ) {

_tree = new ();

_tree = this.adaptor.dupNode();
<\n>
root_ = this.adaptor.becomeRoot(_tree, root_);
}

>>

/** Match ^(label+=TOKEN ...) auto construct */
tokenRefRuleRootAndListLabel(token,label,elementIndex,terminalOptions) ::= <<


>>

// SET AST

matchSet(s,label,terminalOptions,elementIndex,postmatchCode) ::= <<
_last = this.input.LT(1);

if (  ) {

_tree = new ();

_tree = this.adaptor.dupNode();
<\n>
this.adaptor.addChild(root_, _tree);
}

}
)>
>>

matchRuleBlockSet(s,label,terminalOptions,elementIndex,postmatchCode,treeLevel="0") ::= <<

 
>>

matchSetBang(s,label,elementIndex,postmatchCode) ::= <<
_last = this.input.LT(1);

>>

matchSetRuleRoot(s,label,terminalOptions,elementIndex,debug) ::= <<

if (  ) {

_tree = new ();

_tree = this.adaptor.dupNode();
<\n>
root_ = this.adaptor.becomeRoot(_tree, root_);
}

}
)>
>>

// RULE REF AST

/** rule auto construct */
ruleRef(rule,label,elementIndex,args,scope) ::= <<
_last = this.input.LT(1);

if (  ) 

this.adaptor.addChild(root_, .getTree());
 
if ( !_first_ ) _first_ = .tree;

>>

/** x+=rule auto construct */
ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<


>>

/** ^(rule ...) auto construct */
ruleRefRuleRoot(rule,label,elementIndex,args,scope) ::= <<
_last = this.input.LT(1);


if (  ) root_ = this.adaptor.becomeRoot(.getTree(), root_);

>>

/** ^(x+=rule ...) auto construct */
ruleRefRuleRootAndListLabel(rule,label,elementIndex,args,scope) ::= <<


>>

/** rule when output=AST and tracking for rewrite */
ruleRefTrack(rule,label,elementIndex,args,scope) ::= <<
_last = this.input.LT(1);

>>

/** x+=rule when output=AST and tracking for rewrite */
ruleRefTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
_last = this.input.LT(1);

>>

/** ^(rule ...) rewrite */
ruleRefRuleRootTrack(rule,label,elementIndex,args,scope) ::= <<
_last = this.input.LT(1);

>>

/** ^(x+=rule ...) rewrite */
ruleRefRuleRootTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
_last = this.input.LT(1);

>>

/** Streams for token refs are tree nodes now; override to
 *  change nextToken to nextNode.
 */
createRewriteNodeFromElement(token,terminalOptions,scope) ::= <<

new (stream_.nextNode())

stream_.nextNode()

>>

ruleCleanUp() ::= <<


if (  ) {<\n>
retval.tree = this.adaptor.rulePostProcessing(root_0);
}

>>