• Home
• org.cassandraunit
• cassandra-unit-shaded
• 3.3.0.2
• source code
• AST.stg

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

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

/*
 [The "BSD license"]
 Copyright (c) 2005-2009 Jim Idle, Temporal Wave LLC
 http://www.temporal-wave.com
 http://www.linkedin.com/in/jimidle

 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.
*/
/** Add an adaptor property that knows how to build trees */
@headerFile.members() ::= <<
/* @headerFile.members() */
pANTLR3_BASE_TREE_ADAPTOR	adaptor;
pANTLR3_VECTOR_FACTORY		vectors;
/* End @headerFile.members() */
>>

/** Install the tree adaptor interface pointer and anything else that
 *  tree parsers and producers require.
 */
@genericParser.apifuncs() ::= <<

ADAPTOR	= ANTLR3_TREE_ADAPTORNew(instream->tstream->tokenSource->strFactory);<\n>

ctx->vectors	= antlr3VectorFactoryNew(0);
>>

@genericParser.cleanup() ::= <<
ctx->vectors->close(ctx->vectors);

/* We created the adaptor so we must free it
 */
ADAPTOR->free(ADAPTOR);

>>

@returnScope.ruleReturnMembers() ::= <<

	tree;

>>

/** Add a variable to track rule's return AST */
ruleDeclarations() ::= <<

 root_0;<\n>
>>

ruleInitializations() ::= <<

root_0 = NULL;<\n>
>>

ruleLabelDefs() ::= <<

 _tree;}; separator="\n">
 _tree;}; separator="\n">
_STREAM stream_;}; separator="\n">
;}; separator="\n">
>>

/* Note that we defer the actual creation of any rewrite streams we need here and just initialize
 * them to NULL. This saves creating huge numbers of rewrite streams that cannot be used as only
 * one alt will be taken in a rule, but we are declaring all the streams here. So we define
 * a macro that conatins the create code, then use this macro later to check if the stream
 * has been created yet. Checking for NULL is almost free in C.
 */
ruleLabelInitializations() ::= <<

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

   = NULL;
#define CREATE_stream_  if (stream_ == NULL) {stream_ = antlr3RewriteRuleStreamNewAE(ADAPTOR, RECOGNIZER, (pANTLR3_UINT8)"token "); \} }; separator="\n">
   = NULL;
#define CREATE_stream_  if (stream_ == NULL) {stream_ = antlr3RewriteRuleSubtreeStreamNewAE(ADAPTOR, RECOGNIZER, (pANTLR3_UINT8)"rule "); \}}; separator="\n">


retval.tree  = NULL;

>>


/**  a rule label including default value */
ruleLabelInitVal(label) ::= <<

.tree = NULL;
>>

/** When doing auto AST construction, we must define some variables;
 *  These should be turned off if doing rewrites.  This must be a "mode"
 *  as a rule could have both rewrite and AST within the same alternative
 *  block.
 */
@alt.declarations() ::= <<




>>

@alt.initializations() ::= <<



root_0 = ()(ADAPTOR->nilNode(ADAPTOR));<\n>



>>


// T r a c k i n g  R u l e  E l e m e n t s
//
/** ID but track it for use in a rewrite rule */
tokenRefTrack(token,label,elementIndex,terminalOptions) ::= <<
 
if (  ) { CREATE_stream_; stream_->add(stream_, , NULL); }<\n>
>>

/** ids+=ID and track it for use in a rewrite rule; adds to ids *and*
 *  to the tracking list stream_ID for use in the rewrite.
 */
tokenRefTrackAndListLabel(token,label,elementIndex,terminalOptions) ::= <<


>>

/** ^(ID ...) track for rewrite */
tokenRefRuleRootTrack(token,label,elementIndex,terminalOptions) ::= <<

if (  ) {CREATE_stream_; stream_->add(stream_, , NULL); }<\n>
>>

wildcardTrack(label,elementIndex) ::= <<

>>

/** rule when output=AST and tracking for rewrite */
ruleRefTrack(rule,label,elementIndex,args,scope) ::= <<

if (  ) { CREATE_stream_; stream_->add(stream_, .tree, NULL); }
>>

