Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
org.antlr.codegen.templates.Ruby.ASTTreeParser.stg Maven / Gradle / Ivy
gatedAction(block) ::= <<
if
end
>>
ruleDeclarations() ::= <<
_last = _first_0 = nil<\n>
>>
noRewrite(rewriteBlockLevel, treeLevel) ::= <<
return_value.tree = _first_0
if @adaptor.parent( return_value.tree ) && @adaptor.flat_list?( @adaptor.parent( return_value.tree ) )
return_value.tree = @adaptor.parent( return_value.tree )
end
})>
>>
tree(root, actionsAfterRoot, children, nullableChildList,
enclosingTreeLevel, treeLevel) ::= <<
_save_last_ = _last = @input.look
_first_ = nil
root_ = @adaptor.create_flat_list<\n>
_first_ ||= .tree<\n>
_first_ ||= <\n>
})>
if @input.peek == DOWN
match( DOWN, nil )
match( UP, nil )
end<\n>
match( DOWN, nil )
match( UP, nil )<\n>
@adaptor.add_child( root_, root_ )<\n>
_last = _save_last_
>>
tokenRefBang(token,label,elementIndex,terminalOptions) ::= <<
_last = @input.look
>>
tokenRef(token,label,elementIndex,terminalOptions) ::= <<
_last = @input.look
tree_for_ = .new( )
tree_for_ = @adaptor.copy_node( )
<\n>
@adaptor.add_child( root_, tree_for_ )
})>
||= <\n>
})>
>>
tokenRefAndListLabel(token,label,elementIndex,terminalOptions) ::= <<
},...)>
>>
tokenRefRuleRoot(token,label,elementIndex,terminalOptions) ::= <<
_last = @input.look
tree_for_ = .new( )
tree_for_ = @adaptor.copy_node( )
<\n>
root_ = @adaptor.become_root( tree_for_, root_ )
})>
>>
tokenRefRuleRootAndListLabel(token,label,elementIndex,terminalOptions) ::= <<
},...)>
>>
wildcard(token,label,elementIndex,terminalOptions) ::= <<
_last = @input.look
= @adaptor.copy_tree( )
@adaptor.add_child( root_, tree_for_ )
})>
and _first_ =
})>
>>
matchSet(s,label,terminalOptions,elementIndex,postmatchCode) ::= <<
_last = @input.look
tree_for_ = .new( )
tree_for_ = @adaptor.copy_node( )
<\n>
@adaptor.add_child( root_, tree_for_ )
})>
}, ...)>
>>
matchRuleBlockSet(s,label,terminalOptions,elementIndex,postmatchCode,treeLevel="0") ::= <<
>>
matchSetBang(s,label,terminalOptions,elementIndex,postmatchCode) ::= <<
_last = @input.look
>>
matchSetRuleRoot(s,label,terminalOptions,elementIndex,debug) ::= <<
tree_for_ = .new( )
tree_for_ = @adaptor.copy_node( )
<\n>
root_ = @adaptor.become_root( tree_for_, root_ )
})>
}, ...)>
>>
ruleRef(rule,label,elementIndex,args,scope) ::= <<
_last = @input.look
@adaptor.add_child( root_, .tree )
_first_ ||= .tree<\n>
})>
>>
ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<
.tree},...)>
>>
ruleRefRuleRoot(rule,label,elementIndex,args,scope) ::= <<
_last = @input.look
= @adaptor.become_root( .tree, root_ )
})>
>>
ruleRefRuleRootAndListLabel(rule,label,elementIndex,args,scope) ::= <<
.tree},...)>
>>
ruleRefTrack(rule,label,elementIndex,args,scope) ::= <<
_last = @input.look
>>
ruleRefTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
_last = @input.look
>>
ruleRefRuleRootTrack(rule,label,elementIndex,args,scope) ::= <<
_last = @input.look
>>
ruleRefRuleRootTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
_last = @input.look
>>
createRewriteNodeFromElement(token,terminalOptions,scope) ::= <<
.new( stream_.next_node )
stream_.next_node
>>
ruleCleanUp() ::= <<
>>
