org.antlr.codegen.templates.Cpp.Cpp.stg Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of antlr-complete Show documentation
Complete distribution for ANTLR 3
There is a newer version: 3.5.3
/*
 [The "BSD license"]
 Copyright (c) 2005-2009 Gokulakannan Somasundaram,
 
 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.
*/

/*
 * This code generating template and the associated Cpp runtime was produced by:
 * Gokulakannan Somasundaram ( heavy lifting from C Run-time by Jim Idle )
 */
cTypeInitMap ::= [
	"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"    	    : "false",   // Booleans     start out being Antlr C for false
	"byte"		    : "0",              // Bytes        start out being 0
	"short"		    : "0",              // Shorts       start out being 0
	"char"		    : "0"              // Chars        start out being 0
]

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.
 *
 * C++ language generator and runtime by Gokulakannan Somasundaram ( heavy lifting from C Run-time by Jim Idle )
 *
 *
>>

/** 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
            ) ::=
<<

*/
// [The "BSD license"]
// Copyright (c) 2005-2009 Gokulakannan Somasundaram, ElectronDB
//
// 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.



/* =============================================================================
 * 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.
 */
#include    ".hpp"

#include \


// Include delegator definition header files
//
.hpp" }; separator="\n">



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







/** 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
 */



/* End of code
 * =============================================================================
 */

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

beginNamespace(actions) ::= <%
	
	namespace  {
	
%>

endNamespace(actions) ::= <%
	
	}
	
%>


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
        ) ::=
<<


 * The parser  has the callable functions (rules) shown below,


 * The lexer  has the callable functions (rules) shown below,


 * The tree parser  has the callable functions (rules) shown below,

 * which will invoke the code for the associated rule in the source grammar
 * assuming that the input stream is pointing to a token/text stream that could begin
 * this rule.
 *
 * For instance if you call the first (topmost) rule in a parser grammar, you will
 * get the results of a full parse, but calling a rule half way through the grammar will
 * allow you to pass part of a full token stream to the parser, such as for syntax checking
 * in editors and so on.
 *
 */
// [The "BSD license"]
// Copyright (c) 2005-2009 Gokulakannan Somasundaram. 
//
// 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.

#ifndef	__H
#define __H

/* =============================================================================
 * Standard antlr3 C++ runtime definitions
 */
#include \

/* End of standard antlr 3 runtime definitions
 * =============================================================================
 */




// Include delegate definition header files
//
.hpp"}; separator="\n">






#ifdef	WIN32
// Disable: Unreferenced parameter,							- Rules with parameters that are not used
//          constant conditional,							- ANTLR realizes that a prediction is always true (synpred usually)
//          initialized but unused variable					- tree rewrite variables declared but not needed
//          Unreferenced local variable						- lexer rule declares but does not always use _type
//          potentially unitialized variable used			- retval always returned from a rule
//			unreferenced local function has been removed	- susually getTokenNames or freeScope, they can go without warnigns
//
// These are only really displayed at warning level /W4 but that is the code ideal I am aiming at
// and the codegen must generate some of these warnings by necessity, apart from 4100, which is
// usually generated when a parser rule is given a parameter that it does not use. Mostly though
// this is a matter of orthogonality hence I disable that one.
//
#pragma warning( disable : 4100 )
#pragma warning( disable : 4101 )
#pragma warning( disable : 4127 )
#pragma warning( disable : 4189 )
#pragma warning( disable : 4505 )
#pragma warning( disable : 4701 )
#endif


/* ========================
 * BACKTRACKING IS ENABLED
 * ========================
 */





// Include delegator definition classes
//
; }; separator="\n">



typedef Traits ImplTraits;

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

class Tokens
{
public:
	/** Symbolic definitions of all the tokens that the  will work with.
	 *
	 * Antlr will define EOF, but we can't use that as it it is too common in
	 * in C header files and that would be confusing. There is no way to filter this out at the moment
	 * so we just undef it here for now. That isn't the value we get back from C recognizers
	 * anyway. We are looking for ANTLR_TOKEN_EOF.
	 */
	enum Tokens 
	{
		EOF_TOKEN = ImplTraits::CommonTokenType::TOKEN_EOF
		 =  }; separator="\n">
	};

};

/** Context tracking structure for 
 */
class  : public , public Tokens
{
public:
	typedef ImplTraits ImplTraits;
	typedef  ComponentType;
	typedef ComponentType::StreamType StreamType;
	typedef  BaseType;
	typedef ImplTraits::RecognizerSharedStateType\ RecognizerSharedStateType;
	typedef StreamType InputType;

	static const bool IsFiltered = true;

	static const bool IsFiltered = false;

	
	}>
	}>
	
private:	

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


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


    
}; separator="\n\n">

    
}>
    <@members>
    <@end>

public:
    (InputType* instream* }>);
    (InputType* instream, RecognizerSharedStateType* state* }>);
    
    void init(InputType* instream * }> );

    



    void  memoize(ANTLR_MARKER  ruleIndex, ANTLR_MARKER  ruleParseStart);
    bool  alreadyParsedRule(ANTLR_MARKER	ruleIndex);
    
    
      m( );}; separator="\n">
       msynpred( antlr3::ClassForwarder\<  > );
    void m_fragment ();}; separator="\n">


    }>
       (); }; separator="\n">
       msynpred( antlr3::ClassForwarder\<  > );
    void m_fragment ();}; separator="\n">

    // Delegated rules
 ();}; separator="\n">


    const char *    getGrammarFileName();
    void            reset();
    ~();

};

