RubyGems - antlr3 - Versions diffs - 1.2.3 - Mend

antlr3 1.2.3

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (85) hide show

data/ANTLR-LICENSE.txt +26 -0
data/History.txt +66 -0
data/README.txt +139 -0
data/bin/antlr4ruby +33 -0
data/java/RubyTarget.java +524 -0
data/java/antlr-full-3.2.1.jar +0 -0
data/lib/antlr3.rb +176 -0
data/lib/antlr3/constants.rb +88 -0
data/lib/antlr3/debug.rb +701 -0
data/lib/antlr3/debug/event-hub.rb +210 -0
data/lib/antlr3/debug/record-event-listener.rb +25 -0
data/lib/antlr3/debug/rule-tracer.rb +55 -0
data/lib/antlr3/debug/socket.rb +360 -0
data/lib/antlr3/debug/trace-event-listener.rb +92 -0
data/lib/antlr3/dfa.rb +247 -0
data/lib/antlr3/dot.rb +174 -0
data/lib/antlr3/error.rb +657 -0
data/lib/antlr3/main.rb +561 -0
data/lib/antlr3/modes/ast-builder.rb +41 -0
data/lib/antlr3/modes/filter.rb +56 -0
data/lib/antlr3/profile.rb +322 -0
data/lib/antlr3/recognizers.rb +1280 -0
data/lib/antlr3/streams.rb +985 -0
data/lib/antlr3/streams/interactive.rb +91 -0
data/lib/antlr3/streams/rewrite.rb +412 -0
data/lib/antlr3/test/call-stack.rb +57 -0
data/lib/antlr3/test/config.rb +23 -0
data/lib/antlr3/test/core-extensions.rb +269 -0
data/lib/antlr3/test/diff.rb +165 -0
data/lib/antlr3/test/functional.rb +207 -0
data/lib/antlr3/test/grammar.rb +371 -0
data/lib/antlr3/token.rb +592 -0
data/lib/antlr3/tree.rb +1415 -0
data/lib/antlr3/tree/debug.rb +163 -0
data/lib/antlr3/tree/visitor.rb +84 -0
data/lib/antlr3/tree/wizard.rb +481 -0
data/lib/antlr3/util.rb +149 -0
data/lib/antlr3/version.rb +27 -0
data/samples/ANTLRv3Grammar.g +621 -0
data/samples/Cpp.g +749 -0
data/templates/AST.stg +335 -0
data/templates/ASTDbg.stg +40 -0
data/templates/ASTParser.stg +153 -0
data/templates/ASTTreeParser.stg +272 -0
data/templates/Dbg.stg +192 -0
data/templates/Ruby.stg +1514 -0
data/test/functional/ast-output/auto-ast.rb +797 -0
data/test/functional/ast-output/construction.rb +555 -0
data/test/functional/ast-output/hetero-nodes.rb +753 -0
data/test/functional/ast-output/rewrites.rb +1327 -0
data/test/functional/ast-output/tree-rewrite.rb +1662 -0
data/test/functional/debugging/debug-mode.rb +689 -0
data/test/functional/debugging/profile-mode.rb +165 -0
data/test/functional/debugging/rule-tracing.rb +74 -0
data/test/functional/delegation/import.rb +379 -0
data/test/functional/lexer/basic.rb +559 -0
data/test/functional/lexer/filter-mode.rb +245 -0
data/test/functional/lexer/nuances.rb +47 -0
data/test/functional/lexer/properties.rb +104 -0
data/test/functional/lexer/syn-pred.rb +32 -0
data/test/functional/lexer/xml.rb +206 -0
data/test/functional/main/main-scripts.rb +245 -0
data/test/functional/parser/actions.rb +224 -0
data/test/functional/parser/backtracking.rb +244 -0
data/test/functional/parser/basic.rb +282 -0
data/test/functional/parser/calc.rb +98 -0
data/test/functional/parser/ll-star.rb +143 -0
data/test/functional/parser/nuances.rb +165 -0
data/test/functional/parser/predicates.rb +103 -0
data/test/functional/parser/properties.rb +242 -0
data/test/functional/parser/rule-methods.rb +132 -0
data/test/functional/parser/scopes.rb +274 -0
data/test/functional/token-rewrite/basic.rb +318 -0
data/test/functional/token-rewrite/via-parser.rb +100 -0
data/test/functional/tree-parser/basic.rb +750 -0
data/test/unit/sample-input/file-stream-1 +2 -0
data/test/unit/sample-input/teststreams.input2 +2 -0
data/test/unit/test-dfa.rb +52 -0
data/test/unit/test-exceptions.rb +44 -0
data/test/unit/test-recognizers.rb +55 -0
data/test/unit/test-scheme.rb +62 -0
data/test/unit/test-streams.rb +459 -0
data/test/unit/test-tree-wizard.rb +535 -0
data/test/unit/test-trees.rb +854 -0
metadata +205 -0

