org.cassandraunit.shaded.org.antlr.codegen.templates.ObjC.ObjC.stg Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of cassandra-unit-shaded Show documentation
Shaded version of cassandra-unit
There is a newer version: 4.3.1.0
Show newest version
/*
 [The "BSD license"]
 Copyright (c) 2006, 2007 Kay Roepke 2010 Alan Condit
 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 group file for the Objective C code generator.
 *  Heavily based on Java.stg
 *
 *  Written by Kay Roepke 
 *  Modified by Alan Condit 
 *
 *  This file is part of ANTLR and subject to the same license as ANTLR itself.
 */

objcTypeInitMap ::= [
    "int"           : "0",              // Integers     start out being 0
    "long"          : "0",              // Longs        start out being 0
    "float"         : "0.0",            // Floats       start out being 0
    "double"        : "0.0",            // Doubles      start out being 0
    "BOOL"          : "NO",             // Booleans     start out being Antlr ObjC for false
    "byte"          : "0",              // Bytes        start out being 0
    "short"         : "0",              // Shorts       start out being 0
    "char"          : "0",              // Chars        start out being 0
    "id"            : "nil",            // ids          start out being nil
    default         : "nil"             // anything other than an atomic type
]

// System.Boolean.ToString() returns "True" and "False", but the proper C# literals are "true" and "false"
// The Java version of Boolean returns "true" and "false", so they map to themselves here.
booleanLiteral ::= [
	"True":"true",
	"False":"false",
	"true":"YES",
	"false":"NO",
	default:"NO"
]


className() ::= "LexerTreeParser!>"
leadIn(type) ::=
<<
/** \file
 *  This  file was generated by $ANTLR version 
 *
 *     -  From the grammar source file : 
 *     -                            On : 

 *     -                 for the lexer : Lexer


 *     -                for the parser : Parser


 *     -           for the tree parser : TreeParser

 *
 * Editing it, at least manually, is not wise.
 *
 * ObjC language generator and runtime by Alan Condit, acondit|hereisanat|ipns|dotgoeshere|com.
 *
 *
>>

/** The overall file structure of a recognizer; stores methods for rules
 *  and cyclic DFAs plus support code.
 */
outputFile( LEXER,
            PARSER,
            TREE_PARSER,
            actionScope,
            actions,
            docComment,
            recognizer,
            name,
            tokens,
            tokenNames,
            rules,
            cyclicDFAs,
            bitsets,
            buildTemplate,
            buildAST,
            rewriteMode,
            profile,
            backtracking,
            synpreds,
            memoize,
            numRules,
            fileName,
            ANTLRVersion,
            generatedTimestamp,
            trace,
            scopes,
            superClass,
            literals
            ) ::=
<<

*/
// $ANTLR   


/* =============================================================================
 * This is what the grammar programmer asked us to put at the top of every file.
 */

/* End of Header action.
 * =============================================================================
 */
 !>

/* -----------------------------------------
 * Include the ANTLR3 generated header file.
 */
#import "LexerTreeParser!>.h"

/* ----------------------------------------- */




/** String literals used by  that we must do things like MATCHS() with.
 *  C will normally just lay down 8 bit characters, and you can use L"xxx" to
 *  get wchar_t, but wchar_t is 16 bits on Windows, which is not UTF32 and so
 *  we perform this little trick of defining the literals as arrays of UINT32
 *  and passing in the address of these.
 */
[]  = ;}; separator="\n">



/* ============================================================================= */
/* =============================================================================
 * Start of recognizer
 */

>>
headerFileExtension() ::= ".h"

headerFile( LEXER,
            PARSER,
            TREE_PARSER,
            actionScope,
            actions,
            docComment,
            recognizer,
            name,
            tokens,
            tokenNames,
            rules,
            cyclicDFAs,
            bitsets,
            buildTemplate,
            buildAST,
            rewriteMode,
            profile,
            backtracking,
            synpreds,
            memoize,
            numRules,
            fileName,
            ANTLRVersion,
            generatedTimestamp,
            trace,
            scopes,
            superClass,
            literals
          ) ::=
<<
// $ANTLR   

<@imports>

/* =============================================================================
 * Standard antlr OBJC runtime definitions
 */
#import \
#import \
/* End of standard antlr3 runtime definitions
 * =============================================================================
 */

<@end>











>>

lexerHeaderFile( LEXER,
            PARSER,
            TREE_PARSER,
            actionScope,
            actions,
            docComment,
            recognizer,
            name,
            tokens,
            tokenNames,
            rules,
            cyclicDFAs,
            bitsets,
            buildTemplate,
            profile,
            backtracking,
            synpreds,
            memoize,
            numRules,
            fileName,
            ANTLRVersion,
            generatedTimestamp,
            trace,
            scopes,
            superClass="Lexer"
            ) ::=
<<


/* =============================================================================
 * This is what the grammar programmer asked us to put at the top of every file.
 */

/* End of Header action.
 * =============================================================================
 */


/* Start cyclicDFAInterface */


#pragma mark Rule return scopes Interface start
}>}>
#pragma mark Rule return scopes Interface end
#pragma mark Tokens
#ifndef TOKENLISTAlreadyDefined
#define TOKENLISTAlreadyDefined 1
#ifdef EOF
#undef EOF
#endif
 }; separator="\n">
#endif
/* interface lexer class */
@interface  <@superClassName>: <@end> { // line 283
 *dfa;}; separator="\n">
Selector;}; separator="\n">
/* ObjC start of actions.lexer.memVars */

/* ObjC end of actions.lexer.memVars */
}
+ (void) initialize;
+ ( *)newWithCharStream:(id\)anInput;
/* ObjC start actions.lexer.methodsDecl */

/* ObjC end actions.lexer.methodsDecl */
}>) m_fragment ; }; separator="\n"><\n>
@end /* end of  interface */<\n>
>>

headerReturnScope(ruleDescriptor) ::= ""
headerReturnType(ruleDescriptor) ::= <<


 void

 


 

>>
// Produce the lexer output
lexer(  grammar,
        name,
        tokens,
        scopes,
        rules,
        numRules,
        filterMode,
        labelType="CommonToken",
        superClass="Lexer"
        ) ::= <<


/** As per Terence: No returns for lexer rules! */
}>
}>
#pragma mark Rule return scopes end
!>
@implementation  // line 330

+ (void) initialize
{
    [BaseRecognizer setGrammarFileName:@""];
}

+ (NSString *) tokenNameForType:(NSInteger)aTokenType
{
    return [[self getTokenNames] objectAtIndex:aTokenType];
}

+ ( *)newWithCharStream:(id\)anInput
{
    return [[ alloc] initWithCharStream:anInput];
}