// Function protoypes for the constructor functions that external translation units
// such as delegators and delegates may wish to call.
//

extern ANTLR_UINT8*   TokenNames[];



/* End of token definitions for 
 * =============================================================================
 */



#endif

/* END - Note:Keep extra line feed to satisfy UNIX systems */

>>

grammarType() ::= <%

parser


lexer


tree parser

%>

componentType() ::= <<

ImplTraits::ParserType


ImplTraits::LexerType


ImplTraits::TreeParserType

>>

componentBaseType() ::= <%

ImplTraits::BaseParserType


ImplTraits::BaseLexerType


ImplTraits::BaseTreeParserType

%>

streamType() ::= <<

ImplTraits::ParserType::StreamType


ImplTraits::LexerType::StreamType


ImplTraits::TreeParserType::StreamType

>>


mainName() ::= <%









%>

headerReturnScope(ruleDescriptor) ::= ""

headerReturnType(ruleDescriptor) ::= <%


 void

 


 

%>

// Produce the lexer output
//
lexer(  grammar,
	name,
        tokens,
        scopes,
        rules,
        numRules,
        filterMode,
        superClass,
        labelType="ImplTraits::CommonTokenType*") ::= <<

using namespace antlr3;





/* Override the normal MEMOIZE and HAVEALREADYPARSED macros as this is a filtering
 * lexer. In filter mode, the memoizing and backtracking are gated at BACKTRACKING > 1 rather
 * than just BACKTRACKING. In some cases this might generate code akin to:
 *   if (BACKTRACKING) if (BACKTRACKING > 1) memoize.
 */
void	::memoize(ANTLR_MARKER  ruleIndex, ANTLR_MARKER  ruleParseStart)
{
	BaseType* base = this;
	if ( this->get_backtracking()>1 ) 
		base->memoize( ruleIndex, ruleParseStart );

}

bool	::alreadyParsedRule(ANTLR_MARKER	ruleIndex)
{
	BaseType* base = this;
	if ( this->get_backtracking() > 1 )
		return base->haveParsedRule(ruleIndex);
	return false;
}



/* =========================================================================
 * Lexer matching rules end.
 * =========================================================================
 */

}>



::~()
{

	RuleMemoType* rulememo = this->getRuleMemo();
	if(rulememo != NULL)
	{
		delete rulememo;
		this->setRuleMemo(NULL);
	}


	// Free the lexers that we delegated to
	// functions to. NULL the state so we only free it once.
	//
	->set_lexstate(NULL);
         delete m_; }; separator="\n">

}

void
::reset()
{
    this->get_rec()->reset();
}

/** \brief Name of the grammar file that generated this code
 */
static const char fileName[] = "";

/** \brief Return the name of the grammar file that generated this code.
 */
const char* ::getGrammarFileName()
{
	return fileName;
}

/** \brief Create a new lexer called 
 *
 * \param[in]    instream Pointer to an initialized input stream
 * \return
 *     - Success p initialized for the lex start
 *     - Fail NULL
 */
::(StreamType* instream* }>)
:ImplTraits::BaseLexerType(ANTLR_SIZE_HINT, instream, NULL)
{
	// See if we can create a new lexer with the standard constructor
	//
	this->init(instream }>);
}

/** \brief Create a new lexer called 
 *
 * \param[in]    instream Pointer to an initialized input stream
 * \param[state] state Previously created shared recognizer stat
 * \return
 *     - Success p initialized for the lex start
 *     - Fail NULL
 */
::(StreamType* instream, RecognizerSharedStateType* state* }>)
:ImplTraits::BaseLexerType(ANTLR_SIZE_HINT, instream, state)
{
	this->init(instream } >);
}

void ::init(StreamType* instream* } >)
{
    /* -------------------------------------------------------------------
     * Memory for basic structure is allocated, now to fill in
     * in base ANTLR3 structures. We initialize the function pointers
     * for the standard ANTLR3 lexer function set, but upon return
     * from here, the programmer may set the pointers to provide custom
     * implementations of each function.
     *
     * We don't use the macros defined in .h here so you can get a sense
     * of what goes where.
     */



    // Create a LIST for recording rule memos.
    //
    this->setRuleMemo( new IntTrie(15) );	/* 16 bit depth is enough for 32768 rules! */




	// Initialize the lexers that we are going to delegate some
	// functions to.
	//
	 = new (instream, this->get_lexstate(), this}>);}; separator="\n">


	// Install the pointers back to lexers that will delegate us to perform certain functions
	// for them.
	//
	 = ;}; separator="\n">

}



/* =========================================================================
 * DFA tables for the lexer
 */
 
/* =========================================================================
 * End of DFA tables for the lexer
 */


/* =========================================================================
 * Functions to match the lexer grammar defined tokens from the input stream
 */



/* =========================================================================
 * Lexer matching rules end.
 * =========================================================================
 */


/* =========================================================================
 * Lexer syntactic predicates
 */
}>
/* =========================================================================
 * Lexer syntactic predicates end.
 * =========================================================================
 */


/* End of Lexer code
 * ================================================
 * ================================================
 */
 


>>


