mirror of
https://github.com/marcin-szczepanski/jFuzzyLogic.git
synced 2024-08-17 10:16:56 +02:00
404 lines
12 KiB
Plaintext
404 lines
12 KiB
Plaintext
![]() |
/*
|
||
|
[The "BSD licence"]
|
||
|
Copyright (c) 2007-2008 Johannes Luber
|
||
|
Copyright (c) 2005-2007 Kunle Odutola
|
||
|
Copyright (c) 2005 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.
|
||
|
*/
|
||
|
group AST;
|
||
|
|
||
|
@outputFile.imports() ::= <<
|
||
|
<@super.imports()>
|
||
|
<if(!TREE_PARSER)><! tree parser would already have imported !>
|
||
|
using Antlr.Runtime.Tree;<\n>
|
||
|
<endif>
|
||
|
>>
|
||
|
|
||
|
@genericParser.members() ::= <<
|
||
|
<@super.members()>
|
||
|
<parserMembers()>
|
||
|
>>
|
||
|
|
||
|
/** Add an adaptor property that knows how to build trees */
|
||
|
parserMembers() ::= <<
|
||
|
protected ITreeAdaptor adaptor = new CommonTreeAdaptor();<\n>
|
||
|
public ITreeAdaptor TreeAdaptor
|
||
|
{
|
||
|
get { return this.adaptor; }
|
||
|
set {
|
||
|
this.adaptor = value;
|
||
|
<grammar.directDelegates:{g|<g:delegateName()>.TreeAdaptor = this.adaptor;}>
|
||
|
}
|
||
|
}
|
||
|
>>
|
||
|
|
||
|
@returnScope.ruleReturnMembers() ::= <<
|
||
|
private <ASTLabelType> tree;
|
||
|
override public object Tree
|
||
|
{
|
||
|
get { return tree; }
|
||
|
set { tree = (<ASTLabelType>) value; }
|
||
|
}
|
||
|
>>
|
||
|
|
||
|
/** Add a variable to track rule's return AST */
|
||
|
ruleDeclarations() ::= <<
|
||
|
<super.ruleDeclarations()>
|
||
|
<ASTLabelType> root_0 = null;<\n>
|
||
|
>>
|
||
|
|
||
|
ruleLabelDefs() ::= <<
|
||
|
<super.ruleLabelDefs()>
|
||
|
<ruleDescriptor.tokenLabels:{<ASTLabelType> <it.label.text>_tree=null;}; separator="\n">
|
||
|
<ruleDescriptor.tokenListLabels:{<ASTLabelType> <it.label.text>_tree=null;}; separator="\n">
|
||
|
<ruleDescriptor.allTokenRefsInAltsWithRewrites
|
||
|
:{RewriteRule<rewriteElementType>Stream stream_<it> = new RewriteRule<rewriteElementType>Stream(adaptor,"token <it>");}; separator="\n">
|
||
|
<ruleDescriptor.allRuleRefsInAltsWithRewrites
|
||
|
:{RewriteRuleSubtreeStream stream_<it> = new RewriteRuleSubtreeStream(adaptor,"rule <it>");}; separator="\n">
|
||
|
>>
|
||
|
|
||
|
/** When doing auto AST construction, we must define some variables;
|
||
|
* These should be turned off if doing rewrites. This must be a "mode"
|
||
|
* as a rule could have both rewrite and AST within the same alternative
|
||
|
* block.
|
||
|
*/
|
||
|
@alt.declarations() ::= <<
|
||
|
<if(autoAST)>
|
||
|
<if(outerAlt)>
|
||
|
<if(!rewriteMode)>
|
||
|
root_0 = (<ASTLabelType>)adaptor.GetNilNode();<\n>
|
||
|
<endif>
|
||
|
<endif>
|
||
|
<endif>
|
||
|
>>
|
||
|
|
||
|
// T r a c k i n g R u l e E l e m e n t s
|
||
|
|
||
|
/** ID and track it for use in a rewrite rule */
|
||
|
tokenRefTrack(token,label,elementIndex,hetero) ::= <<
|
||
|
<tokenRefBang(...)> <! Track implies no auto AST construction!>
|
||
|
<if(backtracking)>if ( state.backtracking==0 ) <endif>stream_<token>.Add(<label>);<\n>
|
||
|
>>
|
||
|
|
||
|
/** ids+=ID and track it for use in a rewrite rule; adds to ids *and*
|
||
|
* to the tracking list stream_ID for use in the rewrite.
|
||
|
*/
|
||
|
tokenRefTrackAndListLabel(token,label,elementIndex,hetero) ::= <<
|
||
|
<tokenRefTrack(...)>
|
||
|
<listLabel(elem=label,...)>
|
||
|
>>
|
||
|
|
||
|
/** ^(ID ...) track for rewrite */
|
||
|
tokenRefRuleRootTrack(token,label,elementIndex,hetero) ::= <<
|
||
|
<tokenRefBang(...)>
|
||
|
<if(backtracking)>if ( state.backtracking==0 ) <endif>stream_<token>.Add(<label>);<\n>
|
||
|
>>
|
||
|
|
||
|
/** Match ^(label+=TOKEN ...) track for rewrite */
|
||
|
tokenRefRuleRootTrackAndListLabel(token,label,elementIndex,hetero) ::= <<
|
||
|
<tokenRefRuleRootTrack(...)>
|
||
|
<listLabel(elem=label,...)>
|
||
|
>>
|
||
|
|
||
|
wildcardTrack(label,elementIndex) ::= <<
|
||
|
<super.wildcard(...)>
|
||
|
>>
|
||
|
|
||
|
/** rule when output=AST and tracking for rewrite */
|
||
|
ruleRefTrack(rule,label,elementIndex,args,scope) ::= <<
|
||
|
<super.ruleRef(...)>
|
||
|
<if(backtracking)>if ( state.backtracking==0 ) <endif>stream_<rule.name>.Add(<label>.Tree);
|
||
|
>>
|
||
|
|
||
|
/** x+=rule when output=AST and tracking for rewrite */
|
||
|
ruleRefTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
|
||
|
<ruleRefTrack(...)>
|
||
|
<listLabel(elem=label+".Tree",...)>
|
||
|
>>
|
||
|
|
||
|
/** ^(rule ...) rewrite */
|
||
|
ruleRefRuleRootTrack(rule,label,elementIndex,args,scope) ::= <<
|
||
|
<ruleRefRuleRoot(...)>
|
||
|
<if(backtracking)>if ( state.backtracking==0 ) <endif>stream_<rule>.Add(<label>.Tree);
|
||
|
>>
|
||
|
|
||
|
/** ^(x+=rule ...) rewrite */
|
||
|
ruleRefRuleRootTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
|
||
|
<ruleRefRuleRootTrack(...)>
|
||
|
<listLabel(elem=label+".Tree",...)>
|
||
|
>>
|
||
|
|
||
|
// R e w r i t e
|
||
|
|
||
|
rewriteCode(
|
||
|
alts, description,
|
||
|
referencedElementsDeep, // ALL referenced elements to right of ->
|
||
|
referencedTokenLabels,
|
||
|
referencedTokenListLabels,
|
||
|
referencedRuleLabels,
|
||
|
referencedRuleListLabels,
|
||
|
rewriteBlockLevel, enclosingTreeLevel, treeLevel) ::=
|
||
|
<<
|
||
|
|
||
|
// AST REWRITE
|
||
|
// elements: <referencedElementsDeep; separator=", ">
|
||
|
// token labels: <referencedTokenLabels; separator=", ">
|
||
|
// rule labels: <referencedRuleLabels; separator=", ">
|
||
|
// token list labels: <referencedTokenListLabels; separator=", ">
|
||
|
// rule list labels: <referencedRuleListLabels; separator=", ">
|
||
|
<if(backtracking)>
|
||
|
if ( state.backtracking==0 ) {<\n>
|
||
|
<endif>
|
||
|
<prevRuleRootRef()>.Tree = root_0;
|
||
|
<rewriteCodeLabels()>
|
||
|
root_0 = (<ASTLabelType>)adaptor.GetNilNode();
|
||
|
<alts:rewriteAlt(); separator="else ">
|
||
|
<! if tree parser and rewrite=true !>
|
||
|
<if(TREE_PARSER)>
|
||
|
<if(rewriteMode)>
|
||
|
<prevRuleRootRef()>.Tree = (<ASTLabelType>)adaptor.rulePostProcessing(root_0);
|
||
|
input.ReplaceChildren(adaptor.GetParent(retval.Start),
|
||
|
adaptor.GetChildIndex(retval.Start),
|
||
|
adaptor.GetChildIndex(_last),
|
||
|
retval.Tree);
|
||
|
<endif>
|
||
|
<endif>
|
||
|
<! if parser or rewrite!=true, we need to set result !>
|
||
|
<if(!TREE_PARSER)>
|
||
|
<prevRuleRootRef()>.Tree = root_0;
|
||
|
<endif>
|
||
|
<if(!rewriteMode)>
|
||
|
<prevRuleRootRef()>.Tree = root_0;
|
||
|
<endif>
|
||
|
<if(backtracking)>
|
||
|
}
|
||
|
<endif>
|
||
|
>>
|
||
|
|
||
|
rewriteCodeLabels() ::= <<
|
||
|
<referencedTokenLabels
|
||
|
:{RewriteRule<rewriteElementType>Stream stream_<it> = new RewriteRule<rewriteElementType>Stream(adaptor, "token <it>", <it>);};
|
||
|
separator="\n"
|
||
|
>
|
||
|
<referencedTokenListLabels
|
||
|
:{RewriteRule<rewriteElementType>Stream stream_<it> = new RewriteRule<rewriteElementType>Stream(adaptor,"token <it>", list_<it>);};
|
||
|
separator="\n"
|
||
|
>
|
||
|
<referencedRuleLabels
|
||
|
:{RewriteRuleSubtreeStream stream_<it> = new RewriteRuleSubtreeStream(adaptor, "token <it>", (<it>!=null ? <it>.Tree : null));};
|
||
|
separator="\n"
|
||
|
>
|
||
|
<referencedRuleListLabels
|
||
|
:{RewriteRuleSubtreeStream stream_<it> = new RewriteRuleSubtreeStream(adaptor, "token <it>", list_<it>);};
|
||
|
separator="\n"
|
||
|
>
|
||
|
>>
|
||
|
|
||
|
/** Generate code for an optional rewrite block; note it uses the deep ref'd element
|
||
|
* list rather shallow like other blocks.
|
||
|
*/
|
||
|
rewriteOptionalBlock(
|
||
|
alt,rewriteBlockLevel,
|
||
|
referencedElementsDeep, // all nested refs
|
||
|
referencedElements, // elements in immediately block; no nested blocks
|
||
|
description) ::=
|
||
|
<<
|
||
|
// <fileName>:<description>
|
||
|
if ( <referencedElementsDeep:{el | stream_<el>.HasNext()}; separator=" || "> )
|
||
|
{
|
||
|
<alt>
|
||
|
}
|
||
|
<referencedElementsDeep:{el | stream_<el>.Reset();<\n>}>
|
||
|
>>
|
||
|
|
||
|
rewriteClosureBlock(
|
||
|
alt,rewriteBlockLevel,
|
||
|
referencedElementsDeep, // all nested refs
|
||
|
referencedElements, // elements in immediately block; no nested blocks
|
||
|
description) ::=
|
||
|
<<
|
||
|
// <fileName>:<description>
|
||
|
while ( <referencedElements:{el | stream_<el>.HasNext()}; separator=" || "> )
|
||
|
{
|
||
|
<alt>
|
||
|
}
|
||
|
<referencedElements:{el | stream_<el>.Reset();<\n>}>
|
||
|
>>
|
||
|
|
||
|
rewritePositiveClosureBlock(
|
||
|
alt,rewriteBlockLevel,
|
||
|
referencedElementsDeep, // all nested refs
|
||
|
referencedElements, // elements in immediately block; no nested blocks
|
||
|
description) ::=
|
||
|
<<
|
||
|
if ( !(<referencedElements:{el | stream_<el>.HasNext()}; separator=" || ">) ) {
|
||
|
throw new RewriteEarlyExitException();
|
||
|
}
|
||
|
while ( <referencedElements:{el | stream_<el>.HasNext()}; separator=" || "> )
|
||
|
{
|
||
|
<alt>
|
||
|
}
|
||
|
<referencedElements:{el | stream_<el>.Reset();<\n>}>
|
||
|
>>
|
||
|
|
||
|
rewriteAlt(a) ::= <<
|
||
|
// <a.description>
|
||
|
<if(a.pred)>
|
||
|
if (<a.pred>)
|
||
|
{
|
||
|
<a.alt>
|
||
|
}<\n>
|
||
|
<else>
|
||
|
{
|
||
|
<a.alt>
|
||
|
}<\n>
|
||
|
<endif>
|
||
|
>>
|
||
|
|
||
|
/** For empty rewrites: "r : ... -> ;" */
|
||
|
rewriteEmptyAlt() ::= "root_0 = null;"
|
||
|
|
||
|
rewriteTree(root,children,description,enclosingTreeLevel,treeLevel) ::= <<
|
||
|
// <fileName>:<description>
|
||
|
{
|
||
|
<ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.GetNilNode();
|
||
|
<root:rewriteElement()>
|
||
|
<children:rewriteElement()>
|
||
|
adaptor.AddChild(root_<enclosingTreeLevel>, root_<treeLevel>);
|
||
|
}<\n>
|
||
|
>>
|
||
|
|
||
|
rewriteElementList(elements) ::= "<elements:rewriteElement()>"
|
||
|
|
||
|
rewriteElement(e) ::= <<
|
||
|
<@pregen()>
|
||
|
<e.el>
|
||
|
>>
|
||
|
|
||
|
/** Gen ID or ID[args] */
|
||
|
rewriteTokenRef(token,elementIndex,hetero,args) ::= <<
|
||
|
adaptor.AddChild(root_<treeLevel>, <createRewriteNodeFromElement(...)>);<\n>
|
||
|
>>
|
||
|
|
||
|
/** Gen $label ... where defined via label=ID */
|
||
|
rewriteTokenLabelRef(label,elementIndex) ::= <<
|
||
|
adaptor.AddChild(root_<treeLevel>, stream_<label>.NextNode());<\n>
|
||
|
>>
|
||
|
|
||
|
/** Gen $label ... where defined via label+=ID */
|
||
|
rewriteTokenListLabelRef(label,elementIndex) ::= <<
|
||
|
adaptor.AddChild(root_<treeLevel>, stream_<label>.NextNode());<\n>
|
||
|
>>
|
||
|
|
||
|
/** Gen ^($label ...) */
|
||
|
rewriteTokenLabelRefRoot(label,elementIndex) ::= <<
|
||
|
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.NextNode(), root_<treeLevel>);<\n>
|
||
|
>>
|
||
|
|
||
|
/** Gen ^($label ...) where label+=... */
|
||
|
rewriteTokenListLabelRefRoot ::= rewriteTokenLabelRefRoot
|
||
|
|
||
|
/** Gen ^(ID ...) or ^(ID[args] ...) */
|
||
|
rewriteTokenRefRoot(token,elementIndex,hetero,args) ::= <<
|
||
|
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<createRewriteNodeFromElement(...)>, root_<treeLevel>);<\n>
|
||
|
>>
|
||
|
|
||
|
rewriteImaginaryTokenRef(args,token,hetero,elementIndex) ::= <<
|
||
|
adaptor.AddChild(root_<treeLevel>, <createImaginaryNode(tokenType=token, ...)>);<\n>
|
||
|
>>
|
||
|
|
||
|
rewriteImaginaryTokenRefRoot(args,token,hetero,elementIndex) ::= <<
|
||
|
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<createImaginaryNode(tokenType=token, ...)>, root_<treeLevel>);<\n>
|
||
|
>>
|
||
|
|
||
|
/** plain -> {foo} action */
|
||
|
rewriteAction(action) ::= <<
|
||
|
root_0 = <action>;<\n>
|
||
|
>>
|
||
|
|
||
|
/** What is the name of the previous value of this rule's root tree? This
|
||
|
* let's us refer to $rule to mean previous value. I am reusing the
|
||
|
* variable 'tree' sitting in retval struct to hold the value of root_0 right
|
||
|
* before I set it during rewrites. The assign will be to retval.Tree.
|
||
|
*/
|
||
|
prevRuleRootRef() ::= "retval"
|
||
|
|
||
|
rewriteRuleRef(rule) ::= <<
|
||
|
adaptor.AddChild(root_<treeLevel>, stream_<rule>.NextTree());<\n>
|
||
|
>>
|
||
|
|
||
|
rewriteRuleRefRoot(rule) ::= <<
|
||
|
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<rule>.NextNode(), root_<treeLevel>);<\n>
|
||
|
>>
|
||
|
|
||
|
rewriteNodeAction(action) ::= <<
|
||
|
adaptor.AddChild(root_<treeLevel>, <action>);<\n>
|
||
|
>>
|
||
|
|
||
|
rewriteNodeActionRoot(action) ::= <<
|
||
|
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<action>, root_<treeLevel>);<\n>
|
||
|
>>
|
||
|
|
||
|
/** Gen $ruleLabel ... where defined via ruleLabel=rule */
|
||
|
rewriteRuleLabelRef(label) ::= <<
|
||
|
adaptor.AddChild(root_<treeLevel>, stream_<label>.NextTree());<\n>
|
||
|
>>
|
||
|
|
||
|
/** Gen $ruleLabel ... where defined via ruleLabel+=rule */
|
||
|
rewriteRuleListLabelRef(label) ::= <<
|
||
|
adaptor.AddChild(root_<treeLevel>, stream_<label>.NextTree());<\n>
|
||
|
>>
|
||
|
|
||
|
/** Gen ^($ruleLabel ...) where ruleLabel=rule */
|
||
|
rewriteRuleLabelRefRoot(label) ::= <<
|
||
|
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.NextNode(), root_<treeLevel>);<\n>
|
||
|
>>
|
||
|
|
||
|
/** Gen ^($ruleLabel ...) where ruleLabel+=rule */
|
||
|
rewriteRuleListLabelRefRoot(label) ::= <<
|
||
|
root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.NextNode(), root_<treeLevel>);<\n>
|
||
|
>>
|
||
|
|
||
|
createImaginaryNode(tokenType,hetero,args) ::= <<
|
||
|
<if(hetero)>
|
||
|
<! new MethodNode(IDLabel, args) !>
|
||
|
new <hetero>(<tokenType><if(args)>, <args; separator=", "><endif>)
|
||
|
<else>
|
||
|
(<ASTLabelType>)adaptor.Create(<tokenType>, <args; separator=", "><if(!args)>"<tokenType>"<endif>)
|
||
|
<endif>
|
||
|
>>
|
||
|
|
||
|
createRewriteNodeFromElement(token,hetero,args) ::= <<
|
||
|
<if(hetero)>
|
||
|
new <hetero>(stream_<token>.NextToken()<if(args)>, <args; separator=", "><endif>)
|
||
|
<else>
|
||
|
<if(args)> <! must create new node from old !>
|
||
|
adaptor.Create(<token>, <args; separator=", ">)
|
||
|
<else>
|
||
|
stream_<token>.NextNode()
|
||
|
<endif>
|
||
|
<endif>
|
||
|
>>
|