/** x+=rule when output=AST and tracking for rewrite */
ruleRefTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<


>>

/** ^(rule ...) rewrite */
ruleRefRuleRootTrack(rule,label,elementIndex,args,scope) ::= <<

if (  ) { CREATE_stream_; stream_->add(stream_, .tree, NULL); }
>>

/** ^(x+=rule ...) rewrite */
ruleRefRuleRootTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<


>>


// RULE REF AST



/** Match ^(label+=TOKEN ...) track for rewrite */
tokenRefRuleRootTrackAndListLabel(token,label,elementIndex,terminalOptions) ::= <<


>>


/* How to accumulate lists when we are doing rewrite tracking...
 */
listLabelTrack(label) ::= <<
/* listLabelTrack(label)
 */
if (list_ == NULL)
{
    list_=ctx->vectors->newVector(ctx->vectors);
}
list_->add(list_, .tree, NULL);
>>

/* How to accumulate lists of rule outputs (only allowed with AST
 * option but if the user is going to walk the tree, they will want
 * all their custom elements from rule returns.
 *
 * Normally, we use inline structures (which the compiler lays down
 * code to copy from heap allocations. However, here we want to accumulate copies
 * of the returned structures because we are adding them to a list. This only makes sense if the
 * grammar is not rewriting the tree as a tree rewrite only preserves the tree, not the object/structure
 * returned from the rule. The rewrite will extract the tree pointer. However, if we are not going to
 * do a tree re-write, then the user may wish to iterate the structures returned by the rule in
 * action code and will expect the user defined returns[] elements to be available when they do this.
 * Hence we cannot just preserve the tree that was returned. So, we must copy the local structure and provide
 * a function that can free the allocated space. We cannot know how to free user allocated elements and
 * presume that the user will know to do this using their own factories for the structures they allocate.
 */
listLabelAST(label) ::= <<
if (list_ == NULL)
{
    list_=ctx->vectors->newVector(ctx->vectors);
}
{
    RETURN_TYPE_ * tcopy;

    tcopy = (RETURN_TYPE_ *)ANTLR3_MALLOC(sizeof(RETURN_TYPE_)); /* Note no memory allocation checks! */
    ANTLR3_MEMCPY((void *)(tcopy), (const void *)&, sizeof(RETURN_TYPE_));
    list_->add(list_, (void *)tcopy, freeScope);  /* Add whatever the return type is */<\n>
}
>>

// R e w r i t e

rewriteCode(
	alts,
	description,
	referencedElementsDeep, // ALL referenced elements to right of ->
	referencedTokenLabels,
	referencedTokenListLabels,
	referencedRuleLabels,
	referencedRuleListLabels,
    referencedWildcardLabels,
    referencedWildcardListLabels,
	rewriteBlockLevel,
	enclosingTreeLevel,
	treeLevel) ::=
<<

/* AST REWRITE
 * elements          : 
 * token labels      : 
 * rule labels       : 
 * token list labels : 
 * rule list labels  : 
 */

if (  ) <\n>

{
	
	
	root_0			    = ()(ADAPTOR->nilNode(ADAPTOR));
	.tree    = root_0;
	
	
	
	.tree = ()(ADAPTOR->rulePostProcessing(ADAPTOR, root_0));
	INPUT->replaceChildren(INPUT, ADAPTOR->getParent(ADAPTOR, retval.start),
                      ADAPTOR->getChildIndex(ADAPTOR, retval.start),
                      ADAPTOR->getChildIndex(ADAPTOR, _last),
                      retval.tree);
	
	
	.tree = root_0; // set result root
	

}
>>

rewriteCodeLabelsDecl() ::= <<
_STREAM stream_;};
    separator="\n"
>
_STREAM stream_;};
    separator="\n"
>
;};
    separator="\n"
>
;};
    separator="\n"
>
>>