filteringNextToken() ::= <<
ImplTraits::CommonTokenType*
ImplTraits::TokenSourceType::nextToken()
{
    LexerType*   lexer;
    typename LexerType::RecognizerSharedStateType* state;

    lexer   = this->get_super();
    state	= lexer->get_lexstate();

    /* Get rid of any previous token (token factory takes care of
     * any deallocation when this token is finally used up.
     */
    state->set_token_present( false );
    state->set_error( false );	    /* Start out without an exception	*/
    state->set_failedflag(false);

    /* Record the start of the token in our input stream.
     */
    state->set_tokenStartCharIndex( lexer->index();
    state->set_tokenStartCharPositionInLine( lexer->getCharPositionInLine() );
    state->set_tokenStartLine( lexer->getLine() );
    state->set_text("");

    /* Now call the matching rules and see if we can generate a new token
     */
    for	(;;)
    {
		if (lexer->LA(1) == ANTLR_CHARSTREAM_EOF)
		{
			/* Reached the end of the stream, nothing more to do.
			 */
			CommonTokenType&    teof = m_eofToken;

			teof.set_startIndex(lexer->getCharIndex());
			teof.set_stopIndex(lexer->getCharIndex());
			teof.setLine(lexer->getLine());
			return  &teof;
		}

		state->set_token_present(false);
		state->set_error(false);	    /* Start out without an exception	*/

		{
			ANTLR_MARKER   m;

			m	= this->get_istream()->mark();
			state->set_backtracking(1);				/* No exceptions */
			state->set_failedflag(false);

			/* Call the generated lexer, see if it can get a new token together.
			 */
			lexer->mTokens();
    			state->set_backtracking(0);

    		

			if(state->get_failed())
			{
				lexer->rewind(m);
				lexer->consume(); 
			}
			else
			{
				lexer->emit();					/* Assemble the token and emit it to the stream */
				TokenType& tok = state->get_token();
				return &tok;
			}
		}
    }
}
>>

actionGate() ::= "this->get_backtracking()==0"

filteringActionGate() ::= "this->get_backtracking()==1"

/** How to generate a parser */
genericParser(  grammar, name, scopes, tokens, tokenNames, rules, numRules,
                bitsets, inputStreamType, superClass,
                labelType, members,	rewriteElementType,
                filterMode, ASTLabelType="ImplTraits::TreeType*") ::= <<

using namespace antlr3;

/** \brief Table of all token names in symbolic order, mainly used for
 *         error reporting.
 */
ANTLR_UINT8* TokenNames[+4]
     = {
        (ANTLR_UINT8*) "\",       /* String to print to indicate an invalid token */
        (ANTLR_UINT8*) "\",
        (ANTLR_UINT8*) "\",
        (ANTLR_UINT8*) "\",
        }; separator=",\n">
       };


    <@members>

    <@end>

/** \brief Name of the grammar file that generated this code
 */
static const char fileName[] = "";

/** \brief Return the name of the grammar file that generated this code.
 */
const char* ::getGrammarFileName()
{
	return fileName;
}
/** \brief Create a new  parser and return a context for it.
 *
 * \param[in] instream Pointer to an input stream interface.
 *
 * \return Pointer to new parser context upon success.
 */
::( StreamType* instream* }>)

{
	// See if we can create a new parser with the standard constructor
	//
	this->init(instream}>);
}

/** \brief Create a new  parser and return a context for it.
 *
 * \param[in] instream Pointer to an input stream interface.
 *
 * \return Pointer to new parser context upon success.
 */
::( StreamType* instream, RecognizerSharedStateType* state* }>)

{
	this->init(instream }>);
}

void ::init(StreamType* instream* }>)
{
    


    /* Create a LIST for recording rule memos.
     */
     typedef RecognizerSharedStateType::RuleMemoType RuleMemoType;
     this->setRuleMemo( new RuleMemoType(15) );	/* 16 bit depth is enough for 32768 rules! */<\n>



	// Initialize the lexers that we are going to delegate some
	// functions to.
	//
	 = new (instream, this->get_psrstate(), this}>);}; separator="\n">
	
        
     	// Install the pointers back to lexers that will delegate us to perform certain functions
     	// for them.
     	//
     		 = ;}; separator="\n">
	
	/* Install the token table
	*/
	this->get_psrstate()->set_tokenNames( TokenNames );

	<@debugStuff()>

}

void
::reset()
{
    this->get_rec()->reset();
}

/** Free the parser resources
 */
::~()
 {
    <@cleanup>
    <@end>

	// Free the parsers that we delegated to
	// functions to.NULL the state so we only free it once.
	//
	->set_psrstate( NULL );
         delete m_;}; separator="\n">



	if(this->getRuleMemo() != NULL)
	{
		delete this->getRuleMemo();
		this->setRuleMemo(NULL);
	}


}

/** Return token names used by this 
 *
 * The returned pointer is used as an index into the token names table (using the token
 * number as the index).
 *
 * \return Pointer to first char * in the table.
 */
static ANTLR_UINT8**	getTokenNames()
{
        return TokenNames;
}

    

/* Declare the bitsets
 */
_in_},
                    words64=it.bits, traits={ImplTraits} )>}>




/* =========================================================================
 * DFA tables for the parser
 */
 
/* =========================================================================
 * End of DFA tables for the parser
 */


/* ==============================================
 * Parsing rules
 */


	// Delegated methods that appear to be a part of this
	// parser
	//
 ::()
    {
        return m_->(}; separator=", ">);
    \}}; separator="\n">


/* End of parsing rules
 * ==============================================
 */