- (id) initWithCharStream:(id\)anInput
{
    self = [super initWithCharStream:anInput State:[RecognizerSharedState newRecognizerSharedStateWithRuleLen:+1]];
    if ( self != nil ) {

        if ( state.ruleMemo == nil ) {
            state.ruleMemo = [[RuleStack newRuleStackWithSize:+1] retain];
        }
        if ( [state.ruleMemo count] == 0 ) {
            // initialize the memoization cache - the indices are 1-based in the runtime code!
            
            for (NSInteger i = 0; i \< ; i++) {
                [state.ruleMemo addObject:[HashRule newHashRuleWithLen:17]];
            }
        }

        };separator="\n">
         = [DFA newDFAWithRecognizer:self];}; separator="\n">
        
    }
    return self;
}

- (void) dealloc
{
     release];}; separator="\n">

    [super dealloc];
}

/* ObjC Start of actions.lexer.methods */

/* ObjC end of actions.lexer.methods */
/* ObjC start methods() */
<@methods()>
/* ObjC end methods() */


- (void) reset
{
    
    [super reset];
}





/* Start of Rules */


@end /* end of  implementation line 397 */
>>

/** A override of Lexer.nextToken() that backtracks over mTokens() looking
 *  for matches.  No error can be generated upon error; just rewind, consume
 *  a token and then try again.  backtracking needs to be set as well.
 *  Make rule memoization happen only at levels above 1 as we start mTokens
 *  at backtracking==1.
 */
filteringNextToken() ::= <<
- (id\) nextToken
{
    while (YES) {
        if ( [input LA:1] == CharStreamEOF ) {
            return [ eofToken];
        }
        state.token = nil;
        state.channel = TokenChannelDefault;
        state.tokenStartCharIndex = input.index;
        state.tokenStartCharPositionInLine = input.charPositionInLine;
        state.tokenStartLine = input.line;
        state.text = nil;
        @try {
            NSInteger m = [input mark];
            state.backtracking = 1; /* means we won't throw slow exception */
            state.failed = NO;
            [self mTokens];
            state.backtracking = 0;
            /* mTokens backtracks with synpred at backtracking==2
               and we set the synpredgate to allow actions at level 1. */
            if ( state.failed ) {
                [input rewind:m];
                [input consume]; /* advance one char and try again */
            } else {
                [self emit];
                return state.token;
            }
        }
        @catch (RecognitionException *re) {
            // shouldn't happen in backtracking mode, but...
            [self reportError:re];
            [self recover:re];
        }
    }
}

- (void)memoize:(id\)anInput
      RuleIndex:(NSInteger)ruleIndex
     StartIndex:(NSInteger)ruleStartIndex
{
    if ( state.backtracking > 1 ) [super memoize:anInput RuleIndex:ruleIndex StartIndex:ruleStartIndex];
}

- (BOOL)alreadyParsedRule:(id\)anInput RuleIndex:(NSInteger)ruleIndex
{
    if ( state.backtracking > 1 ) return [super alreadyParsedRule:anInput RuleIndex:ruleIndex];
    return NO;
}
>>

actionGate() ::= "state.backtracking == 0"

filteringActionGate() ::= "state.backtracking == 1"

parserHeaderFile( LEXER,
            PARSER,
            TREE_PARSER,
            actionScope,
            actions,
            docComment,
            recognizer,
            name,
            tokens,
            tokenNames,
            rules,
            cyclicDFAs,
            bitsets,
            buildTemplate,
            profile,
            backtracking,
            synpreds,
            memoize,
            numRules,
            fileName,
            ANTLRVersion,
            generatedTimestamp,
            trace,
            scopes,
            literals,
            superClass="Parser"
            ) ::= <<
/* parserHeaderFile */
",...)>
>>

treeParserHeaderFile( LEXER,
            PARSER,
            TREE_PARSER,
            actionScope,
            actions,
            docComment,
            recognizer,
            name,
            tokens,
            tokenNames,
            rules,
            cyclicDFAs,
            bitsets,
            buildTemplate,
            profile,
            backtracking,
            synpreds,
            memoize,
            numRules,
            fileName,
            ANTLRVersion,
            generatedTimestamp,
            trace,
            scopes,
            literals,
            superClass="TreeParser"
            ) ::= <<
/* treeParserHeaderFile */
",...)>
>>

genericParserHeaderFile( LEXER,
            PARSER,
            TREE_PARSER,
            actionScope,
            actions,
            docComment,
            recognizer,
            name,
            tokens,
            tokenNames,
            rules,
            cyclicDFAs,
            bitsets,
            buildTemplate,
            profile,
            backtracking,
            synpreds,
            memoize,
            numRules,
            fileName,
            ANTLRVersion,
            generatedTimestamp,
            trace,
            scopes,
            superClass,
            literals,
            inputStreamType
            ) ::=
<<

/* =============================================================================
 * This is what the grammar programmer asked us to put at the top of every file.
 */

/* End of Header action.
 * =============================================================================
 */


#ifndef ANTLR3TokenTypeAlreadyDefined
#define ANTLR3TokenTypeAlreadyDefined
typedef enum {
    ANTLR_EOF = -1,
    INVALID,
    EOR,
    DOWN,
    UP,
    MIN
} ANTLR3TokenType;
#endif


#pragma mark Tokens
#ifndef TOKENLISTAlreadyDefined
#define TOKENLISTAlreadyDefined 1
#ifdef EOF
#undef EOF
#endif
 }; separator="\n">
#endif
#pragma mark Dynamic Global Scopes globalAttributeScopeInterface
}>
#pragma mark Dynamic Rule Scopes ruleAttributeScopeInterface
}>}>
#pragma mark Rule Return Scopes returnScopeInterface
}>}>

/* Interface grammar class */
@interface  <@superClassName> : <@end> { /* line 572 */
#pragma mark Dynamic Rule Scopes ruleAttributeScopeDecl
}>
#pragma mark Dynamic Global Rule Scopes globalAttributeScopeMemVar
}><\n>
/* ObjC start of actions.(actionScope).memVars */

/* ObjC end of actions.(actionScope).memVars */
/* ObjC start of memVars */
<@memVars()>
/* ObjC end of memVars */

 *dfa;}; separator="\n">
Selector;}; separator="\n">
 }

/* ObjC start of actions.(actionScope).properties */

/* ObjC end of actions.(actionScope).properties */
/* ObjC start of properties */
<@properties()>
/* ObjC end of properties */

+ (void) initialize;
+ ( *) new:()aStream;
/* ObjC start of actions.(actionScope).methodsDecl */

/* ObjC end of actions.(actionScope).methodsDecl */

/* ObjC start of methodsDecl */
<@methodsDecl()>
/* ObjC end of methodsDecl */

}>)_fragment; }; separator="\n"><\n>

@end /* end of  interface */<\n>
>>

