mirror of
https://github.com/marcin-szczepanski/jFuzzyLogic.git
synced 2024-12-23 09:40:29 +01:00
98 lines
3.2 KiB
Plaintext
98 lines
3.2 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.
|
|
*/
|
|
|
|
/** Template overrides to add debugging to AST stuff. Dynamic inheritance
|
|
* hierarchy is set up as ASTDbg : AST : Dbg : C# by code generator.
|
|
*/
|
|
group ASTDbg;
|
|
|
|
parserMembers() ::= <<
|
|
protected DebugTreeAdaptor adaptor;
|
|
public ITreeAdaptor TreeAdaptor
|
|
{
|
|
get {
|
|
<if(grammar.grammarIsRoot)>
|
|
return this.adaptor;
|
|
<else>
|
|
this.adaptor = (DebugTreeAdaptor)adaptor; // delegator sends dbg adaptor
|
|
<endif><\n>
|
|
<grammar.directDelegates:{g|<g:delegateName()>.TreeAdaptor = this.adaptor;}>
|
|
}
|
|
set { this.adaptor = new DebugTreeAdaptor(dbg, value); }
|
|
}<\n>
|
|
>>
|
|
|
|
parserCtorBody() ::= <<
|
|
<super.parserCtorBody()>
|
|
>>
|
|
|
|
createListenerAndHandshake() ::= <<
|
|
DebugEventSocketProxy proxy = new DebugEventSocketProxy(this, port, adaptor);
|
|
DebugListener = proxy;
|
|
<!
|
|
Original line follows, replaced by the next two ifs:
|
|
set<inputStreamType>(new Debug<inputStreamType>(input,proxy));
|
|
!>
|
|
<if(PARSER)>
|
|
TokenStream = new DebugTokenStream(input,proxy);<\n>
|
|
<endif>
|
|
<if(TREE_PARSER)>
|
|
TokenStream = new DebugTreeNodeStream(input,proxy);<\n>
|
|
<endif>
|
|
try {
|
|
proxy.Handshake();
|
|
} catch (IOException ioe) {
|
|
ReportError(ioe);
|
|
}
|
|
>>
|
|
|
|
@ctorForRootGrammar.finally() ::= <<
|
|
ITreeAdaptor adap = new CommonTreeAdaptor();
|
|
TreeAdaptor = adap;
|
|
proxy.TreeAdaptor = adap;
|
|
>>
|
|
|
|
@ctorForProfilingRootGrammar.finally() ::=<<
|
|
ITreeAdaptor adap = new CommonTreeAdaptor();
|
|
TreeAdaptor = adap;
|
|
proxy.TreeAdaptor = adap;
|
|
>>
|
|
|
|
@ctorForPredefinedListener.superClassRef() ::= "base(input, dbg)"
|
|
|
|
@ctorForPredefinedListener.finally() ::=<<
|
|
<if(grammar.grammarIsRoot)> <! don't create new adaptor for delegates !>
|
|
ITreeAdaptor adap = new CommonTreeAdaptor();
|
|
TreeAdaptor = adap;<\n>
|
|
<endif>
|
|
>>
|
|
|
|
@rewriteElement.pregen() ::= "dbg.Location(<e.line>,<e.pos>);"
|