data/templates/ASTTreeParser.stg ADDED

@@ -0,0 +1,272 @@
+group ASTTreeParser;
+gatedAction(block) ::= <<
+<if(backtracking)>
+if <actions.(actionScope).synpredgate>
+  <block>
+end
+<else>
+<block>
+<endif>
+>>
+ruleDeclarations() ::= <<
+<super.ruleDeclarations()>
+_first_0 = nil
+_last = nil<\n>
+>>
+noRewrite(rewriteBlockLevel, treeLevel) ::= <<
+<gatedAction({
+<if(rewriteMode)>
+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
+<endif>
+})>
+>>
+tree(root, actionsAfterRoot, children, nullableChildList,
+     enclosingTreeLevel, treeLevel) ::= <<
+_last = @input.look
+_save_last_<treeLevel> = _last
+_first_<treeLevel> = nil
+<if(!rewriteMode)>
+root_<treeLevel> = @adaptor.create_flat_list!<\n>
+<endif>
+<root:element()>
+<if(rewriteMode)>
+<gatedAction({
+<if(root.el.rule)>
+_first_<enclosingTreeLevel>.nil? and _first_<enclosingTreeLevel> = <root.el.label; format="label">.tree<\n>
+<else>
+_first_<enclosingTreeLevel>.nil? and _first_<enclosingTreeLevel> = <root.el.label; format="label"><\n>
+<endif>
+})>
+<endif>
+<actionsAfterRoot:element()>
+<if(nullableChildList)>
+if @input.peek == DOWN
+  match(DOWN, nil)
+  <children:element()>
+  match(UP, nil)
+end
+<else>
+match(DOWN, nil)
+<children:element()>
+match(UP, nil)<\n>
+<endif>
+<if(!rewriteMode)>
+@adaptor.add_child(root_<enclosingTreeLevel>, root_<treeLevel>)<\n>
+<endif>
+_last = _save_last_<treeLevel>
+>>
+tokenRefBang(token,label,elementIndex) ::= <<
+_last = @input.look
+<super.tokenRef(...)>
+>>
+tokenRef(token,label,elementIndex,hetero) ::= <<
+_last = @input.look
+<super.tokenRef(...)>
+<if(!rewriteMode)>
+<gatedAction({
+<if(hetero)>
+tree_for_<label> = <hetero; format="constantPath">.new(<label; format="label">)
+<else>
+tree_for_<label> = @adaptor.copy_node(<label; format="label">)
+<endif><\n>
+@adaptor.add_child(root_<treeLevel>, tree_for_<label>)
+})>
+<else> <! rewrite mode !>
+<gatedAction({
+_first_<treeLevel> ||= <label; format="label"><\n>
+})>
+<endif>
+>>
+tokenRefAndListLabel(token,label,elementIndex,hetero) ::= <<
+<tokenRef(...)>
+<addToList(elem={<label; format="label">},...)>
+>>
+tokenRefRuleRoot(token,label,elementIndex,hetero) ::= <<
+_last = @input.look
+<super.tokenRef(...)>
+<if(!rewriteMode)>
+<gatedAction({
+<if(hetero)>
+tree_for_<label> = <hetero; format="constantPath">.new(<label; format="label">)
+<else>
+tree_for_<label> = @adaptor.copy_node(<label; format="label">)
+<endif><\n>
+root_<treeLevel> = @adaptor.become_root(tree_for_<label>, root_<treeLevel>)
+})>
+<endif>
+>>
+tokenRefRuleRootAndListLabel(token,label,elementIndex,hetero) ::= <<
+<tokenRefRuleRoot(...)>
+<addToList(elem={<label; format="label">},...)>
+>>
+wildcard(token,label,elementIndex,hetero) ::= <<
+_last = @input.look
+<super.wildcard(...)>
+<if(!rewriteMode)>
+<gatedAction({
+tree_for_<label> = @adaptor.copy_tree(<label; format="label">)
+@adaptor.add_child(root_<treeLevel>, tree_for_<label>)
+})>
+<else> <! rewrite mode !>
+<gatedAction({
+_first_<treeLevel> and _first_<treeLevel> = <label; format="label">
+})>
+<endif>
+>>
+matchSet(s,label,hetero,elementIndex,postmatchCode) ::= <<
+_last = @input.look
+<super.matchSet(..., postmatchCode={
+<if(!rewriteMode)>
+<gatedAction({
+<if(hetero)>
+tree_for_<label> = <hetero; format="constantPath">.new(<label; format="label">)
+<else>
+tree_for_<label> = @adaptor.copy_node(<label; format="label">)
+<endif><\n>
+@adaptor.add_child(root_<treeLevel>, tree_for_<label>)
+})>
+<endif>
+})>
+>>
+matchRuleBlockSet(s,label,hetero,elementIndex,postmatchCode,treeLevel="0") ::= <<
+<matchSet(...)>
+<noRewrite()> <! set return tree !>
+>>
+matchSetBang(s,label,elementIndex,postmatchCode) ::= <<
+_last = @input.look
+<super.matchSet(...)>
+>>
+matchSetRuleRoot(s,label,hetero,elementIndex,debug) ::= <<
+<super.matchSet(..., postmatchCode={
+<if(!rewriteMode)>
+<gatedAction({
+<if(hetero)>
+tree_for_<label> = <hetero; format="constantPath">.new(<label; format="label">)
+<else>
+tree_for_<label> = @adaptor.copy_node(<label; format="label">)
+<endif><\n>
+root_<treeLevel> = @adaptor.become_root(tree_for_<label>, root_<treeLevel>)
+})>
+<endif>
+})>
+>>
+ruleRef(rule,label,elementIndex,args,scope) ::= <<
+_last = @input.look
+<super.ruleRef(...)>
+<gatedAction({
+<if(!rewriteMode)>
+@adaptor.add_child(root_<treeLevel>, <label; format="label">.tree)
+<else> <! rewrite mode !>
+_first_<treeLevel>.nil? and _first_<treeLevel> = <label; format="label">.tree<\n>
+<endif>
+})>
+>>
+ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<
+<ruleRef(...)>
+<addToList(elem={<label; format="label">.tree},...)>
+>>
+ruleRefRuleRoot(rule,label,elementIndex,args,scope) ::= <<
+_last = @input.look
+<super.ruleRef(...)>
+<if(!rewriteMode)>
+<gatedAction({
+root_<treeLevel> = @adaptor.become_root(<label; format="label">.tree, root_<treeLevel>)
+})>
+<endif>
+>>
+ruleRefRuleRootAndListLabel(rule,label,elementIndex,args,scope) ::= <<
+<ruleRefRuleRoot(...)>
+<addToList(elem={<label; format="label">.tree},...)>
+>>
+ruleRefTrack(rule,label,elementIndex,args,scope) ::= <<
+_last = @input.look
+<super.ruleRefTrack(...)>
+>>
+ruleRefTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
+_last = @input.look
+<super.ruleRefTrackAndListLabel(...)>
+>>
+ruleRefRuleRootTrack(rule,label,elementIndex,args,scope) ::= <<
+_last = @input.look
+<super.ruleRefRootTrack(...)>
+>>
+ruleRefRuleRootTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
+_last = @input.look
+<super.ruleRefRuleRootTrackAndListLabel(...)>
+>>
+createRewriteNodeFromElement(token,hetero,scope) ::= <<
+<if(hetero)>
+<hetero; format="constantPath">.new(stream_<token>.next_node)
+<else>
+stream_<token>.next_node
+<endif>
+>>
+ruleCleanUp() ::= <<
+<super.ruleCleanUp()>
+<if(!rewriteMode)>
+<gatedAction({
+return_value.tree = @adaptor.rule_post_processing(root_0)
+})>
+<endif>
+>>