parser( grammar,
        name,
        scopes,
        tokens,
        tokenNames,
        rules,
        numRules,
        bitsets,
        ASTLabelType="CommonTree",
        superClass="Parser",
        labelType="CommonToken",
        members={}
        ) ::= <<
", rewriteElementType="Token", ...)>
>>

/** How to generate a tree parser; same as parser except the input
 *  stream is a different type.
 */
treeParser( grammar,
        name,
        scopes,
        tokens,
        tokenNames,
        globalAction,
        rules,
        numRules,
        bitsets,
        filterMode,
        labelType={},
        ASTLabelType="CommonTree",
        superClass={TreeRewriterTreeFilterTreeParser},
        members={}
        ) ::= <<
", rewriteElementType="Node", ...)>
>>

/** How to generate a parser */
genericParser(  grammar,
        name,
        scopes,
        tokens,
        tokenNames,
        rules,
        numRules,
        cyclicDFAs,          // parser init -- initializes the DFAs
        bitsets,
        labelType,
        ASTLabelType,
        superClass,
        members,
        filterMode,
        rewriteElementType,
        inputStreamType
        ) ::= <<


#pragma mark Bitsets
_in_}, words64=it.bits)>}>

#pragma mark Dynamic Global globalAttributeScopeImplementation
}>

#pragma mark Dynamic Rule Scopes ruleAttributeScopeImplementation
}>}>

#pragma mark Rule Return Scopes returnScopeImplementation
}>}>

@implementation   // line 637

/* ObjC start of ruleAttributeScope */
#pragma mark Dynamic Rule Scopes ruleAttributeScope
}>
/* ObjC end of ruleAttributeScope */
#pragma mark global Attribute Scopes globalAttributeScope
/* ObjC start globalAttributeScope */
}>
/* ObjC end globalAttributeScope */
/* ObjC start actions.(actionScope).synthesize */

/* ObjC start synthesize() */
<@synthesize()>

+ (void) initialize
{
    #pragma mark Bitsets
    _in_}, words64=it.bits)>}>
    [BaseRecognizer setTokenNames:[[AMutableArray arrayWithObjects:@"\", @"\", @"\", @"\", }; separator=", ", wrap="\n ">, nil] retain]];
    [BaseRecognizer setGrammarFileName:@""];
    }>
}

+ ( *)new:()aStream
{

    return [[ alloc] initWithTokenStream:aStream];

    return [[ alloc] initWithStream:aStream];

}


- (id) initWithTokenStream:()aStream
{
    self = [super initWithTokenStream:aStream State:[[RecognizerSharedState newRecognizerSharedStateWithRuleLen:+1] retain]];
    if ( self != nil ) {

- (id) initWithStream:()aStream
{
    self = [super initWithStream:aStream State:[[RecognizerSharedState newRecognizerSharedStateWithRuleLen:+1] retain]];
    if ( self != nil ) {

         !>
         = [DFA newDFAWithRecognizer:self];}; separator="\n">
        }>
        }>
        /* start of actions-actionScope-init */
        
        /* start of init */
        <@init()>
    }
    return self;
}

- (void) dealloc
{
     release];}; separator="\n">
    }>
    
    <@dealloc()>
    [super dealloc];
}

/* ObjC start actions.(actionScope).methods */

/* ObjC end actions.(actionScope).methods */
/* ObjC start methods() */
<@methods()>
/* ObjC end methods() */
/* ObjC start rules */

/* ObjC end rules */

@end /* end of  implementation line 692 */<\n>
>>

parserCtorBody() ::= <<
 /* parserCtorBody */

state.ruleMemo = [[RuleStack newRuleStack:+1] retain];<\n> 


 = ;}; separator="\n">
>>

/** A simpler version of a rule template that is specific to the imaginary
 *  rules created for syntactic predicates.  As they never have return values
 *  nor parameters etc..., just give simplest possible method.  Don't do
 *  any of the normal memoization stuff in here either; it's a waste.
 *  As predicates cannot be inlined into the invoking rule, they need to
 *  be in a rule by themselves.
 */
synpredRule(ruleName, ruleDescriptor, block, description, nakedBlock) ::=
<<
// $ANTLR start _fragment
- (void) _fragment
{
    
    
        [self traceIn:\@"_fragment" Index:];
    @try {
        
    }
    @finally {
        [self traceOut:\@"_fragment" Index:];
    }

    

} // $ANTLR end _fragment
>>

synpred(name) ::= <<
SEL Selector = @selector(_fragment);

- (BOOL) 
{
    state.backtracking++;
    <@start()>
    NSInteger start = [input mark];
    @try {
        [self _fragment]; // can never throw exception
    }
    @catch (RecognitionException *re) {
        NSLog(@"impossible: %@\n", re.name);
    }
    BOOL success = (state.failed == NO);
    [input rewind:start];
    <@stop()>
    state.backtracking--;
    state.failed=NO;
    return success;
} // $ANTLR end  <\n> !>
>>

lexerSynpred(name) ::= <<

>>

ruleMemoization(name) ::= <<

if ( state.backtracking > 0 && [self alreadyParsedRule:input RuleIndex:] ) { return ; }

>>

/** How to test for failure and return from rule */
checkRuleBacktrackFailure() ::= <<
if ( state.failed ) return ;
>>

/** This rule has failed, exit indicating failure during backtrack */
ruleBacktrackFailure() ::= <<
if ( state.backtracking > 0 ) { state.failed = YES; return ; }<\n>
>>

/** How to generate code for a rule.
 *  The return type aggregates are declared in the header file (headerFile template)
 */
rule(ruleName,ruleDescriptor,block,emptyRule,description,exceptions,finally,memoize) ::= <<

/*
 * $ANTLR start 
 * :
 */
- () 
{
    [self traceIn:\@"" Index:];
    NSLog(@"enter  %@ failed=%@ backtracking=%d", [input LT:1], (state.failed==YES)?@"YES":@"NO", state.backtracking);
    
    
    
    <@preamble()>
    @try {
        
        
        
        
        <(ruleDescriptor.actions.after):execAction()>
    }

    <\n>}>

    

    @catch (RecognitionException *re) {
        [self reportError:re];
        [self recover:input Exception:re];
        <@setErrorReturnValue()>
    }<\n>

    @finally {
        [self traceOut:@"" Index:];
        
        
        
    }
    <@postamble()>
    return ;
}
/* $ANTLR end  */
>>

finalCode(finalBlock) ::= <<
{
    
}
>>

catch(decl,action) ::= <<
@catch () {
    
}
>>

ruleDeclarations() ::= <<
/* ruleDeclarations */

 retval = [ new];
[retval setStart:[input LT:1]];<\n>

  = ;
}>


NSInteger _StartIndex = input.index;

>>

ruleScopeSetUp() ::= <<
/* ruleScopeSetUp */
_stack push:[_Scope new_Scope]];}>
_stack push:[_Scope new_Scope]];}>
>>