/* ==============================================
 * Syntactic predicates
 */
}>
/* End of syntactic predicates
 * ==============================================
 */

>>

constructorInitializerType(rec_state) ::=<<

    :ImplTraits::BaseParserType(ANTLR_SIZE_HINT, instream, )


    :ImplTraits::BaseTreeParserType(ANTLR_SIZE_HINT, instream, )

>>

parser(	grammar,
		name,
		scopes,
		tokens,
		tokenNames,
		rules,
		numRules,
		bitsets,
		ASTLabelType,
		superClass="Parser",
		labelType="ImplTraits::CommonTokenType*",
		members={}
		) ::= <<



>>

/** 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="ImplTraits::TreeType*",
			superClass="TreeParser",
			members={}
			) ::= <<



>>

/** 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 
void ::m_fragment(  )
{
	
	

    ANTLR_PRINTF("enter  %d failed = %d, backtracking = %d\\n", this->LT(1),failed,this->get_backtracking() );
    
    ANTLR_PRINTF("exit  %d, failed = %d, backtracking = %d\\n", this->LT(1),failed,this->get_backtracking());


    


goto ruleEx; /* Prevent compiler warnings */
ruleEx: ;
}
// $ANTLR end 
>>

synpred(predname) ::= <<

bool ::msynpred( antlr3::ClassForwarder\<  >  )
{
    ANTLR_MARKER   start;
    bool  success;
    
    this->inc_backtracking();
    <@start()>
    start	= this->mark();
    this->m_fragment();	    // can never throw exception
    success	= !( this->get_failedflag() );
    this->rewind(start);
    <@stop()>
    this->dec_backtracking();
    this->set_failedflag(false);
    return success;
}<\n>
>>

lexerSynpred(predname) ::= <<

>>

ruleMemoization(rname) ::= <<

if ( (this->get_backtracking()>0) && (this->haveParsedRule()) )
{


	retval.start = 0;<\n>


    <(ruleDescriptor.actions.after):execAfter()>
    

    <\n>

    return ;
}

>>

/** How to test for failure and return from rule */
checkRuleBacktrackFailure() ::= <<
if  (this->hasException())
{
    goto ruleEx;
}

if (this->hasFailed())
{
    
    <@debugClean()>
    return ;
}

>>

/** This rule has failed, exit indicating failure during backtrack */
ruleBacktrackFailure() ::= <<

if (this->get_backtracking()>0)
{
    this->set_failedflag( true );
    
    return ;
}

>>

/** How to generate code for a rule.  This includes any return type
 *  data aggregates required for multiple return values.
 */
rule(ruleName,ruleDescriptor,block,emptyRule,description,exceptions,finally,memoize) ::= <<
/**
 * $ANTLR start 
 * :
 */

::()
{
    ANTLR_PRINTF("enter  %s failed=%d, backtracking=%d\n", this->LT(1), this->get_backtracking() );
    
    
    
    
    
    
    
    
    
    	try {
     
    
        try {
    
    
    <@preamble()>
    {
        
    }
    
   

    <(ruleDescriptor.actions.after):execAfter()>
    <\n>}>

    
    	if (this->hasException())
        {
            this->preporterror();
            this->precover();
            <@setErrorReturnValue()>
        }
        
        else
        {
            <(ruleDescriptor.actions.after):execAfter()>
        }<\n>
        
	
	    } 
        
    


    ANTLR_PRINTF("exit  %d failed=%s backtracking=%s\n", this->LT(1), failed, this->get_backtracking() );
    

    

    
    <@postamble()>
    return ;
}
/* $ANTLR end  */
>>

finalCode(finalBlock) ::= <<
{
    
}

>>

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

ruleDeclarations() ::= <<


 retval(this);<\n>


    ImplTraits::RuleReturnValueType _antlr_rule_exit(this);
  

 ;
}>



ANTLR_MARKER _StartIndex;

>>

ruleInitializations() ::= <<
/* Initialize rule variables
 */


retval. = ; }>

 = ; }>



_StartIndex = this->index();<\n>

_stack.push(Scope()); }; separator="\n">
_stack.push(Scope()); }; separator="\n">
>>

ruleLabelDefs() ::= <<
<[ruleDescriptor.tokenLabels,ruleDescriptor.tokenListLabels,
  ruleDescriptor.wildcardTreeLabels,ruleDescriptor.wildcardTreeListLabels]
    :{it |  = NULL;}; separator="\n"
>
<[ruleDescriptor.tokenListLabels,ruleDescriptor.ruleListLabels,ruleDescriptor.wildcardTreeListLabels]
    :{it |ImplTraits::TokenPtrsListType list_;}; separator="\n"
>

>>

ruleLabelInitializations() ::= <<


retval.call_start_placeholder();


>>

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

lexerRuleLabelInit() ::= <<
<[ruleDescriptor.tokenListLabels,
  ruleDescriptor.ruleListLabels,
  ruleDescriptor.ruleListLabels]
    :{it |list_ = new ImplTraits::IntTrieType(31);}; separator="\n"
>
>>

lexerRuleLabelFree() ::= <<
<[ruleDescriptor.tokenLabels,
  ruleDescriptor.tokenListLabels,
  ruleDescriptor.ruleLabels]
    :{it | = NULL;}; separator="\n"
>
<[ruleDescriptor.tokenListLabels,
  ruleDescriptor.ruleListLabels,
  ruleDescriptor.ruleListLabels]
    :{it | delete list_;}; separator="\n"