data/templates/Dbg.stg ADDED

@@ -0,0 +1,192 @@
+group Dbg;
+/*
+ [The "BSD licence"]
+ Copyright (c) 2005-2009 Terence Parr
+ 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.
+*/
+@parserBody.mixins() ::= <<
+include ANTLR3::<if(profile)>Profile<else>Debug<endif>::ParserEvents
+>>
+@parserBody.additionalMembers() ::= <<
+<if(grammar.grammarIsRoot)>
+RULE_NAMES = [
+  :invalid_rule, <grammar.allImportedRules:{rST|:<rST.name>}; wrap="\n  ", separator=", ">
+].freeze
+<endif>
+>>
+@rule.body() ::= <<
+in_rule(grammar_file_name, "<ruleName>") do
+  @debug_listener.location(<ruleDescriptor.tree.line>, <ruleDescriptor.tree.column>)
+  <@super.body()>
+  @debug_listener.location(<ruleDescriptor.EORNode.line>, <ruleDescriptor.EORNode.column>)
+end
+>>
+// Common debug event triggers used by region overrides below
+enterSubRule() ::= <<
+in_subrule(<decisionNumber>) do<\n>
+>>
+exitSubRule() ::= <<
+end<\n>
+>>
+enterDecision() ::= <<
+in_decision(<decisionNumber>) do<\n>
+>>
+exitDecision() ::= <<
+end<\n>
+>>
+enterAlt(n) ::= <<
+in_alternative(<n>)<\n>
+>>
+// Region overrides that tell various constructs to add debugging triggers
+@block.body() ::= <<
+in_subrule(<decisionNumber>) do
+  <@super.body()>
+end
+>>
+// @blockBody.predecision() ::= "<enterSubRule()>"
+// @blockBody.postdecision() ::= "<exitDecision()>"
+// @blockBody.postbranch() ::= "<exitSubRule()>"
+@blockBody.decision() ::= <<
+in_decision(<decisionNumber>) do
+  <@super.decision()>
+end
+>>
+@ruleBlock.decision() ::= <<
+in_decision(<decisionNumber>) do
+  <@super.decision()>
+end<\n>
+>>
+@ruleBlockSingleAlt.prealt() ::= "<enterAlt(n={1})>"
+@blockSingleAlt.prealt() ::= "<enterAlt(n={1})>"
+@positiveClosureBlock.loopBody() ::= <<
+in_subrule(<decisionNumber>) do
+  <@super.loopBody()>
+end
+>>
+@positiveClosureBlockLoop.decisionBody() ::= <<
+in_decision(<decisionNumber>) do
+  <@super.decisionBody()>
+end
+>>
+@positiveClosureBlockLoop.earlyExitException() ::= <<
+@debug_listener.recognition_exception(eee)
+>>
+@closureBlock.loopBody() ::= <<
+in_subrule(<decisionNumber>) do
+  <@super.loopBody()>
+end
+>>
+@closureBlockLoop.decisionBody() ::= <<
+in_decision(<decisionNumber>) do
+  <@super.decisionBody()>
+end
+>>
+@altSwitchCase.prealt() ::= "<enterAlt(n=i)>"
+element() ::= <<
+@debug_listener.location(<it.line>, <it.pos>)
+<super.element()>
+>>
+@matchSet.mismatchedSetException() ::= "@debug_listener.recognition_exception(mse)"
+@dfaState.noViableAltException() ::= <<
+@debug_listener.recognition_exception(nvae)
+raise(nvae)
+>>
+@dfaStateSwitch.noViableAltException() ::= <<
+@debug_listener.recognition_exception nvae
+raise nvae
+>>
+dfaDecision(decisionNumber,description) ::= <<
+begin
+  @state.cyclic_decision = true
+  <super.dfaDecision(...)>
+rescue ANTLR3::Error::NoViableAlternative => nvae
+  @debug_listener.recognition_exception(nvae)
+  raise
+end
+>>
+@cyclicDFA.errorMethod() ::= <<
+def error(nvae)
+  @recognizer.debug_listener.recognition_exception(nvae)
+  super
+end
+>>
+/** Force predicate validation to trigger an event */
+evalPredicate(pred,description) ::= <<
+predicate?("<description>") { <pred> }
+>>