ruleScopeCleanUp() ::= <<
/* ruleScopeCleanUp */
_stack pop];}; separator="\n">
_stack pop];}; separator="\n">
>>

ruleLabelDefs() ::= <%
/* ruleLabelDefs entry */<"\n">
<[ruleDescriptor.tokenLabels, ruleDescriptor.tokenListLabels,
  ruleDescriptor.wildcardTreeLabels,ruleDescriptor.wildcardTreeListLabels]
    :{it | * = nil;}; separator="\n"><"\n">
<[ruleDescriptor.tokenListLabels,ruleDescriptor.ruleListLabels,ruleDescriptor.wildcardTreeListLabels]
    :{it | AMutableArray *list_ = nil;}; separator="\n"><"\n">
<"\n">
 = nil;}; separator="\n"><"\n">
%>

lexerRuleLabelDefs() ::= <<
<[ruleDescriptor.tokenLabels,
  ruleDescriptor.tokenListLabels,
  ruleDescriptor.ruleLabels]
    :{it | *=nil;}; separator="\n"
>
;}; separator="\n">
<[ruleDescriptor.tokenListLabels,
  ruleDescriptor.ruleListLabels]:{it |AMutableArray *list_=nil; }; separator="\n">
>>

ruleReturnValue() ::= <%





retval



%>

ruleCleanUp() ::= <<
/* token+rule list labels */
<[ruleDescriptor.tokenListLabels,ruleDescriptor.ruleListLabels]:{it |[list_ release];}; separator="\n">


[retval setStop:[input LT:-1]];<\n>

>>

memoize() ::= <<


if (state.backtracking > 0) [self memoize:input RuleIndex: StartIndex:_StartIndex];

>>

/** How to generate a rule in the lexer; naked blocks are used for
 *  fragment rules.
 */
lexerRule(ruleName, nakedBlock, ruleDescriptor, block, memoize) ::= <<
// $ANTLR start ""
- (void) m
{
    //[self traceIn:\@"" Index:];
    NSLog(@"enter  %C line=%d:%d failed=%@ backtracking=%d",
        [input LA:1],
        self.line,
        self.charPositionInLine,
        (state.failed==YES) ? @"YES" : @"NO",
        state.backtracking);
    
    
    
    @try {

        
        
        
        <\n>

        NSInteger _type = ;
        NSInteger _channel = TokenChannelDefault;
        
        
        
        
        
        state.type = _type;
        state.channel = _channel;
        <(ruleDescriptor.actions.after):execAction()>

    }
    @finally {
        //[self traceOut:[NSString stringWithFormat:@" %d\n", ]];
        NSLog(@"exit  %C line=%d:%d failed=%@ backtracking=%d",
                    [input LA:1], self.line, self.charPositionInLine,
                    (state.failed==YES) ? @"YES" : @"NO", state.backtracking);
        
        
    }
    return;
}
/* $ANTLR end "" */
>>

/** How to generate code for the implicitly-defined lexer grammar rule
 *  that chooses between lexer rules.
 */
tokensRule(ruleName,nakedBlock,args,block,ruleDescriptor) ::= <<
- (void) mTokens
{
    <\n>
}
>>

// S U B R U L E S

/** A (...) subrule with multiple alternatives */
block(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<
// : // block
NSInteger alt=;

<@predecision()>

<@postdecision()>
<@prebranch()>
switch (alt) {
    }>
}
<@postbranch()>
>>

/** A rule block with multiple alternatives */
ruleBlock(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<
// : //ruleblock
NSInteger alt=;

<@predecision()>

<@postdecision()>
switch (alt) {
    }>
}
>>

ruleBlockSingleAlt(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,description) ::= <<
// : // ruleBlockSingleAlt

<@prealt()>

<@postalt()>
>>

/** A special case of a (...) subrule with a single alternative */
blockSingleAlt(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,description) ::= <<
// : // blockSingleAlt

<@prealt()>

<@postalt()>
>>

/** A (..)+ block with 1 or more alternatives */
positiveClosureBlock(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<
// : // positiveClosureBlock
NSInteger cnt = 0;

<@preloop()>
do {
    NSInteger alt = ;
    <@predecision()>
    
    <@postdecision()>
    switch (alt) {
        }>
        default :
            if ( cnt >= 1 )
                goto loop;
            
            EarlyExitException *eee =
                [EarlyExitException newException:input decisionNumber:];
            <@earlyExitException()>
            @throw eee;
    }
    cnt++;
} while (YES);
loop: ;
<@postloop()>
>>

positiveClosureBlockSingleAlt ::= positiveClosureBlock

/** A (..)* block with 0 or more alternatives */
closureBlock(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<

<@preloop()>
do {
    NSInteger alt=;
    <@predecision()>
    
    <@postdecision()>
    switch (alt) {
        }>
        default :
            goto loop;
    }
} while (YES);
loop: ;
<@postloop()>
>>

closureBlockSingleAlt ::= closureBlock

/** Optional blocks (x)? are translated to (x|) by before code generation
 *  so we can just use the normal block template
 */
optionalBlock ::= block

optionalBlockSingleAlt ::= block

/** A case in a switch that jumps to an alternative given the alternative
 *  number.  A DFA predicts the alternative and then a simple switch
 *  does the jump to the code that actually matches that alternative.
 */
altSwitchCase(altNum, alt) ::= <<
case  : ;
    <@prealt()>
    
    break;<\n>
>>

/** An alternative is just a list of elements; at outermost level */
alt(elements,altNum,description,autoAST,outerAlt,treeLevel,rew) ::= <<
// : // alt
{
<@declarations()>


<@cleanup()>
}
>>

/** What to emit when there is no rewrite.  For auto build
 *  mode, does nothing.
 */
noRewrite(rewriteBlockLevel, treeLevel) ::= ""

// E L E M E N T S

/** Dump the elements one per line */
element(e) ::= << <@prematch()><\n><\n> >>

/** match a token optionally with a label in front */
tokenRef(token,label,elementIndex,terminalOptions) ::= <<
=( *)[self match:input TokenType: Follow:FOLLOW__in_]; 
>>

/** ids+=ID */
tokenRefAndListLabel(token,label,elementIndex,terminalOptions) ::= <<


>>

listLabel(label,elem) ::= <<
if (list_ == nil) list_ = [[AMutableArray arrayWithCapacity:5] retain];
[list_ addObject:];<\n>
>>

/** match a character */
charRef(char,label) ::= <<
NSInteger  = [input LA:1];<\n>
[self matchChar:]; <\n>
>>

/** match a character range */
charRangeRef(a,b,label) ::= <<
 = [input LA:1];<\n>
[self matchRangeFromChar: to:]; 
>>