>
>>

ruleReturnValue() ::= <%





retval



%>

memoize() ::= <<


if ( this->get_backtracking() > 0 ) { this->memoize(, _StartIndex); }


>>

ruleCleanUp() ::= <<

// This is where rules clean up and exit
//
goto ruleEx; /* Prevent compiler warnings */
ruleEx: ;



retval.call_stop_placeholder();<\n>



>>

scopeClean() ::= <<
_stack.pop(); }; separator="\n">
_stack.pop(); }; separator="\n">

>>
/** How to generate a rule in the lexer; naked blocks are used for
 *  fragment rules, which do not produce tokens.
 */
lexerRule(ruleName,nakedBlock,ruleDescriptor,block,memoize) ::= <<
//   Comes from: 
/** \brief Lexer rule generated by ANTLR3
 *
 * $ANTLR start 
 *
 * Looks to match the characters the constitute the token 
 * from the attached input stream.
 *
 *
 * \remark
 *  - lexer->error == true if an exception was thrown.
 */
void ::m()
{
    ANTLR_UINT32	_type;
    
    
    
    
    std::cout \<\< "enter  '" \<\< (char)this->LA(1)
              \<\< "' line=" \<\< this->getLine() \<\< ":" \<\< this->getCharPositionInLine()
              \<\< " failed=" \<\< this->get_failedflag() \<\< " backtracking=" \<\< this->get_backtracking() \<\< std::endl;
    


    
    
    

    <\n>

    
    
    _type	    = ;

    

    
	this->get_lexstate()->set_type(_type);

    
    std::cout \<\< "exit  '" \<\< (char)this->LA(1)
              \<\< "' line=" \<\< this->getLine() \<\< ":" \<\< this->getCharPositionInLine()
              \<\< " failed=" \<\< this->get_failedflag() \<\< " backtracking=" \<\< this->get_backtracking() \<\< std::endl;
    
    
    
    <(ruleDescriptor.actions.after):execAfter()>
    
}
// $ANTLR end 
>>

/** How to generate code for the implicitly-defined lexer grammar rule
 *  that chooses between lexer rules.
 */
tokensRule(ruleName,nakedBlock,args,block,ruleDescriptor) ::= <<
/** This is the entry point in to the lexer from an object that
 *  wants to generate the next token, such as a pCOMMON_TOKEN_STREAM
 */
void
::mTokens()
{
    <\n>

    goto ruleTokensEx; /* Prevent compiler warnings */
ruleTokensEx: ;
}
>>

// S U B R U L E S

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

// :
{
    int alt=;
    
    <@predecision()>
    
    <@postdecision()>
    <@prebranch()>
    switch (alt)
    {
	}>
    }
    <@postbranch()>
}
>>

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

    ANTLR_UINT32 alt;

    alt=;

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

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

<@prealt()>

<@postalt()>
>>

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

<@prealt()>

<@postalt()>
>>

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

    for (;;)
    {
        int alt=;
	<@predecision()>
	
	<@postdecision()>
	switch (alt)
	{
	    }>
	    default:

		if ( cnt >= 1 )
		{
		    goto loop;
		}
		
		
		<@earlyExitException()>
		goto ruleEx;
	}
	cnt++;
    }
    loop: ;	/* Jump to here if this rule does not match */
    <@postloop()>
}
>>

earlyExitEx() ::= <<
/* mismatchedSetEx()
 */
new ANTLR_Exception\< ImplTraits, EARLY_EXIT_EXCEPTION, StreamType>( this->get_rec(), "" );
<\n>
>>
positiveClosureBlockSingleAlt ::= positiveClosureBlock

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

// :


<@preloop()>
for (;;)
{
    int alt=;
    <@predecision()>
    
    <@postdecision()>
    switch (alt)
    {
	}>
	default:
	    goto loop;	/* break out of the loop */
	    break;
    }
}
loop: ; /* Jump out to here if this rule does not match */
<@postloop()>
>>

closureBlockSingleAlt ::= closureBlock

/** Optional blocks (x)? are translated to (x|) by antlr 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) ::= <<
// :
{
    <@declarations()>
    <@initializations()>
    
    
    <@cleanup()>
}
>>

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

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

/** match a token optionally with a label in front */
tokenRef(token,label,elementIndex,terminalOptions) ::= <<
 =  this->matchToken(, &FOLLOW__in_);

>>

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


>>

listLabel(label,elem) ::= <<
 list_.push_back();
>>


/** match a character */
charRef(char,label) ::= <<

 = this->LA(1);<\n>

 this->matchc();

>>

/** match a character range */
charRangeRef(a,b,label) ::= <<

 = this->LA(1);<\n>

this->matchRange(, );

>>

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


= this->LA(1);<\n>

=() this->LT(1);<\n>


if (  )
{
    this->consume();
    

    this->set_perror_recovery(false);

     this->set_failedflag(false); <\n>
}
else
{
    
    
    <@mismatchedSetException()>

    this->recover();

recoverFromMismatchedSet(&FOLLOW_set_in_);
!>

    goto ruleEx;
}<\n>
>>

mismatchedSetEx() ::= <<
new ANTLR_Exception\< ImplTraits, MISMATCHED_SET_EXCEPTION, StreamType>( this->get_rec(), "" );

this->get_exception()->set_expectingSet(NULL);
get_exception()->set_expectingSet( &FOLLOW_set_in_ );
!>

>>

