// throws RecognitionException [1]
// $ANTLR start propOrIdent
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1462:1: propOrIdent[CommonTree identPrimary, IToken startToken] : DOT propId= qualifiedIdent -> ^( PROPERTY_OR_IDENTIFIER $propId) ;
public propOrIdent_return propOrIdent(CommonTree identPrimary, IToken startToken)
{
propOrIdent_return retval = new propOrIdent_return();
retval.start = input.LT(1);
int propOrIdent_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken DOT296 = null;
qualifiedIdent_return propId = null;
CommonTree DOT296_tree=null;
RewriteRuleTokenStream stream_DOT = new RewriteRuleTokenStream(adaptor,"token DOT");
RewriteRuleSubtreeStream stream_qualifiedIdent = new RewriteRuleSubtreeStream(adaptor,"rule qualifiedIdent");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 112) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1464:9: ( DOT propId= qualifiedIdent -> ^( PROPERTY_OR_IDENTIFIER $propId) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1464:9: DOT propId= qualifiedIdent
{
if ( backtracking == 0 )
{
retval.start = startToken;
}
DOT296 = (CommonToken)input.LT(1);
Match(input,DOT,FOLLOW_DOT_in_propOrIdent5290); if (failed) return retval;
if ( backtracking==0 ) stream_DOT.Add(DOT296);
if ( backtracking == 0 )
{
buffer.Append(".");
}
PushFollow(FOLLOW_qualifiedIdent_in_propOrIdent5303);
propId = qualifiedIdent();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_qualifiedIdent.Add(propId.Tree);
// AST REWRITE
// elements: propId
// token labels:
// rule labels: propId, retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_propId = new RewriteRuleSubtreeStream(adaptor, "token propId", (propId!=null ? propId.Tree : null));
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1467:3: -> ^( PROPERTY_OR_IDENTIFIER $propId)
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1467:6: ^( PROPERTY_OR_IDENTIFIER $propId)
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(PROPERTY_OR_IDENTIFIER, "PROPERTY_OR_IDENTIFIER"), root_1);
adaptor.AddChild(root_1, identPrimary);
adaptor.AddChild(root_1, stream_propId.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 112, propOrIdent_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start forIter
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:958:1: forIter : ( expressionList )? -> ^( FOR_ITERATOR ( expressionList )? ) ;
public forIter_return forIter()
{
InOperator_stack.Push(new InOperator_scope());
forIter_return retval = new forIter_return();
retval.start = input.LT(1);
int forIter_StartIndex = input.Index();
CommonTree root_0 = null;
expressionList_return expressionList157 = null;
RewriteRuleSubtreeStream stream_expressionList = new RewriteRuleSubtreeStream(adaptor,"rule expressionList");
((InOperator_scope)InOperator_stack.Peek()).allowed = true;
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 60) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:963:4: ( ( expressionList )? -> ^( FOR_ITERATOR ( expressionList )? ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:963:4: ( expressionList )?
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:963:4: ( expressionList )?
int alt44 = 2;
int LA44_0 = input.LA(1);
if ( (LA44_0 == LCURLY || (LA44_0 >= STRING_LITERAL && LA44_0 <= SET) || LA44_0 == LPAREN || LA44_0 == VOID || LA44_0 == IDENT || LA44_0 == LBRACK || LA44_0 == DYNAMIC || (LA44_0 >= IS && LA44_0 <= AS) || (LA44_0 >= PLUS && LA44_0 <= MINUS) || (LA44_0 >= INC && LA44_0 <= NEW) || (LA44_0 >= USE && LA44_0 <= XML)) )
{
alt44 = 1;
}
switch (alt44)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:0:0: expressionList
{
PushFollow(FOLLOW_expressionList_in_forIter3016);
expressionList157 = expressionList();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_expressionList.Add(expressionList157.Tree);
}
break;
}
// AST REWRITE
// elements: expressionList
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 964:3: -> ^( FOR_ITERATOR ( expressionList )? )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:964:6: ^( FOR_ITERATOR ( expressionList )? )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(FOR_ITERATOR, "FOR_ITERATOR"), root_1);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:964:21: ( expressionList )?
if ( stream_expressionList.HasNext() )
{
adaptor.AddChild(root_1, stream_expressionList.Next());
}
stream_expressionList.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 60, forIter_StartIndex);
}
InOperator_stack.Pop();
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start fullNewSubexpression
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1492:1: fullNewSubexpression : ( primaryExpression -> primaryExpression ) ( DOT qualifiedIdent -> ^( DOT $fullNewSubexpression qualifiedIdent ) | brackets -> ^( ARRAY_ACC $fullNewSubexpression brackets ) )* ;
public fullNewSubexpression_return fullNewSubexpression()
{
fullNewSubexpression_return retval = new fullNewSubexpression_return();
retval.start = input.LT(1);
int fullNewSubexpression_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken DOT306 = null;
primaryExpression_return primaryExpression305 = null;
qualifiedIdent_return qualifiedIdent307 = null;
brackets_return brackets308 = null;
CommonTree DOT306_tree=null;
RewriteRuleTokenStream stream_DOT = new RewriteRuleTokenStream(adaptor,"token DOT");
RewriteRuleSubtreeStream stream_primaryExpression = new RewriteRuleSubtreeStream(adaptor,"rule primaryExpression");
RewriteRuleSubtreeStream stream_brackets = new RewriteRuleSubtreeStream(adaptor,"rule brackets");
RewriteRuleSubtreeStream stream_qualifiedIdent = new RewriteRuleSubtreeStream(adaptor,"rule qualifiedIdent");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 116) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1493:4: ( ( primaryExpression -> primaryExpression ) ( DOT qualifiedIdent -> ^( DOT $fullNewSubexpression qualifiedIdent ) | brackets -> ^( ARRAY_ACC $fullNewSubexpression brackets ) )* )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1493:4: ( primaryExpression -> primaryExpression ) ( DOT qualifiedIdent -> ^( DOT $fullNewSubexpression qualifiedIdent ) | brackets -> ^( ARRAY_ACC $fullNewSubexpression brackets ) )*
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1493:4: ( primaryExpression -> primaryExpression )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1493:6: primaryExpression
{
PushFollow(FOLLOW_primaryExpression_in_fullNewSubexpression5424);
primaryExpression305 = primaryExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_primaryExpression.Add(primaryExpression305.Tree);
// AST REWRITE
// elements: primaryExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1493:24: -> primaryExpression
{
adaptor.AddChild(root_0, stream_primaryExpression.Next());
}
}
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1495:3: ( DOT qualifiedIdent -> ^( DOT $fullNewSubexpression qualifiedIdent ) | brackets -> ^( ARRAY_ACC $fullNewSubexpression brackets ) )*
do
{
int alt86 = 3;
int LA86_0 = input.LA(1);
if ( (LA86_0 == DOT) )
{
alt86 = 1;
}
else if ( (LA86_0 == LBRACK) )
{
alt86 = 2;
}
switch (alt86)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1495:5: DOT qualifiedIdent
{
DOT306 = (CommonToken)input.LT(1);
Match(input,DOT,FOLLOW_DOT_in_fullNewSubexpression5438); if (failed) return retval;
if ( backtracking==0 ) stream_DOT.Add(DOT306);
if ( backtracking == 0 )
{
buffer.Append(".");
}
PushFollow(FOLLOW_qualifiedIdent_in_fullNewSubexpression5443);
qualifiedIdent307 = qualifiedIdent();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_qualifiedIdent.Add(qualifiedIdent307.Tree);
// AST REWRITE
// elements: fullNewSubexpression, DOT, qualifiedIdent
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1495:49: -> ^( DOT $fullNewSubexpression qualifiedIdent )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1495:52: ^( DOT $fullNewSubexpression qualifiedIdent )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(stream_DOT.Next(), root_1);
adaptor.AddChild(root_1, stream_retval.Next());
adaptor.AddChild(root_1, stream_qualifiedIdent.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 2 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1496:5: brackets
{
PushFollow(FOLLOW_brackets_in_fullNewSubexpression5460);
brackets308 = brackets();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_brackets.Add(brackets308.Tree);
if ( backtracking == 0 )
{
}
// AST REWRITE
// elements: fullNewSubexpression, brackets
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1496:21: -> ^( ARRAY_ACC $fullNewSubexpression brackets )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1496:24: ^( ARRAY_ACC $fullNewSubexpression brackets )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(ARRAY_ACC, "ARRAY_ACC"), root_1);
adaptor.AddChild(root_1, stream_retval.Next());
adaptor.AddChild(root_1, stream_brackets.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
default:
goto loop86;
}
} while (true);
loop86:
; // Stops C# compiler whinging that label 'loop86' has no statements
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 116, fullNewSubexpression_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start conditionalExpression
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1261:1: conditionalExpression : ( logicalOrExpression -> logicalOrExpression ) ( QUESTION conditionalSubExpression -> ^( QUESTION $conditionalExpression conditionalSubExpression ) )? ;
public conditionalExpression_return conditionalExpression()
{
conditionalExpression_return retval = new conditionalExpression_return();
retval.start = input.LT(1);
int conditionalExpression_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken QUESTION232 = null;
logicalOrExpression_return logicalOrExpression231 = null;
conditionalSubExpression_return conditionalSubExpression233 = null;
CommonTree QUESTION232_tree=null;
RewriteRuleTokenStream stream_QUESTION = new RewriteRuleTokenStream(adaptor,"token QUESTION");
RewriteRuleSubtreeStream stream_logicalOrExpression = new RewriteRuleSubtreeStream(adaptor,"rule logicalOrExpression");
RewriteRuleSubtreeStream stream_conditionalSubExpression = new RewriteRuleSubtreeStream(adaptor,"rule conditionalSubExpression");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 89) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1262:4: ( ( logicalOrExpression -> logicalOrExpression ) ( QUESTION conditionalSubExpression -> ^( QUESTION $conditionalExpression conditionalSubExpression ) )? )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1262:4: ( logicalOrExpression -> logicalOrExpression ) ( QUESTION conditionalSubExpression -> ^( QUESTION $conditionalExpression conditionalSubExpression ) )?
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1262:4: ( logicalOrExpression -> logicalOrExpression )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1262:5: logicalOrExpression
{
PushFollow(FOLLOW_logicalOrExpression_in_conditionalExpression4317);
logicalOrExpression231 = logicalOrExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_logicalOrExpression.Add(logicalOrExpression231.Tree);
// AST REWRITE
// elements: logicalOrExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1262:25: -> logicalOrExpression
{
adaptor.AddChild(root_0, stream_logicalOrExpression.Next());
}
}
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1263:3: ( QUESTION conditionalSubExpression -> ^( QUESTION $conditionalExpression conditionalSubExpression ) )?
int alt68 = 2;
int LA68_0 = input.LA(1);
if ( (LA68_0 == QUESTION) )
{
alt68 = 1;
}
switch (alt68)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1264:4: QUESTION conditionalSubExpression
{
QUESTION232 = (CommonToken)input.LT(1);
Match(input,QUESTION,FOLLOW_QUESTION_in_conditionalExpression4331); if (failed) return retval;
if ( backtracking==0 ) stream_QUESTION.Add(QUESTION232);
if ( backtracking == 0 )
{
if(options.SpaceBetweenOperators) buffer.Append(" ");
buffer.Append("?");
if(options.SpaceBetweenOperators) buffer.Append(" ");
}
PushFollow(FOLLOW_conditionalSubExpression_in_conditionalExpression4338);
conditionalSubExpression233 = conditionalSubExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_conditionalSubExpression.Add(conditionalSubExpression233.Tree);
// AST REWRITE
// elements: conditionalSubExpression, QUESTION, conditionalExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1270:4: -> ^( QUESTION $conditionalExpression conditionalSubExpression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1270:7: ^( QUESTION $conditionalExpression conditionalSubExpression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(stream_QUESTION.Next(), root_1);
adaptor.AddChild(root_1, stream_retval.Next());
adaptor.AddChild(root_1, stream_conditionalSubExpression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 89, conditionalExpression_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start expressionList
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1222:1: expressionList : assignmentExpression ( COMMA assignmentExpression )* -> ^( ELIST assignmentExpression ( COMMA assignmentExpression )* ) ;
public expressionList_return expressionList()
{
expressionList_return retval = new expressionList_return();
retval.start = input.LT(1);
int expressionList_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken COMMA227 = null;
assignmentExpression_return assignmentExpression226 = null;
assignmentExpression_return assignmentExpression228 = null;
CommonTree COMMA227_tree=null;
RewriteRuleTokenStream stream_COMMA = new RewriteRuleTokenStream(adaptor,"token COMMA");
RewriteRuleSubtreeStream stream_assignmentExpression = new RewriteRuleSubtreeStream(adaptor,"rule assignmentExpression");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 86) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1223:4: ( assignmentExpression ( COMMA assignmentExpression )* -> ^( ELIST assignmentExpression ( COMMA assignmentExpression )* ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1223:4: assignmentExpression ( COMMA assignmentExpression )*
{
PushFollow(FOLLOW_assignmentExpression_in_expressionList4132);
assignmentExpression226 = assignmentExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_assignmentExpression.Add(assignmentExpression226.Tree);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1224:3: ( COMMA assignmentExpression )*
do
{
int alt66 = 2;
int LA66_0 = input.LA(1);
if ( (LA66_0 == COMMA) )
{
alt66 = 1;
}
switch (alt66)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1225:4: COMMA assignmentExpression
{
COMMA227 = (CommonToken)input.LT(1);
Match(input,COMMA,FOLLOW_COMMA_in_expressionList4142); if (failed) return retval;
if ( backtracking==0 ) stream_COMMA.Add(COMMA227);
if ( backtracking == 0 )
{
buffer.Append(options.SpaceBetweenArguments ? ", " : ",");
}
PushFollow(FOLLOW_assignmentExpression_in_expressionList4154);
assignmentExpression228 = assignmentExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_assignmentExpression.Add(assignmentExpression228.Tree);
}
break;
default:
goto loop66;
}
} while (true);
loop66:
; // Stops C# compiler whinging that label 'loop66' has no statements
// AST REWRITE
// elements: assignmentExpression, assignmentExpression, COMMA
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1227:6: -> ^( ELIST assignmentExpression ( COMMA assignmentExpression )* )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1227:9: ^( ELIST assignmentExpression ( COMMA assignmentExpression )* )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(ELIST, "ELIST"), root_1);
adaptor.AddChild(root_1, stream_assignmentExpression.Next());
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1227:38: ( COMMA assignmentExpression )*
while ( stream_assignmentExpression.HasNext() || stream_COMMA.HasNext() )
{
adaptor.AddChild(root_1, stream_COMMA.Next());
adaptor.AddChild(root_1, stream_assignmentExpression.Next());
}
stream_assignmentExpression.Reset();
stream_COMMA.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 86, expressionList_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start comment
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1512:1: comment : ( singleCommentStatement ( comment )* -> ^( COMMENT_ENTRY singleCommentStatement ) ( comment )* | multiCommentStatement ( comment )* -> ^( COMMENT_ENTRY multiCommentStatement ) ( comment )* );
public comment_return comment()
{
comment_return retval = new comment_return();
retval.start = input.LT(1);
int comment_StartIndex = input.Index();
CommonTree root_0 = null;
singleCommentStatement_return singleCommentStatement310 = null;
comment_return comment311 = null;
multiCommentStatement_return multiCommentStatement312 = null;
comment_return comment313 = null;
RewriteRuleSubtreeStream stream_multiCommentStatement = new RewriteRuleSubtreeStream(adaptor,"rule multiCommentStatement");
RewriteRuleSubtreeStream stream_singleCommentStatement = new RewriteRuleSubtreeStream(adaptor,"rule singleCommentStatement");
RewriteRuleSubtreeStream stream_comment = new RewriteRuleSubtreeStream(adaptor,"rule comment");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 118) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1513:4: ( singleCommentStatement ( comment )* -> ^( COMMENT_ENTRY singleCommentStatement ) ( comment )* | multiCommentStatement ( comment )* -> ^( COMMENT_ENTRY multiCommentStatement ) ( comment )* )
int alt90 = 2;
int LA90_0 = input.LA(1);
if ( (LA90_0 == SL_COMMENT) )
{
alt90 = 1;
}
else if ( (LA90_0 == ML_COMMENT) )
{
alt90 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d90s0 =
new NoViableAltException("1512:1: comment : ( singleCommentStatement ( comment )* -> ^( COMMENT_ENTRY singleCommentStatement ) ( comment )* | multiCommentStatement ( comment )* -> ^( COMMENT_ENTRY multiCommentStatement ) ( comment )* );", 90, 0, input);
throw nvae_d90s0;
}
switch (alt90)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1513:4: singleCommentStatement ( comment )*
{
PushFollow(FOLLOW_singleCommentStatement_in_comment5523);
singleCommentStatement310 = singleCommentStatement();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_singleCommentStatement.Add(singleCommentStatement310.Tree);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1513:27: ( comment )*
do
{
int alt88 = 2;
int LA88_0 = input.LA(1);
if ( (LA88_0 == SL_COMMENT) )
{
int LA88_15 = input.LA(2);
if ( (synpred177()) )
{
alt88 = 1;
}
}
else if ( (LA88_0 == ML_COMMENT) )
{
int LA88_16 = input.LA(2);
if ( (synpred177()) )
{
alt88 = 1;
}
}
switch (alt88)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:0:0: comment
{
PushFollow(FOLLOW_comment_in_comment5525);
comment311 = comment();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_comment.Add(comment311.Tree);
}
break;
default:
goto loop88;
}
} while (true);
loop88:
; // Stops C# compiler whinging that label 'loop88' has no statements
// AST REWRITE
// elements: singleCommentStatement, comment
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1513:36: -> ^( COMMENT_ENTRY singleCommentStatement ) ( comment )*
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1513:39: ^( COMMENT_ENTRY singleCommentStatement )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(COMMENT_ENTRY, "COMMENT_ENTRY"), root_1);
adaptor.AddChild(root_1, stream_singleCommentStatement.Next());
adaptor.AddChild(root_0, root_1);
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1513:79: ( comment )*
while ( stream_comment.HasNext() )
{
adaptor.AddChild(root_0, stream_comment.Next());
}
stream_comment.Reset();
}
}
}
break;
case 2 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1514:4: multiCommentStatement ( comment )*
{
PushFollow(FOLLOW_multiCommentStatement_in_comment5542);
multiCommentStatement312 = multiCommentStatement();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_multiCommentStatement.Add(multiCommentStatement312.Tree);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1514:27: ( comment )*
do
{
int alt89 = 2;
int LA89_0 = input.LA(1);
if ( (LA89_0 == SL_COMMENT) )
{
int LA89_15 = input.LA(2);
if ( (synpred179()) )
{
alt89 = 1;
}
}
else if ( (LA89_0 == ML_COMMENT) )
{
int LA89_16 = input.LA(2);
if ( (synpred179()) )
{
alt89 = 1;
}
}
switch (alt89)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:0:0: comment
{
PushFollow(FOLLOW_comment_in_comment5545);
comment313 = comment();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_comment.Add(comment313.Tree);
}
break;
default:
goto loop89;
}
} while (true);
loop89:
; // Stops C# compiler whinging that label 'loop89' has no statements
// AST REWRITE
// elements: comment, multiCommentStatement
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1514:36: -> ^( COMMENT_ENTRY multiCommentStatement ) ( comment )*
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1514:39: ^( COMMENT_ENTRY multiCommentStatement )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(COMMENT_ENTRY, "COMMENT_ENTRY"), root_1);
adaptor.AddChild(root_1, stream_multiCommentStatement.Next());
adaptor.AddChild(root_0, root_1);
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1514:78: ( comment )*
while ( stream_comment.HasNext() )
{
adaptor.AddChild(root_0, stream_comment.Next());
}
stream_comment.Reset();
}
}
}
break;
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 118, comment_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start compilationUnit
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:329:1: compilationUnit[StringBuilder ret] : as2CompilationUnit -> ^( COMPILATION_UNIT as2CompilationUnit ) ;
public compilationUnit_return compilationUnit(StringBuilder ret)
{
compilationUnit_return retval = new compilationUnit_return();
retval.start = input.LT(1);
int compilationUnit_StartIndex = input.Index();
CommonTree root_0 = null;
as2CompilationUnit_return as2CompilationUnit1 = null;
RewriteRuleSubtreeStream stream_as2CompilationUnit = new RewriteRuleSubtreeStream(adaptor,"rule as2CompilationUnit");
buffer = ret;
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 1) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:336:4: ( as2CompilationUnit -> ^( COMPILATION_UNIT as2CompilationUnit ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:336:4: as2CompilationUnit
{
PushFollow(FOLLOW_as2CompilationUnit_in_compilationUnit437);
as2CompilationUnit1 = as2CompilationUnit();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_as2CompilationUnit.Add(as2CompilationUnit1.Tree);
// AST REWRITE
// elements: as2CompilationUnit
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 336:23: -> ^( COMPILATION_UNIT as2CompilationUnit )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:336:26: ^( COMPILATION_UNIT as2CompilationUnit )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(COMPILATION_UNIT, "COMPILATION_UNIT"), root_1);
adaptor.AddChild(root_1, stream_as2CompilationUnit.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
if ( backtracking == 0 )
{
finalize();
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 1, compilationUnit_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start typeExpression
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1015:1: typeExpression : c= COLON ( identifier | VOID | STAR ) -> ^( TYPE_SPEC[$c] ( identifier )? ( VOID )? ( STAR )? ) ;
public typeExpression_return typeExpression()
{
typeExpression_return retval = new typeExpression_return();
retval.start = input.LT(1);
int typeExpression_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken c = null;
CommonToken VOID170 = null;
CommonToken STAR171 = null;
identifier_return identifier169 = null;
CommonTree c_tree=null;
CommonTree VOID170_tree=null;
CommonTree STAR171_tree=null;
RewriteRuleTokenStream stream_STAR = new RewriteRuleTokenStream(adaptor,"token STAR");
RewriteRuleTokenStream stream_COLON = new RewriteRuleTokenStream(adaptor,"token COLON");
RewriteRuleTokenStream stream_VOID = new RewriteRuleTokenStream(adaptor,"token VOID");
RewriteRuleSubtreeStream stream_identifier = new RewriteRuleSubtreeStream(adaptor,"rule identifier");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 64) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1017:3: (c= COLON ( identifier | VOID | STAR ) -> ^( TYPE_SPEC[$c] ( identifier )? ( VOID )? ( STAR )? ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1017:3: c= COLON ( identifier | VOID | STAR )
{
c = (CommonToken)input.LT(1);
Match(input,COLON,FOLLOW_COLON_in_typeExpression3152); if (failed) return retval;
if ( backtracking==0 ) stream_COLON.Add(c);
if ( backtracking == 0 )
{
buffer.Append(options.SpaceBetweenType ? " : " : ":");
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1018:3: ( identifier | VOID | STAR )
int alt45 = 3;
switch ( input.LA(1) )
{
case GET:
case SET:
case IDENT:
case DYNAMIC:
case IS:
case AS:
case USE:
case XML:
{
alt45 = 1;
}
break;
case VOID:
{
alt45 = 2;
}
break;
case STAR:
{
alt45 = 3;
}
break;
default:
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d45s0 =
new NoViableAltException("1018:3: ( identifier | VOID | STAR )", 45, 0, input);
throw nvae_d45s0;
}
switch (alt45)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1019:4: identifier
{
PushFollow(FOLLOW_identifier_in_typeExpression3165);
identifier169 = identifier();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_identifier.Add(identifier169.Tree);
}
break;
case 2 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1020:6: VOID
{
VOID170 = (CommonToken)input.LT(1);
Match(input,VOID,FOLLOW_VOID_in_typeExpression3173); if (failed) return retval;
if ( backtracking==0 ) stream_VOID.Add(VOID170);
if ( backtracking == 0 )
{
buffer.Append("Void");
}
}
break;
case 3 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1021:6: STAR
{
STAR171 = (CommonToken)input.LT(1);
Match(input,STAR,FOLLOW_STAR_in_typeExpression3183); if (failed) return retval;
if ( backtracking==0 ) stream_STAR.Add(STAR171);
if ( backtracking == 0 )
{
buffer.Append("*");
}
}
break;
}
// AST REWRITE
// elements: STAR, VOID, identifier
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1023:3: -> ^( TYPE_SPEC[$c] ( identifier )? ( VOID )? ( STAR )? )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1023:6: ^( TYPE_SPEC[$c] ( identifier )? ( VOID )? ( STAR )? )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(TYPE_SPEC, c), root_1);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1023:22: ( identifier )?
if ( stream_identifier.HasNext() )
{
adaptor.AddChild(root_1, stream_identifier.Next());
}
stream_identifier.Reset();
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1023:34: ( VOID )?
if ( stream_VOID.HasNext() )
{
adaptor.AddChild(root_1, stream_VOID.Next());
}
stream_VOID.Reset();
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1023:40: ( STAR )?
if ( stream_STAR.HasNext() )
{
adaptor.AddChild(root_1, stream_STAR.Next());
}
stream_STAR.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 64, typeExpression_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start unaryExpression
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1420:1: unaryExpression : (iin= INC unaryExpression -> ^( PRE_INC[$iin] unaryExpression ) | dde= DEC unaryExpression -> ^( PRE_DEC[$dde] unaryExpression ) | tmin= MINUS unaryExpression -> ^( UNARY_MINUS unaryExpression ) | tplus= PLUS unaryExpression -> ^( UNARY_PLUS unaryExpression ) | unaryExpressionNotPlusMinus );
public unaryExpression_return unaryExpression()
{
unaryExpression_return retval = new unaryExpression_return();
retval.start = input.LT(1);
int unaryExpression_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken iin = null;
CommonToken dde = null;
CommonToken tmin = null;
CommonToken tplus = null;
unaryExpression_return unaryExpression274 = null;
unaryExpression_return unaryExpression275 = null;
unaryExpression_return unaryExpression276 = null;
unaryExpression_return unaryExpression277 = null;
unaryExpressionNotPlusMinus_return unaryExpressionNotPlusMinus278 = null;
CommonTree iin_tree=null;
CommonTree dde_tree=null;
CommonTree tmin_tree=null;
CommonTree tplus_tree=null;
RewriteRuleTokenStream stream_PLUS = new RewriteRuleTokenStream(adaptor,"token PLUS");
RewriteRuleTokenStream stream_INC = new RewriteRuleTokenStream(adaptor,"token INC");
RewriteRuleTokenStream stream_MINUS = new RewriteRuleTokenStream(adaptor,"token MINUS");
RewriteRuleTokenStream stream_DEC = new RewriteRuleTokenStream(adaptor,"token DEC");
RewriteRuleSubtreeStream stream_unaryExpression = new RewriteRuleSubtreeStream(adaptor,"rule unaryExpression");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 108) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1421:4: (iin= INC unaryExpression -> ^( PRE_INC[$iin] unaryExpression ) | dde= DEC unaryExpression -> ^( PRE_DEC[$dde] unaryExpression ) | tmin= MINUS unaryExpression -> ^( UNARY_MINUS unaryExpression ) | tplus= PLUS unaryExpression -> ^( UNARY_PLUS unaryExpression ) | unaryExpressionNotPlusMinus )
int alt80 = 5;
switch ( input.LA(1) )
{
case INC:
{
alt80 = 1;
}
break;
case DEC:
{
alt80 = 2;
}
break;
case MINUS:
{
alt80 = 3;
}
break;
case PLUS:
{
alt80 = 4;
}
break;
case LCURLY:
case STRING_LITERAL:
case FUNCTION:
case GET:
case SET:
case LPAREN:
case VOID:
case IDENT:
case LBRACK:
case DYNAMIC:
case IS:
case AS:
case DELETE:
case TYPEOF:
case LNOT:
case BNOT:
case UNDEFINED:
case TRUE:
case FALSE:
case NULL:
case HEX_LITERAL:
case DECIMAL_LITERAL:
case OCTAL_LITERAL:
case FLOAT_LITERAL:
case NEW:
case USE:
case XML:
{
alt80 = 5;
}
break;
default:
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d80s0 =
new NoViableAltException("1420:1: unaryExpression : (iin= INC unaryExpression -> ^( PRE_INC[$iin] unaryExpression ) | dde= DEC unaryExpression -> ^( PRE_DEC[$dde] unaryExpression ) | tmin= MINUS unaryExpression -> ^( UNARY_MINUS unaryExpression ) | tplus= PLUS unaryExpression -> ^( UNARY_PLUS unaryExpression ) | unaryExpressionNotPlusMinus );", 80, 0, input);
throw nvae_d80s0;
}
switch (alt80)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1421:4: iin= INC unaryExpression
{
iin = (CommonToken)input.LT(1);
Match(input,INC,FOLLOW_INC_in_unaryExpression4884); if (failed) return retval;
if ( backtracking==0 ) stream_INC.Add(iin);
if ( backtracking == 0 )
{
buffer.Append(iin.Text);
}
PushFollow(FOLLOW_unaryExpression_in_unaryExpression4889);
unaryExpression274 = unaryExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_unaryExpression.Add(unaryExpression274.Tree);
// AST REWRITE
// elements: unaryExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1421:59: -> ^( PRE_INC[$iin] unaryExpression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1421:62: ^( PRE_INC[$iin] unaryExpression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(PRE_INC, iin), root_1);
adaptor.AddChild(root_1, stream_unaryExpression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 2 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1422:4: dde= DEC unaryExpression
{
dde = (CommonToken)input.LT(1);
Match(input,DEC,FOLLOW_DEC_in_unaryExpression4906); if (failed) return retval;
if ( backtracking==0 ) stream_DEC.Add(dde);
if ( backtracking == 0 )
{
buffer.Append(dde.Text);
}
PushFollow(FOLLOW_unaryExpression_in_unaryExpression4911);
unaryExpression275 = unaryExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_unaryExpression.Add(unaryExpression275.Tree);
// AST REWRITE
// elements: unaryExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1422:59: -> ^( PRE_DEC[$dde] unaryExpression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1422:62: ^( PRE_DEC[$dde] unaryExpression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(PRE_DEC, dde), root_1);
adaptor.AddChild(root_1, stream_unaryExpression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 3 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1423:4: tmin= MINUS unaryExpression
{
tmin = (CommonToken)input.LT(1);
Match(input,MINUS,FOLLOW_MINUS_in_unaryExpression4928); if (failed) return retval;
if ( backtracking==0 ) stream_MINUS.Add(tmin);
if ( backtracking == 0 )
{
buffer.Append(tmin.Text);
}
PushFollow(FOLLOW_unaryExpression_in_unaryExpression4932);
unaryExpression276 = unaryExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_unaryExpression.Add(unaryExpression276.Tree);
// AST REWRITE
// elements: unaryExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1423:63: -> ^( UNARY_MINUS unaryExpression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1423:66: ^( UNARY_MINUS unaryExpression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(UNARY_MINUS, "UNARY_MINUS"), root_1);
adaptor.AddChild(root_1, stream_unaryExpression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 4 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1424:4: tplus= PLUS unaryExpression
{
tplus = (CommonToken)input.LT(1);
Match(input,PLUS,FOLLOW_PLUS_in_unaryExpression4948); if (failed) return retval;
if ( backtracking==0 ) stream_PLUS.Add(tplus);
if ( backtracking == 0 )
{
buffer.Append(tplus.Text);
}
PushFollow(FOLLOW_unaryExpression_in_unaryExpression4952);
unaryExpression277 = unaryExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_unaryExpression.Add(unaryExpression277.Tree);
// AST REWRITE
// elements: unaryExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1424:63: -> ^( UNARY_PLUS unaryExpression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1424:66: ^( UNARY_PLUS unaryExpression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(UNARY_PLUS, "UNARY_PLUS"), root_1);
adaptor.AddChild(root_1, stream_unaryExpression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 5 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1425:4: unaryExpressionNotPlusMinus
{
root_0 = (CommonTree)adaptor.GetNilNode();
PushFollow(FOLLOW_unaryExpressionNotPlusMinus_in_unaryExpression4966);
unaryExpressionNotPlusMinus278 = unaryExpressionNotPlusMinus();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) adaptor.AddChild(root_0, unaryExpressionNotPlusMinus278.Tree);
}
break;
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 108, unaryExpression_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start switchStatementList
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:866:1: switchStatementList : ( statement )* -> ^( SWITCH_STATEMENT_LIST ( statement )* ) ;
public switchStatementList_return switchStatementList()
{
switchStatementList_return retval = new switchStatementList_return();
retval.start = input.LT(1);
int switchStatementList_StartIndex = input.Index();
CommonTree root_0 = null;
statement_return statement139 = null;
RewriteRuleSubtreeStream stream_statement = new RewriteRuleSubtreeStream(adaptor,"rule statement");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 52) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:867:4: ( ( statement )* -> ^( SWITCH_STATEMENT_LIST ( statement )* ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:867:4: ( statement )*
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:867:4: ( statement )*
do
{
int alt39 = 2;
int LA39_0 = input.LA(1);
if ( (LA39_0 == SEMI || LA39_0 == LCURLY || (LA39_0 >= STRING_LITERAL && LA39_0 <= CONST) || LA39_0 == LPAREN || LA39_0 == IF || (LA39_0 >= RETURN && LA39_0 <= SWITCH) || LA39_0 == FOR || (LA39_0 >= WHILE && LA39_0 <= VOID) || LA39_0 == IDENT || LA39_0 == LBRACK || LA39_0 == DYNAMIC || (LA39_0 >= IS && LA39_0 <= AS) || (LA39_0 >= PLUS && LA39_0 <= MINUS) || (LA39_0 >= INC && LA39_0 <= XML) || (LA39_0 >= 176 && LA39_0 <= 177)) )
{
alt39 = 1;
}
switch (alt39)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:867:6: statement
{
if ( backtracking == 0 )
{
buffer.Append(NewLine + tab);
}
PushFollow(FOLLOW_statement_in_switchStatementList2661);
statement139 = statement();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_statement.Add(statement139.Tree);
}
break;
default:
goto loop39;
}
} while (true);
loop39:
; // Stops C# compiler whinging that label 'loop39' has no statements
// AST REWRITE
// elements: statement
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 867:51: -> ^( SWITCH_STATEMENT_LIST ( statement )* )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:867:54: ^( SWITCH_STATEMENT_LIST ( statement )* )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(SWITCH_STATEMENT_LIST, "SWITCH_STATEMENT_LIST"), root_1);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:867:78: ( statement )*
while ( stream_statement.HasNext() )
{
adaptor.AddChild(root_1, stream_statement.Next());
}
stream_statement.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 52, switchStatementList_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start typeBlock
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:453:1: typeBlock : LCURLY ( typeBlockEntry )* RCURLY -> ^( TYPE_BLOCK ( typeBlockEntry )* ) ;
public typeBlock_return typeBlock()
{
typeBlock_return retval = new typeBlock_return();
retval.start = input.LT(1);
int typeBlock_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken LCURLY24 = null;
CommonToken RCURLY26 = null;
typeBlockEntry_return typeBlockEntry25 = null;
CommonTree LCURLY24_tree=null;
CommonTree RCURLY26_tree=null;
RewriteRuleTokenStream stream_LCURLY = new RewriteRuleTokenStream(adaptor,"token LCURLY");
RewriteRuleTokenStream stream_RCURLY = new RewriteRuleTokenStream(adaptor,"token RCURLY");
RewriteRuleSubtreeStream stream_typeBlockEntry = new RewriteRuleSubtreeStream(adaptor,"rule typeBlockEntry");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 14) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:454:4: ( LCURLY ( typeBlockEntry )* RCURLY -> ^( TYPE_BLOCK ( typeBlockEntry )* ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:454:4: LCURLY ( typeBlockEntry )* RCURLY
{
LCURLY24 = (CommonToken)input.LT(1);
Match(input,LCURLY,FOLLOW_LCURLY_in_typeBlock973); if (failed) return retval;
if ( backtracking==0 ) stream_LCURLY.Add(LCURLY24);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:455:3: ( typeBlockEntry )*
do
{
int alt10 = 2;
int LA10_0 = input.LA(1);
if ( (LA10_0 == IMPORT || LA10_0 == INCLUDE_DIRECTIVE || LA10_0 == FUNCTION || (LA10_0 >= VAR && LA10_0 <= CONST) || (LA10_0 >= IDENT && LA10_0 <= LBRACK) || (LA10_0 >= STATIC && LA10_0 <= DYNAMIC) || (LA10_0 >= SL_COMMENT && LA10_0 <= ML_COMMENT) || LA10_0 == 175 || (LA10_0 >= 180 && LA10_0 <= 184)) )
{
alt10 = 1;
}
switch (alt10)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:455:4: typeBlockEntry
{
PushFollow(FOLLOW_typeBlockEntry_in_typeBlock978);
typeBlockEntry25 = typeBlockEntry();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_typeBlockEntry.Add(typeBlockEntry25.Tree);
}
break;
default:
goto loop10;
}
} while (true);
loop10:
; // Stops C# compiler whinging that label 'loop10' has no statements
RCURLY26 = (CommonToken)input.LT(1);
Match(input,RCURLY,FOLLOW_RCURLY_in_typeBlock984); if (failed) return retval;
if ( backtracking==0 ) stream_RCURLY.Add(RCURLY26);
// AST REWRITE
// elements: typeBlockEntry
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 457:3: -> ^( TYPE_BLOCK ( typeBlockEntry )* )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:457:6: ^( TYPE_BLOCK ( typeBlockEntry )* )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(TYPE_BLOCK, "TYPE_BLOCK"), root_1);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:457:19: ( typeBlockEntry )*
while ( stream_typeBlockEntry.HasNext() )
{
adaptor.AddChild(root_1, stream_typeBlockEntry.Next());
}
stream_typeBlockEntry.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 14, typeBlock_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start annotationParam
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );
public annotationParam_return annotationParam()
{
annotationParam_return retval = new annotationParam_return();
retval.start = input.LT(1);
int annotationParam_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken ASSIGN191 = null;
CommonToken ASSIGN192 = null;
ident_return ide1 = null;
constant_return cn1 = null;
ident_return ide2 = null;
ident_return ide3 = null;
constant_return cn2 = null;
ident_return ide4 = null;
CommonTree ASSIGN191_tree=null;
CommonTree ASSIGN192_tree=null;
RewriteRuleTokenStream stream_ASSIGN = new RewriteRuleTokenStream(adaptor,"token ASSIGN");
RewriteRuleSubtreeStream stream_constant = new RewriteRuleSubtreeStream(adaptor,"rule constant");
RewriteRuleSubtreeStream stream_ident = new RewriteRuleSubtreeStream(adaptor,"rule ident");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 73) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1090:3: (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident )
int alt54 = 4;
switch ( input.LA(1) )
{
case IDENT:
{
int LA54_1 = input.LA(2);
if ( (LA54_1 == EOF || LA54_1 == COMMA || LA54_1 == RPAREN) )
{
alt54 = 4;
}
else if ( (LA54_1 == ASSIGN) )
{
int LA54_17 = input.LA(3);
if ( (synpred83()) )
{
alt54 = 1;
}
else if ( (synpred84()) )
{
alt54 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s17 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 17, input);
throw nvae_d54s17;
}
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s1 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 1, input);
throw nvae_d54s1;
}
}
break;
case USE:
{
int LA54_2 = input.LA(2);
if ( (LA54_2 == ASSIGN) )
{
int LA54_18 = input.LA(3);
if ( (synpred83()) )
{
alt54 = 1;
}
else if ( (synpred84()) )
{
alt54 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s18 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 18, input);
throw nvae_d54s18;
}
}
else if ( (LA54_2 == EOF || LA54_2 == COMMA || LA54_2 == RPAREN) )
{
alt54 = 4;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s2 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 2, input);
throw nvae_d54s2;
}
}
break;
case XML:
{
int LA54_3 = input.LA(2);
if ( (LA54_3 == ASSIGN) )
{
int LA54_22 = input.LA(3);
if ( (synpred83()) )
{
alt54 = 1;
}
else if ( (synpred84()) )
{
alt54 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s22 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 22, input);
throw nvae_d54s22;
}
}
else if ( (LA54_3 == EOF || LA54_3 == COMMA || LA54_3 == RPAREN) )
{
alt54 = 4;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s3 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 3, input);
throw nvae_d54s3;
}
}
break;
case DYNAMIC:
{
int LA54_4 = input.LA(2);
if ( (LA54_4 == EOF || LA54_4 == COMMA || LA54_4 == RPAREN) )
{
alt54 = 4;
}
else if ( (LA54_4 == ASSIGN) )
{
int LA54_29 = input.LA(3);
if ( (synpred83()) )
{
alt54 = 1;
}
else if ( (synpred84()) )
{
alt54 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s29 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 29, input);
throw nvae_d54s29;
}
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s4 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 4, input);
throw nvae_d54s4;
}
}
break;
case IS:
{
int LA54_5 = input.LA(2);
if ( (LA54_5 == ASSIGN) )
{
int LA54_30 = input.LA(3);
if ( (synpred83()) )
{
alt54 = 1;
}
else if ( (synpred84()) )
{
alt54 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s30 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 30, input);
throw nvae_d54s30;
}
}
else if ( (LA54_5 == EOF || LA54_5 == COMMA || LA54_5 == RPAREN) )
{
alt54 = 4;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s5 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 5, input);
throw nvae_d54s5;
}
}
break;
case AS:
{
int LA54_6 = input.LA(2);
if ( (LA54_6 == EOF || LA54_6 == COMMA || LA54_6 == RPAREN) )
{
alt54 = 4;
}
else if ( (LA54_6 == ASSIGN) )
{
int LA54_37 = input.LA(3);
if ( (synpred83()) )
{
alt54 = 1;
}
else if ( (synpred84()) )
{
alt54 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s37 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 37, input);
throw nvae_d54s37;
}
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s6 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 6, input);
throw nvae_d54s6;
}
}
break;
case GET:
{
int LA54_7 = input.LA(2);
if ( (LA54_7 == EOF || LA54_7 == COMMA || LA54_7 == RPAREN) )
{
alt54 = 4;
}
else if ( (LA54_7 == ASSIGN) )
{
int LA54_41 = input.LA(3);
if ( (synpred83()) )
{
alt54 = 1;
}
else if ( (synpred84()) )
{
alt54 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s41 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 41, input);
throw nvae_d54s41;
}
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s7 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 7, input);
throw nvae_d54s7;
}
}
break;
case SET:
{
int LA54_8 = input.LA(2);
if ( (LA54_8 == ASSIGN) )
{
int LA54_42 = input.LA(3);
if ( (synpred83()) )
{
alt54 = 1;
}
else if ( (synpred84()) )
{
alt54 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s42 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 42, input);
throw nvae_d54s42;
}
}
else if ( (LA54_8 == EOF || LA54_8 == COMMA || LA54_8 == RPAREN) )
{
alt54 = 4;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s8 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 8, input);
throw nvae_d54s8;
}
}
break;
case STRING_LITERAL:
case TRUE:
case FALSE:
case NULL:
case HEX_LITERAL:
case DECIMAL_LITERAL:
case OCTAL_LITERAL:
case FLOAT_LITERAL:
{
alt54 = 3;
}
break;
default:
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d54s0 =
new NoViableAltException("1088:1: annotationParam : (ide1= ident ASSIGN cn1= constant -> ^( ASSIGN ident constant ) | ide2= ident ASSIGN ide3= ident -> ^( ASSIGN ident ident ) | cn2= constant -> constant | ide4= ident -> ident );", 54, 0, input);
throw nvae_d54s0;
}
switch (alt54)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1090:3: ide1= ident ASSIGN cn1= constant
{
PushFollow(FOLLOW_ident_in_annotationParam3607);
ide1 = ident();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_ident.Add(ide1.Tree);
ASSIGN191 = (CommonToken)input.LT(1);
Match(input,ASSIGN,FOLLOW_ASSIGN_in_annotationParam3609); if (failed) return retval;
if ( backtracking==0 ) stream_ASSIGN.Add(ASSIGN191);
PushFollow(FOLLOW_constant_in_annotationParam3613);
cn1 = constant();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_constant.Add(cn1.Tree);
if ( backtracking == 0 )
{
buffer.Append(((CommonTree)ide1.Tree).Text + "=" + ((CommonTree)cn1.Tree).Text);
}
// AST REWRITE
// elements: ASSIGN, ident, constant
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1090:119: -> ^( ASSIGN ident constant )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1090:122: ^( ASSIGN ident constant )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(stream_ASSIGN.Next(), root_1);
adaptor.AddChild(root_1, stream_ident.Next());
adaptor.AddChild(root_1, stream_constant.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 2 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1091:4: ide2= ident ASSIGN ide3= ident
{
PushFollow(FOLLOW_ident_in_annotationParam3632);
ide2 = ident();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_ident.Add(ide2.Tree);
ASSIGN192 = (CommonToken)input.LT(1);
Match(input,ASSIGN,FOLLOW_ASSIGN_in_annotationParam3634); if (failed) return retval;
if ( backtracking==0 ) stream_ASSIGN.Add(ASSIGN192);
PushFollow(FOLLOW_ident_in_annotationParam3638);
ide3 = ident();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_ident.Add(ide3.Tree);
if ( backtracking == 0 )
{
buffer.Append(((CommonTree)ide2.Tree).Text + "=" + ((CommonTree)ide3.Tree).Text);
}
// AST REWRITE
// elements: ASSIGN, ident, ident
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1091:119: -> ^( ASSIGN ident ident )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1091:122: ^( ASSIGN ident ident )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(stream_ASSIGN.Next(), root_1);
adaptor.AddChild(root_1, stream_ident.Next());
adaptor.AddChild(root_1, stream_ident.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 3 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1092:4: cn2= constant
{
PushFollow(FOLLOW_constant_in_annotationParam3657);
cn2 = constant();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_constant.Add(cn2.Tree);
if ( backtracking == 0 )
{
buffer.Append(((CommonTree)cn2.Tree).Text);
}
// AST REWRITE
// elements: constant
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1092:65: -> constant
{
adaptor.AddChild(root_0, stream_constant.Next());
}
}
}
break;
case 4 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1093:4: ide4= ident
{
PushFollow(FOLLOW_ident_in_annotationParam3670);
ide4 = ident();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_ident.Add(ide4.Tree);
if ( backtracking == 0 )
{
buffer.Append(((CommonTree)ide4.Tree).Text);
}
// AST REWRITE
// elements: ident
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1093:65: -> ident
{
adaptor.AddChild(root_0, stream_ident.Next());
}
}
}
break;
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 73, annotationParam_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start switchBlock
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:830:1: switchBlock : LCURLY ( caseStatement )* ( defaultStatement )? RCURLY -> ^( BLOCK ( caseStatement )* ( defaultStatement )? ) ;
public switchBlock_return switchBlock()
{
switchBlock_return retval = new switchBlock_return();
retval.start = input.LT(1);
int switchBlock_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken LCURLY130 = null;
CommonToken RCURLY133 = null;
caseStatement_return caseStatement131 = null;
defaultStatement_return defaultStatement132 = null;
CommonTree LCURLY130_tree=null;
CommonTree RCURLY133_tree=null;
RewriteRuleTokenStream stream_LCURLY = new RewriteRuleTokenStream(adaptor,"token LCURLY");
RewriteRuleTokenStream stream_RCURLY = new RewriteRuleTokenStream(adaptor,"token RCURLY");
RewriteRuleSubtreeStream stream_caseStatement = new RewriteRuleSubtreeStream(adaptor,"rule caseStatement");
RewriteRuleSubtreeStream stream_defaultStatement = new RewriteRuleSubtreeStream(adaptor,"rule defaultStatement");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 49) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:831:4: ( LCURLY ( caseStatement )* ( defaultStatement )? RCURLY -> ^( BLOCK ( caseStatement )* ( defaultStatement )? ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:831:4: LCURLY ( caseStatement )* ( defaultStatement )? RCURLY
{
LCURLY130 = (CommonToken)input.LT(1);
Match(input,LCURLY,FOLLOW_LCURLY_in_switchBlock2512); if (failed) return retval;
if ( backtracking==0 ) stream_LCURLY.Add(LCURLY130);
if ( backtracking == 0 )
{
buffer.Append((options.NewlineAfterCondition ? NewLine + tab : "") + "{");
CurrentTab++;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:835:3: ( caseStatement )*
do
{
int alt37 = 2;
int LA37_0 = input.LA(1);
if ( (LA37_0 == CASE) )
{
alt37 = 1;
}
switch (alt37)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:835:5: caseStatement
{
if ( backtracking == 0 )
{
buffer.Append(NewLine + tab);
}
PushFollow(FOLLOW_caseStatement_in_switchBlock2529);
caseStatement131 = caseStatement();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_caseStatement.Add(caseStatement131.Tree);
}
break;
default:
goto loop37;
}
} while (true);
loop37:
; // Stops C# compiler whinging that label 'loop37' has no statements
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:836:3: ( defaultStatement )?
int alt38 = 2;
int LA38_0 = input.LA(1);
if ( (LA38_0 == DEFAULT) )
{
alt38 = 1;
}
switch (alt38)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:836:5: defaultStatement
{
if ( backtracking == 0 )
{
buffer.Append(NewLine + tab);
}
PushFollow(FOLLOW_defaultStatement_in_switchBlock2539);
defaultStatement132 = defaultStatement();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_defaultStatement.Add(defaultStatement132.Tree);
}
break;
}
RCURLY133 = (CommonToken)input.LT(1);
Match(input,RCURLY,FOLLOW_RCURLY_in_switchBlock2545); if (failed) return retval;
if ( backtracking==0 ) stream_RCURLY.Add(RCURLY133);
if ( backtracking == 0 )
{
CurrentTab--;
buffer.Append(NewLine + tab);
buffer.Append("}");
}
// AST REWRITE
// elements: defaultStatement, caseStatement
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 842:3: -> ^( BLOCK ( caseStatement )* ( defaultStatement )? )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:842:6: ^( BLOCK ( caseStatement )* ( defaultStatement )? )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(BLOCK, "BLOCK"), root_1);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:842:14: ( caseStatement )*
while ( stream_caseStatement.HasNext() )
{
adaptor.AddChild(root_1, stream_caseStatement.Next());
}
stream_caseStatement.Reset();
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:842:29: ( defaultStatement )?
if ( stream_defaultStatement.HasNext() )
{
adaptor.AddChild(root_1, stream_defaultStatement.Next());
}
stream_defaultStatement.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 49, switchBlock_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start annotation
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1067:1: annotation : LBRACK ide= ident ( annotationParamList )? RBRACK -> ^( ANNOTATION ident ( annotationParamList )? ) ;
public annotation_return annotation()
{
annotation_return retval = new annotation_return();
retval.start = input.LT(1);
int annotation_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken LBRACK183 = null;
CommonToken RBRACK185 = null;
ident_return ide = null;
annotationParamList_return annotationParamList184 = null;
CommonTree LBRACK183_tree=null;
CommonTree RBRACK185_tree=null;
RewriteRuleTokenStream stream_LBRACK = new RewriteRuleTokenStream(adaptor,"token LBRACK");
RewriteRuleTokenStream stream_RBRACK = new RewriteRuleTokenStream(adaptor,"token RBRACK");
RewriteRuleSubtreeStream stream_annotationParamList = new RewriteRuleSubtreeStream(adaptor,"rule annotationParamList");
RewriteRuleSubtreeStream stream_ident = new RewriteRuleSubtreeStream(adaptor,"rule ident");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 71) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1068:4: ( LBRACK ide= ident ( annotationParamList )? RBRACK -> ^( ANNOTATION ident ( annotationParamList )? ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1068:4: LBRACK ide= ident ( annotationParamList )? RBRACK
{
LBRACK183 = (CommonToken)input.LT(1);
Match(input,LBRACK,FOLLOW_LBRACK_in_annotation3466); if (failed) return retval;
if ( backtracking==0 ) stream_LBRACK.Add(LBRACK183);
if ( backtracking == 0 )
{
buffer.Append("[");
}
PushFollow(FOLLOW_ident_in_annotation3478);
ide = ident();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_ident.Add(ide.Tree);
if ( backtracking == 0 )
{
buffer.Append(((CommonTree)ide.Tree).Text);
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1070:3: ( annotationParamList )?
int alt51 = 2;
int LA51_0 = input.LA(1);
if ( (LA51_0 == LPAREN) )
{
alt51 = 1;
}
switch (alt51)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:0:0: annotationParamList
{
PushFollow(FOLLOW_annotationParamList_in_annotation3487);
annotationParamList184 = annotationParamList();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_annotationParamList.Add(annotationParamList184.Tree);
}
break;
}
RBRACK185 = (CommonToken)input.LT(1);
Match(input,RBRACK,FOLLOW_RBRACK_in_annotation3492); if (failed) return retval;
if ( backtracking==0 ) stream_RBRACK.Add(RBRACK185);
if ( backtracking == 0 )
{
buffer.Append("]");
}
// AST REWRITE
// elements: ident, annotationParamList
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1072:3: -> ^( ANNOTATION ident ( annotationParamList )? )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1072:6: ^( ANNOTATION ident ( annotationParamList )? )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(ANNOTATION, "ANNOTATION"), root_1);
adaptor.AddChild(root_1, stream_ident.Next());
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1072:25: ( annotationParamList )?
if ( stream_annotationParamList.HasNext() )
{
adaptor.AddChild(root_1, stream_annotationParamList.Next());
}
stream_annotationParamList.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 71, annotation_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start basicParameterDeclaration
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:635:1: basicParameterDeclaration : ( CONST )? ide= ident (type_exp= typeExpression )? ( parameterDefault )? -> ^( PARAM ( CONST )? ident ( typeExpression )? ( parameterDefault )? ) ;
public basicParameterDeclaration_return basicParameterDeclaration()
{
basicParameterDeclaration_return retval = new basicParameterDeclaration_return();
retval.start = input.LT(1);
int basicParameterDeclaration_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken CONST68 = null;
ident_return ide = null;
typeExpression_return type_exp = null;
parameterDefault_return parameterDefault69 = null;
CommonTree CONST68_tree=null;
RewriteRuleTokenStream stream_CONST = new RewriteRuleTokenStream(adaptor,"token CONST");
RewriteRuleSubtreeStream stream_parameterDefault = new RewriteRuleSubtreeStream(adaptor,"rule parameterDefault");
RewriteRuleSubtreeStream stream_ident = new RewriteRuleSubtreeStream(adaptor,"rule ident");
RewriteRuleSubtreeStream stream_typeExpression = new RewriteRuleSubtreeStream(adaptor,"rule typeExpression");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 31) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:636:4: ( ( CONST )? ide= ident (type_exp= typeExpression )? ( parameterDefault )? -> ^( PARAM ( CONST )? ident ( typeExpression )? ( parameterDefault )? ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:636:4: ( CONST )? ide= ident (type_exp= typeExpression )? ( parameterDefault )?
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:636:4: ( CONST )?
int alt25 = 2;
int LA25_0 = input.LA(1);
if ( (LA25_0 == CONST) )
{
alt25 = 1;
}
switch (alt25)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:0:0: CONST
{
CONST68 = (CommonToken)input.LT(1);
Match(input,CONST,FOLLOW_CONST_in_basicParameterDeclaration1807); if (failed) return retval;
if ( backtracking==0 ) stream_CONST.Add(CONST68);
}
break;
}
PushFollow(FOLLOW_ident_in_basicParameterDeclaration1815);
ide = ident();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_ident.Add(ide.Tree);
if ( backtracking == 0 )
{
buffer.Append(((CommonTree)ide.Tree).Text);
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:638:11: (type_exp= typeExpression )?
int alt26 = 2;
int LA26_0 = input.LA(1);
if ( (LA26_0 == COLON) )
{
alt26 = 1;
}
switch (alt26)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:0:0: type_exp= typeExpression
{
PushFollow(FOLLOW_typeExpression_in_basicParameterDeclaration1827);
type_exp = typeExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_typeExpression.Add(type_exp.Tree);
}
break;
}
if ( backtracking == 0 )
{
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:639:3: ( parameterDefault )?
int alt27 = 2;
int LA27_0 = input.LA(1);
if ( (LA27_0 == ASSIGN) )
{
alt27 = 1;
}
switch (alt27)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:0:0: parameterDefault
{
PushFollow(FOLLOW_parameterDefault_in_basicParameterDeclaration1834);
parameterDefault69 = parameterDefault();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_parameterDefault.Add(parameterDefault69.Tree);
}
break;
}
// AST REWRITE
// elements: ident, CONST, parameterDefault, typeExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 640:3: -> ^( PARAM ( CONST )? ident ( typeExpression )? ( parameterDefault )? )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:640:6: ^( PARAM ( CONST )? ident ( typeExpression )? ( parameterDefault )? )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(PARAM, "PARAM"), root_1);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:640:14: ( CONST )?
if ( stream_CONST.HasNext() )
{
adaptor.AddChild(root_1, stream_CONST.Next());
}
stream_CONST.Reset();
adaptor.AddChild(root_1, stream_ident.Next());
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:640:27: ( typeExpression )?
if ( stream_typeExpression.HasNext() )
{
adaptor.AddChild(root_1, stream_typeExpression.Next());
}
stream_typeExpression.Reset();
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:640:43: ( parameterDefault )?
if ( stream_parameterDefault.HasNext() )
{
adaptor.AddChild(root_1, stream_parameterDefault.Next());
}
stream_parameterDefault.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 31, basicParameterDeclaration_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start unaryExpressionNotPlusMinus
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1428:1: unaryExpressionNotPlusMinus : (tk1= DELETE postfixExpression -> ^( DELETE postfixExpression ) | tk2= VOID unaryExpression -> ^( VOID unaryExpression ) | tk3= TYPEOF unaryExpression -> ^( TYPEOF unaryExpression ) | tk4= LNOT unaryExpression -> ^( LNOT unaryExpression ) | tk5= BNOT unaryExpression -> ^( BNOT unaryExpression ) | postfixExpression );
public unaryExpressionNotPlusMinus_return unaryExpressionNotPlusMinus()
{
unaryExpressionNotPlusMinus_return retval = new unaryExpressionNotPlusMinus_return();
retval.start = input.LT(1);
int unaryExpressionNotPlusMinus_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken tk1 = null;
CommonToken tk2 = null;
CommonToken tk3 = null;
CommonToken tk4 = null;
CommonToken tk5 = null;
postfixExpression_return postfixExpression279 = null;
unaryExpression_return unaryExpression280 = null;
unaryExpression_return unaryExpression281 = null;
unaryExpression_return unaryExpression282 = null;
unaryExpression_return unaryExpression283 = null;
postfixExpression_return postfixExpression284 = null;
CommonTree tk1_tree=null;
CommonTree tk2_tree=null;
CommonTree tk3_tree=null;
CommonTree tk4_tree=null;
CommonTree tk5_tree=null;
RewriteRuleTokenStream stream_BNOT = new RewriteRuleTokenStream(adaptor,"token BNOT");
RewriteRuleTokenStream stream_LNOT = new RewriteRuleTokenStream(adaptor,"token LNOT");
RewriteRuleTokenStream stream_TYPEOF = new RewriteRuleTokenStream(adaptor,"token TYPEOF");
RewriteRuleTokenStream stream_DELETE = new RewriteRuleTokenStream(adaptor,"token DELETE");
RewriteRuleTokenStream stream_VOID = new RewriteRuleTokenStream(adaptor,"token VOID");
RewriteRuleSubtreeStream stream_unaryExpression = new RewriteRuleSubtreeStream(adaptor,"rule unaryExpression");
RewriteRuleSubtreeStream stream_postfixExpression = new RewriteRuleSubtreeStream(adaptor,"rule postfixExpression");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 109) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1429:4: (tk1= DELETE postfixExpression -> ^( DELETE postfixExpression ) | tk2= VOID unaryExpression -> ^( VOID unaryExpression ) | tk3= TYPEOF unaryExpression -> ^( TYPEOF unaryExpression ) | tk4= LNOT unaryExpression -> ^( LNOT unaryExpression ) | tk5= BNOT unaryExpression -> ^( BNOT unaryExpression ) | postfixExpression )
int alt81 = 6;
switch ( input.LA(1) )
{
case DELETE:
{
alt81 = 1;
}
break;
case VOID:
{
alt81 = 2;
}
break;
case TYPEOF:
{
alt81 = 3;
}
break;
case LNOT:
{
alt81 = 4;
}
break;
case BNOT:
{
alt81 = 5;
}
break;
case LCURLY:
case STRING_LITERAL:
case FUNCTION:
case GET:
case SET:
case LPAREN:
case IDENT:
case LBRACK:
case DYNAMIC:
case IS:
case AS:
case UNDEFINED:
case TRUE:
case FALSE:
case NULL:
case HEX_LITERAL:
case DECIMAL_LITERAL:
case OCTAL_LITERAL:
case FLOAT_LITERAL:
case NEW:
case USE:
case XML:
{
alt81 = 6;
}
break;
default:
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d81s0 =
new NoViableAltException("1428:1: unaryExpressionNotPlusMinus : (tk1= DELETE postfixExpression -> ^( DELETE postfixExpression ) | tk2= VOID unaryExpression -> ^( VOID unaryExpression ) | tk3= TYPEOF unaryExpression -> ^( TYPEOF unaryExpression ) | tk4= LNOT unaryExpression -> ^( LNOT unaryExpression ) | tk5= BNOT unaryExpression -> ^( BNOT unaryExpression ) | postfixExpression );", 81, 0, input);
throw nvae_d81s0;
}
switch (alt81)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1429:4: tk1= DELETE postfixExpression
{
tk1 = (CommonToken)input.LT(1);
Match(input,DELETE,FOLLOW_DELETE_in_unaryExpressionNotPlusMinus4979); if (failed) return retval;
if ( backtracking==0 ) stream_DELETE.Add(tk1);
if ( backtracking == 0 )
{
buffer.Append(tk1.Text + " ");
}
PushFollow(FOLLOW_postfixExpression_in_unaryExpressionNotPlusMinus4984);
postfixExpression279 = postfixExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_postfixExpression.Add(postfixExpression279.Tree);
// AST REWRITE
// elements: DELETE, postfixExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1429:70: -> ^( DELETE postfixExpression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1429:73: ^( DELETE postfixExpression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(stream_DELETE.Next(), root_1);
adaptor.AddChild(root_1, stream_postfixExpression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 2 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1430:4: tk2= VOID unaryExpression
{
tk2 = (CommonToken)input.LT(1);
Match(input,VOID,FOLLOW_VOID_in_unaryExpressionNotPlusMinus4999); if (failed) return retval;
if ( backtracking==0 ) stream_VOID.Add(tk2);
if ( backtracking == 0 )
{
buffer.Append(tk2.Text + " ");
}
PushFollow(FOLLOW_unaryExpression_in_unaryExpressionNotPlusMinus5003);
unaryExpression280 = unaryExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_unaryExpression.Add(unaryExpression280.Tree);
// AST REWRITE
// elements: VOID, unaryExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1430:65: -> ^( VOID unaryExpression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1430:68: ^( VOID unaryExpression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(stream_VOID.Next(), root_1);
adaptor.AddChild(root_1, stream_unaryExpression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 3 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1431:4: tk3= TYPEOF unaryExpression
{
tk3 = (CommonToken)input.LT(1);
Match(input,TYPEOF,FOLLOW_TYPEOF_in_unaryExpressionNotPlusMinus5018); if (failed) return retval;
if ( backtracking==0 ) stream_TYPEOF.Add(tk3);
if ( backtracking == 0 )
{
buffer.Append(tk3.Text + " ");
}
PushFollow(FOLLOW_unaryExpression_in_unaryExpressionNotPlusMinus5022);
unaryExpression281 = unaryExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_unaryExpression.Add(unaryExpression281.Tree);
// AST REWRITE
// elements: TYPEOF, unaryExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1431:67: -> ^( TYPEOF unaryExpression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1431:70: ^( TYPEOF unaryExpression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(stream_TYPEOF.Next(), root_1);
adaptor.AddChild(root_1, stream_unaryExpression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 4 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1432:4: tk4= LNOT unaryExpression
{
tk4 = (CommonToken)input.LT(1);
Match(input,LNOT,FOLLOW_LNOT_in_unaryExpressionNotPlusMinus5037); if (failed) return retval;
if ( backtracking==0 ) stream_LNOT.Add(tk4);
if ( backtracking == 0 )
{
buffer.Append(tk4.Text + " ");
}
PushFollow(FOLLOW_unaryExpression_in_unaryExpressionNotPlusMinus5041);
unaryExpression282 = unaryExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_unaryExpression.Add(unaryExpression282.Tree);
// AST REWRITE
// elements: unaryExpression, LNOT
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1432:65: -> ^( LNOT unaryExpression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1432:68: ^( LNOT unaryExpression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(stream_LNOT.Next(), root_1);
adaptor.AddChild(root_1, stream_unaryExpression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 5 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1433:4: tk5= BNOT unaryExpression
{
tk5 = (CommonToken)input.LT(1);
Match(input,BNOT,FOLLOW_BNOT_in_unaryExpressionNotPlusMinus5056); if (failed) return retval;
if ( backtracking==0 ) stream_BNOT.Add(tk5);
if ( backtracking == 0 )
{
buffer.Append(tk5.Text + " ");
}
PushFollow(FOLLOW_unaryExpression_in_unaryExpressionNotPlusMinus5060);
unaryExpression283 = unaryExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_unaryExpression.Add(unaryExpression283.Tree);
// AST REWRITE
// elements: BNOT, unaryExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1433:65: -> ^( BNOT unaryExpression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1433:68: ^( BNOT unaryExpression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(stream_BNOT.Next(), root_1);
adaptor.AddChild(root_1, stream_unaryExpression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 6 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1434:4: postfixExpression
{
root_0 = (CommonTree)adaptor.GetNilNode();
PushFollow(FOLLOW_postfixExpression_in_unaryExpressionNotPlusMinus5073);
postfixExpression284 = postfixExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) adaptor.AddChild(root_0, postfixExpression284.Tree);
}
break;
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 109, unaryExpressionNotPlusMinus_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start block
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:652:1: block : LCURLY ( blockEntry )* RCURLY -> ^( BLOCK ( blockEntry )* ) ;
public block_return block()
{
block_return retval = new block_return();
retval.start = input.LT(1);
int block_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken LCURLY72 = null;
CommonToken RCURLY74 = null;
blockEntry_return blockEntry73 = null;
CommonTree LCURLY72_tree=null;
CommonTree RCURLY74_tree=null;
RewriteRuleTokenStream stream_LCURLY = new RewriteRuleTokenStream(adaptor,"token LCURLY");
RewriteRuleTokenStream stream_RCURLY = new RewriteRuleTokenStream(adaptor,"token RCURLY");
RewriteRuleSubtreeStream stream_blockEntry = new RewriteRuleSubtreeStream(adaptor,"rule blockEntry");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 33) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:653:4: ( LCURLY ( blockEntry )* RCURLY -> ^( BLOCK ( blockEntry )* ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:653:4: LCURLY ( blockEntry )* RCURLY
{
LCURLY72 = (CommonToken)input.LT(1);
Match(input,LCURLY,FOLLOW_LCURLY_in_block1892); if (failed) return retval;
if ( backtracking==0 ) stream_LCURLY.Add(LCURLY72);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:654:3: ( blockEntry )*
do
{
int alt28 = 2;
int LA28_0 = input.LA(1);
if ( (LA28_0 == SEMI || LA28_0 == LCURLY || (LA28_0 >= STRING_LITERAL && LA28_0 <= CONST) || LA28_0 == LPAREN || LA28_0 == IF || (LA28_0 >= RETURN && LA28_0 <= SWITCH) || LA28_0 == FOR || (LA28_0 >= WHILE && LA28_0 <= VOID) || LA28_0 == IDENT || LA28_0 == LBRACK || LA28_0 == DYNAMIC || (LA28_0 >= IS && LA28_0 <= AS) || (LA28_0 >= PLUS && LA28_0 <= MINUS) || (LA28_0 >= INC && LA28_0 <= XML) || (LA28_0 >= 176 && LA28_0 <= 177)) )
{
alt28 = 1;
}
switch (alt28)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:0:0: blockEntry
{
PushFollow(FOLLOW_blockEntry_in_block1896);
blockEntry73 = blockEntry();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_blockEntry.Add(blockEntry73.Tree);
}
break;
default:
goto loop28;
}
} while (true);
loop28:
; // Stops C# compiler whinging that label 'loop28' has no statements
RCURLY74 = (CommonToken)input.LT(1);
Match(input,RCURLY,FOLLOW_RCURLY_in_block1902); if (failed) return retval;
if ( backtracking==0 ) stream_RCURLY.Add(RCURLY74);
// AST REWRITE
// elements: blockEntry
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 656:3: -> ^( BLOCK ( blockEntry )* )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:656:6: ^( BLOCK ( blockEntry )* )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(BLOCK, "BLOCK"), root_1);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:656:14: ( blockEntry )*
while ( stream_blockEntry.HasNext() )
{
adaptor.AddChild(root_1, stream_blockEntry.Next());
}
stream_blockEntry.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 33, block_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start variableDefinition
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:556:1: variableDefinition[CommonTree mods] : decl= varOrConst variableDeclarator ( COMMA variableDeclarator )* semi -> ^( VAR_DEF $decl ( variableDeclarator )+ ) ;
public variableDefinition_return variableDefinition(CommonTree mods)
{
InOperator_stack.Push(new InOperator_scope());
variableDefinition_return retval = new variableDefinition_return();
retval.start = input.LT(1);
int variableDefinition_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken COMMA51 = null;
varOrConst_return decl = null;
variableDeclarator_return variableDeclarator50 = null;
variableDeclarator_return variableDeclarator52 = null;
semi_return semi53 = null;
CommonTree COMMA51_tree=null;
RewriteRuleTokenStream stream_COMMA = new RewriteRuleTokenStream(adaptor,"token COMMA");
RewriteRuleSubtreeStream stream_semi = new RewriteRuleSubtreeStream(adaptor,"rule semi");
RewriteRuleSubtreeStream stream_varOrConst = new RewriteRuleSubtreeStream(adaptor,"rule varOrConst");
RewriteRuleSubtreeStream stream_variableDeclarator = new RewriteRuleSubtreeStream(adaptor,"rule variableDeclarator");
((InOperator_scope)InOperator_stack.Peek()).allowed = true;
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 23) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:561:4: (decl= varOrConst variableDeclarator ( COMMA variableDeclarator )* semi -> ^( VAR_DEF $decl ( variableDeclarator )+ ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:561:4: decl= varOrConst variableDeclarator ( COMMA variableDeclarator )* semi
{
if ( backtracking == 0 )
{
if(mods.ChildCount > 0) buffer.Append(fromModifiers(mods) + " ");
}
PushFollow(FOLLOW_varOrConst_in_variableDefinition1509);
decl = varOrConst();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_varOrConst.Add(decl.Tree);
if ( backtracking == 0 )
{
buffer.Append(((CommonTree)decl.Tree).Text + " ");
}
PushFollow(FOLLOW_variableDeclarator_in_variableDefinition1518);
variableDeclarator50 = variableDeclarator();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_variableDeclarator.Add(variableDeclarator50.Tree);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:566:3: ( COMMA variableDeclarator )*
do
{
int alt19 = 2;
int LA19_0 = input.LA(1);
if ( (LA19_0 == COMMA) )
{
alt19 = 1;
}
switch (alt19)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:567:10: COMMA variableDeclarator
{
if ( backtracking == 0 )
{
buffer.Append(";");
}
COMMA51 = (CommonToken)input.LT(1);
Match(input,COMMA,FOLLOW_COMMA_in_variableDefinition1538); if (failed) return retval;
if ( backtracking==0 ) stream_COMMA.Add(COMMA51);
if ( backtracking == 0 )
{
buffer.Append(NewLine + tab);
if(mods.ChildCount > 0) buffer.Append(fromModifiers(mods) + " ");
buffer.Append(((CommonTree)decl.Tree).Text + " ");
}
PushFollow(FOLLOW_variableDeclarator_in_variableDefinition1549);
variableDeclarator52 = variableDeclarator();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_variableDeclarator.Add(variableDeclarator52.Tree);
}
break;
default:
goto loop19;
}
} while (true);
loop19:
; // Stops C# compiler whinging that label 'loop19' has no statements
PushFollow(FOLLOW_semi_in_variableDefinition1558);
semi53 = semi();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_semi.Add(semi53.Tree);
// AST REWRITE
// elements: variableDeclarator, decl
// token labels:
// rule labels: decl, retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_decl = new RewriteRuleSubtreeStream(adaptor, "token decl", (decl!=null ? decl.Tree : null));
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 576:3: -> ^( VAR_DEF $decl ( variableDeclarator )+ )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:576:6: ^( VAR_DEF $decl ( variableDeclarator )+ )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(VAR_DEF, "VAR_DEF"), root_1);
adaptor.AddChild(root_1, mods);
adaptor.AddChild(root_1, stream_decl.Next());
if ( !(stream_variableDeclarator.HasNext()) ) {
throw new RewriteEarlyExitException();
}
while ( stream_variableDeclarator.HasNext() )
{
adaptor.AddChild(root_1, stream_variableDeclarator.Next());
}
stream_variableDeclarator.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 23, variableDefinition_StartIndex);
}
InOperator_stack.Pop();
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start comments
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1501:1: comments : ( comment )+ -> ^( COMMENT_LIST ( comment )+ ) ;
public comments_return comments()
{
comments_return retval = new comments_return();
retval.start = input.LT(1);
int comments_StartIndex = input.Index();
CommonTree root_0 = null;
comment_return comment309 = null;
RewriteRuleSubtreeStream stream_comment = new RewriteRuleSubtreeStream(adaptor,"rule comment");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 117) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1509:4: ( ( comment )+ -> ^( COMMENT_LIST ( comment )+ ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1509:4: ( comment )+
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1509:4: ( comment )+
int cnt87 = 0;
do
{
int alt87 = 2;
int LA87_0 = input.LA(1);
if ( (LA87_0 == SL_COMMENT) )
{
int LA87_15 = input.LA(2);
if ( (synpred176()) )
{
alt87 = 1;
}
}
else if ( (LA87_0 == ML_COMMENT) )
{
int LA87_16 = input.LA(2);
if ( (synpred176()) )
{
alt87 = 1;
}
}
switch (alt87)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:0:0: comment
{
PushFollow(FOLLOW_comment_in_comments5502);
comment309 = comment();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_comment.Add(comment309.Tree);
}
break;
default:
if ( cnt87 >= 1 ) goto loop87;
if ( backtracking > 0 ) {failed = true; return retval;}
EarlyExitException eee =
new EarlyExitException(87, input);
throw eee;
}
cnt87++;
} while (true);
loop87:
; // Stops C# compiler whinging that label 'loop87' has no statements
// AST REWRITE
// elements: comment
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1509:13: -> ^( COMMENT_LIST ( comment )+ )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1509:16: ^( COMMENT_LIST ( comment )+ )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(COMMENT_LIST, "COMMENT_LIST"), root_1);
if ( !(stream_comment.HasNext()) ) {
throw new RewriteEarlyExitException();
}
while ( stream_comment.HasNext() )
{
adaptor.AddChild(root_1, stream_comment.Next());
}
stream_comment.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 117, comments_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start annotationParamList
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1075:1: annotationParamList : LPAREN ( annotationParam ( COMMA annotationParam )* )? RPAREN -> ^( ANNOTATION_PARAMS ( annotationParam )* ) ;
public annotationParamList_return annotationParamList()
{
annotationParamList_return retval = new annotationParamList_return();
retval.start = input.LT(1);
int annotationParamList_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken LPAREN186 = null;
CommonToken COMMA188 = null;
CommonToken RPAREN190 = null;
annotationParam_return annotationParam187 = null;
annotationParam_return annotationParam189 = null;
CommonTree LPAREN186_tree=null;
CommonTree COMMA188_tree=null;
CommonTree RPAREN190_tree=null;
RewriteRuleTokenStream stream_COMMA = new RewriteRuleTokenStream(adaptor,"token COMMA");
RewriteRuleTokenStream stream_RPAREN = new RewriteRuleTokenStream(adaptor,"token RPAREN");
RewriteRuleTokenStream stream_LPAREN = new RewriteRuleTokenStream(adaptor,"token LPAREN");
RewriteRuleSubtreeStream stream_annotationParam = new RewriteRuleSubtreeStream(adaptor,"rule annotationParam");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 72) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1077:3: ( LPAREN ( annotationParam ( COMMA annotationParam )* )? RPAREN -> ^( ANNOTATION_PARAMS ( annotationParam )* ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1077:3: LPAREN ( annotationParam ( COMMA annotationParam )* )? RPAREN
{
LPAREN186 = (CommonToken)input.LT(1);
Match(input,LPAREN,FOLLOW_LPAREN_in_annotationParamList3524); if (failed) return retval;
if ( backtracking==0 ) stream_LPAREN.Add(LPAREN186);
if ( backtracking == 0 )
{
buffer.Append("(");
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1078:3: ( annotationParam ( COMMA annotationParam )* )?
int alt53 = 2;
int LA53_0 = input.LA(1);
if ( (LA53_0 == STRING_LITERAL || (LA53_0 >= GET && LA53_0 <= SET) || LA53_0 == IDENT || LA53_0 == DYNAMIC || (LA53_0 >= IS && LA53_0 <= AS) || (LA53_0 >= TRUE && LA53_0 <= FLOAT_LITERAL) || (LA53_0 >= USE && LA53_0 <= XML)) )
{
alt53 = 1;
}
switch (alt53)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1078:5: annotationParam ( COMMA annotationParam )*
{
PushFollow(FOLLOW_annotationParam_in_annotationParamList3537);
annotationParam187 = annotationParam();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_annotationParam.Add(annotationParam187.Tree);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1079:4: ( COMMA annotationParam )*
do
{
int alt52 = 2;
int LA52_0 = input.LA(1);
if ( (LA52_0 == COMMA) )
{
alt52 = 1;
}
switch (alt52)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1080:5: COMMA annotationParam
{
COMMA188 = (CommonToken)input.LT(1);
Match(input,COMMA,FOLLOW_COMMA_in_annotationParamList3548); if (failed) return retval;
if ( backtracking==0 ) stream_COMMA.Add(COMMA188);
if ( backtracking == 0 )
{
buffer.Append(",");
}
PushFollow(FOLLOW_annotationParam_in_annotationParamList3559);
annotationParam189 = annotationParam();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_annotationParam.Add(annotationParam189.Tree);
}
break;
default:
goto loop52;
}
} while (true);
loop52:
; // Stops C# compiler whinging that label 'loop52' has no statements
}
break;
}
RPAREN190 = (CommonToken)input.LT(1);
Match(input,RPAREN,FOLLOW_RPAREN_in_annotationParamList3574); if (failed) return retval;
if ( backtracking==0 ) stream_RPAREN.Add(RPAREN190);
if ( backtracking == 0 )
{
buffer.Append(")");
}
// AST REWRITE
// elements: annotationParam
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1085:3: -> ^( ANNOTATION_PARAMS ( annotationParam )* )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1085:6: ^( ANNOTATION_PARAMS ( annotationParam )* )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(ANNOTATION_PARAMS, "ANNOTATION_PARAMS"), root_1);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1085:26: ( annotationParam )*
while ( stream_annotationParam.HasNext() )
{
adaptor.AddChild(root_1, stream_annotationParam.Next());
}
stream_annotationParam.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 72, annotationParamList_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start condition
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:663:1: condition : LPAREN expression RPAREN -> ^( CONDITION expression ) ;
public condition_return condition()
{
condition_return retval = new condition_return();
retval.start = input.LT(1);
int condition_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken LPAREN76 = null;
CommonToken RPAREN78 = null;
expression_return expression77 = null;
CommonTree LPAREN76_tree=null;
CommonTree RPAREN78_tree=null;
RewriteRuleTokenStream stream_RPAREN = new RewriteRuleTokenStream(adaptor,"token RPAREN");
RewriteRuleTokenStream stream_LPAREN = new RewriteRuleTokenStream(adaptor,"token LPAREN");
RewriteRuleSubtreeStream stream_expression = new RewriteRuleSubtreeStream(adaptor,"rule expression");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 35) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:664:4: ( LPAREN expression RPAREN -> ^( CONDITION expression ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:664:4: LPAREN expression RPAREN
{
LPAREN76 = (CommonToken)input.LT(1);
Match(input,LPAREN,FOLLOW_LPAREN_in_condition1937); if (failed) return retval;
if ( backtracking==0 ) stream_LPAREN.Add(LPAREN76);
if ( backtracking == 0 )
{
buffer.Append(options.SpaceBeforeMethodDef ? " (" : "(");
}
PushFollow(FOLLOW_expression_in_condition1945);
expression77 = expression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_expression.Add(expression77.Tree);
RPAREN78 = (CommonToken)input.LT(1);
Match(input,RPAREN,FOLLOW_RPAREN_in_condition1950); if (failed) return retval;
if ( backtracking==0 ) stream_RPAREN.Add(RPAREN78);
if ( backtracking == 0 )
{
buffer.Append(")");
}
// AST REWRITE
// elements: expression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 667:3: -> ^( CONDITION expression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:667:6: ^( CONDITION expression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(CONDITION, "CONDITION"), root_1);
adaptor.AddChild(root_1, stream_expression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 35, condition_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start annotations
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1059:1: annotations : ( ( annotation ) | ( includeDirective ) )+ -> ^( ANNOTATIONS ( annotation )+ ) ;
public annotations_return annotations()
{
annotations_return retval = new annotations_return();
retval.start = input.LT(1);
int annotations_StartIndex = input.Index();
CommonTree root_0 = null;
annotation_return annotation181 = null;
includeDirective_return includeDirective182 = null;
RewriteRuleSubtreeStream stream_includeDirective = new RewriteRuleSubtreeStream(adaptor,"rule includeDirective");
RewriteRuleSubtreeStream stream_annotation = new RewriteRuleSubtreeStream(adaptor,"rule annotation");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 70) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1060:4: ( ( ( annotation ) | ( includeDirective ) )+ -> ^( ANNOTATIONS ( annotation )+ ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1060:4: ( ( annotation ) | ( includeDirective ) )+
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1060:4: ( ( annotation ) | ( includeDirective ) )+
int cnt50 = 0;
do
{
int alt50 = 3;
int LA50_0 = input.LA(1);
if ( (LA50_0 == LBRACK) )
{
int LA50_13 = input.LA(2);
if ( (synpred78()) )
{
alt50 = 1;
}
}
else if ( (LA50_0 == 175) )
{
int LA50_14 = input.LA(2);
if ( (synpred79()) )
{
alt50 = 2;
}
}
switch (alt50)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1061:5: ( annotation )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1061:5: ( annotation )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1061:7: annotation
{
if ( backtracking == 0 )
{
buffer.Append(NewLine + tab);
}
PushFollow(FOLLOW_annotation_in_annotations3424);
annotation181 = annotation();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_annotation.Add(annotation181.Tree);
}
}
break;
case 2 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1062:6: ( includeDirective )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1062:6: ( includeDirective )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1062:8: includeDirective
{
if ( backtracking == 0 )
{
buffer.Append(NewLine + tab);
}
PushFollow(FOLLOW_includeDirective_in_annotations3437);
includeDirective182 = includeDirective();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_includeDirective.Add(includeDirective182.Tree);
}
}
break;
default:
if ( cnt50 >= 1 ) goto loop50;
if ( backtracking > 0 ) {failed = true; return retval;}
EarlyExitException eee =
new EarlyExitException(50, input);
throw eee;
}
cnt50++;
} while (true);
loop50:
; // Stops C# compiler whinging that label 'loop50' has no statements
// AST REWRITE
// elements: annotation
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1064:3: -> ^( ANNOTATIONS ( annotation )+ )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1064:6: ^( ANNOTATIONS ( annotation )+ )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(ANNOTATIONS, "ANNOTATIONS"), root_1);
if ( !(stream_annotation.HasNext()) ) {
throw new RewriteEarlyExitException();
}
while ( stream_annotation.HasNext() )
{
adaptor.AddChild(root_1, stream_annotation.Next());
}
stream_annotation.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 70, annotations_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start encapsulatedExpression
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1537:1: encapsulatedExpression : LPAREN assignmentExpression RPAREN -> ^( ENCPS_EXPR assignmentExpression ) ;
public encapsulatedExpression_return encapsulatedExpression()
{
InOperator_stack.Push(new InOperator_scope());
encapsulatedExpression_return retval = new encapsulatedExpression_return();
retval.start = input.LT(1);
int encapsulatedExpression_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken LPAREN319 = null;
CommonToken RPAREN321 = null;
assignmentExpression_return assignmentExpression320 = null;
CommonTree LPAREN319_tree=null;
CommonTree RPAREN321_tree=null;
RewriteRuleTokenStream stream_RPAREN = new RewriteRuleTokenStream(adaptor,"token RPAREN");
RewriteRuleTokenStream stream_LPAREN = new RewriteRuleTokenStream(adaptor,"token LPAREN");
RewriteRuleSubtreeStream stream_assignmentExpression = new RewriteRuleSubtreeStream(adaptor,"rule assignmentExpression");
((InOperator_scope)InOperator_stack.Peek()).allowed = true;
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 122) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1542:4: ( LPAREN assignmentExpression RPAREN -> ^( ENCPS_EXPR assignmentExpression ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1542:4: LPAREN assignmentExpression RPAREN
{
LPAREN319 = (CommonToken)input.LT(1);
Match(input,LPAREN,FOLLOW_LPAREN_in_encapsulatedExpression5654); if (failed) return retval;
if ( backtracking==0 ) stream_LPAREN.Add(LPAREN319);
if ( backtracking == 0 )
{
buffer.Append("(");
}
PushFollow(FOLLOW_assignmentExpression_in_encapsulatedExpression5664);
assignmentExpression320 = assignmentExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_assignmentExpression.Add(assignmentExpression320.Tree);
RPAREN321 = (CommonToken)input.LT(1);
Match(input,RPAREN,FOLLOW_RPAREN_in_encapsulatedExpression5669); if (failed) return retval;
if ( backtracking==0 ) stream_RPAREN.Add(RPAREN321);
if ( backtracking == 0 )
{
buffer.Append(")");
}
// AST REWRITE
// elements: assignmentExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1545:3: -> ^( ENCPS_EXPR assignmentExpression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1545:6: ^( ENCPS_EXPR assignmentExpression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(ENCPS_EXPR, "ENCPS_EXPR"), root_1);
adaptor.AddChild(root_1, stream_assignmentExpression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 122, encapsulatedExpression_StartIndex);
}
InOperator_stack.Pop();
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start arrayLiteral
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1133:1: arrayLiteral : LBRACK ( elementList )? RBRACK -> ^( ARRAY_LITERAL ( elementList )? ) ;
public arrayLiteral_return arrayLiteral()
{
arrayLiteral_return retval = new arrayLiteral_return();
retval.start = input.LT(1);
int arrayLiteral_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken LBRACK208 = null;
CommonToken RBRACK210 = null;
elementList_return elementList209 = null;
CommonTree LBRACK208_tree=null;
CommonTree RBRACK210_tree=null;
RewriteRuleTokenStream stream_LBRACK = new RewriteRuleTokenStream(adaptor,"token LBRACK");
RewriteRuleTokenStream stream_RBRACK = new RewriteRuleTokenStream(adaptor,"token RBRACK");
RewriteRuleSubtreeStream stream_elementList = new RewriteRuleSubtreeStream(adaptor,"rule elementList");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 78) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1134:4: ( LBRACK ( elementList )? RBRACK -> ^( ARRAY_LITERAL ( elementList )? ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1134:4: LBRACK ( elementList )? RBRACK
{
LBRACK208 = (CommonToken)input.LT(1);
Match(input,LBRACK,FOLLOW_LBRACK_in_arrayLiteral3832); if (failed) return retval;
if ( backtracking==0 ) stream_LBRACK.Add(LBRACK208);
if ( backtracking == 0 )
{
buffer.Append("[");
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1134:35: ( elementList )?
int alt58 = 2;
int LA58_0 = input.LA(1);
if ( (LA58_0 == LCURLY || (LA58_0 >= STRING_LITERAL && LA58_0 <= SET) || LA58_0 == LPAREN || LA58_0 == VOID || LA58_0 == IDENT || LA58_0 == LBRACK || LA58_0 == DYNAMIC || (LA58_0 >= IS && LA58_0 <= AS) || (LA58_0 >= PLUS && LA58_0 <= MINUS) || (LA58_0 >= INC && LA58_0 <= NEW) || (LA58_0 >= USE && LA58_0 <= XML)) )
{
alt58 = 1;
}
switch (alt58)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:0:0: elementList
{
PushFollow(FOLLOW_elementList_in_arrayLiteral3836);
elementList209 = elementList();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_elementList.Add(elementList209.Tree);
}
break;
}
RBRACK210 = (CommonToken)input.LT(1);
Match(input,RBRACK,FOLLOW_RBRACK_in_arrayLiteral3839); if (failed) return retval;
if ( backtracking==0 ) stream_RBRACK.Add(RBRACK210);
if ( backtracking == 0 )
{
buffer.Append("]");
}
// AST REWRITE
// elements: elementList
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1135:3: -> ^( ARRAY_LITERAL ( elementList )? )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1135:6: ^( ARRAY_LITERAL ( elementList )? )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(ARRAY_LITERAL, "ARRAY_LITERAL"), root_1);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1135:22: ( elementList )?
if ( stream_elementList.HasNext() )
{
adaptor.AddChild(root_1, stream_elementList.Next());
}
stream_elementList.Reset();
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 78, arrayLiteral_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start expressionStatement
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:700:1: expressionStatement : expressionList semi -> ^( EXPR_STMNT expressionList ) ;
public expressionStatement_return expressionStatement()
{
InOperator_stack.Push(new InOperator_scope());
expressionStatement_return retval = new expressionStatement_return();
retval.start = input.LT(1);
int expressionStatement_StartIndex = input.Index();
CommonTree root_0 = null;
expressionList_return expressionList96 = null;
semi_return semi97 = null;
RewriteRuleSubtreeStream stream_semi = new RewriteRuleSubtreeStream(adaptor,"rule semi");
RewriteRuleSubtreeStream stream_expressionList = new RewriteRuleSubtreeStream(adaptor,"rule expressionList");
((InOperator_scope)InOperator_stack.Peek()).allowed = true;
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 38) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:705:4: ( expressionList semi -> ^( EXPR_STMNT expressionList ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:705:4: expressionList semi
{
PushFollow(FOLLOW_expressionList_in_expressionStatement2141);
expressionList96 = expressionList();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_expressionList.Add(expressionList96.Tree);
PushFollow(FOLLOW_semi_in_expressionStatement2143);
semi97 = semi();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_semi.Add(semi97.Tree);
// AST REWRITE
// elements: expressionList
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 706:3: -> ^( EXPR_STMNT expressionList )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:706:6: ^( EXPR_STMNT expressionList )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(EXPR_STMNT, "EXPR_STMNT"), root_1);
adaptor.AddChild(root_1, stream_expressionList.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 38, expressionStatement_StartIndex);
}
InOperator_stack.Pop();
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start as2ClassDefinition
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:375:1: as2ClassDefinition[CommonTree mods] : cl= CLASS ide= identifier ext= classExtendsClause imp= implementsClause typeBlock -> ^( CLASS_DEF identifier classExtendsClause implementsClause typeBlock ) ;
public as2ClassDefinition_return as2ClassDefinition(CommonTree mods)
{
as2ClassDefinition_return retval = new as2ClassDefinition_return();
retval.start = input.LT(1);
int as2ClassDefinition_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken cl = null;
identifier_return ide = null;
classExtendsClause_return ext = null;
implementsClause_return imp = null;
typeBlock_return typeBlock11 = null;
CommonTree cl_tree=null;
RewriteRuleTokenStream stream_CLASS = new RewriteRuleTokenStream(adaptor,"token CLASS");
RewriteRuleSubtreeStream stream_classExtendsClause = new RewriteRuleSubtreeStream(adaptor,"rule classExtendsClause");
RewriteRuleSubtreeStream stream_implementsClause = new RewriteRuleSubtreeStream(adaptor,"rule implementsClause");
RewriteRuleSubtreeStream stream_identifier = new RewriteRuleSubtreeStream(adaptor,"rule identifier");
RewriteRuleSubtreeStream stream_typeBlock = new RewriteRuleSubtreeStream(adaptor,"rule typeBlock");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 7) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:376:4: (cl= CLASS ide= identifier ext= classExtendsClause imp= implementsClause typeBlock -> ^( CLASS_DEF identifier classExtendsClause implementsClause typeBlock ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:376:4: cl= CLASS ide= identifier ext= classExtendsClause imp= implementsClause typeBlock
{
cl = (CommonToken)input.LT(1);
Match(input,CLASS,FOLLOW_CLASS_in_as2ClassDefinition594); if (failed) return retval;
if ( backtracking==0 ) stream_CLASS.Add(cl);
if ( backtracking == 0 )
{
buffer.Append(NewLine + tab + cl.Text + " ");
}
PushFollow(FOLLOW_identifier_in_as2ClassDefinition606);
ide = identifier();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_identifier.Add(ide.Tree);
PushFollow(FOLLOW_classExtendsClause_in_as2ClassDefinition612);
ext = classExtendsClause();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_classExtendsClause.Add(ext.Tree);
PushFollow(FOLLOW_implementsClause_in_as2ClassDefinition619);
imp = implementsClause();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_implementsClause.Add(imp.Tree);
if ( backtracking == 0 )
{
buffer.Append(options.NewlineAfterMethod ? NewLine + tab : " ");
buffer.Append("{");
CurrentTab++;
}
PushFollow(FOLLOW_typeBlock_in_as2ClassDefinition625);
typeBlock11 = typeBlock();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_typeBlock.Add(typeBlock11.Tree);
if ( backtracking == 0 )
{
CurrentTab--;
buffer.Append(NewLine + tab);
buffer.Append("}");
}
// AST REWRITE
// elements: implementsClause, identifier, typeBlock, classExtendsClause
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 390:3: -> ^( CLASS_DEF identifier classExtendsClause implementsClause typeBlock )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:390:6: ^( CLASS_DEF identifier classExtendsClause implementsClause typeBlock )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(CLASS_DEF, "CLASS_DEF"), root_1);
adaptor.AddChild(root_1, mods);
adaptor.AddChild(root_1, stream_identifier.Next());
adaptor.AddChild(root_1, stream_classExtendsClause.Next());
adaptor.AddChild(root_1, stream_implementsClause.Next());
adaptor.AddChild(root_1, stream_typeBlock.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 7, as2ClassDefinition_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start forStatement
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:870:1: forStatement : f= FOR LPAREN ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) ) ;
public forStatement_return forStatement()
{
InOperator_stack.Push(new InOperator_scope());
forStatement_return retval = new forStatement_return();
retval.start = input.LT(1);
int forStatement_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken f = null;
CommonToken LPAREN140 = null;
CommonToken RPAREN142 = null;
CommonToken RPAREN145 = null;
forInClause_return forInClause141 = null;
statement_return statement143 = null;
traditionalForClause_return traditionalForClause144 = null;
statement_return statement146 = null;
CommonTree f_tree=null;
CommonTree LPAREN140_tree=null;
CommonTree RPAREN142_tree=null;
CommonTree RPAREN145_tree=null;
RewriteRuleTokenStream stream_FOR = new RewriteRuleTokenStream(adaptor,"token FOR");
RewriteRuleTokenStream stream_RPAREN = new RewriteRuleTokenStream(adaptor,"token RPAREN");
RewriteRuleTokenStream stream_LPAREN = new RewriteRuleTokenStream(adaptor,"token LPAREN");
RewriteRuleSubtreeStream stream_statement = new RewriteRuleSubtreeStream(adaptor,"rule statement");
RewriteRuleSubtreeStream stream_traditionalForClause = new RewriteRuleSubtreeStream(adaptor,"rule traditionalForClause");
RewriteRuleSubtreeStream stream_forInClause = new RewriteRuleSubtreeStream(adaptor,"rule forInClause");
((InOperator_scope)InOperator_stack.Peek()).allowed = false;
int next_node = -1;
int next_node_2 = -1;
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 53) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:877:4: (f= FOR LPAREN ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:877:4: f= FOR LPAREN ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )
{
f = (CommonToken)input.LT(1);
Match(input,FOR,FOLLOW_FOR_in_forStatement2695); if (failed) return retval;
if ( backtracking==0 ) stream_FOR.Add(f);
if ( backtracking == 0 )
{
buffer.Append("for");
}
LPAREN140 = (CommonToken)input.LT(1);
Match(input,LPAREN,FOLLOW_LPAREN_in_forStatement2703); if (failed) return retval;
if ( backtracking==0 ) stream_LPAREN.Add(LPAREN140);
if ( backtracking == 0 )
{
buffer.Append(options.SpaceBeforeMethodDef ? " (" : "(");
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )
int alt40 = 2;
switch ( input.LA(1) )
{
case VAR:
case CONST:
{
switch ( input.LA(2) )
{
case IDENT:
{
int LA40_31 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s31 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 31, input);
throw nvae_d40s31;
}
}
break;
case USE:
{
int LA40_32 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s32 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 32, input);
throw nvae_d40s32;
}
}
break;
case XML:
{
int LA40_33 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s33 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 33, input);
throw nvae_d40s33;
}
}
break;
case DYNAMIC:
{
int LA40_34 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s34 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 34, input);
throw nvae_d40s34;
}
}
break;
case IS:
{
int LA40_35 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s35 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 35, input);
throw nvae_d40s35;
}
}
break;
case AS:
{
int LA40_36 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s36 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 36, input);
throw nvae_d40s36;
}
}
break;
case GET:
{
int LA40_37 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s37 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 37, input);
throw nvae_d40s37;
}
}
break;
case SET:
{
int LA40_38 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s38 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 38, input);
throw nvae_d40s38;
}
}
break;
default:
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s1 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 1, input);
throw nvae_d40s1;
}
}
break;
case IDENT:
{
int LA40_2 = input.LA(2);
if ( (LA40_2 == SEMI || LA40_2 == COMMA || (LA40_2 >= ASSIGN && LA40_2 <= LPAREN) || (LA40_2 >= STAR && LA40_2 <= DOT) || LA40_2 == LBRACK || (LA40_2 >= STAR_ASSIGN && LA40_2 <= DEC) || (LA40_2 >= 185 && LA40_2 <= 186)) )
{
alt40 = 2;
}
else if ( (LA40_2 == IN) )
{
int LA40_47 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s47 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 47, input);
throw nvae_d40s47;
}
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s2 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 2, input);
throw nvae_d40s2;
}
}
break;
case USE:
{
int LA40_3 = input.LA(2);
if ( (LA40_3 == SEMI || LA40_3 == COMMA || (LA40_3 >= ASSIGN && LA40_3 <= LPAREN) || (LA40_3 >= STAR && LA40_3 <= DOT) || LA40_3 == LBRACK || (LA40_3 >= STAR_ASSIGN && LA40_3 <= DEC) || (LA40_3 >= 185 && LA40_3 <= 186)) )
{
alt40 = 2;
}
else if ( (LA40_3 == IN) )
{
int LA40_73 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s73 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 73, input);
throw nvae_d40s73;
}
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s3 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 3, input);
throw nvae_d40s3;
}
}
break;
case XML:
{
int LA40_4 = input.LA(2);
if ( (LA40_4 == IN) )
{
int LA40_91 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s91 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 91, input);
throw nvae_d40s91;
}
}
else if ( (LA40_4 == SEMI || LA40_4 == COMMA || (LA40_4 >= ASSIGN && LA40_4 <= LPAREN) || (LA40_4 >= STAR && LA40_4 <= DOT) || LA40_4 == LBRACK || (LA40_4 >= STAR_ASSIGN && LA40_4 <= DEC) || (LA40_4 >= 185 && LA40_4 <= 186)) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s4 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 4, input);
throw nvae_d40s4;
}
}
break;
case DYNAMIC:
{
int LA40_5 = input.LA(2);
if ( (LA40_5 == SEMI || LA40_5 == COMMA || (LA40_5 >= ASSIGN && LA40_5 <= LPAREN) || (LA40_5 >= STAR && LA40_5 <= DOT) || LA40_5 == LBRACK || (LA40_5 >= STAR_ASSIGN && LA40_5 <= DEC) || (LA40_5 >= 185 && LA40_5 <= 186)) )
{
alt40 = 2;
}
else if ( (LA40_5 == IN) )
{
int LA40_125 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s125 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 125, input);
throw nvae_d40s125;
}
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s5 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 5, input);
throw nvae_d40s5;
}
}
break;
case IS:
{
int LA40_6 = input.LA(2);
if ( (LA40_6 == SEMI || LA40_6 == COMMA || (LA40_6 >= ASSIGN && LA40_6 <= LPAREN) || (LA40_6 >= STAR && LA40_6 <= DOT) || LA40_6 == LBRACK || (LA40_6 >= STAR_ASSIGN && LA40_6 <= DEC) || (LA40_6 >= 185 && LA40_6 <= 186)) )
{
alt40 = 2;
}
else if ( (LA40_6 == IN) )
{
int LA40_151 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s151 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 151, input);
throw nvae_d40s151;
}
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s6 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 6, input);
throw nvae_d40s6;
}
}
break;
case AS:
{
int LA40_7 = input.LA(2);
if ( (LA40_7 == IN) )
{
int LA40_169 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s169 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 169, input);
throw nvae_d40s169;
}
}
else if ( (LA40_7 == SEMI || LA40_7 == COMMA || (LA40_7 >= ASSIGN && LA40_7 <= LPAREN) || (LA40_7 >= STAR && LA40_7 <= DOT) || LA40_7 == LBRACK || (LA40_7 >= STAR_ASSIGN && LA40_7 <= DEC) || (LA40_7 >= 185 && LA40_7 <= 186)) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s7 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 7, input);
throw nvae_d40s7;
}
}
break;
case GET:
{
int LA40_8 = input.LA(2);
if ( (LA40_8 == SEMI || LA40_8 == COMMA || (LA40_8 >= ASSIGN && LA40_8 <= LPAREN) || (LA40_8 >= STAR && LA40_8 <= DOT) || LA40_8 == LBRACK || (LA40_8 >= STAR_ASSIGN && LA40_8 <= DEC) || (LA40_8 >= 185 && LA40_8 <= 186)) )
{
alt40 = 2;
}
else if ( (LA40_8 == IN) )
{
int LA40_203 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s203 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 203, input);
throw nvae_d40s203;
}
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s8 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 8, input);
throw nvae_d40s8;
}
}
break;
case SET:
{
int LA40_9 = input.LA(2);
if ( (LA40_9 == SEMI || LA40_9 == COMMA || (LA40_9 >= ASSIGN && LA40_9 <= LPAREN) || (LA40_9 >= STAR && LA40_9 <= DOT) || LA40_9 == LBRACK || (LA40_9 >= STAR_ASSIGN && LA40_9 <= DEC) || (LA40_9 >= 185 && LA40_9 <= 186)) )
{
alt40 = 2;
}
else if ( (LA40_9 == IN) )
{
int LA40_229 = input.LA(3);
if ( (synpred63()) )
{
alt40 = 1;
}
else if ( (true) )
{
alt40 = 2;
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s229 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 229, input);
throw nvae_d40s229;
}
}
else
{
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s9 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 9, input);
throw nvae_d40s9;
}
}
break;
case SEMI:
case LCURLY:
case STRING_LITERAL:
case FUNCTION:
case LPAREN:
case VOID:
case LBRACK:
case PLUS:
case MINUS:
case INC:
case DEC:
case DELETE:
case TYPEOF:
case LNOT:
case BNOT:
case UNDEFINED:
case TRUE:
case FALSE:
case NULL:
case HEX_LITERAL:
case DECIMAL_LITERAL:
case OCTAL_LITERAL:
case FLOAT_LITERAL:
case NEW:
{
alt40 = 2;
}
break;
default:
if ( backtracking > 0 ) {failed = true; return retval;}
NoViableAltException nvae_d40s0 =
new NoViableAltException("879:3: ( ( forInClauseDecl IN )=> forInClause RPAREN statement -> ^( FOR_IN[$f] forInClause statement ) | traditionalForClause RPAREN statement -> ^( $f traditionalForClause statement ) )", 40, 0, input);
throw nvae_d40s0;
}
switch (alt40)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:880:4: ( forInClauseDecl IN )=> forInClause RPAREN statement
{
PushFollow(FOLLOW_forInClause_in_forStatement2723);
forInClause141 = forInClause();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_forInClause.Add(forInClause141.Tree);
RPAREN142 = (CommonToken)input.LT(1);
Match(input,RPAREN,FOLLOW_RPAREN_in_forStatement2729); if (failed) return retval;
if ( backtracking==0 ) stream_RPAREN.Add(RPAREN142);
if ( backtracking == 0 )
{
buffer.Append(")");
buffer.Append((options.NewlineAfterCondition ? NewLine + tab : "") + "{");
CurrentTab++;
int next_test = input.LA(1);
if(next_test != ASLexer.LCURLY) buffer.Append(NewLine + tab);
}
PushFollow(FOLLOW_statement_in_forStatement2742);
statement143 = statement();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_statement.Add(statement143.Tree);
if ( backtracking == 0 )
{
CurrentTab--;
buffer.Append(NewLine + tab);
buffer.Append("}");
}
// AST REWRITE
// elements: statement, forInClause
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 893:4: -> ^( FOR_IN[$f] forInClause statement )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:893:7: ^( FOR_IN[$f] forInClause statement )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(FOR_IN, f), root_1);
adaptor.AddChild(root_1, stream_forInClause.Next());
adaptor.AddChild(root_1, stream_statement.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 2 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:895:6: traditionalForClause RPAREN statement
{
PushFollow(FOLLOW_traditionalForClause_in_forStatement2771);
traditionalForClause144 = traditionalForClause();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_traditionalForClause.Add(traditionalForClause144.Tree);
RPAREN145 = (CommonToken)input.LT(1);
Match(input,RPAREN,FOLLOW_RPAREN_in_forStatement2773); if (failed) return retval;
if ( backtracking==0 ) stream_RPAREN.Add(RPAREN145);
if ( backtracking == 0 )
{
buffer.Append(")");
buffer.Append((options.NewlineAfterCondition ? NewLine + tab : "") + "{");
CurrentTab++;
int next_test_2 = input.LA(1);
if(next_test_2 != ASLexer.LCURLY) buffer.Append(NewLine + tab);
}
PushFollow(FOLLOW_statement_in_forStatement2782);
statement146 = statement();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_statement.Add(statement146.Tree);
if ( backtracking == 0 )
{
CurrentTab--;
buffer.Append(NewLine + tab);
buffer.Append("}");
}
// AST REWRITE
// elements: traditionalForClause, f, statement
// token labels: f
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleTokenStream stream_f = new RewriteRuleTokenStream(adaptor, "token f", f);
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 907:4: -> ^( $f traditionalForClause statement )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:907:7: ^( $f traditionalForClause statement )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(stream_f.Next(), root_1);
adaptor.AddChild(root_1, stream_traditionalForClause.Next());
adaptor.AddChild(root_1, stream_statement.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 53, forStatement_StartIndex);
}
InOperator_stack.Pop();
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start as2InterfaceDefinition
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:411:1: as2InterfaceDefinition[CommonTree mods] : INTERFACE identifier interfaceExtendsClause interfaceTypeBlock -> ^( INTERFACE_DEF identifier interfaceExtendsClause interfaceTypeBlock ) ;
public as2InterfaceDefinition_return as2InterfaceDefinition(CommonTree mods)
{
as2InterfaceDefinition_return retval = new as2InterfaceDefinition_return();
retval.start = input.LT(1);
int as2InterfaceDefinition_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken INTERFACE14 = null;
identifier_return identifier15 = null;
interfaceExtendsClause_return interfaceExtendsClause16 = null;
interfaceTypeBlock_return interfaceTypeBlock17 = null;
CommonTree INTERFACE14_tree=null;
RewriteRuleTokenStream stream_INTERFACE = new RewriteRuleTokenStream(adaptor,"token INTERFACE");
RewriteRuleSubtreeStream stream_identifier = new RewriteRuleSubtreeStream(adaptor,"rule identifier");
RewriteRuleSubtreeStream stream_interfaceTypeBlock = new RewriteRuleSubtreeStream(adaptor,"rule interfaceTypeBlock");
RewriteRuleSubtreeStream stream_interfaceExtendsClause = new RewriteRuleSubtreeStream(adaptor,"rule interfaceExtendsClause");
CommonTree annos = null;
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 9) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:413:4: ( INTERFACE identifier interfaceExtendsClause interfaceTypeBlock -> ^( INTERFACE_DEF identifier interfaceExtendsClause interfaceTypeBlock ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:413:4: INTERFACE identifier interfaceExtendsClause interfaceTypeBlock
{
INTERFACE14 = (CommonToken)input.LT(1);
Match(input,INTERFACE,FOLLOW_INTERFACE_in_as2InterfaceDefinition729); if (failed) return retval;
if ( backtracking==0 ) stream_INTERFACE.Add(INTERFACE14);
PushFollow(FOLLOW_identifier_in_as2InterfaceDefinition731);
identifier15 = identifier();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_identifier.Add(identifier15.Tree);
PushFollow(FOLLOW_interfaceExtendsClause_in_as2InterfaceDefinition735);
interfaceExtendsClause16 = interfaceExtendsClause();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_interfaceExtendsClause.Add(interfaceExtendsClause16.Tree);
PushFollow(FOLLOW_interfaceTypeBlock_in_as2InterfaceDefinition739);
interfaceTypeBlock17 = interfaceTypeBlock();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_interfaceTypeBlock.Add(interfaceTypeBlock17.Tree);
// AST REWRITE
// elements: interfaceTypeBlock, interfaceExtendsClause, identifier
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 416:3: -> ^( INTERFACE_DEF identifier interfaceExtendsClause interfaceTypeBlock )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:416:6: ^( INTERFACE_DEF identifier interfaceExtendsClause interfaceTypeBlock )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(INTERFACE_DEF, "INTERFACE_DEF"), root_1);
adaptor.AddChild(root_1, mods);
adaptor.AddChild(root_1, stream_identifier.Next());
adaptor.AddChild(root_1, stream_interfaceExtendsClause.Next());
adaptor.AddChild(root_1, stream_interfaceTypeBlock.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 9, as2InterfaceDefinition_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start functionDefinition
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1549:1: functionDefinition : f= FUNCTION parameterDeclarationList (type_exp= typeExpression )? block -> ^( FUNC_DEF parameterDeclarationList ( typeExpression )? block ) ;
public functionDefinition_return functionDefinition()
{
functionDefinition_return retval = new functionDefinition_return();
retval.start = input.LT(1);
int functionDefinition_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken f = null;
typeExpression_return type_exp = null;
parameterDeclarationList_return parameterDeclarationList322 = null;
block_return block323 = null;
CommonTree f_tree=null;
RewriteRuleTokenStream stream_FUNCTION = new RewriteRuleTokenStream(adaptor,"token FUNCTION");
RewriteRuleSubtreeStream stream_parameterDeclarationList = new RewriteRuleSubtreeStream(adaptor,"rule parameterDeclarationList");
RewriteRuleSubtreeStream stream_block = new RewriteRuleSubtreeStream(adaptor,"rule block");
RewriteRuleSubtreeStream stream_typeExpression = new RewriteRuleSubtreeStream(adaptor,"rule typeExpression");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 123) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1550:4: (f= FUNCTION parameterDeclarationList (type_exp= typeExpression )? block -> ^( FUNC_DEF parameterDeclarationList ( typeExpression )? block ) )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1550:4: f= FUNCTION parameterDeclarationList (type_exp= typeExpression )? block
{
f = (CommonToken)input.LT(1);
Match(input,FUNCTION,FOLLOW_FUNCTION_in_functionDefinition5699); if (failed) return retval;
if ( backtracking==0 ) stream_FUNCTION.Add(f);
if ( backtracking == 0 )
{
buffer.Append(f.Text + (options.SpaceBeforeMethodDef ? " " : ""));
}
PushFollow(FOLLOW_parameterDeclarationList_in_functionDefinition5706);
parameterDeclarationList322 = parameterDeclarationList();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_parameterDeclarationList.Add(parameterDeclarationList322.Tree);
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1552:11: (type_exp= typeExpression )?
int alt91 = 2;
int LA91_0 = input.LA(1);
if ( (LA91_0 == COLON) )
{
alt91 = 1;
}
switch (alt91)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:0:0: type_exp= typeExpression
{
PushFollow(FOLLOW_typeExpression_in_functionDefinition5713);
type_exp = typeExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_typeExpression.Add(type_exp.Tree);
}
break;
}
if ( backtracking == 0 )
{
if(options.NewlineAfterMethod) buffer.Append(NewLine + tab);
buffer.Append("{");
CurrentTab++;
}
PushFollow(FOLLOW_block_in_functionDefinition5729);
block323 = block();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_block.Add(block323.Tree);
if ( backtracking == 0 )
{
CurrentTab--;
buffer.Append(NewLine + tab);
buffer.Append("}");
//buffer.Append(NewLine + tab);
}
// AST REWRITE
// elements: block, parameterDeclarationList, typeExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1565:3: -> ^( FUNC_DEF parameterDeclarationList ( typeExpression )? block )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1565:6: ^( FUNC_DEF parameterDeclarationList ( typeExpression )? block )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(FUNC_DEF, "FUNC_DEF"), root_1);
adaptor.AddChild(root_1, stream_parameterDeclarationList.Next());
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1565:42: ( typeExpression )?
if ( stream_typeExpression.HasNext() )
{
adaptor.AddChild(root_1, stream_typeExpression.Next());
}
stream_typeExpression.Reset();
adaptor.AddChild(root_1, stream_block.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 123, functionDefinition_StartIndex);
}
}
return retval;
}
// throws RecognitionException [1]
// $ANTLR start postfixExpression
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1438:1: postfixExpression : ( primaryExpression -> primaryExpression ) (poi= propOrIdent[root_0, retval.start] -> $poi | LBRACK expression RBRACK -> ^( ARRAY_ACC $postfixExpression expression ) | arguments -> ^( METHOD_CALL $postfixExpression arguments ) )* (iin= INC -> ^( POST_INC[$iin] $postfixExpression) | dde= DEC -> ^( POST_DEC[$dde] $postfixExpression) )? ;
public postfixExpression_return postfixExpression()
{
postfixExpression_return retval = new postfixExpression_return();
retval.start = input.LT(1);
int postfixExpression_StartIndex = input.Index();
CommonTree root_0 = null;
CommonToken iin = null;
CommonToken dde = null;
CommonToken LBRACK286 = null;
CommonToken RBRACK288 = null;
propOrIdent_return poi = null;
primaryExpression_return primaryExpression285 = null;
expression_return expression287 = null;
arguments_return arguments289 = null;
CommonTree iin_tree=null;
CommonTree dde_tree=null;
CommonTree LBRACK286_tree=null;
CommonTree RBRACK288_tree=null;
RewriteRuleTokenStream stream_LBRACK = new RewriteRuleTokenStream(adaptor,"token LBRACK");
RewriteRuleTokenStream stream_INC = new RewriteRuleTokenStream(adaptor,"token INC");
RewriteRuleTokenStream stream_RBRACK = new RewriteRuleTokenStream(adaptor,"token RBRACK");
RewriteRuleTokenStream stream_DEC = new RewriteRuleTokenStream(adaptor,"token DEC");
RewriteRuleSubtreeStream stream_arguments = new RewriteRuleSubtreeStream(adaptor,"rule arguments");
RewriteRuleSubtreeStream stream_primaryExpression = new RewriteRuleSubtreeStream(adaptor,"rule primaryExpression");
RewriteRuleSubtreeStream stream_propOrIdent = new RewriteRuleSubtreeStream(adaptor,"rule propOrIdent");
RewriteRuleSubtreeStream stream_expression = new RewriteRuleSubtreeStream(adaptor,"rule expression");
try
{
if ( (backtracking > 0) && AlreadyParsedRule(input, 110) )
{
return retval;
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1439:4: ( ( primaryExpression -> primaryExpression ) (poi= propOrIdent[root_0, retval.start] -> $poi | LBRACK expression RBRACK -> ^( ARRAY_ACC $postfixExpression expression ) | arguments -> ^( METHOD_CALL $postfixExpression arguments ) )* (iin= INC -> ^( POST_INC[$iin] $postfixExpression) | dde= DEC -> ^( POST_DEC[$dde] $postfixExpression) )? )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1439:4: ( primaryExpression -> primaryExpression ) (poi= propOrIdent[root_0, retval.start] -> $poi | LBRACK expression RBRACK -> ^( ARRAY_ACC $postfixExpression expression ) | arguments -> ^( METHOD_CALL $postfixExpression arguments ) )* (iin= INC -> ^( POST_INC[$iin] $postfixExpression) | dde= DEC -> ^( POST_DEC[$dde] $postfixExpression) )?
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1439:4: ( primaryExpression -> primaryExpression )
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1439:5: primaryExpression
{
PushFollow(FOLLOW_primaryExpression_in_postfixExpression5086);
primaryExpression285 = primaryExpression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_primaryExpression.Add(primaryExpression285.Tree);
// AST REWRITE
// elements: primaryExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1439:23: -> primaryExpression
{
adaptor.AddChild(root_0, stream_primaryExpression.Next());
}
}
}
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1440:3: (poi= propOrIdent[root_0, retval.start] -> $poi | LBRACK expression RBRACK -> ^( ARRAY_ACC $postfixExpression expression ) | arguments -> ^( METHOD_CALL $postfixExpression arguments ) )*
do
{
int alt82 = 4;
switch ( input.LA(1) )
{
case LBRACK:
{
switch ( input.LA(2) )
{
case INC:
{
int LA82_80 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case DEC:
{
int LA82_81 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case MINUS:
{
int LA82_82 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case PLUS:
{
int LA82_83 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case DELETE:
{
int LA82_84 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case VOID:
{
int LA82_85 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case TYPEOF:
{
int LA82_86 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case LNOT:
{
int LA82_87 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case BNOT:
{
int LA82_88 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case UNDEFINED:
{
int LA82_89 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case HEX_LITERAL:
case DECIMAL_LITERAL:
case OCTAL_LITERAL:
case FLOAT_LITERAL:
{
int LA82_90 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case STRING_LITERAL:
{
int LA82_91 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case TRUE:
{
int LA82_92 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case FALSE:
{
int LA82_93 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case NULL:
{
int LA82_94 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case LBRACK:
{
int LA82_95 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case LCURLY:
{
int LA82_96 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case FUNCTION:
{
int LA82_97 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case NEW:
{
int LA82_98 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case LPAREN:
{
int LA82_99 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case IDENT:
{
int LA82_100 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case USE:
{
int LA82_101 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case XML:
{
int LA82_102 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case DYNAMIC:
{
int LA82_103 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case IS:
{
int LA82_104 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case AS:
{
int LA82_105 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case GET:
{
int LA82_106 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
case SET:
{
int LA82_107 = input.LA(3);
if ( (synpred156()) )
{
alt82 = 2;
}
}
break;
}
}
break;
case LPAREN:
{
switch ( input.LA(2) )
{
case RPAREN:
{
alt82 = 3;
}
break;
case INC:
{
int LA82_110 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case DEC:
{
int LA82_111 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case MINUS:
{
int LA82_112 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case PLUS:
{
int LA82_113 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case DELETE:
{
int LA82_114 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case VOID:
{
int LA82_115 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case TYPEOF:
{
int LA82_116 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case LNOT:
{
int LA82_117 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case BNOT:
{
int LA82_118 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case UNDEFINED:
{
int LA82_119 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case HEX_LITERAL:
case DECIMAL_LITERAL:
case OCTAL_LITERAL:
case FLOAT_LITERAL:
{
int LA82_120 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case STRING_LITERAL:
{
int LA82_121 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case TRUE:
{
int LA82_122 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case FALSE:
{
int LA82_123 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case NULL:
{
int LA82_124 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case LBRACK:
{
int LA82_125 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case LCURLY:
{
int LA82_126 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case FUNCTION:
{
int LA82_127 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case NEW:
{
int LA82_128 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case LPAREN:
{
int LA82_129 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case IDENT:
{
int LA82_130 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case USE:
{
int LA82_131 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case XML:
{
int LA82_132 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case DYNAMIC:
{
int LA82_133 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case IS:
{
int LA82_134 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case AS:
{
int LA82_135 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case GET:
{
int LA82_136 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
case SET:
{
int LA82_137 = input.LA(3);
if ( (synpred157()) )
{
alt82 = 3;
}
}
break;
}
}
break;
case DOT:
{
alt82 = 1;
}
break;
}
switch (alt82)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1440:5: poi= propOrIdent[root_0, retval.start]
{
PushFollow(FOLLOW_propOrIdent_in_postfixExpression5099);
poi = propOrIdent(root_0, retval.start);
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_propOrIdent.Add(poi.Tree);
if ( backtracking == 0 )
{
}
// AST REWRITE
// elements: poi
// token labels:
// rule labels: retval, poi
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
RewriteRuleSubtreeStream stream_poi = new RewriteRuleSubtreeStream(adaptor, "token poi", (poi!=null ? poi.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1440:47: -> $poi
{
adaptor.AddChild(root_0, stream_poi.Next());
}
}
}
break;
case 2 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1441:5: LBRACK expression RBRACK
{
LBRACK286 = (CommonToken)input.LT(1);
Match(input,LBRACK,FOLLOW_LBRACK_in_postfixExpression5113); if (failed) return retval;
if ( backtracking==0 ) stream_LBRACK.Add(LBRACK286);
if ( backtracking == 0 )
{
buffer.Append("[");
}
PushFollow(FOLLOW_expression_in_postfixExpression5117);
expression287 = expression();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_expression.Add(expression287.Tree);
RBRACK288 = (CommonToken)input.LT(1);
Match(input,RBRACK,FOLLOW_RBRACK_in_postfixExpression5119); if (failed) return retval;
if ( backtracking==0 ) stream_RBRACK.Add(RBRACK288);
if ( backtracking == 0 )
{
buffer.Append("]");
}
// AST REWRITE
// elements: postfixExpression, expression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1441:78: -> ^( ARRAY_ACC $postfixExpression expression )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1441:81: ^( ARRAY_ACC $postfixExpression expression )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(ARRAY_ACC, "ARRAY_ACC"), root_1);
adaptor.AddChild(root_1, stream_retval.Next());
adaptor.AddChild(root_1, stream_expression.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 3 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1442:5: arguments
{
PushFollow(FOLLOW_arguments_in_postfixExpression5138);
arguments289 = arguments();
followingStackPointer_--;
if (failed) return retval;
if ( backtracking==0 ) stream_arguments.Add(arguments289.Tree);
// AST REWRITE
// elements: arguments, postfixExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1442:15: -> ^( METHOD_CALL $postfixExpression arguments )
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1442:18: ^( METHOD_CALL $postfixExpression arguments )
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(METHOD_CALL, "METHOD_CALL"), root_1);
adaptor.AddChild(root_1, stream_retval.Next());
adaptor.AddChild(root_1, stream_arguments.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
default:
goto loop82;
}
} while (true);
loop82:
; // Stops C# compiler whinging that label 'loop82' has no statements
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1445:3: (iin= INC -> ^( POST_INC[$iin] $postfixExpression) | dde= DEC -> ^( POST_DEC[$dde] $postfixExpression) )?
int alt83 = 3;
int LA83_0 = input.LA(1);
if ( (LA83_0 == INC) )
{
switch ( input.LA(2) )
{
case INC:
{
int LA83_79 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case DEC:
{
int LA83_80 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case MINUS:
{
int LA83_81 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case PLUS:
{
int LA83_82 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case DELETE:
{
int LA83_83 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case VOID:
{
int LA83_84 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case TYPEOF:
{
int LA83_85 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case LNOT:
{
int LA83_86 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case BNOT:
{
int LA83_87 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case UNDEFINED:
{
int LA83_88 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case HEX_LITERAL:
case DECIMAL_LITERAL:
case OCTAL_LITERAL:
case FLOAT_LITERAL:
{
int LA83_89 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case STRING_LITERAL:
{
int LA83_90 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case TRUE:
{
int LA83_91 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case FALSE:
{
int LA83_92 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case NULL:
{
int LA83_93 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case LBRACK:
{
int LA83_94 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case LCURLY:
{
int LA83_95 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case FUNCTION:
{
int LA83_96 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case NEW:
{
int LA83_97 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case LPAREN:
{
int LA83_98 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case IDENT:
{
int LA83_99 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case USE:
{
int LA83_100 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case XML:
{
int LA83_101 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case DYNAMIC:
{
int LA83_102 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case IS:
{
int LA83_103 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case AS:
{
int LA83_104 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case GET:
{
int LA83_105 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case SET:
{
int LA83_106 = input.LA(3);
if ( (synpred158()) )
{
alt83 = 1;
}
}
break;
case EOF:
case IMPORT:
case SEMI:
case COMMA:
case RCURLY:
case INCLUDE_DIRECTIVE:
case VAR:
case CONST:
case ASSIGN:
case RPAREN:
case IF:
case ELSE:
case RETURN:
case CONTINUE:
case BREAK:
case SWITCH:
case CASE:
case COLON:
case DEFAULT:
case FOR:
case IN:
case WHILE:
case DO:
case WITH:
case STAR:
case PUBLIC:
case PRIVATE:
case PROTECTED:
case INTERNAL:
case RBRACK:
case STATIC:
case STAR_ASSIGN:
case DIV_ASSIGN:
case MOD_ASSIGN:
case PLUS_ASSIGN:
case MINUS_ASSIGN:
case SL_ASSIGN:
case SR_ASSIGN:
case BSR_ASSIGN:
case BAND_ASSIGN:
case BXOR_ASSIGN:
case BOR_ASSIGN:
case LAND_ASSIGN:
case LOR_ASSIGN:
case QUESTION:
case LOR:
case LAND:
case BOR:
case BXOR:
case BAND:
case STRICT_EQUAL:
case STRICT_NOT_EQUAL:
case NOT_EQUAL:
case EQUAL:
case LT:
case GT:
case LE:
case GE:
case INSTANCEOF:
case SL:
case SR:
case BSR:
case DIV:
case MOD:
case SL_COMMENT:
case ML_COMMENT:
case 175:
case 176:
case 177:
case 180:
case 181:
case 182:
case 183:
case 184:
case 185:
case 186:
{
alt83 = 1;
}
break;
}
}
else if ( (LA83_0 == DEC) )
{
switch ( input.LA(2) )
{
case INC:
{
int LA83_157 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case DEC:
{
int LA83_158 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case MINUS:
{
int LA83_159 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case PLUS:
{
int LA83_160 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case DELETE:
{
int LA83_161 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case VOID:
{
int LA83_162 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case TYPEOF:
{
int LA83_163 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case LNOT:
{
int LA83_164 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case BNOT:
{
int LA83_165 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case UNDEFINED:
{
int LA83_166 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case HEX_LITERAL:
case DECIMAL_LITERAL:
case OCTAL_LITERAL:
case FLOAT_LITERAL:
{
int LA83_167 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case STRING_LITERAL:
{
int LA83_168 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case TRUE:
{
int LA83_169 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case FALSE:
{
int LA83_170 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case NULL:
{
int LA83_171 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case LBRACK:
{
int LA83_172 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case LCURLY:
{
int LA83_173 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case FUNCTION:
{
int LA83_174 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case NEW:
{
int LA83_175 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case LPAREN:
{
int LA83_176 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case IDENT:
{
int LA83_177 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case USE:
{
int LA83_178 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case XML:
{
int LA83_179 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case DYNAMIC:
{
int LA83_180 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case IS:
{
int LA83_181 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case AS:
{
int LA83_182 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case GET:
{
int LA83_183 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case SET:
{
int LA83_184 = input.LA(3);
if ( (synpred159()) )
{
alt83 = 2;
}
}
break;
case EOF:
case IMPORT:
case SEMI:
case COMMA:
case RCURLY:
case INCLUDE_DIRECTIVE:
case VAR:
case CONST:
case ASSIGN:
case RPAREN:
case IF:
case ELSE:
case RETURN:
case CONTINUE:
case BREAK:
case SWITCH:
case CASE:
case COLON:
case DEFAULT:
case FOR:
case IN:
case WHILE:
case DO:
case WITH:
case STAR:
case PUBLIC:
case PRIVATE:
case PROTECTED:
case INTERNAL:
case RBRACK:
case STATIC:
case STAR_ASSIGN:
case DIV_ASSIGN:
case MOD_ASSIGN:
case PLUS_ASSIGN:
case MINUS_ASSIGN:
case SL_ASSIGN:
case SR_ASSIGN:
case BSR_ASSIGN:
case BAND_ASSIGN:
case BXOR_ASSIGN:
case BOR_ASSIGN:
case LAND_ASSIGN:
case LOR_ASSIGN:
case QUESTION:
case LOR:
case LAND:
case BOR:
case BXOR:
case BAND:
case STRICT_EQUAL:
case STRICT_NOT_EQUAL:
case NOT_EQUAL:
case EQUAL:
case LT:
case GT:
case LE:
case GE:
case INSTANCEOF:
case SL:
case SR:
case BSR:
case DIV:
case MOD:
case SL_COMMENT:
case ML_COMMENT:
case 175:
case 176:
case 177:
case 180:
case 181:
case 182:
case 183:
case 184:
case 185:
case 186:
{
alt83 = 2;
}
break;
}
}
switch (alt83)
{
case 1 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1445:6: iin= INC
{
iin = (CommonToken)input.LT(1);
Match(input,INC,FOLLOW_INC_in_postfixExpression5164); if (failed) return retval;
if ( backtracking==0 ) stream_INC.Add(iin);
if ( backtracking == 0 )
{
buffer.Append(iin.Text);
}
// AST REWRITE
// elements: postfixExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1445:43: -> ^( POST_INC[$iin] $postfixExpression)
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1445:46: ^( POST_INC[$iin] $postfixExpression)
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(POST_INC, iin), root_1);
adaptor.AddChild(root_1, stream_retval.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
case 2 :
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1446:6: dde= DEC
{
dde = (CommonToken)input.LT(1);
Match(input,DEC,FOLLOW_DEC_in_postfixExpression5185); if (failed) return retval;
if ( backtracking==0 ) stream_DEC.Add(dde);
if ( backtracking == 0 )
{
buffer.Append(dde.Text);
}
// AST REWRITE
// elements: postfixExpression
// token labels:
// rule labels: retval
// token list labels:
// rule list labels:
if ( backtracking==0 ) {
retval.tree = root_0;
RewriteRuleSubtreeStream stream_retval = new RewriteRuleSubtreeStream(adaptor, "token retval", (retval!=null ? retval.Tree : null));
root_0 = (CommonTree)adaptor.GetNilNode();
// 1446:43: -> ^( POST_DEC[$dde] $postfixExpression)
{
// C:\\Users\\sephiroth\\Documents\\Visual Studio 2005\\Projects\\CodeReformatter\\CodeReformatter\\AS.g:1446:46: ^( POST_DEC[$dde] $postfixExpression)
{
CommonTree root_1 = (CommonTree)adaptor.GetNilNode();
root_1 = (CommonTree)adaptor.BecomeRoot(adaptor.Create(POST_DEC, dde), root_1);
adaptor.AddChild(root_1, stream_retval.Next());
adaptor.AddChild(root_0, root_1);
}
}
}
}
break;
}
}
retval.stop = input.LT(-1);
if ( backtracking==0 )
{ retval.tree = (CommonTree)adaptor.RulePostProcessing(root_0);
adaptor.SetTokenBoundaries(retval.Tree, retval.start, retval.stop);
}
}
catch (NoViableAltException e)
{
Debug.WriteLine("NoValiable alt: token=" + e.Token + " (decision=" + e.decisionNumber + " state " + e.stateNumber + ")" + " decision=<<" + e.grammarDecisionDescription + ">>");
throw e;
}
catch (MismatchedTokenException e)
{
Debug.WriteLine("[" + e.Line + ":" + e.Index + "]: " + e.Message + ". Unexpected " + e.UnexpectedType.ToString() + "( expecting: "+ e.expecting + " )");
throw e;
}
catch(RecognitionException e)
{
Debug.WriteLine("RecognitionException: " + e);
throw e;
}
finally
{
if ( backtracking > 0 )
{
Memoize(input, 110, postfixExpression_StartIndex);
}
}
return retval;
}