/** For now, sets are interval tests and must be tested inline */
matchSet(s,label,elementIndex,terminalOptions,postmatchCode="") ::= <<


 = [input LA:1];<\n>

 = ( *)[input LT:1]; /* matchSet */<\n>

if () {
    [input consume];
    

    [state setIsErrorRecovery:NO];

    state.failed = NO;<\n>
} else {
    
    MismatchedSetException *mse = [MismatchedSetException newException:nil stream:input];
    <@mismatchedSetException()>


    mse.c = ;

    [self recover:mse];
    @throw mse;

    @throw mse;
    ]; !>

}<\n>
>>

matchRuleBlockSet ::= matchSet

matchSetAndListLabel(s,label,elementIndex,postmatchCode) ::= <<


>>

/** Match a string literal */
lexerStringRef(string,label,elementIndex="0") ::= <<

NSInteger Start = input.index;
[self matchString:]; 
NSInteger StartLine = self.line;
NSInteger StartCharPos = self.charPositionInLine;
 = [[ newToken:input Type:TokenTypeInvalid Channel:TokenChannelDefault Start:Start Stop:input.index] retain];
[self setLine:StartLine];
[self setCharPositionInLine:StartCharPos];

[self matchString:]; <\n>

>>

wildcard(token,label,elementIndex,terminalOptions) ::= <<

 = ( *)[input LT:1];<\n>

[self matchAny:input]; 
>>

wildcardAndListLabel(token,label,elementIndex,terminalOptions) ::= <<


>>

/** Match . wildcard in lexer */
wildcardChar(label, elementIndex) ::= <<

NSInteger  = [input LA:1];<\n>

[self matchAny]; <\n>
>>

wildcardCharListLabel(label, elementIndex) ::= <<


>>

/** Match a rule reference by invoking it possibly with arguments
 *  and a return value or values.  The 'rule' argument was the
 *  target rule name, but now is type Rule, whose toString is
 *  same: the rule name.  Now though you can access full rule
 *  descriptor stuff.
 */
ruleRef(rule,label,elementIndex,args,scope) ::= <<
/* ruleRef */
[self pushFollow:FOLLOW__in_];
 = [self .: :}; separator=" ">];<\n>
[self popFollow];
<\n>
>>

/** ids+=r */
ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<


>>

/** A lexer rule reference.
 *
 *  The 'rule' argument was the target rule name, but now
 *  is type Rule, whose toString is same: the rule name.
 *  Now though you can access full rule descriptor stuff.
 */
lexerRuleRef(rule,label,args,elementIndex,scope) ::= <<

NSInteger Start = input.index;
[self m:]; <\n>
 = [[ newToken:input Type:TokenTypeInvalid Channel:TokenChannelDefault Start:Start Stop:input.index-1] retain];
.line = self.line;

[self .m:]; <\n>

>>

/** i+=INT in lexer */
lexerRuleRefAndListLabel(rule,label,args,elementIndex,scope) ::= <<


>>

/** EOF in the lexer */
lexerMatchEOF(label,elementIndex) ::= <<

NSInteger Start = input.index;
[self matchChar:CharStreamEOF]; <\n>
  = [[ newToken:input Type:TokenTypeEOF Channel:TokenChannelDefault Start:Start Stop:input.index-1] retain];
.line = self.line;

[self matchChar:CharStreamEOF]; <\n>

>>

// used for left-recursive rules
recRuleDefArg()                       ::= "int "
recRuleArg()                          ::= "_p"
recRuleAltPredicate(ruleName,opPrec)  ::= " \<= "
recRuleSetResultAction()              ::= "root_0=$_primary.tree;"
recRuleSetReturnAction(src,name)      ::= "$=$.;"

/** match ^(root children) in tree parser */
tree(root, actionsAfterRoot, children, nullableChildList, enclosingTreeLevel, treeLevel) ::= <<



if ( [input LA:1] == DOWN ) {
    [self match:input TokenType:DOWN Follow:nil]; 
    
    [self match:input TokenType:UP Follow:nil]; 
}

    [self match:input TokenType:DOWN Follow:nil]; 
    
    [self match:input TokenType:UP Follow:nil]; 

>>

/** Every predicate is used as a validating predicate (even when it is
 *  also hoisted into a prediction expression).
 */
validateSemanticPredicate(pred,description) ::= <<
if ( !() ) {
    
    @throw [FailedPredicateException newException:@"" predicate:@"" stream:input];
}
>>

// F i x e d  D F A  (if-then-else)

dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
NSInteger LA_ = [input LA:];<\n>

else {

    alt = ;

    
    NoViableAltException *nvae = [NoViableAltException newException: state: stream:input];
    nvae.c = LA_;
    <@noViableAltException()>
    @throw nvae;<\n>

}
>>

/** Same as a normal DFA state except that we don't examine lookahead
 *  for the bypass alternative.  It delays error detection but this
 *  is faster, smaller, and more what people expect.  For (X)? people
 *  expect "if ( LA(1)==X ) match(X);" and that's it.
 */
dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
NSInteger LA_ = [input LA:];<\n>

>>

/** A DFA state that is actually the loopback decision of a closure
 *  loop.  If end-of-token (EOT) predicts any of the targets then it
 *  should act like a default clause (i.e., no error can be generated).
 *  This is used only in the lexer so that for ('a')* on the end of a rule
 *  anything other than 'a' predicts exiting.
 */
dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
NSInteger LA_ = [input LA:];
<\n>


alt=; 

else {
    alt = ;
}<\n>

>>

/** An accept state indicates a unique alternative has been predicted */
dfaAcceptState(alt) ::= "alt=;"

/** A simple edge with an expression.  If the expression is satisfied,
 *  enter to the target state.  To handle gated productions, we may
 *  have to evaluate some predicates for this edge.
 */
dfaEdge(labelExpr, targetState, predicates) ::= <<
if ( () && ()) {
    
}
>>

// F i x e d  D F A  (switch case)

/** A DFA state where a SWITCH may be generated.  The code generator
 *  decides if this is possible: CodeGenerator.canGenerateSwitch().
 */
dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
unichar charLA = [input LA:];
switch (charLA) {
    <\n>
default: ;

    alt = ;

    
    NoViableAltException *nvae = [NoViableAltException newException: state: stream:input];
    nvae.c = charLA;
    <@noViableAltException()>
    @throw nvae;<\n>

}<\n>
>>

dfaOptionalBlockStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
switch ([input LA:]) { // dfaOptionalBlockStateSwitch
    <\n>
}<\n>
>>

dfaLoopbackStateSwitch(k, edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
switch ([input LA:]) { // dfaLoopbackStateSwitch
    <\n>

default:
    alt = ;
    break;<\n>

}<\n>
>>

dfaEdgeSwitch(labels, targetState) ::= <<
: ;}; separator="\n">
    {
    
    }
    break;