matchRuleBlockSet ::= matchSet

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


>>

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

ANTLR_MARKER Start = this->getCharIndex();
ANTLR_UINT32 StartLine = this->getLine();
ANTLR_UINT32 StartCharPos = this->getCharPositionInLine();
this->matchs();

 = new CommonTokenType;
->set_type( CommonTokenType::TOKEN_INVALID );
->set_startIndex( Start);
->set_stopIndex( this->getCharIndex()-1);
->set_input( this->get_input() );
->set_line( StartLine );
->set_charPositionInLine( StartCharPos );

this->matchs();
<\n>

>>

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

=()this->LT(1);<\n>

this->matchAnyToken();

>>

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


>>

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

 = this->LA(1);<\n>

this->matchAny();

>>

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) ::= <<
this->followPush(FOLLOW__in_);
=m_->();<\n>
this->followPop();

>>

/** 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) ::= <<
/*  */

{
    ANTLR_MARKER Start = this->getCharIndex();
    ANTLR_UINT32 StartLine = this->getLine();
    ANTLR_UINT32 StartCharPos = this->getCharPositionInLine();
    m_->m(m_ , );
    
     = new CommonTokenType();
    ->set_type( CommonTokenType::TOKEN_INVALID);
    ->set_startIndex( Start );
    ->set_stopIndex( this->getCharIndex()-1 );
    ->set_input( this->get_input() );
    ->set_line( StartLine );
    ->set_charPositionInLine( StartCharPos );
}

m_->m();


>>

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


>>

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

{
    ANTLR_UINT32 Start;
    ANTLR_UINT32 StartLine = this->getLine();
    ANTLR_UINT32 StartCharPos = this->getCharPositionInLine();
     ;
    Start = this->getCharIndex();
    this->matchc(ANTLR_CHARSTREAM_EOF);
    
     = new CommonTokenType();
    ->set_type( CommonTokenType::TOKEN_EOF );
    ->set_startIndex(Start);
    ->set_stopIndex(this->getCharIndex()-1);
    ->set_input( this->get_input() );
    ->set_line( StartLine );
    ->set_charPositionInLine( StartCharPos );
}

    this->matchc(ANTLR_CHARSTREAM_EOF);
    
    
>>

// 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 ( this->LA(1)== CommonTokenType::TOKEN_DOWN ) {
    this->matchToken(CommonTokenType::TOKEN_DOWN, NULL);
    
    
    this->matchToken(CommonTokenType::TOKEN_UP, NULL);
    
}

this->matchToken(CommonTokenType::TOKEN_DOWN, NULL);


this->matchToken(CommonTokenType::TOKEN_UP, NULL);


>>

/** Every predicate is used as a validating predicate (even when it is
 *  also hoisted into a prediction expression).
 */
validateSemanticPredicate(pred,description) ::= <<
if ( !() )
{
    
    
}
>>

newFPE() ::= <<
	ExceptionBaseType* ex = new ANTLR_Exception\< ImplTraits, FAILED_PREDICATE_EXCEPTION, StreamType>( this->get_rec(), "" );
    ex->set_ruleName( "" );
    <\n>
>>

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

dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<

{
    int LA_ = this->LA();
    
    else
    {

        alt=;

        

        
        goto ruleEx;


    }
}
>>

newNVException() ::= <<
ExceptionBaseType* ex = new ANTLR_Exception\< ImplTraits, NO_VIABLE_ALT_EXCEPTION, StreamType>( this->get_rec(), "" );
ex->set_decisionNum(  );
ex->set_state(  );
<@noViableAltException()>
<\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) ::= <<
{
    int LA_ = this->LA();
    
}
>>

/** 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.
 */

dfaLoopbackStateDecls()::= <<
ANTLR_UINT32   LA_;
>>
dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
{
   /* dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState)
    */
    int LA_ = this->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) ::= <<
switch ( this->LA() )
{


default:

    alt=;

    
    
    goto ruleEx;<\n>

}<\n>
>>

dfaOptionalBlockStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
switch ( this->LA() )
{
    
}<\n>
>>

