1324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/* 2324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver [The "BSD license"] 3324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Copyright (c) 2008 Erik van Bilsen 4324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Copyright (c) 2007-2008 Johannes Luber 5324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Copyright (c) 2005-2007 Kunle Odutola 6324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Copyright (c) 2005-2006 Terence Parr 7324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver All rights reserved. 8324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 9324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Redistribution and use in source and binary forms, with or without 10324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver modification, are permitted provided that the following conditions 11324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver are met: 12324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 1. Redistributions of source code must retain the above copyright 13324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver notice, this list of conditions and the following disclaimer. 14324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 2. Redistributions in binary form must reproduce the above copyright 15324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver notice, this list of conditions and the following disclaimer in the 16324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver documentation and/or other materials provided with the distribution. 17324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 3. The name of the author may not be used to endorse or promote products 18324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver derived from this software without specific prior written permission. 19324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 20324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 21324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 22324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 23324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 24324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 25324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 26324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 27324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 28324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 29324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 30324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver*/ 31324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 32324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** Templates for building ASTs during normal parsing. 33324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 34324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Deal with many combinations. Dimensions are: 35324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Auto build or rewrite 36324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * no label, label, list label (label/no-label handled together) 37324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * child, root 38324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * token, set, rule, wildcard 39324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 40324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * The situation is not too bad as rewrite (->) usage makes ^ and ! 41324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * invalid. There is no huge explosion of combinations. 42324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 43324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruvergroup ASTParser; 44324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 45324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver@rule.setErrorReturnValue() ::= << 46324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverRetVal.Tree := Adaptor.ErrorNode(Input, RetVal.Start as IToken, 47324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Input.LT(-1), RE) as I<ASTLabelType>; 48324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 49324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 50324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// TOKEN AST STUFF 51324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 52324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** ID and output=AST */ 53324c4644fee44b9898524c09511bd33c3f12e2dfBen GruvertokenRef(token,label,elementIndex,terminalOptions) ::= << 54324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<super.tokenRef(...)> 55324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(backtracking)> 56324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverif (State.Backtracking = 0) then 57324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverbegin<\n> 58324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 59324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<label>_tree := <createNodeFromToken(...)>; 60324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverAdaptor.AddChild(Root[0], <label>_tree); 61324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(backtracking)> 62324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverend; 63324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 64324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 65324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 66324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** ID! and output=AST (same as plain tokenRef) */ 67324c4644fee44b9898524c09511bd33c3f12e2dfBen GruvertokenRefBang(token,label,elementIndex) ::= "<super.tokenRef(...)>" 68324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 69324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** ID^ and output=AST */ 70324c4644fee44b9898524c09511bd33c3f12e2dfBen GruvertokenRefRuleRoot(token,label,elementIndex,terminalOptions) ::= << 71324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<super.tokenRef(...)> 72324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(backtracking)> 73324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverif (State.Backtracking = 0) then 74324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverbegin 75324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 76324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<label>_tree := <createNodeFromToken(...)>; 77324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverRoot[0] := Adaptor.BecomeRoot(<label>_tree, Root[0]) as I<ASTLabelType>; 78324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(backtracking)> 79324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverend; 80324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 81324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 82324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 83324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** ids+=ID! and output=AST */ 84324c4644fee44b9898524c09511bd33c3f12e2dfBen GruvertokenRefBangAndListLabel(token,label,elementIndex,terminalOptions) ::= << 85324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<tokenRefBang(...)> 86324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<listLabel(elem=label,...)> 87324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 88324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 89324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** label+=TOKEN when output=AST but not rewrite alt */ 90324c4644fee44b9898524c09511bd33c3f12e2dfBen GruvertokenRefAndListLabel(token,label,elementIndex,terminalOptions) ::= << 91324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<tokenRef(...)> 92324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<listLabel(elem=label,...)> 93324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 94324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 95324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** Match label+=TOKEN^ when output=AST but not rewrite alt */ 96324c4644fee44b9898524c09511bd33c3f12e2dfBen GruvertokenRefRuleRootAndListLabel(token,label,terminalOptions,elementIndex) ::= << 97324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<tokenRefRuleRoot(...)> 98324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<listLabel(elem=label,...)> 99324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 100324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 101324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// SET AST 102324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 103324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// the match set stuff is interesting in that it uses an argument list 104324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// to pass code to the default matchSet; another possible way to alter 105324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// inherited code. I don't use the region stuff because I need to pass 106324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// different chunks depending on the operator. I don't like making 107324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// the template name have the operator as the number of templates gets 108324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// large but this is the most flexible--this is as opposed to having 109324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// the code generator call matchSet then add root code or ruleroot code 110324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// plus list label plus ... The combinations might require complicated 111324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// rather than just added on code. Investigate that refactoring when 112324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// I have more time. 113324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 114324c4644fee44b9898524c09511bd33c3f12e2dfBen GruvermatchSet(s,label,terminalOptions,elementIndex,postmatchCode) ::= << 115324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<super.matchSet(..., postmatchCode={<if(backtracking)>if (State.Backtracking = 0) then <endif>Adaptor.AddChild(Root[0], <createNodeFromToken(...)>);})> 116324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 117324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 118324c4644fee44b9898524c09511bd33c3f12e2dfBen GruvermatchRuleBlockSet(s,label,terminalOptions,elementIndex,postmatchCode,treeLevel="0") ::= << 119324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<matchSet(...)> 120324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 121324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 122324c4644fee44b9898524c09511bd33c3f12e2dfBen GruvermatchSetBang(s,label,elementIndex,postmatchCode) ::= "<super.matchSet(...)>" 123324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 124324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// note there is no matchSetTrack because -> rewrites force sets to be 125324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// plain old blocks of alts: (A|B|...|C) 126324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 127324c4644fee44b9898524c09511bd33c3f12e2dfBen GruvermatchSetRuleRoot(s,label,terminalOptions,elementIndex,debug) ::= << 128324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(label)> 129324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<label> := Input.LT(1) as I<labelType>;<\n> 130324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 131324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<super.matchSet(..., postmatchCode={<if(backtracking)>if (State.Backtracking = 0) then <endif>Root[0] := Adaptor.BecomeRoot(<createNodeFromToken(...)>, Root[0]) as I<ASTLabelType>;})> 132324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 133324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 134324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// RULE REF AST 135324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 136324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** rule when output=AST */ 137324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverruleRef(rule,label,elementIndex,args,scope) ::= << 138324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<super.ruleRef(...)> 139324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(backtracking)>if (State.Backtracking = 0) then <endif>Adaptor.AddChild(Root[0], <label>.Tree); 140324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 141324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 142324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** rule! is same as normal rule ref */ 143324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverruleRefBang(rule,label,elementIndex,args,scope) ::= "<super.ruleRef(...)>" 144324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 145324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** rule^ */ 146324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverruleRefRuleRoot(rule,label,elementIndex,args,scope) ::= << 147324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<super.ruleRef(...)> 148324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(backtracking)>if (State.Backtracking = 0) then <endif>Root[0] := Adaptor.BecomeRoot(<label>.Tree, Root[0]) as I<ASTLabelType>; 149324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 150324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 151324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** x+=rule when output=AST */ 152324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= << 153324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<ruleRef(...)> 154324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<listLabel(elem=label+".Tree",...)> 155324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 156324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 157324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** x+=rule! when output=AST is a rule ref with list addition */ 158324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverruleRefBangAndListLabel(rule,label,elementIndex,args,scope) ::= << 159324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<ruleRefBang(...)> 160324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<listLabel(elem=label+".Tree",...)> 161324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 162324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 163324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/** x+=rule^ */ 164324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverruleRefRuleRootAndListLabel(rule,label,elementIndex,args,scope) ::= << 165324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<ruleRefRuleRoot(...)> 166324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<listLabel(elem=label+".Tree",...)> 167324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 168324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 169324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver// WILDCARD AST 170324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 171324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverwildcard(label,elementIndex) ::= << 172324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<super.wildcard(...)> 173324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(backtracking)> 174324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverif (State.Backtracking = 0) then 175324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverbegin 176324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 177324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver <label>_tree := Adaptor.CreateNode(<label>) as I<ASTLabelType>; 178324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Adaptor.AddChild(Root[0], <label>_tree); 179324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(backtracking)> 180324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverend; 181324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 182324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 183324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 184324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverwildcardBang(label,elementIndex) ::= "<super.wildcard(...)>" 185324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 186324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverwildcardRuleRoot(label,elementIndex) ::= << 187324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<super.wildcard(...)> 188324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(backtracking)> 189324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverif (State.Backtracking = 0) then 190324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverbegin 191324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 192324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver <label>_tree := Adaptor.CreateNode(<label>) as I<ASTLabelType>; 193324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Root[0] := Adaptor.BecomeRoot(<label>_tree, Root[0]) as I<ASTLabelType>; 194324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(backtracking)> 195324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverend; 196324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 197324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 198324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 199324c4644fee44b9898524c09511bd33c3f12e2dfBen GruvercreateNodeFromToken(label,terminalOptions) ::= << 200324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(terminalOptions.node)> 201324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverT<terminalOptions.node>.Create(<label>) <! new MethodNode(IDLabel) !> 202324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<else> 203324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverAdaptor.CreateNode(<label>) as I<ASTLabelType> 204324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 205324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 206324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 207324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverruleCleanUp() ::= << 208324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<super.ruleCleanUp()> 209324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(backtracking)> 210324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverif (State.Backtracking = 0) then 211324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruverbegin<\n> 212324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 213324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverRetVal.Tree := Adaptor.RulePostProcessing(Root[0]) as I<ASTLabelType>; 214324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(!TREE_PARSER)> 215324c4644fee44b9898524c09511bd33c3f12e2dfBen GruverAdaptor.SetTokenBoundaries(RetVal.Tree, RetVal.Start as IToken, RetVal.Stop as IToken); 216324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 217324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<if(backtracking)> 218324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<\n>end; 219324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver<endif> 220324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver>> 221