>>

// C y c l i c  D F A

/** The code to initiate execution of a cyclic DFA; this is used
 *  in the rule to predict an alt just like the fixed DFA case.
 *  The  attribute is inherited via the parser, lexer, ...
 */
dfaDecision(decisionNumber,description) ::= <<
alt = [dfa predict:input];
>>

/** Used in headerFile */
cyclicDFAInterface(dfa) ::= <<
#pragma mark Cyclic DFA interface start DFA
@interface DFA : DFA {
}
+ (DFA *) newDFAWithRecognizer:(BaseRecognizer *)theRecognizer;
- initWithRecognizer:(BaseRecognizer *)recognizer;
@end /* end of DFA interface  */<\n>
#pragma mark Cyclic DFA interface end DFA<\n>
>>

/** Used in lexer/parser implementation files */
/* Dump DFA tables as run-length-encoded Strings of octal values.
 * Can't use hex as compiler translates them before compilation.
 * These strings are split into multiple, concatenated strings.
 * Java puts them back together at compile time thankfully.
 * Java cannot handle large static arrays, so we're stuck with this
 * encode/decode approach.  See analysis and runtime DFA for
 * the encoding methods.
 */
cyclicDFA(dfa) ::= <<
#pragma mark Cyclic DFA implementation start DFA

@implementation DFA
const static NSInteger dfa_eot[] =
    {};
const static NSInteger dfa_eof[] =
    {};
const static unichar dfa_min[] =
    {};
const static unichar dfa_max[] =
    {};
const static NSInteger dfa_accept[] =
    {};
const static NSInteger dfa_special[] =
    {};

/** Used when there is no transition table entry for a particular state */
#define dfa_T_empty	    nil

_T[] =
{
     
\};
}; null="">

const static NSInteger *dfa_transition[] =
{
    _T}; separator=", ", wrap="\n", null="nil">
};

+ (DFA *) newDFAWithRecognizer:(BaseRecognizer *)aRecognizer
{
    return [[[DFA alloc] initWithRecognizer:aRecognizer] retain];
}

- (id) initWithRecognizer:(BaseRecognizer *) theRecognizer
{
    self = [super initWithRecognizer:theRecognizer];
    if ( self != nil ) {
        decisionNumber = ;
        eot = dfa_eot;
        eof = dfa_eof;
        min = dfa_min;
        max = dfa_max;
        accept = dfa_accept;
        special = dfa_special;
        transition = dfa_transition;
    }
    return self;
}


/* start dfa.specialStateSTs */
- (NSInteger) specialStateTransition:(NSInteger)s Stream:(id\)anInput
{

    id\ input = anInput;<\n>


    id\ input = (id\)anInput;<\n>


    id\ input = (id\)anInput;<\n>

    switch (s) {
         : ;
            }; separator="\n">
    }

    if ( [recognizer getBacktrackingLevel] > 0 ) { [recognizer setFailed:YES]; return -1; }<\n>

    NoViableAltException *nvae = [NoViableAltException newException: state:s stream:recognizer.input];
    // nvae.c = s;
    /* [self error:nvae]; */ 
    @throw nvae;
}<\n>
/* end dfa.specialStateSTs */


- (void) dealloc
{
    //free(transition);
    [super dealloc];
}

- (NSString *) description
{
    return @"";
}

<@errorMethod()>

@end /* end DFA implementation */<\n>
#pragma mark Cyclic DFA implementation end DFA
<\n>
>>
/** A state in a cyclic DFA; it's a special state and part of a big switch on
 *  state.
 */
cyclicDFAState(decisionNumber, stateNumber, edges, needErrorClause, semPredState) ::= <<
/* cyclicDFAState */
NSInteger LA_ = [input LA:1];<\n>
 
NSInteger index_ = input.index;
[input rewind];<\n>

s = -1;

 
[input seek:index_];<\n>

if ( s >= 0 )
    return s;
 break;
>>

/** Just like a fixed DFA edge, test the lookahead and indicate what
 *  state to jump to next if successful.
 */
cyclicDFAEdge(labelExpr, targetStateNumber, edgeNumber, predicates) ::= <<
/* cyclicDFAEdge */
if ( && ()) { s = ;}<\n>
>>

/** An edge pointing at end-of-token; essentially matches any char;
 *  always jump to the target.
 */
eotDFAEdge(targetStateNumber,edgeNumber, predicates) ::= <<
s = ;<\n> /* eotDFAEdge */
>>

// D F A  E X P R E S S I O N S

andPredicates(left,right) ::= "(&&)"

orPredicates(operands) ::= "()"

notPredicate(pred) ::= "!()"

evalPredicate(pred,description) ::= "()"

/*
 * evalSynPredicate(pred,description) ::= "()"
 *
 * synpreds are broken in cyclic DFA special states
 *  Damn! For now, work around with using the selectors directly, and by providing a trampoline evalSynPred method in
 *  DFA
 */
/* evalSynPredicate(pred,description) ::= "[self evaluateSyntacticPredicate:Selector stream:input]" */
evalSynPredicate(pred,description) ::= "[self evaluateSyntacticPredicate:@selector(_fragment)]"
/* evalSynPredicate(pred,description) ::= "[recognizer ]" */

lookaheadTest(atom,k,atomAsInt) ::= "LA_=="

/** Sometimes a lookahead test cannot assume that LA(k) is in a temp variable
 *  somewhere.  Must ask for the lookahead directly.
 */
isolatedLookaheadTest(atom,k,atomAsInt) ::= "[input LA:] == "

lookaheadRangeTest(lower,upper,k,rangeNumber,lowerAsInt,upperAsInt) ::= <%
(LA_ >=  && LA_ \<= )
%>

isolatedLookaheadRangeTest(lower,upper,k,rangeNumber,lowerAsInt,upperAsInt) ::= "(([input LA:] >= ) && ([input LA:] \<= ))"

setTest(ranges) ::= <%

%>

// A T T R I B U T E S

memVars(scope) ::= <%  ;<\n>}; separator="\n"> %>

properties(scope) ::= <%
, setter=set:)  ;<\n>}; separator="\n">
%>

methodsDecl(scope) ::= <%
)get;<\n>- (void)set:()aVal;<\n>}; separator="\n">
%>

synthesize(scope) ::= <% ;}; separator="\n"> %>

methods(scope) ::= <%
)get { return(  ); \}<\n>
- (void)set:()aVal {  = aVal; \}<\n>}; separator="\n">
%>

globalAttributeScopeInterface(scope) ::= <%
/* globalAttributeScopeInterface */<\n>
@interface _Scope : SymbolsScope {<\n>



}<\n>

/* start of globalAttributeScopeInterface properties */<\n>

/* end globalAttributeScopeInterface properties */<\n>