dfaLoopbackStateSwitch(k, edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
switch ( this->LA() )
{
<\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 = cdfa.predict(this, this->get_rec(), this->get_istream(), cdfa );

>>

/* Dump DFA tables as static initialized arrays of shorts(16 bits)/characters(8 bits)
 * which are then used to statically initialize the dfa structure, which means that there
 * is no runtime initialization whatsoever, other than anything the C compiler might
 * need to generate. In general the C compiler will lay out memory such that there is no
 * runtime code required.
 */
cyclicDFA(dfa) ::= <<
/** Static dfa state tables for Cyclic dfa:
 *    
 */
static const ANTLR_INT32 dfa_eot[] =
    {
	
    };
static const ANTLR_INT32 dfa_eof[] =
    {
	
    };
static const ANTLR_INT32 dfa_min[] =
    {
	
    };
static const ANTLR_INT32 dfa_max[] =
    {
	
    };
static const ANTLR_INT32 dfa_accept[] =
    {
	
    };
static const ANTLR_INT32 dfa_special[] =
    {
	
    };

/** Used when there is no transition table entry for a particular state */
static const ANTLR_INT32* dfa_T_empty	 =   NULL;

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

/* Transition tables are a table of sub tables, with some tables
 * reused for efficiency.
 */
static const ANTLR_INT32 * const dfa_transitions[] =
{
    _T}; separator=", ", wrap="\n", null="NULL">
};

<@errorMethod()>

/* Declare tracking structure for Cyclic DFA 
 */
class CyclicDFA : public CyclicDFA\< ImplTraits,  >, public Tokens
{
public:
	typedef CyclicDFA\< ImplTraits,  >  BaseType;
	typedef BaseType::ContextType CtxType;
	
private:

	//to maintain C-Target compatibility, we need to make some of ctx functions look like member funcs
	CtxType*	m_ctx; 
	

public:
	CyclicDFA( ANTLR_INT32	decisionNumber
					, const ANTLR_UCHAR*	description
					, const ANTLR_INT32* const	eot
					, const ANTLR_INT32* const	eof
					, const ANTLR_INT32* const	min
					, const ANTLR_INT32* const	max
					, const ANTLR_INT32* const	accept
					, const ANTLR_INT32* const	special
					, const ANTLR_INT32* const *const	transition)
					:BaseType( decisionNumber, description, eot, eof, min, max, accept,
								special, transition )
	{
	
		m_ctx = NULL;
			
	}

    
    ANTLR_UINT32 LA(ANTLR_INT32 i)
    {
        return m_ctx->LA(i);
    }

    
    const CtxType::CommonTokenType*  LT(ANTLR_INT32 k)
    {
        return m_ctx->LT(k);
    }
    
    
    template\
    bool msynpred( PredType pred )
    {
        return m_ctx->msynpred(pred);
    }
    
        
	ANTLR_INT32  specialStateTransition(CtxType * ctx, RecognizerType* recognizer, IntStreamType* is, ANTLR_INT32 s)
	{
	    ANTLR_INT32    _s;
		
	    m_ctx = ctx;
	    _s	    = s;
	    switch  (s)
	    {
	    :

		}; separator="\n">
	    }
	
	    if ( ctx->get_backtracking() > 0)
	    {
		 ctx->set_failedflag( true );
		return	-1;
	    }
	
	    ExceptionBaseType* ex = new ANTLR_Exception\< ImplTraits, NO_VIABLE_ALT_EXCEPTION, StreamType>( recognizer, "" );
	    ex->set_decisionNum(  );
	    ex->set_state(_s);
	    <@noViableAltException()>
	    return -1;
	}
	
};
 
static CyclicDFA  cdfa(
	    ,		    /* Decision number of this dfa	    */
	    /* Which decision this represents:   */
	    (const ANTLR_UCHAR*)"",
	    dfa_eot,	    /* EOT table			    */
	    dfa_eof,	    /* EOF table			    */
	    dfa_min,	    /* Minimum tokens for each state    */
	    dfa_max,	    /* Maximum tokens for each state    */
	    dfa_accept,	/* Accept table			    */
	    dfa_special,	/* Special transition states	    */
	    dfa_transitions	/* Table of transition tables	    */

	);


/* End of Cyclic DFA 
 * ---------------------
 */
>>

/** 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) ::= <<
{
    ANTLR_UINT32 LA_;<\n>
    ANTLR_MARKER index_;<\n>

    LA_ = ctx->LA(1);<\n>
     
    index_ = ctx->index();<\n>
    ctx->rewindLast();<\n>
    
    s = -1;
    
	 
	ctx->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) ::= <<
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>
>>


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

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

orPredicates(operands) ::= "()}; separator=\"||\">)"

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

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

evalSynPredicate(pred,description) ::= "this->msynpred( antlr3::ClassForwarder\<>() )"

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) ::= "this->LA() == "

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

isolatedLookaheadRangeTest(lower,upper,k,rangeNumber,lowerAsInt,upperAsInt) ::= "((this->LA() >= ) && (this->LA() \<= ))"

setTest(ranges) ::= ""

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

makeScopeSet() ::= <<
/* makeScopeSet()
 */
 /** Definition of the  scope variable tracking
 *  structure. An instance of this structure is created by calling
 *  _Push().
 */
struct  
{
    /* =============================================================================
     * Programmer defined variables...
     */
    ;}; separator="\n">

    /* End of programmer defined variables
     * =============================================================================
     */
};

>>

globalAttributeScopeDecl(scope) ::= <<

/* globalAttributeScopeDecl(scope)
 */


>>

ruleAttributeScopeDecl(scope) ::= <<

/* ruleAttributeScopeDecl(scope)
 */


>>

globalAttributeScopeDef(scope) ::=
<<
/* globalAttributeScopeDef(scope)
 */


StackType\<  > ;


>>

ruleAttributeScopeDef(scope) ::= <<

/* ruleAttributeScopeDef(scope)
 */
StackType\<  >  ;


>>

scopeStruct(sname) ::= <<
Scope
>>

scopeStack(sname) ::= <<
m__stack
>>

returnStructName(r) ::= "_return"

returnType() ::= <%


::




void



bool

%>

/** Generate the C type associated with a single or multiple return
 *  value(s).
 */
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 "0".
 */
initValue(typeName) ::= <<
 = 
>>

/** Define a rule label  */
ruleLabelDef(label) ::= <<
 ;
>>
/**  Rule label default value */
ruleLabelInitVal(label) ::= <<
>>

ASTLabelType() ::= "ImplTraits::TreeType*"

/** 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.
 */
returnScope(scope) ::= <<



