| /* |
| * [The "BSD license"] |
| * Copyright (c) 2011 Terence Parr |
| * All rights reserved. |
| * |
| * Conversion to C#: |
| * Copyright (c) 2011 Sam Harwell, Pixel Mine, Inc. |
| * All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * 1. Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * 2. Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution. |
| * 3. The name of the author may not be used to endorse or promote products |
| * derived from this software without specific prior written permission. |
| * |
| * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
| * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
| * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
| * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
| * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| |
| /** 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, ... |
| */ |
| |
| /** Add a variable to track last element matched */ |
| ruleDeclarations() ::= << |
| <super.ruleDeclarations()> |
| <ASTLabelType> _first_0 = default(<ASTLabelType>); |
| <ASTLabelType> _last = default(<ASTLabelType>);<\n> |
| >> |
| |
| /** What to emit when there is no rewrite rule. For auto build |
| * mode, does nothing. |
| */ |
| noRewrite(rewriteBlockLevel, treeLevel) ::= << |
| <if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif> |
| <if(rewriteMode)> |
| retval.Tree = (<ASTLabelType>)_first_0; |
| if (adaptor.GetParent(retval.Tree)!=null && adaptor.IsNil(adaptor.GetParent(retval.Tree))) |
| retval.Tree = (<ASTLabelType>)adaptor.GetParent(retval.Tree); |
| <endif> |
| <if(backtracking)>}<endif> |
| >> |
| |
| /** match ^(root children) in tree parser; override here to |
| * add tree construction actions. |
| */ |
| tree(root, actionsAfterRoot, children, nullableChildList, |
| enclosingTreeLevel, treeLevel) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| { |
| <ASTLabelType> _save_last_<treeLevel> = _last; |
| <ASTLabelType> _first_<treeLevel> = default(<ASTLabelType>); |
| <if(!rewriteMode)> |
| <ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.Nil(); |
| <endif> |
| <root:element()> |
| <if(rewriteMode)> |
| <if(backtracking)>if (<actions.(actionScope).synpredgate>)<endif> |
| <if(root.el.rule)> |
| if (_first_<enclosingTreeLevel> == null) _first_<enclosingTreeLevel> = <root.el.label>.Tree; |
| <else> |
| if (_first_<enclosingTreeLevel> == null) _first_<enclosingTreeLevel> = <root.el.label>; |
| <endif> |
| <endif> |
| <actionsAfterRoot:element()> |
| <if(nullableChildList)> |
| if (input.LA(1) == TokenTypes.Down) { |
| Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()> |
| <children:element()> |
| Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()> |
| } |
| <else> |
| Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()> |
| <children:element()> |
| Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()> |
| <endif> |
| <if(!rewriteMode)> |
| adaptor.AddChild(root_<enclosingTreeLevel>, root_<treeLevel>); |
| <endif> |
| _last = _save_last_<treeLevel>; |
| }<\n> |
| >> |
| |
| // TOKEN AST STUFF |
| |
| /** ID! and output=AST (same as plain tokenRef) 'cept add |
| * setting of _last |
| */ |
| tokenRefBang(token,label,elementIndex,terminalOptions) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| <super.tokenRef(...)> |
| >> |
| |
| /** ID auto construct */ |
| tokenRef(token,label,elementIndex,terminalOptions) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| <super.tokenRef(...)> |
| <if(!rewriteMode)> |
| <if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif> |
| <if(terminalOptions.node)> |
| <label>_tree = new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>); |
| <else> |
| <label>_tree = (<ASTLabelType>)adaptor.DupNode(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>); |
| <endif><\n> |
| adaptor.AddChild(root_<treeLevel>, <label>_tree); |
| <if(backtracking)>}<endif> |
| <else> <! rewrite mode !> |
| <if(backtracking)>if (<actions.(actionScope).synpredgate>)<endif> |
| if (_first_<treeLevel> == null) _first_<treeLevel> = <label>; |
| <endif> |
| >> |
| |
| /** label+=TOKEN auto construct */ |
| tokenRefAndListLabel(token,label,elementIndex,terminalOptions) ::= << |
| <tokenRef(...)> |
| <listLabelElem(elem=label,...)> |
| >> |
| |
| /** ^(ID ...) auto construct */ |
| tokenRefRuleRoot(token,label,elementIndex,terminalOptions) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| <super.tokenRef(...)> |
| <if(!rewriteMode)> |
| <if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif> |
| <if(terminalOptions.node)> |
| <label>_tree = new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>); |
| <else> |
| <label>_tree = (<ASTLabelType>)adaptor.DupNode(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>); |
| <endif><\n> |
| root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_<treeLevel>); |
| <if(backtracking)>}<endif> |
| <endif> |
| >> |
| |
| /** Match ^(label+=TOKEN ...) auto construct */ |
| tokenRefRuleRootAndListLabel(token,label,elementIndex,terminalOptions) ::= << |
| <tokenRefRuleRoot(...)> |
| <listLabelElem(elem=label,...)> |
| >> |
| |
| /** Match . wildcard and auto dup the node/subtree */ |
| wildcard(token,label,elementIndex,terminalOptions) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| <super.wildcard(...)> |
| <if(!rewriteMode)> |
| <if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif> |
| <label>_tree = (<ASTLabelType>)adaptor.DupTree(<label>); |
| adaptor.AddChild(root_<treeLevel>, <label>_tree); |
| <if(backtracking)>}<endif> |
| <else> <! rewrite mode !> |
| <if(backtracking)>if (<actions.(actionScope).synpredgate>)<endif> |
| if (_first_<treeLevel> == null) _first_<treeLevel> = <label>; |
| <endif> |
| >> |
| |
| // SET AST |
| |
| matchSet(s,label,terminalOptions,elementIndex,postmatchCode) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| <super.matchSet(postmatchCode={ |
| <if(!rewriteMode)> |
| <if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif> |
| <if(terminalOptions.node)> |
| <label>_tree = new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>); |
| <else> |
| <label>_tree = (<ASTLabelType>)adaptor.DupNode(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>); |
| <endif><\n> |
| adaptor.AddChild(root_<treeLevel>, <label>_tree); |
| <if(backtracking)>\}<endif> |
| <endif> |
| }, ... |
| )> |
| >> |
| |
| matchRuleBlockSet(s,label,terminalOptions,elementIndex,postmatchCode,treeLevel="0") ::= << |
| <matchSet(...)> |
| <noRewrite(...)> <! set return tree !> |
| >> |
| |
| matchSetBang(s,label,terminalOptions,elementIndex,postmatchCode) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| <super.matchSet(...)> |
| >> |
| |
| matchSetRuleRoot(s,label,terminalOptions,elementIndex,debug) ::= << |
| <super.matchSet(postmatchCode={ |
| <if(!rewriteMode)> |
| <if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif> |
| <if(terminalOptions.node)> |
| <label>_tree = new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>); |
| <else> |
| <label>_tree = (<ASTLabelType>)adaptor.DupNode(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>); |
| <endif><\n> |
| root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_<treeLevel>); |
| <if(backtracking)>\}<endif> |
| <endif> |
| }, ... |
| )> |
| >> |
| |
| // RULE REF AST |
| |
| /** rule auto construct */ |
| ruleRef(rule,label,elementIndex,args,scope) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| <super.ruleRef(...)> |
| <if(backtracking)>if (<actions.(actionScope).synpredgate>)<endif> |
| <if(!rewriteMode)> |
| adaptor.AddChild(root_<treeLevel>, <label>.Tree); |
| <else> <! rewrite mode !> |
| if (_first_<treeLevel> == null) _first_<treeLevel> = <label>.Tree; |
| <endif> |
| >> |
| |
| /** x+=rule auto construct */ |
| ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= << |
| <ruleRef(...)> |
| <listLabelElem(elem={<label>.Tree},...)> |
| >> |
| |
| /** ^(rule ...) auto construct */ |
| ruleRefRuleRoot(rule,label,elementIndex,args,scope) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| <super.ruleRef(...)> |
| <if(!rewriteMode)> |
| <if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>.Tree, root_<treeLevel>); |
| <endif> |
| >> |
| |
| /** ^(x+=rule ...) auto construct */ |
| ruleRefRuleRootAndListLabel(rule,label,elementIndex,args,scope) ::= << |
| <ruleRefRuleRoot(...)> |
| <listLabelElem(elem={<label>.Tree},...)> |
| >> |
| |
| /** rule when output=AST and tracking for rewrite */ |
| ruleRefTrack(rule,label,elementIndex,args,scope) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| <super.ruleRefTrack(...)> |
| >> |
| |
| /** x+=rule when output=AST and tracking for rewrite */ |
| ruleRefTrackAndListLabel(rule,label,elementIndex,args,scope) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| <super.ruleRefTrackAndListLabel(...)> |
| >> |
| |
| /** ^(rule ...) rewrite */ |
| ruleRefRuleRootTrack(rule,label,elementIndex,args,scope) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| <super.ruleRefRootTrack(...)> |
| >> |
| |
| /** ^(x+=rule ...) rewrite */ |
| ruleRefRuleRootTrackAndListLabel(rule,label,elementIndex,args,scope) ::= << |
| _last = (<ASTLabelType>)input.LT(1); |
| <super.ruleRefRuleRootTrackAndListLabel(...)> |
| >> |
| |
| /** Streams for token refs are tree nodes now; override to |
| * change NextToken to NextNode. |
| */ |
| createRewriteNodeFromElement(token,terminalOptions,args) ::= <% |
| <if(terminalOptions.node)> |
| new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif>stream_<token>.NextNode()) |
| <else> |
| stream_<token>.NextNode() |
| <endif> |
| %> |
| |
| ruleCleanUp() ::= << |
| <super.ruleCleanUp()> |
| <if(!rewriteMode)> |
| <if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif> |
| retval.Tree = (<ASTLabelType>)adaptor.RulePostProcessing(root_0); |
| <if(backtracking)>}<endif> |
| <endif> |
| >> |
