mirror of
https://github.com/marcin-szczepanski/jFuzzyLogic.git
synced 2024-12-21 01:05:29 +01:00
258 lines
7.8 KiB
Plaintext
258 lines
7.8 KiB
Plaintext
|
/*
|
||
|
|
[The "BSD licence"]
|
||
|
|
Copyright (c) 2005-2006 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.
|
||
|
|
*/
|
||
|
|
|
||
|
|
/** 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, ...
|
||
|
|
*/
|
||
|
|
group ASTTreeParser;
|
||
|
|
|
||
|
|
/** Add a variable to track last element matched */
|
||
|
|
ruleDeclarations() ::= <<
|
||
|
|
<super.ruleDeclarations()>
|
||
|
|
var _first_0:<ASTLabelType> = null;
|
||
|
|
var _last:<ASTLabelType> = null;<\n>
|
||
|
|
>>
|
||
|
|
|
||
|
|
/** What to emit when there is no rewrite rule. For auto build
|
||
|
|
* mode, does nothing.
|
||
|
|
*/
|
||
|
|
noRewrite(rewriteBlockLevel, treeLevel) ::= <<
|
||
|
|
<if(backtracking)>if ( state.backtracking==0 ) {<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));
|
||
|
|
{
|
||
|
|
var _save_last_<treeLevel>:<ASTLabelType> = _last;
|
||
|
|
var _first_<treeLevel>:<ASTLabelType> = null;
|
||
|
|
<if(!rewriteMode)>
|
||
|
|
var root_<treeLevel>:<ASTLabelType> = <ASTLabelType>(adaptor.nil());
|
||
|
|
<endif>
|
||
|
|
<root:element()>
|
||
|
|
<if(rewriteMode)>
|
||
|
|
<if(backtracking)>if ( state.backtracking==0 )<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)==TokenConstants.DOWN ) {
|
||
|
|
match(input, TokenConstants.DOWN, null); <checkRuleBacktrackFailure()>
|
||
|
|
<children:element()>
|
||
|
|
match(input, TokenConstants.UP, null); <checkRuleBacktrackFailure()>
|
||
|
|
}
|
||
|
|
<else>
|
||
|
|
match(input, TokenConstants.DOWN, null); <checkRuleBacktrackFailure()>
|
||
|
|
<children:element()>
|
||
|
|
match(input, TokenConstants.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) ::= <<
|
||
|
|
_last = <ASTLabelType>(input.LT(1));
|
||
|
|
<super.tokenRef(...)>
|
||
|
|
>>
|
||
|
|
|
||
|
|
/** ID auto construct */
|
||
|
|
tokenRef(token,label,elementIndex,hetero) ::= <<
|
||
|
|
_last = <ASTLabelType>(input.LT(1));
|
||
|
|
<super.tokenRef(...)>
|
||
|
|
<if(!rewriteMode)>
|
||
|
|
<if(backtracking)>if ( state.backtracking==0 ) {<endif>
|
||
|
|
<if(hetero)>
|
||
|
|
<label>_tree = new <hetero>(<label>);
|
||
|
|
<else>
|
||
|
|
<label>_tree = <ASTLabelType>(adaptor.dupNode(<label>));
|
||
|
|
<endif><\n>
|
||
|
|
adaptor.addChild(root_<treeLevel>, <label>_tree);
|
||
|
|
<if(backtracking)>}<endif>
|
||
|
|
<else> <! rewrite mode !>
|
||
|
|
<if(backtracking)>if ( state.backtracking==0 )<endif>
|
||
|
|
if ( _first_<treeLevel>==null ) _first_<treeLevel> = <label>;
|
||
|
|
<endif>
|
||
|
|
>>
|
||
|
|
|
||
|
|
/** label+=TOKEN auto construct */
|
||
|
|
tokenRefAndListLabel(token,label,elementIndex) ::= <<
|
||
|
|
<tokenRef(...)>
|
||
|
|
<listLabel(elem=label,...)>
|
||
|
|
>>
|
||
|
|
|
||
|
|
/** ^(ID ...) auto construct */
|
||
|
|
tokenRefRuleRoot(token,label,elementIndex,hetero) ::= <<
|
||
|
|
_last = <ASTLabelType>(input.LT(1));
|
||
|
|
<super.tokenRef(...)>
|
||
|
|
<if(!rewriteMode)>
|
||
|
|
<if(backtracking)>if ( state.backtracking==0 ) {<endif>
|
||
|
|
<if(hetero)>
|
||
|
|
<label>_tree = new <hetero>(<label>);
|
||
|
|
<else>
|
||
|
|
<label>_tree = <ASTLabelType>(adaptor.dupNode(<label>));
|
||
|
|
<endif><\n>
|
||
|
|
root_<treeLevel> = <ASTLabelType>(adaptor.becomeRoot(<label>_tree, root_<treeLevel>));
|
||
|
|
<if(backtracking)>}<endif>
|
||
|
|
<endif>
|
||
|
|
>>
|
||
|
|
|
||
|
|
/** Match ^(label+=TOKEN ...) auto construct */
|
||
|
|
tokenRefRuleRootAndListLabel(token,label,elementIndex,hetero) ::= <<
|
||
|
|
<tokenRefRuleRoot(...)>
|
||
|
|
<listLabel(elem=label,...)>
|
||
|
|
>>
|
||
|
|
|
||
|
|
// SET AST
|
||
|
|
|
||
|
|
matchSet(s,label,hetero,elementIndex,postmatchCode) ::= <<
|
||
|
|
_last = <ASTLabelType>(input.LT(1));
|
||
|
|
<super.matchSet(..., postmatchCode={
|
||
|
|
<if(!rewriteMode)>
|
||
|
|
<if(backtracking)>if ( state.backtracking==0 ) {<endif>
|
||
|
|
<if(hetero)>
|
||
|
|
<label>_tree = new <hetero>(<label>);
|
||
|
|
<else>
|
||
|
|
<label>_tree = <ASTLabelType>(adaptor.dupNode(<label>));
|
||
|
|
<endif><\n>
|
||
|
|
adaptor.addChild(root_<treeLevel>, <label>_tree);
|
||
|
|
<if(backtracking)>}<endif>
|
||
|
|
<endif>
|
||
|
|
}
|
||
|
|
)>
|
||
|
|
>>
|
||
|
|
|
||
|
|
matchRuleBlockSet(s,label,hetero,elementIndex,postmatchCode,treeLevel="0") ::= <<
|
||
|
|
<matchSet(...)>
|
||
|
|
<noRewrite()> <! set return tree !>
|
||
|
|
>>
|
||
|
|
|
||
|
|
matchSetBang(s,label,elementIndex,postmatchCode) ::= <<
|
||
|
|
_last = <ASTLabelType>(input.LT(1));
|
||
|
|
<super.matchSet(...)>
|
||
|
|
>>
|
||
|
|
|
||
|
|
matchSetRuleRoot(s,label,hetero,elementIndex,debug) ::= <<
|
||
|
|
<super.matchSet(..., postmatchCode={
|
||
|
|
<if(!rewriteMode)>
|
||
|
|
<if(backtracking)>if ( state.backtracking==0 ) {<endif>
|
||
|
|
<if(hetero)>
|
||
|
|
<label>_tree = new <hetero>(<label>);
|
||
|
|
<else>
|
||
|
|
<label>_tree = <ASTLabelType>(adaptor.dupNode(<label>));
|
||
|
|
<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 ( state.backtracking==0 ) <endif>
|
||
|
|
<if(!rewriteMode)>
|
||
|
|
adaptor.addChild(root_<treeLevel>, <label>.getTree());
|
||
|
|
<else> <! rewrite mode !>
|
||
|
|
if ( _first_<treeLevel>==null ) _first_<treeLevel> = <label>.tree;
|
||
|
|
<endif>
|
||
|
|
>>
|
||
|
|
|
||
|
|
/** x+=rule auto construct */
|
||
|
|
ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<
|
||
|
|
<ruleRef(...)>
|
||
|
|
<listLabel(elem=label+".tree",...)>
|
||
|
|
>>
|
||
|
|
|
||
|
|
/** ^(rule ...) auto construct */
|
||
|
|
ruleRefRuleRoot(rule,label,elementIndex,args,scope) ::= <<
|
||
|
|
_last = <ASTLabelType>(input.LT(1));
|
||
|
|
<super.ruleRef(...)>
|
||
|
|
<if(!rewriteMode)>
|
||
|
|
<if(backtracking)>if ( state.backtracking==0 ) <endif>root_<treeLevel> = <ASTLabelType>(adaptor.becomeRoot(<label>.tree, root_<treeLevel>));
|
||
|
|
<endif>
|
||
|
|
>>
|
||
|
|
|
||
|
|
/** ^(x+=rule ...) auto construct */
|
||
|
|
ruleRefRuleRootAndListLabel(rule,label,elementIndex,args,scope) ::= <<
|
||
|
|
<ruleRefRuleRoot(...)>
|
||
|
|
<listLabel(elem=label+".tree",...)>
|
||
|
|
>>
|
||
|
|
|
||
|
|
/** Streams for token refs are tree nodes now; override to
|
||
|
|
* change nextToken to nextNode.
|
||
|
|
*/
|
||
|
|
createRewriteNodeFromElement(token,hetero,scope) ::= <<
|
||
|
|
<if(hetero)>
|
||
|
|
new <hetero>(stream_<token>.nextNode())
|
||
|
|
<else>
|
||
|
|
stream_<token>.nextNode()
|
||
|
|
<endif>
|
||
|
|
>>
|
||
|
|
|
||
|
|
ruleCleanUp() ::= <<
|
||
|
|
<super.ruleCleanUp()>
|
||
|
|
<if(!rewriteMode)>
|
||
|
|
<if(backtracking)>if ( state.backtracking==0 ) {<\n><endif>
|
||
|
|
retval.tree = <ASTLabelType>(adaptor.rulePostProcessing(root_0));
|
||
|
|
<if(backtracking)>}<endif>
|
||
|
|
<endif>
|
||
|
|
>>
|