rewriteCodeLabelsInit() ::= <<
=antlr3RewriteRuleStreamNewAEE(ADAPTOR,  RECOGNIZER, (pANTLR3_UINT8)"token ", );};
separator="\n"
>
=antlr3RewriteRuleStreamNewAEV(ADAPTOR,  RECOGNIZER, (pANTLR3_UINT8)"token ", list_); };
separator="\n"
>
=antlr3RewriteRuleSubtreeStreamNewAEE(ADAPTOR,  RECOGNIZER, (pANTLR3_UINT8)"token ", .tree != NULL ? .tree : NULL);};
separator="\n"
>
=antlr3RewriteRuleSubtreeStreamNewAEV(ADAPTOR,  RECOGNIZER, (pANTLR3_UINT8)"token ", list_);};
separator="\n"
>
>>
rewriteCodeLabelsFree() ::= <<
 != NULL) stream_->free(stream_); };
separator="\n"
>
 != NULL) stream_->free(stream_);};
separator="\n"
>
 != NULL) stream_->free(stream_);};
separator="\n"
>
 != NULL) stream_->free(stream_);};
separator="\n"
>
>>

/** Generate code for an optional rewrite block; note it uses the deep ref'd element
  *  list rather shallow like other blocks.
  */
rewriteOptionalBlock(
	alt,
	rewriteBlockLevel,
	referencedElementsDeep, // all nested refs
	referencedElements,		// elements in immediately block; no nested blocks
	description) ::=
<<
// :
{
	if (  != NULL && stream_->hasNext(stream_)) }; separator="|| "> )
	{
		
	}
	 != NULL) stream_->reset(stream_);<\n>}>
}<\n>
>>

rewriteClosureBlock(
	alt,
	rewriteBlockLevel,
	referencedElementsDeep, // all nested refs
	referencedElements,		// elements in immediately block; no nested blocks
	description) ::=
<<
// :
{
	while (  != NULL && stream_->hasNext(stream_)) }; separator="|| "> )
	{
		
	}
	 != NULL) stream_->reset(stream_);<\n>}>
}<\n>
>>
RewriteEarlyExitException() ::=
<<
CONSTRUCTEX();
EXCEPTION->type         = ANTLR3_REWRITE_EARLY_EXCEPTION;
EXCEPTION->name         = (void *)ANTLR3_REWRITE_EARLY_EXCEPTION_NAME;
>>
rewritePositiveClosureBlock(
	alt,
	rewriteBlockLevel,
	referencedElementsDeep, // all nested refs
	referencedElements,		// elements in immediately block; no nested blocks
	description) ::=
<<
if ( == NULL || !stream_->hasNext(stream_)) }; separator="|| "> )
{
    
}
else
{
	while ( ->hasNext(stream_)) }; separator="|| "> ) {
		
	}
	->reset(stream_);<\n>}>
}
>>

rewriteAlt(a) ::= <<
// 

if ()
{
    
}<\n>

{
    
}<\n>

>>

/** For empty rewrites: "r : ... -> ;" */
rewriteEmptyAlt() ::= "root_0 = NULL; /* \<-- rewriteEmptyAlt()) */"

rewriteTree(root,children,description,enclosingTreeLevel,treeLevel) ::= <<
// :
{
     root_ = ()(ADAPTOR->nilNode(ADAPTOR));
    
    
    ADAPTOR->addChild(ADAPTOR, root_, root_);
}<\n>
>>

rewriteElementList(elements) ::= ""

rewriteElement(e) ::= <<
<@pregen()>

>>

/** Gen ID or ID[args] */
rewriteTokenRef(token,elementIndex,terminalOptions,args) ::= <<
ADAPTOR->addChild(ADAPTOR, root_, );<\n>
>>

/** Gen $label ... where defined via label=ID */
rewriteTokenLabelRef(label,elementIndex) ::= <<
ADAPTOR->addChild(ADAPTOR, root_, stream_ == NULL ? NULL : stream_->nextNode(stream_));<\n>
>>

/** Gen $label ... where defined via label+=ID */
rewriteTokenListLabelRef(label,elementIndex) ::= <<
ADAPTOR->addChild(ADAPTOR, root_, stream_ == NULL ? NULL : stream_->nextNode(stream_));<\n>
>>

/** Gen ^($label ...) */
rewriteTokenLabelRefRoot(label,elementIndex) ::= <<
root_ = ()(ADAPTOR->becomeRootToken(ADAPTOR, stream_ == NULL ? NULL : stream_->nextToken(stream_), root_));<\n>
>>