+ (_Scope *)new_Scope;<\n>
- (id) init;<\n>

/* start of globalAttributeScopeInterface methodsDecl */<\n>

/* End of globalAttributeScopeInterface methodsDecl */<\n>

@end /* end of _Scope interface */<\n>
%>

globalAttributeScopeMemVar(scope) ::= <%
/* globalAttributeScopeMemVar */<\n>
SymbolStack *_stack;<\n>
_Scope *_scope;<\n>
%>

globalAttributeScopeImplementation(scope) ::= <%
@implementation _Scope  /* globalAttributeScopeImplementation */<\n>

/* start of synthesize -- OBJC-Line 1750 */<\n>
<\n>

<\n>
+ (_Scope *)new_Scope<\n>
{<\n>
    return [[_Scope alloc] init];<\n>
}<\n>
<\n>
- (id) init<\n>
{<\n>
    self = [super init];<\n>
    return self;<\n>
}<\n>
<\n>

/* start of iterate get and set functions */<\n>
<\n>
/* End of iterate get and set functions */<\n>

@end /* end of _Scope implementation */<\n><\n>
%>

globalAttributeScopeInit(scope) ::= <<
/* globalAttributeScopeInit */<\n>
_scope = [_Scope new_Scope];<\n>
_stack = [SymbolStack newSymbolStackWithLen:30];<\n>
>>

globalAttributeScopeDealloc(scope) ::= <% [_stack release];<\n> %>

globalAttributeScope(scope) ::= <%

static _stack;<\n>

%>

ruleAttributeScopeMemVar(scope) ::= <%
/* ObjC ruleAttributeScopeMemVar */<\n>

_Scope *_scope; /* ObjC ruleAttributeScopeMemVar */<\n>

%>

ruleAttributeScopeInterface(scope) ::= <%

/* start of ruleAttributeScopeInterface */<\n>
@interface _Scope : SymbolsScope {<\n>
    <\n>
}<\n>
<\n>
/* start property declarations */<\n>
<\n>
/* start method declarations */<\n>
+ (_Scope *)new_Scope;<\n>
- (id) init;<\n>
<\n>
@end /* end of ruleAttributeScopeInterface */<\n><\n>

%>

ruleAttributeScopeImplementation(scope) ::= <%

@implementation _Scope  /* start of ruleAttributeScopeImplementation */<\n>
<\n>
<\n>
+ (_Scope *)new_Scope<\n>
{<\n>
    return [[_Scope alloc] init];<\n>
}<\n>
<\n>
- (id) init<\n>
{<\n>
    self = [super init];<\n>
    return self;<\n>
}<\n>
<\n>
/* start of _Scope get and set functions */<\n>
<\n>
/* End of _Scope get and set functions */<\n>
@end /* end of ruleAttributeScopeImplementation */<\n><\n>

%>

ruleAttributeScopeInit(scope) ::= <%
/* ruleAttributeScopeInit */<\n>
_scope = [_Scope new_Scope];<\n>
_stack = [SymbolStack newSymbolStackWithLen:30];<\n>
%>

ruleAttributeScopeDealloc(scope) ::= <% [_Scope release];<\n> %>

ruleAttributeScope(scope) ::= <%

/* ruleAttributeScope */<\n>
static SymbolStack *_stack;<\n>
static _Scope *_scope;

%>

ruleAttributeScopeDecl(scope) ::= <%
/* ruleAttributeScopeDecl */<\n>

_Scope *_scope;<\n>

%>

returnStructName(r) ::= "__return"

returnType() ::= <%


 *




void



void

%>

/** Generate the Objective-C type associated with a single or multiple return
 *  values.
 */
ruleLabelType(referencedRule) ::= <%

__return *

void

%>

delegateName(d) ::= <% g %>

/** Using a type to init value map, try to init a type; if not in table
 *  must be an object, default value is "null".
 */
initValue(typeName) ::= <%  %>

/** Define a rule label including default value */
ruleLabelDef(label) ::= <%
  = ;<\n>
%>

/** Define a return struct for a rule if the code needs to access its
 *  start/stop tokens, tree stuff, attributes, ...  Leave a hole for
 *  subgroups to stick in members.
 */
returnScopeInterface(scope) ::= <<

/* returnScopeInterface  */
@interface  : TreeParserRuleReturnScope { /* returnScopeInterface line 1838 */
<@memVars()> /* ObjC start of memVars() */<\n>

<\n>

}
/* start property declarations */
<@properties()><\n>

<\n>

/* start of method declarations */<\n>
+ ( *)new;
/* this is start of set and get methods */
<@methodsDecl()>  /* methodsDecl */<\n>

/* start of iterated get and set functions */<\n>
<\n>

@end /* end of returnScopeInterface interface */<\n>

>>

returnScopeImplementation(scope) ::= <%

@implementation  /* returnScopeImplementation */<\n>
<@synthesize()> /* start of synthesize -- OBJC-Line 1837 */<\n>

    <\n>

+ ( *)new<\n>
{<\n>
    return [[[ alloc] init] retain];<\n>
}<\n>
<\n>
- (id) init<\n>
{<\n>
    self = [super init];<\n>
    return self;<\n>
}<\n>
<\n>
<@methods()><\n>

/* start of iterate get and set functions */<\n>
<\n>
/* End of iterate get and set functions */<\n>


<@ruleReturnMembers()><\n>
@end /* end of returnScope implementation */<\n><\n>

%>

parameterScope(scope) ::= <<
)}; separator=" "> !>
)}> :() }; separator=" ">
>>

parameterAttributeRef(attr) ::= ""
parameterSetAttributeRef(attr,expr) ::= " = ;"

/** Note that the scopeAttributeRef does not have access to the
 * grammar name directly
 */
scopeAttributeRef(scope,attr,index,negIndex) ::= <%