struct  : public ImplTraits::RuleReturnValueType
{
public:
    typedef ImplTraits::RuleReturnValueType BaseType;
    ()
        : BaseType()
        , () }; separator=",">
        { init(); }
    ( BaseParserType* parser )
        : BaseType(parser)
        , () }; separator=",">
        { init(); }
    ( const & other )
        : BaseType(other)
    , (other.) }; separator=", ">
    { copy(other); }
    ~()
    {
        <@ruleReturnMembersDelete()>
    }

    &
    operator=( const & other )
    {
        BaseType::operator=( other );
         = other.; }; separator="\n">
        copy(other);    
    	return *this;
    }
    <@ruleReturnMembers()>
    void init() { <@ruleReturnMembersInit()> }
    void copy( const & other) { <@ruleReturnMembersCopy()> }    

struct 
{
public:
    ImplTraits::       start;
    ImplTraits::       stop;
    ( const & other )
    
    (other.) }; separator=",">
    
    {
     	start = other.start;
     	stop  = other.stop;
    }
    
    &
    operator=( const & other )
    {
     	start = other.start;
     	stop  = other.stop;

    	 = other.; }; separator="\n">
    	return *this;
    }

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



>>

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

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

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

  m__stack.at( m__stack.size()--1).


  m__stack.at().

  m__stack.peek().


%>

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

  m__stack.at( m__stack.size()--1). = ;


  m__stack.at(). = ;

  m__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) ::= <<

.



>>

returnAttributeRef(ruleDescriptor,attr) ::= <<

retval.



>>

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

retval.=;

=;

>>

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

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


// not sure the next are the right approach
//
tokenLabelPropertyRef_text(scope,attr) ::= "(->getText())"
tokenLabelPropertyRef_type(scope,attr) ::= "(->get_type())"
tokenLabelPropertyRef_line(scope,attr) ::= "(->get_line())"
tokenLabelPropertyRef_pos(scope,attr) ::= "(->get_charPositionInLine())"
tokenLabelPropertyRef_channel(scope,attr) ::= "(->get_channel())"
tokenLabelPropertyRef_index(scope,attr) ::= "(->get_tokenIndex())"
tokenLabelPropertyRef_tree(scope,attr) ::= "(->get_tree())"
tokenLabelPropertyRef_int(scope,attr) ::= "(ImplTraits::ConvertToInt32(->getText()))"

ruleLabelPropertyRef_start(scope,attr) ::= "(.start)"
ruleLabelPropertyRef_stop(scope,attr) ::= "(.stop)"
ruleLabelPropertyRef_tree(scope,attr) ::= "(.tree)"
ruleLabelPropertyRef_text(scope,attr) ::= <<

(this->get_strstream()->toStringSS(.start, .start))

(this->get_strstream()->toStringTT(.start, .stop))

>>

ruleLabelPropertyRef_st(scope,attr) ::= ".st"

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

lexerRuleLabelPropertyRef_type(scope,attr) ::= "(->get_type())"
lexerRuleLabelPropertyRef_line(scope,attr) ::= "(->get_line())"
lexerRuleLabelPropertyRef_pos(scope,attr) ::= "(->get_charPositionInLine())"
lexerRuleLabelPropertyRef_channel(scope,attr) ::= "(->get_channel())"
lexerRuleLabelPropertyRef_index(scope,attr) ::= "(->get_tokenIndex())"
lexerRuleLabelPropertyRef_text(scope,attr) ::= "(->getText())"

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

this->get_input()->toStringSS( this->get_adaptor()->getTokenStartIndex(retval.start), this->get_adaptor()->getTokenStopIndex(retval.start))

this->get_strstream()->toStringTT(retval.start, this->LT(-1))

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

lexerRulePropertyRef_text(scope,attr) ::= "this->getText()"
lexerRulePropertyRef_type(scope,attr) ::= "_type"
lexerRulePropertyRef_line(scope,attr) ::= "this->get_state()->get_tokenStartLine()"
lexerRulePropertyRef_pos(scope,attr) ::= "this->get_state()->get_tokenStartCharPositionInLine()"
lexerRulePropertyRef_channel(scope,attr) ::= "this->get_state()->get_channel()"
lexerRulePropertyRef_start(scope,attr) ::= "this->get_state()->get_tokenStartCharIndex()"
lexerRulePropertyRef_stop(scope,attr) ::= "(this->getCharIndex()-1)"
lexerRulePropertyRef_index(scope,attr) ::= "-1" // undefined token index in lexer
lexerRulePropertyRef_int(scope,attr) ::= "(ImplTraits::ConvertToInt32(->getText()))"


// setting $st and $tree is allowed in local rule. everything else is flagged as error
ruleSetPropertyRef_tree(scope,attr,expr) ::= "retval.tree=;"
ruleSetPropertyRef_st(scope,attr,expr) ::= "retval.st=;"


/** How to deal with an @after for C targets. Because we cannot rely on
 *  any garbage collection, after code is executed even in backtracking
 *  mode. Must be documented clearly.
 */
execAfter(action) ::= <<
{
    
}
>>

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


if (  )
{
    
}

if ( BACKTRACKING == 0 )
{
    
}


{
    
}

>>

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

bitsetDeclare(bitsetname, words64, traits) ::= <<

/** Bitset defining follow set for error recovery in rule state:   */
static	ANTLR_BITWORD _bits[]	= { )}; separator=", "> };
static  ::BitsetListType ( _bits,  );
>>

codeFileExtension() ::= ".cpp"

true_value() ::= "true"
false_value() ::= "false"