/** Gen ^($label ...) where label+=... */
rewriteTokenListLabelRefRoot ::= rewriteTokenLabelRefRoot

/** Gen ^(ID ...) or ^(ID[args] ...) */
rewriteTokenRefRoot(token,elementIndex,terminalOptions,args) ::= <<
root_ = ()(ADAPTOR->becomeRoot(ADAPTOR, , root_));<\n>
>>

rewriteImaginaryTokenRef(args,token,terminalOptions,elementIndex) ::= <<
ADAPTOR->addChild(ADAPTOR, root_, );<\n>
>>

rewriteImaginaryTokenRefRoot(args,token,terminalOptions,elementIndex) ::= <<
root_ = ()(ADAPTOR->becomeRoot(ADAPTOR, , root_));<\n>
>>

/** plain -> {foo} action */
rewriteAction(action) ::= <<
root_0 = ;<\n>
>>

/** What is the name of the previous value of this rule's root tree?  This
 *  let's us refer to $rule to mean previous value.  I am reusing the
 *  variable 'tree' sitting in retval struct to hold the value of root_0 right
 *  before I set it during rewrites.  The assign will be to retval.tree.
 */
prevRuleRootRef() ::= "retval"

rewriteRuleRef(rule,dup) ::= <<
ADAPTOR->addChild(ADAPTOR, root_, stream_ == NULL ? NULL : stream_->nextTree(stream_));<\n>
>>

rewriteRuleRefRoot(rule,dup) ::= <<
root_ = ()(ADAPTOR->becomeRoot(ADAPTOR, stream_ == NULL ? NULL : stream_->nextNode(stream_), root_));<\n>
>>

rewriteNodeAction(action) ::= <<
ADAPTOR->addChild(ADAPTOR, root_, );<\n>
>>

rewriteNodeActionRoot(action) ::= <<
root_ = ()(ADAPTOR->becomeRoot(ADAPTOR, , root_));<\n>
>>

/** Gen $ruleLabel ... where defined via ruleLabel=rule */
rewriteRuleLabelRef(label) ::= <<
ADAPTOR->addChild(ADAPTOR, root_, stream_ == NULL ? NULL : stream_->nextTree(stream_));<\n>
>>

/** Gen $ruleLabel ... where defined via ruleLabel+=rule */
rewriteRuleListLabelRef(label) ::= <<
ADAPTOR->addChild(ADAPTOR, root_, stream_ == NULL ? NULL : stream_->nextTree(stream_));<\n>
>>

/** Gen ^($ruleLabel ...) where ruleLabel=rule */
rewriteRuleLabelRefRoot(label) ::= <<
root_ = ()(ADAPTOR->becomeRoot(ADAPTOR, stream_ == NULL ? NULL : stream_->nextNode(stream_), root_));<\n>
>>

/** Gen ^($ruleLabel ...) where ruleLabel+=rule */
rewriteRuleListLabelRefRoot(label) ::= <<
root_ = ()(ADAPTOR->becomeRoot(()(stream_ == NULL ? NULL : stream_->nextNode(stream_), root_));<\n>
>>

rewriteWildcardLabelRef(label) ::= <<
ADAPTOR->addChild(ADAPTOR, root_, stream_ == NULL ? NULL : stream_->nextTree(stream_));<\n>
>>

createImaginaryNode(tokenType,terminalOptions,args) ::= <<


New(, )



#if  == 2
	()ADAPTOR->createTypeTokenText(ADAPTOR, , TOKTEXT())
#else
	()ADAPTOR->createTypeText(ADAPTOR, , (pANTLR3_UINT8))
#endif


()ADAPTOR->createTypeText(ADAPTOR, , (pANTLR3_UINT8)"")


>>

createRewriteNodeFromElement(token,terminalOptions,args) ::= <<

New(stream_->nextToken(stream_), )

 

#if	 == 2
ADAPTOR->createTypeTokenText(ADAPTOR, ->getType(, TOKTEXT(, )) /* JIMI */
#else
ADAPTOR->createTypeToken(ADAPTOR, ->getType(, , )
#endif


stream_ == NULL ? NULL : stream_->nextNode(stream_)


>>