([((_Scope *)[_stack objectAtIndex:[_stack size]--1)]).


((_Scope *)[_stack objectAtIndex:]).

((_Scope *)[_stack peek]).


%>

scopeSetAttributeRef(scope,attr,expr,index,negIndex) ::= <%
/* scopeSetAttributeRef */

((_Scope *)[_stack objectAtIndex:([_stack size]--1)]). = ;


((_Scope *)[_stack objectAtIndex:]). = ;

((_Scope *)[_stack peek]). = ;


%>

scopeAttributeRefStack() ::= <<
/* scopeAttributeRefStack */

((_Scope *)[_stack objectAtIndex:[_stack count]--1]). = ;


((_Scope *)[_stack objectAtIndex:]). = ;

((_Scope *)[_stack peek]). = ;


>>

/** $x is either global scope or x is rule with dynamic scope; refers
 *  to stack itself not top of stack.  This is useful for predicates
 *  like {$function.size()>0 && $function::name.equals("foo")}?
 */
isolatedDynamicScopeRef(scope) ::= "_stack"

/** reference an attribute of rule; might only have single return value */
ruleLabelRef(referencedRule,scope,attr) ::= <<

(!=nil?.:)



>>

returnAttributeRef(ruleDescriptor,attr) ::= <%

retval.  /* added to returnAttributeRef */<\n>

<\n>

%>

returnSetAttributeRef(ruleDescriptor,attr,expr) ::= <%

 retval. =; /* added to returnSetAttributeRef */<\n>

 = ;<\n>

%>

/** How to translate $tokenLabel */
tokenLabelRef(label) ::= ""

/** ids+=ID {$ids} or e+=expr {$e} */
listLabelRef(label) ::= "list_"


/* not sure the next are the right approach; and they are evaluated early; */
/* they cannot see TREE_PARSER or PARSER attributes for example. :( */

tokenLabelPropertyRef_text(scope,attr) ::= "(!=nil?.text:nil)"
tokenLabelPropertyRef_type(scope,attr) ::= "(!=nil?.type:0)"
tokenLabelPropertyRef_line(scope,attr) ::= "(!=nil?.line:0)"
tokenLabelPropertyRef_pos(scope,attr) ::= "(!=nil?.charPositionInLine:0)"
tokenLabelPropertyRef_channel(scope,attr) ::= "(!=nil?.channel:0)"
tokenLabelPropertyRef_index(scope,attr) ::= "(!=nil?[ getTokenIndex]:0)"
tokenLabelPropertyRef_tree(scope,attr) ::= "_tree"
tokenLabelPropertyRef_int(scope,attr) ::= "(!=nil?[.text integerValue]:0)"

ruleLabelPropertyRef_start(scope,attr) ::= "(!=nil?(( *).start):nil)"
ruleLabelPropertyRef_stop(scope,attr) ::= "(!=nil?(( *).stopToken):nil)"
ruleLabelPropertyRef_tree(scope,attr) ::= "(!=nil?(( *).tree):nil)"
ruleLabelPropertyRef_text(scope,attr) ::= <%

(!=nil?[[input getTokenStream] toStringFromStart:[[input getTreeAdaptor] getTokenStartIndex:[ getStart]]
         ToEnd:[[input getTreeAdaptor] getTokenStopIndex:[ getStart]]]:0)

(!=nil?([input toStringFromToken:[ getStart] ToToken:[ getStop]]:0)

%>
ruleLabelPropertyRef_st(scope,attr) ::= "(!=nil?[ st]:nil)"

/** Isolated $RULE ref ok in lexer as it's a Token */
lexerRuleLabel(label) ::= ""

lexerRuleLabelPropertyRef_type(scope,attr) ::= "(!=nil?.type:0)"
lexerRuleLabelPropertyRef_line(scope,attr) ::= "(!=nil?.line:0)"
lexerRuleLabelPropertyRef_pos(scope,attr) ::= "(!=nil?.charPositionInLine:-1)"
lexerRuleLabelPropertyRef_channel(scope,attr) ::= "(!=nil?.channel:0)"
lexerRuleLabelPropertyRef_index(scope,attr) ::= "(!=nil?[ getTokenIndex]:0)"
lexerRuleLabelPropertyRef_text(scope,attr) ::= "(!=nil?.text:nil)"
lexerRuleLabelPropertyRef_int(scope,attr) ::="(!=nil?[.text integerValue]:0)"

// Somebody may ref $template or $tree or $stop within a rule:
rulePropertyRef_start(scope,attr) ::= "(( *)retval.start)"
rulePropertyRef_stop(scope,attr) ::= "(( *)retval.stopToken)"
rulePropertyRef_tree(scope,attr) ::= "(( *)retval.tree)"
rulePropertyRef_text(scope,attr) ::= <<

[[input getTokenStream] toStringFromStart:[[input getTreeAdaptor] getTokenStartIndex:retval.start.token.startIndex]
                                    ToEnd:[[input getTreeAdaptor] getTokenStopIndex:retval.start.token.stopIndex]]

[input toStringFromToken:retval.start ToToken:[input LT:-1]]

>>
rulePropertyRef_st(scope,attr) ::= "retval.st"

/* hideous: find a way to cut down on the number of templates to support read/write access */
/* TODO: also, which ones are valid to write to? ask Ter */
lexerRuleSetPropertyRef_text(scope,attr,expr) ::= "state.text = ;"
lexerRuleSetPropertyRef_type(scope,attr,expr) ::= "_type"
lexerRuleSetPropertyRef_line(scope,attr,expr) ::= "state.tokenStartLine"
lexerRuleSetPropertyRef_pos(scope,attr,expr) ::= "state.tokenStartCharPositionInLine"
lexerRuleSetPropertyRef_index(scope,attr,expr) ::= "-1" /* undefined token index in lexer */
lexerRuleSetPropertyRef_channel(scope,attr,expr) ::= "state.channel=;"
lexerRuleSetPropertyRef_start(scope,attr,expr) ::= "state.tokenStartCharIndex"
lexerRuleSetPropertyRef_stop(scope,attr,expr) ::= "(input.index-1)"


lexerRulePropertyRef_text(scope,attr) ::= "self.text"
lexerRulePropertyRef_type(scope,attr) ::= "state.type"
lexerRulePropertyRef_line(scope,attr) ::= "state.tokenStartLine"
lexerRulePropertyRef_pos(scope,attr) ::= "state.tokenStartCharPositionInLine"
lexerRulePropertyRef_index(scope,attr) ::= "-1" // undefined token index in lexer
lexerRulePropertyRef_channel(scope,attr) ::= "_channel"
lexerRulePropertyRef_start(scope,attr) ::= "state.tokenStartCharIndex"
lexerRulePropertyRef_stop(scope,attr) ::= "(input.index-1)"
lexerRulePropertyRef_int(scope,attr) ::= "[.text integerValue]"

// setting $st and $tree is allowed in local rule. everything else
// is flagged as error
ruleSetPropertyRef_tree(scope,attr,expr) ::= "retval.start =;"
ruleSetPropertyRef_st(scope,attr,expr) ::= "retval.st =;" /* "<\n>#error StringTemplates are unsupported<\n>" */


/** How to execute an action */
execAction(action) ::= <<

if (  ) {
    
}



>>

/** How to always execute an action even when backtracking */
execForcedAction(action) ::= ""

// M I S C (properties, etc...)

bitset(name, words64) ::= <<
static ANTLRBitSet *;
static const unsigned long long _data[] = { LL};separator=", ">};<\n>
>>

bitsetInit(name, words64) ::= <<
 = [[ANTLRBitSet newBitSetWithBits:(const unsigned long long *)_data Count:(NSUInteger)] retain];<\n>
>>

codeFileExtension() ::= ".m"

true_value() ::= "YES"
false_value() ::= "NO"