diff --git a/ShowBuildMenu.bat b/ShowBuildMenu.bat
index 8f5faa1007f..72a5861bac0 100644
--- a/ShowBuildMenu.bat
+++ b/ShowBuildMenu.bat
@@ -22,9 +22,6 @@ echo E. Build NHibernate (Debug)
 echo F. Build NHibernate (Release)
 echo G. Build Release Package (Also runs tests and creates documentation)
 echo.
-echo --- GRAMMAR ---
-echo H. Grammar operations (related to Hql.g and HqlSqlWalker.g)
-echo.
 echo --- TeamCity (CI) build options
 echo I. TeamCity build menu
 echo.
@@ -32,10 +29,9 @@ echo --- Exit ---
 echo X. Make the beautiful build menu go away.
 echo.
 
-%BUILDTOOL% prompt ABCDEFGHIX
-if errorlevel 9 goto end
-if errorlevel 8 goto teamcity-menu
-if errorlevel 7 goto grammar-menu
+%BUILDTOOL% prompt ABCDEFGIX
+if errorlevel 8 goto end
+if errorlevel 7 goto teamcity-menu
 if errorlevel 6 goto build-release-package
 if errorlevel 5 goto build-release
 if errorlevel 4 goto build-debug
@@ -194,77 +190,6 @@ echo including NuGet packages and tools to push them.
 echo.
 goto main-menu
 
-:grammar-menu
-echo.
-echo --- GRAMMAR ---
-echo A. Regenerate all grammars.
-echo        Hql.g           to  HqlLexer.cs
-echo        Hql.g           to  HqlParser.cs
-echo        HqlSqlWalker.g  to  HqlSqlWalker.cs
-echo        SqlGenerator.g  to  SqlGenerator.cs
-echo B. Regenerate all grammars, with Hql.g in debug mode.
-echo C. Regenerate all grammars, with HqlSqlWalker.g in debug mode.
-echo D. Regenerate all grammars, with SqlGenerator.g in debug mode.
-echo E. Quick instructions on using debug mode.
-echo.
-echo X. Exit to main menu.
-echo.
-
-%BUILDTOOL% prompt ABCDEX
-if errorlevel 5 goto main-menu
-if errorlevel 4 goto antlr-debug
-if errorlevel 3 goto antlr-sqlgenerator-debug
-if errorlevel 2 goto antlr-hqlsqlwalker-debug
-if errorlevel 1 goto antlr-hql-debug
-if errorlevel 0 goto antlr-all
-
-:antlr-all
-echo *** Regenerating from Hql.g
-call src\NHibernate\Hql\Ast\ANTLR\AntlrHql.bat
-echo *** Regenerating from HqlSqlWalker.g
-call src\NHibernate\Hql\Ast\ANTLR\AntlrHqlSqlWalker.bat
-echo *** Regenerating from SqlGenerator.g
-call src\NHibernate\Hql\Ast\ANTLR\AntlrSqlGenerator.bat
-goto main-menu
-
-:antlr-hql-debug
-echo *** Regenerating from Hql.g (Debug Enabled)
-call src\NHibernate\Hql\Ast\ANTLR\AntlrHqlDebug.bat
-echo *** Regenerating from HqlSqlWalker.g
-call src\NHibernate\Hql\Ast\ANTLR\AntlrHqlSqlWalker.bat
-echo *** Regenerating from SqlGenerator.g
-call src\NHibernate\Hql\Ast\ANTLR\AntlrSqlGenerator.bat
-goto main-menu
-
-:antlr-hqlsqlwalker-debug
-echo *** Regenerating from Hql.g
-call src\NHibernate\Hql\Ast\ANTLR\AntlrHql.bat
-echo *** Regenerating from HqlSqlWalker.g (Debug Enabled)
-call src\NHibernate\Hql\Ast\ANTLR\AntlrHqlSqlWalkerDebug.bat
-echo *** Regenerating from SqlGenerator.g
-call src\NHibernate\Hql\Ast\ANTLR\AntlrSqlGenerator.bat
-goto main-menu
-
-:antlr-sqlgenerator-debug
-echo *** Regenerating from Hql.g
-call src\NHibernate\Hql\Ast\ANTLR\AntlrHql.bat
-echo *** Regenerating from HqlSqlWalker.g
-call src\NHibernate\Hql\Ast\ANTLR\AntlrHqlSqlWalker.bat
-echo *** Regenerating from SqlGenerator.g (Debug Enabled)
-call src\NHibernate\Hql\Ast\ANTLR\AntlrSqlGeneratorDebug.bat
-goto main-menu
-
-:antlr-debug
-echo To use the debug grammar:
-echo   1. Create a unit test that runs the hql parser on the input you're interested in.
-echo       The one you want to debug must be the first grammar parsed.
-echo   2. Run the unit test.  It will appear to stall.
-echo   3. Download and run AntlrWorks (java -jar AntlrWorks.jar).
-echo   4. Open the grammar you intend to debug in AntlrWorks.
-echo   5. Choose "Debug Remote" and accept the default port.
-echo   6. You should now be connected and able to step through your grammar.
-goto main-menu
-
 :teamcity-menu
 echo.
 echo --- TeamCity (CI) build options
diff --git a/Tools/Antlr/Antlr3.Runtime.Debug.dll b/Tools/Antlr/Antlr3.Runtime.Debug.dll
deleted file mode 100644
index ed0b1059752..00000000000
Binary files a/Tools/Antlr/Antlr3.Runtime.Debug.dll and /dev/null differ
diff --git a/Tools/Antlr/Antlr3.Runtime.dll b/Tools/Antlr/Antlr3.Runtime.dll
deleted file mode 100644
index b963933d5f7..00000000000
Binary files a/Tools/Antlr/Antlr3.Runtime.dll and /dev/null differ
diff --git a/Tools/Antlr/Antlr3.exe b/Tools/Antlr/Antlr3.exe
deleted file mode 100644
index e360d807943..00000000000
Binary files a/Tools/Antlr/Antlr3.exe and /dev/null differ
diff --git a/Tools/Antlr/Antlr3.exe.config b/Tools/Antlr/Antlr3.exe.config
deleted file mode 100644
index 450518ad32d..00000000000
--- a/Tools/Antlr/Antlr3.exe.config
+++ /dev/null
@@ -1,7 +0,0 @@
-<?xml version="1.0"?>
-<configuration>
-	<startup>
-		<supportedRuntime version="v4.0" sku=".NETFramework,Version=v4.0,Profile=Client"/>
-		<supportedRuntime version="v2.0.50727" sku="Client"/>
-	</startup>
-</configuration>
diff --git a/Tools/Antlr/Antlr3.targets b/Tools/Antlr/Antlr3.targets
deleted file mode 100644
index c5f5c70da10..00000000000
--- a/Tools/Antlr/Antlr3.targets
+++ /dev/null
@@ -1,169 +0,0 @@
-<!--
-   [The "BSD licence"]
-   Copyright (c) 2011 Sam Harwell
-   All rights reserved.
-
-   Redistribution and use in source and binary forms, with or without
-   modification, are permitted provided that the following conditions
-   are met:
-   1. Redistributions of source code must retain the above copyright
-      notice, this list of conditions and the following disclaimer.
-   2. Redistributions in binary form must reproduce the above copyright
-      notice, this list of conditions and the following disclaimer in the
-      documentation and/or other materials provided with the distribution.
-   3. The name of the author may not be used to endorse or promote products
-      derived from this software without specific prior written permission.
-
-   THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
-   IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
-   OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
-   IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
-   INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
-   NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
-   THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--->
-<Project xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
-  <PropertyGroup>
-    <BuildSystem>MSBuild</BuildSystem>
-    <TaskVersion>3.5.0.2</TaskVersion>
-    <TaskKeyToken>eb42632606e9261f</TaskKeyToken>
-    <AntlrBuildTaskAssemblyName Condition="'$(AntlrBuildTaskAssemblyName)'==''">AntlrBuildTask, Version=$(TaskVersion), Culture=neutral, PublicKeyToken=$(TaskKeyToken)</AntlrBuildTaskAssemblyName>
-  </PropertyGroup>
-
-  <PropertyGroup>
-    <LoadTimeSensitiveTargets>
-      $(LoadTimeSensitiveTargets);
-      AntlrCompile;
-    </LoadTimeSensitiveTargets>
-    <LoadTimeSensitiveProperties>
-      $(LoadTimeSensitiveProperties);
-      AntlrCompileDependsOn;
-    </LoadTimeSensitiveProperties>
-  </PropertyGroup>
-
-  <PropertyGroup>
-    <AntlrBuildTaskLocation Condition="'$(AntlrBuildTaskPath)'==''">$(MSBuildBinPath)</AntlrBuildTaskLocation>
-    <AntlrBuildTaskLocation Condition="'$(AntlrBuildTaskPath)'!=''">$(AntlrBuildTaskPath)</AntlrBuildTaskLocation>
-    <AntlrToolLocation Condition="'$(AntlrToolPath)'==''">$(MSBuildBinPath)\Antlr3\Antlr3.exe</AntlrToolLocation>
-    <AntlrToolLocation Condition="'$(AntlrToolPath)'!=''">$(AntlrToolPath)</AntlrToolLocation>
-  </PropertyGroup>
-
-  <PropertyGroup>
-    <AntlrGenCodeFileNames Condition="'$(AntlrGenCodeFileNames)'==''">$(MSBuildProjectFile).AntlrGeneratedCodeFileListAbsolute.txt</AntlrGenCodeFileNames>
-  </PropertyGroup>
-
-  <UsingTask Condition="'$(AntlrBuildTaskPath)'==''" TaskName="Antlr3.Build.Tasks.AntlrClassGenerationTask" AssemblyName="$(AntlrBuildTaskAssemblyName)" />
-  <UsingTask Condition="'$(AntlrBuildTaskPath)'!=''" TaskName="Antlr3.Build.Tasks.AntlrClassGenerationTask" AssemblyFile="$(AntlrBuildTaskPath)\AntlrBuildTask.dll" />
-
-  <PropertyGroup>
-    <PrepareResourcesDependsOn>
-      AntlrCompile;
-      AntlrCompileAddFilesGenerated;
-      $(PrepareResourcesDependsOn)
-    </PrepareResourcesDependsOn>
-  </PropertyGroup>
-
-  <PropertyGroup>
-    <AntlrCompileDependsOn>
-      AntlrCompileReadGeneratedFileList
-    </AntlrCompileDependsOn>
-  </PropertyGroup>
-
-  <ItemGroup Condition="'$(BuildingInsideVisualStudio)'=='true'">
-    <AvailableItemName Include="Antlr3" />
-    <AvailableItemName Include="AntlrTokens" />
-    <AvailableItemName Include="AntlrAbstractGrammar" />
-  </ItemGroup>
-
-  <ItemDefinitionGroup>
-    <Antlr3>
-      <Generator>MSBuild:Compile</Generator>
-      <TargetLanguage/>
-      <DebugGrammar>false</DebugGrammar>
-      <ProfileGrammar>false</ProfileGrammar>
-    </Antlr3>
-  </ItemDefinitionGroup>
-
-  <Target Name="AntlrCompileReadGeneratedFileList">
-    <ReadLinesFromFile File="$(IntermediateOutputPath)$(AntlrGenCodeFileNames)">
-      <Output TaskParameter="Lines" ItemName="AntlrOutputCodeFilesList"/>
-    </ReadLinesFromFile>
-  </Target>
-
-  <PropertyGroup>
-    <!-- Add grammar compilation to the CoreCompileDependsOn so that the IDE inproc compilers (particularly VB)
-         can "see" the generated source files. -->
-    <CoreCompileDependsOn Condition="'$(BuildingInsideVisualStudio)' == 'true' ">
-      DesignTimeGrammarCompilation;
-      $(CoreCompileDependsOn)
-    </CoreCompileDependsOn>
-  </PropertyGroup>
-
-  <Target Name="DesignTimeGrammarCompilation">
-    <!-- Only if we are not actually performing a compile i.e. we are in design mode -->
-    <CallTarget Condition="'$(BuildingProject)' != 'true'"
-                Targets="AntlrCompile" />
-  </Target>
-
-  <Target Name="AntlrCompile"
-          DependsOnTargets="$(AntlrCompileDependsOn)"
-          Condition="'@(Antlr3)' != ''"
-          Inputs="@(Antlr3);@(AntlrTokens);@(AntlrAbstractGrammar)"
-          Outputs="@(AntlrOutputCodeFilesList);
-                  $(IntermediateOutputPath)$(AntlrGenCodeFileNames);">
-
-    <ItemGroup>
-      <AntlrGeneratedCodeFiles Remove="@(AntlrGeneratedCodeFiles)" />
-    </ItemGroup>
-
-    <PropertyGroup>
-      <_IntellisenseOnlyCompile>false</_IntellisenseOnlyCompile>
-      <_IntellisenseOnlyCompile Condition="'$(BuildingProject)' != 'true'">true</_IntellisenseOnlyCompile>
-    </PropertyGroup>
-    <AntlrClassGenerationTask
-      AntlrToolPath="$(AntlrToolLocation)"
-      BuildTaskPath="$(AntlrBuildTaskLocation)"
-      OutputPath="$(IntermediateOutputPath)"
-      TargetLanguage="%(Antlr3.TargetLanguage)"
-      SourceCodeFiles="@(Antlr3)"
-      ContinueOnError="$(_IntellisenseOnlyCompile)"
-      TokensFiles="@(AntlrTokens)"
-      AbstractGrammarFiles="@(AntlrAbstractGrammar)"
-      LanguageSourceExtensions="$(DefaultLanguageSourceExtension)"
-      DebugGrammar="%(Antlr3.DebugGrammar)"
-      ProfileGrammar="%(Antlr3.ProfileGrammar)">
-
-      <Output ItemName="AntlrGeneratedCodeFiles" TaskParameter="GeneratedCodeFiles" />
-    </AntlrClassGenerationTask>
-
-    <WriteLinesToFile
-      Condition="'$(_IntellisenseOnlyCompile)' != 'true'"
-      File="$(IntermediateOutputPath)$(AntlrGenCodeFileNames)"
-      Lines="@(AntlrGeneratedCodeFiles)"
-      Overwrite="true"/>
-  </Target>
-
-  <Target Name="AntlrCompileAddFilesGenerated"
-          AfterTargets="AntlrCompile"
-          Condition="'@(Antlr3)' != ''">
-
-    <ItemGroup>
-      <AntlrGeneratedCodeFiles Condition="'@(AntlrGeneratedCodeFiles)' == ''" Include="@(AntlrOutputCodeFilesList)" />
-    </ItemGroup>
-
-    <ItemGroup>
-      <FileWrites Include="@(AntlrGeneratedCodeFiles);
-                           $(IntermediateOutputPath)$(AntlrGenCodeFileNames);" />
-    </ItemGroup>
-
-    <ItemGroup>
-      <Compile Include="@(AntlrGeneratedCodeFiles)" />
-      <!-- The WinFX "GenerateTemporaryTargetAssembly" target requires generated code files be added here. -->
-      <_GeneratedCodeFiles Include="@(AntlrGeneratedCodeFiles)" />
-    </ItemGroup>
-
-  </Target>
-</Project>
diff --git a/Tools/Antlr/Antlr4.StringTemplate.Visualizer.dll b/Tools/Antlr/Antlr4.StringTemplate.Visualizer.dll
deleted file mode 100644
index 42d4df5a440..00000000000
Binary files a/Tools/Antlr/Antlr4.StringTemplate.Visualizer.dll and /dev/null differ
diff --git a/Tools/Antlr/Antlr4.StringTemplate.dll b/Tools/Antlr/Antlr4.StringTemplate.dll
deleted file mode 100644
index 88b210ceecc..00000000000
Binary files a/Tools/Antlr/Antlr4.StringTemplate.dll and /dev/null differ
diff --git a/Tools/Antlr/AntlrBuildTask.dll b/Tools/Antlr/AntlrBuildTask.dll
deleted file mode 100644
index 4341c7465e2..00000000000
Binary files a/Tools/Antlr/AntlrBuildTask.dll and /dev/null differ
diff --git a/Tools/Antlr/Codegen/Templates/CSharp2/AST.stg b/Tools/Antlr/Codegen/Templates/CSharp2/AST.stg
deleted file mode 100644
index a94ed7c4b22..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp2/AST.stg
+++ /dev/null
@@ -1,430 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2007-2008 Johannes Luber
- * Copyright (c) 2005-2007 Kunle Odutola
- * Copyright (c) 2011 Sam Harwell
- * Copyright (c) 2011 Terence Parr
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-@outputFile.imports() ::= <<
-<@super.imports()>
-
-<if(!TREE_PARSER)>
-<! tree parser would already have imported !>
-using Antlr.Runtime.Tree;
-using RewriteRuleITokenStream = Antlr.Runtime.Tree.RewriteRuleTokenStream;
-<endif>
->>
-
-@genericParser.members() ::= <<
-<@super.members()>
-<parserMembers()>
->>
-
-parserCtorBody() ::= <%
-<super.parserCtorBody()><\n>
-TreeAdaptor = 
-<if(actions.(actionScope).treeAdaptorInitializer)>
-	<actions.(actionScope).treeAdaptorInitializer>
-<else>
-	new <actions.(actionScope).treeAdaptorType; null="CommonTreeAdaptor">()
-<end>
-;
-%>
-
-/** Add an adaptor property that knows how to build trees */
-parserMembers() ::= <<
-private <treeAdaptorType()> adaptor;
-
-public <treeAdaptorType()> TreeAdaptor
-{
-	get
-	{
-		return adaptor;
-	}
-
-	set
-	{
-		this.adaptor = value;
-		<grammar.directDelegates:{g|<g:delegateName()>.TreeAdaptor = this.adaptor;}>
-	}
-}
->>
-
-treeAdaptorType() ::= <<
-<actions.(actionScope).treeAdaptorType; null="ITreeAdaptor">
->>
-
-ruleReturnBaseType() ::= <%
-Ast<if(TREE_PARSER)>Tree<else>Parser<endif>RuleReturnScope\<<ASTLabelType>, <labelType>>
-%>
-
-/** Add a variable to track rule's return AST */
-ruleDeclarations() ::= <<
-<super.ruleDeclarations()>
-<ASTLabelType> root_0 = default(<ASTLabelType>);<\n>
->>
-
-ruleLabelDefs() ::= <<
-<super.ruleLabelDefs()>
-<[ruleDescriptor.tokenLabels,ruleDescriptor.wildcardTreeLabels,ruleDescriptor.wildcardTreeListLabels]
-	:{it|<ASTLabelType> <it.label.text>_tree = default(<ASTLabelType>);}; separator="\n">
-<ruleDescriptor.tokenListLabels:{it|<ASTLabelType> <it.label.text>_tree = default(<ASTLabelType>);}; separator="\n">
-<ruleDescriptor.allTokenRefsInAltsWithRewrites
-	:{it|RewriteRule<rewriteElementType>Stream stream_<it>=new RewriteRule<rewriteElementType>Stream(adaptor,"token <it>");}; separator="\n">
-<ruleDescriptor.allRuleRefsInAltsWithRewrites
-	:{it|RewriteRuleSubtreeStream stream_<it>=new RewriteRuleSubtreeStream(adaptor,"rule <it>");}; separator="\n">
->>
-
-/** When doing auto AST construction, we must define some variables;
- *  These should be turned off if doing rewrites.  This must be a "mode"
- *  as a rule could have both rewrite and AST within the same alternative
- *  block.
- */
-@alt.declarations() ::= <<
-<if(autoAST)>
-<if(outerAlt)>
-<if(!rewriteMode)>
-root_0 = (<ASTLabelType>)adaptor.Nil();
-<endif>
-<endif>
-<endif>
->>
-
-// T r a c k i n g  R u l e  E l e m e n t s
-
-/** ID and track it for use in a rewrite rule */
-tokenRefTrack(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRefBang(...)> <! Track implies no auto AST construction!>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>stream_<token>.Add(<label>);<\n>
->>
-
-/** ids+=ID and track it for use in a rewrite rule; adds to ids *and*
- *  to the tracking list stream_ID for use in the rewrite.
- */
-tokenRefTrackAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRefTrack(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** ^(ID ...) track for rewrite */
-tokenRefRuleRootTrack(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRefBang(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>stream_<token>.Add(<label>);
->>
-
-/** Match ^(label+=TOKEN ...) track for rewrite */
-tokenRefRuleRootTrackAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRefRuleRootTrack(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** rule when output=AST and tracking for rewrite */
-ruleRefTrack(rule,label,elementIndex,args,scope) ::= <<
-<super.ruleRef(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>stream_<rule.name>.Add(<label>.Tree);
->>
-
-/** x+=rule when output=AST and tracking for rewrite */
-ruleRefTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRefTrack(...)>
-<listLabelElem(elem={<label>.Tree},elemType=ASTLabelType,...)>
->>
-
-/** ^(rule ...) rewrite */
-ruleRefRuleRootTrack(rule,label,elementIndex,args,scope) ::= <<
-<ruleRefRuleRoot(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>stream_<rule>.Add(<label>.Tree);
->>
-
-/** ^(x+=rule ...) rewrite */
-ruleRefRuleRootTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRefRuleRootTrack(...)>
-<listLabelElem(elem={<label>.Tree},elemType=ASTLabelType,...)>
->>
-
-// R e w r i t e
-
-rewriteCode(
-	alts, description,
-	referencedElementsDeep, // ALL referenced elements to right of ->
-	referencedTokenLabels,
-	referencedTokenListLabels,
-	referencedRuleLabels,
-	referencedRuleListLabels,
-	referencedWildcardLabels,
-	referencedWildcardListLabels,
-	rewriteBlockLevel, enclosingTreeLevel, treeLevel) ::= <<
-<\n>{
-// AST REWRITE
-// elements: <referencedElementsDeep; separator=", ">
-// token labels: <referencedTokenLabels; separator=", ">
-// rule labels: <referencedRuleLabels; separator=", ">
-// token list labels: <referencedTokenListLabels; separator=", ">
-// rule list labels: <referencedRuleListLabels; separator=", ">
-// wildcard labels: <[referencedWildcardLabels,referencedWildcardListLabels]; separator=", ">
-<if(backtracking)>
-if (<actions.(actionScope).synpredgate>) {
-<endif>
-<prevRuleRootRef()>.Tree = root_0;
-<rewriteCodeLabels()>
-root_0 = (<ASTLabelType>)adaptor.Nil();
-<alts:rewriteAlt(); separator="else ">
-<! if tree parser and rewrite=true !>
-<if(TREE_PARSER&&rewriteMode)>
-<prevRuleRootRef()>.Tree = (<ASTLabelType>)adaptor.RulePostProcessing(root_0);
-if (<prevRuleRootRef()>.Tree != null)
-	input.ReplaceChildren(adaptor.GetParent(retval.Start), adaptor.GetChildIndex(retval.Start), adaptor.GetChildIndex(_last), retval.Tree);
-<endif>
-<! if parser or tree-parser && rewrite!=true, we need to set result !>
-<if(!TREE_PARSER||!rewriteMode)>
-<prevRuleRootRef()>.Tree = root_0;
-<endif>
-<if(backtracking)>
-}
-<endif>
-}
-
->>
-
-rewriteCodeLabels() ::= <<
-<referencedTokenLabels
-    :{it|RewriteRule<rewriteElementType>Stream stream_<it>=new RewriteRule<rewriteElementType>Stream(adaptor,"token <it>",<it>);};
-    separator="\n"
->
-<referencedTokenListLabels
-    :{it|RewriteRule<rewriteElementType>Stream stream_<it>=new RewriteRule<rewriteElementType>Stream(adaptor,"token <it>", list_<it>);};
-    separator="\n"
->
-<referencedWildcardLabels
-	:{it|RewriteRuleSubtreeStream stream_<it>=new RewriteRuleSubtreeStream(adaptor,"wildcard <it>",<it>);};
-	separator="\n"
->
-<referencedWildcardListLabels
-	:{it|RewriteRuleSubtreeStream stream_<it>=new RewriteRuleSubtreeStream(adaptor,"wildcard <it>",list_<it>);};
-	separator="\n"
->
-<referencedRuleLabels
-    :{it|RewriteRuleSubtreeStream stream_<it>=new RewriteRuleSubtreeStream(adaptor,"rule <it>",<it>!=null?<it>.Tree:null);};
-    separator="\n"
->
-<referencedRuleListLabels
-    :{it|RewriteRuleSubtreeStream stream_<it>=new RewriteRuleSubtreeStream(adaptor,"token <it>",list_<it>);};
-    separator="\n"
->
->>
-
-/** Generate code for an optional rewrite block; note it uses the deep ref'd element
-  *  list rather shallow like other blocks.
-  */
-rewriteOptionalBlock(
-	alt,rewriteBlockLevel,
-	referencedElementsDeep, // all nested refs
-	referencedElements, // elements in immediately block; no nested blocks
-	description) ::=
-<<
-// <fileName>:<description>
-if (<referencedElementsDeep:{el | stream_<el>.HasNext}; separator="||">)
-{
-	<alt>
-}
-<referencedElementsDeep:{el | stream_<el>.Reset();<\n>}>
->>
-
-rewriteClosureBlock(
-	alt,rewriteBlockLevel,
-	referencedElementsDeep, // all nested refs
-	referencedElements, // elements in immediately block; no nested blocks
-	description) ::=
-<<
-// <fileName>:<description>
-while ( <referencedElements:{el | stream_<el>.HasNext}; separator="||"> )
-{
-	<alt>
-}
-<referencedElements:{el | stream_<el>.Reset();<\n>}>
->>
-
-rewritePositiveClosureBlock(
-	alt,rewriteBlockLevel,
-	referencedElementsDeep, // all nested refs
-	referencedElements, // elements in immediately block; no nested blocks
-	description) ::=
-<<
-if (!(<referencedElements:{el | stream_<el>.HasNext}; separator="||">))
-{
-	throw new RewriteEarlyExitException();
-}
-while ( <referencedElements:{el | stream_<el>.HasNext}; separator="||"> )
-{
-	<alt>
-}
-<referencedElements:{el | stream_<el>.Reset();<\n>}>
->>
-
-rewriteAlt(a) ::= <<
-// <a.description>
-<if(a.pred)>
-if (<a.pred>)
-{
-	<a.alt>
-}
-<else>
-{
-	<a.alt>
-}
-<endif>
->>
-
-/** For empty rewrites: "r : ... -> ;" */
-rewriteEmptyAlt() ::= "root_0 = null;"
-
-rewriteTree(root,children,description,enclosingTreeLevel,treeLevel) ::= <<
-// <fileName>:<description>
-{
-<ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.Nil();
-<root:rewriteElement()>
-<children:rewriteElement()>
-adaptor.AddChild(root_<enclosingTreeLevel>, root_<treeLevel>);
-}<\n>
->>
-
-rewriteElementList(elements) ::= "<elements:rewriteElement()>"
-
-rewriteElement(e) ::= <%
-<@pregen()>
-DebugLocation(<e.line>, <e.pos>);<\n>
-<e.el>
-%>
-
-/** Gen ID or ID[args] */
-rewriteTokenRef(token,elementIndex,args,terminalOptions={}) ::= <<
-adaptor.AddChild(root_<treeLevel>, <createRewriteNodeFromElement(...)>);<\n>
->>
-
-/** Gen $label ... where defined via label=ID */
-rewriteTokenLabelRef(label,elementIndex) ::= <<
-adaptor.AddChild(root_<treeLevel>, stream_<label>.NextNode());<\n>
->>
-
-/** Gen $label ... where defined via label+=ID */
-rewriteTokenListLabelRef(label,elementIndex) ::= <<
-adaptor.AddChild(root_<treeLevel>, stream_<label>.NextNode());<\n>
->>
-
-/** Gen ^($label ...) */
-rewriteTokenLabelRefRoot(label,elementIndex) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.NextNode(), root_<treeLevel>);<\n>
->>
-
-/** Gen ^($label ...) where label+=... */
-rewriteTokenListLabelRefRoot ::= rewriteTokenLabelRefRoot
-
-/** Gen ^(ID ...) or ^(ID[args] ...) */
-rewriteTokenRefRoot(token,elementIndex,args,terminalOptions={}) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<createRewriteNodeFromElement(...)>, root_<treeLevel>);<\n>
->>
-
-rewriteImaginaryTokenRef(args,token,elementIndex,terminalOptions={}) ::= <<
-adaptor.AddChild(root_<treeLevel>, <createImaginaryNode(tokenType=token, ...)>);<\n>
->>
-
-rewriteImaginaryTokenRefRoot(args,token,elementIndex,terminalOptions={}) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<createImaginaryNode(tokenType=token, ...)>, root_<treeLevel>);<\n>
->>
-
-/** plain -> {foo} action */
-rewriteAction(action) ::= <<
-root_0 = <action>;<\n>
->>
-
-/** What is the name of the previous value of this rule's root tree?  This
- *  let's us refer to $rule to mean previous value.  I am reusing the
- *  variable 'tree' sitting in retval struct to hold the value of root_0 right
- *  before I set it during rewrites.  The assign will be to retval.tree.
- */
-prevRuleRootRef() ::= "retval"
-
-rewriteRuleRef(rule) ::= <<
-adaptor.AddChild(root_<treeLevel>, stream_<rule>.NextTree());<\n>
->>
-
-rewriteRuleRefRoot(rule) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<rule>.NextNode(), root_<treeLevel>);<\n>
->>
-
-rewriteNodeAction(action) ::= <<
-adaptor.AddChild(root_<treeLevel>, <action>);<\n>
->>
-
-rewriteNodeActionRoot(action) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<action>, root_<treeLevel>);<\n>
->>
-
-/** Gen $ruleLabel ... where defined via ruleLabel=rule */
-rewriteRuleLabelRef(label) ::= <<
-adaptor.AddChild(root_<treeLevel>, stream_<label>.NextTree());<\n>
->>
-
-/** Gen $ruleLabel ... where defined via ruleLabel+=rule */
-rewriteRuleListLabelRef(label) ::= <<
-adaptor.AddChild(root_<treeLevel>, stream_<label>.NextTree());<\n>
->>
-
-/** Gen ^($ruleLabel ...) where ruleLabel=rule */
-rewriteRuleLabelRefRoot(label) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.NextNode(), root_<treeLevel>);<\n>
->>
-
-/** Gen ^($ruleLabel ...) where ruleLabel+=rule */
-rewriteRuleListLabelRefRoot(label) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.NextNode(), root_<treeLevel>);<\n>
->>
-
-rewriteWildcardLabelRef(label) ::= <<
-adaptor.AddChild(root_<treeLevel>, stream_<label>.NextTree());<\n>
->>
-
-createImaginaryNode(tokenType,args,terminalOptions={}) ::= <%
-<if(terminalOptions.node)>
-<! new MethodNode(IDLabel, args) !>
-new <terminalOptions.node>(<tokenType><if(args)>, <args; separator=", "><endif>)
-<else>
-(<ASTLabelType>)adaptor.Create(<tokenType>, <args; separator=", "><if(!args)>"<tokenType>"<endif>)
-<endif>
-%>
-
-createRewriteNodeFromElement(token,args,terminalOptions={}) ::= <%
-<if(terminalOptions.node)>
-new <terminalOptions.node>(stream_<token>.NextToken()<if(args)>, <args; separator=", "><endif>)
-<else>
-<if(args)> <! must create new node from old !>
-adaptor.Create(<token>, <args; separator=", ">)
-<else>
-stream_<token>.NextNode()
-<endif>
-<endif>
-%>
diff --git a/Tools/Antlr/Codegen/Templates/CSharp2/ASTDbg.stg b/Tools/Antlr/Codegen/Templates/CSharp2/ASTDbg.stg
deleted file mode 100644
index e7b29042935..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp2/ASTDbg.stg
+++ /dev/null
@@ -1,94 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2007-2008 Johannes Luber
- * Copyright (c) 2005-2007 Kunle Odutola
- * Copyright (c) 2005 Terence Parr
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-/** Template overrides to add debugging to AST stuff.  Dynamic inheritance
- *  hierarchy is set up as ASTDbg : AST : Dbg : Java by code generator.
- */
-
-parserMembers() ::= <<
-	protected DebugTreeAdaptor adaptor;
-
-	public ITreeAdaptor TreeAdaptor
-	{
-		get
-		{
-			return adaptor;
-		}
-		set
-		{
-<if(grammar.grammarIsRoot)>
-			this.adaptor = new DebugTreeAdaptor(dbg,adaptor);
-<else>
-			this.adaptor = (DebugTreeAdaptor)adaptor; // delegator sends dbg adaptor
-<endif><\n>
-			<grammar.directDelegates:{g|<g:delegateName()>.TreeAdaptor = this.adaptor;}>
-		}
-	}<\n>
->>
-
-parserCtorBody() ::= <<
-<super.parserCtorBody()>
->>
-
-createListenerAndHandshake() ::= <<
-DebugEventSocketProxy proxy = new DebugEventSocketProxy( this, port, <if(TREE_PARSER)>input.TreeAdaptor<else>adaptor<endif> );
-DebugListener = proxy;
-<inputStreamType> = new Debug<inputStreamType>( input, proxy );
-try
-{
-	proxy.Handshake();
-}
-catch ( IOException ioe )
-{
-	ReportError( ioe );
-}
->>
-
-@ctorForRootGrammar.finally() ::= <<
-ITreeAdaptor adap = new CommonTreeAdaptor();
-TreeAdaptor = adap;
-proxy.TreeAdaptor = adap;
->>
-
-@ctorForProfilingRootGrammar.finally() ::=<<
-ITreeAdaptor adap = new CommonTreeAdaptor();
-TreeAdaptor = adap;
->>
-
-@ctorForPredefinedListener.superClassRef() ::= ": base( input, dbg )"
-
-@ctorForPredefinedListener.finally() ::=<<
-<if(grammar.grammarIsRoot)><! don't create new adaptor for delegates !>
-ITreeAdaptor adap = new CommonTreeAdaptor();
-TreeAdaptor = adap;<\n>
-<endif>
->>
-
-//@rewriteElement.pregen() ::= "dbg.Location( <e.line>, <e.pos> );"
diff --git a/Tools/Antlr/Codegen/Templates/CSharp2/ASTParser.stg b/Tools/Antlr/Codegen/Templates/CSharp2/ASTParser.stg
deleted file mode 100644
index 1585287e363..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp2/ASTParser.stg
+++ /dev/null
@@ -1,192 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2007-2008 Johannes Luber
- * Copyright (c) 2005-2007 Kunle Odutola
- * Copyright (c) 2011 Sam Harwell
- * Copyright (c) 2011 Terence Parr
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-/** Templates for building ASTs during normal parsing.
- *
- *  Deal with many combinations.  Dimensions are:
- *  Auto build or rewrite
- *    no label, label, list label  (label/no-label handled together)
- *    child, root
- *    token, set, rule, wildcard
- *
- *  The situation is not too bad as rewrite (->) usage makes ^ and !
- *  invalid. There is no huge explosion of combinations.
- */
-
-@rule.setErrorReturnValue() ::= <<
-retval.Tree = (<ASTLabelType>)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-<! System.out.WriteLine("<ruleName> returns "+((CommonTree)retval.tree).toStringTree()); !>
->>
-
-// TOKEN AST STUFF
-
-/** ID and output=AST */
-tokenRef(token,label,elementIndex,terminalOptions={}) ::= <<
-<super.tokenRef(...)>
-<if(backtracking)>if (state.backtracking == 0) {<endif>
-<label>_tree = <createNodeFromToken(...)>;
-adaptor.AddChild(root_0, <label>_tree);
-<if(backtracking)>}<endif>
->>
-
-/** ID! and output=AST (same as plain tokenRef) */
-tokenRefBang(token,label,elementIndex) ::= "<super.tokenRef(...)>"
-
-/** ID^ and output=AST */
-tokenRefRuleRoot(token,label,elementIndex,terminalOptions={}) ::= <<
-<super.tokenRef(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<label>_tree = <createNodeFromToken(...)>;
-root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_0);
-<if(backtracking)>}<endif>
->>
-
-/** ids+=ID! and output=AST */
-tokenRefBangAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRefBang(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** label+=TOKEN when output=AST but not rewrite alt */
-tokenRefAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRef(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** Match label+=TOKEN^ when output=AST but not rewrite alt */
-tokenRefRuleRootAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRefRuleRoot(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-// SET AST
-
-// the match set stuff is interesting in that it uses an argument list
-// to pass code to the default matchSet; another possible way to alter
-// inherited code.  I don't use the region stuff because I need to pass
-// different chunks depending on the operator.  I don't like making
-// the template name have the operator as the number of templates gets
-// large but this is the most flexible--this is as opposed to having
-// the code generator call matchSet then add root code or ruleroot code
-// plus list label plus ...  The combinations might require complicated
-// rather than just added on code.  Investigate that refactoring when
-// I have more time.
-
-matchSet(s,label,elementIndex,postmatchCode,terminalOptions={}) ::= <<
-<super.matchSet(postmatchCode={<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>adaptor.AddChild(root_0, <createNodeFromToken(...)>);}, ...)>
->>
-
-matchRuleBlockSet(s,label,elementIndex,postmatchCode,treeLevel="0",terminalOptions={}) ::= <<
-<matchSet(...)>
->>
-
-matchSetBang(s,label,elementIndex,postmatchCode,terminalOptions={}) ::= "<super.matchSet(...)>"
-
-// note there is no matchSetTrack because -> rewrites force sets to be
-// plain old blocks of alts: (A|B|...|C)
-
-matchSetRuleRoot(s,label,elementIndex,debug,terminalOptions={}) ::= <<
-<if(label)>
-<label>=(<labelType>)input.LT(1);
-<endif>
-<super.matchSet(postmatchCode={<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<createNodeFromToken(...)>, root_0);}, ...)>
->>
-
-// RULE REF AST
-
-/** rule when output=AST */
-ruleRef(rule,label,elementIndex,args,scope) ::= <<
-<super.ruleRef(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>adaptor.AddChild(root_0, <label>.Tree);
->>
-
-/** rule! is same as normal rule ref */
-ruleRefBang(rule,label,elementIndex,args,scope) ::= "<super.ruleRef(...)>"
-
-/** rule^ */
-ruleRefRuleRoot(rule,label,elementIndex,args,scope) ::= <<
-<super.ruleRef(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>.Tree, root_0);
->>
-
-/** x+=rule when output=AST */
-ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRef(...)>
-<listLabelElem(elem={<label>.Tree},elemType=ASTLabelType,...)>
->>
-
-/** x+=rule! when output=AST is a rule ref with list addition */
-ruleRefBangAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRefBang(...)>
-<listLabelElem(elem={<label>.Tree},elemType=ASTLabelType,...)>
->>
-
-/** x+=rule^ */
-ruleRefRuleRootAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRefRuleRoot(...)>
-<listLabelElem(elem={<label>.Tree},elemType=ASTLabelType,...)>
->>
-
-// WILDCARD AST
-
-wildcard(token,label,elementIndex,terminalOptions={}) ::= <<
-<super.wildcard(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<label>_tree = (<ASTLabelType>)adaptor.Create(<label>);
-adaptor.AddChild(root_0, <label>_tree);
-<if(backtracking)>}<endif>
->>
-
-wildcardBang(label,elementIndex) ::= "<super.wildcard(token=[],...)>"
-
-wildcardRuleRoot(token,label,elementIndex,terminalOptions={}) ::= <<
-<super.wildcard(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<label>_tree = (<ASTLabelType>)adaptor.Create(<label>);
-root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_0);
-<if(backtracking)>}<endif>
->>
-
-createNodeFromToken(label,terminalOptions={}) ::= <%
-<if(terminalOptions.node)>
-new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>)
-<else>
-(<ASTLabelType>)adaptor.Create(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>)
-<endif>
-%>
-
-ruleCleanUp() ::= <<
-<super.ruleCleanUp()>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-retval.Tree = (<ASTLabelType>)adaptor.RulePostProcessing(root_0);
-adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-<if(backtracking)>}<endif>
->>
diff --git a/Tools/Antlr/Codegen/Templates/CSharp2/ASTTreeParser.stg b/Tools/Antlr/Codegen/Templates/CSharp2/ASTTreeParser.stg
deleted file mode 100644
index 316282fd434..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp2/ASTTreeParser.stg
+++ /dev/null
@@ -1,380 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2007-2008 Johannes Luber
- * Copyright (c) 2005-2007 Kunle Odutola
- * Copyright (c) 2011 Sam Harwell
- * Copyright (c) 2011 Terence Parr
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-/** Templates for building ASTs during tree parsing.
- *
- *  Deal with many combinations.  Dimensions are:
- *  Auto build or rewrite
- *    no label, label, list label  (label/no-label handled together)
- *    child, root
- *    token, set, rule, wildcard
- *
- *  Each combination has its own template except that label/no label
- *  is combined into tokenRef, ruleRef, ...
- */
-
-/** Add a variable to track last element matched */
-ruleDeclarations() ::= <<
-<super.ruleDeclarations()>
-<if(!ruleDescriptor.isSynPred)>
-<ASTLabelType> _first_0 = default(<ASTLabelType>);
-<ASTLabelType> _last = default(<ASTLabelType>);
-<endif>
->>
-
-/** What to emit when there is no rewrite rule.  For auto build
- *  mode, does nothing.
- */
-noRewrite(rewriteBlockLevel=false, treeLevel=false) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<if(rewriteMode)>
-retval.Tree = (<ASTLabelType>)_first_0;
-if (adaptor.GetParent(retval.Tree)!=null && adaptor.IsNil(adaptor.GetParent(retval.Tree)))
-    retval.Tree = (<ASTLabelType>)adaptor.GetParent(retval.Tree);
-<endif>
-<if(backtracking)>}<endif>
-<endif>
->>
-
-/** match ^(root children) in tree parser; override here to
- *  add tree construction actions.
- */
-tree(root, actionsAfterRoot, children, nullableChildList,
-     enclosingTreeLevel, treeLevel) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-{
-<ASTLabelType> _save_last_<treeLevel> = _last;
-<ASTLabelType> _first_<treeLevel> = default(<ASTLabelType>);
-<if(!rewriteMode)>
-<ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.Nil();
-<endif>
-<root:element()>
-<if(rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>)<endif>
-<if(root.el.rule)>
-if (_first_<enclosingTreeLevel> == null) _first_<enclosingTreeLevel> = <root.el.label>.Tree;
-<else>
-if (_first_<enclosingTreeLevel> == null) _first_<enclosingTreeLevel> = <root.el.label>;
-<endif>
-<endif>
-<actionsAfterRoot:element()>
-<if(nullableChildList)>
-if (input.LA(1) == TokenTypes.Down) {
-    Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()>
-    <children:element()>
-    Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()>
-}
-<else>
-Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()>
-<children:element()>
-Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()>
-<endif>
-<if(!rewriteMode)>
-adaptor.AddChild(root_<enclosingTreeLevel>, root_<treeLevel>);
-<endif>
-_last = _save_last_<treeLevel>;
-}
-<else>
-<super.tree(...)>
-<endif>
->>
-
-// TOKEN AST STUFF
-
-/** ID! and output=AST (same as plain tokenRef) 'cept add
- *  setting of _last
- */
-tokenRefBang(token,label,elementIndex,terminalOptions) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.tokenRef(...)>
-<else>
-<super.tokenRefBang(...)>
-<endif>
->>
-
-/** ID auto construct */
-tokenRef(token,label,elementIndex,terminalOptions) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.tokenRef(...)>
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<if(terminalOptions.node)>
-<label>_tree = new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<else>
-<label>_tree = (<ASTLabelType>)adaptor.DupNode(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<endif><\n>
-adaptor.AddChild(root_<treeLevel>, <label>_tree);
-<if(backtracking)>}<endif>
-<else> <! rewrite mode !>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>)<endif>
-if (_first_<treeLevel> == null) _first_<treeLevel> = <label>;
-<endif>
-<else>
-<super.tokenRef(...)>
-<endif>
->>
-
-/** label+=TOKEN auto construct */
-tokenRefAndListLabel(token,label,elementIndex,terminalOptions) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<tokenRef(...)>
-<listLabelElem(elem=label,...)>
-<else>
-<super.tokenRefAndListLabel(...)>
-<endif>
->>
-
-/** ^(ID ...) auto construct */
-tokenRefRuleRoot(token,label,elementIndex,terminalOptions) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.tokenRef(...)>
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<if(terminalOptions.node)>
-<label>_tree = new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<else>
-<label>_tree = (<ASTLabelType>)adaptor.DupNode(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<endif><\n>
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_<treeLevel>);
-<if(backtracking)>}<endif>
-<endif>
-<else>
-<super.tokenRefRuleRoot(...)>
-<endif>
->>
-
-/** Match ^(label+=TOKEN ...) auto construct */
-tokenRefRuleRootAndListLabel(token,label,elementIndex,terminalOptions) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<tokenRefRuleRoot(...)>
-<listLabelElem(elem=label,...)>
-<else>
-<super.tokenRefRuleRootAndListLabel(...)>
-<endif>
->>
-
-/** Match . wildcard and auto dup the node/subtree */
-wildcard(token,label,elementIndex,terminalOptions) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.wildcard(...)>
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<label>_tree = (<ASTLabelType>)adaptor.DupTree(<label>);
-adaptor.AddChild(root_<treeLevel>, <label>_tree);
-<if(backtracking)>}<endif>
-<else> <! rewrite mode !>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>)<endif>
-if (_first_<treeLevel> == null) _first_<treeLevel> = <label>;
-<endif>
-<else>
-<super.wildcard(...)>
-<endif>
->>
-
-// SET AST
-
-matchSet(s,label,terminalOptions,elementIndex,postmatchCode) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.matchSet(postmatchCode={
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<if(terminalOptions.node)>
-<label>_tree = new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<else>
-<label>_tree = (<ASTLabelType>)adaptor.DupNode(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<endif><\n>
-adaptor.AddChild(root_<treeLevel>, <label>_tree);
-<if(backtracking)>\}<endif>
-<endif>
-}, ...
-)>
-<else>
-<super.matchSet(...)>
-<endif>
->>
-
-matchRuleBlockSet(s,label,terminalOptions,elementIndex,postmatchCode,treeLevel="0") ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<matchSet(...)>
-<noRewrite(...)> <! set return tree !>
-<else>
-<super.matchRuleBlockSet(...)>
-<endif>
->>
-
-matchSetBang(s,label,terminalOptions,elementIndex,postmatchCode) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.matchSet(...)>
-<else>
-<super.matchSetBang(...)>
-<endif>
->>
-
-matchSetRuleRoot(s,label,terminalOptions,elementIndex,debug) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<super.matchSet(postmatchCode={
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<if(terminalOptions.node)>
-<label>_tree = new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<else>
-<label>_tree = (<ASTLabelType>)adaptor.DupNode(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<endif><\n>
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_<treeLevel>);
-<if(backtracking)>\}<endif>
-<endif>
-}, ...
-)>
-<else>
-<super.matchSetRuleRoot(...)>
-<endif>
->>
-
-// RULE REF AST
-
-/** rule auto construct */
-ruleRef(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.ruleRef(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>)<endif>
-<if(!rewriteMode)>
-adaptor.AddChild(root_<treeLevel>, <label>.Tree);
-<else> <! rewrite mode !>
-if (_first_<treeLevel> == null) _first_<treeLevel> = <label>.Tree;
-<endif>
-<else>
-<super.ruleRef(...)>
-<endif>
->>
-
-/** x+=rule auto construct */
-ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<ruleRef(...)>
-<listLabelElem(elem={<label>.Tree},...)>
-<else>
-<super.ruleRefAndListLabel(...)>
-<endif>
->>
-
-/** ^(rule ...) auto construct */
-ruleRefRuleRoot(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.ruleRef(...)>
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>.Tree, root_<treeLevel>);
-<endif>
-<else>
-<super.ruleRefRuleRoot(...)>
-<endif>
->>
-
-/** ^(x+=rule ...) auto construct */
-ruleRefRuleRootAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<ruleRefRuleRoot(...)>
-<listLabelElem(elem={<label>.Tree},...)>
-<else>
-<super.ruleRefRuleRootAndListLabel(...)>
-<endif>
->>
-
-/** rule when output=AST and tracking for rewrite */
-ruleRefTrack(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.ruleRefTrack(...)>
-<else>
-<super.ruleRefTrack(...)>
-<endif>
->>
-
-/** x+=rule when output=AST and tracking for rewrite */
-ruleRefTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.ruleRefTrackAndListLabel(...)>
-<else>
-<super.ruleRefTrackAndListLabel(...)>
-<endif>
->>
-
-/** ^(rule ...) rewrite */
-ruleRefRuleRootTrack(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.ruleRefRootTrack(...)>
-<else>
-<super.ruleRefRuleRootTrack(...)>
-<endif>
->>
-
-/** ^(x+=rule ...) rewrite */
-ruleRefRuleRootTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.ruleRefRuleRootTrackAndListLabel(...)>
-<else>
-<super.ruleRefRuleRootTrackAndListLabel(...)>
-<endif>
->>
-
-/** Streams for token refs are tree nodes now; override to
- *  change NextToken to NextNode.
- */
-createRewriteNodeFromElement(token,terminalOptions,args) ::= <%
-<if(terminalOptions.node)>
-new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif>stream_<token>.NextNode())
-<else>
-stream_<token>.NextNode()
-<endif>
-%>
-
-ruleCleanUp() ::= <<
-<super.ruleCleanUp()>
-<if(!ruleDescriptor.isSynPred)>
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-retval.Tree = (<ASTLabelType>)adaptor.RulePostProcessing(root_0);
-<if(backtracking)>}<endif>
-<endif>
-<endif>
->>
diff --git a/Tools/Antlr/Codegen/Templates/CSharp2/CSharp2.stg b/Tools/Antlr/Codegen/Templates/CSharp2/CSharp2.stg
deleted file mode 100644
index 8f15ef27188..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp2/CSharp2.stg
+++ /dev/null
@@ -1,1772 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2007-2008 Johannes Luber
- * Copyright (c) 2005-2007 Kunle Odutola
- * Copyright (c) 2011 Sam Harwell
- * Copyright (c) 2011 Terence Parr
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-csharpVisibilityMap ::= [
-	"private":"private",
-	"protected":"protected",
-	"public":"public",
-	"fragment":"private",
-	default:"private"
-]
-
-/** The overall file structure of a recognizer; stores methods for rules
- *  and cyclic DFAs plus support code.
- */
-outputFile(	LEXER,PARSER,TREE_PARSER, actionScope, actions,
-			docComment, recognizer,
-			name, tokens, tokenNames, rules, cyclicDFAs,
-			bitsets, buildTemplate, buildAST, rewriteMode, profile,
-			backtracking, synpreds, memoize, numRules,
-			fileName, ANTLRVersion, generatedTimestamp, trace,
-			scopes, superClass, literals) ::=
-<<
-//------------------------------------------------------------------------------
-// \<auto-generated>
-//     This code was generated by a tool.
-//     ANTLR Version: <ANTLRVersion>
-//
-//     Changes to this file may cause incorrect behavior and will be lost if
-//     the code is regenerated.
-// \</auto-generated>
-//------------------------------------------------------------------------------
-
-// $ANTLR <ANTLRVersion> <fileName> <generatedTimestamp>
-
-<if(trace)>
-#define ANTLR_TRACE
-<endif>
-<@debugPreprocessor()>
-// The variable 'variable' is assigned but its value is never used.
-#pragma warning disable 168, 219
-// Unreachable code detected.
-#pragma warning disable 162
-// Missing XML comment for publicly visible type or member 'Type_or_Member'
-#pragma warning disable 1591
-
-<actions.(actionScope).header>
-
-<@imports>
-using System.Collections.Generic;
-using Antlr.Runtime;
-using Antlr.Runtime.Misc;
-<if(TREE_PARSER)>
-using Antlr.Runtime.Tree;
-using RewriteRuleITokenStream = Antlr.Runtime.Tree.RewriteRuleTokenStream;
-<endif>
-using ConditionalAttribute = System.Diagnostics.ConditionalAttribute;
-<@end>
-<if(actions.(actionScope).namespace)>
-namespace <actions.(actionScope).namespace>
-{
-<endif>
-<docComment>
-<recognizer>
-<if(actions.(actionScope).namespace)>
-
-} // namespace <actions.(actionScope).namespace>
-<endif>
->>
-
-lexerInputStreamType() ::= <<
-<actions.(actionScope).inputStreamType; null="ICharStream">
->>
-
-lexer(grammar, name, tokens, scopes, rules, numRules, filterMode, labelType="CommonToken",
-      superClass={<if(actions.(actionScope).superClass)><actions.(actionScope).superClass><else>Antlr.Runtime.Lexer<endif>}) ::= <<
-[System.CodeDom.Compiler.GeneratedCode("ANTLR", "<ANTLRVersion>")]
-[System.CLSCompliant(false)]
-<parserModifier(grammar=grammar, actions=actions)> partial class <grammar.recognizerName> : <@superClassName><superClass><@end>
-{
-	<tokens:{it|public const int <it.name; format="id">=<it.type>;}; separator="\n">
-	<scopes:{it|<if(it.isDynamicGlobalScope)><globalAttributeScope(scope=it)><endif>}>
-	<actions.lexer.members>
-
-    // delegates
-    <grammar.delegates:
-         {g|private <g.recognizerName> <g:delegateName()>;}; separator="\n">
-    // delegators
-    <grammar.delegators:
-         {g|private <g.recognizerName> <g:delegateName()>;}; separator="\n">
-    <last(grammar.delegators):{g|private <g.recognizerName> gParent;}>
-
-	<actions.(actionScope).ctorModifier; null="public"> <grammar.recognizerName>()<! needed by subclasses !>
-	{
-		OnCreated();
-	}
-
-	<actions.(actionScope).ctorModifier; null="public"> <grammar.recognizerName>(<lexerInputStreamType()> input<grammar.delegators:{g|, <g.recognizerName> <g:delegateName()>}> )
-		: this(input, new RecognizerSharedState()<grammar.delegators:{g|, <g:delegateName()>}>)
-	{
-	}
-
-	<actions.(actionScope).ctorModifier; null="public"> <grammar.recognizerName>(<lexerInputStreamType()> input, RecognizerSharedState state<grammar.delegators:{g|, <g.recognizerName> <g:delegateName()>}>)
-		: base(input, state)
-	{
-<if(memoize)>
-<if(grammar.grammarIsRoot)>
-		state.ruleMemo = new System.Collections.Generic.Dictionary\<int, int>[<numRules>+1];<\n><! index from 1..n !>
-<endif>
-<endif>
-		<grammar.directDelegates:
-		 {g|<g:delegateName()> = new <g.recognizerName>(input, this.state<trunc(g.delegators):{p|, <p:delegateName()>}>, this);}; separator="\n">
-		<grammar.delegators:
-		 {g|this.<g:delegateName()> = <g:delegateName()>;}; separator="\n">
-		<last(grammar.delegators):{g|gParent = <g:delegateName()>;}>
-
-		OnCreated();
-	}
-	public override string GrammarFileName { get { return "<fileName>"; } }
-
-	private static readonly bool[] decisionCanBacktrack = new bool[0];
-
-<if(grammar.hasDelegates)>
-	public override <lexerInputStreamType()> CharStream
-	{
-		get
-		{
-			return base.CharStream;
-		}
-		set
-		{
-			base.CharStream = value;
-			<grammar.directDelegates:
-			 {g|<g:delegateName()> = new <g.recognizerName>(input, state<trunc(g.delegators):{p|, <p:delegateName()>}>, this);}; separator="\n">
-			<grammar.delegators:
-			 {g|this.<g:delegateName()> = <g:delegateName()>;}; separator="\n">
-			<last(grammar.delegators):{g|gParent = <g:delegateName()>;}>
-		}
-	}
-
-<if(grammar.delegates)>
-	public override void SetState(RecognizerSharedState state)
-	{
-		base.SetState(state);
-		<grammar.delegates:{g|<g:delegateName()>.SetState(state);}; separator="\n">
-	}
-<endif>
-
-<endif>
-<if(filterMode)>
-	<filteringNextToken()>
-<endif>
-
-	[Conditional("ANTLR_TRACE")]
-	protected virtual void OnCreated() {}
-	[Conditional("ANTLR_TRACE")]
-	protected virtual void EnterRule(string ruleName, int ruleIndex) {}
-	[Conditional("ANTLR_TRACE")]
-	protected virtual void LeaveRule(string ruleName, int ruleIndex) {}
-
-    <rules; separator="\n">
-
-	<insertLexerSynpreds(synpreds)>
-
-	#region DFA
-	<cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
-
-	protected override void InitDFAs()
-	{
-		base.InitDFAs();
-		<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this<if(dfa.specialStateSTs)>, SpecialStateTransition<dfa.decisionNumber><endif>);}; separator="\n">
-	}
-
-	<cyclicDFAs:cyclicDFA()> <! dump tables for all DFA !>
-	#endregion
-
-}
->>
-
-/** A override of Lexer.nextToken() that backtracks over mTokens() looking
- *  for matches.  No error can be generated upon error; just rewind, consume
- *  a token and then try again.  backtracking needs to be set as well.
- *  Make rule memoization happen only at levels above 1 as we start mTokens
- *  at backtracking==1.
- */
-filteringNextToken() ::= <<
-public override IToken NextToken()
-{
-	while (true)
-	{
-		if (input.LA(1) == CharStreamConstants.EndOfFile)
-		{
-			IToken eof = new CommonToken((ICharStream)input, CharStreamConstants.EndOfFile, TokenChannels.Default, input.Index, input.Index);
-			eof.Line = Line;
-			eof.CharPositionInLine = CharPositionInLine;
-			return eof;
-		}
-		state.token = null;
-		state.channel = TokenChannels.Default;
-		state.tokenStartCharIndex = input.Index;
-		state.tokenStartCharPositionInLine = input.CharPositionInLine;
-		state.tokenStartLine = input.Line;
-		state.text = null;
-		try
-		{
-			int m = input.Mark();
-			state.backtracking=1;<! means we won't throw slow exception !>
-			state.failed=false;
-			mTokens();
-			state.backtracking=0;
-			<! mTokens backtracks with synpred at backtracking==2
-			   and we set the synpredgate to allow actions at level 1. !>
-			if (state.failed)
-			{
-				input.Rewind(m);
-				input.Consume();<! advance one char and try again !>
-			}
-			else
-			{
-				Emit();
-				return state.token;
-			}
-		}
-		catch (RecognitionException re)
-		{
-			// shouldn't happen in backtracking mode, but...
-			ReportError(re);
-			Recover(re);
-		}
-	}
-}
-
-public override void Memoize(IIntStream input, int ruleIndex, int ruleStartIndex)
-{
-	if (state.backtracking > 1)
-		base.Memoize(input, ruleIndex, ruleStartIndex);
-}
-
-public override bool AlreadyParsedRule(IIntStream input, int ruleIndex)
-{
-	if (state.backtracking > 1)
-		return base.AlreadyParsedRule(input, ruleIndex);
-
-	return false;
-}
->>
-
-actionGate() ::= "state.backtracking == 0"
-
-filteringActionGate() ::= "state.backtracking == 1"
-
-/** How to generate a parser */
-genericParser(grammar, name, scopes, tokens, tokenNames, rules, numRules,
-              bitsets, inputStreamType, superClass,
-              labelType, members, rewriteElementType,
-              filterMode, ASTLabelType="object") ::= <<
-[System.CodeDom.Compiler.GeneratedCode("ANTLR", "<ANTLRVersion>")]
-[System.CLSCompliant(false)]
-<parserModifier(grammar=grammar, actions=actions)> partial class <grammar.recognizerName> : <@superClassName><superClass><@end>
-{
-<if(grammar.grammarIsRoot)>
-	internal static readonly string[] tokenNames = new string[] {
-		"\<invalid>", "\<EOR>", "\<DOWN>", "\<UP>", <tokenNames; separator=", ">
-	};
-<endif>
-	<tokens:{it|public const int <it.name; format="id">=<it.type>;}; separator="\n">
-
-<if(grammar.delegates)>
-	// delegates
-	<grammar.delegates:
-		 {g|private <g.recognizerName> <g:delegateName()>;}; separator="\n">
-<endif>
-<if(grammar.delegators)>
-	// delegators
-	<grammar.delegators:
-		 {g|private <g.recognizerName> <g:delegateName()>;}; separator="\n">
-	<last(grammar.delegators):{g|private <g.recognizerName> gParent;}>
-<endif>
-
-<if(grammar.delegates)>
-	public override void SetState(RecognizerSharedState state)
-	{
-		base.SetState(state);
-		<grammar.delegates:{g|<g:delegateName()>.SetState(state);}; separator="\n">
-	}
-
-<if(TREE_PARSER)>
-	public override void SetTreeNodeStream(ITreeNodeStream input)
-	{
-		base.SetTreeNodeStream(input);
-		<grammar.delegates:{g|<g:delegateName()>.SetTreeNodeStream(input);}; separator="\n">
-	}
-<endif>
-<endif>
-
-	<scopes:{it|<if(it.isDynamicGlobalScope)><globalAttributeScope(scope=it)><endif>}>
-	<@members()>
-
-	public override string[] TokenNames { get { return <grammar.composite.rootGrammar.recognizerName>.tokenNames; } }
-	public override string GrammarFileName { get { return "<fileName>"; } }
-
-	<members>
-
-	[Conditional("ANTLR_TRACE")]
-	protected virtual void OnCreated() {}
-	[Conditional("ANTLR_TRACE")]
-	protected virtual void EnterRule(string ruleName, int ruleIndex) {}
-	[Conditional("ANTLR_TRACE")]
-	protected virtual void LeaveRule(string ruleName, int ruleIndex) {}
-
-	#region Rules
-	<rules; separator="\n">
-	#endregion Rules
-
-<if(grammar.delegatedRules)>
-<! generate rule/method definitions for imported rules so they
-   appear to be defined in this recognizer. !>
-	#region Delegated rules
-<grammar.delegatedRules:{ruleDescriptor|
-	<ruleModifier(grammar=grammar,ruleDescriptor=ruleDescriptor)> <returnType(ruleDescriptor)> <ruleDescriptor.name; format="id">(<ruleDescriptor.parameterScope:parameterScope()>) <!throws RecognitionException !>{ <if(ruleDescriptor.hasReturnValue)>return <endif><ruleDescriptor.grammar:delegateName()>.<ruleDescriptor.name; format="id">(<if(ruleDescriptor.parameterScope)><ruleDescriptor.parameterScope.attributes:{a|<a.name; format="id">}; separator=", "><endif>); \}}; separator="\n">
-	#endregion Delegated rules
-<endif>
-
-	<insertSynpreds(synpreds)>
-
-<if(cyclicDFAs)>
-	#region DFA
-	<cyclicDFAs:{dfa | private DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
-
-	protected override void InitDFAs()
-	{
-		base.InitDFAs();
-		<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>( this<if(dfa.specialStateSTs)>, SpecialStateTransition<dfa.decisionNumber><endif> );}; separator="\n">
-	}
-
-	<cyclicDFAs:cyclicDFA()><! dump tables for all DFA !>
-	#endregion DFA
-<endif>
-
-<if(bitsets)>
-	#region Follow sets
-	private static class Follow
-	{
-		<bitsets:{it|<bitset(name={_<it.name>_in_<it.inName><it.tokenIndex>}, words64=it.bits)>}; separator="\n">
-	}
-	#endregion Follow sets
-<endif>
-}
->>
-
-@genericParser.members() ::= <<
-#if ANTLR_DEBUG
-private static readonly bool[] decisionCanBacktrack =
-	new bool[]
-	{
-		false, // invalid decision
-		<grammar.decisions:{d | <d.dfa.hasSynPred>}; wrap="\n", separator=", ">
-	};
-#else
-private static readonly bool[] decisionCanBacktrack = new bool[0];
-#endif
-<! WARNING. bug in ST: this is cut-n-paste into Dbg.stg !>
-<actions.(actionScope).ctorModifier; null="public"> <grammar.recognizerName>(<inputStreamType> input<grammar.delegators:{g|, <g.recognizerName> <g:delegateName()>}>)
-	: this(input, new RecognizerSharedState()<grammar.delegators:{g|, <g:delegateName()>}>)
-{
-}
-<actions.(actionScope).ctorModifier; null="public"> <grammar.recognizerName>(<inputStreamType> input, RecognizerSharedState state<grammar.delegators:{g|, <g.recognizerName> <g:delegateName()>}>)
-	: base(input, state)
-{
-<if(grammar.directDelegates)>
-	<grammar.directDelegates:
-	 {g|<g:delegateName()> = new <g.recognizerName>(input, state<trunc(g.delegators):{p|, <p:delegateName()>}>, this);}; separator="\n">
-<endif>
-<if(grammar.indirectDelegates)>
-	<grammar.indirectDelegates:{g | <g:delegateName()> = <g.delegator:delegateName()>.<g:delegateName()>;}; separator="\n">
-<endif>
-<if(grammar.delegators)>
-	<last(grammar.delegators):{g|gParent = <g:delegateName()>;}>
-<endif>
-	<parserCtorBody()>
-	OnCreated();
-}
->>
-
-// imported grammars are 'public' (can't be internal because their return scope classes must be accessible)
-parserModifier(grammar, actions) ::= <<
-<if(grammar.grammarIsRoot)><actions.(actionScope).modifier; null="public"><else>public<endif>
->>
-
-parserCtorBody() ::= <<
-<if(memoize)>
-<if(grammar.grammarIsRoot)>
-this.state.ruleMemo = new System.Collections.Generic.Dictionary\<int, int>[<length(grammar.allImportedRules)>+1];<\n><! index from 1..n !>
-<endif>
-<endif>
-<grammar.delegators:
- {g|this.<g:delegateName()> = <g:delegateName()>;}; separator="\n">
->>
-
-parser(grammar, name, scopes, tokens, tokenNames, rules, numRules, bitsets,
-       ASTLabelType="object", superClass={<if(actions.(actionScope).superClass)><actions.(actionScope).superClass><else>Antlr.Runtime.Parser<endif>}, labelType="IToken",
-       members={<actions.parser.members>}) ::= <<
-<genericParser(inputStreamType="ITokenStream", rewriteElementType="IToken", ...)>
->>
-
-/** How to generate a tree parser; same as parser except the input
- *  stream is a different type.
- */
-treeParser(grammar, name, scopes, tokens, tokenNames, globalAction, rules,
-           numRules, bitsets, filterMode, labelType={<ASTLabelType>}, ASTLabelType="object",
-           superClass={<if(actions.(actionScope).superClass)><actions.(actionScope).superClass><else>Antlr.Runtime.Tree.<if(filterMode)><if(buildAST)>TreeRewriter<else>TreeFilter<endif><else>TreeParser<endif><endif>},
-           members={<actions.treeparser.members>}) ::= <<
-<genericParser(inputStreamType="ITreeNodeStream", rewriteElementType="Node", ...)>
->>
-
-/** A simpler version of a rule template that is specific to the imaginary
- *  rules created for syntactic predicates.  As they never have return values
- *  nor parameters etc..., just give simplest possible method.  Don't do
- *  any of the normal memoization stuff in here either; it's a waste.
- *  As predicates cannot be inlined into the invoking rule, they need to
- *  be in a rule by themselves.
- */
-synpredRule(ruleName, ruleDescriptor, block, description, nakedBlock) ::=
-<<
-[Conditional("ANTLR_TRACE")]
-protected virtual void EnterRule_<ruleName>_fragment() {}
-[Conditional("ANTLR_TRACE")]
-protected virtual void LeaveRule_<ruleName>_fragment() {}
-
-// $ANTLR start <ruleName>
-<ruleModifier(grammar,ruleDescriptor)> void <ruleName>_fragment(<ruleDescriptor.parameterScope:parameterScope()>)
-{
-	<ruleLabelDefs()>
-	EnterRule_<ruleName>_fragment();
-	EnterRule("<ruleName>_fragment", <ruleDescriptor.index>);
-	TraceIn("<ruleName>_fragment", <ruleDescriptor.index>);
-	try
-	{
-		<block>
-	}
-	finally
-	{
-		TraceOut("<ruleName>_fragment", <ruleDescriptor.index>);
-		LeaveRule("<ruleName>_fragment", <ruleDescriptor.index>);
-		LeaveRule_<ruleName>_fragment();
-	}
-}
-// $ANTLR end <ruleName>
->>
-
-insertLexerSynpreds(synpreds) ::= <<
-<insertSynpreds(synpreds)>
->>
-
-insertSynpreds(synpreds) ::= <<
-<if(synpreds)>
-#region Synpreds
-private bool EvaluatePredicate(System.Action fragment)
-{
-	bool success = false;
-	state.backtracking++;
-	<@start()>
-	try { DebugBeginBacktrack(state.backtracking);
-	int start = input.Mark();
-	try
-	{
-		fragment();
-	}
-	catch ( RecognitionException re )
-	{
-		System.Console.Error.WriteLine("impossible: "+re);
-	}
-	success = !state.failed;
-	input.Rewind(start);
-	} finally { DebugEndBacktrack(state.backtracking, success); }
-	<@stop()>
-	state.backtracking--;
-	state.failed=false;
-	return success;
-}
-#endregion Synpreds
-<endif>
->>
-
-ruleMemoization(name) ::= <<
-<if(memoize)>
-if (state.backtracking > 0 && AlreadyParsedRule(input, <ruleDescriptor.index>)) { <returnFromRule()> }
-<endif>
->>
-
-/** How to test for failure and return from rule */
-checkRuleBacktrackFailure() ::= <<
-<if(backtracking)>if (state.failed) <returnFromRule()><endif>
->>
-
-/** This rule has failed, exit indicating failure during backtrack */
-ruleBacktrackFailure() ::= <<
-<if(backtracking)>if (state.backtracking>0) {state.failed=true; <returnFromRule()>}<endif>
->>
-
-ruleWrapperMap ::= [
-	"bottomup":{<ruleWrapperBottomup()>},
-	"topdown":{<ruleWrapperTopdown()>},
-	default:""
-]
-
-ruleWrapperBottomup() ::= <<
-<if(TREE_PARSER && filterMode)>
-protected override <if(buildAST)>IAstRuleReturnScope<else>void<endif> Bottomup() { return bottomup(); }
-<endif>
->>
-
-ruleWrapperTopdown() ::= <<
-<if(TREE_PARSER && filterMode)>
-protected override <if(buildAST)>IAstRuleReturnScope<else>void<endif> Topdown() { return topdown(); }
-<endif>
->>
-
-/** How to generate code for a rule.  This includes any return type
- *  data aggregates required for multiple return values.
- */
-rule(ruleName,ruleDescriptor,block,emptyRule,description,exceptions,finally,memoize) ::= <<
-<ruleAttributeScope(scope=ruleDescriptor.ruleScope)>
-<returnScope(ruleDescriptor.returnScope)>
-
-[Conditional("ANTLR_TRACE")]
-protected virtual void EnterRule_<ruleName>() {}
-[Conditional("ANTLR_TRACE")]
-protected virtual void LeaveRule_<ruleName>() {}
-<ruleWrapperMap.(ruleName)>
-// $ANTLR start "<ruleName>"
-// <fileName>:<description>
-[GrammarRule("<ruleName>")]
-<ruleModifier(grammar=grammar,ruleDescriptor=ruleDescriptor)> <returnType(ruleDescriptor)> <ruleName; format="id">(<ruleDescriptor.parameterScope:parameterScope()>)
-{
-	EnterRule_<ruleName>();
-	EnterRule("<ruleName>", <ruleDescriptor.index>);
-	TraceIn("<ruleName>", <ruleDescriptor.index>);
-    <ruleScopeSetUp()>
-    <ruleDeclarations()>
-    <ruleLabelDefs()>
-    <ruleDescriptor.actions.init>
-	try { DebugEnterRule(GrammarFileName, "<ruleName>");
-	DebugLocation(<ruleDescriptor.tree.line>, <ruleDescriptor.EORNode.charPositionInLine>);
-	<@preamble()>
-	try
-	{
-		<ruleMemoization(name=ruleName)>
-		<block>
-		<ruleCleanUp()>
-		<(ruleDescriptor.actions.after):execAction()>
-	}
-<if(exceptions)>
-	<exceptions:{e|<catch(decl=e.decl,action=e.action)><\n>}>
-<else>
-<if(!emptyRule)>
-<if(actions.(actionScope).rulecatch)>
-	<actions.(actionScope).rulecatch>
-<else>
-	catch (RecognitionException re)
-	{
-		ReportError(re);
-		Recover(input,re);
-	<@setErrorReturnValue()>
-	}
-<endif>
-<endif>
-<endif>
-	finally
-	{
-		TraceOut("<ruleName>", <ruleDescriptor.index>);
-		LeaveRule("<ruleName>", <ruleDescriptor.index>);
-		LeaveRule_<ruleName>();
-        <memoize()>
-        <ruleScopeCleanUp()>
-        <finally>
-    }
- 	DebugLocation(<ruleDescriptor.EORNode.line>, <ruleDescriptor.EORNode.charPositionInLine>);
-	} finally { DebugExitRule(GrammarFileName, "<ruleName>"); }
-	<@postamble()>
-	<returnFromRule()><\n>
-}
-// $ANTLR end "<ruleName>"
->>
-
-// imported grammars need to have internal rules
-ruleModifier(grammar,ruleDescriptor) ::= <<
-<if(grammar.grammarIsRoot)><csharpVisibilityMap.(ruleDescriptor.modifier); null="private"><else>internal<endif>
->>
-
-// imported grammars need to have public return scopes
-returnScopeModifier(grammar,ruleDescriptor) ::= <<
-<if(grammar.grammarIsRoot)><csharpVisibilityMap.(ruleDescriptor.modifier); null="private"><else>public<endif>
->>
-
-catch(decl,action) ::= <<
-catch (<e.decl>)
-{
-	<e.action>
-}
->>
-
-ruleDeclarations() ::= <<
-<if(ruleDescriptor.hasMultipleReturnValues)>
-<returnType(ruleDescriptor)> retval = new <returnType(ruleDescriptor)>();
-retval.Start = (<labelType>)input.LT(1);
-<elseif(ruleDescriptor.returnScope)>
-<ruleDescriptor.returnScope.attributes:{ a |
-<a.type> <a.name; format="id"> = <if(a.initValue)><a.initValue><else><initValue(a.type)><endif>;
-}>
-<endif>
-<if(memoize)>
-int <ruleDescriptor.name>_StartIndex = input.Index;
-<endif>
->>
-
-ruleScopeSetUp() ::= <<
-<ruleDescriptor.useScopes:{it|<it>_stack.Push(new <it>_scope());<it>_scopeInit(<it>_stack.Peek());}; separator="\n">
-<ruleDescriptor.ruleScope:{it|<it.name>_stack.Push(new <it.name>_scope());<it.name>_scopeInit(<it.name>_stack.Peek());}; separator="\n">
->>
-
-ruleScopeCleanUp() ::= <<
-<ruleDescriptor.useScopes:{it|<it>_scopeAfter(<it>_stack.Peek());<it>_stack.Pop();}; separator="\n">
-<ruleDescriptor.ruleScope:{it|<it.name>_scopeAfter(<it.name>_stack.Peek());<it.name>_stack.Pop();}; separator="\n">
->>
-
-ruleLabelDefs() ::= <<
-<[ruleDescriptor.tokenLabels,ruleDescriptor.tokenListLabels,ruleDescriptor.wildcardTreeLabels,ruleDescriptor.wildcardTreeListLabels]
-    :{it|<labelType> <it.label.text> = default(<labelType>);}; separator="\n"
->
-<ruleDescriptor.tokenListLabels
-    :{it|List\<<labelType>\> list_<it.label.text> = null;}; separator="\n"
->
-<[ruleDescriptor.ruleListLabels,ruleDescriptor.wildcardTreeListLabels]
-    :{it|List\<<ASTLabelType>\> list_<it.label.text> = null;}; separator="\n"
->
-<ruleDescriptor.ruleLabels:ruleLabelDef(); separator="\n">
-<ruleDescriptor.ruleListLabels:ruleLabelDef(); separator="\n">
->>
-
-lexerRuleLabelDefs() ::= <<
-<[ruleDescriptor.tokenLabels,
-  ruleDescriptor.tokenListLabels,
-  ruleDescriptor.ruleLabels]
-    :{it|<labelType> <it.label.text> = default(<labelType>);}; separator="\n"
->
-<[ruleDescriptor.charListLabels,
-  ruleDescriptor.charLabels]
-	:{it|int <it.label.text> = 0;}; separator="\n"
->
-<[ruleDescriptor.tokenListLabels,
-  ruleDescriptor.ruleListLabels]
-    :{it|List\<<labelType>\> list_<it.label.text> = null;}; separator="\n"
->
-<ruleDescriptor.charListLabels:{it|List\<int> list_<it.label.text> = null;}; separator="\n"
->
->>
-
-returnFromRule() ::= <%
-return
-<if(!ruleDescriptor.isSynPred)>
-<if(ruleDescriptor.hasReturnValue)>
-<if(ruleDescriptor.hasSingleReturnValue)>
-<! This comment is a hack to make sure the following
-   single space appears in the output. !> <ruleDescriptor.singleValueReturnName>
-<else>
-<!!> retval
-<endif>
-<endif>
-<endif>
-;
-%>
-
-ruleCleanUp() ::= <<
-<if(ruleDescriptor.hasMultipleReturnValues)>
-<if(!TREE_PARSER)>
-retval.Stop = (<labelType>)input.LT(-1);
-<endif>
-<endif>
->>
-
-memoize() ::= <<
-<if(memoize)>
-<if(backtracking)>
-if (state.backtracking > 0) { Memoize(input, <ruleDescriptor.index>, <ruleDescriptor.name>_StartIndex); }
-<endif>
-<endif>
->>
-
-/** How to generate a rule in the lexer; naked blocks are used for
- *  fragment rules.
- */
-lexerRule(ruleName,nakedBlock,ruleDescriptor,block,memoize) ::= <<
-
-[Conditional("ANTLR_TRACE")]
-protected virtual void EnterRule_<ruleName>() {}
-[Conditional("ANTLR_TRACE")]
-protected virtual void LeaveRule_<ruleName>() {}
-
-// $ANTLR start "<ruleName>"
-[GrammarRule("<ruleName>")]
-<ruleModifier(grammar=grammar,ruleDescriptor=ruleDescriptor)> void m<ruleName>(<ruleDescriptor.parameterScope:parameterScope()>)
-{
-	EnterRule_<ruleName>();
-	EnterRule("<ruleName>", <ruleDescriptor.index>);
-	TraceIn("<ruleName>", <ruleDescriptor.index>);
-    <ruleScopeSetUp()>
-    <ruleDeclarations()>
-		try
-		{
-<if(nakedBlock)>
-		<ruleMemoization(name=ruleName)>
-		<lexerRuleLabelDefs()>
-		<ruleDescriptor.actions.init>
-		<block>
-<else>
-		int _type = <ruleName>;
-		int _channel = DefaultTokenChannel;
-		<ruleMemoization(name=ruleName)>
-		<lexerRuleLabelDefs()>
-		<ruleDescriptor.actions.init>
-		<block>
-		<ruleCleanUp()>
-		state.type = _type;
-		state.channel = _channel;
-		<(ruleDescriptor.actions.after):execAction()>
-<endif>
-	}
-	finally
-	{
-		TraceOut("<ruleName>", <ruleDescriptor.index>);
-		LeaveRule("<ruleName>", <ruleDescriptor.index>);
-		LeaveRule_<ruleName>();
-        <ruleScopeCleanUp()>
-        <memoize()>
-    }
-}
-// $ANTLR end "<ruleName>"
->>
-
-/** How to generate code for the implicitly-defined lexer grammar rule
- *  that chooses between lexer rules.
- */
-tokensRule(ruleName,nakedBlock,args,block,ruleDescriptor) ::= <<
-
-public override void mTokens()
-{
-	<block><\n>
-}
->>
-
-// S U B R U L E S
-
-/** A (...) subrule with multiple alternatives */
-block(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<
-// <fileName>:<description>
-int alt<decisionNumber>=<maxAlt>;
-<decls>
-<@predecision()>
-try { DebugEnterSubRule(<decisionNumber>);
-try { DebugEnterDecision(<decisionNumber>, decisionCanBacktrack[<decisionNumber>]);
-<decision>
-} finally { DebugExitDecision(<decisionNumber>); }
-<@postdecision()>
-<@prebranch()>
-switch (alt<decisionNumber>)
-{
-<alts:{a|<altSwitchCase(i,a)>}>
-}
-} finally { DebugExitSubRule(<decisionNumber>); }
-<@postbranch()>
->>
-
-/** A rule block with multiple alternatives */
-ruleBlock(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<
-// <fileName>:<description>
-int alt<decisionNumber>=<maxAlt>;
-<decls>
-<@predecision()>
-try { DebugEnterDecision(<decisionNumber>, decisionCanBacktrack[<decisionNumber>]);
-<decision>
-} finally { DebugExitDecision(<decisionNumber>); }
-<@postdecision()>
-switch (alt<decisionNumber>)
-{
-<alts:{a|<altSwitchCase(i,a)>}>
-}
->>
-
-ruleBlockSingleAlt(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,description) ::= <<
-// <fileName>:<description>
-<decls>
-<@prealt()>
-DebugEnterAlt(1);
-<alts>
-<@postalt()>
->>
-
-/** A special case of a (...) subrule with a single alternative */
-blockSingleAlt(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,description) ::= <<
-// <fileName>:<description>
-<decls>
-<@prealt()>
-DebugEnterAlt(1);
-<alts>
-<@postalt()>
->>
-
-/** A (..)+ block with 1 or more alternatives */
-positiveClosureBlock(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<
-// <fileName>:<description>
-int cnt<decisionNumber>=0;
-<decls>
-<@preloop()>
-try { DebugEnterSubRule(<decisionNumber>);
-while (true)
-{
-	int alt<decisionNumber>=<maxAlt>;
-	<@predecision()>
-	try { DebugEnterDecision(<decisionNumber>, decisionCanBacktrack[<decisionNumber>]);
-	<decision>
-	} finally { DebugExitDecision(<decisionNumber>); }
-	<@postdecision()>
-	switch (alt<decisionNumber>)
-	{
-	<alts:{a|<altSwitchCase(i,a)>}>
-	default:
-		if (cnt<decisionNumber> >= 1)
-			goto loop<decisionNumber>;
-
-		<ruleBacktrackFailure()>
-		EarlyExitException eee<decisionNumber> = new EarlyExitException( <decisionNumber>, input );
-		DebugRecognitionException(eee<decisionNumber>);
-		<@earlyExitException()>
-		throw eee<decisionNumber>;
-	}
-	cnt<decisionNumber>++;
-}
-loop<decisionNumber>:
-	;
-
-} finally { DebugExitSubRule(<decisionNumber>); }
-<@postloop()>
->>
-
-positiveClosureBlockSingleAlt ::= positiveClosureBlock
-
-/** A (..)* block with 1 or more alternatives */
-closureBlock(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<
-// <fileName>:<description>
-<decls>
-<@preloop()>
-try { DebugEnterSubRule(<decisionNumber>);
-while (true)
-{
-	int alt<decisionNumber>=<maxAlt>;
-	<@predecision()>
-	try { DebugEnterDecision(<decisionNumber>, decisionCanBacktrack[<decisionNumber>]);
-	<decision>
-	} finally { DebugExitDecision(<decisionNumber>); }
-	<@postdecision()>
-	switch ( alt<decisionNumber> )
-	{
-	<alts:{a|<altSwitchCase(i,a)>}>
-	default:
-		goto loop<decisionNumber>;
-	}
-}
-
-loop<decisionNumber>:
-	;
-
-} finally { DebugExitSubRule(<decisionNumber>); }
-<@postloop()>
->>
-
-closureBlockSingleAlt ::= closureBlock
-
-/** Optional blocks (x)? are translated to (x|) by before code generation
- *  so we can just use the normal block template
- */
-optionalBlock ::= block
-
-optionalBlockSingleAlt ::= block
-
-/** A case in a switch that jumps to an alternative given the alternative
- *  number.  A DFA predicts the alternative and then a simple switch
- *  does the jump to the code that actually matches that alternative.
- */
-altSwitchCase(altNum,alt) ::= <<
-case <altNum>:
-	<@prealt()>
-	DebugEnterAlt(<altNum>);
-	<alt>
-	break;<\n>
->>
-
-/** An alternative is just a list of elements; at outermost level */
-alt(elements,altNum,description,autoAST,outerAlt,treeLevel,rew) ::= <<
-// <fileName>:<description>
-{
-<@declarations()>
-<elements:element()>
-<rew>
-<@cleanup()>
-}
->>
-
-/** What to emit when there is no rewrite.  For auto build
- *  mode, does nothing.
- */
-noRewrite(rewriteBlockLevel, treeLevel) ::= ""
-
-// E L E M E N T S
-
-/** Dump the elements one per line */
-element(it) ::= <%
-<@prematch()>
-DebugLocation(<it.line>, <it.pos>);<\n>
-<it.el><\n>
-%>
-
-/** match a token optionally with a label in front */
-tokenRef(token,label,elementIndex,terminalOptions={}) ::= <<
-<if(label)><label>=(<labelType>)<endif>Match(input,<token>,Follow._<token>_in_<ruleName><elementIndex>); <checkRuleBacktrackFailure()>
->>
-
-/** ids+=ID */
-tokenRefAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRef(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-listLabelElem(label,elem,elemType) ::= <<
-if (list_<label>==null) list_<label>=new List\<<elemType; null={<labelType>}>\>();
-list_<label>.Add(<elem>);<\n>
->>
-
-/** match a character */
-charRef(char,label) ::= <<
-<if(label)>
-<label> = input.LA(1);<\n>
-<endif>
-Match(<char>); <checkRuleBacktrackFailure()>
->>
-
-/** match a character range */
-charRangeRef(a,b,label) ::= <<
-<if(label)>
-<label> = input.LA(1);<\n>
-<endif>
-MatchRange(<a>,<b>); <checkRuleBacktrackFailure()>
->>
-
-/** For now, sets are interval tests and must be tested inline */
-matchSet(s,label,elementIndex,postmatchCode="",terminalOptions={}) ::= <<
-<if(label)>
-<matchSetLabel()>
-<endif>
-if (<s>)
-{
-	input.Consume();
-	<postmatchCode>
-	<if(!LEXER)>state.errorRecovery=false;<endif><if(backtracking)>state.failed=false;<endif>
-}
-else
-{
-	<ruleBacktrackFailure()>
-	MismatchedSetException mse = new MismatchedSetException(null,input);
-	DebugRecognitionException(mse);
-	<@mismatchedSetException()>
-<if(LEXER)>
-	Recover(mse);
-	throw mse;
-<else>
-	throw mse;
-	<! use following code to make it recover inline; remove throw mse;
-	recoverFromMismatchedSet(input,mse,Follow._set_in_<ruleName><elementIndex>);
-	!>
-<endif>
-}<\n>
->>
-
-matchSetUnchecked(s,label,elementIndex,postmatchCode=false) ::= <%
-<if(label)>
-<matchSetLabel()><\n>
-<endif>
-input.Consume();<\n>
-<if(postmatchCode)>
-<postmatchCode><\n>
-<endif>
-<if(!LEXER)>state.errorRecovery=false;<endif><if(backtracking)>state.failed=false;<endif>
-%>
-
-matchSetLabel() ::= <%
-<if(LEXER)>
-<label>= input.LA(1);
-<else>
-<label>=(<labelType>)input.LT(1);
-<endif>
-%>
-
-matchRuleBlockSet ::= matchSet
-
-matchSetAndListLabel(s,label,elementIndex,postmatchCode) ::= <<
-<matchSet(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** Match a string literal */
-lexerStringRef(string,label,elementIndex) ::= <%
-<if(label)>
-int <label>Start = CharIndex;<\n>
-Match(<string>); <checkRuleBacktrackFailure()><\n>
-int <label>StartLine<elementIndex> = Line;<\n>
-int <label>StartCharPos<elementIndex> = CharPositionInLine;<\n>
-<label> = new <labelType>(input, TokenTypes.Invalid, TokenChannels.Default, <label>Start, CharIndex-1);<\n>
-<label>.Line = <label>StartLine<elementIndex>;<\n>
-<label>.CharPositionInLine = <label>StartCharPos<elementIndex>;
-<else>
-Match(<string>); <checkRuleBacktrackFailure()><\n>
-<endif>
-%>
-
-wildcard(token,label,elementIndex,terminalOptions={}) ::= <<
-<if(label)>
-<label>=(<labelType>)input.LT(1);<\n>
-<endif>
-MatchAny(input); <checkRuleBacktrackFailure()>
->>
-
-wildcardAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<wildcard(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** Match . wildcard in lexer */
-wildcardChar(label, elementIndex) ::= <<
-<if(label)>
-<label> = input.LA(1);<\n>
-<endif>
-MatchAny(); <checkRuleBacktrackFailure()>
->>
-
-wildcardCharListLabel(label, elementIndex) ::= <<
-<wildcardChar(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** Match a rule reference by invoking it possibly with arguments
- *  and a return value or values.  The 'rule' argument was the
- *  target rule name, but now is type Rule, whose toString is
- *  same: the rule name.  Now though you can access full rule
- *  descriptor stuff.
- */
-ruleRef(rule,label,elementIndex,args,scope) ::= <<
-PushFollow(Follow._<rule.name>_in_<ruleName><elementIndex>);
-<if(label)><label>=<endif><if(scope)><scope:delegateName()>.<endif><rule.name; format="id">(<args; separator=", ">);
-PopFollow();
-<checkRuleBacktrackFailure()>
->>
-
-/** ids+=r */
-ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRef(...)>
-<listLabelElem(elem=label,elemType={<ASTLabelType>},...)>
->>
-
-/** A lexer rule reference.
- *
- *  The 'rule' argument was the target rule name, but now
- *  is type Rule, whose toString is same: the rule name.
- *  Now though you can access full rule descriptor stuff.
- */
-lexerRuleRef(rule,label,args,elementIndex,scope) ::= <%
-<if(label)>
-int <label>Start<elementIndex> = CharIndex;<\n>
-int <label>StartLine<elementIndex> = Line;<\n>
-int <label>StartCharPos<elementIndex> = CharPositionInLine;<\n>
-<if(scope)><scope:delegateName()>.<endif>m<rule.name>(<args; separator=", ">); <checkRuleBacktrackFailure()><\n>
-<label> = new <labelType>(input, TokenTypes.Invalid, TokenChannels.Default, <label>Start<elementIndex>, CharIndex-1);<\n>
-<label>.Line = <label>StartLine<elementIndex>;<\n>
-<label>.CharPositionInLine = <label>StartCharPos<elementIndex>;
-<else>
-<if(scope)><scope:delegateName()>.<endif>m<rule.name>(<args; separator=", ">); <checkRuleBacktrackFailure()>
-<endif>
-%>
-
-/** i+=INT in lexer */
-lexerRuleRefAndListLabel(rule,label,args,elementIndex,scope) ::= <<
-<lexerRuleRef(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** EOF in the lexer */
-lexerMatchEOF(label,elementIndex) ::= <%
-<if(label)>
-int <label>Start<elementIndex> = CharIndex;<\n>
-int <label>StartLine<elementIndex> = Line;<\n>
-int <label>StartCharPos<elementIndex> = CharPositionInLine;<\n>
-Match(EOF); <checkRuleBacktrackFailure()><\n>
-<labelType> <label> = new <labelType>(input, EOF, TokenChannels.Default, <label>Start<elementIndex>, CharIndex-1);<\n>
-<label>.Line = <label>StartLine<elementIndex>;<\n>
-<label>.CharPositionInLine = <label>StartCharPos<elementIndex>;
-<else>
-Match(EOF); <checkRuleBacktrackFailure()>
-<endif>
-%>
-
-// used for left-recursive rules
-recRuleDefArg()                       ::= "int <recRuleArg()>"
-recRuleArg()                          ::= "_p"
-recRuleAltPredicate(ruleName,opPrec)  ::= "<recRuleArg()> \<= <opPrec>"
-recRuleSetResultAction()              ::= "root_0=$<ruleName>_primary.tree;"
-recRuleSetReturnAction(src,name)      ::= "$<name>=$<src>.<name>;"
-
-/** match ^(root children) in tree parser */
-tree(root, actionsAfterRoot, children, nullableChildList,
-     enclosingTreeLevel, treeLevel) ::= <<
-<root:element()>
-<actionsAfterRoot:element()>
-<if(nullableChildList)>
-if (input.LA(1) == TokenTypes.Down)
-{
-	Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()>
-	<children:element()>
-	Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()>
-}
-<else>
-Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()>
-<children:element()>
-Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()>
-<endif>
->>
-
-/** Every predicate is used as a validating predicate (even when it is
- *  also hoisted into a prediction expression).
- */
-validateSemanticPredicate(pred,description) ::= <<
-if (!(<evalPredicate(...)>))
-{
-	<ruleBacktrackFailure()>
-	throw new FailedPredicateException(input, "<ruleName>", "<description>");
-}
->>
-
-// F i x e d  D F A  (if-then-else)
-
-dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
-int LA<decisionNumber>_<k> = input.LA(<k>);<\n>
-<edges; separator="\nelse ">
-<if((!isTrue.(last(edges).labelExpr)) && (!last(edges).predicates))>
-else
-{
-<if(eotPredictsAlt)>
-	alt<decisionNumber> = <eotPredictsAlt>;
-<else>
-	<ruleBacktrackFailure()>
-	NoViableAltException nvae = new NoViableAltException("<description>", <decisionNumber>, <stateNumber>, input, <k>);
-	DebugRecognitionException(nvae);
-	<@noViableAltException()>
-	throw nvae;
-<endif>
-}
-<endif>
->>
-
-/** Same as a normal DFA state except that we don't examine lookahead
- *  for the bypass alternative.  It delays error detection but this
- *  is faster, smaller, and more what people expect.  For (X)? people
- *  expect "if ( LA(1)==X ) match(X);" and that's it.
- */
-dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
-int LA<decisionNumber>_<k> = input.LA(<k>);<\n>
-<edges; separator="\nelse ">
->>
-
-/** A DFA state that is actually the loopback decision of a closure
- *  loop.  If end-of-token (EOT) predicts any of the targets then it
- *  should act like a default clause (i.e., no error can be generated).
- *  This is used only in the lexer so that for ('a')* on the end of a rule
- *  anything other than 'a' predicts exiting.
- */
-dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
-int LA<decisionNumber>_<k> = input.LA(<k>);<\n>
-<edges; separator="\nelse "><\n>
-<if(eotPredictsAlt)>
-<if(!edges)>
-alt<decisionNumber> = <eotPredictsAlt>;<! if no edges, don't gen ELSE !>
-<else>
-else
-{
-	alt<decisionNumber> = <eotPredictsAlt>;
-}<\n>
-<endif>
-<endif>
->>
-
-/** An accept state indicates a unique alternative has been predicted */
-dfaAcceptState(alt) ::= "alt<decisionNumber> = <alt>;"
-
-/** A simple edge with an expression.  If the expression is satisfied,
- *  enter to the target state.  To handle gated productions, we may
- *  have to evaluate some predicates for this edge.
- */
-dfaEdge(labelExpr, targetState, predicates) ::= <<
-if ((<labelExpr>)<if(predicates)> && (<predicates>)<endif>)
-{
-	<targetState>
-}
->>
-
-// F i x e d  D F A  (switch case)
-
-/** A DFA state where a SWITCH may be generated.  The code generator
- *  decides if this is possible: CodeGenerator.canGenerateSwitch().
- */
-dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
-switch (input.LA(<k>))
-{
-<edges; separator="\n">
-default:
-<if(eotPredictsAlt)>
-	alt<decisionNumber>=<eotPredictsAlt>;
-	break;<\n>
-<else>
-	{
-		<ruleBacktrackFailure()>
-		NoViableAltException nvae = new NoViableAltException("<description>", <decisionNumber>, <stateNumber>, input, <k>);
-		DebugRecognitionException(nvae);
-		<@noViableAltException()>
-		throw nvae;
-	}
-<endif>
-}<\n>
->>
-
-dfaOptionalBlockStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
-switch (input.LA(<k>))
-{
-<edges; separator="\n">
-}<\n>
->>
-
-dfaLoopbackStateSwitch(k, edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
-switch (input.LA(<k>))
-{
-<edges; separator="\n">
-<if(eotPredictsAlt)>
-default:
-	alt<decisionNumber>=<eotPredictsAlt>;
-	break;<\n>
-<endif>
-}<\n>
->>
-
-dfaEdgeSwitch(labels, targetState) ::= <<
-<labels:{it|case <it>:}; separator="\n">
-	{
-	<targetState>
-	}
-	break;
->>
-
-// C y c l i c  D F A
-
-/** The code to initiate execution of a cyclic DFA; this is used
- *  in the rule to predict an alt just like the fixed DFA case.
- *  The <name> attribute is inherited via the parser, lexer, ...
- */
-dfaDecision(decisionNumber,description) ::= <<
-try
-{
-	alt<decisionNumber> = dfa<decisionNumber>.Predict(input);
-}
-catch (NoViableAltException nvae)
-{
-	DebugRecognitionException(nvae);
-	throw;
-}
->>
-
-/* Dump DFA tables as run-length-encoded Strings of octal values.
- * Can't use hex as compiler translates them before compilation.
- * These strings are split into multiple, concatenated strings.
- * Java puts them back together at compile time thankfully.
- * Java cannot handle large static arrays, so we're stuck with this
- * encode/decode approach.  See analysis and runtime DFA for
- * the encoding methods.
- */
-cyclicDFA(dfa) ::= <<
-private class DFA<dfa.decisionNumber> : DFA
-{
-	private const string DFA<dfa.decisionNumber>_eotS =
-		"<dfa.javaCompressedEOT; wrap="\"+\n\t\t\"">";
-	private const string DFA<dfa.decisionNumber>_eofS =
-		"<dfa.javaCompressedEOF; wrap="\"+\n\t\t\"">";
-	private const string DFA<dfa.decisionNumber>_minS =
-		"<dfa.javaCompressedMin; wrap="\"+\n\t\t\"">";
-	private const string DFA<dfa.decisionNumber>_maxS =
-		"<dfa.javaCompressedMax; wrap="\"+\n\t\t\"">";
-	private const string DFA<dfa.decisionNumber>_acceptS =
-		"<dfa.javaCompressedAccept; wrap="\"+\n\t\t\"">";
-	private const string DFA<dfa.decisionNumber>_specialS =
-		"<dfa.javaCompressedSpecial; wrap="\"+\n\t\t\"">}>";
-	private static readonly string[] DFA<dfa.decisionNumber>_transitionS =
-		{
-			<dfa.javaCompressedTransition:{s|"<s; wrap="\"+\n\"">"}; separator=",\n">
-		};
-
-	private static readonly short[] DFA<dfa.decisionNumber>_eot = DFA.UnpackEncodedString(DFA<dfa.decisionNumber>_eotS);
-	private static readonly short[] DFA<dfa.decisionNumber>_eof = DFA.UnpackEncodedString(DFA<dfa.decisionNumber>_eofS);
-	private static readonly char[] DFA<dfa.decisionNumber>_min = DFA.UnpackEncodedStringToUnsignedChars(DFA<dfa.decisionNumber>_minS);
-	private static readonly char[] DFA<dfa.decisionNumber>_max = DFA.UnpackEncodedStringToUnsignedChars(DFA<dfa.decisionNumber>_maxS);
-	private static readonly short[] DFA<dfa.decisionNumber>_accept = DFA.UnpackEncodedString(DFA<dfa.decisionNumber>_acceptS);
-	private static readonly short[] DFA<dfa.decisionNumber>_special = DFA.UnpackEncodedString(DFA<dfa.decisionNumber>_specialS);
-	private static readonly short[][] DFA<dfa.decisionNumber>_transition;
-
-	static DFA<dfa.decisionNumber>()
-	{
-		int numStates = DFA<dfa.decisionNumber>_transitionS.Length;
-		DFA<dfa.decisionNumber>_transition = new short[numStates][];
-		for ( int i=0; i \< numStates; i++ )
-		{
-			DFA<dfa.decisionNumber>_transition[i] = DFA.UnpackEncodedString(DFA<dfa.decisionNumber>_transitionS[i]);
-		}
-	}
-
-	public DFA<dfa.decisionNumber>( BaseRecognizer recognizer<if(dfa.specialStateSTs)>, SpecialStateTransitionHandler specialStateTransition<endif> )
-<if(dfa.specialStateSTs)>
-		: base(specialStateTransition)
-<endif>
-	{
-		this.recognizer = recognizer;
-		this.decisionNumber = <dfa.decisionNumber>;
-		this.eot = DFA<dfa.decisionNumber>_eot;
-		this.eof = DFA<dfa.decisionNumber>_eof;
-		this.min = DFA<dfa.decisionNumber>_min;
-		this.max = DFA<dfa.decisionNumber>_max;
-		this.accept = DFA<dfa.decisionNumber>_accept;
-		this.special = DFA<dfa.decisionNumber>_special;
-		this.transition = DFA<dfa.decisionNumber>_transition;
-	}
-
-	public override string Description { get { return "<dfa.description>"; } }
-
-	public override void Error(NoViableAltException nvae)
-	{
-		DebugRecognitionException(nvae);
-	}
-}<\n>
-<if(dfa.specialStateSTs)>
-private int SpecialStateTransition<dfa.decisionNumber>(DFA dfa, int s, IIntStream _input)<! throws NoViableAltException!>
-{
-	<if(LEXER)>
-	IIntStream input = _input;
-	<endif>
-	<if(PARSER)>
-	ITokenStream input = (ITokenStream)_input;
-	<endif>
-	<if(TREE_PARSER)>
-	ITreeNodeStream input = (ITreeNodeStream)_input;
-	<endif>
-	int _s = s;
-	s = -1;
-	<! pull these outside the switch cases to save space on locals !>
-	int LA<dfa.decisionNumber>_1 = input.LA(1);
-	int index<dfa.decisionNumber>_1 = input.Index;
-	switch (_s)
-	{
-	<dfa.specialStateSTs:{state |case <i0>:<! compressed special state numbers 0..n-1 !>
-	<state>}; separator="\n">
-
-	default:
-		break;
-	}
-
-	if (s >= 0)
-		return s;
-
-<if(backtracking)>
-	if (state.backtracking > 0) {state.failed=true; return -1;}
-<endif>
-	NoViableAltException nvae = new NoViableAltException(dfa.Description, <dfa.decisionNumber>, _s, input);
-	dfa.Error(nvae);
-	throw nvae;
-}
-<endif>
->>
-
-/** A state in a cyclic DFA; it's a special state and part of a big switch on
- *  state.
- */
-cyclicDFAState(decisionNumber,stateNumber,edges,needErrorClause,semPredState) ::= <<
-{
-<if(semPredState)>
-	<! get next lookahead symbol to test edges, then rewind !>
-	input.Rewind();
-<endif>
-	<edges; separator="\nelse ">
-<if(semPredState)>
-	<! return input cursor to state before we rewound !>
-	input.Seek(index<decisionNumber>_1);
-<endif>
-	break;
-}
->>
-
-/** Just like a fixed DFA edge, test the lookahead and indicate what
- *  state to jump to next if successful.
- */
-cyclicDFAEdge(labelExpr, targetStateNumber, edgeNumber, predicates) ::= <<
-if ((<labelExpr>)<if(predicates)> && (<predicates>)<endif>) {s = <targetStateNumber>;}<\n>
->>
-
-/** An edge pointing at end-of-token; essentially matches any char;
- *  always jump to the target.
- */
-eotDFAEdge(targetStateNumber,edgeNumber, predicates) ::= <<
-s = <targetStateNumber>;<\n>
->>
-
-
-// D F A  E X P R E S S I O N S
-
-andPredicates(left,right) ::= "(<left>&&<right>)"
-
-orPredicates(operands) ::= "(<operands; separator=\"||\">)"
-
-notPredicate(pred) ::= "!(<evalPredicate(...)>)"
-
-evalPredicate(pred,description) ::= "(<pred>)"
-
-evalSynPredicate(pred,description) ::= "EvaluatePredicate(<pred>_fragment)"
-
-lookaheadTest(atom,k,atomAsInt) ::= "LA<decisionNumber>_<k>==<atom>"
-
-/** Sometimes a lookahead test cannot assume that LA(k) is in a temp variable
- *  somewhere.  Must ask for the lookahead directly.
- */
-isolatedLookaheadTest(atom,k,atomAsInt) ::= "input.LA(<k>)==<atom>"
-
-lookaheadRangeTest(lower,upper,k,rangeNumber,lowerAsInt,upperAsInt) ::= <%
-(LA<decisionNumber>_<k><ge()><lower> && LA<decisionNumber>_<k><le()><upper>)
-%>
-
-isolatedLookaheadRangeTest(lower,upper,k,rangeNumber,lowerAsInt,upperAsInt) ::= "(input.LA(<k>)<ge()><lower> && input.LA(<k>)<le()><upper>)"
-
-le() ::= "\<="
-ge() ::= ">="
-
-setTest(ranges) ::= <<
-<ranges; separator="||">
->>
-
-// A T T R I B U T E S
-
-attributeScope(scope) ::= <<
-<if(scope)>
-<if(scope.attributes)>
-protected sealed partial class <scope.name>_scope
-{
-	<scope.attributes:{it|public <it.decl>;}; separator="\n">
-}
-<if(scope.actions.scopeinit)>
-protected void <scope.name>_scopeInit( <scope.name>_scope scope )
-{
-	<scope.actions.scopeinit>
-}
-<else>
-protected virtual void <scope.name>_scopeInit( <scope.name>_scope scope ) {}
-<endif>
-<if(scope.actions.scopeafter)>
-protected void <scope.name>_scopeAfter( <scope.name>_scope scope )
-{
-	<scope.actions.scopeafter>
-}
-<else>
-protected virtual void <scope.name>_scopeAfter( <scope.name>_scope scope ) {}
-<endif>
-protected readonly ListStack\<<scope.name>_scope> <scope.name>_stack = new ListStack\<<scope.name>_scope>();
-<endif>
-<endif>
->>
-
-globalAttributeScope(scope) ::= <<
-<attributeScope(...)>
->>
-
-ruleAttributeScope(scope) ::= <<
-<attributeScope(...)>
->>
-
-returnStructName(it) ::= "<it.name>_return"
-
-returnType(ruleDescriptor) ::= <%
-<if(ruleDescriptor.returnScope.attributes && ruleDescriptor.hasMultipleReturnValues)>
-	<ruleDescriptor.grammar.recognizerName>.<ruleDescriptor:returnStructName()>
-<elseif(ruleDescriptor.hasMultipleReturnValues)>
-	<ruleReturnBaseType()>
-<elseif(ruleDescriptor.hasSingleReturnValue)>
-	<ruleDescriptor.singleValueReturnType>
-<else>
-	void
-<endif>
-%>
-
-/** Generate the C# type associated with a single or multiple return
- *  values.
- */
-ruleLabelType(referencedRule) ::= <%
-<if(referencedRule.hasMultipleReturnValues)>
-	<ruleReturnBaseType()>
-<elseif(referencedRule.hasSingleReturnValue)>
-	<referencedRule.singleValueReturnType>
-<else>
-	void
-<endif>
-%>
-
-delegateName(it) ::= <<
-<if(it.label)><it.label><else>g<it.name><endif>
->>
-
-/** Using a type to init value map, try to init a type; if not in table
- *  must be an object, default value is "null".
- */
-initValue(typeName) ::= <<
-default(<typeName>)
->>
-
-/** Define a rule label including default value */
-ruleLabelDef(label) ::= <%
-<ruleLabelType(referencedRule=label.referencedRule)> <label.label.text> = <initValue(typeName=ruleLabelType(referencedRule=label.referencedRule))>;
-%>
-
-/** Define a return struct for a rule if the code needs to access its
- *  start/stop tokens, tree stuff, attributes, ...  Leave a hole for
- *  subgroups to stick in members.
- */
-returnScope(scope) ::= <<
-<if(scope.attributes && ruleDescriptor.hasMultipleReturnValues)>
-<returnScopeModifier(grammar=grammar,ruleDescriptor=ruleDescriptor)> sealed partial class <ruleDescriptor:returnStructName()> : <ruleReturnBaseType()><@ruleReturnInterfaces()>
-{
-	<scope.attributes:{it|public <it.decl>;}; separator="\n">
-	<@ruleReturnMembers()>
-}
-<endif>
->>
-
-ruleReturnBaseType() ::= <%
-<if(TREE_PARSER)>Tree<else>Parser<endif>RuleReturnScope\<<labelType>>
-%>
-
-@returnScope.ruleReturnMembers() ::= <<
->>
-
-parameterScope(scope) ::= <<
-<scope.attributes:{it|<it.decl>}; separator=", ">
->>
-
-parameterAttributeRef(attr) ::= <<
-<attr.name; format="id">
->>
-
-parameterSetAttributeRef(attr,expr) ::= <<
-<attr.name; format="id"> =<expr>;
->>
-
-scopeAttributeRef(scope,attr,index,negIndex) ::= <%
-<if(negIndex)>
-<scope>_stack[<scope>_stack.Count - <negIndex> - 1].<attr.name; format="id">
-<else>
-<if(index)>
-<scope>_stack[<index>].<attr.name; format="id">
-<else>
-<scope>_stack.Peek().<attr.name; format="id">
-<endif>
-<endif>
-%>
-
-scopeSetAttributeRef(scope,attr,expr,index,negIndex) ::= <%
-<if(negIndex)>
-<scope>_stack[<scope>_stack.Count - <negIndex> - 1].<attr.name; format="id"> = <expr>;
-<else>
-<if(index)>
-<scope>_stack[<index>].<attr.name; format="id"> = <expr>;
-<else>
-<scope>_stack.Peek().<attr.name; format="id"> = <expr>;
-<endif>
-<endif>
-%>
-
-/** $x is either global scope or x is rule with dynamic scope; refers
- *  to stack itself not top of stack.  This is useful for predicates
- *  like {$function.Count>0 && $function::name.Equals("foo")}?
- */
-isolatedDynamicScopeRef(scope) ::= "<scope>_stack"
-
-/** reference an attribute of rule; might only have single return value */
-ruleLabelRef(referencedRule,scope,attr) ::= <%
-<if(referencedRule.hasMultipleReturnValues)>
-(<scope>!=null?((<returnType(referencedRule)>)<scope>).<attr.name; format="id">:<initValue(attr.type)>)
-<else>
-<scope>
-<endif>
-%>
-
-returnAttributeRef(ruleDescriptor,attr) ::= <%
-<if(ruleDescriptor.hasMultipleReturnValues)>
-retval.<attr.name; format="id">
-<else>
-<attr.name; format="id">
-<endif>
-%>
-
-returnSetAttributeRef(ruleDescriptor,attr,expr) ::= <%
-<if(ruleDescriptor.hasMultipleReturnValues)>
-retval.<attr.name; format="id"> =<expr>;
-<else>
-<attr.name; format="id"> =<expr>;
-<endif>
-%>
-
-/** How to translate $tokenLabel */
-tokenLabelRef(label) ::= "<label>"
-
-/** ids+=ID {$ids} or e+=expr {$e} */
-listLabelRef(label) ::= "list_<label>"
-
-
-// not sure the next are the right approach
-
-tokenLabelPropertyRef_text(scope,attr) ::= "(<scope>!=null?<scope>.Text:default(string))"
-tokenLabelPropertyRef_type(scope,attr) ::= "(<scope>!=null?<scope>.Type:0)"
-tokenLabelPropertyRef_line(scope,attr) ::= "(<scope>!=null?<scope>.Line:0)"
-tokenLabelPropertyRef_pos(scope,attr) ::= "(<scope>!=null?<scope>.CharPositionInLine:0)"
-tokenLabelPropertyRef_channel(scope,attr) ::= "(<scope>!=null?<scope>.Channel:0)"
-tokenLabelPropertyRef_index(scope,attr) ::= "(<scope>!=null?<scope>.TokenIndex:0)"
-tokenLabelPropertyRef_tree(scope,attr) ::= "<scope>_tree"
-tokenLabelPropertyRef_int(scope,attr) ::= "(<scope>!=null?int.Parse(<scope>.Text):0)"
-
-ruleLabelPropertyRef_start(scope,attr) ::= "(<scope>!=null?((<labelType>)<scope>.Start):default(<labelType>))"
-ruleLabelPropertyRef_stop(scope,attr) ::= "(<scope>!=null?((<labelType>)<scope>.Stop):default(<labelType>))"
-ruleLabelPropertyRef_tree(scope,attr) ::= "(<scope>!=null?((<ASTLabelType>)<scope>.Tree):default(<ASTLabelType>))"
-ruleLabelPropertyRef_text(scope,attr) ::= <%
-<if(TREE_PARSER)>
-(<scope>!=null?(input.TokenStream.ToString(
-  input.TreeAdaptor.GetTokenStartIndex(<scope>.Start),
-  input.TreeAdaptor.GetTokenStopIndex(<scope>.Start))):default(string))
-<else>
-(<scope>!=null?input.ToString(<scope>.Start,<scope>.Stop):default(string))
-<endif>
-%>
-
-ruleLabelPropertyRef_st(scope,attr) ::= "(<scope>!=null?<scope>.Template:null)"
-
-/** Isolated $RULE ref ok in lexer as it's a Token */
-lexerRuleLabel(label) ::= "<label>"
-
-lexerRuleLabelPropertyRef_type(scope,attr) ::=
-    "(<scope>!=null?<scope>.Type:0)"
-
-lexerRuleLabelPropertyRef_line(scope,attr) ::=
-    "(<scope>!=null?<scope>.Line:0)"
-
-lexerRuleLabelPropertyRef_pos(scope,attr) ::=
-    "(<scope>!=null?<scope>.CharPositionInLine:-1)"
-
-lexerRuleLabelPropertyRef_channel(scope,attr) ::=
-    "(<scope>!=null?<scope>.Channel:0)"
-
-lexerRuleLabelPropertyRef_index(scope,attr) ::=
-    "(<scope>!=null?<scope>.TokenIndex:0)"
-
-lexerRuleLabelPropertyRef_text(scope,attr) ::=
-    "(<scope>!=null?<scope>.Text:default(string))"
-
-lexerRuleLabelPropertyRef_int(scope,attr) ::=
-    "(<scope>!=null?int.Parse(<scope>.Text):0)"
-
-// Somebody may ref $template or $tree or $stop within a rule:
-rulePropertyRef_start(scope,attr) ::= "retval.Start"
-rulePropertyRef_stop(scope,attr) ::= "retval.Stop"
-rulePropertyRef_tree(scope,attr) ::= "retval.Tree"
-rulePropertyRef_text(scope,attr) ::= <%
-<if(TREE_PARSER)>
-input.TokenStream.ToString(
-  input.TreeAdaptor.GetTokenStartIndex(retval.Start),
-  input.TreeAdaptor.GetTokenStopIndex(retval.Start))
-<else>
-input.ToString(retval.Start,input.LT(-1))
-<endif>
-%>
-rulePropertyRef_st(scope,attr) ::= "retval.Template"
-
-lexerRulePropertyRef_text(scope,attr) ::= "Text"
-lexerRulePropertyRef_type(scope,attr) ::= "_type"
-lexerRulePropertyRef_line(scope,attr) ::= "state.tokenStartLine"
-lexerRulePropertyRef_pos(scope,attr) ::= "state.tokenStartCharPositionInLine"
-lexerRulePropertyRef_index(scope,attr) ::= "-1" // undefined token index in lexer
-lexerRulePropertyRef_channel(scope,attr) ::= "_channel"
-lexerRulePropertyRef_start(scope,attr) ::= "state.tokenStartCharIndex"
-lexerRulePropertyRef_stop(scope,attr) ::= "(CharIndex-1)"
-lexerRulePropertyRef_int(scope,attr) ::= "int.Parse(<scope>.Text)"
-
-// setting $st and $tree is allowed in local rule. everything else
-// is flagged as error
-ruleSetPropertyRef_tree(scope,attr,expr) ::= "retval.Tree = <expr>;"
-ruleSetPropertyRef_st(scope,attr,expr) ::= "retval.Template =<expr>;"
-
-/** How to execute an action (only when not backtracking) */
-execAction(action) ::= <%
-<if(backtracking)>
-if (<actions.(actionScope).synpredgate>)<\n>
-{<\n>
-<@indentedAction()><\n>
-}
-<else>
-<action>
-<endif>
-%>
-
-@execAction.indentedAction() ::= <<
-	<action>
->>
-
-/** How to always execute an action even when backtracking */
-execForcedAction(action) ::= "<action>"
-
-// M I S C (properties, etc...)
-
-bitset(name, words64) ::= <<
-public static readonly BitSet <name> = new BitSet(new ulong[]{<words64:{it|<it>UL};separator=",">});
->>
-
-codeFileExtension() ::= ".cs"
-
-true_value() ::= "true"
-false_value() ::= "false"
-
-isTrue ::= [
-	"true" : true,
-	default : false
-]
diff --git a/Tools/Antlr/Codegen/Templates/CSharp2/Dbg.stg b/Tools/Antlr/Codegen/Templates/CSharp2/Dbg.stg
deleted file mode 100644
index b537ff1f417..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp2/Dbg.stg
+++ /dev/null
@@ -1,313 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2007-2008 Johannes Luber
- * Copyright (c) 2005-2007 Kunle Odutola
- * Copyright (c) 2011 Sam Harwell
- * Copyright (c) 2011 Terence Parr
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-/** Template overrides to add debugging to normal Java output;
- *  If ASTs are built, then you'll also get ASTDbg.stg loaded.
- */
-
-@outputFile.debugPreprocessor() ::= "#define ANTLR_DEBUG"
-
-@outputFile.imports() ::= <<
-<@super.imports()>
-using Antlr.Runtime.Debug;
-using IOException = System.IO.IOException;
->>
-
-@genericParser.members() ::= <<
-<if(grammar.grammarIsRoot)>
-public static readonly string[] ruleNames =
-	new string[]
-	{
-		"invalidRule", <grammar.allImportedRules:{rST | "<rST.name>"}; wrap="\n	", separator=", ">
-	};<\n>
-<endif>
-<if(grammar.grammarIsRoot)><! grammar imports other grammar(s) !>
-int ruleLevel = 0;
-public virtual int RuleLevel { get { return ruleLevel; } }
-public virtual void IncRuleLevel() { ruleLevel++; }
-public virtual void DecRuleLevel() { ruleLevel--; }
-<if(profile)>
-<ctorForProfilingRootGrammar()>
-<else>
-<ctorForRootGrammar()>
-<endif>
-<ctorForPredefinedListener()>
-<else><! imported grammar !>
-public int RuleLevel { get { return <grammar.delegators:{g| <g:delegateName()>}>.RuleLevel; } }
-public void IncRuleLevel() { <grammar.delegators:{g| <g:delegateName()>}>.IncRuleLevel(); }
-public void DecRuleLevel() { <grammar.delegators:{g| <g:delegateName()>}>.DecRuleLevel(); }
-<ctorForDelegateGrammar()>
-<endif>
-<if(profile)>
-public override bool AlreadyParsedRule( IIntStream input, int ruleIndex )
-{
-	int stopIndex = GetRuleMemoization(ruleIndex, input.Index);
-	((Profiler)dbg).ExamineRuleMemoization(input, ruleIndex, stopIndex, <grammar.composite.rootGrammar.recognizerName>.ruleNames[ruleIndex]);
-	return base.AlreadyParsedRule(input, ruleIndex);
-}<\n>
-public override void Memoize( IIntStream input, int ruleIndex, int ruleStartIndex )
-{
-	((Profiler)dbg).Memoize(input, ruleIndex, ruleStartIndex, <grammar.composite.rootGrammar.recognizerName>.ruleNames[ruleIndex]);
-	base.Memoize(input, ruleIndex, ruleStartIndex);
-}<\n>
-<endif>
-protected virtual bool EvalPredicate( bool result, string predicate )
-{
-	dbg.SemanticPredicate( result, predicate );
-	return result;
-}<\n>
->>
-
-ctorForRootGrammar() ::= <<
-<! bug: can't use <@super.members()> cut-n-paste instead !>
-<! Same except we add port number and profile stuff if root grammar !>
-<actions.(actionScope).ctorModifier; null="public"> <name>( <inputStreamType> input )
-	: this( input, DebugEventSocketProxy.DefaultDebuggerPort, new RecognizerSharedState() )
-{
-}
-<actions.(actionScope).ctorModifier; null="public"> <name>( <inputStreamType> input, int port, RecognizerSharedState state )
-	: base( input, state )
-{
-	<createListenerAndHandshake()>
-	<grammar.directDelegates:{g|<g:delegateName()> = new <g.recognizerName>( input, dbg, this.state, this<grammar.delegators:{g|, <g:delegateName()>}> );}; separator="\n">
-	<parserCtorBody()>
-	<@finally()>
-}<\n>
->>
-
-ctorForProfilingRootGrammar() ::= <<
-<! bug: can't use <@super.members()> cut-n-paste instead !>
-<actions.(actionScope).ctorModifier; null="public"> <name>( <inputStreamType> input )
-	: this( input, new Profiler(null), new RecognizerSharedState() )
-{
-}
-<actions.(actionScope).ctorModifier; null="public"> <name>( <inputStreamType> input, IDebugEventListener dbg, RecognizerSharedState state )
-	: base( input, dbg, state )
-{
-	Profiler p = (Profiler)dbg;
-	p.setParser(this);
-	<grammar.directDelegates:
-	 {g|<g:delegateName()> = new <g.recognizerName>( input, dbg, this.state, this<grammar.delegators:{g|, <g:delegateName()>}> );}; separator="\n">
-	<parserCtorBody()>
-	<@finally()>
-}
-<\n>
->>
-
-/** Basically we don't want to set any dbg listeners are root will have it. */
-ctorForDelegateGrammar() ::= <<
-<actions.(actionScope).ctorModifier; null="public"> <name>( <inputStreamType> input, IDebugEventListener dbg, RecognizerSharedState state<grammar.delegators:{g|, <g.recognizerName> <g:delegateName()>}> )
-	: base( input, dbg, state )
-{
-	<grammar.directDelegates:
-	 {g|<g:delegateName()> = new <g.recognizerName>( input, this, this.state<grammar.delegators:{g|, <g:delegateName()>}> );}; separator="\n">
-	<parserCtorBody()>
-}<\n>
->>
-
-ctorForPredefinedListener() ::= <<
-<actions.(actionScope).ctorModifier; null="public"> <name>( <inputStreamType> input, IDebugEventListener dbg )
-	<@superClassRef>: base( input, dbg, new RecognizerSharedState() )<@end>
-{
-<if(profile)>
-	Profiler p = (Profiler)dbg;
-	p.setParser(this);
-<endif>
-	<grammar.directDelegates:{g|<g:delegateName()> = new <g.recognizerName>(input, dbg, this.state, this<grammar.delegators:{g|, <g:delegateName()>}>);}; separator="\n">
-	<parserCtorBody()>
-	<@finally()>
-}<\n>
->>
-
-createListenerAndHandshake() ::= <<
-<if(TREE_PARSER)>
-DebugEventSocketProxy proxy = new DebugEventSocketProxy( this, port, input.TreeAdaptor );<\n>
-<else>
-DebugEventSocketProxy proxy = new DebugEventSocketProxy( this, port, null );<\n>
-<endif>
-DebugListener = proxy;
-try
-{
-	proxy.Handshake();
-}
-catch ( IOException ioe )
-{
-	ReportError( ioe );
-}
->>
-
-@genericParser.superClassName() ::= "Debug<@super.superClassName()>"
-
-/*
- * Many of the following rules were merged into CSharp2.stg.
- */
-
-@rule.preamble() ::= <<
-if (RuleLevel == 0)
-	DebugListener.Commence();
-IncRuleLevel();
->>
-//@rule.preamble() ::= <<
-//try
-//{
-//	dbg.EnterRule( GrammarFileName, "<ruleName>" );
-//	if ( RuleLevel == 0 )
-//	{
-//		dbg.Commence();
-//	}
-//	IncRuleLevel();
-//	dbg.Location( <ruleDescriptor.tree.line>, <ruleDescriptor.tree.charPositionInLine> );<\n>
-//>>
-
-@rule.postamble() ::= <<
-DecRuleLevel();
-if (RuleLevel == 0)
-	DebugListener.Terminate();
->>
-//@rule.postamble() ::= <<
-//dbg.Location(<ruleDescriptor.EORNode.line>, <ruleDescriptor.EORNode.charPositionInLine>);<\n>
-//}
-//finally
-//{
-//	dbg.ExitRule( GrammarFileName, "<ruleName>" );
-//	DecRuleLevel();
-//	if ( RuleLevel == 0 )
-//	{
-//		dbg.Terminate();
-//	}
-//}<\n>
-//>>
-
-//@insertSynpreds.start() ::= "dbg.BeginBacktrack( state.backtracking );"
-//@insertSynpreds.stop() ::= "dbg.EndBacktrack( state.backtracking, success );"
-
-// Common debug event triggers used by region overrides below
-
-//enterSubRule() ::= <<
-//try
-//{
-//	dbg.EnterSubRule( <decisionNumber> );<\n>
-//>>
-
-//exitSubRule() ::= <<
-//}
-//finally
-//{
-//	dbg.ExitSubRule( <decisionNumber> );
-//}<\n>
-//>>
-
-//enterDecision() ::= <<
-//try
-//{
-//	dbg.EnterDecision( <decisionNumber> );<\n>
-//>>
-
-//exitDecision() ::= <<
-//}
-//finally
-//{
-//	dbg.ExitDecision( <decisionNumber> );
-//}<\n>
-//>>
-
-//enterAlt(n) ::= "dbg.EnterAlt( <n> );<\n>"
-
-// Region overrides that tell various constructs to add debugging triggers
-
-//@block.predecision() ::= "<enterSubRule()><enterDecision()>"
-
-//@block.postdecision() ::= "<exitDecision()>"
-
-//@block.postbranch() ::= "<exitSubRule()>"
-
-//@ruleBlock.predecision() ::= "<enterDecision()>"
-
-//@ruleBlock.postdecision() ::= "<exitDecision()>"
-
-//@ruleBlockSingleAlt.prealt() ::= "<enterAlt(n=\"1\")>"
-
-//@blockSingleAlt.prealt() ::= "<enterAlt(n=\"1\")>"
-
-//@positiveClosureBlock.preloop() ::= "<enterSubRule()>"
-
-//@positiveClosureBlock.postloop() ::= "<exitSubRule()>"
-
-//@positiveClosureBlock.predecision() ::= "<enterDecision()>"
-
-//@positiveClosureBlock.postdecision() ::= "<exitDecision()>"
-
-//@positiveClosureBlock.earlyExitException() ::=
-//	"dbg.RecognitionException( eee<decisionNumber> );<\n>"
-
-//@closureBlock.preloop() ::= "<enterSubRule()>"
-
-//@closureBlock.postloop() ::= "<exitSubRule()>"
-
-//@closureBlock.predecision() ::= "<enterDecision()>"
-
-//@closureBlock.postdecision() ::= "<exitDecision()>"
-
-//@altSwitchCase.prealt() ::= "<enterAlt(n=i)>"
-
-//@element.prematch() ::=
-//	"dbg.Location( <it.line>, <it.pos> );"
-
-//@matchSet.mismatchedSetException() ::=
-//	"dbg.RecognitionException( mse );"
-
-//@dfaState.noViableAltException() ::= "dbg.RecognitionException( nvae );"
-
-//@dfaStateSwitch.noViableAltException() ::= "dbg.RecognitionException( nvae );"
-
-//dfaDecision(decisionNumber,description) ::= <<
-//try
-//{
-//	isCyclicDecision = true;
-//	<super.dfaDecision(...)>
-//}
-//catch ( NoViableAltException nvae )
-//{
-//	dbg.RecognitionException( nvae );
-//	throw nvae;
-//}
-//>>
-
-//@cyclicDFA.errorMethod() ::= <<
-//public override void Error( NoViableAltException nvae )
-//{
-//	((DebugParser)recognizer).dbg.RecognitionException( nvae );
-//}
-//>>
-
-/** Force predicate validation to trigger an event */
-evalPredicate(pred,description) ::= <<
-EvalPredicate(<pred>, "<description>")
->>
diff --git a/Tools/Antlr/Codegen/Templates/CSharp2/ST.stg b/Tools/Antlr/Codegen/Templates/CSharp2/ST.stg
deleted file mode 100644
index d6dd97345c3..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp2/ST.stg
+++ /dev/null
@@ -1,171 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2007-2008 Johannes Luber
- * Copyright (c) 2005-2007 Kunle Odutola
- * Copyright (c) 2011 Sam Harwell
- * Copyright (c) 2011 Terence Parr
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-/** Template subgroup to add template rewrite output
- *  If debugging, then you'll also get STDbg.stg loaded.
- */
-
-@outputFile.imports() ::= <<
-<@super.imports()>
-using Antlr.StringTemplate;
-using Antlr.StringTemplate.Language;
-<if(!backtracking)>
-using Hashtable = System.Collections.Hashtable;
-<endif>
-
->>
-
-/** Add this to each rule's return value struct */
-@returnScope.ruleReturnMembers() ::= <<
-private StringTemplate _st;
-public StringTemplate Template { get { return _st; } set { _st = value; } }
-public override string ToString() { return (Template==null) ? string.Empty : Template.ToString(); }
->>
-
-@genericParser.members() ::= <<
-<@super.members()>
-protected StringTemplateGroup templateLib = new StringTemplateGroup("<name>Templates", typeof(AngleBracketTemplateLexer) );
-
-public StringTemplateGroup TemplateLib
-{
- 	get { return this.templateLib; }
- 	set { this.templateLib = value; }
-}
-
-/// \<summary> Allows convenient multi-value initialization:
-///  "new STAttrMap().Add(...).Add(...)"
-/// \</summary>
-protected class STAttrMap : Hashtable
-{
-  public STAttrMap Add(string attrName, object value)
-  {
-    base.Add(attrName, value);
-    return this;
-  }
-  public STAttrMap Add(string attrName, int value)
-  {
-    base.Add(attrName, value);
-    return this;
-  }
-}
->>
-
-/** x+=rule when output=template */
-ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRef(...)>
-<listLabel(elem=label+".Template",...)>
->>
-
-rewriteTemplate(alts) ::= <<
-
-// TEMPLATE REWRITE
-<if(backtracking)>
-if ( <actions.(actionScope).synpredgate> )
-{
-  <alts:rewriteTemplateAlt(); separator="else ">
-  <if(rewriteMode)><replaceTextInLine()><endif>
-}
-<else>
-<alts:rewriteTemplateAlt(); separator="else ">
-<if(rewriteMode)><replaceTextInLine()><endif>
-<endif>
->>
-
-replaceTextInLine() ::= <<
-<if(TREE_PARSER)>
-((TokenRewriteStream)input.TokenStream).Replace(
-  input.TreeAdaptor.GetTokenStartIndex(retval.Start),
-  input.TreeAdaptor.GetTokenStopIndex(retval.Start),
-  retval.Template);
-<else>
-((TokenRewriteStream)input).Replace(
-  ((IToken)retval.Start).TokenIndex,
-  input.LT(-1).TokenIndex,
-  retval.Template);
-<endif>
->>
-
-rewriteTemplateAlt() ::= <<
-// <it.description>
-<if(it.pred)>
-if (<it.pred>) {
-    retval.Template = <it.alt>;
-}<\n>
-<else>
-{
-    retval.Template = <it.alt>;
-}<\n>
-<endif>
->>
-
-rewriteEmptyTemplate(alts) ::= <<
-null;
->>
-
-/** Invoke a template with a set of attribute name/value pairs.
- *  Set the value of the rule's template *after* having set
- *  the attributes because the rule's template might be used as
- *  an attribute to build a bigger template; you get a self-embedded
- *  template.
- */
-rewriteExternalTemplate(name,args) ::= <<
-templateLib.GetInstanceOf("<name>"<if(args)>,
-  new STAttrMap()<args:{a | .Add("<a.name>", <a.value>)}>
-  <endif>)
->>
-
-/** expr is a string expression that says what template to load */
-rewriteIndirectTemplate(expr,args) ::= <<
-templateLib.GetInstanceOf(<expr><if(args)>,
-  new STAttrMap()<args:{a | .Add("<a.name>", <a.value>)}>
-  <endif>)
->>
-
-/** Invoke an inline template with a set of attribute name/value pairs */
-rewriteInlineTemplate(args, template) ::= <<
-new StringTemplate(templateLib, "<template>"<if(args)>,
-  new STAttrMap()<args:{a | .Add("<a.name>", <a.value>)}>
-  <endif>)
->>
-
-/** plain -> {foo} action */
-rewriteAction(action) ::= <<
-<action>
->>
-
-/** An action has %st.attrName=expr; or %{st}.attrName=expr; */
-actionSetAttribute(st,attrName,expr) ::= <<
-(<st>).SetAttribute("<attrName>",<expr>);
->>
-
-/** Translate %{stringExpr} */
-actionStringConstructor(stringExpr) ::= <<
-new StringTemplate(templateLib,<stringExpr>)
->>
diff --git a/Tools/Antlr/Codegen/Templates/CSharp3/AST.stg b/Tools/Antlr/Codegen/Templates/CSharp3/AST.stg
deleted file mode 100644
index d1d765a233e..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp3/AST.stg
+++ /dev/null
@@ -1,428 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2011 Terence Parr
- * All rights reserved.
- *
- * Conversion to C#:
- * Copyright (c) 2011 Sam Harwell, Pixel Mine, Inc.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-@outputFile.imports() ::= <<
-<@super.imports()>
-
-<if(!TREE_PARSER)>
-<! tree parser would already have imported !>
-using Antlr.Runtime.Tree;
-using RewriteRuleITokenStream = Antlr.Runtime.Tree.RewriteRuleTokenStream;
-<endif>
->>
-
-@genericParser.members() ::= <<
-<@super.members()>
-<parserMembers()>
->>
-
-parserCtorBody() ::= <<
-<super.parserCtorBody()>
-<treeAdaptorType()> treeAdaptor = default(<treeAdaptorType()>);
-CreateTreeAdaptor(ref treeAdaptor);
-TreeAdaptor = treeAdaptor<if(!actions.(actionScope).treeAdaptorType)> ?? new CommonTreeAdaptor()<endif>;
->>
-
-/** Add an adaptor property that knows how to build trees */
-parserMembers() ::= <<
-// Implement this function in your helper file to use a custom tree adaptor
-partial void CreateTreeAdaptor(ref <treeAdaptorType()> adaptor);
-
-private <treeAdaptorType()> adaptor;
-
-public <treeAdaptorType()> TreeAdaptor
-{
-	get
-	{
-		return adaptor;
-	}
-
-	set
-	{
-		this.adaptor = value;
-		<grammar.directDelegates:{g|<g:delegateName()>.TreeAdaptor = this.adaptor;}>
-	}
-}
->>
-
-treeAdaptorType() ::= <<
-<actions.(actionScope).treeAdaptorType; null="ITreeAdaptor">
->>
-
-ruleReturnBaseType() ::= <%
-Ast<if(TREE_PARSER)>Tree<else>Parser<endif>RuleReturnScope\<<ASTLabelType>, <labelType>>
-%>
-
-/** Add a variable to track rule's return AST */
-ruleDeclarations() ::= <<
-<super.ruleDeclarations()>
-<ASTLabelType> root_0 = default(<ASTLabelType>);<\n>
->>
-
-ruleLabelDefs(ruleDescriptor, labelType, ASTLabelType, rewriteElementType) ::= <%
-<super.ruleLabelDefs(...)>
-<if(!ruleDescriptor.isSynPred)>
-<[ruleDescriptor.tokenLabels,ruleDescriptor.wildcardTreeLabels,ruleDescriptor.wildcardTreeListLabels]
-	:{it|<\n><ASTLabelType> <it.label.text>_tree = default(<ASTLabelType>);}>
-<ruleDescriptor.tokenListLabels:{it|<\n><ASTLabelType> <it.label.text>_tree = default(<ASTLabelType>);}>
-<ruleDescriptor.allTokenRefsInAltsWithRewrites
-	:{it|<\n>RewriteRule<rewriteElementType>Stream stream_<it>=new RewriteRule<rewriteElementType>Stream(adaptor,"token <it>");}>
-<ruleDescriptor.allRuleRefsInAltsWithRewrites
-	:{it|<\n>RewriteRuleSubtreeStream stream_<it>=new RewriteRuleSubtreeStream(adaptor,"rule <it>");}>
-<endif>
-%>
-
-/** When doing auto AST construction, we must define some variables;
- *  These should be turned off if doing rewrites.  This must be a "mode"
- *  as a rule could have both rewrite and AST within the same alternative
- *  block.
- */
-@alt.declarations() ::= <<
-<if(autoAST && outerAlt && !rewriteMode && !ruleDescriptor.isSynPred)>
-root_0 = (<ASTLabelType>)adaptor.Nil();
-<endif>
->>
-
-// T r a c k i n g  R u l e  E l e m e n t s
-
-/** ID and track it for use in a rewrite rule */
-tokenRefTrack(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRefBang(...)> <! Track implies no auto AST construction!>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>stream_<token>.Add(<label>);<\n>
->>
-
-/** ids+=ID and track it for use in a rewrite rule; adds to ids *and*
- *  to the tracking list stream_ID for use in the rewrite.
- */
-tokenRefTrackAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRefTrack(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** ^(ID ...) track for rewrite */
-tokenRefRuleRootTrack(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRefBang(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>stream_<token>.Add(<label>);
->>
-
-/** Match ^(label+=TOKEN ...) track for rewrite */
-tokenRefRuleRootTrackAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRefRuleRootTrack(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** rule when output=AST and tracking for rewrite */
-ruleRefTrack(rule,label,elementIndex,args,scope) ::= <<
-<super.ruleRef(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>stream_<rule.name>.Add(<label>.Tree);
->>
-
-/** x+=rule when output=AST and tracking for rewrite */
-ruleRefTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRefTrack(...)>
-<listLabelElem(elem={<label>.Tree},elemType=ASTLabelType,...)>
->>
-
-/** ^(rule ...) rewrite */
-ruleRefRuleRootTrack(rule,label,elementIndex,args,scope) ::= <<
-<ruleRefRuleRoot(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>stream_<rule>.Add(<label>.Tree);
->>
-
-/** ^(x+=rule ...) rewrite */
-ruleRefRuleRootTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRefRuleRootTrack(...)>
-<listLabelElem(elem={<label>.Tree},elemType=ASTLabelType,...)>
->>
-
-// R e w r i t e
-
-rewriteCode(
-	alts, description,
-	referencedElementsDeep, // ALL referenced elements to right of ->
-	referencedTokenLabels,
-	referencedTokenListLabels,
-	referencedRuleLabels,
-	referencedRuleListLabels,
-	referencedWildcardLabels,
-	referencedWildcardListLabels,
-	rewriteBlockLevel, enclosingTreeLevel, treeLevel) ::= <<
-<\n>{
-// AST REWRITE
-// elements: <referencedElementsDeep; separator=", ">
-// token labels: <referencedTokenLabels; separator=", ">
-// rule labels: <referencedRuleLabels; separator=", ">
-// token list labels: <referencedTokenListLabels; separator=", ">
-// rule list labels: <referencedRuleListLabels; separator=", ">
-// wildcard labels: <[referencedWildcardLabels,referencedWildcardListLabels]; separator=", ">
-<if(backtracking)>
-if (<actions.(actionScope).synpredgate>) {
-<endif>
-<prevRuleRootRef()>.Tree = root_0;
-<rewriteCodeLabels()>
-root_0 = (<ASTLabelType>)adaptor.Nil();
-<alts:rewriteAlt(); separator="else ">
-<! if tree parser and rewrite=true !>
-<if(TREE_PARSER&&rewriteMode)>
-<prevRuleRootRef()>.Tree = (<ASTLabelType>)adaptor.RulePostProcessing(root_0);
-if (<prevRuleRootRef()>.Tree != null)
-	input.ReplaceChildren(adaptor.GetParent(retval.Start), adaptor.GetChildIndex(retval.Start), adaptor.GetChildIndex(_last), retval.Tree);
-<endif>
-<! if parser or tree-parser && rewrite!=true, we need to set result !>
-<if(!TREE_PARSER||!rewriteMode)>
-<prevRuleRootRef()>.Tree = root_0;
-<endif>
-<if(backtracking)>
-}
-<endif>
-}
-
->>
-
-rewriteCodeLabels() ::= <<
-<referencedTokenLabels
-	:{it|RewriteRule<rewriteElementType>Stream stream_<it>=new RewriteRule<rewriteElementType>Stream(adaptor,"token <it>",<it>);};
-	separator="\n"
->
-<referencedTokenListLabels
-	:{it|RewriteRule<rewriteElementType>Stream stream_<it>=new RewriteRule<rewriteElementType>Stream(adaptor,"token <it>", list_<it>);};
-	separator="\n"
->
-<referencedWildcardLabels
-	:{it|RewriteRuleSubtreeStream stream_<it>=new RewriteRuleSubtreeStream(adaptor,"wildcard <it>",<it>);};
-	separator="\n"
->
-<referencedWildcardListLabels
-	:{it|RewriteRuleSubtreeStream stream_<it>=new RewriteRuleSubtreeStream(adaptor,"wildcard <it>",list_<it>);};
-	separator="\n"
->
-<referencedRuleLabels
-	:{it|RewriteRuleSubtreeStream stream_<it>=new RewriteRuleSubtreeStream(adaptor,"rule <it>",<it>!=null?<it>.Tree:null);};
-	separator="\n"
->
-<referencedRuleListLabels
-	:{it|RewriteRuleSubtreeStream stream_<it>=new RewriteRuleSubtreeStream(adaptor,"token <it>",list_<it>);};
-	separator="\n"
->
->>
-
-/** Generate code for an optional rewrite block; note it uses the deep ref'd element
-  *  list rather shallow like other blocks.
-  */
-rewriteOptionalBlock(
-	alt,rewriteBlockLevel,
-	referencedElementsDeep, // all nested refs
-	referencedElements, // elements in immediately block; no nested blocks
-	description) ::=
-<<
-// <fileName>:<description>
-if (<referencedElementsDeep:{el | stream_<el>.HasNext}; separator="||">)
-{
-	<alt>
-}
-<referencedElementsDeep:{el | stream_<el>.Reset();<\n>}>
->>
-
-rewriteClosureBlock(
-	alt,rewriteBlockLevel,
-	referencedElementsDeep, // all nested refs
-	referencedElements, // elements in immediately block; no nested blocks
-	description) ::=
-<<
-// <fileName>:<description>
-while ( <referencedElements:{el | stream_<el>.HasNext}; separator="||"> )
-{
-	<alt>
-}
-<referencedElements:{el | stream_<el>.Reset();<\n>}>
->>
-
-rewritePositiveClosureBlock(
-	alt,rewriteBlockLevel,
-	referencedElementsDeep, // all nested refs
-	referencedElements, // elements in immediately block; no nested blocks
-	description) ::=
-<<
-if (!(<referencedElements:{el | stream_<el>.HasNext}; separator="||">))
-{
-	throw new RewriteEarlyExitException();
-}
-while ( <referencedElements:{el | stream_<el>.HasNext}; separator="||"> )
-{
-	<alt>
-}
-<referencedElements:{el | stream_<el>.Reset();<\n>}>
->>
-
-rewriteAlt(a) ::= <<
-// <a.description>
-<if(a.pred)>
-if (<a.pred>)
-{
-	<a.alt>
-}
-<else>
-{
-	<a.alt>
-}
-<endif>
->>
-
-/** For empty rewrites: "r : ... -> ;" */
-rewriteEmptyAlt() ::= "root_0 = null;"
-
-rewriteTree(root,children,description,enclosingTreeLevel,treeLevel) ::= <<
-// <fileName>:<description>
-{
-<ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.Nil();
-<root:rewriteElement()>
-<children:rewriteElement()>
-adaptor.AddChild(root_<enclosingTreeLevel>, root_<treeLevel>);
-}<\n>
->>
-
-rewriteElementList(elements) ::= "<elements:rewriteElement()>"
-
-rewriteElement(e) ::= <%
-<@pregen()>
-DebugLocation(<e.line>, <e.pos>);<\n>
-<e.el>
-%>
-
-/** Gen ID or ID[args] */
-rewriteTokenRef(token,elementIndex,args,terminalOptions={}) ::= <<
-adaptor.AddChild(root_<treeLevel>, <createRewriteNodeFromElement(...)>);<\n>
->>
-
-/** Gen $label ... where defined via label=ID */
-rewriteTokenLabelRef(label,elementIndex) ::= <<
-adaptor.AddChild(root_<treeLevel>, stream_<label>.NextNode());<\n>
->>
-
-/** Gen $label ... where defined via label+=ID */
-rewriteTokenListLabelRef(label,elementIndex) ::= <<
-adaptor.AddChild(root_<treeLevel>, stream_<label>.NextNode());<\n>
->>
-
-/** Gen ^($label ...) */
-rewriteTokenLabelRefRoot(label,elementIndex) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.NextNode(), root_<treeLevel>);<\n>
->>
-
-/** Gen ^($label ...) where label+=... */
-rewriteTokenListLabelRefRoot ::= rewriteTokenLabelRefRoot
-
-/** Gen ^(ID ...) or ^(ID[args] ...) */
-rewriteTokenRefRoot(token,elementIndex,args,terminalOptions={}) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<createRewriteNodeFromElement(...)>, root_<treeLevel>);<\n>
->>
-
-rewriteImaginaryTokenRef(args,token,elementIndex,terminalOptions={}) ::= <<
-adaptor.AddChild(root_<treeLevel>, <createImaginaryNode(tokenType=token, ...)>);<\n>
->>
-
-rewriteImaginaryTokenRefRoot(args,token,elementIndex,terminalOptions={}) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<createImaginaryNode(tokenType=token, ...)>, root_<treeLevel>);<\n>
->>
-
-/** plain -> {foo} action */
-rewriteAction(action) ::= <<
-root_0 = <action>;<\n>
->>
-
-/** What is the name of the previous value of this rule's root tree?  This
- *  let's us refer to $rule to mean previous value.  I am reusing the
- *  variable 'tree' sitting in retval struct to hold the value of root_0 right
- *  before I set it during rewrites.  The assign will be to retval.tree.
- */
-prevRuleRootRef() ::= "retval"
-
-rewriteRuleRef(rule) ::= <<
-adaptor.AddChild(root_<treeLevel>, stream_<rule>.NextTree());<\n>
->>
-
-rewriteRuleRefRoot(rule) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<rule>.NextNode(), root_<treeLevel>);<\n>
->>
-
-rewriteNodeAction(action) ::= <<
-adaptor.AddChild(root_<treeLevel>, <action>);<\n>
->>
-
-rewriteNodeActionRoot(action) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<action>, root_<treeLevel>);<\n>
->>
-
-/** Gen $ruleLabel ... where defined via ruleLabel=rule */
-rewriteRuleLabelRef(label) ::= <<
-adaptor.AddChild(root_<treeLevel>, stream_<label>.NextTree());<\n>
->>
-
-/** Gen $ruleLabel ... where defined via ruleLabel+=rule */
-rewriteRuleListLabelRef(label) ::= <<
-adaptor.AddChild(root_<treeLevel>, stream_<label>.NextTree());<\n>
->>
-
-/** Gen ^($ruleLabel ...) where ruleLabel=rule */
-rewriteRuleLabelRefRoot(label) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.NextNode(), root_<treeLevel>);<\n>
->>
-
-/** Gen ^($ruleLabel ...) where ruleLabel+=rule */
-rewriteRuleListLabelRefRoot(label) ::= <<
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(stream_<label>.NextNode(), root_<treeLevel>);<\n>
->>
-
-rewriteWildcardLabelRef(label) ::= <<
-adaptor.AddChild(root_<treeLevel>, stream_<label>.NextTree());<\n>
->>
-
-createImaginaryNode(tokenType,args,terminalOptions={}) ::= <%
-<if(terminalOptions.node)>
-<! new MethodNode(IDLabel, args) !>
-new <terminalOptions.node>(<tokenType><if(args)>, <args; separator=", "><endif>)
-<else>
-(<ASTLabelType>)adaptor.Create(<tokenType>, <args; separator=", "><if(!args)>"<tokenType>"<endif>)
-<endif>
-%>
-
-createRewriteNodeFromElement(token,args,terminalOptions={}) ::= <%
-<if(terminalOptions.node)>
-new <terminalOptions.node>(stream_<token>.NextToken()<if(args)>, <args; separator=", "><endif>)
-<else>
-<if(args)> <! must create new node from old !>
-adaptor.Create(<token>, <args; separator=", ">)
-<else>
-stream_<token>.NextNode()
-<endif>
-<endif>
-%>
diff --git a/Tools/Antlr/Codegen/Templates/CSharp3/ASTDbg.stg b/Tools/Antlr/Codegen/Templates/CSharp3/ASTDbg.stg
deleted file mode 100644
index b4b245a004a..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp3/ASTDbg.stg
+++ /dev/null
@@ -1,98 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2005-2008 Terence Parr
- * All rights reserved.
- *
- * Conversion to C#:
- * Copyright (c) 2008-2009 Sam Harwell, Pixel Mine, Inc.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-/** Template overrides to add debugging to AST stuff.  Dynamic inheritance
- *  hierarchy is set up as ASTDbg : AST : Dbg : Java by code generator.
- */
-
-parserMembers() ::= <<
-	// Implement this function in your helper file to use a custom tree adaptor
-	partial void InitializeTreeAdaptor();
-	protected DebugTreeAdaptor adaptor;
-
-	public ITreeAdaptor TreeAdaptor
-	{
-		get
-		{
-			return adaptor;
-		}
-		set
-		{
-<if(grammar.grammarIsRoot)>
-			this.adaptor = new DebugTreeAdaptor(dbg,adaptor);
-<else>
-			this.adaptor = (DebugTreeAdaptor)adaptor; // delegator sends dbg adaptor
-<endif><\n>
-			<grammar.directDelegates:{g|<g:delegateName()>.TreeAdaptor = this.adaptor;}>
-		}
-	}<\n>
->>
-
-parserCtorBody() ::= <<
-<super.parserCtorBody()>
->>
-
-createListenerAndHandshake() ::= <<
-DebugEventSocketProxy proxy = new DebugEventSocketProxy( this, port, <if(TREE_PARSER)>input.TreeAdaptor<else>adaptor<endif> );
-DebugListener = proxy;
-<inputStreamType> = new Debug<inputStreamType>( input, proxy );
-try
-{
-	proxy.Handshake();
-}
-catch ( IOException ioe )
-{
-	ReportError( ioe );
-}
->>
-
-@ctorForRootGrammar.finally() ::= <<
-ITreeAdaptor adap = new CommonTreeAdaptor();
-TreeAdaptor = adap;
-proxy.TreeAdaptor = adap;
->>
-
-@ctorForProfilingRootGrammar.finally() ::=<<
-ITreeAdaptor adap = new CommonTreeAdaptor();
-TreeAdaptor = adap;
->>
-
-@ctorForPredefinedListener.superClassRef() ::= ": base( input, dbg )"
-
-@ctorForPredefinedListener.finally() ::=<<
-<if(grammar.grammarIsRoot)><! don't create new adaptor for delegates !>
-ITreeAdaptor adap = new CommonTreeAdaptor();
-TreeAdaptor = adap;<\n>
-<endif>
->>
-
-//@rewriteElement.pregen() ::= "dbg.Location( <e.line>, <e.pos> );"
diff --git a/Tools/Antlr/Codegen/Templates/CSharp3/ASTParser.stg b/Tools/Antlr/Codegen/Templates/CSharp3/ASTParser.stg
deleted file mode 100644
index b97d44bb2d1..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp3/ASTParser.stg
+++ /dev/null
@@ -1,203 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2011 Terence Parr
- * All rights reserved.
- *
- * Conversion to C#:
- * Copyright (c) 2011 Sam Harwell, Pixel Mine, Inc.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-/** Templates for building ASTs during normal parsing.
- *
- *  Deal with many combinations.  Dimensions are:
- *  Auto build or rewrite
- *    no label, label, list label  (label/no-label handled together)
- *    child, root
- *    token, set, rule, wildcard
- *
- *  The situation is not too bad as rewrite (->) usage makes ^ and !
- *  invalid. There is no huge explosion of combinations.
- */
-
-@rule.setErrorReturnValue() ::= <<
-retval.Tree = (<ASTLabelType>)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-<! System.out.WriteLine("<ruleName> returns "+((CommonTree)retval.tree).toStringTree()); !>
->>
-
-// TOKEN AST STUFF
-
-/** ID and output=AST */
-tokenRef(token,label,elementIndex,terminalOptions={}) ::= <%
-<super.tokenRef(...)>
-<if(!ruleDescriptor.isSynPred)>
-<if(backtracking)><\n>if (state.backtracking == 0) {<endif>
-<\n><label>_tree = <createNodeFromToken(...)>;
-<\n>adaptor.AddChild(root_0, <label>_tree);
-<if(backtracking)><\n>}<endif>
-<endif>
-%>
-
-/** ID! and output=AST (same as plain tokenRef) */
-tokenRefBang(token,label,elementIndex,terminalOptions={}) ::= "<super.tokenRef(...)>"
-
-/** ID^ and output=AST */
-tokenRefRuleRoot(token,label,elementIndex,terminalOptions={}) ::= <%
-<super.tokenRef(...)>
-<if(!ruleDescriptor.isSynPred)>
-<if(backtracking)><\n>if (<actions.(actionScope).synpredgate>) {<endif>
-<\n><label>_tree = <createNodeFromToken(...)>;
-<\n>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_0);
-<if(backtracking)><\n>}<endif>
-<endif>
-%>
-
-/** ids+=ID! and output=AST */
-tokenRefBangAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRefBang(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** label+=TOKEN when output=AST but not rewrite alt */
-tokenRefAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRef(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** Match label+=TOKEN^ when output=AST but not rewrite alt */
-tokenRefRuleRootAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRefRuleRoot(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-// SET AST
-
-// the match set stuff is interesting in that it uses an argument list
-// to pass code to the default matchSet; another possible way to alter
-// inherited code.  I don't use the region stuff because I need to pass
-// different chunks depending on the operator.  I don't like making
-// the template name have the operator as the number of templates gets
-// large but this is the most flexible--this is as opposed to having
-// the code generator call matchSet then add root code or ruleroot code
-// plus list label plus ...  The combinations might require complicated
-// rather than just added on code.  Investigate that refactoring when
-// I have more time.
-
-matchSet(s,label,elementIndex,postmatchCode,terminalOptions={}) ::= <<
-<super.matchSet(postmatchCode={<if(!ruleDescriptor.isSynPred)><if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>adaptor.AddChild(root_0, <createNodeFromToken(...)>);<endif>}, ...)>
->>
-
-matchRuleBlockSet(s,label,elementIndex,postmatchCode,treeLevel="0",terminalOptions={}) ::= <<
-<matchSet(...)>
->>
-
-matchSetBang(s,label,elementIndex,postmatchCode,terminalOptions={}) ::= "<super.matchSet(...)>"
-
-// note there is no matchSetTrack because -> rewrites force sets to be
-// plain old blocks of alts: (A|B|...|C)
-
-matchSetRuleRoot(s,label,elementIndex,debug,terminalOptions={}) ::= <<
-<if(label)>
-<label>=(<labelType>)input.LT(1);
-<endif>
-<super.matchSet(postmatchCode={<if(!ruleDescriptor.isSynPred)><if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<createNodeFromToken(...)>, root_0);<endif>}, ...)>
->>
-
-// RULE REF AST
-
-/** rule when output=AST */
-ruleRef(rule,label,elementIndex,args,scope) ::= <%
-<super.ruleRef(...)>
-<if(!ruleDescriptor.isSynPred)>
-<\n><if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>adaptor.AddChild(root_0, <label>.Tree);
-<endif>
-%>
-
-/** rule! is same as normal rule ref */
-ruleRefBang(rule,label,elementIndex,args,scope) ::= "<super.ruleRef(...)>"
-
-/** rule^ */
-ruleRefRuleRoot(rule,label,elementIndex,args,scope) ::= <<
-<super.ruleRef(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>.Tree, root_0);
->>
-
-/** x+=rule when output=AST */
-ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRef(...)>
-<listLabelElem(elem={<label>.Tree},elemType=ASTLabelType,...)>
->>
-
-/** x+=rule! when output=AST is a rule ref with list addition */
-ruleRefBangAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRefBang(...)>
-<listLabelElem(elem={<label>.Tree},elemType=ASTLabelType,...)>
->>
-
-/** x+=rule^ */
-ruleRefRuleRootAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRefRuleRoot(...)>
-<listLabelElem(elem={<label>.Tree},elemType=ASTLabelType,...)>
->>
-
-// WILDCARD AST
-
-wildcard(token,label,elementIndex,terminalOptions={}) ::= <<
-<super.wildcard(...)>
-<if(!ruleDescriptor.isSynPred)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<label>_tree = (<ASTLabelType>)adaptor.Create(<label>);
-adaptor.AddChild(root_0, <label>_tree);
-<if(backtracking)>}<endif>
-<endif>
->>
-
-wildcardBang(label,elementIndex) ::= "<super.wildcard(token=[],...)>"
-
-wildcardRuleRoot(token,label,elementIndex,terminalOptions={}) ::= <<
-<super.wildcard(...)>
-<if(!ruleDescriptor.isSynPred)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<label>_tree = (<ASTLabelType>)adaptor.Create(<label>);
-root_0 = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_0);
-<if(backtracking)>}<endif>
-<endif>
->>
-
-createNodeFromToken(label,terminalOptions={}) ::= <%
-<if(terminalOptions.node)>
-new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>)
-<else>
-(<ASTLabelType>)adaptor.Create(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>)
-<endif>
-%>
-
-ruleCleanUp() ::= <<
-<super.ruleCleanUp()>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-retval.Tree = (<ASTLabelType>)adaptor.RulePostProcessing(root_0);
-adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-<if(backtracking)>}<endif>
->>
diff --git a/Tools/Antlr/Codegen/Templates/CSharp3/ASTTreeParser.stg b/Tools/Antlr/Codegen/Templates/CSharp3/ASTTreeParser.stg
deleted file mode 100644
index c5529b2b402..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp3/ASTTreeParser.stg
+++ /dev/null
@@ -1,377 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2011 Terence Parr
- * All rights reserved.
- *
- * Conversion to C#:
- * Copyright (c) 2011 Sam Harwell, Pixel Mine, Inc.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-/** Templates for building ASTs during tree parsing.
- *
- *  Deal with many combinations.  Dimensions are:
- *  Auto build or rewrite
- *    no label, label, list label  (label/no-label handled together)
- *    child, root
- *    token, set, rule, wildcard
- *
- *  Each combination has its own template except that label/no label
- *  is combined into tokenRef, ruleRef, ...
- */
-
-/** Add a variable to track last element matched */
-ruleDeclarations() ::= <<
-<super.ruleDeclarations()>
-<if(!ruleDescriptor.isSynPred)>
-<ASTLabelType> _first_0 = default(<ASTLabelType>);
-<ASTLabelType> _last = default(<ASTLabelType>);
-<endif>
->>
-
-/** What to emit when there is no rewrite rule.  For auto build
- *  mode, does nothing.
- */
-noRewrite(rewriteBlockLevel=false, treeLevel=false) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<if(rewriteMode)>
-retval.Tree = (<ASTLabelType>)_first_0;
-if (adaptor.GetParent(retval.Tree)!=null && adaptor.IsNil(adaptor.GetParent(retval.Tree)))
-	retval.Tree = (<ASTLabelType>)adaptor.GetParent(retval.Tree);
-<endif>
-<if(backtracking)>}<endif>
-<endif>
->>
-
-/** match ^(root children) in tree parser; override here to
- *  add tree construction actions.
- */
-tree(root, actionsAfterRoot, children, nullableChildList,
-     enclosingTreeLevel, treeLevel) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-{
-<ASTLabelType> _save_last_<treeLevel> = _last;
-<ASTLabelType> _first_<treeLevel> = default(<ASTLabelType>);
-<if(!rewriteMode)>
-<ASTLabelType> root_<treeLevel> = (<ASTLabelType>)adaptor.Nil();
-<endif>
-<root:element()>
-<if(rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>)<endif>
-<if(root.el.rule)>
-if (_first_<enclosingTreeLevel> == null) _first_<enclosingTreeLevel> = <root.el.label>.Tree;
-<else>
-if (_first_<enclosingTreeLevel> == null) _first_<enclosingTreeLevel> = <root.el.label>;
-<endif>
-<endif>
-<actionsAfterRoot:element()>
-<if(nullableChildList)>
-if (input.LA(1) == TokenTypes.Down) {
-	Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()>
-	<children:element()>
-	Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()>
-}
-<else>
-Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()>
-<children:element()>
-Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()>
-<endif>
-<if(!rewriteMode)>
-adaptor.AddChild(root_<enclosingTreeLevel>, root_<treeLevel>);
-<endif>
-_last = _save_last_<treeLevel>;
-}
-<else>
-<super.tree(...)>
-<endif>
->>
-
-// TOKEN AST STUFF
-
-/** ID! and output=AST (same as plain tokenRef) 'cept add
- *  setting of _last
- */
-tokenRefBang(token,label,elementIndex,terminalOptions) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.tokenRef(...)>
-<else>
-<super.tokenRefBang(...)>
-<endif>
->>
-
-/** ID auto construct */
-tokenRef(token,label,elementIndex,terminalOptions) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.tokenRef(...)>
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<if(terminalOptions.node)>
-<label>_tree = new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<else>
-<label>_tree = (<ASTLabelType>)adaptor.DupNode(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<endif><\n>
-adaptor.AddChild(root_<treeLevel>, <label>_tree);
-<if(backtracking)>}<endif>
-<else> <! rewrite mode !>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>)<endif>
-if (_first_<treeLevel> == null) _first_<treeLevel> = <label>;
-<endif>
-<else>
-<super.tokenRef(...)>
-<endif>
->>
-
-/** label+=TOKEN auto construct */
-tokenRefAndListLabel(token,label,elementIndex,terminalOptions) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<tokenRef(...)>
-<listLabelElem(elem=label,...)>
-<else>
-<super.tokenRefAndListLabel(...)>
-<endif>
->>
-
-/** ^(ID ...) auto construct */
-tokenRefRuleRoot(token,label,elementIndex,terminalOptions) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.tokenRef(...)>
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<if(terminalOptions.node)>
-<label>_tree = new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<else>
-<label>_tree = (<ASTLabelType>)adaptor.DupNode(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<endif><\n>
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_<treeLevel>);
-<if(backtracking)>}<endif>
-<endif>
-<else>
-<super.tokenRefRuleRoot(...)>
-<endif>
->>
-
-/** Match ^(label+=TOKEN ...) auto construct */
-tokenRefRuleRootAndListLabel(token,label,elementIndex,terminalOptions) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<tokenRefRuleRoot(...)>
-<listLabelElem(elem=label,...)>
-<else>
-<super.tokenRefRuleRootAndListLabel(...)>
-<endif>
->>
-
-/** Match . wildcard and auto dup the node/subtree */
-wildcard(token,label,elementIndex,terminalOptions) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.wildcard(...)>
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<label>_tree = (<ASTLabelType>)adaptor.DupTree(<label>);
-adaptor.AddChild(root_<treeLevel>, <label>_tree);
-<if(backtracking)>}<endif>
-<else> <! rewrite mode !>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>)<endif>
-if (_first_<treeLevel> == null) _first_<treeLevel> = <label>;
-<endif>
-<else>
-<super.wildcard(...)>
-<endif>
->>
-
-// SET AST
-
-matchSet(s,label,terminalOptions,elementIndex,postmatchCode) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.matchSet(postmatchCode={
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<if(terminalOptions.node)>
-<label>_tree = new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<else>
-<label>_tree = (<ASTLabelType>)adaptor.DupNode(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<endif><\n>
-adaptor.AddChild(root_<treeLevel>, <label>_tree);
-<if(backtracking)>\}<endif>
-<endif>
-}, ...
-)>
-<else>
-<super.matchSet(...)>
-<endif>
->>
-
-matchRuleBlockSet(s,label,terminalOptions,elementIndex,postmatchCode,treeLevel="0") ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<matchSet(...)>
-<noRewrite(...)> <! set return tree !>
-<else>
-<super.matchRuleBlockSet(...)>
-<endif>
->>
-
-matchSetBang(s,label,terminalOptions,elementIndex,postmatchCode) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.matchSet(...)>
-<else>
-<super.matchSetBang(...)>
-<endif>
->>
-
-matchSetRuleRoot(s,label,terminalOptions,elementIndex,debug) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<super.matchSet(postmatchCode={
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-<if(terminalOptions.node)>
-<label>_tree = new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<else>
-<label>_tree = (<ASTLabelType>)adaptor.DupNode(<if(terminalOptions.type)><terminalOptions.type>,<endif><label><if(terminalOptions.text)>,<terminalOptions.text; format="string"><endif>);
-<endif><\n>
-root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>_tree, root_<treeLevel>);
-<if(backtracking)>\}<endif>
-<endif>
-}, ...
-)>
-<else>
-<super.matchSetRuleRoot(...)>
-<endif>
->>
-
-// RULE REF AST
-
-/** rule auto construct */
-ruleRef(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.ruleRef(...)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>)<endif>
-<if(!rewriteMode)>
-adaptor.AddChild(root_<treeLevel>, <label>.Tree);
-<else> <! rewrite mode !>
-if (_first_<treeLevel> == null) _first_<treeLevel> = <label>.Tree;
-<endif>
-<else>
-<super.ruleRef(...)>
-<endif>
->>
-
-/** x+=rule auto construct */
-ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<ruleRef(...)>
-<listLabelElem(elem={<label>.Tree},...)>
-<else>
-<super.ruleRefAndListLabel(...)>
-<endif>
->>
-
-/** ^(rule ...) auto construct */
-ruleRefRuleRoot(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.ruleRef(...)>
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) <endif>root_<treeLevel> = (<ASTLabelType>)adaptor.BecomeRoot(<label>.Tree, root_<treeLevel>);
-<endif>
-<else>
-<super.ruleRefRuleRoot(...)>
-<endif>
->>
-
-/** ^(x+=rule ...) auto construct */
-ruleRefRuleRootAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-<ruleRefRuleRoot(...)>
-<listLabelElem(elem={<label>.Tree},...)>
-<else>
-<super.ruleRefRuleRootAndListLabel(...)>
-<endif>
->>
-
-/** rule when output=AST and tracking for rewrite */
-ruleRefTrack(rule,label,elementIndex,args,scope) ::= <<
-_last = (<ASTLabelType>)input.LT(1);
-<super.ruleRefTrack(...)>
->>
-
-/** x+=rule when output=AST and tracking for rewrite */
-ruleRefTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.ruleRefTrackAndListLabel(...)>
-<else>
-<super.ruleRefTrackAndListLabel(...)>
-<endif>
->>
-
-/** ^(rule ...) rewrite */
-ruleRefRuleRootTrack(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.ruleRefRootTrack(...)>
-<else>
-<super.ruleRefRuleRootTrack(...)>
-<endif>
->>
-
-/** ^(x+=rule ...) rewrite */
-ruleRefRuleRootTrackAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<if(!ruleDescriptor.isSynPred)>
-_last = (<ASTLabelType>)input.LT(1);
-<super.ruleRefRuleRootTrackAndListLabel(...)>
-<else>
-<super.ruleRefRuleRootTrackAndListLabel(...)>
-<endif>
->>
-
-/** Streams for token refs are tree nodes now; override to
- *  change NextToken to NextNode.
- */
-createRewriteNodeFromElement(token,terminalOptions,args) ::= <%
-<if(terminalOptions.node)>
-new <terminalOptions.node>(<if(terminalOptions.type)><terminalOptions.type>,<endif>stream_<token>.NextNode())
-<else>
-stream_<token>.NextNode()
-<endif>
-%>
-
-ruleCleanUp() ::= <<
-<super.ruleCleanUp()>
-<if(!ruleDescriptor.isSynPred)>
-<if(!rewriteMode)>
-<if(backtracking)>if (<actions.(actionScope).synpredgate>) {<endif>
-retval.Tree = (<ASTLabelType>)adaptor.RulePostProcessing(root_0);
-<if(backtracking)>}<endif>
-<endif>
-<endif>
->>
diff --git a/Tools/Antlr/Codegen/Templates/CSharp3/CSharp3.stg b/Tools/Antlr/Codegen/Templates/CSharp3/CSharp3.stg
deleted file mode 100644
index c9229e1764d..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp3/CSharp3.stg
+++ /dev/null
@@ -1,1749 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2011 Terence Parr
- * All rights reserved.
- *
- * Conversion to C#:
- * Copyright (c) 2011 Sam Harwell, Pixel Mine, Inc.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-csharpVisibilityMap ::= [
-	"private":"private",
-	"protected":"protected",
-	"public":"public",
-	"fragment":"private",
-	default:"private"
-]
-
-/** The overall file structure of a recognizer; stores methods for rules
- *  and cyclic DFAs plus support code.
- */
-outputFile(	LEXER,PARSER,TREE_PARSER, actionScope, actions,
-			docComment, recognizer,
-			name, tokens, tokenNames, rules, cyclicDFAs,
-			bitsets, buildTemplate, buildAST, rewriteMode, profile,
-			backtracking, synpreds, memoize, numRules,
-			fileName, ANTLRVersion, generatedTimestamp, trace,
-			scopes, superClass, literals) ::=
-<<
-//------------------------------------------------------------------------------
-// \<auto-generated>
-//     This code was generated by a tool.
-//     ANTLR Version: <ANTLRVersion>
-//
-//     Changes to this file may cause incorrect behavior and will be lost if
-//     the code is regenerated.
-// \</auto-generated>
-//------------------------------------------------------------------------------
-
-// $ANTLR <ANTLRVersion> <fileName> <generatedTimestamp>
-
-// The variable 'variable' is assigned but its value is never used.
-#pragma warning disable 219
-// Unreachable code detected.
-#pragma warning disable 162
-// Missing XML comment for publicly visible type or member 'Type_or_Member'
-#pragma warning disable 1591
-// CLS compliance checking will not be performed on 'type' because it is not visible from outside this assembly.
-#pragma warning disable 3019
-
-<actions.(actionScope).header>
-
-<@imports>
-using System.Collections.Generic;
-using Antlr.Runtime;
-using Antlr.Runtime.Misc;
-<if(TREE_PARSER)>
-using Antlr.Runtime.Tree;
-using RewriteRuleITokenStream = Antlr.Runtime.Tree.RewriteRuleTokenStream;
-<endif>
-<@end>
-<if(actions.(actionScope).namespace)>
-namespace <actions.(actionScope).namespace>
-{
-<endif>
-<docComment>
-<recognizer>
-<if(actions.(actionScope).namespace)>
-
-} // namespace <actions.(actionScope).namespace>
-<endif>
->>
-
-lexerInputStreamType() ::= <<
-<actions.(actionScope).inputStreamType; null="ICharStream">
->>
-
-lexer(grammar, name, tokens, scopes, rules, numRules, filterMode, labelType="CommonToken",
-	  superClass={<if(actions.(actionScope).superClass)><actions.(actionScope).superClass><else>Antlr.Runtime.Lexer<endif>},
-	  rewriteElementType={}, ASTLabelType={}) ::= <<
-[System.CodeDom.Compiler.GeneratedCode("ANTLR", "<ANTLRVersion>")]
-[System.CLSCompliant(false)]
-<parserModifier(grammar=grammar, actions=actions)> partial class <grammar.recognizerName> : <@superClassName><superClass><@end>
-{
-	<tokens:{it|public const int <it.name; format="id">=<it.type>;}; separator="\n">
-	<scopes:{it|<if(it.isDynamicGlobalScope)><globalAttributeScope(scope=it)><endif>}>
-	<actions.lexer.members>
-
-	// delegates
-	<grammar.delegates:
-		 {g|private <g.recognizerName> <g:delegateName()>;}; separator="\n">
-	// delegators
-	<grammar.delegators:
-		 {g|private <g.recognizerName> <g:delegateName()>;}; separator="\n">
-	<last(grammar.delegators):{g|private <g.recognizerName> gParent;}>
-
-	<actions.(actionScope).ctorModifier; null="public"> <grammar.recognizerName>()<! needed by subclasses !>
-	{
-		OnCreated();
-	}
-
-	<actions.(actionScope).ctorModifier; null="public"> <grammar.recognizerName>(<lexerInputStreamType()> input<grammar.delegators:{g|, <g.recognizerName> <g:delegateName()>}> )
-		: this(input, new RecognizerSharedState()<grammar.delegators:{g|, <g:delegateName()>}>)
-	{
-	}
-
-	<actions.(actionScope).ctorModifier; null="public"> <grammar.recognizerName>(<lexerInputStreamType()> input, RecognizerSharedState state<grammar.delegators:{g|, <g.recognizerName> <g:delegateName()>}>)
-		: base(input, state)
-	{
-<if(memoize)>
-<if(grammar.grammarIsRoot)>
-		state.ruleMemo = new System.Collections.Generic.Dictionary\<int, int>[<numRules>+1];<\n><! index from 1..n !>
-<endif>
-<endif>
-		<grammar.directDelegates:
-		 {g|<g:delegateName()> = new <g.recognizerName>(input, this.state<trunc(g.delegators):{p|, <p:delegateName()>}>, this);}; separator="\n">
-		<grammar.delegators:
-		 {g|this.<g:delegateName()> = <g:delegateName()>;}; separator="\n">
-		<last(grammar.delegators):{g|gParent = <g:delegateName()>;}>
-
-		OnCreated();
-	}
-	public override string GrammarFileName { get { return "<fileName>"; } }
-
-<if(grammar.hasDelegates)>
-	public override <lexerInputStreamType()> CharStream
-	{
-		get
-		{
-			return base.CharStream;
-		}
-		set
-		{
-			base.CharStream = value;
-			<grammar.directDelegates:
-			 {g|<g:delegateName()> = new <g.recognizerName>(input, state<trunc(g.delegators):{p|, <p:delegateName()>}>, this);}; separator="\n">
-			<grammar.delegators:
-			 {g|this.<g:delegateName()> = <g:delegateName()>;}; separator="\n">
-			<last(grammar.delegators):{g|gParent = <g:delegateName()>;}>
-		}
-	}
-
-<if(grammar.delegates)>
-	public override void SetState(RecognizerSharedState state)
-	{
-		base.SetState(state);
-		<grammar.delegates:{g|<g:delegateName()>.SetState(state);}; separator="\n">
-	}
-<endif>
-
-<endif>
-<if(filterMode)>
-	<filteringNextToken()>
-<endif>
-
-
-	partial void OnCreated();
-	partial void EnterRule(string ruleName, int ruleIndex);
-	partial void LeaveRule(string ruleName, int ruleIndex);
-
-	<rules; separator="\n">
-
-	<insertLexerSynpreds(synpreds)>
-
-	#region DFA
-	<cyclicDFAs:{dfa | DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
-
-	protected override void InitDFAs()
-	{
-		base.InitDFAs();
-		<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>(this<if(dfa.specialStateSTs)>, SpecialStateTransition<dfa.decisionNumber><endif>);}; separator="\n">
-	}
-
-	<cyclicDFAs:cyclicDFA()><! dump tables for all DFA !>
-	#endregion
-
-}
->>
-
-/** A override of Lexer.nextToken() that backtracks over mTokens() looking
- *  for matches.  No error can be generated upon error; just rewind, consume
- *  a token and then try again.  backtracking needs to be set as well.
- *  Make rule memoization happen only at levels above 1 as we start mTokens
- *  at backtracking==1.
- */
-filteringNextToken() ::= <<
-public override IToken NextToken()
-{
-	while (true)
-	{
-		if (input.LA(1) == CharStreamConstants.EndOfFile)
-		{
-			IToken eof = new CommonToken((ICharStream)input, CharStreamConstants.EndOfFile, TokenChannels.Default, input.Index, input.Index);
-			eof.Line = Line;
-			eof.CharPositionInLine = CharPositionInLine;
-			return eof;
-		}
-		state.token = null;
-		state.channel = TokenChannels.Default;
-		state.tokenStartCharIndex = input.Index;
-		state.tokenStartCharPositionInLine = input.CharPositionInLine;
-		state.tokenStartLine = input.Line;
-		state.text = null;
-		try
-		{
-			int m = input.Mark();
-			state.backtracking=1;<! means we won't throw slow exception !>
-			state.failed=false;
-			mTokens();
-			state.backtracking=0;
-			<! mTokens backtracks with synpred at backtracking==2
-			   and we set the synpredgate to allow actions at level 1. !>
-			if (state.failed)
-			{
-				input.Rewind(m);
-				input.Consume();<! advance one char and try again !>
-			}
-			else
-			{
-				Emit();
-				return state.token;
-			}
-		}
-		catch (RecognitionException re)
-		{
-			// shouldn't happen in backtracking mode, but...
-			ReportError(re);
-			Recover(re);
-		}
-	}
-}
-
-public override void Memoize(IIntStream input, int ruleIndex, int ruleStartIndex)
-{
-	if (state.backtracking > 1)
-		base.Memoize(input, ruleIndex, ruleStartIndex);
-}
-
-public override bool AlreadyParsedRule(IIntStream input, int ruleIndex)
-{
-	if (state.backtracking > 1)
-		return base.AlreadyParsedRule(input, ruleIndex);
-
-	return false;
-}
->>
-
-actionGate() ::= "state.backtracking == 0"
-
-filteringActionGate() ::= "state.backtracking == 1"
-
-/** How to generate a parser */
-genericParser(grammar, name, scopes, tokens, tokenNames, rules, numRules,
-              bitsets, inputStreamType, superClass,
-              labelType, members, rewriteElementType,
-              filterMode, ASTLabelType="object") ::= <<
-[System.CodeDom.Compiler.GeneratedCode("ANTLR", "<ANTLRVersion>")]
-[System.CLSCompliant(false)]
-<parserModifier(grammar=grammar, actions=actions)> partial class <grammar.recognizerName> : <@superClassName><superClass><@end>
-{
-<if(grammar.grammarIsRoot)>
-	internal static readonly string[] tokenNames = new string[] {
-		"\<invalid>", "\<EOR>", "\<DOWN>", "\<UP>", <tokenNames; separator=", ">
-	};
-<endif>
-	<tokens:{it|public const int <it.name; format="id">=<it.type>;}; separator="\n">
-
-<if(grammar.delegates)>
-	// delegates
-	<grammar.delegates:
-		 {g|private <g.recognizerName> <g:delegateName()>;}; separator="\n">
-<endif>
-<if(grammar.delegators)>
-	// delegators
-	<grammar.delegators:
-		 {g|private <g.recognizerName> <g:delegateName()>;}; separator="\n">
-	<last(grammar.delegators):{g|private <g.recognizerName> gParent;}>
-<endif>
-
-<if(grammar.delegates)>
-	public override void SetState(RecognizerSharedState state)
-	{
-		base.SetState(state);
-		<grammar.delegates:{g|<g:delegateName()>.SetState(state);}; separator="\n">
-	}
-
-<if(TREE_PARSER)>
-	public override void SetTreeNodeStream(ITreeNodeStream input)
-	{
-		base.SetTreeNodeStream(input);
-		<grammar.delegates:{g|<g:delegateName()>.SetTreeNodeStream(input);}; separator="\n">
-	}
-<endif>
-<endif>
-
-	<scopes:{it|<if(it.isDynamicGlobalScope)><globalAttributeScope(scope=it)><endif>}>
-	<@members()>
-
-	public override string[] TokenNames { get { return <grammar.composite.rootGrammar.recognizerName>.tokenNames; } }
-	public override string GrammarFileName { get { return "<fileName>"; } }
-
-	<members>
-
-	partial void OnCreated();
-	partial void EnterRule(string ruleName, int ruleIndex);
-	partial void LeaveRule(string ruleName, int ruleIndex);
-
-	#region Rules
-	<rules; separator="\n">
-	#endregion Rules
-
-<if(grammar.delegatedRules)>
-<! generate rule/method definitions for imported rules so they
-   appear to be defined in this recognizer. !>
-	#region Delegated rules
-<grammar.delegatedRules:{ruleDescriptor|
-	<ruleModifier(grammar=grammar,ruleDescriptor=ruleDescriptor)> <returnType(ruleDescriptor)> <ruleDescriptor.name; format="id">(<ruleDescriptor.parameterScope:parameterScope()>)<!throws RecognitionException !>{ <if(ruleDescriptor.hasReturnValue)>return <endif><ruleDescriptor.grammar:delegateName()>.<ruleDescriptor.name; format="id">(<if(ruleDescriptor.parameterScope)><ruleDescriptor.parameterScope.attributes:{a|<a.name; format="id">}; separator=", "><endif>); \}}; separator="\n">
-	#endregion Delegated rules
-<endif>
-
-	<insertSynpreds(synpreds)>
-
-<if(cyclicDFAs)>
-	#region DFA
-	<cyclicDFAs:{dfa | private DFA<dfa.decisionNumber> dfa<dfa.decisionNumber>;}; separator="\n">
-
-	protected override void InitDFAs()
-	{
-		base.InitDFAs();
-		<cyclicDFAs:{dfa | dfa<dfa.decisionNumber> = new DFA<dfa.decisionNumber>( this<if(dfa.specialStateSTs)>, SpecialStateTransition<dfa.decisionNumber><endif> );}; separator="\n">
-	}
-
-	<cyclicDFAs:cyclicDFA()><! dump tables for all DFA !>
-	#endregion DFA
-<endif>
-
-<if(bitsets)>
-	#region Follow sets
-	private static class Follow
-	{
-		<bitsets:{it|<bitset(name={_<it.name>_in_<it.inName><it.tokenIndex>}, words64=it.bits)>}; separator="\n">
-	}
-	#endregion Follow sets
-<endif>
-}
->>
-
-@genericParser.members() ::= <<
-<! WARNING. bug in ST: this is cut-n-paste into Dbg.stg !>
-<actions.(actionScope).ctorModifier; null="public"> <grammar.recognizerName>(<inputStreamType> input<grammar.delegators:{g|, <g.recognizerName> <g:delegateName()>}>)
-	: this(input, new RecognizerSharedState()<grammar.delegators:{g|, <g:delegateName()>}>)
-{
-}
-<actions.(actionScope).ctorModifier; null="public"> <grammar.recognizerName>(<inputStreamType> input, RecognizerSharedState state<grammar.delegators:{g|, <g.recognizerName> <g:delegateName()>}>)
-	: base(input, state)
-{
-<if(grammar.directDelegates)>
-	<grammar.directDelegates:
-		{g|<g:delegateName()> = new <g.recognizerName>(input, state<trunc(g.delegators):{p|, <p:delegateName()>}>, this);}; separator="\n">
-<endif>
-<if(grammar.indirectDelegates)>
-	<grammar.indirectDelegates:{g | <g:delegateName()> = <g.delegator:delegateName()>.<g:delegateName()>;}; separator="\n">
-<endif>
-<if(grammar.delegators)>
-	<last(grammar.delegators):{g|gParent = <g:delegateName()>;}>
-<endif>
-	<parserCtorBody()>
-	OnCreated();
-}
->>
-
-// imported grammars are 'public' (can't be internal because their return scope classes must be accessible)
-parserModifier(grammar, actions) ::= <<
-<if(grammar.grammarIsRoot)><actions.(actionScope).modifier; null="public"><else>public<endif>
->>
-
-parserCtorBody() ::= <<
-<if(memoize)>
-<if(grammar.grammarIsRoot)>
-this.state.ruleMemo = new System.Collections.Generic.Dictionary\<int, int>[<length(grammar.allImportedRules)>+1];<\n><! index from 1..n !>
-<endif>
-<endif>
-<grammar.delegators:
- {g|this.<g:delegateName()> = <g:delegateName()>;}; separator="\n">
->>
-
-parser(grammar, name, scopes, tokens, tokenNames, rules, numRules, bitsets,
-       ASTLabelType="object", superClass={<if(actions.(actionScope).superClass)><actions.(actionScope).superClass><else>Antlr.Runtime.Parser<endif>}, labelType="IToken",
-       members={<actions.parser.members>}) ::= <<
-<genericParser(inputStreamType="ITokenStream", rewriteElementType="IToken", filterMode=false, ...)>
->>
-
-/** How to generate a tree parser; same as parser except the input
- *  stream is a different type.
- */
-treeParser(grammar, name, scopes, tokens, tokenNames, globalAction, rules,
-           numRules, bitsets, filterMode, labelType={<ASTLabelType>}, ASTLabelType="object",
-           superClass={<if(actions.(actionScope).superClass)><actions.(actionScope).superClass><else>Antlr.Runtime.Tree.<if(filterMode)><if(buildAST)>TreeRewriter<else>TreeFilter<endif><else>TreeParser<endif><endif>},
-           members={<actions.treeparser.members>}) ::= <<
-<genericParser(inputStreamType="ITreeNodeStream", rewriteElementType="Node", ...)>
->>
-
-/** A simpler version of a rule template that is specific to the imaginary
- *  rules created for syntactic predicates.  As they never have return values
- *  nor parameters etc..., just give simplest possible method.  Don't do
- *  any of the normal memoization stuff in here either; it's a waste.
- *  As predicates cannot be inlined into the invoking rule, they need to
- *  be in a rule by themselves.
- */
-synpredRule(ruleName, ruleDescriptor, block, description, nakedBlock) ::=
-<<
-
-partial void EnterRule_<ruleName>_fragment();
-partial void LeaveRule_<ruleName>_fragment();
-
-// $ANTLR start <ruleName>
-<ruleModifier(grammar=grammar,ruleDescriptor=ruleDescriptor)> void <ruleName>_fragment(<ruleDescriptor.parameterScope:parameterScope()>)
-{
-	<ruleLabelDefs(...)>
-	EnterRule_<ruleName>_fragment();
-	EnterRule("<ruleName>_fragment", <ruleDescriptor.index>);
-	TraceIn("<ruleName>_fragment", <ruleDescriptor.index>);
-	try
-	{
-		<block>
-	}
-	finally
-	{
-		TraceOut("<ruleName>_fragment", <ruleDescriptor.index>);
-		LeaveRule("<ruleName>_fragment", <ruleDescriptor.index>);
-		LeaveRule_<ruleName>_fragment();
-	}
-}
-// $ANTLR end <ruleName>
->>
-
-insertLexerSynpreds(synpreds) ::= <<
-<insertSynpreds(synpreds)>
->>
-
-insertSynpreds(synpreds) ::= <<
-<if(synpreds)>
-#region Synpreds
-private bool EvaluatePredicate(System.Action fragment)
-{
-	bool success = false;
-	state.backtracking++;
-	<@start()>
-	try { DebugBeginBacktrack(state.backtracking);
-	int start = input.Mark();
-	try
-	{
-		fragment();
-	}
-	catch ( RecognitionException re )
-	{
-		System.Console.Error.WriteLine("impossible: "+re);
-	}
-	success = !state.failed;
-	input.Rewind(start);
-	} finally { DebugEndBacktrack(state.backtracking, success); }
-	<@stop()>
-	state.backtracking--;
-	state.failed=false;
-	return success;
-}
-#endregion Synpreds
-<endif>
->>
-
-ruleMemoization(name) ::= <<
-<if(memoize)>
-if (state.backtracking > 0 && AlreadyParsedRule(input, <ruleDescriptor.index>)) { <returnFromRule()> }
-<endif>
->>
-
-/** How to test for failure and return from rule */
-checkRuleBacktrackFailure() ::= <<
-<if(backtracking)>if (state.failed) <returnFromRule()><endif>
->>
-
-/** This rule has failed, exit indicating failure during backtrack */
-ruleBacktrackFailure() ::= <<
-<if(backtracking)>if (state.backtracking>0) {state.failed=true; <returnFromRule()>}<endif>
->>
-
-ruleWrapperMap ::= [
-	"bottomup":{<ruleWrapperBottomup()>},
-	"topdown":{<ruleWrapperTopdown()>},
-	default:""
-]
-
-ruleWrapperBottomup() ::= <<
-<if(TREE_PARSER && filterMode)>
-protected override <if(buildAST)>IAstRuleReturnScope<else>void<endif> Bottomup() { <if(buildAST)>return <endif>bottomup(); }
-<endif>
->>
-
-ruleWrapperTopdown() ::= <<
-<if(TREE_PARSER && filterMode)>
-protected override <if(buildAST)>IAstRuleReturnScope<else>void<endif> Topdown() { <if(buildAST)>return <endif>topdown(); }
-<endif>
->>
-
-/** How to generate code for a rule.  This includes any return type
- *  data aggregates required for multiple return values.
- */
-rule(ruleName,ruleDescriptor,block,emptyRule,description,exceptions,finally,memoize) ::= <<
-<ruleAttributeScope(scope=ruleDescriptor.ruleScope)>
-<returnScope(ruleDescriptor.returnScope)>
-partial void EnterRule_<ruleName>();
-partial void LeaveRule_<ruleName>();
-<ruleWrapperMap.(ruleName)>
-// $ANTLR start "<ruleName>"
-// <fileName>:<description>
-[GrammarRule("<ruleName>")]
-<ruleModifier(grammar=grammar,ruleDescriptor=ruleDescriptor)> <returnType(ruleDescriptor)> <ruleName; format="id">(<ruleDescriptor.parameterScope:parameterScope()>)
-{
-	EnterRule_<ruleName>();
-	EnterRule("<ruleName>", <ruleDescriptor.index>);
-	TraceIn("<ruleName>", <ruleDescriptor.index>);
-	<ruleScopeSetUp()>
-	<ruleDeclarations()>
-	<ruleLabelDefs(...)>
-	<ruleDescriptor.actions.init>
-	try { DebugEnterRule(GrammarFileName, "<ruleName>");
-	DebugLocation(<ruleDescriptor.tree.line>, <ruleDescriptor.EORNode.charPositionInLine>);
-	<@preamble()>
-	try
-	{
-		<ruleMemoization(name=ruleName)>
-		<block>
-		<ruleCleanUp()>
-		<(ruleDescriptor.actions.after):execAction()>
-	}
-<if(exceptions)>
-	<exceptions:{e|<catch(decl=e.decl,action=e.action)><\n>}>
-<else>
-<if(!emptyRule)>
-<if(actions.(actionScope).rulecatch)>
-	<actions.(actionScope).rulecatch>
-<else>
-	catch (RecognitionException re)
-	{
-		ReportError(re);
-		Recover(input,re);
-		<@setErrorReturnValue()>
-	}
-<endif>
-<endif>
-<endif>
-	finally
-	{
-		TraceOut("<ruleName>", <ruleDescriptor.index>);
-		LeaveRule("<ruleName>", <ruleDescriptor.index>);
-		LeaveRule_<ruleName>();
-		<memoize()>
-		<ruleScopeCleanUp()>
-		<finally>
-	}
-	DebugLocation(<ruleDescriptor.EORNode.line>, <ruleDescriptor.EORNode.charPositionInLine>);
-	} finally { DebugExitRule(GrammarFileName, "<ruleName>"); }
-	<@postamble()>
-	<returnFromRule()><\n>
-}
-// $ANTLR end "<ruleName>"
->>
-
-// imported grammars need to have internal rules
-ruleModifier(grammar,ruleDescriptor) ::= <<
-<if(grammar.grammarIsRoot)><csharpVisibilityMap.(ruleDescriptor.modifier); null="private"><else>internal<endif>
->>
-
-// imported grammars need to have public return scopes
-returnScopeModifier(grammar,ruleDescriptor) ::= <<
-<if(grammar.grammarIsRoot)><csharpVisibilityMap.(ruleDescriptor.modifier); null="private"><else>public<endif>
->>
-
-catch(decl,action) ::= <<
-catch (<e.decl>)
-{
-	<e.action>
-}
->>
-
-ruleDeclarations() ::= <<
-<if(ruleDescriptor.hasMultipleReturnValues)>
-<returnType(ruleDescriptor)> retval = new <returnType(ruleDescriptor)>(<if(ruleDescriptor.returnScope.attributes)>this<endif>);
-retval.Start = (<labelType>)input.LT(1);
-<elseif(ruleDescriptor.returnScope)>
-<ruleDescriptor.returnScope.attributes:{ a |
-<a.type> <a.name; format="id"> = <if(a.initValue)><a.initValue><else><initValue(a.type)><endif>;
-}>
-<endif>
-<if(memoize)>
-int <ruleDescriptor.name>_StartIndex = input.Index;
-<endif>
->>
-
-ruleScopeSetUp() ::= <<
-<ruleDescriptor.useScopes:{it|<it>_stack.Push(new <it>_scope(this));<it>_scopeInit(<it>_stack.Peek());}; separator="\n">
-<ruleDescriptor.ruleScope:{it|<it.name>_stack.Push(new <it.name>_scope(this));<it.name>_scopeInit(<it.name>_stack.Peek());}; separator="\n">
->>
-
-ruleScopeCleanUp() ::= <<
-<ruleDescriptor.useScopes:{it|<it>_scopeAfter(<it>_stack.Peek());<it>_stack.Pop();}; separator="\n">
-<ruleDescriptor.ruleScope:{it|<it.name>_scopeAfter(<it.name>_stack.Peek());<it.name>_stack.Pop();}; separator="\n">
->>
-
-ruleLabelDefs(ruleDescriptor, labelType, ASTLabelType, rewriteElementType) ::= <<
-<[ruleDescriptor.tokenLabels,ruleDescriptor.tokenListLabels,ruleDescriptor.wildcardTreeLabels,ruleDescriptor.wildcardTreeListLabels]
-	:{it|<labelType> <it.label.text> = default(<labelType>);}; separator="\n"
->
-<ruleDescriptor.tokenListLabels
-	:{it|List\<<labelType>\> list_<it.label.text> = null;}; separator="\n"
->
-<[ruleDescriptor.ruleListLabels,ruleDescriptor.wildcardTreeListLabels]
-	:{it|List\<<ASTLabelType>\> list_<it.label.text> = null;}; separator="\n"
->
-<ruleDescriptor.ruleLabels:ruleLabelDef(); separator="\n">
-<ruleDescriptor.ruleListLabels:ruleLabelDef(); separator="\n">
->>
-
-lexerRuleLabelDefs() ::= <<
-<[ruleDescriptor.tokenLabels,
-  ruleDescriptor.tokenListLabels,
-  ruleDescriptor.ruleLabels]
-	:{it|<labelType> <it.label.text> = default(<labelType>);}; separator="\n"
->
-<[ruleDescriptor.charListLabels,
-  ruleDescriptor.charLabels]
-	:{it|int <it.label.text> = 0;}; separator="\n"
->
-<[ruleDescriptor.tokenListLabels,
-  ruleDescriptor.ruleListLabels]
-	:{it|List\<<labelType>\> list_<it.label.text> = null;}; separator="\n"
->
-<ruleDescriptor.charListLabels:{it|List\<int> list_<it.label.text> = null;}; separator="\n"
->
->>
-
-returnFromRule() ::= <%
-return
-<if(!ruleDescriptor.isSynPred)>
-<if(ruleDescriptor.hasReturnValue)>
-<if(ruleDescriptor.hasSingleReturnValue)>
-<! This comment is a hack to make sure the following
-   single space appears in the output. !> <ruleDescriptor.singleValueReturnName>
-<else>
-<!!> retval
-<endif>
-<endif>
-<endif>
-;
-%>
-
-ruleCleanUp() ::= <<
-<if(ruleDescriptor.hasMultipleReturnValues)>
-<if(!TREE_PARSER)>
-retval.Stop = (<labelType>)input.LT(-1);
-<endif>
-<endif>
->>
-
-memoize() ::= <<
-<if(memoize)>
-<if(backtracking)>
-if (state.backtracking > 0) { Memoize(input, <ruleDescriptor.index>, <ruleDescriptor.name>_StartIndex); }
-<endif>
-<endif>
->>
-
-/** How to generate a rule in the lexer; naked blocks are used for
- *  fragment rules.
- */
-lexerRule(ruleName,nakedBlock,ruleDescriptor,block,memoize) ::= <<
-
-partial void EnterRule_<ruleName>();
-partial void LeaveRule_<ruleName>();
-
-// $ANTLR start "<ruleName>"
-[GrammarRule("<ruleName>")]
-<ruleModifier(grammar=grammar,ruleDescriptor=ruleDescriptor)> void m<ruleName>(<ruleDescriptor.parameterScope:parameterScope()>)
-{
-	EnterRule_<ruleName>();
-	EnterRule("<ruleName>", <ruleDescriptor.index>);
-	TraceIn("<ruleName>", <ruleDescriptor.index>);
-	<ruleScopeSetUp()>
-	<ruleDeclarations()>
-	try
-	{
-<if(nakedBlock)>
-		<ruleMemoization(name=ruleName)>
-		<lexerRuleLabelDefs()>
-		<ruleDescriptor.actions.init>
-		<block>
-<else>
-		int _type = <ruleName>;
-		int _channel = DefaultTokenChannel;
-		<ruleMemoization(name=ruleName)>
-		<lexerRuleLabelDefs()>
-		<ruleDescriptor.actions.init>
-		<block>
-		<ruleCleanUp()>
-		state.type = _type;
-		state.channel = _channel;
-		<(ruleDescriptor.actions.after):execAction()>
-<endif>
-	}
-	finally
-	{
-		TraceOut("<ruleName>", <ruleDescriptor.index>);
-		LeaveRule("<ruleName>", <ruleDescriptor.index>);
-		LeaveRule_<ruleName>();
-		<ruleScopeCleanUp()>
-		<memoize()>
-	}
-}
-// $ANTLR end "<ruleName>"
->>
-
-/** How to generate code for the implicitly-defined lexer grammar rule
- *  that chooses between lexer rules.
- */
-tokensRule(ruleName,nakedBlock,args,block,ruleDescriptor) ::= <<
-
-public override void mTokens()
-{
-	<block><\n>
-}
->>
-
-// S U B R U L E S
-
-/** A (...) subrule with multiple alternatives */
-block(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<
-// <fileName>:<description>
-int alt<decisionNumber>=<maxAlt>;
-<decls>
-<@predecision()>
-try { DebugEnterSubRule(<decisionNumber>);
-try { DebugEnterDecision(<decisionNumber>, false<!<decision.dfa.hasSynPred>!>);
-<decision>
-} finally { DebugExitDecision(<decisionNumber>); }
-<@postdecision()>
-<@prebranch()>
-switch (alt<decisionNumber>)
-{
-<alts:{a|<altSwitchCase(i,a)>}>
-}
-} finally { DebugExitSubRule(<decisionNumber>); }
-<@postbranch()>
->>
-
-/** A rule block with multiple alternatives */
-ruleBlock(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<
-// <fileName>:<description>
-int alt<decisionNumber>=<maxAlt>;
-<decls>
-<@predecision()>
-try { DebugEnterDecision(<decisionNumber>, false<!<decision.dfa.hasSynPred>!>);
-<decision>
-} finally { DebugExitDecision(<decisionNumber>); }
-<@postdecision()>
-switch (alt<decisionNumber>)
-{
-<alts:{a|<altSwitchCase(i,a)>}>
-}
->>
-
-ruleBlockSingleAlt(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,description) ::= <<
-// <fileName>:<description>
-<decls>
-<@prealt()>
-DebugEnterAlt(1);
-<alts>
-<@postalt()>
->>
-
-/** A special case of a (...) subrule with a single alternative */
-blockSingleAlt(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,description) ::= <<
-// <fileName>:<description>
-<decls>
-<@prealt()>
-DebugEnterAlt(1);
-<alts>
-<@postalt()>
->>
-
-/** A (..)+ block with 1 or more alternatives */
-positiveClosureBlock(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<
-// <fileName>:<description>
-int cnt<decisionNumber>=0;
-<decls>
-<@preloop()>
-try { DebugEnterSubRule(<decisionNumber>);
-while (true)
-{
-	int alt<decisionNumber>=<maxAlt>;
-	<@predecision()>
-	try { DebugEnterDecision(<decisionNumber>, false<!<decision.dfa.hasSynPred>!>);
-	<decision>
-	} finally { DebugExitDecision(<decisionNumber>); }
-	<@postdecision()>
-	switch (alt<decisionNumber>)
-	{
-	<alts:{a|<altSwitchCase(i,a)>}>
-	default:
-		if (cnt<decisionNumber> >= 1)
-			goto loop<decisionNumber>;
-
-		<ruleBacktrackFailure()>
-		EarlyExitException eee<decisionNumber> = new EarlyExitException( <decisionNumber>, input );
-		DebugRecognitionException(eee<decisionNumber>);
-		<@earlyExitException()>
-		throw eee<decisionNumber>;
-	}
-	cnt<decisionNumber>++;
-}
-loop<decisionNumber>:
-	;
-
-} finally { DebugExitSubRule(<decisionNumber>); }
-<@postloop()>
->>
-
-positiveClosureBlockSingleAlt ::= positiveClosureBlock
-
-/** A (..)* block with 1 or more alternatives */
-closureBlock(alts,decls,decision,enclosingBlockLevel,blockLevel,decisionNumber,maxK,maxAlt,description) ::= <<
-// <fileName>:<description>
-<decls>
-<@preloop()>
-try { DebugEnterSubRule(<decisionNumber>);
-while (true)
-{
-	int alt<decisionNumber>=<maxAlt>;
-	<@predecision()>
-	try { DebugEnterDecision(<decisionNumber>, false<!<decision.dfa.hasSynPred>!>);
-	<decision>
-	} finally { DebugExitDecision(<decisionNumber>); }
-	<@postdecision()>
-	switch ( alt<decisionNumber> )
-	{
-	<alts:{a|<altSwitchCase(i,a)>}>
-	default:
-		goto loop<decisionNumber>;
-	}
-}
-
-loop<decisionNumber>:
-	;
-
-} finally { DebugExitSubRule(<decisionNumber>); }
-<@postloop()>
->>
-
-closureBlockSingleAlt ::= closureBlock
-
-/** Optional blocks (x)? are translated to (x|) by before code generation
- *  so we can just use the normal block template
- */
-optionalBlock ::= block
-
-optionalBlockSingleAlt ::= block
-
-/** A case in a switch that jumps to an alternative given the alternative
- *  number.  A DFA predicts the alternative and then a simple switch
- *  does the jump to the code that actually matches that alternative.
- */
-altSwitchCase(altNum,alt) ::= <<
-case <altNum>:
-	<@prealt()>
-	DebugEnterAlt(<altNum>);
-	<alt>
-	break;<\n>
->>
-
-/** An alternative is just a list of elements; at outermost level */
-alt(elements,altNum,description,autoAST,outerAlt,treeLevel,rew) ::= <<
-// <fileName>:<description>
-{
-<@declarations()>
-<elements:element()>
-<rew>
-<@cleanup()>
-}
->>
-
-/** What to emit when there is no rewrite.  For auto build
- *  mode, does nothing.
- */
-noRewrite(rewriteBlockLevel, treeLevel) ::= ""
-
-// E L E M E N T S
-
-/** Dump the elements one per line */
-element(it) ::= <%
-<@prematch()>
-DebugLocation(<it.line>, <it.pos>);<\n>
-<it.el><\n>
-%>
-
-/** match a token optionally with a label in front */
-tokenRef(token,label,elementIndex,terminalOptions={}) ::= <<
-<if(label)><label>=(<labelType>)<endif>Match(input,<token>,Follow._<token>_in_<ruleName><elementIndex>); <checkRuleBacktrackFailure()>
->>
-
-/** ids+=ID */
-tokenRefAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<tokenRef(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-listLabel(label,elem) ::= <<
-#error The listLabel template should not be used with this target.<\n>
->>
-
-listLabelElem(label,elem,elemType) ::= <<
-if (list_<label>==null) list_<label>=new List\<<elemType; null={<labelType>}>\>();
-list_<label>.Add(<elem>);<\n>
->>
-
-/** match a character */
-charRef(char,label) ::= <<
-<if(label)>
-<label> = input.LA(1);<\n>
-<endif>
-Match(<char>); <checkRuleBacktrackFailure()>
->>
-
-/** match a character range */
-charRangeRef(a,b,label) ::= <<
-<if(label)>
-<label> = input.LA(1);<\n>
-<endif>
-MatchRange(<a>,<b>); <checkRuleBacktrackFailure()>
->>
-
-/** For now, sets are interval tests and must be tested inline */
-matchSet(s,label,elementIndex,postmatchCode="",terminalOptions={}) ::= <<
-<if(label)>
-<matchSetLabel()>
-<endif>
-if (<s>)
-{
-	input.Consume();
-	<postmatchCode>
-	<if(!LEXER)>state.errorRecovery=false;<endif><if(backtracking)>state.failed=false;<endif>
-}
-else
-{
-	<ruleBacktrackFailure()>
-	MismatchedSetException mse = new MismatchedSetException(null,input);
-	DebugRecognitionException(mse);
-	<@mismatchedSetException()>
-<if(LEXER)>
-	Recover(mse);
-	throw mse;
-<else>
-	throw mse;
-	<! use following code to make it recover inline; remove throw mse;
-	recoverFromMismatchedSet(input,mse,Follow._set_in_<ruleName><elementIndex>);
-	!>
-<endif>
-}<\n>
->>
-
-matchSetUnchecked(s,label,elementIndex,postmatchCode=false) ::= <%
-<if(label)>
-<matchSetLabel()><\n>
-<endif>
-input.Consume();<\n>
-<if(postmatchCode)>
-<postmatchCode><\n>
-<endif>
-<if(!LEXER)>state.errorRecovery=false;<endif><if(backtracking)>state.failed=false;<endif>
-%>
-
-matchSetLabel() ::= <%
-<if(LEXER)>
-<label>= input.LA(1);
-<else>
-<label>=(<labelType>)input.LT(1);
-<endif>
-%>
-
-matchRuleBlockSet ::= matchSet
-
-matchSetAndListLabel(s,label,elementIndex,postmatchCode) ::= <<
-<matchSet(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** Match a string literal */
-lexerStringRef(string,label,elementIndex) ::= <%
-<if(label)>
-int <label>Start = CharIndex;<\n>
-Match(<string>); <checkRuleBacktrackFailure()><\n>
-int <label>StartLine<elementIndex> = Line;<\n>
-int <label>StartCharPos<elementIndex> = CharPositionInLine;<\n>
-<label> = new <labelType>(input, TokenTypes.Invalid, TokenChannels.Default, <label>Start, CharIndex-1);<\n>
-<label>.Line = <label>StartLine<elementIndex>;<\n>
-<label>.CharPositionInLine = <label>StartCharPos<elementIndex>;
-<else>
-Match(<string>); <checkRuleBacktrackFailure()><\n>
-<endif>
-%>
-
-wildcard(token,label,elementIndex,terminalOptions={}) ::= <<
-<if(label)>
-<label>=(<labelType>)input.LT(1);<\n>
-<endif>
-MatchAny(input); <checkRuleBacktrackFailure()>
->>
-
-wildcardAndListLabel(token,label,elementIndex,terminalOptions={}) ::= <<
-<wildcard(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** Match . wildcard in lexer */
-wildcardChar(label, elementIndex) ::= <<
-<if(label)>
-<label> = input.LA(1);<\n>
-<endif>
-MatchAny(); <checkRuleBacktrackFailure()>
->>
-
-wildcardCharListLabel(label, elementIndex) ::= <<
-<wildcardChar(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** Match a rule reference by invoking it possibly with arguments
- *  and a return value or values.  The 'rule' argument was the
- *  target rule name, but now is type Rule, whose toString is
- *  same: the rule name.  Now though you can access full rule
- *  descriptor stuff.
- */
-ruleRef(rule,label,elementIndex,args,scope) ::= <<
-PushFollow(Follow._<rule.name>_in_<ruleName><elementIndex>);
-<if(label)><label>=<endif><if(scope)><scope:delegateName()>.<endif><rule.name; format="id">(<args; separator=", ">);
-PopFollow();
-<checkRuleBacktrackFailure()>
->>
-
-/** ids+=r */
-ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRef(...)>
-<listLabelElem(elem=label,elemType={<ASTLabelType>},...)>
->>
-
-/** A lexer rule reference.
- *
- *  The 'rule' argument was the target rule name, but now
- *  is type Rule, whose toString is same: the rule name.
- *  Now though you can access full rule descriptor stuff.
- */
-lexerRuleRef(rule,label,args,elementIndex,scope) ::= <%
-<if(label)>
-int <label>Start<elementIndex> = CharIndex;<\n>
-int <label>StartLine<elementIndex> = Line;<\n>
-int <label>StartCharPos<elementIndex> = CharPositionInLine;<\n>
-<if(scope)><scope:delegateName()>.<endif>m<rule.name>(<args; separator=", ">); <checkRuleBacktrackFailure()><\n>
-<label> = new <labelType>(input, TokenTypes.Invalid, TokenChannels.Default, <label>Start<elementIndex>, CharIndex-1);<\n>
-<label>.Line = <label>StartLine<elementIndex>;<\n>
-<label>.CharPositionInLine = <label>StartCharPos<elementIndex>;
-<else>
-<if(scope)><scope:delegateName()>.<endif>m<rule.name>(<args; separator=", ">); <checkRuleBacktrackFailure()>
-<endif>
-%>
-
-/** i+=INT in lexer */
-lexerRuleRefAndListLabel(rule,label,args,elementIndex,scope) ::= <<
-<lexerRuleRef(...)>
-<listLabelElem(elem=label,elemType=labelType,...)>
->>
-
-/** EOF in the lexer */
-lexerMatchEOF(label,elementIndex) ::= <%
-<if(label)>
-int <label>Start<elementIndex> = CharIndex;<\n>
-int <label>StartLine<elementIndex> = Line;<\n>
-int <label>StartCharPos<elementIndex> = CharPositionInLine;<\n>
-Match(EOF); <checkRuleBacktrackFailure()><\n>
-<labelType> <label> = new <labelType>(input, EOF, TokenChannels.Default, <label>Start<elementIndex>, CharIndex-1);<\n>
-<label>.Line = <label>StartLine<elementIndex>;<\n>
-<label>.CharPositionInLine = <label>StartCharPos<elementIndex>;
-<else>
-Match(EOF); <checkRuleBacktrackFailure()>
-<endif>
-%>
-
-// used for left-recursive rules
-recRuleDefArg()                       ::= "int <recRuleArg()>"
-recRuleArg()                          ::= "_p"
-recRuleAltPredicate(ruleName,opPrec)  ::= "<recRuleArg()> \<= <opPrec>"
-recRuleSetResultAction()              ::= "root_0=$<ruleName>_primary.tree;"
-
-/** match ^(root children) in tree parser */
-tree(root, actionsAfterRoot, children, nullableChildList,
-     enclosingTreeLevel, treeLevel) ::= <<
-<root:element()>
-<actionsAfterRoot:element()>
-<if(nullableChildList)>
-if (input.LA(1) == TokenTypes.Down)
-{
-	Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()>
-	<children:element()>
-	Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()>
-}
-<else>
-Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()>
-<children:element()>
-Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()>
-<endif>
->>
-
-/** Every predicate is used as a validating predicate (even when it is
- *  also hoisted into a prediction expression).
- */
-validateSemanticPredicate(pred,description) ::= <<
-if (!(<evalPredicate(...)>))
-{
-	<ruleBacktrackFailure()>
-	throw new FailedPredicateException(input, "<ruleName>", "<description>");
-}
->>
-
-// F i x e d  D F A  (if-then-else)
-
-dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
-int LA<decisionNumber>_<k> = input.LA(<k>);<\n>
-<edges; separator="\nelse ">
-else
-{
-<if(eotPredictsAlt)>
-	alt<decisionNumber> = <eotPredictsAlt>;
-<else>
-	<ruleBacktrackFailure()>
-	NoViableAltException nvae = new NoViableAltException("<description>", <decisionNumber>, <stateNumber>, input, <k>);
-	DebugRecognitionException(nvae);
-	<@noViableAltException()>
-	throw nvae;
-<endif>
-}
->>
-
-/** Same as a normal DFA state except that we don't examine lookahead
- *  for the bypass alternative.  It delays error detection but this
- *  is faster, smaller, and more what people expect.  For (X)? people
- *  expect "if ( LA(1)==X ) match(X);" and that's it.
- */
-dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
-int LA<decisionNumber>_<k> = input.LA(<k>);<\n>
-<edges; separator="\nelse ">
->>
-
-/** A DFA state that is actually the loopback decision of a closure
- *  loop.  If end-of-token (EOT) predicts any of the targets then it
- *  should act like a default clause (i.e., no error can be generated).
- *  This is used only in the lexer so that for ('a')* on the end of a rule
- *  anything other than 'a' predicts exiting.
- */
-dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
-int LA<decisionNumber>_<k> = input.LA(<k>);<\n>
-<edges; separator="\nelse "><\n>
-<if(eotPredictsAlt)>
-<if(!edges)>
-alt<decisionNumber> = <eotPredictsAlt>;<! if no edges, don't gen ELSE !>
-<else>
-else
-{
-	alt<decisionNumber> = <eotPredictsAlt>;
-}<\n>
-<endif>
-<endif>
->>
-
-/** An accept state indicates a unique alternative has been predicted */
-dfaAcceptState(alt) ::= "alt<decisionNumber> = <alt>;"
-
-/** A simple edge with an expression.  If the expression is satisfied,
- *  enter to the target state.  To handle gated productions, we may
- *  have to evaluate some predicates for this edge.
- */
-dfaEdge(labelExpr, targetState, predicates) ::= <<
-if ((<labelExpr>)<if(predicates)> && (<predicates>)<endif>)
-{
-	<targetState>
-}
->>
-
-// F i x e d  D F A  (switch case)
-
-/** A DFA state where a SWITCH may be generated.  The code generator
- *  decides if this is possible: CodeGenerator.canGenerateSwitch().
- */
-dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
-switch (input.LA(<k>))
-{
-<edges; separator="\n">
-default:
-<if(eotPredictsAlt)>
-	alt<decisionNumber>=<eotPredictsAlt>;
-	break;<\n>
-<else>
-	{
-		<ruleBacktrackFailure()>
-		NoViableAltException nvae = new NoViableAltException("<description>", <decisionNumber>, <stateNumber>, input, <k>);
-		DebugRecognitionException(nvae);
-		<@noViableAltException()>
-		throw nvae;
-	}
-<endif>
-}<\n>
->>
-
-dfaOptionalBlockStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
-switch (input.LA(<k>))
-{
-<edges; separator="\n">
-}<\n>
->>
-
-dfaLoopbackStateSwitch(k, edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
-switch (input.LA(<k>))
-{
-<edges; separator="\n">
-<if(eotPredictsAlt)>
-default:
-	alt<decisionNumber>=<eotPredictsAlt>;
-	break;<\n>
-<endif>
-}<\n>
->>
-
-dfaEdgeSwitch(labels, targetState) ::= <<
-<labels:{it|case <it>:}; separator="\n">
-	{
-	<targetState>
-	}
-	break;
->>
-
-// C y c l i c  D F A
-
-/** The code to initiate execution of a cyclic DFA; this is used
- *  in the rule to predict an alt just like the fixed DFA case.
- *  The <name> attribute is inherited via the parser, lexer, ...
- */
-dfaDecision(decisionNumber,description) ::= <<
-try
-{
-	alt<decisionNumber> = dfa<decisionNumber>.Predict(input);
-}
-catch (NoViableAltException nvae)
-{
-	DebugRecognitionException(nvae);
-	throw;
-}
->>
-
-/* Dump DFA tables as run-length-encoded Strings of octal values.
- * Can't use hex as compiler translates them before compilation.
- * These strings are split into multiple, concatenated strings.
- * Java puts them back together at compile time thankfully.
- * Java cannot handle large static arrays, so we're stuck with this
- * encode/decode approach.  See analysis and runtime DFA for
- * the encoding methods.
- */
-cyclicDFA(dfa) ::= <<
-private class DFA<dfa.decisionNumber> : DFA
-{
-	private const string DFA<dfa.decisionNumber>_eotS =
-		"<dfa.javaCompressedEOT; wrap="\"+\n\t\t\"">";
-	private const string DFA<dfa.decisionNumber>_eofS =
-		"<dfa.javaCompressedEOF; wrap="\"+\n\t\t\"">";
-	private const string DFA<dfa.decisionNumber>_minS =
-		"<dfa.javaCompressedMin; wrap="\"+\n\t\t\"">";
-	private const string DFA<dfa.decisionNumber>_maxS =
-		"<dfa.javaCompressedMax; wrap="\"+\n\t\t\"">";
-	private const string DFA<dfa.decisionNumber>_acceptS =
-		"<dfa.javaCompressedAccept; wrap="\"+\n\t\t\"">";
-	private const string DFA<dfa.decisionNumber>_specialS =
-		"<dfa.javaCompressedSpecial; wrap="\"+\n\t\t\"">}>";
-	private static readonly string[] DFA<dfa.decisionNumber>_transitionS =
-		{
-			<dfa.javaCompressedTransition:{s|"<s; wrap="\"+\n\"">"}; separator=",\n">
-		};
-
-	private static readonly short[] DFA<dfa.decisionNumber>_eot = DFA.UnpackEncodedString(DFA<dfa.decisionNumber>_eotS);
-	private static readonly short[] DFA<dfa.decisionNumber>_eof = DFA.UnpackEncodedString(DFA<dfa.decisionNumber>_eofS);
-	private static readonly char[] DFA<dfa.decisionNumber>_min = DFA.UnpackEncodedStringToUnsignedChars(DFA<dfa.decisionNumber>_minS);
-	private static readonly char[] DFA<dfa.decisionNumber>_max = DFA.UnpackEncodedStringToUnsignedChars(DFA<dfa.decisionNumber>_maxS);
-	private static readonly short[] DFA<dfa.decisionNumber>_accept = DFA.UnpackEncodedString(DFA<dfa.decisionNumber>_acceptS);
-	private static readonly short[] DFA<dfa.decisionNumber>_special = DFA.UnpackEncodedString(DFA<dfa.decisionNumber>_specialS);
-	private static readonly short[][] DFA<dfa.decisionNumber>_transition;
-
-	static DFA<dfa.decisionNumber>()
-	{
-		int numStates = DFA<dfa.decisionNumber>_transitionS.Length;
-		DFA<dfa.decisionNumber>_transition = new short[numStates][];
-		for ( int i=0; i \< numStates; i++ )
-		{
-			DFA<dfa.decisionNumber>_transition[i] = DFA.UnpackEncodedString(DFA<dfa.decisionNumber>_transitionS[i]);
-		}
-	}
-
-	public DFA<dfa.decisionNumber>( BaseRecognizer recognizer<if(dfa.specialStateSTs)>, SpecialStateTransitionHandler specialStateTransition<endif> )
-<if(dfa.specialStateSTs)>
-		: base(specialStateTransition)
-<endif>
-	{
-		this.recognizer = recognizer;
-		this.decisionNumber = <dfa.decisionNumber>;
-		this.eot = DFA<dfa.decisionNumber>_eot;
-		this.eof = DFA<dfa.decisionNumber>_eof;
-		this.min = DFA<dfa.decisionNumber>_min;
-		this.max = DFA<dfa.decisionNumber>_max;
-		this.accept = DFA<dfa.decisionNumber>_accept;
-		this.special = DFA<dfa.decisionNumber>_special;
-		this.transition = DFA<dfa.decisionNumber>_transition;
-	}
-
-	public override string Description { get { return "<dfa.description>"; } }
-
-	public override void Error(NoViableAltException nvae)
-	{
-		DebugRecognitionException(nvae);
-	}
-}<\n>
-<if(dfa.specialStateSTs)>
-private int SpecialStateTransition<dfa.decisionNumber>(DFA dfa, int s, IIntStream _input)<! throws NoViableAltException!>
-{
-	<if(LEXER)>
-	IIntStream input = _input;
-	<endif>
-	<if(PARSER)>
-	ITokenStream input = (ITokenStream)_input;
-	<endif>
-	<if(TREE_PARSER)>
-	ITreeNodeStream input = (ITreeNodeStream)_input;
-	<endif>
-	int _s = s;
-	s = -1;
-	<! pull these outside the switch cases to save space on locals !>
-	int LA<dfa.decisionNumber>_1 = input.LA(1);
-	int index<dfa.decisionNumber>_1 = input.Index;
-	switch (_s)
-	{
-	<dfa.specialStateSTs:{state |case <i0>:<! compressed special state numbers 0..n-1 !>
-	<state>}; separator="\n">
-
-	default:
-		break;
-	}
-
-	if (s >= 0)
-		return s;
-
-<if(backtracking)>
-	if (state.backtracking > 0) {state.failed=true; return -1;}
-<endif>
-	NoViableAltException nvae = new NoViableAltException(dfa.Description, <dfa.decisionNumber>, _s, input);
-	dfa.Error(nvae);
-	throw nvae;
-}
-<endif>
->>
-
-/** A state in a cyclic DFA; it's a special state and part of a big switch on
- *  state.
- */
-cyclicDFAState(decisionNumber,stateNumber,edges,needErrorClause,semPredState) ::= <<
-{
-<if(semPredState)>
-	<! get next lookahead symbol to test edges, then rewind !>
-	input.Rewind();
-<endif>
-	<edges; separator="\nelse ">
-<if(semPredState)>
-	<! return input cursor to state before we rewound !>
-	input.Seek(index<decisionNumber>_1);
-<endif>
-	break;
-}
->>
-
-/** Just like a fixed DFA edge, test the lookahead and indicate what
- *  state to jump to next if successful.
- */
-cyclicDFAEdge(labelExpr, targetStateNumber, edgeNumber, predicates) ::= <<
-if ((<labelExpr>)<if(predicates)> && (<predicates>)<endif>) {s = <targetStateNumber>;}<\n>
->>
-
-/** An edge pointing at end-of-token; essentially matches any char;
- *  always jump to the target.
- */
-eotDFAEdge(targetStateNumber,edgeNumber, predicates) ::= <<
-s = <targetStateNumber>;<\n>
->>
-
-
-// D F A  E X P R E S S I O N S
-
-andPredicates(left,right) ::= "(<left>&&<right>)"
-
-orPredicates(operands) ::= "(<operands; separator=\"||\">)"
-
-notPredicate(pred) ::= "!(<evalPredicate(...)>)"
-
-evalPredicate(pred,description) ::= "(<pred>)"
-
-evalSynPredicate(pred,description) ::= "EvaluatePredicate(<pred>_fragment)"
-
-lookaheadTest(atom,k,atomAsInt) ::= "LA<decisionNumber>_<k>==<atom>"
-
-/** Sometimes a lookahead test cannot assume that LA(k) is in a temp variable
- *  somewhere.  Must ask for the lookahead directly.
- */
-isolatedLookaheadTest(atom,k,atomAsInt) ::= "input.LA(<k>)==<atom>"
-
-lookaheadRangeTest(lower,upper,k,rangeNumber,lowerAsInt,upperAsInt) ::= <%
-(LA<decisionNumber>_<k><ge()><lower> && LA<decisionNumber>_<k><le()><upper>)
-%>
-
-isolatedLookaheadRangeTest(lower,upper,k,rangeNumber,lowerAsInt,upperAsInt) ::= "(input.LA(<k>)<ge()><lower> && input.LA(<k>)<le()><upper>)"
-
-le() ::= "\<="
-ge() ::= ">="
-
-setTest(ranges) ::= <<
-<ranges; separator="||">
->>
-
-// A T T R I B U T E S
-
-attributeScope(scope) ::= <<
-<if(scope)>
-<if(scope.attributes)>
-protected sealed partial class <scope.name>_scope
-{
-	<scope.attributes:{it|public <it.decl>;}; separator="\n">
-
-	public <scope.name>_scope(<grammar.recognizerName> grammar) { OnCreated(grammar); }
-	partial void OnCreated(<grammar.recognizerName> grammar);
-}
-<if(scope.actions.scopeinit)>
-protected void <scope.name>_scopeInit( <scope.name>_scope scope )
-{
-	<scope.actions.scopeinit>
-}
-<else>
-partial void <scope.name>_scopeInit( <scope.name>_scope scope );
-<endif>
-<if(scope.actions.scopeafter)>
-protected void <scope.name>_scopeAfter( <scope.name>_scope scope )
-{
-	<scope.actions.scopeafter>
-}
-<else>
-partial void <scope.name>_scopeAfter( <scope.name>_scope scope );
-<endif>
-protected readonly ListStack\<<scope.name>_scope> <scope.name>_stack = new ListStack\<<scope.name>_scope>();
-<endif>
-<endif>
->>
-
-globalAttributeScope(scope) ::= <<
-<attributeScope(...)>
->>
-
-ruleAttributeScope(scope) ::= <<
-<attributeScope(...)>
->>
-
-returnStructName(it) ::= "<it.name>_return"
-
-returnType(ruleDescriptor) ::= <%
-<if(ruleDescriptor.returnScope.attributes && ruleDescriptor.hasMultipleReturnValues)>
-	<ruleDescriptor.grammar.recognizerName>.<ruleDescriptor:returnStructName()>
-<elseif(ruleDescriptor.hasMultipleReturnValues)>
-	<ruleReturnBaseType()>
-<elseif(ruleDescriptor.hasSingleReturnValue)>
-	<ruleDescriptor.singleValueReturnType>
-<else>
-	void
-<endif>
-%>
-
-/** Generate the C# type associated with a single or multiple return
- *  values.
- */
-ruleLabelType(referencedRule) ::= <%
-<if(referencedRule.hasMultipleReturnValues)>
-	<ruleReturnBaseType()>
-<elseif(referencedRule.hasSingleReturnValue)>
-	<referencedRule.singleValueReturnType>
-<else>
-	void
-<endif>
-%>
-
-delegateName(it) ::= <<
-<if(it.label)><it.label><else>g<it.name><endif>
->>
-
-/** Using a type to init value map, try to init a type; if not in table
- *  must be an object, default value is "null".
- */
-initValue(typeName) ::= <<
-default(<typeName>)
->>
-
-/** Define a rule label including default value */
-ruleLabelDef(label) ::= <%
-<ruleLabelType(label.referencedRule)> <label.label.text> = <initValue(ruleLabelType(label.referencedRule))>;
-%>
-
-/** Define a return struct for a rule if the code needs to access its
- *  start/stop tokens, tree stuff, attributes, ...  Leave a hole for
- *  subgroups to stick in members.
- */
-returnScope(scope) ::= <<
-<if(scope.attributes && ruleDescriptor.hasMultipleReturnValues)>
-<returnScopeModifier(grammar=grammar,ruleDescriptor=ruleDescriptor)> sealed partial class <ruleDescriptor:returnStructName()> : <ruleReturnBaseType()><@ruleReturnInterfaces()>
-{
-	<scope.attributes:{it|public <it.decl>;}; separator="\n">
-	<@ruleReturnMembers()>
-}
-<endif>
->>
-
-ruleReturnBaseType() ::= <%
-<if(TREE_PARSER)>Tree<else>Parser<endif>RuleReturnScope\<<labelType>>
-%>
-
-@returnScope.ruleReturnMembers() ::= <<
-public <ruleDescriptor:returnStructName()>(<grammar.recognizerName> grammar) {OnCreated(grammar);}
-partial void OnCreated(<grammar.recognizerName> grammar);
->>
-
-parameterScope(scope) ::= <<
-<scope.attributes:{it|<it.decl>}; separator=", ">
->>
-
-parameterAttributeRef(attr) ::= <<
-<attr.name; format="id">
->>
-
-parameterSetAttributeRef(attr,expr) ::= <<
-<attr.name; format="id"> =<expr>;
->>
-
-scopeAttributeRef(scope,attr,index,negIndex) ::= <%
-<if(negIndex)>
-<scope>_stack[<scope>_stack.Count - <negIndex> - 1].<attr.name; format="id">
-<else>
-<if(index)>
-<scope>_stack[<index>].<attr.name; format="id">
-<else>
-<scope>_stack.Peek().<attr.name; format="id">
-<endif>
-<endif>
-%>
-
-scopeSetAttributeRef(scope,attr,expr,index,negIndex) ::= <%
-<if(negIndex)>
-<scope>_stack[<scope>_stack.Count - <negIndex> - 1].<attr.name; format="id"> = <expr>;
-<else>
-<if(index)>
-<scope>_stack[<index>].<attr.name; format="id"> = <expr>;
-<else>
-<scope>_stack.Peek().<attr.name; format="id"> = <expr>;
-<endif>
-<endif>
-%>
-
-/** $x is either global scope or x is rule with dynamic scope; refers
- *  to stack itself not top of stack.  This is useful for predicates
- *  like {$function.Count>0 && $function::name.Equals("foo")}?
- */
-isolatedDynamicScopeRef(scope) ::= "<scope>_stack"
-
-/** reference an attribute of rule; might only have single return value */
-ruleLabelRef(referencedRule,scope,attr) ::= <%
-<if(referencedRule.hasMultipleReturnValues)>
-(<scope>!=null?((<returnType(referencedRule)>)<scope>).<attr.name; format="id">:<initValue(attr.type)>)
-<else>
-<scope>
-<endif>
-%>
-
-returnAttributeRef(ruleDescriptor,attr) ::= <%
-<if(ruleDescriptor.hasMultipleReturnValues)>
-retval.<attr.name; format="id">
-<else>
-<attr.name; format="id">
-<endif>
-%>
-
-returnSetAttributeRef(ruleDescriptor,attr,expr) ::= <%
-<if(ruleDescriptor.hasMultipleReturnValues)>
-retval.<attr.name; format="id"> =<expr>;
-<else>
-<attr.name; format="id"> =<expr>;
-<endif>
-%>
-
-/** How to translate $tokenLabel */
-tokenLabelRef(label) ::= "<label>"
-
-/** ids+=ID {$ids} or e+=expr {$e} */
-listLabelRef(label) ::= "list_<label>"
-
-
-// not sure the next are the right approach
-
-tokenLabelPropertyRef_text(scope,attr) ::= "(<scope>!=null?<scope>.Text:default(string))"
-tokenLabelPropertyRef_type(scope,attr) ::= "(<scope>!=null?<scope>.Type:0)"
-tokenLabelPropertyRef_line(scope,attr) ::= "(<scope>!=null?<scope>.Line:0)"
-tokenLabelPropertyRef_pos(scope,attr) ::= "(<scope>!=null?<scope>.CharPositionInLine:0)"
-tokenLabelPropertyRef_channel(scope,attr) ::= "(<scope>!=null?<scope>.Channel:0)"
-tokenLabelPropertyRef_index(scope,attr) ::= "(<scope>!=null?<scope>.TokenIndex:0)"
-tokenLabelPropertyRef_tree(scope,attr) ::= "<scope>_tree"
-tokenLabelPropertyRef_int(scope,attr) ::= "(<scope>!=null?int.Parse(<scope>.Text):0)"
-
-ruleLabelPropertyRef_start(scope,attr) ::= "(<scope>!=null?((<labelType>)<scope>.Start):default(<labelType>))"
-ruleLabelPropertyRef_stop(scope,attr) ::= "(<scope>!=null?((<labelType>)<scope>.Stop):default(<labelType>))"
-ruleLabelPropertyRef_tree(scope,attr) ::= "(<scope>!=null?((<ASTLabelType>)<scope>.Tree):default(<ASTLabelType>))"
-ruleLabelPropertyRef_text(scope,attr) ::= <%
-<if(TREE_PARSER)>
-(<scope>!=null?(input.TokenStream.ToString(
-  input.TreeAdaptor.GetTokenStartIndex(<scope>.Start),
-  input.TreeAdaptor.GetTokenStopIndex(<scope>.Start))):default(string))
-<else>
-(<scope>!=null?input.ToString(<scope>.Start,<scope>.Stop):default(string))
-<endif>
-%>
-
-ruleLabelPropertyRef_st(scope,attr) ::= "(<scope>!=null?<scope>.Template:null)"
-
-/** Isolated $RULE ref ok in lexer as it's a Token */
-lexerRuleLabel(label) ::= "<label>"
-
-lexerRuleLabelPropertyRef_type(scope,attr) ::=
-    "(<scope>!=null?<scope>.Type:0)"
-
-lexerRuleLabelPropertyRef_line(scope,attr) ::=
-    "(<scope>!=null?<scope>.Line:0)"
-
-lexerRuleLabelPropertyRef_pos(scope,attr) ::=
-    "(<scope>!=null?<scope>.CharPositionInLine:-1)"
-
-lexerRuleLabelPropertyRef_channel(scope,attr) ::=
-    "(<scope>!=null?<scope>.Channel:0)"
-
-lexerRuleLabelPropertyRef_index(scope,attr) ::=
-    "(<scope>!=null?<scope>.TokenIndex:0)"
-
-lexerRuleLabelPropertyRef_text(scope,attr) ::=
-    "(<scope>!=null?<scope>.Text:default(string))"
-
-lexerRuleLabelPropertyRef_int(scope,attr) ::=
-    "(<scope>!=null?int.Parse(<scope>.Text):0)"
-
-// Somebody may ref $template or $tree or $stop within a rule:
-rulePropertyRef_start(scope,attr) ::= "retval.Start"
-rulePropertyRef_stop(scope,attr) ::= "retval.Stop"
-rulePropertyRef_tree(scope,attr) ::= "retval.Tree"
-rulePropertyRef_text(scope,attr) ::= <%
-<if(TREE_PARSER)>
-input.TokenStream.ToString(
-  input.TreeAdaptor.GetTokenStartIndex(retval.Start),
-  input.TreeAdaptor.GetTokenStopIndex(retval.Start))
-<else>
-input.ToString(retval.Start,input.LT(-1))
-<endif>
-%>
-rulePropertyRef_st(scope,attr) ::= "retval.Template"
-
-lexerRulePropertyRef_text(scope,attr) ::= "Text"
-lexerRulePropertyRef_type(scope,attr) ::= "_type"
-lexerRulePropertyRef_line(scope,attr) ::= "state.tokenStartLine"
-lexerRulePropertyRef_pos(scope,attr) ::= "state.tokenStartCharPositionInLine"
-lexerRulePropertyRef_index(scope,attr) ::= "-1" // undefined token index in lexer
-lexerRulePropertyRef_channel(scope,attr) ::= "_channel"
-lexerRulePropertyRef_start(scope,attr) ::= "state.tokenStartCharIndex"
-lexerRulePropertyRef_stop(scope,attr) ::= "(CharIndex-1)"
-lexerRulePropertyRef_int(scope,attr) ::= "int.Parse(<scope>.Text)"
-
-// setting $st and $tree is allowed in local rule. everything else
-// is flagged as error
-ruleSetPropertyRef_tree(scope,attr,expr) ::= "retval.Tree = <expr>;"
-ruleSetPropertyRef_st(scope,attr,expr) ::= "retval.Template =<expr>;"
-
-/** How to execute an action (only when not backtracking) */
-execAction(action) ::= <%
-<if(backtracking)>
-if (<actions.(actionScope).synpredgate>)<\n>
-{<\n>
-<@indentedAction()><\n>
-}
-<else>
-<action>
-<endif>
-%>
-
-@execAction.indentedAction() ::= <<
-	<action>
->>
-
-/** How to always execute an action even when backtracking */
-execForcedAction(action) ::= "<action>"
-
-// M I S C (properties, etc...)
-
-bitset(name, words64) ::= <<
-public static readonly BitSet <name> = new BitSet(new ulong[]{<words64:{it|<it>UL};separator=",">});
->>
-
-codeFileExtension() ::= ".cs"
-
-true_value() ::= "true"
-false_value() ::= "false"
diff --git a/Tools/Antlr/Codegen/Templates/CSharp3/Dbg.stg b/Tools/Antlr/Codegen/Templates/CSharp3/Dbg.stg
deleted file mode 100644
index c250e44b4fe..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp3/Dbg.stg
+++ /dev/null
@@ -1,312 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2005-2008 Terence Parr
- * All rights reserved.
- *
- * Conversion to C#:
- * Copyright (c) 2008-2009 Sam Harwell, Pixel Mine, Inc.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-/** Template overrides to add debugging to normal Java output;
- *  If ASTs are built, then you'll also get ASTDbg.stg loaded.
- */
-
-@outputFile.imports() ::= <<
-<@super.imports()>
-using Antlr.Runtime.Debug;
-using IOException = System.IO.IOException;
->>
-
-@genericParser.members() ::= <<
-<if(grammar.grammarIsRoot)>
-public static readonly string[] ruleNames =
-	new string[]
-	{
-		"invalidRule", <grammar.allImportedRules:{rST | "<rST.name>"}; wrap="\n	", separator=", ">
-	};<\n>
-<endif>
-<if(grammar.grammarIsRoot)><! grammar imports other grammar(s) !>
-int ruleLevel = 0;
-public virtual int RuleLevel { get { return ruleLevel; } }
-public virtual void IncRuleLevel() { ruleLevel++; }
-public virtual void DecRuleLevel() { ruleLevel--; }
-<if(profile)>
-<ctorForProfilingRootGrammar()>
-<else>
-<ctorForRootGrammar()>
-<endif>
-<ctorForPredefinedListener()>
-<else><! imported grammar !>
-public int RuleLevel { get { return <grammar.delegators:{g| <g:delegateName()>}>.RuleLevel; } }
-public void IncRuleLevel() { <grammar.delegators:{g| <g:delegateName()>}>.IncRuleLevel(); }
-public void DecRuleLevel() { <grammar.delegators:{g| <g:delegateName()>}>.DecRuleLevel(); }
-<ctorForDelegateGrammar()>
-<endif>
-<if(profile)>
-public override bool AlreadyParsedRule( IIntStream input, int ruleIndex )
-{
-	int stopIndex = GetRuleMemoization(ruleIndex, input.Index);
-	((Profiler)dbg).ExamineRuleMemoization(input, ruleIndex, stopIndex, <grammar.composite.rootGrammar.recognizerName>.ruleNames[ruleIndex]);
-	return base.AlreadyParsedRule(input, ruleIndex);
-}<\n>
-public override void Memoize( IIntStream input, int ruleIndex, int ruleStartIndex )
-{
-	((Profiler)dbg).Memoize(input, ruleIndex, ruleStartIndex, <grammar.composite.rootGrammar.recognizerName>.ruleNames[ruleIndex]);
-	base.Memoize(input, ruleIndex, ruleStartIndex);
-}<\n>
-<endif>
-protected virtual bool EvalPredicate( bool result, string predicate )
-{
-	dbg.SemanticPredicate( result, predicate );
-	return result;
-}<\n>
->>
-
-ctorForRootGrammar() ::= <<
-<! bug: can't use <@super.members()> cut-n-paste instead !>
-<! Same except we add port number and profile stuff if root grammar !>
-<actions.(actionScope).ctorModifier; null="public"> <name>( <inputStreamType> input )
-	: this( input, DebugEventSocketProxy.DefaultDebuggerPort, new RecognizerSharedState() )
-{
-}
-<actions.(actionScope).ctorModifier; null="public"> <name>( <inputStreamType> input, int port, RecognizerSharedState state )
-	: base( input, state )
-{
-	<createListenerAndHandshake()>
-	<grammar.directDelegates:{g|<g:delegateName()> = new <g.recognizerName>( input, dbg, this.state, this<grammar.delegators:{g|, <g:delegateName()>}> );}; separator="\n">
-	<parserCtorBody()>
-	<@finally()>
-}<\n>
->>
-
-ctorForProfilingRootGrammar() ::= <<
-<! bug: can't use <@super.members()> cut-n-paste instead !>
-<actions.(actionScope).ctorModifier; null="public"> <name>( <inputStreamType> input )
-	: this( input, new Profiler(null), new RecognizerSharedState() )
-{
-}
-<actions.(actionScope).ctorModifier; null="public"> <name>( <inputStreamType> input, IDebugEventListener dbg, RecognizerSharedState state )
-	: base( input, dbg, state )
-{
-	Profiler p = (Profiler)dbg;
-	p.setParser(this);
-	<grammar.directDelegates:
-	 {g|<g:delegateName()> = new <g.recognizerName>( input, dbg, this.state, this<grammar.delegators:{g|, <g:delegateName()>}> );}; separator="\n">
-	<parserCtorBody()>
-	<@finally()>
-}
-<\n>
->>
-
-/** Basically we don't want to set any dbg listeners are root will have it. */
-ctorForDelegateGrammar() ::= <<
-<actions.(actionScope).ctorModifier; null="public"> <name>( <inputStreamType> input, IDebugEventListener dbg, RecognizerSharedState state<grammar.delegators:{g|, <g.recognizerName> <g:delegateName()>}> )
-	: base( input, dbg, state )
-{
-	<grammar.directDelegates:
-	 {g|<g:delegateName()> = new <g.recognizerName>( input, this, this.state<grammar.delegators:{g|, <g:delegateName()>}> );}; separator="\n">
-	<parserCtorBody()>
-}<\n>
->>
-
-ctorForPredefinedListener() ::= <<
-<actions.(actionScope).ctorModifier; null="public"> <name>( <inputStreamType> input, IDebugEventListener dbg )
-	<@superClassRef>: base( input, dbg, new RecognizerSharedState() )<@end>
-{
-<if(profile)>
-	Profiler p = (Profiler)dbg;
-	p.setParser(this);
-<endif>
-	<grammar.directDelegates:{g|<g:delegateName()> = new <g.recognizerName>(input, dbg, this.state, this<grammar.delegators:{g|, <g:delegateName()>}>);}; separator="\n">
-	<parserCtorBody()>
-	<@finally()>
-}<\n>
->>
-
-createListenerAndHandshake() ::= <<
-<if(TREE_PARSER)>
-DebugEventSocketProxy proxy = new DebugEventSocketProxy( this, port, input.TreeAdaptor );<\n>
-<else>
-DebugEventSocketProxy proxy = new DebugEventSocketProxy( this, port, null );<\n>
-<endif>
-DebugListener = proxy;
-try
-{
-	proxy.Handshake();
-}
-catch ( IOException ioe )
-{
-	ReportError( ioe );
-}
->>
-
-@genericParser.superClassName() ::= "Debug<@super.superClassName()>"
-
-/*
- * Much of the following rules were merged into CSharp3.stg.
- */
-
-@rule.preamble() ::= <<
-if (RuleLevel == 0)
-	DebugListener.Commence();
-IncRuleLevel();
->>
-//@rule.preamble() ::= <<
-//try
-//{
-//	dbg.EnterRule( GrammarFileName, "<ruleName>" );
-//	if ( RuleLevel == 0 )
-//	{
-//		dbg.Commence();
-//	}
-//	IncRuleLevel();
-//	dbg.Location( <ruleDescriptor.tree.line>, <ruleDescriptor.tree.charPositionInLine> );<\n>
-//>>
-
-@rule.postamble() ::= <<
-DecRuleLevel();
-if (RuleLevel == 0)
-	DebugListener.Terminate();
->>
-//@rule.postamble() ::= <<
-//dbg.Location(<ruleDescriptor.EORNode.line>, <ruleDescriptor.EORNode.charPositionInLine>);<\n>
-//}
-//finally
-//{
-//	dbg.ExitRule( GrammarFileName, "<ruleName>" );
-//	DecRuleLevel();
-//	if ( RuleLevel == 0 )
-//	{
-//		dbg.Terminate();
-//	}
-//}<\n>
-//>>
-
-//@insertSynpreds.start() ::= "dbg.BeginBacktrack( state.backtracking );"
-//@insertSynpreds.stop() ::= "dbg.EndBacktrack( state.backtracking, success );"
-
-// Common debug event triggers used by region overrides below
-
-//enterSubRule() ::= <<
-//try
-//{
-//	dbg.EnterSubRule( <decisionNumber> );<\n>
-//>>
-
-//exitSubRule() ::= <<
-//}
-//finally
-//{
-//	dbg.ExitSubRule( <decisionNumber> );
-//}<\n>
-//>>
-
-//enterDecision() ::= <<
-//try
-//{
-//	dbg.EnterDecision( <decisionNumber> );<\n>
-//>>
-
-//exitDecision() ::= <<
-//}
-//finally
-//{
-//	dbg.ExitDecision( <decisionNumber> );
-//}<\n>
-//>>
-
-//enterAlt(n) ::= "dbg.EnterAlt( <n> );<\n>"
-
-// Region overrides that tell various constructs to add debugging triggers
-
-//@block.predecision() ::= "<enterSubRule()><enterDecision()>"
-
-//@block.postdecision() ::= "<exitDecision()>"
-
-//@block.postbranch() ::= "<exitSubRule()>"
-
-//@ruleBlock.predecision() ::= "<enterDecision()>"
-
-//@ruleBlock.postdecision() ::= "<exitDecision()>"
-
-//@ruleBlockSingleAlt.prealt() ::= "<enterAlt(n=\"1\")>"
-
-//@blockSingleAlt.prealt() ::= "<enterAlt(n=\"1\")>"
-
-//@positiveClosureBlock.preloop() ::= "<enterSubRule()>"
-
-//@positiveClosureBlock.postloop() ::= "<exitSubRule()>"
-
-//@positiveClosureBlock.predecision() ::= "<enterDecision()>"
-
-//@positiveClosureBlock.postdecision() ::= "<exitDecision()>"
-
-//@positiveClosureBlock.earlyExitException() ::=
-//	"dbg.RecognitionException( eee<decisionNumber> );<\n>"
-
-//@closureBlock.preloop() ::= "<enterSubRule()>"
-
-//@closureBlock.postloop() ::= "<exitSubRule()>"
-
-//@closureBlock.predecision() ::= "<enterDecision()>"
-
-//@closureBlock.postdecision() ::= "<exitDecision()>"
-
-//@altSwitchCase.prealt() ::= "<enterAlt(n=i)>"
-
-//@element.prematch() ::=
-//	"dbg.Location( <it.line>, <it.pos> );"
-
-//@matchSet.mismatchedSetException() ::=
-//	"dbg.RecognitionException( mse );"
-
-//@dfaState.noViableAltException() ::= "dbg.RecognitionException( nvae );"
-
-//@dfaStateSwitch.noViableAltException() ::= "dbg.RecognitionException( nvae );"
-
-//dfaDecision(decisionNumber,description) ::= <<
-//try
-//{
-//	isCyclicDecision = true;
-//	<super.dfaDecision(...)>
-//}
-//catch ( NoViableAltException nvae )
-//{
-//	dbg.RecognitionException( nvae );
-//	throw nvae;
-//}
-//>>
-
-//@cyclicDFA.errorMethod() ::= <<
-//public override void Error( NoViableAltException nvae )
-//{
-//	((DebugParser)recognizer).dbg.RecognitionException( nvae );
-//}
-//>>
-
-/** Force predicate validation to trigger an event */
-evalPredicate(pred,description) ::= <<
-EvalPredicate(<pred>, "<description>")
->>
diff --git a/Tools/Antlr/Codegen/Templates/CSharp3/ST.stg b/Tools/Antlr/Codegen/Templates/CSharp3/ST.stg
deleted file mode 100644
index fd1322f2029..00000000000
--- a/Tools/Antlr/Codegen/Templates/CSharp3/ST.stg
+++ /dev/null
@@ -1,153 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2011 Terence Parr
- * All rights reserved.
- *
- * Conversion to C#:
- * Copyright (c) 2011 Sam Harwell, Pixel Mine, Inc.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-/** Template subgroup to add template rewrite output
- *  If debugging, then you'll also get STDbg.stg loaded.
- */
-
-@outputFile.imports() ::= <<
-<@super.imports()>
-using Antlr3.ST;
-using Antlr3.ST.Language;
->>
-
-@genericParser.members() ::= <<
-<@super.members()>
-private StringTemplateGroup _templateGroup = new StringTemplateGroup("<name>Templates", typeof(AngleBracketTemplateLexer) );
-
-public StringTemplateGroup TemplateGroup
-{
-	get { return _templateGroup; }
-	set { _templateGroup = value; }
-}
->>
-
-ruleReturnBaseType() ::= <%
-Template<if(TREE_PARSER)>Tree<else>Parser<endif>RuleReturnScope\<StringTemplate, <labelType>>
-%>
-
-/** x+=rule when output=template */
-ruleRefAndListLabel(rule,label,elementIndex,args,scope) ::= <<
-<ruleRef(...)>
-<listLabelElem(elem={<label>.Template},elemType="StringTemplate",...)>
->>
-
-rewriteTemplate(alts) ::= <<
-
-// TEMPLATE REWRITE
-<if(backtracking)>
-if (<actions.(actionScope).synpredgate>)
-{
-	<alts:rewriteTemplateAlt(); separator="else ">
-	<if(rewriteMode)><replaceTextInLine()><endif>
-}
-<else>
-<alts:rewriteTemplateAlt(); separator="else ">
-<if(rewriteMode)><replaceTextInLine()><endif>
-<endif>
->>
-
-replaceTextInLine() ::= <<
-<if(TREE_PARSER)>
-((TokenRewriteStream)input.TokenStream).Replace(
-	input.TreeAdaptor.GetTokenStartIndex(retval.Start),
-	input.TreeAdaptor.GetTokenStopIndex(retval.Start),
-	retval.Template);
-<else>
-((TokenRewriteStream)input).Replace(
-	retval.Start.TokenIndex,
-	input.LT(-1).TokenIndex,
-	retval.Template);
-<endif>
->>
-
-rewriteTemplateAlt(it) ::= <<
-// <it.description>
-<if(it.pred)>
-if (<it.pred>)
-{
-	retval.Template = <it.alt>;
-}<\n>
-<else>
-{
-	retval.Template = <it.alt>;
-}<\n>
-<endif>
->>
-
-rewriteEmptyTemplate(alts) ::= <<
-null;
->>
-
-/** Invoke a template with a set of attribute name/value pairs.
- *  Set the value of the rule's template *after* having set
- *  the attributes because the rule's template might be used as
- *  an attribute to build a bigger template; you get a self-embedded
- *  template.
- */
-rewriteExternalTemplate(name,args) ::= <%
-TemplateGroup.GetInstanceOf("<name>"<optionalArguments(args)>)
-%>
-
-/** expr is a string expression that says what template to load */
-rewriteIndirectTemplate(expr,args) ::= <%
-TemplateGroup.GetInstanceOf(<expr><optionalArguments(args)>)
-%>
-
-/** Invoke an inline template with a set of attribute name/value pairs */
-rewriteInlineTemplate(args, template) ::= <%
-new StringTemplate(TemplateGroup, "<template>"<optionalArguments(args)>)
-%>
-
-optionalArguments(args) ::= <<
-<if(args)>,
-	new Dictionary\<string, object>() { <args:optionalArgument(); separator=", "> }
-<endif>
->>
-
-optionalArgument(it) ::= <<
-{"<it.name>", <it.value>}
->>
-
-/** plain -> {foo} action */
-rewriteAction(action) ::= <<
-<action>
->>
-
-/** An action has %st.attrName=expr; or %{st}.attrName=expr; */
-actionSetAttribute(st,attrName,expr) ::= <<
-(<st>).SetAttribute("<attrName>",<expr>);
->>
-
-/** Translate %{stringExpr} */
-actionStringConstructor(stringExpr) ::= <<
-new StringTemplate(TemplateGroup,<stringExpr>)
->>
diff --git a/Tools/Antlr/Codegen/Templates/LeftRecursiveRules.stg b/Tools/Antlr/Codegen/Templates/LeftRecursiveRules.stg
deleted file mode 100644
index e39b1b67f19..00000000000
--- a/Tools/Antlr/Codegen/Templates/LeftRecursiveRules.stg
+++ /dev/null
@@ -1,82 +0,0 @@
-/*
- [The "BSD license"]
- Copyright (c) 2010 Terence Parr
- All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions
- are met:
- 1. Redistributions of source code must retain the above copyright
-    notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above copyright
-    notice, this list of conditions and the following disclaimer in the
-    documentation and/or other materials provided with the distribution.
- 3. The name of the author may not be used to endorse or promote products
-    derived from this software without specific prior written permission.
-
- THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-*/
-
-/** How to generate rules derived from left-recursive rules.
- *  These rely on recRuleDefArg(), recRuleAltPredicate(),
- *  recRuleArg(), recRuleSetResultAction(), recRuleSetReturnAction()
- *  templates in main language.stg
- */
-group LeftRecursiveRules;
-
-recRuleName(ruleName) ::= "<ruleName>_"
-recPrimaryName(ruleName) ::= "<ruleName>_primary"
-
-recRuleStart(ruleName, minPrec, userRetvals, userRetvalAssignments) ::= <<
-<ruleName><if(userRetvals)> returns [<userRetvals>]<endif>
-  : <recRuleName(...)>[<minPrec>]
-    <if(userRetvals)>
-    {
-        <userRetvalAssignments; separator="\n">
-    }
-    <endif>
-  ;
->>
-
-recRule(ruleName, precArgDef, argName, alts, setResultAction, buildAST,
-        userRetvals, userRetvalAssignments) ::= <<
-<recRuleName(...)>[<precArgDef>]<if(userRetvals)> returns [<userRetvals>]<endif>
-    :   <recPrimaryName(...)>
-        <if(buildAST)>
-        {
-            <setResultAction>
-        }
-        <endif>
-        <if(userRetvals)>
-        {
-            <userRetvalAssignments; separator="\n">
-        }
-        <endif>
-        ( options {backtrack=false;}
-        : ( options {backtrack=false;}
-          : <alts; separator="\n          | ">
-          )
-        )*
-    ;
->>
-
-recPrimaryRule(ruleName, alts, userRetvals) ::= <<
-<recPrimaryName(...)><if(userRetvals)> returns [<userRetvals>]<endif>
-options {backtrack=true;}
-    : <alts; separator="\n    | ">
-    ;
->>
-
-recRuleAlt(alt, pred) ::= "{<pred>}?=> <alt>"
-
-recRuleRef(ruleName, arg) ::= "<recRuleName(...)>[<arg>]"
-
diff --git a/Tools/Antlr/LICENSE.txt b/Tools/Antlr/LICENSE.txt
deleted file mode 100644
index f63a0697f9d..00000000000
--- a/Tools/Antlr/LICENSE.txt
+++ /dev/null
@@ -1,27 +0,0 @@
-[The "BSD license"]
-Copyright (c) 2011 Terence Parr
-C# Port (c) 2011 Sam Harwell, Tunnel Vision Laboratories, LLC
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions
-are met:
-
- 1. Redistributions of source code must retain the above copyright
-    notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above copyright
-    notice, this list of conditions and the following disclaimer in the
-    documentation and/or other materials provided with the distribution.
- 3. The name of the author may not be used to endorse or promote products
-    derived from this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
-IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
-OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
-IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
-INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
-NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
-THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/Tools/Antlr/Targets/Antlr3.Targets.CSharp2.dll b/Tools/Antlr/Targets/Antlr3.Targets.CSharp2.dll
deleted file mode 100644
index d6bf6dc2d9b..00000000000
Binary files a/Tools/Antlr/Targets/Antlr3.Targets.CSharp2.dll and /dev/null differ
diff --git a/Tools/Antlr/Targets/Antlr3.Targets.CSharp3.dll b/Tools/Antlr/Targets/Antlr3.Targets.CSharp3.dll
deleted file mode 100644
index e49215b1864..00000000000
Binary files a/Tools/Antlr/Targets/Antlr3.Targets.CSharp3.dll and /dev/null differ
diff --git a/Tools/Antlr/Tool/Templates/depend.stg b/Tools/Antlr/Tool/Templates/depend.stg
deleted file mode 100644
index c093054ebaa..00000000000
--- a/Tools/Antlr/Tool/Templates/depend.stg
+++ /dev/null
@@ -1,12 +0,0 @@
-/** templates used to generate make-compatible dependencies */
-group depend;
-
-/** Generate "f : x, y, z" dependencies for input
- *  dependencies and generated files. in and out
- *  are File objects.  For example, you can say
- *  <f.canonicalPath>
- */
-dependencies(grammarFileName,in,out) ::= <<
-<if(in)><grammarFileName>: <in; separator=", "><endif>
-<out:{f | <f> : <grammarFileName>}; separator="\n">
->>
diff --git a/Tools/Antlr/Tool/Templates/dot/dot.stg b/Tools/Antlr/Tool/Templates/dot/dot.stg
deleted file mode 100644
index efcac2ce30e..00000000000
--- a/Tools/Antlr/Tool/Templates/dot/dot.stg
+++ /dev/null
@@ -1,73 +0,0 @@
-/*
- * [The "BSD license"]
- * Copyright (c) 2011 Terence Parr
- * All rights reserved.
- *
- * Conversion to C#:
- * Copyright (c) 2011 Sam Harwell, Tunnel Vision Laboratories, LLC.
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- *    notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- *    notice, this list of conditions and the following disclaimer in the
- *    documentation and/or other materials provided with the distribution.
- * 3. The name of the author may not be used to endorse or promote products
- *    derived from this software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
- */
-
-dfa(decisionRanks,states,edges,rankdir,startState,useBox) ::= <<
-digraph NFA {
-<if(rankdir)>rankdir=<rankdir>;<endif>
-<decisionRanks; separator="\n">
-<states; separator="\n">
-<edges; separator="\n">
-}
->>
-
-nfa(decisionRanks,states,edges,rankdir,startState) ::= <<
-digraph NFA {
-rankdir=LR;
-<decisionRanks; separator="\n">
-<states; separator="\n">
-<edges; separator="\n">
-}
->>
-
-decision-rank(states) ::= <<
-{rank=same; rankdir=TB; <states; separator="; ">}
->>
-
-edge(src,target,label,arrowhead) ::= <<
-<src> -> <target> [fontsize=11, fontname="Courier", arrowsize=.7, label = "<label>"<if(arrowhead)>, arrowhead = <arrowhead><endif>];
->>
-
-action-edge(src,target,label,arrowhead) ::= <<
-<src> -> <target> [fontsize=11, fontname="Courier", arrowsize=.7, label = "<label>"<if(arrowhead)>, arrowhead = <arrowhead><endif>];
->>
-
-epsilon-edge(src,target,label,arrowhead) ::= <<
-<src> -> <target> [fontname="Times-Italic", label = "e"];
->>
-
-state(name,useBox) ::= <<
-node [fontsize=11, shape = <if(useBox)>box<else>circle, fixedsize=true, width=.4<endif>]; <name>
->>
-
-stopstate(name,useBox) ::= <<
-node [fontsize=11, shape = <if(useBox)>polygon,sides=4,peripheries=2<else>doublecircle, fixedsize=true, width=.6<endif>]; <name>
->>
diff --git a/Tools/Antlr/Tool/Templates/messages/formats/antlr.stg b/Tools/Antlr/Tool/Templates/messages/formats/antlr.stg
deleted file mode 100644
index 9fb46123f49..00000000000
--- a/Tools/Antlr/Tool/Templates/messages/formats/antlr.stg
+++ /dev/null
@@ -1,42 +0,0 @@
-/*
- [The "BSD license"]
- Copyright (c) 2006 Kay Roepke
- All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions
- are met:
- 1. Redistributions of source code must retain the above copyright
-    notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above copyright
-    notice, this list of conditions and the following disclaimer in the
-    documentation and/or other materials provided with the distribution.
- 3. The name of the author may not be used to endorse or promote products
-    derived from this software without specific prior written permission.
-
- THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-*/
-/*
- New style messages. This file contains the actual layout of the messages emitted by ANTLR.
- The text itself is coming out of the languages/*stg files, according to the chosen locale.
- This file contains the default format ANTLR uses.
-*/
-
-group antlr;
-
-location(file, line, column) ::= "<file>:<line>:<column>:"
-
-message(id, text) ::= "(<id>) <text>"
-
-report(location, message, type) ::= "<type>(<message.id>): <location> <message.text>"
-
-wantsSingleLineMessage() ::= "false"
\ No newline at end of file
diff --git a/Tools/Antlr/Tool/Templates/messages/formats/vs2005.stg b/Tools/Antlr/Tool/Templates/messages/formats/vs2005.stg
deleted file mode 100644
index 0c94e482f72..00000000000
--- a/Tools/Antlr/Tool/Templates/messages/formats/vs2005.stg
+++ /dev/null
@@ -1,42 +0,0 @@
-/*
- [The "BSD license"]
- Copyright (c) 2006 Kay Roepke
- All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions
- are met:
- 1. Redistributions of source code must retain the above copyright
-    notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above copyright
-    notice, this list of conditions and the following disclaimer in the
-    documentation and/or other materials provided with the distribution.
- 3. The name of the author may not be used to endorse or promote products
-    derived from this software without specific prior written permission.
-
- THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-*/
-/*
- New style messages. This file contains the actual layout of the messages emitted by ANTLR.
- The text itself is coming out of the languages/*stg files, according to the chosen locale.
- This file contains the default format ANTLR uses.
-*/
-
-group antlr;
-
-location(file, line, column) ::= "<file>(<line>,<column>)"
-
-message(id, text) ::= "error <id> : <text>"
-
-report(location, message, type) ::= "<location> : <type> <message.id> : <message.text>"
-
-wantsSingleLineMessage() ::= "true"
diff --git a/Tools/Antlr/Tool/Templates/messages/languages/en.stg b/Tools/Antlr/Tool/Templates/messages/languages/en.stg
deleted file mode 100644
index b5e42d57e52..00000000000
--- a/Tools/Antlr/Tool/Templates/messages/languages/en.stg
+++ /dev/null
@@ -1,300 +0,0 @@
-/*
- [The "BSD license"]
- Copyright (c) 2010 Terence Parr
- All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions
- are met:
- 1. Redistributions of source code must retain the above copyright
-    notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above copyright
-    notice, this list of conditions and the following disclaimer in the
-    documentation and/or other materials provided with the distribution.
- 3. The name of the author may not be used to endorse or promote products
-    derived from this software without specific prior written permission.
-
- THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
- IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
- IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
- INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
- NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-*/
-/*
- New style messages. This file only contains the messages in English, but no
- information about which file, line, or column it occurred in.
- The location and message ids are taken out of the formats directory.
-														Kay Roepke
-*/
-group en_US;
-
-// TOOL ERRORS
-// file errors
-CANNOT_WRITE_FILE(arg,exception,stackTrace) ::= <<
-cannot write file <arg>: <exception>
-<stackTrace; separator="\n">
->>
-CANNOT_CLOSE_FILE(arg,exception,stackTrace) ::= "cannot close file <arg>: <exception>"
-CANNOT_FIND_TOKENS_FILE(arg) ::= "cannot find tokens file <arg>"
-ERROR_READING_TOKENS_FILE(arg,exception,stackTrace) ::= <<
-problem reading token vocabulary file <arg>: <exception>
-<stackTrace; separator="\n">
->>
-DIR_NOT_FOUND(arg,exception,stackTrace) ::= "directory not found: <arg>"
-OUTPUT_DIR_IS_FILE(arg,exception,stackTrace) ::= "output directory is a file: <arg>"
-CANNOT_OPEN_FILE(arg,exception,stackTrace) ::= "cannot find or open file: <arg><if(exception)>; reason: <exception><endif>"
-CIRCULAR_DEPENDENCY() ::= "your grammars contain a circular dependency and cannot be sorted into a valid build order."
-
-INTERNAL_ERROR(arg,arg2,exception,stackTrace) ::= <<
-internal error: <arg> <arg2><if(exception)>: <exception><endif>
-<stackTrace; separator="\n">
->>
-INTERNAL_WARNING(arg) ::= "internal warning: <arg>"
-ERROR_CREATING_ARTIFICIAL_RULE(arg,exception,stackTrace) ::= <<
-problems creating lexer rule listing all tokens: <exception>
-<stackTrace; separator="\n">
->>
-TOKENS_FILE_SYNTAX_ERROR(arg,arg2) ::=
-	"problems parsing token vocabulary file <arg> on line <arg2>"
-CANNOT_GEN_DOT_FILE(arg,exception,stackTrace) ::=
-	"cannot write DFA DOT file <arg>: <exception>"
-BAD_ACTION_AST_STRUCTURE(exception,stackTrace) ::=
-	"bad internal tree structure for action '<arg>': <exception>"
-BAD_AST_STRUCTURE(arg,exception,stackTrace) ::= <<
-bad internal tree structure '<arg>': <exception>
-<stackTrace; separator="\n">
->>
-FILE_AND_GRAMMAR_NAME_DIFFER(arg,arg2) ::=
-  "file <arg2> contains grammar <arg>; names must be identical"
-FILENAME_EXTENSION_ERROR(arg) ::=
-  "file <arg> must end in a file extension, normally .g"
-
-// code gen errors
-MISSING_CODE_GEN_TEMPLATES(arg) ::=
-	"cannot find code generation templates <arg>.stg"
-MISSING_CYCLIC_DFA_CODE_GEN_TEMPLATES() ::=
-	"cannot find code generation cyclic DFA templates for language <arg>"
-CODE_GEN_TEMPLATES_INCOMPLETE(arg) ::=
-	"at least one code generation template missing for language <arg>"
-CANNOT_CREATE_TARGET_GENERATOR(arg,exception,stackTrace) ::=
-	"cannot create target <arg> code generator: <exception>"
-STRING_TEMPLATE_ERROR(arg,exception,stackTrace) ::=
-	"template error: <arg>"
-CANNOT_COMPUTE_SAMPLE_INPUT_SEQ() ::=
-	"cannot generate a sample input sequence from lookahead DFA"
-
-// grammar interpretation errors
-/*
-NO_VIABLE_DFA_ALT(arg,arg2) ::=
-	"no viable transition from state <arg> on <arg2> while interpreting DFA"
-*/
-
-// GRAMMAR ERRORS
-SYNTAX_ERROR(arg) ::= "syntax error: <arg>"
-RULE_REDEFINITION(arg) ::=
-	"rule <arg> redefinition"
-LEXER_RULES_NOT_ALLOWED(arg) ::=
-	"lexer rule <arg> not allowed in parser"
-PARSER_RULES_NOT_ALLOWED(arg) ::=
-	"parser rule <arg> not allowed in lexer"
-CANNOT_FIND_ATTRIBUTE_NAME_IN_DECL(arg) ::=
-	"cannot find an attribute name in attribute declaration"
-NO_TOKEN_DEFINITION(arg) ::=
-	"no lexer rule corresponding to token: <arg>"
-UNDEFINED_RULE_REF(arg) ::=
-	"reference to undefined rule: <arg>"
-LITERAL_NOT_ASSOCIATED_WITH_LEXER_RULE(arg) ::=
-	"literal has no associated lexer rule: <arg>"
-CANNOT_ALIAS_TOKENS_IN_LEXER(arg) ::=
-	"literals are illegal in lexer tokens{} section: <arg>"
-ATTRIBUTE_REF_NOT_IN_RULE(arg,arg2) ::=
-	"reference to attribute outside of a rule: <arg><if(arg2)>.<arg2><endif>"
-UNKNOWN_ATTRIBUTE_IN_SCOPE(arg,arg2) ::=
-	"unknown attribute for <arg>: <arg2>"
-UNKNOWN_RULE_ATTRIBUTE(arg,arg2) ::=
-	"unknown attribute for rule <arg>: <arg2>"
-UNKNOWN_SIMPLE_ATTRIBUTE(arg,args2) ::=
-	"attribute is not a token, parameter, or return value: <arg>"
-ISOLATED_RULE_SCOPE(arg) ::=
-	"missing attribute access on rule scope: <arg>"
-INVALID_RULE_PARAMETER_REF(arg,arg2) ::=
-	"cannot access rule <arg>'s parameter: <arg2>"
-INVALID_RULE_SCOPE_ATTRIBUTE_REF(arg,arg2) ::=
-	"cannot access rule <arg>'s dynamically-scoped attribute: <arg2>"
-SYMBOL_CONFLICTS_WITH_GLOBAL_SCOPE(arg) ::=
-	"symbol <arg> conflicts with global dynamic scope with same name"
-WRITE_TO_READONLY_ATTR(arg,arg2,arg3) ::=
-	"cannot write to read only attribute: $<arg><if(arg2)>.<arg2><endif>"
-LABEL_CONFLICTS_WITH_RULE(arg) ::=
-	"label <arg> conflicts with rule with same name"
-LABEL_CONFLICTS_WITH_TOKEN(arg) ::=
-	"label <arg> conflicts with token with same name"
-LABEL_CONFLICTS_WITH_RULE_SCOPE_ATTRIBUTE(arg,arg2) ::=
-	"label <arg> conflicts with rule <arg2>'s dynamically-scoped attribute with same name"
-LABEL_CONFLICTS_WITH_RULE_ARG_RETVAL(arg,arg2) ::=
-	"label <arg> conflicts with rule <arg2>'s return value or parameter with same name"
-ATTRIBUTE_CONFLICTS_WITH_RULE(arg,arg2) ::=
-	"rule <arg2>'s dynamically-scoped attribute <arg> conflicts with the rule name"
-ATTRIBUTE_CONFLICTS_WITH_RULE_ARG_RETVAL(arg,arg2) ::=
-	"rule <arg2>'s dynamically-scoped attribute <arg> conflicts with<arg2>'s return value or parameter with same name"
-LABEL_TYPE_CONFLICT(arg,arg2) ::=
-	"label <arg> type mismatch with previous definition: <arg2>"
-ARG_RETVAL_CONFLICT(arg,arg2) ::=
-	"rule <arg2>'s argument <arg> conflicts a return value with same name"
-NONUNIQUE_REF(arg) ::=
-	"<arg> is a non-unique reference"
-FORWARD_ELEMENT_REF(arg) ::=
-	"illegal forward reference: <arg>"
-MISSING_RULE_ARGS(arg) ::=
-	"missing parameter(s) on rule reference: <arg>"
-RULE_HAS_NO_ARGS(arg) ::=
-	"rule <arg> has no defined parameters"
-ARGS_ON_TOKEN_REF(arg) ::=
-	"token reference <arg> may not have parameters"
-ILLEGAL_OPTION(arg) ::=
-	"illegal option <arg>"
-LIST_LABEL_INVALID_UNLESS_RETVAL_STRUCT(arg) ::=
-	"rule '+=' list labels are not allowed w/o output option: <arg>"
-UNDEFINED_TOKEN_REF_IN_REWRITE(arg) ::=
-  "reference to undefined token in rewrite rule: <arg>"
-REWRITE_ELEMENT_NOT_PRESENT_ON_LHS(arg) ::=
-  "reference to rewrite element <arg> without reference on left of ->"
-UNDEFINED_LABEL_REF_IN_REWRITE(arg) ::=
-  "reference to undefined label in rewrite rule: $<arg>"
-NO_GRAMMAR_START_RULE (arg) ::=
-  "grammar <arg>: no start rule (no rule can obviously be followed by EOF)"
-EMPTY_COMPLEMENT(arg) ::= <<
-<if(arg)>
-set complement ~<arg> is empty
-<else>
-set complement is empty
-<endif>
->>
-UNKNOWN_DYNAMIC_SCOPE(arg) ::=
-  "unknown dynamic scope: <arg>"
-UNKNOWN_DYNAMIC_SCOPE_ATTRIBUTE(arg,arg2) ::=
-  "unknown dynamically-scoped attribute for scope <arg>: <arg2>"
-RULE_REF_AMBIG_WITH_RULE_IN_ALT(arg) ::=
-  "reference $<arg> is ambiguous; rule <arg> is enclosing rule and referenced in the production (assuming enclosing rule)"
-ISOLATED_RULE_ATTRIBUTE(arg) ::=
-  "reference to locally-defined rule scope attribute without rule name: <arg>"
-INVALID_ACTION_SCOPE(arg,arg2) ::=
-  "unknown or invalid action scope for <arg2> grammar: <arg>"
-ACTION_REDEFINITION(arg) ::=
-  "redefinition of <arg> action"
-DOUBLE_QUOTES_ILLEGAL(arg) ::=
-  "string literals must use single quotes (such as \'begin\'): <arg>"
-INVALID_TEMPLATE_ACTION(arg) ::=
-  "invalid StringTemplate % shorthand syntax: '<arg>'"
-MISSING_ATTRIBUTE_NAME() ::=
-  "missing attribute name on $ reference"
-ARG_INIT_VALUES_ILLEGAL(arg) ::=
-  "rule parameters may not have init values: <arg>"
-REWRITE_OR_OP_WITH_NO_OUTPUT_OPTION(arg) ::=
-  "<if(arg)>rule <arg> uses <endif>rewrite syntax or operator with no output option; setting output=AST"
-AST_OP_WITH_NON_AST_OUTPUT_OPTION(arg) ::=
-  "AST operator with non-AST output option: <arg>"
-NO_RULES(arg) ::= "grammar file <arg> has no rules"
-MISSING_AST_TYPE_IN_TREE_GRAMMAR(arg) ::=
-  "tree grammar <arg> has no ASTLabelType option"
-REWRITE_FOR_MULTI_ELEMENT_ALT(arg) ::=
-  "with rewrite=true, alt <arg> not simple node or obvious tree element; text attribute for rule not guaranteed to be correct"
-RULE_INVALID_SET(arg) ::=
-  "Cannot complement rule <arg>; not a simple set or element"
-HETERO_ILLEGAL_IN_REWRITE_ALT(arg) ::=
-  "alts with rewrites can't use heterogeneous types left of ->"
-NO_SUCH_GRAMMAR_SCOPE(arg,arg2) ::=
-  "reference to undefined grammar in rule reference: <arg>.<arg2>"
-NO_SUCH_RULE_IN_SCOPE(arg,arg2) ::=
-  "rule <arg2> is not defined in grammar <arg>"
-TOKEN_ALIAS_CONFLICT(arg,arg2) ::=
-  "cannot alias <arg>; string already assigned to <arg2>"
-TOKEN_ALIAS_REASSIGNMENT(arg,arg2) ::=
-  "cannot alias <arg>; token name already assigned to <arg2>"
-TOKEN_VOCAB_IN_DELEGATE(arg,arg2) ::=
-  "tokenVocab option ignored in imported grammar <arg>"
-INVALID_IMPORT(arg,arg2) ::=
-  "<arg.grammarTypeString> grammar <arg.name> cannot import <arg2.grammarTypeString> grammar <arg2.name>"
-IMPORTED_TOKENS_RULE_EMPTY(arg,arg2) ::=
-  "no lexer rules contributed to <arg> from imported grammar <arg2>"
-IMPORT_NAME_CLASH(arg,arg2) ::=
-  "combined grammar <arg.name> and imported <arg2.grammarTypeString> grammar <arg2.name> both generate <arg2.recognizerName>; import ignored"
-AST_OP_IN_ALT_WITH_REWRITE(arg,arg2) ::=
-  "rule <arg> alt <arg2> uses rewrite syntax and also an AST operator"
-WILDCARD_AS_ROOT(arg) ::= "Wildcard invalid as root; wildcard can itself be a tree"
-CONFLICTING_OPTION_IN_TREE_FILTER(arg,arg2) ::= "option <arg>=<arg2> conflicts with tree grammar filter mode"
-ILLEGAL_OPTION_VALUE(arg, arg2) ::= "value '<arg2>' invalid for option <arg>"
-ALL_OPS_NEED_SAME_ASSOC(arg) ::= "all operators of alt <alt> of left-recursive rule must have same associativity"
-RANGE_OP_ILLEGAL(arg) ::= "the .. range operator isn't allowed in parser rules"
-
-// GRAMMAR WARNINGS
-
-GRAMMAR_NONDETERMINISM(input,conflictingAlts,paths,disabled,hasPredicateBlockedByAction) ::=
-<<
-<if(paths)>
-Decision can match input such as "<input>" using multiple alternatives:
-<paths:{ it |  alt <it.alt> via NFA path <it.states; separator=","><\n>}>
-<else>
-Decision can match input such as "<input>" using multiple alternatives: <conflictingAlts; separator=", ">
-<endif>
-<if(disabled)><\n>As a result, alternative(s) <disabled; separator=","> were disabled for that input<endif><if(hasPredicateBlockedByAction)><\n>Semantic predicates were present but were hidden by actions.<endif>
->>
-
-DANGLING_STATE(danglingAlts,input) ::= <<
-the decision cannot distinguish between alternative(s) <danglingAlts; separator=","> for input such as "<input>"
->>
-
-UNREACHABLE_ALTS(alts) ::= <<
-The following alternatives can never be matched: <alts; separator=","><\n>
->>
-
-INSUFFICIENT_PREDICATES(upon,altToLocations,hasPredicateBlockedByAction) ::= <<
-Input such as "<upon>" is insufficiently covered with predicates at locations: <altToLocations.keys:{alt|alt <alt>: <altToLocations.(alt):{loc| line <loc.line>:<loc.column> at <loc.text>}; separator=", ">}; separator=", "><if(hasPredicateBlockedByAction)><\n>Semantic predicates were present but were hidden by actions.<endif>
->>
-
-DUPLICATE_SET_ENTRY(arg) ::=
-	"duplicate token type <arg> when collapsing subrule into set"
-
-ANALYSIS_ABORTED(enclosingRule) ::= <<
-ANTLR could not analyze this decision in rule <enclosingRule>; often this is because of recursive rule references visible from the left edge of alternatives.  ANTLR will re-analyze the decision with a fixed lookahead of k=1.  Consider using "options {k=1;}" for that decision and possibly adding a syntactic predicate.
->>
-
-RECURSION_OVERLOW(alt,input,targetRules,callSiteStates) ::= <<
-Alternative <alt>: after matching input such as <input> decision cannot predict what comes next due to recursion overflow <targetRules,callSiteStates:{t,c|to <t> from <c:{s|<s.enclosingRule.name>};separator=", ">}; separator=" and ">
->>
-
-LEFT_RECURSION(targetRules,alt,callSiteStates) ::= <<
-Alternative <alt> discovers infinite left-recursion <targetRules,callSiteStates:{t,c|to <t> from <c:{s|<s.enclosingRule>};separator=", ">}; separator=" and ">
->>
-
-UNREACHABLE_TOKENS(tokens) ::= <<
-The following token definitions can never be matched because prior tokens match the same input: <tokens; separator=",">
->>
-
-TOKEN_NONDETERMINISM(input,conflictingTokens,paths,disabled,hasPredicateBlockedByAction) ::=
-<<
-<if(paths)>
-Decision can match input such as "<input>" using multiple alternatives:
-<paths:{ it | alt <it.alt> via NFA path <it.states; separator=","><\n>}>
-<else>
-Multiple token rules can match input such as "<input>": <conflictingTokens; separator=", "><\n>
-<endif>
-<if(disabled)><\n>As a result, token(s) <disabled; separator=","> were disabled for that input<endif><if(hasPredicateBlockedByAction)><\n>Semantic predicates were present but were hidden by actions.<endif>
->>
-
-LEFT_RECURSION_CYCLES(listOfCycles) ::= <<
-The following sets of rules are mutually left-recursive <listOfCycles:{c| [<c:{r|<r.name>}; separator=", ">]}; separator=" and ">
->>
-
-NONREGULAR_DECISION(ruleName,alts) ::= <<
-[fatal] rule <ruleName> has non-LL(*) decision due to recursive rule invocations reachable from alts <alts; separator=",">.  Resolve by left-factoring or using syntactic predicates or using backtrack=true option.
->>
-
-/* l10n for message levels */
-warning() ::= "warning"
-error() ::= "error"
diff --git a/src/NHibernate.Test/CollectionFilterTest/CollectionFilterQueriesTest.cs b/src/NHibernate.Test/CollectionFilterTest/CollectionFilterQueriesTest.cs
index a6f5573ccfb..f74ad5fbefa 100644
--- a/src/NHibernate.Test/CollectionFilterTest/CollectionFilterQueriesTest.cs
+++ b/src/NHibernate.Test/CollectionFilterTest/CollectionFilterQueriesTest.cs
@@ -1,8 +1,5 @@
 using System;
 using System.Collections.Generic;
-using System.Linq;
-using System.Text;
-using Antlr.Runtime;
 using NHibernate.Hql.Ast.ANTLR;
 using NUnit.Framework;
 using System.Collections;
diff --git a/src/NHibernate.Test/NHibernate.Test.csproj b/src/NHibernate.Test/NHibernate.Test.csproj
index fe5dc1a8b12..9c8bd6d397d 100644
--- a/src/NHibernate.Test/NHibernate.Test.csproj
+++ b/src/NHibernate.Test/NHibernate.Test.csproj
@@ -67,8 +67,8 @@
     <Prefer32Bit>false</Prefer32Bit>
   </PropertyGroup>
   <ItemGroup>
-    <Reference Include="Antlr3.Runtime, Version=3.5.0.2, Culture=neutral, PublicKeyToken=eb42632606e9261f, processorArchitecture=MSIL">
-      <HintPath>..\packages\Antlr.3.5.0.2\lib\Antlr3.Runtime.dll</HintPath>
+    <Reference Include="Antlr3.Runtime, Version=3.5.0.2, Culture=neutral, PublicKeyToken=eb42632606e9261f, processorArchitecture=MSIL" Condition=" '$(Configuration)' == 'Debug' ">
+      <HintPath>..\packages\Antlr3.Runtime.3.5.1\lib\net40-client\Antlr3.Runtime.dll</HintPath>
       <Private>True</Private>
     </Reference>
     <Reference Include="Iesi.Collections, Version=4.0.0.0, Culture=neutral, PublicKeyToken=aa95f207798dfdb4, processorArchitecture=MSIL">
diff --git a/src/NHibernate.Test/packages.config b/src/NHibernate.Test/packages.config
index 9966f2b2d76..4c41501a08e 100644
--- a/src/NHibernate.Test/packages.config
+++ b/src/NHibernate.Test/packages.config
@@ -1,6 +1,6 @@
 <?xml version="1.0" encoding="utf-8"?>
 <packages>
-  <package id="Antlr" version="3.5.0.2" targetFramework="net461" />
+  <package id="Antlr3.Runtime" version="3.5.1" targetFramework="net461" />
   <package id="Iesi.Collections" version="4.0.1.4000" targetFramework="net461" />
   <package id="log4net" version="2.0.7" targetFramework="net461" />
   <package id="NUnit" version="3.6.0" targetFramework="net461" />
diff --git a/src/NHibernate/Hql/Ast/ANTLR/AntlrHql.bat b/src/NHibernate/Hql/Ast/ANTLR/AntlrHql.bat
deleted file mode 100644
index 51da0e4a7f0..00000000000
--- a/src/NHibernate/Hql/Ast/ANTLR/AntlrHql.bat
+++ /dev/null
@@ -1,5 +0,0 @@
-@echo off
-rem I wanted to put this in the nant build file, but I had very annoying problems with 64-bit java running from the 32-bit nant process.
-pushd %~dp0
-..\..\..\..\..\Tools\Antlr\Antlr3.exe -o Generated Hql.g
-popd
\ No newline at end of file
diff --git a/src/NHibernate/Hql/Ast/ANTLR/AntlrHqlDebug.bat b/src/NHibernate/Hql/Ast/ANTLR/AntlrHqlDebug.bat
deleted file mode 100644
index d8d5b6c2403..00000000000
--- a/src/NHibernate/Hql/Ast/ANTLR/AntlrHqlDebug.bat
+++ /dev/null
@@ -1,5 +0,0 @@
-@echo off
-rem I wanted to put this in the nant build file, but I had very annoying problems with 64-bit java running from the 32-bit nant process.
-pushd %~dp0
-..\..\..\..\..\Tools\Antlr\Antlr3.exe -debug -o Generated Hql.g
-popd
\ No newline at end of file
diff --git a/src/NHibernate/Hql/Ast/ANTLR/AntlrHqlSqlWalker.bat b/src/NHibernate/Hql/Ast/ANTLR/AntlrHqlSqlWalker.bat
deleted file mode 100644
index 9f5a0432324..00000000000
--- a/src/NHibernate/Hql/Ast/ANTLR/AntlrHqlSqlWalker.bat
+++ /dev/null
@@ -1,5 +0,0 @@
-@echo off
-rem I wanted to put this in the nant build file, but I had very annoying problems with 64-bit java running from the 32-bit nant process.
-pushd %~dp0
-..\..\..\..\..\Tools\Antlr\Antlr3.exe -o Generated HqlSqlWalker.g
-popd
\ No newline at end of file
diff --git a/src/NHibernate/Hql/Ast/ANTLR/AntlrHqlSqlWalkerDebug.bat b/src/NHibernate/Hql/Ast/ANTLR/AntlrHqlSqlWalkerDebug.bat
deleted file mode 100644
index 4c04f3f5acf..00000000000
--- a/src/NHibernate/Hql/Ast/ANTLR/AntlrHqlSqlWalkerDebug.bat
+++ /dev/null
@@ -1,5 +0,0 @@
-@echo off
-rem I wanted to put this in the nant build file, but I had very annoying problems with 64-bit java running from the 32-bit nant process.
-pushd %~dp0
-..\..\..\..\..\Tools\Antlr\Antlr3.exe -debug -o Generated HqlSqlWalker.g
-popd
\ No newline at end of file
diff --git a/src/NHibernate/Hql/Ast/ANTLR/AntlrSqlGenerator.bat b/src/NHibernate/Hql/Ast/ANTLR/AntlrSqlGenerator.bat
deleted file mode 100644
index 0fcd5997578..00000000000
--- a/src/NHibernate/Hql/Ast/ANTLR/AntlrSqlGenerator.bat
+++ /dev/null
@@ -1,5 +0,0 @@
-@echo off
-rem I wanted to put this in the nant build file, but I had very annoying problems with 64-bit java running from the 32-bit nant process.
-pushd %~dp0
-..\..\..\..\..\Tools\Antlr\Antlr3.exe -o Generated SqlGenerator.g
-popd
\ No newline at end of file
diff --git a/src/NHibernate/Hql/Ast/ANTLR/AntlrSqlGeneratorDebug.bat b/src/NHibernate/Hql/Ast/ANTLR/AntlrSqlGeneratorDebug.bat
deleted file mode 100644
index 00aef526c31..00000000000
--- a/src/NHibernate/Hql/Ast/ANTLR/AntlrSqlGeneratorDebug.bat
+++ /dev/null
@@ -1,5 +0,0 @@
-@echo off
-rem I wanted to put this in the nant build file, but I had very annoying problems with 64-bit java running from the 32-bit nant process.
-pushd %~dp0
-..\..\..\..\..\Tools\Antlr\Antlr3.exe -debug -o Generated SqlGenerator.g
-popd
\ No newline at end of file
diff --git a/src/NHibernate/Hql/Ast/ANTLR/Generated/HqlLexer.cs b/src/NHibernate/Hql/Ast/ANTLR/Generated/HqlLexer.cs
deleted file mode 100644
index 33641fcaa9f..00000000000
--- a/src/NHibernate/Hql/Ast/ANTLR/Generated/HqlLexer.cs
+++ /dev/null
@@ -1,6450 +0,0 @@
-//------------------------------------------------------------------------------
-// <auto-generated>
-//     This code was generated by a tool.
-//     ANTLR Version: 3.5.0.2
-//
-//     Changes to this file may cause incorrect behavior and will be lost if
-//     the code is regenerated.
-// </auto-generated>
-//------------------------------------------------------------------------------
-
-// $ANTLR 3.5.0.2 Hql.g 2015-05-03 23:15:27
-
-// The variable 'variable' is assigned but its value is never used.
-#pragma warning disable 219
-// Unreachable code detected.
-#pragma warning disable 162
-// Missing XML comment for publicly visible type or member 'Type_or_Member'
-#pragma warning disable 1591
-// CLS compliance checking will not be performed on 'type' because it is not visible from outside this assembly.
-#pragma warning disable 3019
-
-
-using System.Collections.Generic;
-using Antlr.Runtime;
-using Antlr.Runtime.Misc;
-
-namespace  NHibernate.Hql.Ast.ANTLR 
-{
-[System.CodeDom.Compiler.GeneratedCode("ANTLR", "3.5.0.2")]
-[System.CLSCompliant(false)]
-public partial class HqlLexer : Antlr.Runtime.Lexer
-{
-	public const int EOF=-1;
-	public const int AGGREGATE=4;
-	public const int ALIAS=5;
-	public const int ALL=6;
-	public const int AND=7;
-	public const int ANY=8;
-	public const int AS=9;
-	public const int ASCENDING=10;
-	public const int AVG=11;
-	public const int BAND=12;
-	public const int BETWEEN=13;
-	public const int BNOT=14;
-	public const int BOR=15;
-	public const int BOTH=16;
-	public const int BXOR=17;
-	public const int CASE=18;
-	public const int CASE2=19;
-	public const int CLASS=20;
-	public const int CLOSE=21;
-	public const int CLOSE_BRACKET=22;
-	public const int COLON=23;
-	public const int COMMA=24;
-	public const int CONCAT=25;
-	public const int CONSTANT=26;
-	public const int CONSTRUCTOR=27;
-	public const int COUNT=28;
-	public const int DELETE=29;
-	public const int DESCENDING=30;
-	public const int DISTINCT=31;
-	public const int DIV=32;
-	public const int DOT=33;
-	public const int ELEMENTS=34;
-	public const int ELSE=35;
-	public const int EMPTY=36;
-	public const int END=37;
-	public const int EQ=38;
-	public const int ESCAPE=39;
-	public const int ESCqs=40;
-	public const int EXISTS=41;
-	public const int EXPONENT=42;
-	public const int EXPR_LIST=43;
-	public const int FALSE=44;
-	public const int FETCH=45;
-	public const int FILTER_ENTITY=46;
-	public const int FLOAT_SUFFIX=47;
-	public const int FROM=48;
-	public const int FULL=49;
-	public const int GE=50;
-	public const int GROUP=51;
-	public const int GT=52;
-	public const int HAVING=53;
-	public const int HEX_DIGIT=54;
-	public const int IDENT=55;
-	public const int ID_LETTER=56;
-	public const int ID_START_LETTER=57;
-	public const int IN=58;
-	public const int INDEX_OP=59;
-	public const int INDICES=60;
-	public const int INNER=61;
-	public const int INSERT=62;
-	public const int INTO=63;
-	public const int IN_LIST=64;
-	public const int IS=65;
-	public const int IS_NOT_NULL=66;
-	public const int IS_NULL=67;
-	public const int JAVA_CONSTANT=68;
-	public const int JOIN=69;
-	public const int LE=70;
-	public const int LEADING=71;
-	public const int LEFT=72;
-	public const int LIKE=73;
-	public const int LITERAL_by=74;
-	public const int LT=75;
-	public const int MAX=76;
-	public const int MEMBER=77;
-	public const int METHOD_CALL=78;
-	public const int MIN=79;
-	public const int MINUS=80;
-	public const int NE=81;
-	public const int NEW=82;
-	public const int NOT=83;
-	public const int NOT_BETWEEN=84;
-	public const int NOT_IN=85;
-	public const int NOT_LIKE=86;
-	public const int NULL=87;
-	public const int NUM_DECIMAL=88;
-	public const int NUM_DOUBLE=89;
-	public const int NUM_FLOAT=90;
-	public const int NUM_INT=91;
-	public const int NUM_LONG=92;
-	public const int OBJECT=93;
-	public const int OF=94;
-	public const int ON=95;
-	public const int OPEN=96;
-	public const int OPEN_BRACKET=97;
-	public const int OR=98;
-	public const int ORDER=99;
-	public const int ORDER_ELEMENT=100;
-	public const int OUTER=101;
-	public const int PARAM=102;
-	public const int PLUS=103;
-	public const int PROPERTIES=104;
-	public const int QUERY=105;
-	public const int QUOTED_String=106;
-	public const int RANGE=107;
-	public const int RIGHT=108;
-	public const int ROW_STAR=109;
-	public const int SELECT=110;
-	public const int SELECT_FROM=111;
-	public const int SET=112;
-	public const int SKIP=113;
-	public const int SOME=114;
-	public const int SQL_NE=115;
-	public const int STAR=116;
-	public const int SUM=117;
-	public const int TAKE=118;
-	public const int THEN=119;
-	public const int TRAILING=120;
-	public const int TRUE=121;
-	public const int UNARY_MINUS=122;
-	public const int UNARY_PLUS=123;
-	public const int UNION=124;
-	public const int UPDATE=125;
-	public const int VECTOR_EXPR=126;
-	public const int VERSIONED=127;
-	public const int WEIRD_IDENT=128;
-	public const int WHEN=129;
-	public const int WHERE=130;
-	public const int WITH=131;
-	public const int WS=132;
-	public const int T__133=133;
-	public const int T__134=134;
-
-	// delegates
-	// delegators
-
-	public HqlLexer()
-	{
-		OnCreated();
-	}
-
-	public HqlLexer(ICharStream input )
-		: this(input, new RecognizerSharedState())
-	{
-	}
-
-	public HqlLexer(ICharStream input, RecognizerSharedState state)
-		: base(input, state)
-	{
-
-		OnCreated();
-	}
-	public override string GrammarFileName { get { return "Hql.g"; } }
-
-
-	partial void OnCreated();
-	partial void EnterRule(string ruleName, int ruleIndex);
-	partial void LeaveRule(string ruleName, int ruleIndex);
-
-	partial void EnterRule_ALL();
-	partial void LeaveRule_ALL();
-
-	// $ANTLR start "ALL"
-	[GrammarRule("ALL")]
-	private void mALL()
-	{
-		EnterRule_ALL();
-		EnterRule("ALL", 1);
-		TraceIn("ALL", 1);
-		try
-		{
-			int _type = ALL;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:9:5: ( 'all' )
-			DebugEnterAlt(1);
-			// Hql.g:9:7: 'all'
-			{
-			DebugLocation(9, 7);
-			Match("all"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("ALL", 1);
-			LeaveRule("ALL", 1);
-			LeaveRule_ALL();
-		}
-	}
-	// $ANTLR end "ALL"
-
-	partial void EnterRule_AND();
-	partial void LeaveRule_AND();
-
-	// $ANTLR start "AND"
-	[GrammarRule("AND")]
-	private void mAND()
-	{
-		EnterRule_AND();
-		EnterRule("AND", 2);
-		TraceIn("AND", 2);
-		try
-		{
-			int _type = AND;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:10:5: ( 'and' )
-			DebugEnterAlt(1);
-			// Hql.g:10:7: 'and'
-			{
-			DebugLocation(10, 7);
-			Match("and"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("AND", 2);
-			LeaveRule("AND", 2);
-			LeaveRule_AND();
-		}
-	}
-	// $ANTLR end "AND"
-
-	partial void EnterRule_ANY();
-	partial void LeaveRule_ANY();
-
-	// $ANTLR start "ANY"
-	[GrammarRule("ANY")]
-	private void mANY()
-	{
-		EnterRule_ANY();
-		EnterRule("ANY", 3);
-		TraceIn("ANY", 3);
-		try
-		{
-			int _type = ANY;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:11:5: ( 'any' )
-			DebugEnterAlt(1);
-			// Hql.g:11:7: 'any'
-			{
-			DebugLocation(11, 7);
-			Match("any"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("ANY", 3);
-			LeaveRule("ANY", 3);
-			LeaveRule_ANY();
-		}
-	}
-	// $ANTLR end "ANY"
-
-	partial void EnterRule_AS();
-	partial void LeaveRule_AS();
-
-	// $ANTLR start "AS"
-	[GrammarRule("AS")]
-	private void mAS()
-	{
-		EnterRule_AS();
-		EnterRule("AS", 4);
-		TraceIn("AS", 4);
-		try
-		{
-			int _type = AS;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:12:4: ( 'as' )
-			DebugEnterAlt(1);
-			// Hql.g:12:6: 'as'
-			{
-			DebugLocation(12, 6);
-			Match("as"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("AS", 4);
-			LeaveRule("AS", 4);
-			LeaveRule_AS();
-		}
-	}
-	// $ANTLR end "AS"
-
-	partial void EnterRule_ASCENDING();
-	partial void LeaveRule_ASCENDING();
-
-	// $ANTLR start "ASCENDING"
-	[GrammarRule("ASCENDING")]
-	private void mASCENDING()
-	{
-		EnterRule_ASCENDING();
-		EnterRule("ASCENDING", 5);
-		TraceIn("ASCENDING", 5);
-		try
-		{
-			int _type = ASCENDING;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:13:11: ( 'asc' )
-			DebugEnterAlt(1);
-			// Hql.g:13:13: 'asc'
-			{
-			DebugLocation(13, 13);
-			Match("asc"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("ASCENDING", 5);
-			LeaveRule("ASCENDING", 5);
-			LeaveRule_ASCENDING();
-		}
-	}
-	// $ANTLR end "ASCENDING"
-
-	partial void EnterRule_AVG();
-	partial void LeaveRule_AVG();
-
-	// $ANTLR start "AVG"
-	[GrammarRule("AVG")]
-	private void mAVG()
-	{
-		EnterRule_AVG();
-		EnterRule("AVG", 6);
-		TraceIn("AVG", 6);
-		try
-		{
-			int _type = AVG;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:14:5: ( 'avg' )
-			DebugEnterAlt(1);
-			// Hql.g:14:7: 'avg'
-			{
-			DebugLocation(14, 7);
-			Match("avg"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("AVG", 6);
-			LeaveRule("AVG", 6);
-			LeaveRule_AVG();
-		}
-	}
-	// $ANTLR end "AVG"
-
-	partial void EnterRule_BETWEEN();
-	partial void LeaveRule_BETWEEN();
-
-	// $ANTLR start "BETWEEN"
-	[GrammarRule("BETWEEN")]
-	private void mBETWEEN()
-	{
-		EnterRule_BETWEEN();
-		EnterRule("BETWEEN", 7);
-		TraceIn("BETWEEN", 7);
-		try
-		{
-			int _type = BETWEEN;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:15:9: ( 'between' )
-			DebugEnterAlt(1);
-			// Hql.g:15:11: 'between'
-			{
-			DebugLocation(15, 11);
-			Match("between"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("BETWEEN", 7);
-			LeaveRule("BETWEEN", 7);
-			LeaveRule_BETWEEN();
-		}
-	}
-	// $ANTLR end "BETWEEN"
-
-	partial void EnterRule_BOTH();
-	partial void LeaveRule_BOTH();
-
-	// $ANTLR start "BOTH"
-	[GrammarRule("BOTH")]
-	private void mBOTH()
-	{
-		EnterRule_BOTH();
-		EnterRule("BOTH", 8);
-		TraceIn("BOTH", 8);
-		try
-		{
-			int _type = BOTH;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:16:6: ( 'both' )
-			DebugEnterAlt(1);
-			// Hql.g:16:8: 'both'
-			{
-			DebugLocation(16, 8);
-			Match("both"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("BOTH", 8);
-			LeaveRule("BOTH", 8);
-			LeaveRule_BOTH();
-		}
-	}
-	// $ANTLR end "BOTH"
-
-	partial void EnterRule_CASE();
-	partial void LeaveRule_CASE();
-
-	// $ANTLR start "CASE"
-	[GrammarRule("CASE")]
-	private void mCASE()
-	{
-		EnterRule_CASE();
-		EnterRule("CASE", 9);
-		TraceIn("CASE", 9);
-		try
-		{
-			int _type = CASE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:17:6: ( 'case' )
-			DebugEnterAlt(1);
-			// Hql.g:17:8: 'case'
-			{
-			DebugLocation(17, 8);
-			Match("case"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("CASE", 9);
-			LeaveRule("CASE", 9);
-			LeaveRule_CASE();
-		}
-	}
-	// $ANTLR end "CASE"
-
-	partial void EnterRule_CLASS();
-	partial void LeaveRule_CLASS();
-
-	// $ANTLR start "CLASS"
-	[GrammarRule("CLASS")]
-	private void mCLASS()
-	{
-		EnterRule_CLASS();
-		EnterRule("CLASS", 10);
-		TraceIn("CLASS", 10);
-		try
-		{
-			int _type = CLASS;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:18:7: ( 'class' )
-			DebugEnterAlt(1);
-			// Hql.g:18:9: 'class'
-			{
-			DebugLocation(18, 9);
-			Match("class"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("CLASS", 10);
-			LeaveRule("CLASS", 10);
-			LeaveRule_CLASS();
-		}
-	}
-	// $ANTLR end "CLASS"
-
-	partial void EnterRule_COUNT();
-	partial void LeaveRule_COUNT();
-
-	// $ANTLR start "COUNT"
-	[GrammarRule("COUNT")]
-	private void mCOUNT()
-	{
-		EnterRule_COUNT();
-		EnterRule("COUNT", 11);
-		TraceIn("COUNT", 11);
-		try
-		{
-			int _type = COUNT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:19:7: ( 'count' )
-			DebugEnterAlt(1);
-			// Hql.g:19:9: 'count'
-			{
-			DebugLocation(19, 9);
-			Match("count"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("COUNT", 11);
-			LeaveRule("COUNT", 11);
-			LeaveRule_COUNT();
-		}
-	}
-	// $ANTLR end "COUNT"
-
-	partial void EnterRule_DELETE();
-	partial void LeaveRule_DELETE();
-
-	// $ANTLR start "DELETE"
-	[GrammarRule("DELETE")]
-	private void mDELETE()
-	{
-		EnterRule_DELETE();
-		EnterRule("DELETE", 12);
-		TraceIn("DELETE", 12);
-		try
-		{
-			int _type = DELETE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:20:8: ( 'delete' )
-			DebugEnterAlt(1);
-			// Hql.g:20:10: 'delete'
-			{
-			DebugLocation(20, 10);
-			Match("delete"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("DELETE", 12);
-			LeaveRule("DELETE", 12);
-			LeaveRule_DELETE();
-		}
-	}
-	// $ANTLR end "DELETE"
-
-	partial void EnterRule_DESCENDING();
-	partial void LeaveRule_DESCENDING();
-
-	// $ANTLR start "DESCENDING"
-	[GrammarRule("DESCENDING")]
-	private void mDESCENDING()
-	{
-		EnterRule_DESCENDING();
-		EnterRule("DESCENDING", 13);
-		TraceIn("DESCENDING", 13);
-		try
-		{
-			int _type = DESCENDING;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:21:12: ( 'desc' )
-			DebugEnterAlt(1);
-			// Hql.g:21:14: 'desc'
-			{
-			DebugLocation(21, 14);
-			Match("desc"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("DESCENDING", 13);
-			LeaveRule("DESCENDING", 13);
-			LeaveRule_DESCENDING();
-		}
-	}
-	// $ANTLR end "DESCENDING"
-
-	partial void EnterRule_DISTINCT();
-	partial void LeaveRule_DISTINCT();
-
-	// $ANTLR start "DISTINCT"
-	[GrammarRule("DISTINCT")]
-	private void mDISTINCT()
-	{
-		EnterRule_DISTINCT();
-		EnterRule("DISTINCT", 14);
-		TraceIn("DISTINCT", 14);
-		try
-		{
-			int _type = DISTINCT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:22:10: ( 'distinct' )
-			DebugEnterAlt(1);
-			// Hql.g:22:12: 'distinct'
-			{
-			DebugLocation(22, 12);
-			Match("distinct"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("DISTINCT", 14);
-			LeaveRule("DISTINCT", 14);
-			LeaveRule_DISTINCT();
-		}
-	}
-	// $ANTLR end "DISTINCT"
-
-	partial void EnterRule_ELEMENTS();
-	partial void LeaveRule_ELEMENTS();
-
-	// $ANTLR start "ELEMENTS"
-	[GrammarRule("ELEMENTS")]
-	private void mELEMENTS()
-	{
-		EnterRule_ELEMENTS();
-		EnterRule("ELEMENTS", 15);
-		TraceIn("ELEMENTS", 15);
-		try
-		{
-			int _type = ELEMENTS;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:23:10: ( 'elements' )
-			DebugEnterAlt(1);
-			// Hql.g:23:12: 'elements'
-			{
-			DebugLocation(23, 12);
-			Match("elements"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("ELEMENTS", 15);
-			LeaveRule("ELEMENTS", 15);
-			LeaveRule_ELEMENTS();
-		}
-	}
-	// $ANTLR end "ELEMENTS"
-
-	partial void EnterRule_ELSE();
-	partial void LeaveRule_ELSE();
-
-	// $ANTLR start "ELSE"
-	[GrammarRule("ELSE")]
-	private void mELSE()
-	{
-		EnterRule_ELSE();
-		EnterRule("ELSE", 16);
-		TraceIn("ELSE", 16);
-		try
-		{
-			int _type = ELSE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:24:6: ( 'else' )
-			DebugEnterAlt(1);
-			// Hql.g:24:8: 'else'
-			{
-			DebugLocation(24, 8);
-			Match("else"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("ELSE", 16);
-			LeaveRule("ELSE", 16);
-			LeaveRule_ELSE();
-		}
-	}
-	// $ANTLR end "ELSE"
-
-	partial void EnterRule_EMPTY();
-	partial void LeaveRule_EMPTY();
-
-	// $ANTLR start "EMPTY"
-	[GrammarRule("EMPTY")]
-	private void mEMPTY()
-	{
-		EnterRule_EMPTY();
-		EnterRule("EMPTY", 17);
-		TraceIn("EMPTY", 17);
-		try
-		{
-			int _type = EMPTY;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:25:7: ( 'empty' )
-			DebugEnterAlt(1);
-			// Hql.g:25:9: 'empty'
-			{
-			DebugLocation(25, 9);
-			Match("empty"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("EMPTY", 17);
-			LeaveRule("EMPTY", 17);
-			LeaveRule_EMPTY();
-		}
-	}
-	// $ANTLR end "EMPTY"
-
-	partial void EnterRule_END();
-	partial void LeaveRule_END();
-
-	// $ANTLR start "END"
-	[GrammarRule("END")]
-	private void mEND()
-	{
-		EnterRule_END();
-		EnterRule("END", 18);
-		TraceIn("END", 18);
-		try
-		{
-			int _type = END;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:26:5: ( 'end' )
-			DebugEnterAlt(1);
-			// Hql.g:26:7: 'end'
-			{
-			DebugLocation(26, 7);
-			Match("end"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("END", 18);
-			LeaveRule("END", 18);
-			LeaveRule_END();
-		}
-	}
-	// $ANTLR end "END"
-
-	partial void EnterRule_ESCAPE();
-	partial void LeaveRule_ESCAPE();
-
-	// $ANTLR start "ESCAPE"
-	[GrammarRule("ESCAPE")]
-	private void mESCAPE()
-	{
-		EnterRule_ESCAPE();
-		EnterRule("ESCAPE", 19);
-		TraceIn("ESCAPE", 19);
-		try
-		{
-			int _type = ESCAPE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:27:8: ( 'escape' )
-			DebugEnterAlt(1);
-			// Hql.g:27:10: 'escape'
-			{
-			DebugLocation(27, 10);
-			Match("escape"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("ESCAPE", 19);
-			LeaveRule("ESCAPE", 19);
-			LeaveRule_ESCAPE();
-		}
-	}
-	// $ANTLR end "ESCAPE"
-
-	partial void EnterRule_EXISTS();
-	partial void LeaveRule_EXISTS();
-
-	// $ANTLR start "EXISTS"
-	[GrammarRule("EXISTS")]
-	private void mEXISTS()
-	{
-		EnterRule_EXISTS();
-		EnterRule("EXISTS", 20);
-		TraceIn("EXISTS", 20);
-		try
-		{
-			int _type = EXISTS;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:28:8: ( 'exists' )
-			DebugEnterAlt(1);
-			// Hql.g:28:10: 'exists'
-			{
-			DebugLocation(28, 10);
-			Match("exists"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("EXISTS", 20);
-			LeaveRule("EXISTS", 20);
-			LeaveRule_EXISTS();
-		}
-	}
-	// $ANTLR end "EXISTS"
-
-	partial void EnterRule_FALSE();
-	partial void LeaveRule_FALSE();
-
-	// $ANTLR start "FALSE"
-	[GrammarRule("FALSE")]
-	private void mFALSE()
-	{
-		EnterRule_FALSE();
-		EnterRule("FALSE", 21);
-		TraceIn("FALSE", 21);
-		try
-		{
-			int _type = FALSE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:29:7: ( 'false' )
-			DebugEnterAlt(1);
-			// Hql.g:29:9: 'false'
-			{
-			DebugLocation(29, 9);
-			Match("false"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("FALSE", 21);
-			LeaveRule("FALSE", 21);
-			LeaveRule_FALSE();
-		}
-	}
-	// $ANTLR end "FALSE"
-
-	partial void EnterRule_FETCH();
-	partial void LeaveRule_FETCH();
-
-	// $ANTLR start "FETCH"
-	[GrammarRule("FETCH")]
-	private void mFETCH()
-	{
-		EnterRule_FETCH();
-		EnterRule("FETCH", 22);
-		TraceIn("FETCH", 22);
-		try
-		{
-			int _type = FETCH;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:30:7: ( 'fetch' )
-			DebugEnterAlt(1);
-			// Hql.g:30:9: 'fetch'
-			{
-			DebugLocation(30, 9);
-			Match("fetch"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("FETCH", 22);
-			LeaveRule("FETCH", 22);
-			LeaveRule_FETCH();
-		}
-	}
-	// $ANTLR end "FETCH"
-
-	partial void EnterRule_FROM();
-	partial void LeaveRule_FROM();
-
-	// $ANTLR start "FROM"
-	[GrammarRule("FROM")]
-	private void mFROM()
-	{
-		EnterRule_FROM();
-		EnterRule("FROM", 23);
-		TraceIn("FROM", 23);
-		try
-		{
-			int _type = FROM;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:31:6: ( 'from' )
-			DebugEnterAlt(1);
-			// Hql.g:31:8: 'from'
-			{
-			DebugLocation(31, 8);
-			Match("from"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("FROM", 23);
-			LeaveRule("FROM", 23);
-			LeaveRule_FROM();
-		}
-	}
-	// $ANTLR end "FROM"
-
-	partial void EnterRule_FULL();
-	partial void LeaveRule_FULL();
-
-	// $ANTLR start "FULL"
-	[GrammarRule("FULL")]
-	private void mFULL()
-	{
-		EnterRule_FULL();
-		EnterRule("FULL", 24);
-		TraceIn("FULL", 24);
-		try
-		{
-			int _type = FULL;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:32:6: ( 'full' )
-			DebugEnterAlt(1);
-			// Hql.g:32:8: 'full'
-			{
-			DebugLocation(32, 8);
-			Match("full"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("FULL", 24);
-			LeaveRule("FULL", 24);
-			LeaveRule_FULL();
-		}
-	}
-	// $ANTLR end "FULL"
-
-	partial void EnterRule_GROUP();
-	partial void LeaveRule_GROUP();
-
-	// $ANTLR start "GROUP"
-	[GrammarRule("GROUP")]
-	private void mGROUP()
-	{
-		EnterRule_GROUP();
-		EnterRule("GROUP", 25);
-		TraceIn("GROUP", 25);
-		try
-		{
-			int _type = GROUP;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:33:7: ( 'group' )
-			DebugEnterAlt(1);
-			// Hql.g:33:9: 'group'
-			{
-			DebugLocation(33, 9);
-			Match("group"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("GROUP", 25);
-			LeaveRule("GROUP", 25);
-			LeaveRule_GROUP();
-		}
-	}
-	// $ANTLR end "GROUP"
-
-	partial void EnterRule_HAVING();
-	partial void LeaveRule_HAVING();
-
-	// $ANTLR start "HAVING"
-	[GrammarRule("HAVING")]
-	private void mHAVING()
-	{
-		EnterRule_HAVING();
-		EnterRule("HAVING", 26);
-		TraceIn("HAVING", 26);
-		try
-		{
-			int _type = HAVING;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:34:8: ( 'having' )
-			DebugEnterAlt(1);
-			// Hql.g:34:10: 'having'
-			{
-			DebugLocation(34, 10);
-			Match("having"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("HAVING", 26);
-			LeaveRule("HAVING", 26);
-			LeaveRule_HAVING();
-		}
-	}
-	// $ANTLR end "HAVING"
-
-	partial void EnterRule_IN();
-	partial void LeaveRule_IN();
-
-	// $ANTLR start "IN"
-	[GrammarRule("IN")]
-	private void mIN()
-	{
-		EnterRule_IN();
-		EnterRule("IN", 27);
-		TraceIn("IN", 27);
-		try
-		{
-			int _type = IN;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:35:4: ( 'in' )
-			DebugEnterAlt(1);
-			// Hql.g:35:6: 'in'
-			{
-			DebugLocation(35, 6);
-			Match("in"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("IN", 27);
-			LeaveRule("IN", 27);
-			LeaveRule_IN();
-		}
-	}
-	// $ANTLR end "IN"
-
-	partial void EnterRule_INDICES();
-	partial void LeaveRule_INDICES();
-
-	// $ANTLR start "INDICES"
-	[GrammarRule("INDICES")]
-	private void mINDICES()
-	{
-		EnterRule_INDICES();
-		EnterRule("INDICES", 28);
-		TraceIn("INDICES", 28);
-		try
-		{
-			int _type = INDICES;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:36:9: ( 'indices' )
-			DebugEnterAlt(1);
-			// Hql.g:36:11: 'indices'
-			{
-			DebugLocation(36, 11);
-			Match("indices"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("INDICES", 28);
-			LeaveRule("INDICES", 28);
-			LeaveRule_INDICES();
-		}
-	}
-	// $ANTLR end "INDICES"
-
-	partial void EnterRule_INNER();
-	partial void LeaveRule_INNER();
-
-	// $ANTLR start "INNER"
-	[GrammarRule("INNER")]
-	private void mINNER()
-	{
-		EnterRule_INNER();
-		EnterRule("INNER", 29);
-		TraceIn("INNER", 29);
-		try
-		{
-			int _type = INNER;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:37:7: ( 'inner' )
-			DebugEnterAlt(1);
-			// Hql.g:37:9: 'inner'
-			{
-			DebugLocation(37, 9);
-			Match("inner"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("INNER", 29);
-			LeaveRule("INNER", 29);
-			LeaveRule_INNER();
-		}
-	}
-	// $ANTLR end "INNER"
-
-	partial void EnterRule_INSERT();
-	partial void LeaveRule_INSERT();
-
-	// $ANTLR start "INSERT"
-	[GrammarRule("INSERT")]
-	private void mINSERT()
-	{
-		EnterRule_INSERT();
-		EnterRule("INSERT", 30);
-		TraceIn("INSERT", 30);
-		try
-		{
-			int _type = INSERT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:38:8: ( 'insert' )
-			DebugEnterAlt(1);
-			// Hql.g:38:10: 'insert'
-			{
-			DebugLocation(38, 10);
-			Match("insert"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("INSERT", 30);
-			LeaveRule("INSERT", 30);
-			LeaveRule_INSERT();
-		}
-	}
-	// $ANTLR end "INSERT"
-
-	partial void EnterRule_INTO();
-	partial void LeaveRule_INTO();
-
-	// $ANTLR start "INTO"
-	[GrammarRule("INTO")]
-	private void mINTO()
-	{
-		EnterRule_INTO();
-		EnterRule("INTO", 31);
-		TraceIn("INTO", 31);
-		try
-		{
-			int _type = INTO;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:39:6: ( 'into' )
-			DebugEnterAlt(1);
-			// Hql.g:39:8: 'into'
-			{
-			DebugLocation(39, 8);
-			Match("into"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("INTO", 31);
-			LeaveRule("INTO", 31);
-			LeaveRule_INTO();
-		}
-	}
-	// $ANTLR end "INTO"
-
-	partial void EnterRule_IS();
-	partial void LeaveRule_IS();
-
-	// $ANTLR start "IS"
-	[GrammarRule("IS")]
-	private void mIS()
-	{
-		EnterRule_IS();
-		EnterRule("IS", 32);
-		TraceIn("IS", 32);
-		try
-		{
-			int _type = IS;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:40:4: ( 'is' )
-			DebugEnterAlt(1);
-			// Hql.g:40:6: 'is'
-			{
-			DebugLocation(40, 6);
-			Match("is"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("IS", 32);
-			LeaveRule("IS", 32);
-			LeaveRule_IS();
-		}
-	}
-	// $ANTLR end "IS"
-
-	partial void EnterRule_JOIN();
-	partial void LeaveRule_JOIN();
-
-	// $ANTLR start "JOIN"
-	[GrammarRule("JOIN")]
-	private void mJOIN()
-	{
-		EnterRule_JOIN();
-		EnterRule("JOIN", 33);
-		TraceIn("JOIN", 33);
-		try
-		{
-			int _type = JOIN;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:41:6: ( 'join' )
-			DebugEnterAlt(1);
-			// Hql.g:41:8: 'join'
-			{
-			DebugLocation(41, 8);
-			Match("join"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("JOIN", 33);
-			LeaveRule("JOIN", 33);
-			LeaveRule_JOIN();
-		}
-	}
-	// $ANTLR end "JOIN"
-
-	partial void EnterRule_LEADING();
-	partial void LeaveRule_LEADING();
-
-	// $ANTLR start "LEADING"
-	[GrammarRule("LEADING")]
-	private void mLEADING()
-	{
-		EnterRule_LEADING();
-		EnterRule("LEADING", 34);
-		TraceIn("LEADING", 34);
-		try
-		{
-			int _type = LEADING;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:42:9: ( 'leading' )
-			DebugEnterAlt(1);
-			// Hql.g:42:11: 'leading'
-			{
-			DebugLocation(42, 11);
-			Match("leading"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("LEADING", 34);
-			LeaveRule("LEADING", 34);
-			LeaveRule_LEADING();
-		}
-	}
-	// $ANTLR end "LEADING"
-
-	partial void EnterRule_LEFT();
-	partial void LeaveRule_LEFT();
-
-	// $ANTLR start "LEFT"
-	[GrammarRule("LEFT")]
-	private void mLEFT()
-	{
-		EnterRule_LEFT();
-		EnterRule("LEFT", 35);
-		TraceIn("LEFT", 35);
-		try
-		{
-			int _type = LEFT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:43:6: ( 'left' )
-			DebugEnterAlt(1);
-			// Hql.g:43:8: 'left'
-			{
-			DebugLocation(43, 8);
-			Match("left"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("LEFT", 35);
-			LeaveRule("LEFT", 35);
-			LeaveRule_LEFT();
-		}
-	}
-	// $ANTLR end "LEFT"
-
-	partial void EnterRule_LIKE();
-	partial void LeaveRule_LIKE();
-
-	// $ANTLR start "LIKE"
-	[GrammarRule("LIKE")]
-	private void mLIKE()
-	{
-		EnterRule_LIKE();
-		EnterRule("LIKE", 36);
-		TraceIn("LIKE", 36);
-		try
-		{
-			int _type = LIKE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:44:6: ( 'like' )
-			DebugEnterAlt(1);
-			// Hql.g:44:8: 'like'
-			{
-			DebugLocation(44, 8);
-			Match("like"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("LIKE", 36);
-			LeaveRule("LIKE", 36);
-			LeaveRule_LIKE();
-		}
-	}
-	// $ANTLR end "LIKE"
-
-	partial void EnterRule_LITERAL_by();
-	partial void LeaveRule_LITERAL_by();
-
-	// $ANTLR start "LITERAL_by"
-	[GrammarRule("LITERAL_by")]
-	private void mLITERAL_by()
-	{
-		EnterRule_LITERAL_by();
-		EnterRule("LITERAL_by", 37);
-		TraceIn("LITERAL_by", 37);
-		try
-		{
-			int _type = LITERAL_by;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:45:12: ( 'by' )
-			DebugEnterAlt(1);
-			// Hql.g:45:14: 'by'
-			{
-			DebugLocation(45, 14);
-			Match("by"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("LITERAL_by", 37);
-			LeaveRule("LITERAL_by", 37);
-			LeaveRule_LITERAL_by();
-		}
-	}
-	// $ANTLR end "LITERAL_by"
-
-	partial void EnterRule_MAX();
-	partial void LeaveRule_MAX();
-
-	// $ANTLR start "MAX"
-	[GrammarRule("MAX")]
-	private void mMAX()
-	{
-		EnterRule_MAX();
-		EnterRule("MAX", 38);
-		TraceIn("MAX", 38);
-		try
-		{
-			int _type = MAX;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:46:5: ( 'max' )
-			DebugEnterAlt(1);
-			// Hql.g:46:7: 'max'
-			{
-			DebugLocation(46, 7);
-			Match("max"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("MAX", 38);
-			LeaveRule("MAX", 38);
-			LeaveRule_MAX();
-		}
-	}
-	// $ANTLR end "MAX"
-
-	partial void EnterRule_MEMBER();
-	partial void LeaveRule_MEMBER();
-
-	// $ANTLR start "MEMBER"
-	[GrammarRule("MEMBER")]
-	private void mMEMBER()
-	{
-		EnterRule_MEMBER();
-		EnterRule("MEMBER", 39);
-		TraceIn("MEMBER", 39);
-		try
-		{
-			int _type = MEMBER;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:47:8: ( 'member' )
-			DebugEnterAlt(1);
-			// Hql.g:47:10: 'member'
-			{
-			DebugLocation(47, 10);
-			Match("member"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("MEMBER", 39);
-			LeaveRule("MEMBER", 39);
-			LeaveRule_MEMBER();
-		}
-	}
-	// $ANTLR end "MEMBER"
-
-	partial void EnterRule_MIN();
-	partial void LeaveRule_MIN();
-
-	// $ANTLR start "MIN"
-	[GrammarRule("MIN")]
-	private void mMIN()
-	{
-		EnterRule_MIN();
-		EnterRule("MIN", 40);
-		TraceIn("MIN", 40);
-		try
-		{
-			int _type = MIN;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:48:5: ( 'min' )
-			DebugEnterAlt(1);
-			// Hql.g:48:7: 'min'
-			{
-			DebugLocation(48, 7);
-			Match("min"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("MIN", 40);
-			LeaveRule("MIN", 40);
-			LeaveRule_MIN();
-		}
-	}
-	// $ANTLR end "MIN"
-
-	partial void EnterRule_NEW();
-	partial void LeaveRule_NEW();
-
-	// $ANTLR start "NEW"
-	[GrammarRule("NEW")]
-	private void mNEW()
-	{
-		EnterRule_NEW();
-		EnterRule("NEW", 41);
-		TraceIn("NEW", 41);
-		try
-		{
-			int _type = NEW;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:49:5: ( 'new' )
-			DebugEnterAlt(1);
-			// Hql.g:49:7: 'new'
-			{
-			DebugLocation(49, 7);
-			Match("new"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("NEW", 41);
-			LeaveRule("NEW", 41);
-			LeaveRule_NEW();
-		}
-	}
-	// $ANTLR end "NEW"
-
-	partial void EnterRule_NOT();
-	partial void LeaveRule_NOT();
-
-	// $ANTLR start "NOT"
-	[GrammarRule("NOT")]
-	private void mNOT()
-	{
-		EnterRule_NOT();
-		EnterRule("NOT", 42);
-		TraceIn("NOT", 42);
-		try
-		{
-			int _type = NOT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:50:5: ( 'not' )
-			DebugEnterAlt(1);
-			// Hql.g:50:7: 'not'
-			{
-			DebugLocation(50, 7);
-			Match("not"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("NOT", 42);
-			LeaveRule("NOT", 42);
-			LeaveRule_NOT();
-		}
-	}
-	// $ANTLR end "NOT"
-
-	partial void EnterRule_NULL();
-	partial void LeaveRule_NULL();
-
-	// $ANTLR start "NULL"
-	[GrammarRule("NULL")]
-	private void mNULL()
-	{
-		EnterRule_NULL();
-		EnterRule("NULL", 43);
-		TraceIn("NULL", 43);
-		try
-		{
-			int _type = NULL;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:51:6: ( 'null' )
-			DebugEnterAlt(1);
-			// Hql.g:51:8: 'null'
-			{
-			DebugLocation(51, 8);
-			Match("null"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("NULL", 43);
-			LeaveRule("NULL", 43);
-			LeaveRule_NULL();
-		}
-	}
-	// $ANTLR end "NULL"
-
-	partial void EnterRule_OBJECT();
-	partial void LeaveRule_OBJECT();
-
-	// $ANTLR start "OBJECT"
-	[GrammarRule("OBJECT")]
-	private void mOBJECT()
-	{
-		EnterRule_OBJECT();
-		EnterRule("OBJECT", 44);
-		TraceIn("OBJECT", 44);
-		try
-		{
-			int _type = OBJECT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:52:8: ( 'object' )
-			DebugEnterAlt(1);
-			// Hql.g:52:10: 'object'
-			{
-			DebugLocation(52, 10);
-			Match("object"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("OBJECT", 44);
-			LeaveRule("OBJECT", 44);
-			LeaveRule_OBJECT();
-		}
-	}
-	// $ANTLR end "OBJECT"
-
-	partial void EnterRule_OF();
-	partial void LeaveRule_OF();
-
-	// $ANTLR start "OF"
-	[GrammarRule("OF")]
-	private void mOF()
-	{
-		EnterRule_OF();
-		EnterRule("OF", 45);
-		TraceIn("OF", 45);
-		try
-		{
-			int _type = OF;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:53:4: ( 'of' )
-			DebugEnterAlt(1);
-			// Hql.g:53:6: 'of'
-			{
-			DebugLocation(53, 6);
-			Match("of"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("OF", 45);
-			LeaveRule("OF", 45);
-			LeaveRule_OF();
-		}
-	}
-	// $ANTLR end "OF"
-
-	partial void EnterRule_ON();
-	partial void LeaveRule_ON();
-
-	// $ANTLR start "ON"
-	[GrammarRule("ON")]
-	private void mON()
-	{
-		EnterRule_ON();
-		EnterRule("ON", 46);
-		TraceIn("ON", 46);
-		try
-		{
-			int _type = ON;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:54:4: ( 'on' )
-			DebugEnterAlt(1);
-			// Hql.g:54:6: 'on'
-			{
-			DebugLocation(54, 6);
-			Match("on"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("ON", 46);
-			LeaveRule("ON", 46);
-			LeaveRule_ON();
-		}
-	}
-	// $ANTLR end "ON"
-
-	partial void EnterRule_OR();
-	partial void LeaveRule_OR();
-
-	// $ANTLR start "OR"
-	[GrammarRule("OR")]
-	private void mOR()
-	{
-		EnterRule_OR();
-		EnterRule("OR", 47);
-		TraceIn("OR", 47);
-		try
-		{
-			int _type = OR;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:55:4: ( 'or' )
-			DebugEnterAlt(1);
-			// Hql.g:55:6: 'or'
-			{
-			DebugLocation(55, 6);
-			Match("or"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("OR", 47);
-			LeaveRule("OR", 47);
-			LeaveRule_OR();
-		}
-	}
-	// $ANTLR end "OR"
-
-	partial void EnterRule_ORDER();
-	partial void LeaveRule_ORDER();
-
-	// $ANTLR start "ORDER"
-	[GrammarRule("ORDER")]
-	private void mORDER()
-	{
-		EnterRule_ORDER();
-		EnterRule("ORDER", 48);
-		TraceIn("ORDER", 48);
-		try
-		{
-			int _type = ORDER;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:56:7: ( 'order' )
-			DebugEnterAlt(1);
-			// Hql.g:56:9: 'order'
-			{
-			DebugLocation(56, 9);
-			Match("order"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("ORDER", 48);
-			LeaveRule("ORDER", 48);
-			LeaveRule_ORDER();
-		}
-	}
-	// $ANTLR end "ORDER"
-
-	partial void EnterRule_OUTER();
-	partial void LeaveRule_OUTER();
-
-	// $ANTLR start "OUTER"
-	[GrammarRule("OUTER")]
-	private void mOUTER()
-	{
-		EnterRule_OUTER();
-		EnterRule("OUTER", 49);
-		TraceIn("OUTER", 49);
-		try
-		{
-			int _type = OUTER;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:57:7: ( 'outer' )
-			DebugEnterAlt(1);
-			// Hql.g:57:9: 'outer'
-			{
-			DebugLocation(57, 9);
-			Match("outer"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("OUTER", 49);
-			LeaveRule("OUTER", 49);
-			LeaveRule_OUTER();
-		}
-	}
-	// $ANTLR end "OUTER"
-
-	partial void EnterRule_PROPERTIES();
-	partial void LeaveRule_PROPERTIES();
-
-	// $ANTLR start "PROPERTIES"
-	[GrammarRule("PROPERTIES")]
-	private void mPROPERTIES()
-	{
-		EnterRule_PROPERTIES();
-		EnterRule("PROPERTIES", 50);
-		TraceIn("PROPERTIES", 50);
-		try
-		{
-			int _type = PROPERTIES;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:58:12: ( 'properties' )
-			DebugEnterAlt(1);
-			// Hql.g:58:14: 'properties'
-			{
-			DebugLocation(58, 14);
-			Match("properties"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("PROPERTIES", 50);
-			LeaveRule("PROPERTIES", 50);
-			LeaveRule_PROPERTIES();
-		}
-	}
-	// $ANTLR end "PROPERTIES"
-
-	partial void EnterRule_RIGHT();
-	partial void LeaveRule_RIGHT();
-
-	// $ANTLR start "RIGHT"
-	[GrammarRule("RIGHT")]
-	private void mRIGHT()
-	{
-		EnterRule_RIGHT();
-		EnterRule("RIGHT", 51);
-		TraceIn("RIGHT", 51);
-		try
-		{
-			int _type = RIGHT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:59:7: ( 'right' )
-			DebugEnterAlt(1);
-			// Hql.g:59:9: 'right'
-			{
-			DebugLocation(59, 9);
-			Match("right"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("RIGHT", 51);
-			LeaveRule("RIGHT", 51);
-			LeaveRule_RIGHT();
-		}
-	}
-	// $ANTLR end "RIGHT"
-
-	partial void EnterRule_SELECT();
-	partial void LeaveRule_SELECT();
-
-	// $ANTLR start "SELECT"
-	[GrammarRule("SELECT")]
-	private void mSELECT()
-	{
-		EnterRule_SELECT();
-		EnterRule("SELECT", 52);
-		TraceIn("SELECT", 52);
-		try
-		{
-			int _type = SELECT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:60:8: ( 'select' )
-			DebugEnterAlt(1);
-			// Hql.g:60:10: 'select'
-			{
-			DebugLocation(60, 10);
-			Match("select"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("SELECT", 52);
-			LeaveRule("SELECT", 52);
-			LeaveRule_SELECT();
-		}
-	}
-	// $ANTLR end "SELECT"
-
-	partial void EnterRule_SET();
-	partial void LeaveRule_SET();
-
-	// $ANTLR start "SET"
-	[GrammarRule("SET")]
-	private void mSET()
-	{
-		EnterRule_SET();
-		EnterRule("SET", 53);
-		TraceIn("SET", 53);
-		try
-		{
-			int _type = SET;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:61:5: ( 'set' )
-			DebugEnterAlt(1);
-			// Hql.g:61:7: 'set'
-			{
-			DebugLocation(61, 7);
-			Match("set"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("SET", 53);
-			LeaveRule("SET", 53);
-			LeaveRule_SET();
-		}
-	}
-	// $ANTLR end "SET"
-
-	partial void EnterRule_SKIP();
-	partial void LeaveRule_SKIP();
-
-	// $ANTLR start "SKIP"
-	[GrammarRule("SKIP")]
-	private void mSKIP()
-	{
-		EnterRule_SKIP();
-		EnterRule("SKIP", 54);
-		TraceIn("SKIP", 54);
-		try
-		{
-			int _type = SKIP;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:62:6: ( 'skip' )
-			DebugEnterAlt(1);
-			// Hql.g:62:8: 'skip'
-			{
-			DebugLocation(62, 8);
-			Match("skip"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("SKIP", 54);
-			LeaveRule("SKIP", 54);
-			LeaveRule_SKIP();
-		}
-	}
-	// $ANTLR end "SKIP"
-
-	partial void EnterRule_SOME();
-	partial void LeaveRule_SOME();
-
-	// $ANTLR start "SOME"
-	[GrammarRule("SOME")]
-	private void mSOME()
-	{
-		EnterRule_SOME();
-		EnterRule("SOME", 55);
-		TraceIn("SOME", 55);
-		try
-		{
-			int _type = SOME;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:63:6: ( 'some' )
-			DebugEnterAlt(1);
-			// Hql.g:63:8: 'some'
-			{
-			DebugLocation(63, 8);
-			Match("some"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("SOME", 55);
-			LeaveRule("SOME", 55);
-			LeaveRule_SOME();
-		}
-	}
-	// $ANTLR end "SOME"
-
-	partial void EnterRule_SUM();
-	partial void LeaveRule_SUM();
-
-	// $ANTLR start "SUM"
-	[GrammarRule("SUM")]
-	private void mSUM()
-	{
-		EnterRule_SUM();
-		EnterRule("SUM", 56);
-		TraceIn("SUM", 56);
-		try
-		{
-			int _type = SUM;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:64:5: ( 'sum' )
-			DebugEnterAlt(1);
-			// Hql.g:64:7: 'sum'
-			{
-			DebugLocation(64, 7);
-			Match("sum"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("SUM", 56);
-			LeaveRule("SUM", 56);
-			LeaveRule_SUM();
-		}
-	}
-	// $ANTLR end "SUM"
-
-	partial void EnterRule_TAKE();
-	partial void LeaveRule_TAKE();
-
-	// $ANTLR start "TAKE"
-	[GrammarRule("TAKE")]
-	private void mTAKE()
-	{
-		EnterRule_TAKE();
-		EnterRule("TAKE", 57);
-		TraceIn("TAKE", 57);
-		try
-		{
-			int _type = TAKE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:65:6: ( 'take' )
-			DebugEnterAlt(1);
-			// Hql.g:65:8: 'take'
-			{
-			DebugLocation(65, 8);
-			Match("take"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("TAKE", 57);
-			LeaveRule("TAKE", 57);
-			LeaveRule_TAKE();
-		}
-	}
-	// $ANTLR end "TAKE"
-
-	partial void EnterRule_THEN();
-	partial void LeaveRule_THEN();
-
-	// $ANTLR start "THEN"
-	[GrammarRule("THEN")]
-	private void mTHEN()
-	{
-		EnterRule_THEN();
-		EnterRule("THEN", 58);
-		TraceIn("THEN", 58);
-		try
-		{
-			int _type = THEN;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:66:6: ( 'then' )
-			DebugEnterAlt(1);
-			// Hql.g:66:8: 'then'
-			{
-			DebugLocation(66, 8);
-			Match("then"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("THEN", 58);
-			LeaveRule("THEN", 58);
-			LeaveRule_THEN();
-		}
-	}
-	// $ANTLR end "THEN"
-
-	partial void EnterRule_TRAILING();
-	partial void LeaveRule_TRAILING();
-
-	// $ANTLR start "TRAILING"
-	[GrammarRule("TRAILING")]
-	private void mTRAILING()
-	{
-		EnterRule_TRAILING();
-		EnterRule("TRAILING", 59);
-		TraceIn("TRAILING", 59);
-		try
-		{
-			int _type = TRAILING;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:67:10: ( 'trailing' )
-			DebugEnterAlt(1);
-			// Hql.g:67:12: 'trailing'
-			{
-			DebugLocation(67, 12);
-			Match("trailing"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("TRAILING", 59);
-			LeaveRule("TRAILING", 59);
-			LeaveRule_TRAILING();
-		}
-	}
-	// $ANTLR end "TRAILING"
-
-	partial void EnterRule_TRUE();
-	partial void LeaveRule_TRUE();
-
-	// $ANTLR start "TRUE"
-	[GrammarRule("TRUE")]
-	private void mTRUE()
-	{
-		EnterRule_TRUE();
-		EnterRule("TRUE", 60);
-		TraceIn("TRUE", 60);
-		try
-		{
-			int _type = TRUE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:68:6: ( 'true' )
-			DebugEnterAlt(1);
-			// Hql.g:68:8: 'true'
-			{
-			DebugLocation(68, 8);
-			Match("true"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("TRUE", 60);
-			LeaveRule("TRUE", 60);
-			LeaveRule_TRUE();
-		}
-	}
-	// $ANTLR end "TRUE"
-
-	partial void EnterRule_UNION();
-	partial void LeaveRule_UNION();
-
-	// $ANTLR start "UNION"
-	[GrammarRule("UNION")]
-	private void mUNION()
-	{
-		EnterRule_UNION();
-		EnterRule("UNION", 61);
-		TraceIn("UNION", 61);
-		try
-		{
-			int _type = UNION;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:69:7: ( 'union' )
-			DebugEnterAlt(1);
-			// Hql.g:69:9: 'union'
-			{
-			DebugLocation(69, 9);
-			Match("union"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("UNION", 61);
-			LeaveRule("UNION", 61);
-			LeaveRule_UNION();
-		}
-	}
-	// $ANTLR end "UNION"
-
-	partial void EnterRule_UPDATE();
-	partial void LeaveRule_UPDATE();
-
-	// $ANTLR start "UPDATE"
-	[GrammarRule("UPDATE")]
-	private void mUPDATE()
-	{
-		EnterRule_UPDATE();
-		EnterRule("UPDATE", 62);
-		TraceIn("UPDATE", 62);
-		try
-		{
-			int _type = UPDATE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:70:8: ( 'update' )
-			DebugEnterAlt(1);
-			// Hql.g:70:10: 'update'
-			{
-			DebugLocation(70, 10);
-			Match("update"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("UPDATE", 62);
-			LeaveRule("UPDATE", 62);
-			LeaveRule_UPDATE();
-		}
-	}
-	// $ANTLR end "UPDATE"
-
-	partial void EnterRule_VERSIONED();
-	partial void LeaveRule_VERSIONED();
-
-	// $ANTLR start "VERSIONED"
-	[GrammarRule("VERSIONED")]
-	private void mVERSIONED()
-	{
-		EnterRule_VERSIONED();
-		EnterRule("VERSIONED", 63);
-		TraceIn("VERSIONED", 63);
-		try
-		{
-			int _type = VERSIONED;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:71:11: ( 'versioned' )
-			DebugEnterAlt(1);
-			// Hql.g:71:13: 'versioned'
-			{
-			DebugLocation(71, 13);
-			Match("versioned"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("VERSIONED", 63);
-			LeaveRule("VERSIONED", 63);
-			LeaveRule_VERSIONED();
-		}
-	}
-	// $ANTLR end "VERSIONED"
-
-	partial void EnterRule_WHEN();
-	partial void LeaveRule_WHEN();
-
-	// $ANTLR start "WHEN"
-	[GrammarRule("WHEN")]
-	private void mWHEN()
-	{
-		EnterRule_WHEN();
-		EnterRule("WHEN", 64);
-		TraceIn("WHEN", 64);
-		try
-		{
-			int _type = WHEN;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:72:6: ( 'when' )
-			DebugEnterAlt(1);
-			// Hql.g:72:8: 'when'
-			{
-			DebugLocation(72, 8);
-			Match("when"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("WHEN", 64);
-			LeaveRule("WHEN", 64);
-			LeaveRule_WHEN();
-		}
-	}
-	// $ANTLR end "WHEN"
-
-	partial void EnterRule_WHERE();
-	partial void LeaveRule_WHERE();
-
-	// $ANTLR start "WHERE"
-	[GrammarRule("WHERE")]
-	private void mWHERE()
-	{
-		EnterRule_WHERE();
-		EnterRule("WHERE", 65);
-		TraceIn("WHERE", 65);
-		try
-		{
-			int _type = WHERE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:73:7: ( 'where' )
-			DebugEnterAlt(1);
-			// Hql.g:73:9: 'where'
-			{
-			DebugLocation(73, 9);
-			Match("where"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("WHERE", 65);
-			LeaveRule("WHERE", 65);
-			LeaveRule_WHERE();
-		}
-	}
-	// $ANTLR end "WHERE"
-
-	partial void EnterRule_WITH();
-	partial void LeaveRule_WITH();
-
-	// $ANTLR start "WITH"
-	[GrammarRule("WITH")]
-	private void mWITH()
-	{
-		EnterRule_WITH();
-		EnterRule("WITH", 66);
-		TraceIn("WITH", 66);
-		try
-		{
-			int _type = WITH;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:74:6: ( 'with' )
-			DebugEnterAlt(1);
-			// Hql.g:74:8: 'with'
-			{
-			DebugLocation(74, 8);
-			Match("with"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("WITH", 66);
-			LeaveRule("WITH", 66);
-			LeaveRule_WITH();
-		}
-	}
-	// $ANTLR end "WITH"
-
-	partial void EnterRule_T__133();
-	partial void LeaveRule_T__133();
-
-	// $ANTLR start "T__133"
-	[GrammarRule("T__133")]
-	private void mT__133()
-	{
-		EnterRule_T__133();
-		EnterRule("T__133", 67);
-		TraceIn("T__133", 67);
-		try
-		{
-			int _type = T__133;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:75:8: ( 'ascending' )
-			DebugEnterAlt(1);
-			// Hql.g:75:10: 'ascending'
-			{
-			DebugLocation(75, 10);
-			Match("ascending"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("T__133", 67);
-			LeaveRule("T__133", 67);
-			LeaveRule_T__133();
-		}
-	}
-	// $ANTLR end "T__133"
-
-	partial void EnterRule_T__134();
-	partial void LeaveRule_T__134();
-
-	// $ANTLR start "T__134"
-	[GrammarRule("T__134")]
-	private void mT__134()
-	{
-		EnterRule_T__134();
-		EnterRule("T__134", 68);
-		TraceIn("T__134", 68);
-		try
-		{
-			int _type = T__134;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:76:8: ( 'descending' )
-			DebugEnterAlt(1);
-			// Hql.g:76:10: 'descending'
-			{
-			DebugLocation(76, 10);
-			Match("descending"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("T__134", 68);
-			LeaveRule("T__134", 68);
-			LeaveRule_T__134();
-		}
-	}
-	// $ANTLR end "T__134"
-
-	partial void EnterRule_EQ();
-	partial void LeaveRule_EQ();
-
-	// $ANTLR start "EQ"
-	[GrammarRule("EQ")]
-	private void mEQ()
-	{
-		EnterRule_EQ();
-		EnterRule("EQ", 69);
-		TraceIn("EQ", 69);
-		try
-		{
-			int _type = EQ;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:699:3: ( '=' )
-			DebugEnterAlt(1);
-			// Hql.g:699:5: '='
-			{
-			DebugLocation(699, 5);
-			Match('='); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("EQ", 69);
-			LeaveRule("EQ", 69);
-			LeaveRule_EQ();
-		}
-	}
-	// $ANTLR end "EQ"
-
-	partial void EnterRule_LT();
-	partial void LeaveRule_LT();
-
-	// $ANTLR start "LT"
-	[GrammarRule("LT")]
-	private void mLT()
-	{
-		EnterRule_LT();
-		EnterRule("LT", 70);
-		TraceIn("LT", 70);
-		try
-		{
-			int _type = LT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:700:3: ( '<' )
-			DebugEnterAlt(1);
-			// Hql.g:700:5: '<'
-			{
-			DebugLocation(700, 5);
-			Match('<'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("LT", 70);
-			LeaveRule("LT", 70);
-			LeaveRule_LT();
-		}
-	}
-	// $ANTLR end "LT"
-
-	partial void EnterRule_GT();
-	partial void LeaveRule_GT();
-
-	// $ANTLR start "GT"
-	[GrammarRule("GT")]
-	private void mGT()
-	{
-		EnterRule_GT();
-		EnterRule("GT", 71);
-		TraceIn("GT", 71);
-		try
-		{
-			int _type = GT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:701:3: ( '>' )
-			DebugEnterAlt(1);
-			// Hql.g:701:5: '>'
-			{
-			DebugLocation(701, 5);
-			Match('>'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("GT", 71);
-			LeaveRule("GT", 71);
-			LeaveRule_GT();
-		}
-	}
-	// $ANTLR end "GT"
-
-	partial void EnterRule_SQL_NE();
-	partial void LeaveRule_SQL_NE();
-
-	// $ANTLR start "SQL_NE"
-	[GrammarRule("SQL_NE")]
-	private void mSQL_NE()
-	{
-		EnterRule_SQL_NE();
-		EnterRule("SQL_NE", 72);
-		TraceIn("SQL_NE", 72);
-		try
-		{
-			int _type = SQL_NE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:702:7: ( '<>' )
-			DebugEnterAlt(1);
-			// Hql.g:702:9: '<>'
-			{
-			DebugLocation(702, 9);
-			Match("<>"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("SQL_NE", 72);
-			LeaveRule("SQL_NE", 72);
-			LeaveRule_SQL_NE();
-		}
-	}
-	// $ANTLR end "SQL_NE"
-
-	partial void EnterRule_NE();
-	partial void LeaveRule_NE();
-
-	// $ANTLR start "NE"
-	[GrammarRule("NE")]
-	private void mNE()
-	{
-		EnterRule_NE();
-		EnterRule("NE", 73);
-		TraceIn("NE", 73);
-		try
-		{
-			int _type = NE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:703:3: ( '!=' | '^=' )
-			int alt1=2;
-			try { DebugEnterDecision(1, false);
-			int LA1_1 = input.LA(1);
-
-			if ((LA1_1=='!'))
-			{
-				alt1 = 1;
-			}
-			else if ((LA1_1=='^'))
-			{
-				alt1 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 1, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(1); }
-			switch (alt1)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:703:5: '!='
-				{
-				DebugLocation(703, 5);
-				Match("!="); if (state.failed) return;
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:703:12: '^='
-				{
-				DebugLocation(703, 12);
-				Match("^="); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("NE", 73);
-			LeaveRule("NE", 73);
-			LeaveRule_NE();
-		}
-	}
-	// $ANTLR end "NE"
-
-	partial void EnterRule_LE();
-	partial void LeaveRule_LE();
-
-	// $ANTLR start "LE"
-	[GrammarRule("LE")]
-	private void mLE()
-	{
-		EnterRule_LE();
-		EnterRule("LE", 74);
-		TraceIn("LE", 74);
-		try
-		{
-			int _type = LE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:704:3: ( '<=' )
-			DebugEnterAlt(1);
-			// Hql.g:704:5: '<='
-			{
-			DebugLocation(704, 5);
-			Match("<="); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("LE", 74);
-			LeaveRule("LE", 74);
-			LeaveRule_LE();
-		}
-	}
-	// $ANTLR end "LE"
-
-	partial void EnterRule_GE();
-	partial void LeaveRule_GE();
-
-	// $ANTLR start "GE"
-	[GrammarRule("GE")]
-	private void mGE()
-	{
-		EnterRule_GE();
-		EnterRule("GE", 75);
-		TraceIn("GE", 75);
-		try
-		{
-			int _type = GE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:705:3: ( '>=' )
-			DebugEnterAlt(1);
-			// Hql.g:705:5: '>='
-			{
-			DebugLocation(705, 5);
-			Match(">="); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("GE", 75);
-			LeaveRule("GE", 75);
-			LeaveRule_GE();
-		}
-	}
-	// $ANTLR end "GE"
-
-	partial void EnterRule_BOR();
-	partial void LeaveRule_BOR();
-
-	// $ANTLR start "BOR"
-	[GrammarRule("BOR")]
-	private void mBOR()
-	{
-		EnterRule_BOR();
-		EnterRule("BOR", 76);
-		TraceIn("BOR", 76);
-		try
-		{
-			int _type = BOR;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:707:5: ( '|' )
-			DebugEnterAlt(1);
-			// Hql.g:707:8: '|'
-			{
-			DebugLocation(707, 8);
-			Match('|'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("BOR", 76);
-			LeaveRule("BOR", 76);
-			LeaveRule_BOR();
-		}
-	}
-	// $ANTLR end "BOR"
-
-	partial void EnterRule_BXOR();
-	partial void LeaveRule_BXOR();
-
-	// $ANTLR start "BXOR"
-	[GrammarRule("BXOR")]
-	private void mBXOR()
-	{
-		EnterRule_BXOR();
-		EnterRule("BXOR", 77);
-		TraceIn("BXOR", 77);
-		try
-		{
-			int _type = BXOR;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:708:6: ( '^' )
-			DebugEnterAlt(1);
-			// Hql.g:708:8: '^'
-			{
-			DebugLocation(708, 8);
-			Match('^'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("BXOR", 77);
-			LeaveRule("BXOR", 77);
-			LeaveRule_BXOR();
-		}
-	}
-	// $ANTLR end "BXOR"
-
-	partial void EnterRule_BAND();
-	partial void LeaveRule_BAND();
-
-	// $ANTLR start "BAND"
-	[GrammarRule("BAND")]
-	private void mBAND()
-	{
-		EnterRule_BAND();
-		EnterRule("BAND", 78);
-		TraceIn("BAND", 78);
-		try
-		{
-			int _type = BAND;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:709:6: ( '&' )
-			DebugEnterAlt(1);
-			// Hql.g:709:8: '&'
-			{
-			DebugLocation(709, 8);
-			Match('&'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("BAND", 78);
-			LeaveRule("BAND", 78);
-			LeaveRule_BAND();
-		}
-	}
-	// $ANTLR end "BAND"
-
-	partial void EnterRule_BNOT();
-	partial void LeaveRule_BNOT();
-
-	// $ANTLR start "BNOT"
-	[GrammarRule("BNOT")]
-	private void mBNOT()
-	{
-		EnterRule_BNOT();
-		EnterRule("BNOT", 79);
-		TraceIn("BNOT", 79);
-		try
-		{
-			int _type = BNOT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:710:6: ( '!' )
-			DebugEnterAlt(1);
-			// Hql.g:710:8: '!'
-			{
-			DebugLocation(710, 8);
-			Match('!'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("BNOT", 79);
-			LeaveRule("BNOT", 79);
-			LeaveRule_BNOT();
-		}
-	}
-	// $ANTLR end "BNOT"
-
-	partial void EnterRule_COMMA();
-	partial void LeaveRule_COMMA();
-
-	// $ANTLR start "COMMA"
-	[GrammarRule("COMMA")]
-	private void mCOMMA()
-	{
-		EnterRule_COMMA();
-		EnterRule("COMMA", 80);
-		TraceIn("COMMA", 80);
-		try
-		{
-			int _type = COMMA;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:712:6: ( ',' )
-			DebugEnterAlt(1);
-			// Hql.g:712:8: ','
-			{
-			DebugLocation(712, 8);
-			Match(','); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("COMMA", 80);
-			LeaveRule("COMMA", 80);
-			LeaveRule_COMMA();
-		}
-	}
-	// $ANTLR end "COMMA"
-
-	partial void EnterRule_OPEN();
-	partial void LeaveRule_OPEN();
-
-	// $ANTLR start "OPEN"
-	[GrammarRule("OPEN")]
-	private void mOPEN()
-	{
-		EnterRule_OPEN();
-		EnterRule("OPEN", 81);
-		TraceIn("OPEN", 81);
-		try
-		{
-			int _type = OPEN;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:714:5: ( '(' )
-			DebugEnterAlt(1);
-			// Hql.g:714:7: '('
-			{
-			DebugLocation(714, 7);
-			Match('('); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("OPEN", 81);
-			LeaveRule("OPEN", 81);
-			LeaveRule_OPEN();
-		}
-	}
-	// $ANTLR end "OPEN"
-
-	partial void EnterRule_CLOSE();
-	partial void LeaveRule_CLOSE();
-
-	// $ANTLR start "CLOSE"
-	[GrammarRule("CLOSE")]
-	private void mCLOSE()
-	{
-		EnterRule_CLOSE();
-		EnterRule("CLOSE", 82);
-		TraceIn("CLOSE", 82);
-		try
-		{
-			int _type = CLOSE;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:715:6: ( ')' )
-			DebugEnterAlt(1);
-			// Hql.g:715:8: ')'
-			{
-			DebugLocation(715, 8);
-			Match(')'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("CLOSE", 82);
-			LeaveRule("CLOSE", 82);
-			LeaveRule_CLOSE();
-		}
-	}
-	// $ANTLR end "CLOSE"
-
-	partial void EnterRule_OPEN_BRACKET();
-	partial void LeaveRule_OPEN_BRACKET();
-
-	// $ANTLR start "OPEN_BRACKET"
-	[GrammarRule("OPEN_BRACKET")]
-	private void mOPEN_BRACKET()
-	{
-		EnterRule_OPEN_BRACKET();
-		EnterRule("OPEN_BRACKET", 83);
-		TraceIn("OPEN_BRACKET", 83);
-		try
-		{
-			int _type = OPEN_BRACKET;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:716:13: ( '[' )
-			DebugEnterAlt(1);
-			// Hql.g:716:15: '['
-			{
-			DebugLocation(716, 15);
-			Match('['); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("OPEN_BRACKET", 83);
-			LeaveRule("OPEN_BRACKET", 83);
-			LeaveRule_OPEN_BRACKET();
-		}
-	}
-	// $ANTLR end "OPEN_BRACKET"
-
-	partial void EnterRule_CLOSE_BRACKET();
-	partial void LeaveRule_CLOSE_BRACKET();
-
-	// $ANTLR start "CLOSE_BRACKET"
-	[GrammarRule("CLOSE_BRACKET")]
-	private void mCLOSE_BRACKET()
-	{
-		EnterRule_CLOSE_BRACKET();
-		EnterRule("CLOSE_BRACKET", 84);
-		TraceIn("CLOSE_BRACKET", 84);
-		try
-		{
-			int _type = CLOSE_BRACKET;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:717:14: ( ']' )
-			DebugEnterAlt(1);
-			// Hql.g:717:16: ']'
-			{
-			DebugLocation(717, 16);
-			Match(']'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("CLOSE_BRACKET", 84);
-			LeaveRule("CLOSE_BRACKET", 84);
-			LeaveRule_CLOSE_BRACKET();
-		}
-	}
-	// $ANTLR end "CLOSE_BRACKET"
-
-	partial void EnterRule_CONCAT();
-	partial void LeaveRule_CONCAT();
-
-	// $ANTLR start "CONCAT"
-	[GrammarRule("CONCAT")]
-	private void mCONCAT()
-	{
-		EnterRule_CONCAT();
-		EnterRule("CONCAT", 85);
-		TraceIn("CONCAT", 85);
-		try
-		{
-			int _type = CONCAT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:719:7: ( '||' )
-			DebugEnterAlt(1);
-			// Hql.g:719:9: '||'
-			{
-			DebugLocation(719, 9);
-			Match("||"); if (state.failed) return;
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("CONCAT", 85);
-			LeaveRule("CONCAT", 85);
-			LeaveRule_CONCAT();
-		}
-	}
-	// $ANTLR end "CONCAT"
-
-	partial void EnterRule_PLUS();
-	partial void LeaveRule_PLUS();
-
-	// $ANTLR start "PLUS"
-	[GrammarRule("PLUS")]
-	private void mPLUS()
-	{
-		EnterRule_PLUS();
-		EnterRule("PLUS", 86);
-		TraceIn("PLUS", 86);
-		try
-		{
-			int _type = PLUS;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:720:5: ( '+' )
-			DebugEnterAlt(1);
-			// Hql.g:720:7: '+'
-			{
-			DebugLocation(720, 7);
-			Match('+'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("PLUS", 86);
-			LeaveRule("PLUS", 86);
-			LeaveRule_PLUS();
-		}
-	}
-	// $ANTLR end "PLUS"
-
-	partial void EnterRule_MINUS();
-	partial void LeaveRule_MINUS();
-
-	// $ANTLR start "MINUS"
-	[GrammarRule("MINUS")]
-	private void mMINUS()
-	{
-		EnterRule_MINUS();
-		EnterRule("MINUS", 87);
-		TraceIn("MINUS", 87);
-		try
-		{
-			int _type = MINUS;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:721:6: ( '-' )
-			DebugEnterAlt(1);
-			// Hql.g:721:8: '-'
-			{
-			DebugLocation(721, 8);
-			Match('-'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("MINUS", 87);
-			LeaveRule("MINUS", 87);
-			LeaveRule_MINUS();
-		}
-	}
-	// $ANTLR end "MINUS"
-
-	partial void EnterRule_STAR();
-	partial void LeaveRule_STAR();
-
-	// $ANTLR start "STAR"
-	[GrammarRule("STAR")]
-	private void mSTAR()
-	{
-		EnterRule_STAR();
-		EnterRule("STAR", 88);
-		TraceIn("STAR", 88);
-		try
-		{
-			int _type = STAR;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:722:5: ( '*' )
-			DebugEnterAlt(1);
-			// Hql.g:722:7: '*'
-			{
-			DebugLocation(722, 7);
-			Match('*'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("STAR", 88);
-			LeaveRule("STAR", 88);
-			LeaveRule_STAR();
-		}
-	}
-	// $ANTLR end "STAR"
-
-	partial void EnterRule_DIV();
-	partial void LeaveRule_DIV();
-
-	// $ANTLR start "DIV"
-	[GrammarRule("DIV")]
-	private void mDIV()
-	{
-		EnterRule_DIV();
-		EnterRule("DIV", 89);
-		TraceIn("DIV", 89);
-		try
-		{
-			int _type = DIV;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:723:4: ( '/' )
-			DebugEnterAlt(1);
-			// Hql.g:723:6: '/'
-			{
-			DebugLocation(723, 6);
-			Match('/'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("DIV", 89);
-			LeaveRule("DIV", 89);
-			LeaveRule_DIV();
-		}
-	}
-	// $ANTLR end "DIV"
-
-	partial void EnterRule_COLON();
-	partial void LeaveRule_COLON();
-
-	// $ANTLR start "COLON"
-	[GrammarRule("COLON")]
-	private void mCOLON()
-	{
-		EnterRule_COLON();
-		EnterRule("COLON", 90);
-		TraceIn("COLON", 90);
-		try
-		{
-			int _type = COLON;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:724:6: ( ':' )
-			DebugEnterAlt(1);
-			// Hql.g:724:8: ':'
-			{
-			DebugLocation(724, 8);
-			Match(':'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("COLON", 90);
-			LeaveRule("COLON", 90);
-			LeaveRule_COLON();
-		}
-	}
-	// $ANTLR end "COLON"
-
-	partial void EnterRule_PARAM();
-	partial void LeaveRule_PARAM();
-
-	// $ANTLR start "PARAM"
-	[GrammarRule("PARAM")]
-	private void mPARAM()
-	{
-		EnterRule_PARAM();
-		EnterRule("PARAM", 91);
-		TraceIn("PARAM", 91);
-		try
-		{
-			int _type = PARAM;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:725:6: ( '?' )
-			DebugEnterAlt(1);
-			// Hql.g:725:8: '?'
-			{
-			DebugLocation(725, 8);
-			Match('?'); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("PARAM", 91);
-			LeaveRule("PARAM", 91);
-			LeaveRule_PARAM();
-		}
-	}
-	// $ANTLR end "PARAM"
-
-	partial void EnterRule_IDENT();
-	partial void LeaveRule_IDENT();
-
-	// $ANTLR start "IDENT"
-	[GrammarRule("IDENT")]
-	private void mIDENT()
-	{
-		EnterRule_IDENT();
-		EnterRule("IDENT", 92);
-		TraceIn("IDENT", 92);
-		try
-		{
-			int _type = IDENT;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:728:2: ( ID_START_LETTER ( ID_LETTER )* )
-			DebugEnterAlt(1);
-			// Hql.g:728:4: ID_START_LETTER ( ID_LETTER )*
-			{
-			DebugLocation(728, 4);
-			mID_START_LETTER(); if (state.failed) return;
-			DebugLocation(728, 20);
-			// Hql.g:728:20: ( ID_LETTER )*
-			try { DebugEnterSubRule(2);
-			while (true)
-			{
-				int alt2=2;
-				try { DebugEnterDecision(2, false);
-				int LA2_1 = input.LA(1);
-
-				if ((LA2_1=='$'||(LA2_1>='0' && LA2_1<='9')||(LA2_1>='A' && LA2_1<='Z')||LA2_1=='_'||(LA2_1>='a' && LA2_1<='z')||(LA2_1>='\u0080' && LA2_1<='\uFFFE')))
-				{
-					alt2 = 1;
-				}
-
-
-				} finally { DebugExitDecision(2); }
-				switch ( alt2 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:
-					{
-					DebugLocation(728, 20);
-					input.Consume();
-					state.failed=false;
-
-					}
-					break;
-
-				default:
-					goto loop2;
-				}
-			}
-
-			loop2:
-				;
-
-			} finally { DebugExitSubRule(2); }
-
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("IDENT", 92);
-			LeaveRule("IDENT", 92);
-			LeaveRule_IDENT();
-		}
-	}
-	// $ANTLR end "IDENT"
-
-	partial void EnterRule_ID_START_LETTER();
-	partial void LeaveRule_ID_START_LETTER();
-
-	// $ANTLR start "ID_START_LETTER"
-	[GrammarRule("ID_START_LETTER")]
-	private void mID_START_LETTER()
-	{
-		EnterRule_ID_START_LETTER();
-		EnterRule("ID_START_LETTER", 93);
-		TraceIn("ID_START_LETTER", 93);
-		try
-		{
-			// Hql.g:734:5: ( '_' | '$' | 'a' .. 'z' | 'A' .. 'Z' | '\\u0080' .. '\\ufffe' )
-			DebugEnterAlt(1);
-			// Hql.g:
-			{
-			DebugLocation(734, 5);
-			if (input.LA(1)=='$'||(input.LA(1)>='A' && input.LA(1)<='Z')||input.LA(1)=='_'||(input.LA(1)>='a' && input.LA(1)<='z')||(input.LA(1)>='\u0080' && input.LA(1)<='\uFFFE'))
-			{
-				input.Consume();
-			state.failed=false;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				MismatchedSetException mse = new MismatchedSetException(null,input);
-				DebugRecognitionException(mse);
-				Recover(mse);
-				throw mse;
-			}
-
-
-			}
-
-		}
-		finally
-		{
-			TraceOut("ID_START_LETTER", 93);
-			LeaveRule("ID_START_LETTER", 93);
-			LeaveRule_ID_START_LETTER();
-		}
-	}
-	// $ANTLR end "ID_START_LETTER"
-
-	partial void EnterRule_ID_LETTER();
-	partial void LeaveRule_ID_LETTER();
-
-	// $ANTLR start "ID_LETTER"
-	[GrammarRule("ID_LETTER")]
-	private void mID_LETTER()
-	{
-		EnterRule_ID_LETTER();
-		EnterRule("ID_LETTER", 94);
-		TraceIn("ID_LETTER", 94);
-		try
-		{
-			// Hql.g:743:5: ( ID_START_LETTER | '0' .. '9' )
-			DebugEnterAlt(1);
-			// Hql.g:
-			{
-			DebugLocation(743, 5);
-			if (input.LA(1)=='$'||(input.LA(1)>='0' && input.LA(1)<='9')||(input.LA(1)>='A' && input.LA(1)<='Z')||input.LA(1)=='_'||(input.LA(1)>='a' && input.LA(1)<='z')||(input.LA(1)>='\u0080' && input.LA(1)<='\uFFFE'))
-			{
-				input.Consume();
-			state.failed=false;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				MismatchedSetException mse = new MismatchedSetException(null,input);
-				DebugRecognitionException(mse);
-				Recover(mse);
-				throw mse;
-			}
-
-
-			}
-
-		}
-		finally
-		{
-			TraceOut("ID_LETTER", 94);
-			LeaveRule("ID_LETTER", 94);
-			LeaveRule_ID_LETTER();
-		}
-	}
-	// $ANTLR end "ID_LETTER"
-
-	partial void EnterRule_QUOTED_String();
-	partial void LeaveRule_QUOTED_String();
-
-	// $ANTLR start "QUOTED_String"
-	[GrammarRule("QUOTED_String")]
-	private void mQUOTED_String()
-	{
-		EnterRule_QUOTED_String();
-		EnterRule("QUOTED_String", 95);
-		TraceIn("QUOTED_String", 95);
-		try
-		{
-			int _type = QUOTED_String;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:747:4: ( '\\'' ( ( ESCqs )=> ESCqs |~ '\\'' )* '\\'' )
-			DebugEnterAlt(1);
-			// Hql.g:747:6: '\\'' ( ( ESCqs )=> ESCqs |~ '\\'' )* '\\''
-			{
-			DebugLocation(747, 6);
-			Match('\''); if (state.failed) return;
-			DebugLocation(747, 11);
-			// Hql.g:747:11: ( ( ESCqs )=> ESCqs |~ '\\'' )*
-			try { DebugEnterSubRule(3);
-			while (true)
-			{
-				int alt3=3;
-				try { DebugEnterDecision(3, false);
-				int LA3_1 = input.LA(1);
-
-				if ((LA3_1=='\''))
-				{
-					int LA3_2 = input.LA(2);
-
-					if ((LA3_2=='\'') && (EvaluatePredicate(synpred1_Hql_fragment)))
-					{
-						alt3 = 1;
-					}
-
-
-				}
-				else if (((LA3_1>='\u0000' && LA3_1<='&')||(LA3_1>='(' && LA3_1<='\uFFFF')))
-				{
-					alt3 = 2;
-				}
-
-
-				} finally { DebugExitDecision(3); }
-				switch ( alt3 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:747:13: ( ESCqs )=> ESCqs
-					{
-					DebugLocation(747, 23);
-					mESCqs(); if (state.failed) return;
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:747:31: ~ '\\''
-					{
-					DebugLocation(747, 31);
-					input.Consume();
-					state.failed=false;
-
-					}
-					break;
-
-				default:
-					goto loop3;
-				}
-			}
-
-			loop3:
-				;
-
-			} finally { DebugExitSubRule(3); }
-
-			DebugLocation(747, 40);
-			Match('\''); if (state.failed) return;
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("QUOTED_String", 95);
-			LeaveRule("QUOTED_String", 95);
-			LeaveRule_QUOTED_String();
-		}
-	}
-	// $ANTLR end "QUOTED_String"
-
-	partial void EnterRule_ESCqs();
-	partial void LeaveRule_ESCqs();
-
-	// $ANTLR start "ESCqs"
-	[GrammarRule("ESCqs")]
-	private void mESCqs()
-	{
-		EnterRule_ESCqs();
-		EnterRule("ESCqs", 96);
-		TraceIn("ESCqs", 96);
-		try
-		{
-			// Hql.g:753:2: ( '\\'' '\\'' )
-			DebugEnterAlt(1);
-			// Hql.g:754:3: '\\'' '\\''
-			{
-			DebugLocation(754, 3);
-			Match('\''); if (state.failed) return;
-			DebugLocation(754, 8);
-			Match('\''); if (state.failed) return;
-
-			}
-
-		}
-		finally
-		{
-			TraceOut("ESCqs", 96);
-			LeaveRule("ESCqs", 96);
-			LeaveRule_ESCqs();
-		}
-	}
-	// $ANTLR end "ESCqs"
-
-	partial void EnterRule_WS();
-	partial void LeaveRule_WS();
-
-	// $ANTLR start "WS"
-	[GrammarRule("WS")]
-	private void mWS()
-	{
-		EnterRule_WS();
-		EnterRule("WS", 97);
-		TraceIn("WS", 97);
-		try
-		{
-			int _type = WS;
-			int _channel = DefaultTokenChannel;
-			// Hql.g:756:5: ( ( ' ' | '\\t' | '\\r' '\\n' | '\\n' | '\\r' ) )
-			DebugEnterAlt(1);
-			// Hql.g:756:9: ( ' ' | '\\t' | '\\r' '\\n' | '\\n' | '\\r' )
-			{
-			DebugLocation(756, 9);
-			// Hql.g:756:9: ( ' ' | '\\t' | '\\r' '\\n' | '\\n' | '\\r' )
-			int alt4=5;
-			try { DebugEnterSubRule(4);
-			try { DebugEnterDecision(4, false);
-			switch (input.LA(1))
-			{
-			case ' ':
-				{
-				alt4 = 1;
-				}
-				break;
-			case '\t':
-				{
-				alt4 = 2;
-				}
-				break;
-			case '\r':
-				{
-				int LA4_2 = input.LA(2);
-
-				if ((LA4_2=='\n'))
-				{
-					alt4 = 3;
-				}
-				else
-				{
-					alt4 = 5;
-				}
-				}
-				break;
-			case '\n':
-				{
-				alt4 = 4;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 4, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(4); }
-			switch (alt4)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:756:13: ' '
-				{
-				DebugLocation(756, 13);
-				Match(' '); if (state.failed) return;
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:757:7: '\\t'
-				{
-				DebugLocation(757, 7);
-				Match('\t'); if (state.failed) return;
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// Hql.g:758:7: '\\r' '\\n'
-				{
-				DebugLocation(758, 7);
-				Match('\r'); if (state.failed) return;
-				DebugLocation(758, 12);
-				Match('\n'); if (state.failed) return;
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// Hql.g:759:7: '\\n'
-				{
-				DebugLocation(759, 7);
-				Match('\n'); if (state.failed) return;
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// Hql.g:760:7: '\\r'
-				{
-				DebugLocation(760, 7);
-				Match('\r'); if (state.failed) return;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(4); }
-
-			DebugLocation(762, 3);
-			if (state.backtracking == 0)
-			{
-				Skip();
-			}
-
-			}
-
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("WS", 97);
-			LeaveRule("WS", 97);
-			LeaveRule_WS();
-		}
-	}
-	// $ANTLR end "WS"
-
-	partial void EnterRule_NUM_INT();
-	partial void LeaveRule_NUM_INT();
-
-	// $ANTLR start "NUM_INT"
-	[GrammarRule("NUM_INT")]
-	private void mNUM_INT()
-	{
-		EnterRule_NUM_INT();
-		EnterRule("NUM_INT", 98);
-		TraceIn("NUM_INT", 98);
-		try
-		{
-			int _type = NUM_INT;
-			int _channel = DefaultTokenChannel;
-			CommonToken f1 = default(CommonToken);
-			CommonToken f2 = default(CommonToken);
-			CommonToken f3 = default(CommonToken);
-			CommonToken f4 = default(CommonToken);
-
-			bool isDecimal=false; IToken t=null;
-			// Hql.g:769:2: ( '.' ( ( '0' .. '9' )+ ( EXPONENT )? (f1= FLOAT_SUFFIX )? )? | ( '0' ( ( 'x' ) ( HEX_DIGIT )+ | ( '0' .. '7' )+ )? | ( '1' .. '9' ) ( '0' .. '9' )* ) ( ( 'l' ) |{...}? ( '.' ( '0' .. '9' )* ( EXPONENT )? (f2= FLOAT_SUFFIX )? | EXPONENT (f3= FLOAT_SUFFIX )? |f4= FLOAT_SUFFIX ) )? )
-			int alt20=2;
-			try { DebugEnterDecision(20, false);
-			int LA20_1 = input.LA(1);
-
-			if ((LA20_1=='.'))
-			{
-				alt20 = 1;
-			}
-			else if (((LA20_1>='0' && LA20_1<='9')))
-			{
-				alt20 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 20, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(20); }
-			switch (alt20)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:769:6: '.' ( ( '0' .. '9' )+ ( EXPONENT )? (f1= FLOAT_SUFFIX )? )?
-				{
-				DebugLocation(769, 6);
-				Match('.'); if (state.failed) return;
-				DebugLocation(769, 10);
-				if (state.backtracking == 0)
-				{
-					_type = DOT;
-				}
-				DebugLocation(770, 4);
-				// Hql.g:770:4: ( ( '0' .. '9' )+ ( EXPONENT )? (f1= FLOAT_SUFFIX )? )?
-				int alt8=2;
-				try { DebugEnterSubRule(8);
-				try { DebugEnterDecision(8, false);
-				int LA8_1 = input.LA(1);
-
-				if (((LA8_1>='0' && LA8_1<='9')))
-				{
-					alt8 = 1;
-				}
-				} finally { DebugExitDecision(8); }
-				switch (alt8)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:770:6: ( '0' .. '9' )+ ( EXPONENT )? (f1= FLOAT_SUFFIX )?
-					{
-					DebugLocation(770, 6);
-					// Hql.g:770:6: ( '0' .. '9' )+
-					int cnt5=0;
-					try { DebugEnterSubRule(5);
-					while (true)
-					{
-						int alt5=2;
-						try { DebugEnterDecision(5, false);
-						int LA5_1 = input.LA(1);
-
-						if (((LA5_1>='0' && LA5_1<='9')))
-						{
-							alt5 = 1;
-						}
-
-
-						} finally { DebugExitDecision(5); }
-						switch (alt5)
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// Hql.g:
-							{
-							DebugLocation(770, 6);
-							input.Consume();
-							state.failed=false;
-
-							}
-							break;
-
-						default:
-							if (cnt5 >= 1)
-								goto loop5;
-
-							if (state.backtracking>0) {state.failed=true; return;}
-							EarlyExitException eee5 = new EarlyExitException( 5, input );
-							DebugRecognitionException(eee5);
-							throw eee5;
-						}
-						cnt5++;
-					}
-					loop5:
-						;
-
-					} finally { DebugExitSubRule(5); }
-
-					DebugLocation(770, 18);
-					// Hql.g:770:18: ( EXPONENT )?
-					int alt6=2;
-					try { DebugEnterSubRule(6);
-					try { DebugEnterDecision(6, false);
-					int LA6_1 = input.LA(1);
-
-					if ((LA6_1=='e'))
-					{
-						alt6 = 1;
-					}
-					} finally { DebugExitDecision(6); }
-					switch (alt6)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:770:19: EXPONENT
-						{
-						DebugLocation(770, 19);
-						mEXPONENT(); if (state.failed) return;
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(6); }
-
-					DebugLocation(770, 30);
-					// Hql.g:770:30: (f1= FLOAT_SUFFIX )?
-					int alt7=2;
-					try { DebugEnterSubRule(7);
-					try { DebugEnterDecision(7, false);
-					int LA7_1 = input.LA(1);
-
-					if ((LA7_1=='d'||LA7_1=='f'||LA7_1=='m'))
-					{
-						alt7 = 1;
-					}
-					} finally { DebugExitDecision(7); }
-					switch (alt7)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:770:31: f1= FLOAT_SUFFIX
-						{
-						DebugLocation(770, 33);
-						int f1Start992 = CharIndex;
-						int f1StartLine992 = Line;
-						int f1StartCharPos992 = CharPositionInLine;
-						mFLOAT_SUFFIX(); if (state.failed) return;
-						f1 = new CommonToken(input, TokenTypes.Invalid, TokenChannels.Default, f1Start992, CharIndex-1);
-						f1.Line = f1StartLine992;
-						f1.CharPositionInLine = f1StartCharPos992;
-						DebugLocation(770, 47);
-						if (state.backtracking == 0)
-						{
-							t=f1;
-						}
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(7); }
-
-					DebugLocation(771, 5);
-					if (state.backtracking == 0)
-					{
-
-											if (t != null && t.Text.ToUpperInvariant().IndexOf('F')>=0)
-											{
-												_type = NUM_FLOAT;
-											}
-											else if (t != null && t.Text.ToUpperInvariant().IndexOf('M')>=0)
-											{
-												_type = NUM_DECIMAL;
-											}
-											else
-											{
-												_type = NUM_DOUBLE; // assume double
-											}
-										
-					}
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(8); }
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:786:4: ( '0' ( ( 'x' ) ( HEX_DIGIT )+ | ( '0' .. '7' )+ )? | ( '1' .. '9' ) ( '0' .. '9' )* ) ( ( 'l' ) |{...}? ( '.' ( '0' .. '9' )* ( EXPONENT )? (f2= FLOAT_SUFFIX )? | EXPONENT (f3= FLOAT_SUFFIX )? |f4= FLOAT_SUFFIX ) )?
-				{
-				DebugLocation(786, 4);
-				// Hql.g:786:4: ( '0' ( ( 'x' ) ( HEX_DIGIT )+ | ( '0' .. '7' )+ )? | ( '1' .. '9' ) ( '0' .. '9' )* )
-				int alt13=2;
-				try { DebugEnterSubRule(13);
-				try { DebugEnterDecision(13, false);
-				int LA13_1 = input.LA(1);
-
-				if ((LA13_1=='0'))
-				{
-					alt13 = 1;
-				}
-				else if (((LA13_1>='1' && LA13_1<='9')))
-				{
-					alt13 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 13, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				} finally { DebugExitDecision(13); }
-				switch (alt13)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:786:6: '0' ( ( 'x' ) ( HEX_DIGIT )+ | ( '0' .. '7' )+ )?
-					{
-					DebugLocation(786, 6);
-					Match('0'); if (state.failed) return;
-					DebugLocation(786, 10);
-					if (state.backtracking == 0)
-					{
-						isDecimal = true;
-					}
-					DebugLocation(787, 4);
-					// Hql.g:787:4: ( ( 'x' ) ( HEX_DIGIT )+ | ( '0' .. '7' )+ )?
-					int alt11=3;
-					try { DebugEnterSubRule(11);
-					try { DebugEnterDecision(11, false);
-					int LA11_1 = input.LA(1);
-
-					if ((LA11_1=='x'))
-					{
-						alt11 = 1;
-					}
-					else if (((LA11_1>='0' && LA11_1<='7')))
-					{
-						alt11 = 2;
-					}
-					} finally { DebugExitDecision(11); }
-					switch (alt11)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:787:6: ( 'x' ) ( HEX_DIGIT )+
-						{
-						DebugLocation(787, 6);
-						// Hql.g:787:6: ( 'x' )
-						DebugEnterAlt(1);
-						// Hql.g:787:7: 'x'
-						{
-						DebugLocation(787, 7);
-						Match('x'); if (state.failed) return;
-
-						}
-
-						DebugLocation(788, 5);
-						// Hql.g:788:5: ( HEX_DIGIT )+
-						int cnt9=0;
-						try { DebugEnterSubRule(9);
-						while (true)
-						{
-							int alt9=2;
-							try { DebugEnterDecision(9, false);
-							switch (input.LA(1))
-							{
-							case 'e':
-								{
-								int LA9_2 = input.LA(2);
-
-								if (((LA9_2>='0' && LA9_2<='9')))
-								{
-									int LA9_3 = input.LA(3);
-
-									if ((!(((isDecimal)))))
-									{
-										alt9 = 1;
-									}
-
-
-								}
-
-								else
-								{
-									alt9 = 1;
-								}
-
-
-								}
-								break;
-							case 'd':
-							case 'f':
-								{
-								int LA9_2 = input.LA(2);
-
-								if ((!(((isDecimal)))))
-								{
-									alt9 = 1;
-								}
-
-
-								}
-								break;
-							case '0':
-							case '1':
-							case '2':
-							case '3':
-							case '4':
-							case '5':
-							case '6':
-							case '7':
-							case '8':
-							case '9':
-							case 'a':
-							case 'b':
-							case 'c':
-								{
-								alt9 = 1;
-								}
-								break;
-							}
-
-							} finally { DebugExitDecision(9); }
-							switch (alt9)
-							{
-							case 1:
-								DebugEnterAlt(1);
-								// Hql.g:
-								{
-								DebugLocation(788, 5);
-								input.Consume();
-								state.failed=false;
-
-								}
-								break;
-
-							default:
-								if (cnt9 >= 1)
-									goto loop9;
-
-								if (state.backtracking>0) {state.failed=true; return;}
-								EarlyExitException eee9 = new EarlyExitException( 9, input );
-								DebugRecognitionException(eee9);
-								throw eee9;
-							}
-							cnt9++;
-						}
-						loop9:
-							;
-
-						} finally { DebugExitSubRule(9); }
-
-
-						}
-						break;
-					case 2:
-						DebugEnterAlt(2);
-						// Hql.g:797:6: ( '0' .. '7' )+
-						{
-						DebugLocation(797, 6);
-						// Hql.g:797:6: ( '0' .. '7' )+
-						int cnt10=0;
-						try { DebugEnterSubRule(10);
-						while (true)
-						{
-							int alt10=2;
-							try { DebugEnterDecision(10, false);
-							int LA10_1 = input.LA(1);
-
-							if (((LA10_1>='0' && LA10_1<='7')))
-							{
-								alt10 = 1;
-							}
-
-
-							} finally { DebugExitDecision(10); }
-							switch (alt10)
-							{
-							case 1:
-								DebugEnterAlt(1);
-								// Hql.g:
-								{
-								DebugLocation(797, 6);
-								input.Consume();
-								state.failed=false;
-
-								}
-								break;
-
-							default:
-								if (cnt10 >= 1)
-									goto loop10;
-
-								if (state.backtracking>0) {state.failed=true; return;}
-								EarlyExitException eee10 = new EarlyExitException( 10, input );
-								DebugRecognitionException(eee10);
-								throw eee10;
-							}
-							cnt10++;
-						}
-						loop10:
-							;
-
-						} finally { DebugExitSubRule(10); }
-
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(11); }
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:799:5: ( '1' .. '9' ) ( '0' .. '9' )*
-					{
-					DebugLocation(799, 5);
-					input.Consume();
-					state.failed=false;
-					DebugLocation(799, 16);
-					// Hql.g:799:16: ( '0' .. '9' )*
-					try { DebugEnterSubRule(12);
-					while (true)
-					{
-						int alt12=2;
-						try { DebugEnterDecision(12, false);
-						int LA12_1 = input.LA(1);
-
-						if (((LA12_1>='0' && LA12_1<='9')))
-						{
-							alt12 = 1;
-						}
-
-
-						} finally { DebugExitDecision(12); }
-						switch ( alt12 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// Hql.g:
-							{
-							DebugLocation(799, 16);
-							input.Consume();
-							state.failed=false;
-
-							}
-							break;
-
-						default:
-							goto loop12;
-						}
-					}
-
-					loop12:
-						;
-
-					} finally { DebugExitSubRule(12); }
-
-					DebugLocation(799, 29);
-					if (state.backtracking == 0)
-					{
-						isDecimal=true;
-					}
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(13); }
-
-				DebugLocation(801, 3);
-				// Hql.g:801:3: ( ( 'l' ) |{...}? ( '.' ( '0' .. '9' )* ( EXPONENT )? (f2= FLOAT_SUFFIX )? | EXPONENT (f3= FLOAT_SUFFIX )? |f4= FLOAT_SUFFIX ) )?
-				int alt19=3;
-				try { DebugEnterSubRule(19);
-				try { DebugEnterDecision(19, false);
-				int LA19_1 = input.LA(1);
-
-				if ((LA19_1=='l'))
-				{
-					alt19 = 1;
-				}
-				else if ((LA19_1=='.'||(LA19_1>='d' && LA19_1<='f')||LA19_1=='m'))
-				{
-					alt19 = 2;
-				}
-				} finally { DebugExitDecision(19); }
-				switch (alt19)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:801:5: ( 'l' )
-					{
-					DebugLocation(801, 5);
-					// Hql.g:801:5: ( 'l' )
-					DebugEnterAlt(1);
-					// Hql.g:801:6: 'l'
-					{
-					DebugLocation(801, 6);
-					Match('l'); if (state.failed) return;
-
-					}
-
-					DebugLocation(801, 11);
-					if (state.backtracking == 0)
-					{
-						 _type = NUM_LONG; 
-					}
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:804:5: {...}? ( '.' ( '0' .. '9' )* ( EXPONENT )? (f2= FLOAT_SUFFIX )? | EXPONENT (f3= FLOAT_SUFFIX )? |f4= FLOAT_SUFFIX )
-					{
-					DebugLocation(804, 5);
-					if (!((isDecimal)))
-					{
-						if (state.backtracking>0) {state.failed=true; return;}
-						throw new FailedPredicateException(input, "NUM_INT", "isDecimal");
-					}
-					DebugLocation(805, 4);
-					// Hql.g:805:4: ( '.' ( '0' .. '9' )* ( EXPONENT )? (f2= FLOAT_SUFFIX )? | EXPONENT (f3= FLOAT_SUFFIX )? |f4= FLOAT_SUFFIX )
-					int alt18=3;
-					try { DebugEnterSubRule(18);
-					try { DebugEnterDecision(18, false);
-					switch (input.LA(1))
-					{
-					case '.':
-						{
-						alt18 = 1;
-						}
-						break;
-					case 'e':
-						{
-						alt18 = 2;
-						}
-						break;
-					case 'd':
-					case 'f':
-					case 'm':
-						{
-						alt18 = 3;
-						}
-						break;
-					default:
-						{
-							if (state.backtracking>0) {state.failed=true; return;}
-							NoViableAltException nvae = new NoViableAltException("", 18, 0, input, 1);
-							DebugRecognitionException(nvae);
-							throw nvae;
-						}
-					}
-
-					} finally { DebugExitDecision(18); }
-					switch (alt18)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:805:8: '.' ( '0' .. '9' )* ( EXPONENT )? (f2= FLOAT_SUFFIX )?
-						{
-						DebugLocation(805, 8);
-						Match('.'); if (state.failed) return;
-						DebugLocation(805, 12);
-						// Hql.g:805:12: ( '0' .. '9' )*
-						try { DebugEnterSubRule(14);
-						while (true)
-						{
-							int alt14=2;
-							try { DebugEnterDecision(14, false);
-							int LA14_1 = input.LA(1);
-
-							if (((LA14_1>='0' && LA14_1<='9')))
-							{
-								alt14 = 1;
-							}
-
-
-							} finally { DebugExitDecision(14); }
-							switch ( alt14 )
-							{
-							case 1:
-								DebugEnterAlt(1);
-								// Hql.g:
-								{
-								DebugLocation(805, 12);
-								input.Consume();
-								state.failed=false;
-
-								}
-								break;
-
-							default:
-								goto loop14;
-							}
-						}
-
-						loop14:
-							;
-
-						} finally { DebugExitSubRule(14); }
-
-						DebugLocation(805, 24);
-						// Hql.g:805:24: ( EXPONENT )?
-						int alt15=2;
-						try { DebugEnterSubRule(15);
-						try { DebugEnterDecision(15, false);
-						int LA15_1 = input.LA(1);
-
-						if ((LA15_1=='e'))
-						{
-							alt15 = 1;
-						}
-						} finally { DebugExitDecision(15); }
-						switch (alt15)
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// Hql.g:805:25: EXPONENT
-							{
-							DebugLocation(805, 25);
-							mEXPONENT(); if (state.failed) return;
-
-							}
-							break;
-
-						}
-						} finally { DebugExitSubRule(15); }
-
-						DebugLocation(805, 36);
-						// Hql.g:805:36: (f2= FLOAT_SUFFIX )?
-						int alt16=2;
-						try { DebugEnterSubRule(16);
-						try { DebugEnterDecision(16, false);
-						int LA16_1 = input.LA(1);
-
-						if ((LA16_1=='d'||LA16_1=='f'||LA16_1=='m'))
-						{
-							alt16 = 1;
-						}
-						} finally { DebugExitDecision(16); }
-						switch (alt16)
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// Hql.g:805:37: f2= FLOAT_SUFFIX
-							{
-							DebugLocation(805, 39);
-							int f2Start1194 = CharIndex;
-							int f2StartLine1194 = Line;
-							int f2StartCharPos1194 = CharPositionInLine;
-							mFLOAT_SUFFIX(); if (state.failed) return;
-							f2 = new CommonToken(input, TokenTypes.Invalid, TokenChannels.Default, f2Start1194, CharIndex-1);
-							f2.Line = f2StartLine1194;
-							f2.CharPositionInLine = f2StartCharPos1194;
-							DebugLocation(805, 53);
-							if (state.backtracking == 0)
-							{
-								t=f2;
-							}
-
-							}
-							break;
-
-						}
-						} finally { DebugExitSubRule(16); }
-
-
-						}
-						break;
-					case 2:
-						DebugEnterAlt(2);
-						// Hql.g:806:8: EXPONENT (f3= FLOAT_SUFFIX )?
-						{
-						DebugLocation(806, 8);
-						mEXPONENT(); if (state.failed) return;
-						DebugLocation(806, 17);
-						// Hql.g:806:17: (f3= FLOAT_SUFFIX )?
-						int alt17=2;
-						try { DebugEnterSubRule(17);
-						try { DebugEnterDecision(17, false);
-						int LA17_1 = input.LA(1);
-
-						if ((LA17_1=='d'||LA17_1=='f'||LA17_1=='m'))
-						{
-							alt17 = 1;
-						}
-						} finally { DebugExitDecision(17); }
-						switch (alt17)
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// Hql.g:806:18: f3= FLOAT_SUFFIX
-							{
-							DebugLocation(806, 20);
-							int f3Start1212 = CharIndex;
-							int f3StartLine1212 = Line;
-							int f3StartCharPos1212 = CharPositionInLine;
-							mFLOAT_SUFFIX(); if (state.failed) return;
-							f3 = new CommonToken(input, TokenTypes.Invalid, TokenChannels.Default, f3Start1212, CharIndex-1);
-							f3.Line = f3StartLine1212;
-							f3.CharPositionInLine = f3StartCharPos1212;
-							DebugLocation(806, 34);
-							if (state.backtracking == 0)
-							{
-								t=f3;
-							}
-
-							}
-							break;
-
-						}
-						} finally { DebugExitSubRule(17); }
-
-
-						}
-						break;
-					case 3:
-						DebugEnterAlt(3);
-						// Hql.g:807:8: f4= FLOAT_SUFFIX
-						{
-						DebugLocation(807, 10);
-						int f4Start1227 = CharIndex;
-						int f4StartLine1227 = Line;
-						int f4StartCharPos1227 = CharPositionInLine;
-						mFLOAT_SUFFIX(); if (state.failed) return;
-						f4 = new CommonToken(input, TokenTypes.Invalid, TokenChannels.Default, f4Start1227, CharIndex-1);
-						f4.Line = f4StartLine1227;
-						f4.CharPositionInLine = f4StartCharPos1227;
-						DebugLocation(807, 24);
-						if (state.backtracking == 0)
-						{
-							t=f4;
-						}
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(18); }
-
-					DebugLocation(809, 4);
-					if (state.backtracking == 0)
-					{
-
-										if (t != null && t.Text.ToUpperInvariant().IndexOf('F') >= 0)
-										{
-											_type = NUM_FLOAT;
-										}
-										else if (t != null && t.Text.ToUpperInvariant().IndexOf('M')>=0)
-										{
-											_type = NUM_DECIMAL;
-										}
-										else
-										{
-											_type = NUM_DOUBLE; // assume double
-										}
-									
-					}
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(19); }
-
-
-				}
-				break;
-
-			}
-			state.type = _type;
-			state.channel = _channel;
-		}
-		finally
-		{
-			TraceOut("NUM_INT", 98);
-			LeaveRule("NUM_INT", 98);
-			LeaveRule_NUM_INT();
-		}
-	}
-	// $ANTLR end "NUM_INT"
-
-	partial void EnterRule_HEX_DIGIT();
-	partial void LeaveRule_HEX_DIGIT();
-
-	// $ANTLR start "HEX_DIGIT"
-	[GrammarRule("HEX_DIGIT")]
-	private void mHEX_DIGIT()
-	{
-		EnterRule_HEX_DIGIT();
-		EnterRule("HEX_DIGIT", 99);
-		TraceIn("HEX_DIGIT", 99);
-		try
-		{
-			// Hql.g:830:2: ( ( '0' .. '9' | 'a' .. 'f' ) )
-			DebugEnterAlt(1);
-			// Hql.g:
-			{
-			DebugLocation(830, 2);
-			if ((input.LA(1)>='0' && input.LA(1)<='9')||(input.LA(1)>='a' && input.LA(1)<='f'))
-			{
-				input.Consume();
-			state.failed=false;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				MismatchedSetException mse = new MismatchedSetException(null,input);
-				DebugRecognitionException(mse);
-				Recover(mse);
-				throw mse;
-			}
-
-
-			}
-
-		}
-		finally
-		{
-			TraceOut("HEX_DIGIT", 99);
-			LeaveRule("HEX_DIGIT", 99);
-			LeaveRule_HEX_DIGIT();
-		}
-	}
-	// $ANTLR end "HEX_DIGIT"
-
-	partial void EnterRule_EXPONENT();
-	partial void LeaveRule_EXPONENT();
-
-	// $ANTLR start "EXPONENT"
-	[GrammarRule("EXPONENT")]
-	private void mEXPONENT()
-	{
-		EnterRule_EXPONENT();
-		EnterRule("EXPONENT", 100);
-		TraceIn("EXPONENT", 100);
-		try
-		{
-			// Hql.g:836:2: ( ( 'e' ) ( '+' | '-' )? ( '0' .. '9' )+ )
-			DebugEnterAlt(1);
-			// Hql.g:836:4: ( 'e' ) ( '+' | '-' )? ( '0' .. '9' )+
-			{
-			DebugLocation(836, 4);
-			// Hql.g:836:4: ( 'e' )
-			DebugEnterAlt(1);
-			// Hql.g:836:5: 'e'
-			{
-			DebugLocation(836, 5);
-			Match('e'); if (state.failed) return;
-
-			}
-
-			DebugLocation(836, 10);
-			// Hql.g:836:10: ( '+' | '-' )?
-			int alt21=2;
-			try { DebugEnterSubRule(21);
-			try { DebugEnterDecision(21, false);
-			int LA21_1 = input.LA(1);
-
-			if ((LA21_1=='+'||LA21_1=='-'))
-			{
-				alt21 = 1;
-			}
-			} finally { DebugExitDecision(21); }
-			switch (alt21)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:
-				{
-				DebugLocation(836, 10);
-				input.Consume();
-				state.failed=false;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(21); }
-
-			DebugLocation(836, 21);
-			// Hql.g:836:21: ( '0' .. '9' )+
-			int cnt22=0;
-			try { DebugEnterSubRule(22);
-			while (true)
-			{
-				int alt22=2;
-				try { DebugEnterDecision(22, false);
-				int LA22_1 = input.LA(1);
-
-				if (((LA22_1>='0' && LA22_1<='9')))
-				{
-					alt22 = 1;
-				}
-
-
-				} finally { DebugExitDecision(22); }
-				switch (alt22)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:
-					{
-					DebugLocation(836, 21);
-					input.Consume();
-					state.failed=false;
-
-					}
-					break;
-
-				default:
-					if (cnt22 >= 1)
-						goto loop22;
-
-					if (state.backtracking>0) {state.failed=true; return;}
-					EarlyExitException eee22 = new EarlyExitException( 22, input );
-					DebugRecognitionException(eee22);
-					throw eee22;
-				}
-				cnt22++;
-			}
-			loop22:
-				;
-
-			} finally { DebugExitSubRule(22); }
-
-
-			}
-
-		}
-		finally
-		{
-			TraceOut("EXPONENT", 100);
-			LeaveRule("EXPONENT", 100);
-			LeaveRule_EXPONENT();
-		}
-	}
-	// $ANTLR end "EXPONENT"
-
-	partial void EnterRule_FLOAT_SUFFIX();
-	partial void LeaveRule_FLOAT_SUFFIX();
-
-	// $ANTLR start "FLOAT_SUFFIX"
-	[GrammarRule("FLOAT_SUFFIX")]
-	private void mFLOAT_SUFFIX()
-	{
-		EnterRule_FLOAT_SUFFIX();
-		EnterRule("FLOAT_SUFFIX", 101);
-		TraceIn("FLOAT_SUFFIX", 101);
-		try
-		{
-			// Hql.g:841:2: ( 'f' | 'd' | 'm' )
-			DebugEnterAlt(1);
-			// Hql.g:
-			{
-			DebugLocation(841, 2);
-			if (input.LA(1)=='d'||input.LA(1)=='f'||input.LA(1)=='m')
-			{
-				input.Consume();
-			state.failed=false;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				MismatchedSetException mse = new MismatchedSetException(null,input);
-				DebugRecognitionException(mse);
-				Recover(mse);
-				throw mse;
-			}
-
-
-			}
-
-		}
-		finally
-		{
-			TraceOut("FLOAT_SUFFIX", 101);
-			LeaveRule("FLOAT_SUFFIX", 101);
-			LeaveRule_FLOAT_SUFFIX();
-		}
-	}
-	// $ANTLR end "FLOAT_SUFFIX"
-
-	public override void mTokens()
-	{
-		// Hql.g:1:8: ( ALL | AND | ANY | AS | ASCENDING | AVG | BETWEEN | BOTH | CASE | CLASS | COUNT | DELETE | DESCENDING | DISTINCT | ELEMENTS | ELSE | EMPTY | END | ESCAPE | EXISTS | FALSE | FETCH | FROM | FULL | GROUP | HAVING | IN | INDICES | INNER | INSERT | INTO | IS | JOIN | LEADING | LEFT | LIKE | LITERAL_by | MAX | MEMBER | MIN | NEW | NOT | NULL | OBJECT | OF | ON | OR | ORDER | OUTER | PROPERTIES | RIGHT | SELECT | SET | SKIP | SOME | SUM | TAKE | THEN | TRAILING | TRUE | UNION | UPDATE | VERSIONED | WHEN | WHERE | WITH | T__133 | T__134 | EQ | LT | GT | SQL_NE | NE | LE | GE | BOR | BXOR | BAND | BNOT | COMMA | OPEN | CLOSE | OPEN_BRACKET | CLOSE_BRACKET | CONCAT | PLUS | MINUS | STAR | DIV | COLON | PARAM | IDENT | QUOTED_String | WS | NUM_INT )
-		int alt23=95;
-		try { DebugEnterDecision(23, false);
-		try
-		{
-			alt23 = dfa23.Predict(input);
-		}
-		catch (NoViableAltException nvae)
-		{
-			DebugRecognitionException(nvae);
-			throw;
-		}
-		} finally { DebugExitDecision(23); }
-		switch (alt23)
-		{
-		case 1:
-			DebugEnterAlt(1);
-			// Hql.g:1:10: ALL
-			{
-			DebugLocation(1, 10);
-			mALL(); if (state.failed) return;
-
-			}
-			break;
-		case 2:
-			DebugEnterAlt(2);
-			// Hql.g:1:14: AND
-			{
-			DebugLocation(1, 14);
-			mAND(); if (state.failed) return;
-
-			}
-			break;
-		case 3:
-			DebugEnterAlt(3);
-			// Hql.g:1:18: ANY
-			{
-			DebugLocation(1, 18);
-			mANY(); if (state.failed) return;
-
-			}
-			break;
-		case 4:
-			DebugEnterAlt(4);
-			// Hql.g:1:22: AS
-			{
-			DebugLocation(1, 22);
-			mAS(); if (state.failed) return;
-
-			}
-			break;
-		case 5:
-			DebugEnterAlt(5);
-			// Hql.g:1:25: ASCENDING
-			{
-			DebugLocation(1, 25);
-			mASCENDING(); if (state.failed) return;
-
-			}
-			break;
-		case 6:
-			DebugEnterAlt(6);
-			// Hql.g:1:35: AVG
-			{
-			DebugLocation(1, 35);
-			mAVG(); if (state.failed) return;
-
-			}
-			break;
-		case 7:
-			DebugEnterAlt(7);
-			// Hql.g:1:39: BETWEEN
-			{
-			DebugLocation(1, 39);
-			mBETWEEN(); if (state.failed) return;
-
-			}
-			break;
-		case 8:
-			DebugEnterAlt(8);
-			// Hql.g:1:47: BOTH
-			{
-			DebugLocation(1, 47);
-			mBOTH(); if (state.failed) return;
-
-			}
-			break;
-		case 9:
-			DebugEnterAlt(9);
-			// Hql.g:1:52: CASE
-			{
-			DebugLocation(1, 52);
-			mCASE(); if (state.failed) return;
-
-			}
-			break;
-		case 10:
-			DebugEnterAlt(10);
-			// Hql.g:1:57: CLASS
-			{
-			DebugLocation(1, 57);
-			mCLASS(); if (state.failed) return;
-
-			}
-			break;
-		case 11:
-			DebugEnterAlt(11);
-			// Hql.g:1:63: COUNT
-			{
-			DebugLocation(1, 63);
-			mCOUNT(); if (state.failed) return;
-
-			}
-			break;
-		case 12:
-			DebugEnterAlt(12);
-			// Hql.g:1:69: DELETE
-			{
-			DebugLocation(1, 69);
-			mDELETE(); if (state.failed) return;
-
-			}
-			break;
-		case 13:
-			DebugEnterAlt(13);
-			// Hql.g:1:76: DESCENDING
-			{
-			DebugLocation(1, 76);
-			mDESCENDING(); if (state.failed) return;
-
-			}
-			break;
-		case 14:
-			DebugEnterAlt(14);
-			// Hql.g:1:87: DISTINCT
-			{
-			DebugLocation(1, 87);
-			mDISTINCT(); if (state.failed) return;
-
-			}
-			break;
-		case 15:
-			DebugEnterAlt(15);
-			// Hql.g:1:96: ELEMENTS
-			{
-			DebugLocation(1, 96);
-			mELEMENTS(); if (state.failed) return;
-
-			}
-			break;
-		case 16:
-			DebugEnterAlt(16);
-			// Hql.g:1:105: ELSE
-			{
-			DebugLocation(1, 105);
-			mELSE(); if (state.failed) return;
-
-			}
-			break;
-		case 17:
-			DebugEnterAlt(17);
-			// Hql.g:1:110: EMPTY
-			{
-			DebugLocation(1, 110);
-			mEMPTY(); if (state.failed) return;
-
-			}
-			break;
-		case 18:
-			DebugEnterAlt(18);
-			// Hql.g:1:116: END
-			{
-			DebugLocation(1, 116);
-			mEND(); if (state.failed) return;
-
-			}
-			break;
-		case 19:
-			DebugEnterAlt(19);
-			// Hql.g:1:120: ESCAPE
-			{
-			DebugLocation(1, 120);
-			mESCAPE(); if (state.failed) return;
-
-			}
-			break;
-		case 20:
-			DebugEnterAlt(20);
-			// Hql.g:1:127: EXISTS
-			{
-			DebugLocation(1, 127);
-			mEXISTS(); if (state.failed) return;
-
-			}
-			break;
-		case 21:
-			DebugEnterAlt(21);
-			// Hql.g:1:134: FALSE
-			{
-			DebugLocation(1, 134);
-			mFALSE(); if (state.failed) return;
-
-			}
-			break;
-		case 22:
-			DebugEnterAlt(22);
-			// Hql.g:1:140: FETCH
-			{
-			DebugLocation(1, 140);
-			mFETCH(); if (state.failed) return;
-
-			}
-			break;
-		case 23:
-			DebugEnterAlt(23);
-			// Hql.g:1:146: FROM
-			{
-			DebugLocation(1, 146);
-			mFROM(); if (state.failed) return;
-
-			}
-			break;
-		case 24:
-			DebugEnterAlt(24);
-			// Hql.g:1:151: FULL
-			{
-			DebugLocation(1, 151);
-			mFULL(); if (state.failed) return;
-
-			}
-			break;
-		case 25:
-			DebugEnterAlt(25);
-			// Hql.g:1:156: GROUP
-			{
-			DebugLocation(1, 156);
-			mGROUP(); if (state.failed) return;
-
-			}
-			break;
-		case 26:
-			DebugEnterAlt(26);
-			// Hql.g:1:162: HAVING
-			{
-			DebugLocation(1, 162);
-			mHAVING(); if (state.failed) return;
-
-			}
-			break;
-		case 27:
-			DebugEnterAlt(27);
-			// Hql.g:1:169: IN
-			{
-			DebugLocation(1, 169);
-			mIN(); if (state.failed) return;
-
-			}
-			break;
-		case 28:
-			DebugEnterAlt(28);
-			// Hql.g:1:172: INDICES
-			{
-			DebugLocation(1, 172);
-			mINDICES(); if (state.failed) return;
-
-			}
-			break;
-		case 29:
-			DebugEnterAlt(29);
-			// Hql.g:1:180: INNER
-			{
-			DebugLocation(1, 180);
-			mINNER(); if (state.failed) return;
-
-			}
-			break;
-		case 30:
-			DebugEnterAlt(30);
-			// Hql.g:1:186: INSERT
-			{
-			DebugLocation(1, 186);
-			mINSERT(); if (state.failed) return;
-
-			}
-			break;
-		case 31:
-			DebugEnterAlt(31);
-			// Hql.g:1:193: INTO
-			{
-			DebugLocation(1, 193);
-			mINTO(); if (state.failed) return;
-
-			}
-			break;
-		case 32:
-			DebugEnterAlt(32);
-			// Hql.g:1:198: IS
-			{
-			DebugLocation(1, 198);
-			mIS(); if (state.failed) return;
-
-			}
-			break;
-		case 33:
-			DebugEnterAlt(33);
-			// Hql.g:1:201: JOIN
-			{
-			DebugLocation(1, 201);
-			mJOIN(); if (state.failed) return;
-
-			}
-			break;
-		case 34:
-			DebugEnterAlt(34);
-			// Hql.g:1:206: LEADING
-			{
-			DebugLocation(1, 206);
-			mLEADING(); if (state.failed) return;
-
-			}
-			break;
-		case 35:
-			DebugEnterAlt(35);
-			// Hql.g:1:214: LEFT
-			{
-			DebugLocation(1, 214);
-			mLEFT(); if (state.failed) return;
-
-			}
-			break;
-		case 36:
-			DebugEnterAlt(36);
-			// Hql.g:1:219: LIKE
-			{
-			DebugLocation(1, 219);
-			mLIKE(); if (state.failed) return;
-
-			}
-			break;
-		case 37:
-			DebugEnterAlt(37);
-			// Hql.g:1:224: LITERAL_by
-			{
-			DebugLocation(1, 224);
-			mLITERAL_by(); if (state.failed) return;
-
-			}
-			break;
-		case 38:
-			DebugEnterAlt(38);
-			// Hql.g:1:235: MAX
-			{
-			DebugLocation(1, 235);
-			mMAX(); if (state.failed) return;
-
-			}
-			break;
-		case 39:
-			DebugEnterAlt(39);
-			// Hql.g:1:239: MEMBER
-			{
-			DebugLocation(1, 239);
-			mMEMBER(); if (state.failed) return;
-
-			}
-			break;
-		case 40:
-			DebugEnterAlt(40);
-			// Hql.g:1:246: MIN
-			{
-			DebugLocation(1, 246);
-			mMIN(); if (state.failed) return;
-
-			}
-			break;
-		case 41:
-			DebugEnterAlt(41);
-			// Hql.g:1:250: NEW
-			{
-			DebugLocation(1, 250);
-			mNEW(); if (state.failed) return;
-
-			}
-			break;
-		case 42:
-			DebugEnterAlt(42);
-			// Hql.g:1:254: NOT
-			{
-			DebugLocation(1, 254);
-			mNOT(); if (state.failed) return;
-
-			}
-			break;
-		case 43:
-			DebugEnterAlt(43);
-			// Hql.g:1:258: NULL
-			{
-			DebugLocation(1, 258);
-			mNULL(); if (state.failed) return;
-
-			}
-			break;
-		case 44:
-			DebugEnterAlt(44);
-			// Hql.g:1:263: OBJECT
-			{
-			DebugLocation(1, 263);
-			mOBJECT(); if (state.failed) return;
-
-			}
-			break;
-		case 45:
-			DebugEnterAlt(45);
-			// Hql.g:1:270: OF
-			{
-			DebugLocation(1, 270);
-			mOF(); if (state.failed) return;
-
-			}
-			break;
-		case 46:
-			DebugEnterAlt(46);
-			// Hql.g:1:273: ON
-			{
-			DebugLocation(1, 273);
-			mON(); if (state.failed) return;
-
-			}
-			break;
-		case 47:
-			DebugEnterAlt(47);
-			// Hql.g:1:276: OR
-			{
-			DebugLocation(1, 276);
-			mOR(); if (state.failed) return;
-
-			}
-			break;
-		case 48:
-			DebugEnterAlt(48);
-			// Hql.g:1:279: ORDER
-			{
-			DebugLocation(1, 279);
-			mORDER(); if (state.failed) return;
-
-			}
-			break;
-		case 49:
-			DebugEnterAlt(49);
-			// Hql.g:1:285: OUTER
-			{
-			DebugLocation(1, 285);
-			mOUTER(); if (state.failed) return;
-
-			}
-			break;
-		case 50:
-			DebugEnterAlt(50);
-			// Hql.g:1:291: PROPERTIES
-			{
-			DebugLocation(1, 291);
-			mPROPERTIES(); if (state.failed) return;
-
-			}
-			break;
-		case 51:
-			DebugEnterAlt(51);
-			// Hql.g:1:302: RIGHT
-			{
-			DebugLocation(1, 302);
-			mRIGHT(); if (state.failed) return;
-
-			}
-			break;
-		case 52:
-			DebugEnterAlt(52);
-			// Hql.g:1:308: SELECT
-			{
-			DebugLocation(1, 308);
-			mSELECT(); if (state.failed) return;
-
-			}
-			break;
-		case 53:
-			DebugEnterAlt(53);
-			// Hql.g:1:315: SET
-			{
-			DebugLocation(1, 315);
-			mSET(); if (state.failed) return;
-
-			}
-			break;
-		case 54:
-			DebugEnterAlt(54);
-			// Hql.g:1:319: SKIP
-			{
-			DebugLocation(1, 319);
-			mSKIP(); if (state.failed) return;
-
-			}
-			break;
-		case 55:
-			DebugEnterAlt(55);
-			// Hql.g:1:324: SOME
-			{
-			DebugLocation(1, 324);
-			mSOME(); if (state.failed) return;
-
-			}
-			break;
-		case 56:
-			DebugEnterAlt(56);
-			// Hql.g:1:329: SUM
-			{
-			DebugLocation(1, 329);
-			mSUM(); if (state.failed) return;
-
-			}
-			break;
-		case 57:
-			DebugEnterAlt(57);
-			// Hql.g:1:333: TAKE
-			{
-			DebugLocation(1, 333);
-			mTAKE(); if (state.failed) return;
-
-			}
-			break;
-		case 58:
-			DebugEnterAlt(58);
-			// Hql.g:1:338: THEN
-			{
-			DebugLocation(1, 338);
-			mTHEN(); if (state.failed) return;
-
-			}
-			break;
-		case 59:
-			DebugEnterAlt(59);
-			// Hql.g:1:343: TRAILING
-			{
-			DebugLocation(1, 343);
-			mTRAILING(); if (state.failed) return;
-
-			}
-			break;
-		case 60:
-			DebugEnterAlt(60);
-			// Hql.g:1:352: TRUE
-			{
-			DebugLocation(1, 352);
-			mTRUE(); if (state.failed) return;
-
-			}
-			break;
-		case 61:
-			DebugEnterAlt(61);
-			// Hql.g:1:357: UNION
-			{
-			DebugLocation(1, 357);
-			mUNION(); if (state.failed) return;
-
-			}
-			break;
-		case 62:
-			DebugEnterAlt(62);
-			// Hql.g:1:363: UPDATE
-			{
-			DebugLocation(1, 363);
-			mUPDATE(); if (state.failed) return;
-
-			}
-			break;
-		case 63:
-			DebugEnterAlt(63);
-			// Hql.g:1:370: VERSIONED
-			{
-			DebugLocation(1, 370);
-			mVERSIONED(); if (state.failed) return;
-
-			}
-			break;
-		case 64:
-			DebugEnterAlt(64);
-			// Hql.g:1:380: WHEN
-			{
-			DebugLocation(1, 380);
-			mWHEN(); if (state.failed) return;
-
-			}
-			break;
-		case 65:
-			DebugEnterAlt(65);
-			// Hql.g:1:385: WHERE
-			{
-			DebugLocation(1, 385);
-			mWHERE(); if (state.failed) return;
-
-			}
-			break;
-		case 66:
-			DebugEnterAlt(66);
-			// Hql.g:1:391: WITH
-			{
-			DebugLocation(1, 391);
-			mWITH(); if (state.failed) return;
-
-			}
-			break;
-		case 67:
-			DebugEnterAlt(67);
-			// Hql.g:1:396: T__133
-			{
-			DebugLocation(1, 396);
-			mT__133(); if (state.failed) return;
-
-			}
-			break;
-		case 68:
-			DebugEnterAlt(68);
-			// Hql.g:1:403: T__134
-			{
-			DebugLocation(1, 403);
-			mT__134(); if (state.failed) return;
-
-			}
-			break;
-		case 69:
-			DebugEnterAlt(69);
-			// Hql.g:1:410: EQ
-			{
-			DebugLocation(1, 410);
-			mEQ(); if (state.failed) return;
-
-			}
-			break;
-		case 70:
-			DebugEnterAlt(70);
-			// Hql.g:1:413: LT
-			{
-			DebugLocation(1, 413);
-			mLT(); if (state.failed) return;
-
-			}
-			break;
-		case 71:
-			DebugEnterAlt(71);
-			// Hql.g:1:416: GT
-			{
-			DebugLocation(1, 416);
-			mGT(); if (state.failed) return;
-
-			}
-			break;
-		case 72:
-			DebugEnterAlt(72);
-			// Hql.g:1:419: SQL_NE
-			{
-			DebugLocation(1, 419);
-			mSQL_NE(); if (state.failed) return;
-
-			}
-			break;
-		case 73:
-			DebugEnterAlt(73);
-			// Hql.g:1:426: NE
-			{
-			DebugLocation(1, 426);
-			mNE(); if (state.failed) return;
-
-			}
-			break;
-		case 74:
-			DebugEnterAlt(74);
-			// Hql.g:1:429: LE
-			{
-			DebugLocation(1, 429);
-			mLE(); if (state.failed) return;
-
-			}
-			break;
-		case 75:
-			DebugEnterAlt(75);
-			// Hql.g:1:432: GE
-			{
-			DebugLocation(1, 432);
-			mGE(); if (state.failed) return;
-
-			}
-			break;
-		case 76:
-			DebugEnterAlt(76);
-			// Hql.g:1:435: BOR
-			{
-			DebugLocation(1, 435);
-			mBOR(); if (state.failed) return;
-
-			}
-			break;
-		case 77:
-			DebugEnterAlt(77);
-			// Hql.g:1:439: BXOR
-			{
-			DebugLocation(1, 439);
-			mBXOR(); if (state.failed) return;
-
-			}
-			break;
-		case 78:
-			DebugEnterAlt(78);
-			// Hql.g:1:444: BAND
-			{
-			DebugLocation(1, 444);
-			mBAND(); if (state.failed) return;
-
-			}
-			break;
-		case 79:
-			DebugEnterAlt(79);
-			// Hql.g:1:449: BNOT
-			{
-			DebugLocation(1, 449);
-			mBNOT(); if (state.failed) return;
-
-			}
-			break;
-		case 80:
-			DebugEnterAlt(80);
-			// Hql.g:1:454: COMMA
-			{
-			DebugLocation(1, 454);
-			mCOMMA(); if (state.failed) return;
-
-			}
-			break;
-		case 81:
-			DebugEnterAlt(81);
-			// Hql.g:1:460: OPEN
-			{
-			DebugLocation(1, 460);
-			mOPEN(); if (state.failed) return;
-
-			}
-			break;
-		case 82:
-			DebugEnterAlt(82);
-			// Hql.g:1:465: CLOSE
-			{
-			DebugLocation(1, 465);
-			mCLOSE(); if (state.failed) return;
-
-			}
-			break;
-		case 83:
-			DebugEnterAlt(83);
-			// Hql.g:1:471: OPEN_BRACKET
-			{
-			DebugLocation(1, 471);
-			mOPEN_BRACKET(); if (state.failed) return;
-
-			}
-			break;
-		case 84:
-			DebugEnterAlt(84);
-			// Hql.g:1:484: CLOSE_BRACKET
-			{
-			DebugLocation(1, 484);
-			mCLOSE_BRACKET(); if (state.failed) return;
-
-			}
-			break;
-		case 85:
-			DebugEnterAlt(85);
-			// Hql.g:1:498: CONCAT
-			{
-			DebugLocation(1, 498);
-			mCONCAT(); if (state.failed) return;
-
-			}
-			break;
-		case 86:
-			DebugEnterAlt(86);
-			// Hql.g:1:505: PLUS
-			{
-			DebugLocation(1, 505);
-			mPLUS(); if (state.failed) return;
-
-			}
-			break;
-		case 87:
-			DebugEnterAlt(87);
-			// Hql.g:1:510: MINUS
-			{
-			DebugLocation(1, 510);
-			mMINUS(); if (state.failed) return;
-
-			}
-			break;
-		case 88:
-			DebugEnterAlt(88);
-			// Hql.g:1:516: STAR
-			{
-			DebugLocation(1, 516);
-			mSTAR(); if (state.failed) return;
-
-			}
-			break;
-		case 89:
-			DebugEnterAlt(89);
-			// Hql.g:1:521: DIV
-			{
-			DebugLocation(1, 521);
-			mDIV(); if (state.failed) return;
-
-			}
-			break;
-		case 90:
-			DebugEnterAlt(90);
-			// Hql.g:1:525: COLON
-			{
-			DebugLocation(1, 525);
-			mCOLON(); if (state.failed) return;
-
-			}
-			break;
-		case 91:
-			DebugEnterAlt(91);
-			// Hql.g:1:531: PARAM
-			{
-			DebugLocation(1, 531);
-			mPARAM(); if (state.failed) return;
-
-			}
-			break;
-		case 92:
-			DebugEnterAlt(92);
-			// Hql.g:1:537: IDENT
-			{
-			DebugLocation(1, 537);
-			mIDENT(); if (state.failed) return;
-
-			}
-			break;
-		case 93:
-			DebugEnterAlt(93);
-			// Hql.g:1:543: QUOTED_String
-			{
-			DebugLocation(1, 543);
-			mQUOTED_String(); if (state.failed) return;
-
-			}
-			break;
-		case 94:
-			DebugEnterAlt(94);
-			// Hql.g:1:557: WS
-			{
-			DebugLocation(1, 557);
-			mWS(); if (state.failed) return;
-
-			}
-			break;
-		case 95:
-			DebugEnterAlt(95);
-			// Hql.g:1:560: NUM_INT
-			{
-			DebugLocation(1, 560);
-			mNUM_INT(); if (state.failed) return;
-
-			}
-			break;
-
-		}
-
-	}
-
-	partial void EnterRule_synpred1_Hql_fragment();
-	partial void LeaveRule_synpred1_Hql_fragment();
-
-	// $ANTLR start synpred1_Hql
-	private void synpred1_Hql_fragment()
-	{
-		EnterRule_synpred1_Hql_fragment();
-		EnterRule("synpred1_Hql_fragment", 103);
-		TraceIn("synpred1_Hql_fragment", 103);
-		try
-		{
-			// Hql.g:747:13: ( ESCqs )
-			DebugEnterAlt(1);
-			// Hql.g:747:14: ESCqs
-			{
-			DebugLocation(747, 14);
-			mESCqs(); if (state.failed) return;
-
-			}
-
-		}
-		finally
-		{
-			TraceOut("synpred1_Hql_fragment", 103);
-			LeaveRule("synpred1_Hql_fragment", 103);
-			LeaveRule_synpred1_Hql_fragment();
-		}
-	}
-	// $ANTLR end synpred1_Hql
-
-	#region Synpreds
-	private bool EvaluatePredicate(System.Action fragment)
-	{
-		bool success = false;
-		state.backtracking++;
-		try { DebugBeginBacktrack(state.backtracking);
-		int start = input.Mark();
-		try
-		{
-			fragment();
-		}
-		catch ( RecognitionException re )
-		{
-			System.Console.Error.WriteLine("impossible: "+re);
-		}
-		success = !state.failed;
-		input.Rewind(start);
-		} finally { DebugEndBacktrack(state.backtracking, success); }
-		state.backtracking--;
-		state.failed=false;
-		return success;
-	}
-	#endregion Synpreds
-
-
-	#region DFA
-	DFA23 dfa23;
-
-	protected override void InitDFAs()
-	{
-		base.InitDFAs();
-		dfa23 = new DFA23(this);
-	}
-
-	private class DFA23 : DFA
-	{
-		private const string DFA23_eotS =
-			"\x1\xFFFF\x15\x28\x1\xFFFF\x1\x63\x1\x65\x1\x67\x1\x68\x1\x6A\x10\xFFFF"+
-			"\x2\x28\x1\x6F\x3\x28\x1\x73\x10\x28\x1\x8A\x1\x8B\xA\x28\x1\x97\x1\x98"+
-			"\x1\x9A\xF\x28\xA\xFFFF\x1\xAC\x1\xAD\x1\xAE\x1\xB0\x1\xFFFF\x1\xB1\x2"+
-			"\x28\x1\xFFFF\x9\x28\x1\xBD\xC\x28\x2\xFFFF\x4\x28\x1\xCE\x1\x28\x1\xD0"+
-			"\x1\xD1\x1\xD2\x2\x28\x2\xFFFF\x1\x28\x1\xFFFF\x4\x28\x1\xDA\x2\x28\x1"+
-			"\xDD\x9\x28\x3\xFFFF\x1\x28\x2\xFFFF\x1\x28\x1\xEA\x1\xEB\x3\x28\x1\xF0"+
-			"\x2\x28\x1\xF3\x1\x28\x1\xFFFF\x4\x28\x1\xF9\x1\xFA\x5\x28\x1\x100\x1"+
-			"\x101\x1\x28\x1\x103\x1\x104\x1\xFFFF\x1\x28\x3\xFFFF\x1\x106\x6\x28"+
-			"\x1\xFFFF\x1\x10D\x1\x10E\x1\xFFFF\x1\x10F\x1\x110\x1\x28\x1\x112\x3"+
-			"\x28\x1\x116\x1\x28\x1\x118\x2\x28\x2\xFFFF\x1\x11B\x1\x11C\x2\x28\x1"+
-			"\xFFFF\x2\x28\x1\xFFFF\x1\x121\x2\x28\x1\x124\x1\x125\x2\xFFFF\x1\x126"+
-			"\x2\x28\x1\x129\x1\x28\x2\xFFFF\x1\x28\x2\xFFFF\x1\x28\x1\xFFFF\x1\x28"+
-			"\x1\x12E\x1\x12F\x1\x28\x1\x131\x1\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1\x134"+
-			"\x2\x28\x1\xFFFF\x1\x137\x1\xFFFF\x2\x28\x2\xFFFF\x1\x13A\x3\x28\x1\xFFFF"+
-			"\x1\x13E\x1\x13F\x3\xFFFF\x1\x140\x1\x28\x1\xFFFF\x1\x142\x1\x28\x1\x144"+
-			"\x1\x145\x2\xFFFF\x1\x28\x1\xFFFF\x1\x147\x1\x28\x1\xFFFF\x1\x149\x1"+
-			"\x28\x1\xFFFF\x1\x28\x1\x14C\x1\xFFFF\x3\x28\x3\xFFFF\x1\x150\x1\xFFFF"+
-			"\x1\x151\x2\xFFFF\x1\x28\x1\xFFFF\x1\x28\x1\xFFFF\x2\x28\x1\xFFFF\x1"+
-			"\x28\x1\x157\x1\x158\x2\xFFFF\x1\x28\x1\x15A\x1\x28\x1\x15C\x1\x28\x2"+
-			"\xFFFF\x1\x28\x1\xFFFF\x1\x15F\x1\xFFFF\x1\x160\x1\x161\x3\xFFFF";
-		private const string DFA23_eofS =
-			"\x162\xFFFF";
-		private const string DFA23_minS =
-			"\x1\x9\x1\x6C\x1\x65\x1\x61\x1\x65\x1\x6C\x1\x61\x1\x72\x1\x61\x1\x6E"+
-			"\x1\x6F\x1\x65\x1\x61\x1\x65\x1\x62\x1\x72\x1\x69\x1\x65\x1\x61\x1\x6E"+
-			"\x1\x65\x1\x68\x1\xFFFF\x4\x3D\x1\x7C\x10\xFFFF\x1\x6C\x1\x64\x1\x24"+
-			"\x1\x67\x2\x74\x1\x24\x1\x73\x1\x61\x1\x75\x1\x6C\x1\x73\x1\x65\x1\x70"+
-			"\x1\x64\x1\x63\x1\x69\x1\x6C\x1\x74\x1\x6F\x1\x6C\x1\x6F\x1\x76\x2\x24"+
-			"\x1\x69\x1\x61\x1\x6B\x1\x78\x1\x6D\x1\x6E\x1\x77\x1\x74\x1\x6C\x1\x6A"+
-			"\x3\x24\x1\x74\x1\x6F\x1\x67\x1\x6C\x1\x69\x2\x6D\x1\x6B\x1\x65\x1\x61"+
-			"\x1\x69\x1\x64\x1\x72\x1\x65\x1\x74\xA\xFFFF\x4\x24\x1\xFFFF\x1\x24\x1"+
-			"\x77\x1\x68\x1\xFFFF\x1\x65\x1\x73\x1\x6E\x1\x65\x1\x63\x1\x74\x1\x6D"+
-			"\x1\x65\x1\x74\x1\x24\x1\x61\x2\x73\x1\x63\x1\x6D\x1\x6C\x1\x75\x2\x69"+
-			"\x2\x65\x1\x6F\x2\xFFFF\x1\x6E\x1\x64\x1\x74\x1\x65\x1\x24\x1\x62\x3"+
-			"\x24\x1\x6C\x1\x65\x2\xFFFF\x1\x65\x1\xFFFF\x1\x65\x1\x70\x1\x68\x1\x65"+
-			"\x1\x24\x1\x70\x1\x65\x1\x24\x1\x65\x1\x6E\x1\x69\x1\x65\x1\x6F\x1\x61"+
-			"\x1\x73\x1\x6E\x1\x68\x3\xFFFF\x1\x6E\x2\xFFFF\x1\x65\x2\x24\x1\x73\x2"+
-			"\x74\x1\x24\x1\x69\x1\x65\x1\x24\x1\x79\x1\xFFFF\x1\x70\x1\x74\x1\x65"+
-			"\x1\x68\x2\x24\x1\x70\x1\x6E\x1\x63\x2\x72\x2\x24\x1\x69\x2\x24\x1\xFFFF"+
-			"\x1\x65\x3\xFFFF\x1\x24\x1\x63\x2\x72\x1\x65\x1\x74\x1\x63\x1\xFFFF\x2"+
-			"\x24\x1\xFFFF\x2\x24\x1\x6C\x1\x24\x1\x6E\x1\x74\x1\x69\x1\x24\x1\x65"+
-			"\x1\x24\x1\x64\x1\x65\x2\xFFFF\x2\x24\x1\x65\x1\x6E\x1\xFFFF\x2\x6E\x1"+
-			"\xFFFF\x1\x24\x1\x65\x1\x73\x2\x24\x2\xFFFF\x1\x24\x1\x67\x1\x65\x1\x24"+
-			"\x1\x74\x2\xFFFF\x1\x6E\x2\xFFFF\x1\x72\x1\xFFFF\x1\x74\x2\x24\x1\x72"+
-			"\x1\x24\x1\x74\x4\xFFFF\x1\x69\x1\xFFFF\x1\x24\x1\x65\x1\x6F\x1\xFFFF"+
-			"\x1\x24\x1\xFFFF\x1\x69\x1\x6E\x2\xFFFF\x1\x24\x1\x64\x1\x63\x1\x74\x1"+
-			"\xFFFF\x2\x24\x3\xFFFF\x1\x24\x1\x73\x1\xFFFF\x1\x24\x1\x67\x2\x24\x2"+
-			"\xFFFF\x1\x74\x1\xFFFF\x1\x24\x1\x6E\x1\xFFFF\x1\x24\x1\x6E\x1\xFFFF"+
-			"\x1\x6E\x1\x24\x1\xFFFF\x1\x69\x1\x74\x1\x73\x3\xFFFF\x1\x24\x1\xFFFF"+
-			"\x1\x24\x2\xFFFF\x1\x69\x1\xFFFF\x1\x67\x1\xFFFF\x1\x65\x1\x67\x1\xFFFF"+
-			"\x1\x6E\x2\x24\x2\xFFFF\x1\x65\x1\x24\x1\x64\x1\x24\x1\x67\x2\xFFFF\x1"+
-			"\x73\x1\xFFFF\x1\x24\x1\xFFFF\x2\x24\x3\xFFFF";
-		private const string DFA23_maxS =
-			"\x1\xFFFE\x1\x76\x1\x79\x1\x6F\x1\x69\x1\x78\x1\x75\x1\x72\x1\x61\x1"+
-			"\x73\x1\x6F\x2\x69\x2\x75\x1\x72\x1\x69\x1\x75\x1\x72\x1\x70\x1\x65\x1"+
-			"\x69\x1\xFFFF\x1\x3E\x3\x3D\x1\x7C\x10\xFFFF\x1\x6C\x1\x79\x1\xFFFE\x1"+
-			"\x67\x2\x74\x1\xFFFE\x1\x73\x1\x61\x1\x75\x3\x73\x1\x70\x1\x64\x1\x63"+
-			"\x1\x69\x1\x6C\x1\x74\x1\x6F\x1\x6C\x1\x6F\x1\x76\x2\xFFFE\x1\x69\x1"+
-			"\x66\x1\x6B\x1\x78\x1\x6D\x1\x6E\x1\x77\x1\x74\x1\x6C\x1\x6A\x3\xFFFE"+
-			"\x1\x74\x1\x6F\x1\x67\x1\x74\x1\x69\x2\x6D\x1\x6B\x1\x65\x1\x75\x1\x69"+
-			"\x1\x64\x1\x72\x1\x65\x1\x74\xA\xFFFF\x4\xFFFE\x1\xFFFF\x1\xFFFE\x1\x77"+
-			"\x1\x68\x1\xFFFF\x1\x65\x1\x73\x1\x6E\x1\x65\x1\x63\x1\x74\x1\x6D\x1"+
-			"\x65\x1\x74\x1\xFFFE\x1\x61\x2\x73\x1\x63\x1\x6D\x1\x6C\x1\x75\x2\x69"+
-			"\x2\x65\x1\x6F\x2\xFFFF\x1\x6E\x1\x64\x1\x74\x1\x65\x1\xFFFE\x1\x62\x3"+
-			"\xFFFE\x1\x6C\x1\x65\x2\xFFFF\x1\x65\x1\xFFFF\x1\x65\x1\x70\x1\x68\x1"+
-			"\x65\x1\xFFFE\x1\x70\x1\x65\x1\xFFFE\x1\x65\x1\x6E\x1\x69\x1\x65\x1\x6F"+
-			"\x1\x61\x1\x73\x1\x72\x1\x68\x3\xFFFF\x1\x6E\x2\xFFFF\x1\x65\x2\xFFFE"+
-			"\x1\x73\x2\x74\x1\xFFFE\x1\x69\x1\x65\x1\xFFFE\x1\x79\x1\xFFFF\x1\x70"+
-			"\x1\x74\x1\x65\x1\x68\x2\xFFFE\x1\x70\x1\x6E\x1\x63\x2\x72\x2\xFFFE\x1"+
-			"\x69\x2\xFFFE\x1\xFFFF\x1\x65\x3\xFFFF\x1\xFFFE\x1\x63\x2\x72\x1\x65"+
-			"\x1\x74\x1\x63\x1\xFFFF\x2\xFFFE\x1\xFFFF\x2\xFFFE\x1\x6C\x1\xFFFE\x1"+
-			"\x6E\x1\x74\x1\x69\x1\xFFFE\x1\x65\x1\xFFFE\x1\x64\x1\x65\x2\xFFFF\x2"+
-			"\xFFFE\x1\x65\x1\x6E\x1\xFFFF\x2\x6E\x1\xFFFF\x1\xFFFE\x1\x65\x1\x73"+
-			"\x2\xFFFE\x2\xFFFF\x1\xFFFE\x1\x67\x1\x65\x1\xFFFE\x1\x74\x2\xFFFF\x1"+
-			"\x6E\x2\xFFFF\x1\x72\x1\xFFFF\x1\x74\x2\xFFFE\x1\x72\x1\xFFFE\x1\x74"+
-			"\x4\xFFFF\x1\x69\x1\xFFFF\x1\xFFFE\x1\x65\x1\x6F\x1\xFFFF\x1\xFFFE\x1"+
-			"\xFFFF\x1\x69\x1\x6E\x2\xFFFF\x1\xFFFE\x1\x64\x1\x63\x1\x74\x1\xFFFF"+
-			"\x2\xFFFE\x3\xFFFF\x1\xFFFE\x1\x73\x1\xFFFF\x1\xFFFE\x1\x67\x2\xFFFE"+
-			"\x2\xFFFF\x1\x74\x1\xFFFF\x1\xFFFE\x1\x6E\x1\xFFFF\x1\xFFFE\x1\x6E\x1"+
-			"\xFFFF\x1\x6E\x1\xFFFE\x1\xFFFF\x1\x69\x1\x74\x1\x73\x3\xFFFF\x1\xFFFE"+
-			"\x1\xFFFF\x1\xFFFE\x2\xFFFF\x1\x69\x1\xFFFF\x1\x67\x1\xFFFF\x1\x65\x1"+
-			"\x67\x1\xFFFF\x1\x6E\x2\xFFFE\x2\xFFFF\x1\x65\x1\xFFFE\x1\x64\x1\xFFFE"+
-			"\x1\x67\x2\xFFFF\x1\x73\x1\xFFFF\x1\xFFFE\x1\xFFFF\x2\xFFFE\x3\xFFFF";
-		private const string DFA23_acceptS =
-			"\x16\xFFFF\x1\x45\x5\xFFFF\x1\x4E\x1\x50\x1\x51\x1\x52\x1\x53\x1\x54"+
-			"\x1\x56\x1\x57\x1\x58\x1\x59\x1\x5A\x1\x5B\x1\x5C\x1\x5D\x1\x5E\x1\x5F"+
-			"\x35\xFFFF\x1\x48\x1\x4A\x1\x46\x1\x4B\x1\x47\x1\x49\x1\x4F\x1\x4D\x1"+
-			"\x55\x1\x4C\x4\xFFFF\x1\x4\x3\xFFFF\x1\x25\x16\xFFFF\x1\x1B\x1\x20\xB"+
-			"\xFFFF\x1\x2D\x1\x2E\x1\xFFFF\x1\x2F\x11\xFFFF\x1\x1\x1\x2\x1\x3\x1\xFFFF"+
-			"\x1\x5\x1\x6\xB\xFFFF\x1\x12\x10\xFFFF\x1\x26\x1\xFFFF\x1\x28\x1\x29"+
-			"\x1\x2A\x7\xFFFF\x1\x35\x2\xFFFF\x1\x38\xC\xFFFF\x1\x8\x1\x9\x4\xFFFF"+
-			"\x1\xD\x2\xFFFF\x1\x10\x5\xFFFF\x1\x17\x1\x18\x5\xFFFF\x1\x1F\x1\x21"+
-			"\x1\xFFFF\x1\x23\x1\x24\x1\xFFFF\x1\x2B\x6\xFFFF\x1\x36\x1\x37\x1\x39"+
-			"\x1\x3A\x1\xFFFF\x1\x3C\x3\xFFFF\x1\x40\x1\xFFFF\x1\x42\x2\xFFFF\x1\xA"+
-			"\x1\xB\x4\xFFFF\x1\x11\x2\xFFFF\x1\x15\x1\x16\x1\x19\x2\xFFFF\x1\x1D"+
-			"\x4\xFFFF\x1\x30\x1\x31\x1\xFFFF\x1\x33\x2\xFFFF\x1\x3D\x2\xFFFF\x1\x41"+
-			"\x2\xFFFF\x1\xC\x3\xFFFF\x1\x13\x1\x14\x1\x1A\x1\xFFFF\x1\x1E\x1\xFFFF"+
-			"\x1\x27\x1\x2C\x1\xFFFF\x1\x34\x1\xFFFF\x1\x3E\x2\xFFFF\x1\x7\x3\xFFFF"+
-			"\x1\x1C\x1\x22\x5\xFFFF\x1\xE\x1\xF\x1\xFFFF\x1\x3B\x1\xFFFF\x1\x43\x2"+
-			"\xFFFF\x1\x3F\x1\x44\x1\x32";
-		private const string DFA23_specialS =
-			"\x162\xFFFF}>";
-		private static readonly string[] DFA23_transitionS =
-			{
-				"\x2\x2A\x2\xFFFF\x1\x2A\x12\xFFFF\x1\x2A\x1\x19\x2\xFFFF\x1\x28\x1\xFFFF"+
-				"\x1\x1C\x1\x29\x1\x1E\x1\x1F\x1\x24\x1\x22\x1\x1D\x1\x23\x1\x2B\x1\x25"+
-				"\xA\x2B\x1\x26\x1\xFFFF\x1\x17\x1\x16\x1\x18\x1\x27\x1\xFFFF\x1A\x28"+
-				"\x1\x20\x1\xFFFF\x1\x21\x1\x1A\x1\x28\x1\xFFFF\x1\x1\x1\x2\x1\x3\x1"+
-				"\x4\x1\x5\x1\x6\x1\x7\x1\x8\x1\x9\x1\xA\x1\x28\x1\xB\x1\xC\x1\xD\x1"+
-				"\xE\x1\xF\x1\x28\x1\x10\x1\x11\x1\x12\x1\x13\x1\x14\x1\x15\x3\x28\x1"+
-				"\xFFFF\x1\x1B\x3\xFFFF\xFF7F\x28",
-				"\x1\x2C\x1\xFFFF\x1\x2D\x4\xFFFF\x1\x2E\x2\xFFFF\x1\x2F",
-				"\x1\x30\x9\xFFFF\x1\x31\x9\xFFFF\x1\x32",
-				"\x1\x33\xA\xFFFF\x1\x34\x2\xFFFF\x1\x35",
-				"\x1\x36\x3\xFFFF\x1\x37",
-				"\x1\x38\x1\x39\x1\x3A\x4\xFFFF\x1\x3B\x4\xFFFF\x1\x3C",
-				"\x1\x3D\x3\xFFFF\x1\x3E\xC\xFFFF\x1\x3F\x2\xFFFF\x1\x40",
-				"\x1\x41",
-				"\x1\x42",
-				"\x1\x43\x4\xFFFF\x1\x44",
-				"\x1\x45",
-				"\x1\x46\x3\xFFFF\x1\x47",
-				"\x1\x48\x3\xFFFF\x1\x49\x3\xFFFF\x1\x4A",
-				"\x1\x4B\x9\xFFFF\x1\x4C\x5\xFFFF\x1\x4D",
-				"\x1\x4E\x3\xFFFF\x1\x4F\x7\xFFFF\x1\x50\x3\xFFFF\x1\x51\x2\xFFFF\x1"+
-				"\x52",
-				"\x1\x53",
-				"\x1\x54",
-				"\x1\x55\x5\xFFFF\x1\x56\x3\xFFFF\x1\x57\x5\xFFFF\x1\x58",
-				"\x1\x59\x6\xFFFF\x1\x5A\x9\xFFFF\x1\x5B",
-				"\x1\x5C\x1\xFFFF\x1\x5D",
-				"\x1\x5E",
-				"\x1\x5F\x1\x60",
-				"",
-				"\x1\x62\x1\x61",
-				"\x1\x64",
-				"\x1\x66",
-				"\x1\x66",
-				"\x1\x69",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"\x1\x6B",
-				"\x1\x6C\x14\xFFFF\x1\x6D",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x2"+
-				"\x28\x1\x6E\x17\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x70",
-				"\x1\x71",
-				"\x1\x72",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x74",
-				"\x1\x75",
-				"\x1\x76",
-				"\x1\x77\x6\xFFFF\x1\x78",
-				"\x1\x79",
-				"\x1\x7A\xD\xFFFF\x1\x7B",
-				"\x1\x7C",
-				"\x1\x7D",
-				"\x1\x7E",
-				"\x1\x7F",
-				"\x1\x80",
-				"\x1\x81",
-				"\x1\x82",
-				"\x1\x83",
-				"\x1\x84",
-				"\x1\x85",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x3"+
-				"\x28\x1\x86\x9\x28\x1\x87\x4\x28\x1\x88\x1\x89\x6\x28\x5\xFFFF\xFF7F"+
-				"\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x8C",
-				"\x1\x8D\x4\xFFFF\x1\x8E",
-				"\x1\x8F",
-				"\x1\x90",
-				"\x1\x91",
-				"\x1\x92",
-				"\x1\x93",
-				"\x1\x94",
-				"\x1\x95",
-				"\x1\x96",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x3"+
-				"\x28\x1\x99\x16\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x9B",
-				"\x1\x9C",
-				"\x1\x9D",
-				"\x1\x9E\x7\xFFFF\x1\x9F",
-				"\x1\xA0",
-				"\x1\xA1",
-				"\x1\xA2",
-				"\x1\xA3",
-				"\x1\xA4",
-				"\x1\xA5\x13\xFFFF\x1\xA6",
-				"\x1\xA7",
-				"\x1\xA8",
-				"\x1\xA9",
-				"\x1\xAA",
-				"\x1\xAB",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x4"+
-				"\x28\x1\xAF\x15\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\xB2",
-				"\x1\xB3",
-				"",
-				"\x1\xB4",
-				"\x1\xB5",
-				"\x1\xB6",
-				"\x1\xB7",
-				"\x1\xB8",
-				"\x1\xB9",
-				"\x1\xBA",
-				"\x1\xBB",
-				"\x1\xBC",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\xBE",
-				"\x1\xBF",
-				"\x1\xC0",
-				"\x1\xC1",
-				"\x1\xC2",
-				"\x1\xC3",
-				"\x1\xC4",
-				"\x1\xC5",
-				"\x1\xC6",
-				"\x1\xC7",
-				"\x1\xC8",
-				"\x1\xC9",
-				"",
-				"",
-				"\x1\xCA",
-				"\x1\xCB",
-				"\x1\xCC",
-				"\x1\xCD",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\xCF",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\xD3",
-				"\x1\xD4",
-				"",
-				"",
-				"\x1\xD5",
-				"",
-				"\x1\xD6",
-				"\x1\xD7",
-				"\x1\xD8",
-				"\x1\xD9",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\xDB",
-				"\x1\xDC",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\xDE",
-				"\x1\xDF",
-				"\x1\xE0",
-				"\x1\xE1",
-				"\x1\xE2",
-				"\x1\xE3",
-				"\x1\xE4",
-				"\x1\xE5\x3\xFFFF\x1\xE6",
-				"\x1\xE7",
-				"",
-				"",
-				"",
-				"\x1\xE8",
-				"",
-				"",
-				"\x1\xE9",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\xEC",
-				"\x1\xED",
-				"\x1\xEE",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x4"+
-				"\x28\x1\xEF\x15\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\xF1",
-				"\x1\xF2",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\xF4",
-				"",
-				"\x1\xF5",
-				"\x1\xF6",
-				"\x1\xF7",
-				"\x1\xF8",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\xFB",
-				"\x1\xFC",
-				"\x1\xFD",
-				"\x1\xFE",
-				"\x1\xFF",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x102",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"\x1\x105",
-				"",
-				"",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x107",
-				"\x1\x108",
-				"\x1\x109",
-				"\x1\x10A",
-				"\x1\x10B",
-				"\x1\x10C",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x111",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x113",
-				"\x1\x114",
-				"\x1\x115",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x117",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x119",
-				"\x1\x11A",
-				"",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x11D",
-				"\x1\x11E",
-				"",
-				"\x1\x11F",
-				"\x1\x120",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x122",
-				"\x1\x123",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x127",
-				"\x1\x128",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x12A",
-				"",
-				"",
-				"\x1\x12B",
-				"",
-				"",
-				"\x1\x12C",
-				"",
-				"\x1\x12D",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x130",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x132",
-				"",
-				"",
-				"",
-				"",
-				"\x1\x133",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x135",
-				"\x1\x136",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"\x1\x138",
-				"\x1\x139",
-				"",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x13B",
-				"\x1\x13C",
-				"\x1\x13D",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x141",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x143",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"",
-				"\x1\x146",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x148",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x14A",
-				"",
-				"\x1\x14B",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"\x1\x14D",
-				"\x1\x14E",
-				"\x1\x14F",
-				"",
-				"",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"",
-				"\x1\x152",
-				"",
-				"\x1\x153",
-				"",
-				"\x1\x154",
-				"\x1\x155",
-				"",
-				"\x1\x156",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"",
-				"\x1\x159",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x15B",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x15D",
-				"",
-				"",
-				"\x1\x15E",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"\x1\x28\xB\xFFFF\xA\x28\x7\xFFFF\x1A\x28\x4\xFFFF\x1\x28\x1\xFFFF\x1A"+
-				"\x28\x5\xFFFF\xFF7F\x28",
-				"",
-				"",
-				""
-			};
-
-		private static readonly short[] DFA23_eot = DFA.UnpackEncodedString(DFA23_eotS);
-		private static readonly short[] DFA23_eof = DFA.UnpackEncodedString(DFA23_eofS);
-		private static readonly char[] DFA23_min = DFA.UnpackEncodedStringToUnsignedChars(DFA23_minS);
-		private static readonly char[] DFA23_max = DFA.UnpackEncodedStringToUnsignedChars(DFA23_maxS);
-		private static readonly short[] DFA23_accept = DFA.UnpackEncodedString(DFA23_acceptS);
-		private static readonly short[] DFA23_special = DFA.UnpackEncodedString(DFA23_specialS);
-		private static readonly short[][] DFA23_transition;
-
-		static DFA23()
-		{
-			int numStates = DFA23_transitionS.Length;
-			DFA23_transition = new short[numStates][];
-			for ( int i=0; i < numStates; i++ )
-			{
-				DFA23_transition[i] = DFA.UnpackEncodedString(DFA23_transitionS[i]);
-			}
-		}
-
-		public DFA23( BaseRecognizer recognizer )
-		{
-			this.recognizer = recognizer;
-			this.decisionNumber = 23;
-			this.eot = DFA23_eot;
-			this.eof = DFA23_eof;
-			this.min = DFA23_min;
-			this.max = DFA23_max;
-			this.accept = DFA23_accept;
-			this.special = DFA23_special;
-			this.transition = DFA23_transition;
-		}
-
-		public override string Description { get { return "1:1: Tokens : ( ALL | AND | ANY | AS | ASCENDING | AVG | BETWEEN | BOTH | CASE | CLASS | COUNT | DELETE | DESCENDING | DISTINCT | ELEMENTS | ELSE | EMPTY | END | ESCAPE | EXISTS | FALSE | FETCH | FROM | FULL | GROUP | HAVING | IN | INDICES | INNER | INSERT | INTO | IS | JOIN | LEADING | LEFT | LIKE | LITERAL_by | MAX | MEMBER | MIN | NEW | NOT | NULL | OBJECT | OF | ON | OR | ORDER | OUTER | PROPERTIES | RIGHT | SELECT | SET | SKIP | SOME | SUM | TAKE | THEN | TRAILING | TRUE | UNION | UPDATE | VERSIONED | WHEN | WHERE | WITH | T__133 | T__134 | EQ | LT | GT | SQL_NE | NE | LE | GE | BOR | BXOR | BAND | BNOT | COMMA | OPEN | CLOSE | OPEN_BRACKET | CLOSE_BRACKET | CONCAT | PLUS | MINUS | STAR | DIV | COLON | PARAM | IDENT | QUOTED_String | WS | NUM_INT );"; } }
-
-		public override void Error(NoViableAltException nvae)
-		{
-			DebugRecognitionException(nvae);
-		}
-	}
-
-
-	#endregion
-
-}
-
-} // namespace  NHibernate.Hql.Ast.ANTLR 
diff --git a/src/NHibernate/Hql/Ast/ANTLR/Generated/HqlParser.cs b/src/NHibernate/Hql/Ast/ANTLR/Generated/HqlParser.cs
deleted file mode 100644
index d65fa12da8a..00000000000
--- a/src/NHibernate/Hql/Ast/ANTLR/Generated/HqlParser.cs
+++ /dev/null
@@ -1,12654 +0,0 @@
-//------------------------------------------------------------------------------
-// <auto-generated>
-//     This code was generated by a tool.
-//     ANTLR Version: 3.5.0.2
-//
-//     Changes to this file may cause incorrect behavior and will be lost if
-//     the code is regenerated.
-// </auto-generated>
-//------------------------------------------------------------------------------
-
-// $ANTLR 3.5.0.2 Hql.g 2015-05-03 23:15:27
-
-// The variable 'variable' is assigned but its value is never used.
-#pragma warning disable 219
-// Unreachable code detected.
-#pragma warning disable 162
-// Missing XML comment for publicly visible type or member 'Type_or_Member'
-#pragma warning disable 1591
-// CLS compliance checking will not be performed on 'type' because it is not visible from outside this assembly.
-#pragma warning disable 3019
-
-
-using NHibernate.Hql.Ast.ANTLR.Tree;
-
-
-using System.Collections.Generic;
-using Antlr.Runtime;
-using Antlr.Runtime.Misc;
-
-
-using Antlr.Runtime.Tree;
-using RewriteRuleITokenStream = Antlr.Runtime.Tree.RewriteRuleTokenStream;
-
-namespace  NHibernate.Hql.Ast.ANTLR 
-{
-[System.CodeDom.Compiler.GeneratedCode("ANTLR", "3.5.0.2")]
-[System.CLSCompliant(false)]
-public partial class HqlParser : Antlr.Runtime.Parser
-{
-	internal static readonly string[] tokenNames = new string[] {
-		"<invalid>", "<EOR>", "<DOWN>", "<UP>", "AGGREGATE", "ALIAS", "ALL", "AND", "ANY", "AS", "ASCENDING", "AVG", "BAND", "BETWEEN", "BNOT", "BOR", "BOTH", "BXOR", "CASE", "CASE2", "CLASS", "CLOSE", "CLOSE_BRACKET", "COLON", "COMMA", "CONCAT", "CONSTANT", "CONSTRUCTOR", "COUNT", "DELETE", "DESCENDING", "DISTINCT", "DIV", "DOT", "ELEMENTS", "ELSE", "EMPTY", "END", "EQ", "ESCAPE", "ESCqs", "EXISTS", "EXPONENT", "EXPR_LIST", "FALSE", "FETCH", "FILTER_ENTITY", "FLOAT_SUFFIX", "FROM", "FULL", "GE", "GROUP", "GT", "HAVING", "HEX_DIGIT", "IDENT", "ID_LETTER", "ID_START_LETTER", "IN", "INDEX_OP", "INDICES", "INNER", "INSERT", "INTO", "IN_LIST", "IS", "IS_NOT_NULL", "IS_NULL", "JAVA_CONSTANT", "JOIN", "LE", "LEADING", "LEFT", "LIKE", "LITERAL_by", "LT", "MAX", "MEMBER", "METHOD_CALL", "MIN", "MINUS", "NE", "NEW", "NOT", "NOT_BETWEEN", "NOT_IN", "NOT_LIKE", "NULL", "NUM_DECIMAL", "NUM_DOUBLE", "NUM_FLOAT", "NUM_INT", "NUM_LONG", "OBJECT", "OF", "ON", "OPEN", "OPEN_BRACKET", "OR", "ORDER", "ORDER_ELEMENT", "OUTER", "PARAM", "PLUS", "PROPERTIES", "QUERY", "QUOTED_String", "RANGE", "RIGHT", "ROW_STAR", "SELECT", "SELECT_FROM", "SET", "SKIP", "SOME", "SQL_NE", "STAR", "SUM", "TAKE", "THEN", "TRAILING", "TRUE", "UNARY_MINUS", "UNARY_PLUS", "UNION", "UPDATE", "VECTOR_EXPR", "VERSIONED", "WEIRD_IDENT", "WHEN", "WHERE", "WITH", "WS", "'ascending'", "'descending'"
-	};
-	public const int EOF=-1;
-	public const int AGGREGATE=4;
-	public const int ALIAS=5;
-	public const int ALL=6;
-	public const int AND=7;
-	public const int ANY=8;
-	public const int AS=9;
-	public const int ASCENDING=10;
-	public const int AVG=11;
-	public const int BAND=12;
-	public const int BETWEEN=13;
-	public const int BNOT=14;
-	public const int BOR=15;
-	public const int BOTH=16;
-	public const int BXOR=17;
-	public const int CASE=18;
-	public const int CASE2=19;
-	public const int CLASS=20;
-	public const int CLOSE=21;
-	public const int CLOSE_BRACKET=22;
-	public const int COLON=23;
-	public const int COMMA=24;
-	public const int CONCAT=25;
-	public const int CONSTANT=26;
-	public const int CONSTRUCTOR=27;
-	public const int COUNT=28;
-	public const int DELETE=29;
-	public const int DESCENDING=30;
-	public const int DISTINCT=31;
-	public const int DIV=32;
-	public const int DOT=33;
-	public const int ELEMENTS=34;
-	public const int ELSE=35;
-	public const int EMPTY=36;
-	public const int END=37;
-	public const int EQ=38;
-	public const int ESCAPE=39;
-	public const int ESCqs=40;
-	public const int EXISTS=41;
-	public const int EXPONENT=42;
-	public const int EXPR_LIST=43;
-	public const int FALSE=44;
-	public const int FETCH=45;
-	public const int FILTER_ENTITY=46;
-	public const int FLOAT_SUFFIX=47;
-	public const int FROM=48;
-	public const int FULL=49;
-	public const int GE=50;
-	public const int GROUP=51;
-	public const int GT=52;
-	public const int HAVING=53;
-	public const int HEX_DIGIT=54;
-	public const int IDENT=55;
-	public const int ID_LETTER=56;
-	public const int ID_START_LETTER=57;
-	public const int IN=58;
-	public const int INDEX_OP=59;
-	public const int INDICES=60;
-	public const int INNER=61;
-	public const int INSERT=62;
-	public const int INTO=63;
-	public const int IN_LIST=64;
-	public const int IS=65;
-	public const int IS_NOT_NULL=66;
-	public const int IS_NULL=67;
-	public const int JAVA_CONSTANT=68;
-	public const int JOIN=69;
-	public const int LE=70;
-	public const int LEADING=71;
-	public const int LEFT=72;
-	public const int LIKE=73;
-	public const int LITERAL_by=74;
-	public const int LT=75;
-	public const int MAX=76;
-	public const int MEMBER=77;
-	public const int METHOD_CALL=78;
-	public const int MIN=79;
-	public const int MINUS=80;
-	public const int NE=81;
-	public const int NEW=82;
-	public const int NOT=83;
-	public const int NOT_BETWEEN=84;
-	public const int NOT_IN=85;
-	public const int NOT_LIKE=86;
-	public const int NULL=87;
-	public const int NUM_DECIMAL=88;
-	public const int NUM_DOUBLE=89;
-	public const int NUM_FLOAT=90;
-	public const int NUM_INT=91;
-	public const int NUM_LONG=92;
-	public const int OBJECT=93;
-	public const int OF=94;
-	public const int ON=95;
-	public const int OPEN=96;
-	public const int OPEN_BRACKET=97;
-	public const int OR=98;
-	public const int ORDER=99;
-	public const int ORDER_ELEMENT=100;
-	public const int OUTER=101;
-	public const int PARAM=102;
-	public const int PLUS=103;
-	public const int PROPERTIES=104;
-	public const int QUERY=105;
-	public const int QUOTED_String=106;
-	public const int RANGE=107;
-	public const int RIGHT=108;
-	public const int ROW_STAR=109;
-	public const int SELECT=110;
-	public const int SELECT_FROM=111;
-	public const int SET=112;
-	public const int SKIP=113;
-	public const int SOME=114;
-	public const int SQL_NE=115;
-	public const int STAR=116;
-	public const int SUM=117;
-	public const int TAKE=118;
-	public const int THEN=119;
-	public const int TRAILING=120;
-	public const int TRUE=121;
-	public const int UNARY_MINUS=122;
-	public const int UNARY_PLUS=123;
-	public const int UNION=124;
-	public const int UPDATE=125;
-	public const int VECTOR_EXPR=126;
-	public const int VERSIONED=127;
-	public const int WEIRD_IDENT=128;
-	public const int WHEN=129;
-	public const int WHERE=130;
-	public const int WITH=131;
-	public const int WS=132;
-	public const int T__133=133;
-	public const int T__134=134;
-
-	public HqlParser(ITokenStream input)
-		: this(input, new RecognizerSharedState())
-	{
-	}
-	public HqlParser(ITokenStream input, RecognizerSharedState state)
-		: base(input, state)
-	{
-		ITreeAdaptor treeAdaptor = default(ITreeAdaptor);
-		CreateTreeAdaptor(ref treeAdaptor);
-		TreeAdaptor = treeAdaptor ?? new CommonTreeAdaptor();
-		OnCreated();
-	}
-	// Implement this function in your helper file to use a custom tree adaptor
-	partial void CreateTreeAdaptor(ref ITreeAdaptor adaptor);
-
-	private ITreeAdaptor adaptor;
-
-	public ITreeAdaptor TreeAdaptor
-	{
-		get
-		{
-			return adaptor;
-		}
-
-		set
-		{
-			this.adaptor = value;
-		}
-	}
-
-	public override string[] TokenNames { get { return HqlParser.tokenNames; } }
-	public override string GrammarFileName { get { return "Hql.g"; } }
-
-
-	partial void OnCreated();
-	partial void EnterRule(string ruleName, int ruleIndex);
-	partial void LeaveRule(string ruleName, int ruleIndex);
-
-	#region Rules
-	partial void EnterRule_statement();
-	partial void LeaveRule_statement();
-	// $ANTLR start "statement"
-	// Hql.g:129:8: public statement : ({...}? ( updateStatement | deleteStatement | insertStatement ) | selectStatement ) EOF !;
-	[GrammarRule("statement")]
-	public AstParserRuleReturnScope<IASTNode, IToken> statement()
-	{
-		EnterRule_statement();
-		EnterRule("statement", 1);
-		TraceIn("statement", 1);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken EOF5 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> updateStatement1 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> deleteStatement2 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> insertStatement3 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> selectStatement4 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode EOF5_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "statement");
-		DebugLocation(129, 1);
-		try
-		{
-			// Hql.g:130:2: ( ({...}? ( updateStatement | deleteStatement | insertStatement ) | selectStatement ) EOF !)
-			DebugEnterAlt(1);
-			// Hql.g:131:2: ({...}? ( updateStatement | deleteStatement | insertStatement ) | selectStatement ) EOF !
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(131, 2);
-			// Hql.g:131:2: ({...}? ( updateStatement | deleteStatement | insertStatement ) | selectStatement )
-			int alt2=2;
-			try { DebugEnterSubRule(2);
-			try { DebugEnterDecision(2, false);
-			int LA2_1 = input.LA(1);
-
-			if ((LA2_1==DELETE||LA2_1==INSERT||LA2_1==UPDATE))
-			{
-				alt2 = 1;
-			}
-			else if ((LA2_1==EOF||LA2_1==FROM||LA2_1==GROUP||LA2_1==HAVING||LA2_1==ORDER||LA2_1==SELECT||LA2_1==SKIP||LA2_1==TAKE||LA2_1==WHERE))
-			{
-				alt2 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 2, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(2); }
-			switch (alt2)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:132:3: {...}? ( updateStatement | deleteStatement | insertStatement )
-				{
-				DebugLocation(132, 3);
-				if (!(( !filter )))
-				{
-					throw new FailedPredicateException(input, "statement", " !filter ");
-				}
-				DebugLocation(132, 16);
-				// Hql.g:132:16: ( updateStatement | deleteStatement | insertStatement )
-				int alt1=3;
-				try { DebugEnterSubRule(1);
-				try { DebugEnterDecision(1, false);
-				switch (input.LA(1))
-				{
-				case UPDATE:
-					{
-					alt1 = 1;
-					}
-					break;
-				case DELETE:
-					{
-					alt1 = 2;
-					}
-					break;
-				case INSERT:
-					{
-					alt1 = 3;
-					}
-					break;
-				default:
-					{
-						NoViableAltException nvae = new NoViableAltException("", 1, 0, input, 1);
-						DebugRecognitionException(nvae);
-						throw nvae;
-					}
-				}
-
-				} finally { DebugExitDecision(1); }
-				switch (alt1)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:132:18: updateStatement
-					{
-					DebugLocation(132, 18);
-					PushFollow(Follow._updateStatement_in_statement620);
-					updateStatement1=updateStatement();
-					PopFollow();
-
-					adaptor.AddChild(root_0, updateStatement1.Tree);
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:132:36: deleteStatement
-					{
-					DebugLocation(132, 36);
-					PushFollow(Follow._deleteStatement_in_statement624);
-					deleteStatement2=deleteStatement();
-					PopFollow();
-
-					adaptor.AddChild(root_0, deleteStatement2.Tree);
-
-					}
-					break;
-				case 3:
-					DebugEnterAlt(3);
-					// Hql.g:132:54: insertStatement
-					{
-					DebugLocation(132, 54);
-					PushFollow(Follow._insertStatement_in_statement628);
-					insertStatement3=insertStatement();
-					PopFollow();
-
-					adaptor.AddChild(root_0, insertStatement3.Tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(1); }
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:133:5: selectStatement
-				{
-				DebugLocation(133, 5);
-				PushFollow(Follow._selectStatement_in_statement637);
-				selectStatement4=selectStatement();
-				PopFollow();
-
-				adaptor.AddChild(root_0, selectStatement4.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(2); }
-
-			DebugLocation(134, 7);
-			EOF5=(IToken)Match(input,EOF,Follow._EOF_in_statement642); 
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("statement", 1);
-			LeaveRule("statement", 1);
-			LeaveRule_statement();
-		}
-		DebugLocation(135, 1);
-		} finally { DebugExitRule(GrammarFileName, "statement"); }
-		return retval;
-
-	}
-	// $ANTLR end "statement"
-
-	partial void EnterRule_updateStatement();
-	partial void LeaveRule_updateStatement();
-	// $ANTLR start "updateStatement"
-	// Hql.g:137:1: updateStatement : UPDATE ^ ( VERSIONED )? optionalFromTokenFromClause setClause ( whereClause )? ;
-	[GrammarRule("updateStatement")]
-	private AstParserRuleReturnScope<IASTNode, IToken> updateStatement()
-	{
-		EnterRule_updateStatement();
-		EnterRule("updateStatement", 2);
-		TraceIn("updateStatement", 2);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken UPDATE6 = default(IToken);
-		IToken VERSIONED7 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> optionalFromTokenFromClause8 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> setClause9 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> whereClause10 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode UPDATE6_tree = default(IASTNode);
-		IASTNode VERSIONED7_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "updateStatement");
-		DebugLocation(137, 1);
-		try
-		{
-			// Hql.g:138:2: ( UPDATE ^ ( VERSIONED )? optionalFromTokenFromClause setClause ( whereClause )? )
-			DebugEnterAlt(1);
-			// Hql.g:138:4: UPDATE ^ ( VERSIONED )? optionalFromTokenFromClause setClause ( whereClause )?
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(138, 10);
-			UPDATE6=(IToken)Match(input,UPDATE,Follow._UPDATE_in_updateStatement654); 
-			UPDATE6_tree = (IASTNode)adaptor.Create(UPDATE6);
-			root_0 = (IASTNode)adaptor.BecomeRoot(UPDATE6_tree, root_0);
-			DebugLocation(138, 12);
-			// Hql.g:138:12: ( VERSIONED )?
-			int alt3=2;
-			try { DebugEnterSubRule(3);
-			try { DebugEnterDecision(3, false);
-			int LA3_1 = input.LA(1);
-
-			if ((LA3_1==VERSIONED))
-			{
-				alt3 = 1;
-			}
-			} finally { DebugExitDecision(3); }
-			switch (alt3)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:138:13: VERSIONED
-				{
-				DebugLocation(138, 13);
-				VERSIONED7=(IToken)Match(input,VERSIONED,Follow._VERSIONED_in_updateStatement658); 
-				VERSIONED7_tree = (IASTNode)adaptor.Create(VERSIONED7);
-				adaptor.AddChild(root_0, VERSIONED7_tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(3); }
-
-			DebugLocation(139, 3);
-			PushFollow(Follow._optionalFromTokenFromClause_in_updateStatement664);
-			optionalFromTokenFromClause8=optionalFromTokenFromClause();
-			PopFollow();
-
-			adaptor.AddChild(root_0, optionalFromTokenFromClause8.Tree);
-			DebugLocation(140, 3);
-			PushFollow(Follow._setClause_in_updateStatement668);
-			setClause9=setClause();
-			PopFollow();
-
-			adaptor.AddChild(root_0, setClause9.Tree);
-			DebugLocation(141, 3);
-			// Hql.g:141:3: ( whereClause )?
-			int alt4=2;
-			try { DebugEnterSubRule(4);
-			try { DebugEnterDecision(4, false);
-			int LA4_1 = input.LA(1);
-
-			if ((LA4_1==WHERE))
-			{
-				alt4 = 1;
-			}
-			} finally { DebugExitDecision(4); }
-			switch (alt4)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:141:4: whereClause
-				{
-				DebugLocation(141, 4);
-				PushFollow(Follow._whereClause_in_updateStatement673);
-				whereClause10=whereClause();
-				PopFollow();
-
-				adaptor.AddChild(root_0, whereClause10.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(4); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("updateStatement", 2);
-			LeaveRule("updateStatement", 2);
-			LeaveRule_updateStatement();
-		}
-		DebugLocation(142, 1);
-		} finally { DebugExitRule(GrammarFileName, "updateStatement"); }
-		return retval;
-
-	}
-	// $ANTLR end "updateStatement"
-
-	partial void EnterRule_setClause();
-	partial void LeaveRule_setClause();
-	// $ANTLR start "setClause"
-	// Hql.g:144:1: setClause : ( SET ^ assignment ( COMMA ! assignment )* ) ;
-	[GrammarRule("setClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> setClause()
-	{
-		EnterRule_setClause();
-		EnterRule("setClause", 3);
-		TraceIn("setClause", 3);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken SET11 = default(IToken);
-		IToken COMMA13 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> assignment12 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> assignment14 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode SET11_tree = default(IASTNode);
-		IASTNode COMMA13_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "setClause");
-		DebugLocation(144, 1);
-		try
-		{
-			// Hql.g:145:2: ( ( SET ^ assignment ( COMMA ! assignment )* ) )
-			DebugEnterAlt(1);
-			// Hql.g:145:4: ( SET ^ assignment ( COMMA ! assignment )* )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(145, 4);
-			// Hql.g:145:4: ( SET ^ assignment ( COMMA ! assignment )* )
-			DebugEnterAlt(1);
-			// Hql.g:145:5: SET ^ assignment ( COMMA ! assignment )*
-			{
-			DebugLocation(145, 8);
-			SET11=(IToken)Match(input,SET,Follow._SET_in_setClause687); 
-			SET11_tree = (IASTNode)adaptor.Create(SET11);
-			root_0 = (IASTNode)adaptor.BecomeRoot(SET11_tree, root_0);
-			DebugLocation(145, 10);
-			PushFollow(Follow._assignment_in_setClause690);
-			assignment12=assignment();
-			PopFollow();
-
-			adaptor.AddChild(root_0, assignment12.Tree);
-			DebugLocation(145, 21);
-			// Hql.g:145:21: ( COMMA ! assignment )*
-			try { DebugEnterSubRule(5);
-			while (true)
-			{
-				int alt5=2;
-				try { DebugEnterDecision(5, false);
-				int LA5_1 = input.LA(1);
-
-				if ((LA5_1==COMMA))
-				{
-					alt5 = 1;
-				}
-
-
-				} finally { DebugExitDecision(5); }
-				switch ( alt5 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:145:22: COMMA ! assignment
-					{
-					DebugLocation(145, 27);
-					COMMA13=(IToken)Match(input,COMMA,Follow._COMMA_in_setClause693); 
-					DebugLocation(145, 29);
-					PushFollow(Follow._assignment_in_setClause696);
-					assignment14=assignment();
-					PopFollow();
-
-					adaptor.AddChild(root_0, assignment14.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop5;
-				}
-			}
-
-			loop5:
-				;
-
-			} finally { DebugExitSubRule(5); }
-
-
-			}
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("setClause", 3);
-			LeaveRule("setClause", 3);
-			LeaveRule_setClause();
-		}
-		DebugLocation(146, 1);
-		} finally { DebugExitRule(GrammarFileName, "setClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "setClause"
-
-	partial void EnterRule_assignment();
-	partial void LeaveRule_assignment();
-	// $ANTLR start "assignment"
-	// Hql.g:148:1: assignment : stateField EQ ^ newValue ;
-	[GrammarRule("assignment")]
-	private AstParserRuleReturnScope<IASTNode, IToken> assignment()
-	{
-		EnterRule_assignment();
-		EnterRule("assignment", 4);
-		TraceIn("assignment", 4);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken EQ16 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> stateField15 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> newValue17 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode EQ16_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "assignment");
-		DebugLocation(148, 1);
-		try
-		{
-			// Hql.g:149:2: ( stateField EQ ^ newValue )
-			DebugEnterAlt(1);
-			// Hql.g:149:4: stateField EQ ^ newValue
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(149, 4);
-			PushFollow(Follow._stateField_in_assignment710);
-			stateField15=stateField();
-			PopFollow();
-
-			adaptor.AddChild(root_0, stateField15.Tree);
-			DebugLocation(149, 17);
-			EQ16=(IToken)Match(input,EQ,Follow._EQ_in_assignment712); 
-			EQ16_tree = (IASTNode)adaptor.Create(EQ16);
-			root_0 = (IASTNode)adaptor.BecomeRoot(EQ16_tree, root_0);
-			DebugLocation(149, 19);
-			PushFollow(Follow._newValue_in_assignment715);
-			newValue17=newValue();
-			PopFollow();
-
-			adaptor.AddChild(root_0, newValue17.Tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("assignment", 4);
-			LeaveRule("assignment", 4);
-			LeaveRule_assignment();
-		}
-		DebugLocation(150, 1);
-		} finally { DebugExitRule(GrammarFileName, "assignment"); }
-		return retval;
-
-	}
-	// $ANTLR end "assignment"
-
-	partial void EnterRule_stateField();
-	partial void LeaveRule_stateField();
-	// $ANTLR start "stateField"
-	// Hql.g:154:1: stateField : path ;
-	[GrammarRule("stateField")]
-	private AstParserRuleReturnScope<IASTNode, IToken> stateField()
-	{
-		EnterRule_stateField();
-		EnterRule("stateField", 5);
-		TraceIn("stateField", 5);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> path18 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		try { DebugEnterRule(GrammarFileName, "stateField");
-		DebugLocation(154, 1);
-		try
-		{
-			// Hql.g:155:2: ( path )
-			DebugEnterAlt(1);
-			// Hql.g:155:4: path
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(155, 4);
-			PushFollow(Follow._path_in_stateField728);
-			path18=path();
-			PopFollow();
-
-			adaptor.AddChild(root_0, path18.Tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("stateField", 5);
-			LeaveRule("stateField", 5);
-			LeaveRule_stateField();
-		}
-		DebugLocation(156, 1);
-		} finally { DebugExitRule(GrammarFileName, "stateField"); }
-		return retval;
-
-	}
-	// $ANTLR end "stateField"
-
-	partial void EnterRule_newValue();
-	partial void LeaveRule_newValue();
-	// $ANTLR start "newValue"
-	// Hql.g:160:1: newValue : concatenation ;
-	[GrammarRule("newValue")]
-	private AstParserRuleReturnScope<IASTNode, IToken> newValue()
-	{
-		EnterRule_newValue();
-		EnterRule("newValue", 6);
-		TraceIn("newValue", 6);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> concatenation19 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		try { DebugEnterRule(GrammarFileName, "newValue");
-		DebugLocation(160, 1);
-		try
-		{
-			// Hql.g:161:2: ( concatenation )
-			DebugEnterAlt(1);
-			// Hql.g:161:4: concatenation
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(161, 4);
-			PushFollow(Follow._concatenation_in_newValue741);
-			concatenation19=concatenation();
-			PopFollow();
-
-			adaptor.AddChild(root_0, concatenation19.Tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("newValue", 6);
-			LeaveRule("newValue", 6);
-			LeaveRule_newValue();
-		}
-		DebugLocation(162, 1);
-		} finally { DebugExitRule(GrammarFileName, "newValue"); }
-		return retval;
-
-	}
-	// $ANTLR end "newValue"
-
-	partial void EnterRule_deleteStatement();
-	partial void LeaveRule_deleteStatement();
-	// $ANTLR start "deleteStatement"
-	// Hql.g:164:1: deleteStatement : DELETE ^ ( optionalFromTokenFromClause ) ( whereClause )? ;
-	[GrammarRule("deleteStatement")]
-	private AstParserRuleReturnScope<IASTNode, IToken> deleteStatement()
-	{
-		EnterRule_deleteStatement();
-		EnterRule("deleteStatement", 7);
-		TraceIn("deleteStatement", 7);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken DELETE20 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> optionalFromTokenFromClause21 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> whereClause22 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode DELETE20_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "deleteStatement");
-		DebugLocation(164, 1);
-		try
-		{
-			// Hql.g:165:2: ( DELETE ^ ( optionalFromTokenFromClause ) ( whereClause )? )
-			DebugEnterAlt(1);
-			// Hql.g:165:4: DELETE ^ ( optionalFromTokenFromClause ) ( whereClause )?
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(165, 10);
-			DELETE20=(IToken)Match(input,DELETE,Follow._DELETE_in_deleteStatement752); 
-			DELETE20_tree = (IASTNode)adaptor.Create(DELETE20);
-			root_0 = (IASTNode)adaptor.BecomeRoot(DELETE20_tree, root_0);
-			DebugLocation(166, 3);
-			// Hql.g:166:3: ( optionalFromTokenFromClause )
-			DebugEnterAlt(1);
-			// Hql.g:166:4: optionalFromTokenFromClause
-			{
-			DebugLocation(166, 4);
-			PushFollow(Follow._optionalFromTokenFromClause_in_deleteStatement758);
-			optionalFromTokenFromClause21=optionalFromTokenFromClause();
-			PopFollow();
-
-			adaptor.AddChild(root_0, optionalFromTokenFromClause21.Tree);
-
-			}
-
-			DebugLocation(167, 3);
-			// Hql.g:167:3: ( whereClause )?
-			int alt6=2;
-			try { DebugEnterSubRule(6);
-			try { DebugEnterDecision(6, false);
-			int LA6_1 = input.LA(1);
-
-			if ((LA6_1==WHERE))
-			{
-				alt6 = 1;
-			}
-			} finally { DebugExitDecision(6); }
-			switch (alt6)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:167:4: whereClause
-				{
-				DebugLocation(167, 4);
-				PushFollow(Follow._whereClause_in_deleteStatement764);
-				whereClause22=whereClause();
-				PopFollow();
-
-				adaptor.AddChild(root_0, whereClause22.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(6); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("deleteStatement", 7);
-			LeaveRule("deleteStatement", 7);
-			LeaveRule_deleteStatement();
-		}
-		DebugLocation(168, 1);
-		} finally { DebugExitRule(GrammarFileName, "deleteStatement"); }
-		return retval;
-
-	}
-	// $ANTLR end "deleteStatement"
-
-	partial void EnterRule_optionalFromTokenFromClause();
-	partial void LeaveRule_optionalFromTokenFromClause();
-	// $ANTLR start "optionalFromTokenFromClause"
-	// Hql.g:172:1: optionalFromTokenFromClause : optionalFromTokenFromClause2 path ( asAlias )? -> ^( FROM ^( RANGE path ( asAlias )? ) ) ;
-	[GrammarRule("optionalFromTokenFromClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> optionalFromTokenFromClause()
-	{
-		EnterRule_optionalFromTokenFromClause();
-		EnterRule("optionalFromTokenFromClause", 8);
-		TraceIn("optionalFromTokenFromClause", 8);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> optionalFromTokenFromClause223 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> path24 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> asAlias25 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		RewriteRuleSubtreeStream stream_optionalFromTokenFromClause2=new RewriteRuleSubtreeStream(adaptor,"rule optionalFromTokenFromClause2");
-		RewriteRuleSubtreeStream stream_path=new RewriteRuleSubtreeStream(adaptor,"rule path");
-		RewriteRuleSubtreeStream stream_asAlias=new RewriteRuleSubtreeStream(adaptor,"rule asAlias");
-		try { DebugEnterRule(GrammarFileName, "optionalFromTokenFromClause");
-		DebugLocation(172, 1);
-		try
-		{
-			// Hql.g:173:2: ( optionalFromTokenFromClause2 path ( asAlias )? -> ^( FROM ^( RANGE path ( asAlias )? ) ) )
-			DebugEnterAlt(1);
-			// Hql.g:173:4: optionalFromTokenFromClause2 path ( asAlias )?
-			{
-			DebugLocation(173, 4);
-			PushFollow(Follow._optionalFromTokenFromClause2_in_optionalFromTokenFromClause779);
-			optionalFromTokenFromClause223=optionalFromTokenFromClause2();
-			PopFollow();
-
-			stream_optionalFromTokenFromClause2.Add(optionalFromTokenFromClause223.Tree);
-			DebugLocation(173, 33);
-			PushFollow(Follow._path_in_optionalFromTokenFromClause781);
-			path24=path();
-			PopFollow();
-
-			stream_path.Add(path24.Tree);
-			DebugLocation(173, 38);
-			// Hql.g:173:38: ( asAlias )?
-			int alt7=2;
-			try { DebugEnterSubRule(7);
-			try { DebugEnterDecision(7, false);
-			int LA7_1 = input.LA(1);
-
-			if ((LA7_1==AS||LA7_1==IDENT))
-			{
-				alt7 = 1;
-			}
-			} finally { DebugExitDecision(7); }
-			switch (alt7)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:173:39: asAlias
-				{
-				DebugLocation(173, 39);
-				PushFollow(Follow._asAlias_in_optionalFromTokenFromClause784);
-				asAlias25=asAlias();
-				PopFollow();
-
-				stream_asAlias.Add(asAlias25.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(7); }
-
-
-
-			{
-			// AST REWRITE
-			// elements: path, asAlias
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 174:3: -> ^( FROM ^( RANGE path ( asAlias )? ) )
-			{
-				DebugLocation(174, 6);
-				// Hql.g:174:6: ^( FROM ^( RANGE path ( asAlias )? ) )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(174, 8);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(FROM, "FROM"), root_1);
-
-				DebugLocation(174, 13);
-				// Hql.g:174:13: ^( RANGE path ( asAlias )? )
-				{
-				IASTNode root_2 = (IASTNode)adaptor.Nil();
-				DebugLocation(174, 15);
-				root_2 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(RANGE, "RANGE"), root_2);
-
-				DebugLocation(174, 21);
-				adaptor.AddChild(root_2, stream_path.NextTree());
-				DebugLocation(174, 26);
-				// Hql.g:174:26: ( asAlias )?
-				if (stream_asAlias.HasNext)
-				{
-					DebugLocation(174, 26);
-					adaptor.AddChild(root_2, stream_asAlias.NextTree());
-
-				}
-				stream_asAlias.Reset();
-
-				adaptor.AddChild(root_1, root_2);
-				}
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("optionalFromTokenFromClause", 8);
-			LeaveRule("optionalFromTokenFromClause", 8);
-			LeaveRule_optionalFromTokenFromClause();
-		}
-		DebugLocation(175, 1);
-		} finally { DebugExitRule(GrammarFileName, "optionalFromTokenFromClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "optionalFromTokenFromClause"
-
-	partial void EnterRule_optionalFromTokenFromClause2();
-	partial void LeaveRule_optionalFromTokenFromClause2();
-	// $ANTLR start "optionalFromTokenFromClause2"
-	// Hql.g:177:1: optionalFromTokenFromClause2 : ( FROM )? ;
-	[GrammarRule("optionalFromTokenFromClause2")]
-	private AstParserRuleReturnScope<IASTNode, IToken> optionalFromTokenFromClause2()
-	{
-		EnterRule_optionalFromTokenFromClause2();
-		EnterRule("optionalFromTokenFromClause2", 9);
-		TraceIn("optionalFromTokenFromClause2", 9);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken FROM26 = default(IToken);
-
-		IASTNode FROM26_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "optionalFromTokenFromClause2");
-		DebugLocation(177, 1);
-		try
-		{
-			// Hql.g:178:2: ( ( FROM )? )
-			DebugEnterAlt(1);
-			// Hql.g:178:4: ( FROM )?
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(178, 4);
-			// Hql.g:178:4: ( FROM )?
-			int alt8=2;
-			try { DebugEnterSubRule(8);
-			try { DebugEnterDecision(8, false);
-			int LA8_1 = input.LA(1);
-
-			if ((LA8_1==FROM))
-			{
-				alt8 = 1;
-			}
-			} finally { DebugExitDecision(8); }
-			switch (alt8)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:178:4: FROM
-				{
-				DebugLocation(178, 4);
-				FROM26=(IToken)Match(input,FROM,Follow._FROM_in_optionalFromTokenFromClause2815); 
-				FROM26_tree = (IASTNode)adaptor.Create(FROM26);
-				adaptor.AddChild(root_0, FROM26_tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(8); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("optionalFromTokenFromClause2", 9);
-			LeaveRule("optionalFromTokenFromClause2", 9);
-			LeaveRule_optionalFromTokenFromClause2();
-		}
-		DebugLocation(179, 1);
-		} finally { DebugExitRule(GrammarFileName, "optionalFromTokenFromClause2"); }
-		return retval;
-
-	}
-	// $ANTLR end "optionalFromTokenFromClause2"
-
-	partial void EnterRule_selectStatement();
-	partial void LeaveRule_selectStatement();
-	// $ANTLR start "selectStatement"
-	// Hql.g:181:1: selectStatement : q= queryRule -> ^( QUERY[\"query\"] $q) ;
-	[GrammarRule("selectStatement")]
-	private AstParserRuleReturnScope<IASTNode, IToken> selectStatement()
-	{
-		EnterRule_selectStatement();
-		EnterRule("selectStatement", 10);
-		TraceIn("selectStatement", 10);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> q = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		RewriteRuleSubtreeStream stream_queryRule=new RewriteRuleSubtreeStream(adaptor,"rule queryRule");
-		try { DebugEnterRule(GrammarFileName, "selectStatement");
-		DebugLocation(181, 1);
-		try
-		{
-			// Hql.g:183:2: (q= queryRule -> ^( QUERY[\"query\"] $q) )
-			DebugEnterAlt(1);
-			// Hql.g:183:4: q= queryRule
-			{
-			DebugLocation(183, 5);
-			PushFollow(Follow._queryRule_in_selectStatement830);
-			q=queryRule();
-			PopFollow();
-
-			stream_queryRule.Add(q.Tree);
-
-
-			{
-			// AST REWRITE
-			// elements: q
-			// token labels: 
-			// rule labels: q, retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_q=new RewriteRuleSubtreeStream(adaptor,"rule q",q!=null?q.Tree:null);
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 184:2: -> ^( QUERY[\"query\"] $q)
-			{
-				DebugLocation(184, 5);
-				// Hql.g:184:5: ^( QUERY[\"query\"] $q)
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(184, 7);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(QUERY, "query"), root_1);
-
-				DebugLocation(184, 23);
-				adaptor.AddChild(root_1, stream_q.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("selectStatement", 10);
-			LeaveRule("selectStatement", 10);
-			LeaveRule_selectStatement();
-		}
-		DebugLocation(185, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectStatement"); }
-		return retval;
-
-	}
-	// $ANTLR end "selectStatement"
-
-	partial void EnterRule_insertStatement();
-	partial void LeaveRule_insertStatement();
-	// $ANTLR start "insertStatement"
-	// Hql.g:187:1: insertStatement : INSERT ^ intoClause selectStatement ;
-	[GrammarRule("insertStatement")]
-	private AstParserRuleReturnScope<IASTNode, IToken> insertStatement()
-	{
-		EnterRule_insertStatement();
-		EnterRule("insertStatement", 11);
-		TraceIn("insertStatement", 11);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken INSERT27 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> intoClause28 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> selectStatement29 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode INSERT27_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "insertStatement");
-		DebugLocation(187, 1);
-		try
-		{
-			// Hql.g:191:2: ( INSERT ^ intoClause selectStatement )
-			DebugEnterAlt(1);
-			// Hql.g:191:4: INSERT ^ intoClause selectStatement
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(191, 10);
-			INSERT27=(IToken)Match(input,INSERT,Follow._INSERT_in_insertStatement859); 
-			INSERT27_tree = (IASTNode)adaptor.Create(INSERT27);
-			root_0 = (IASTNode)adaptor.BecomeRoot(INSERT27_tree, root_0);
-			DebugLocation(191, 12);
-			PushFollow(Follow._intoClause_in_insertStatement862);
-			intoClause28=intoClause();
-			PopFollow();
-
-			adaptor.AddChild(root_0, intoClause28.Tree);
-			DebugLocation(191, 23);
-			PushFollow(Follow._selectStatement_in_insertStatement864);
-			selectStatement29=selectStatement();
-			PopFollow();
-
-			adaptor.AddChild(root_0, selectStatement29.Tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("insertStatement", 11);
-			LeaveRule("insertStatement", 11);
-			LeaveRule_insertStatement();
-		}
-		DebugLocation(192, 1);
-		} finally { DebugExitRule(GrammarFileName, "insertStatement"); }
-		return retval;
-
-	}
-	// $ANTLR end "insertStatement"
-
-	partial void EnterRule_intoClause();
-	partial void LeaveRule_intoClause();
-	// $ANTLR start "intoClause"
-	// Hql.g:194:1: intoClause : INTO ^ path insertablePropertySpec ;
-	[GrammarRule("intoClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> intoClause()
-	{
-		EnterRule_intoClause();
-		EnterRule("intoClause", 12);
-		TraceIn("intoClause", 12);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken INTO30 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> path31 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> insertablePropertySpec32 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode INTO30_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "intoClause");
-		DebugLocation(194, 1);
-		try
-		{
-			// Hql.g:195:2: ( INTO ^ path insertablePropertySpec )
-			DebugEnterAlt(1);
-			// Hql.g:195:4: INTO ^ path insertablePropertySpec
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(195, 8);
-			INTO30=(IToken)Match(input,INTO,Follow._INTO_in_intoClause875); 
-			INTO30_tree = (IASTNode)adaptor.Create(INTO30);
-			root_0 = (IASTNode)adaptor.BecomeRoot(INTO30_tree, root_0);
-			DebugLocation(195, 10);
-			PushFollow(Follow._path_in_intoClause878);
-			path31=path();
-			PopFollow();
-
-			adaptor.AddChild(root_0, path31.Tree);
-			DebugLocation(195, 15);
-			 WeakKeywords(); 
-			DebugLocation(195, 35);
-			PushFollow(Follow._insertablePropertySpec_in_intoClause882);
-			insertablePropertySpec32=insertablePropertySpec();
-			PopFollow();
-
-			adaptor.AddChild(root_0, insertablePropertySpec32.Tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("intoClause", 12);
-			LeaveRule("intoClause", 12);
-			LeaveRule_intoClause();
-		}
-		DebugLocation(196, 1);
-		} finally { DebugExitRule(GrammarFileName, "intoClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "intoClause"
-
-	partial void EnterRule_insertablePropertySpec();
-	partial void LeaveRule_insertablePropertySpec();
-	// $ANTLR start "insertablePropertySpec"
-	// Hql.g:198:1: insertablePropertySpec : OPEN primaryExpression ( COMMA primaryExpression )* CLOSE -> ^( RANGE[\"column-spec\"] ( primaryExpression )* ) ;
-	[GrammarRule("insertablePropertySpec")]
-	private AstParserRuleReturnScope<IASTNode, IToken> insertablePropertySpec()
-	{
-		EnterRule_insertablePropertySpec();
-		EnterRule("insertablePropertySpec", 13);
-		TraceIn("insertablePropertySpec", 13);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken OPEN33 = default(IToken);
-		IToken COMMA35 = default(IToken);
-		IToken CLOSE37 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> primaryExpression34 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> primaryExpression36 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode OPEN33_tree = default(IASTNode);
-		IASTNode COMMA35_tree = default(IASTNode);
-		IASTNode CLOSE37_tree = default(IASTNode);
-		RewriteRuleITokenStream stream_OPEN=new RewriteRuleITokenStream(adaptor,"token OPEN");
-		RewriteRuleITokenStream stream_COMMA=new RewriteRuleITokenStream(adaptor,"token COMMA");
-		RewriteRuleITokenStream stream_CLOSE=new RewriteRuleITokenStream(adaptor,"token CLOSE");
-		RewriteRuleSubtreeStream stream_primaryExpression=new RewriteRuleSubtreeStream(adaptor,"rule primaryExpression");
-		try { DebugEnterRule(GrammarFileName, "insertablePropertySpec");
-		DebugLocation(198, 1);
-		try
-		{
-			// Hql.g:199:2: ( OPEN primaryExpression ( COMMA primaryExpression )* CLOSE -> ^( RANGE[\"column-spec\"] ( primaryExpression )* ) )
-			DebugEnterAlt(1);
-			// Hql.g:199:4: OPEN primaryExpression ( COMMA primaryExpression )* CLOSE
-			{
-			DebugLocation(199, 4);
-			OPEN33=(IToken)Match(input,OPEN,Follow._OPEN_in_insertablePropertySpec893);  
-			stream_OPEN.Add(OPEN33);
-
-			DebugLocation(199, 9);
-			PushFollow(Follow._primaryExpression_in_insertablePropertySpec895);
-			primaryExpression34=primaryExpression();
-			PopFollow();
-
-			stream_primaryExpression.Add(primaryExpression34.Tree);
-			DebugLocation(199, 27);
-			// Hql.g:199:27: ( COMMA primaryExpression )*
-			try { DebugEnterSubRule(9);
-			while (true)
-			{
-				int alt9=2;
-				try { DebugEnterDecision(9, false);
-				int LA9_1 = input.LA(1);
-
-				if ((LA9_1==COMMA))
-				{
-					alt9 = 1;
-				}
-
-
-				} finally { DebugExitDecision(9); }
-				switch ( alt9 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:199:29: COMMA primaryExpression
-					{
-					DebugLocation(199, 29);
-					COMMA35=(IToken)Match(input,COMMA,Follow._COMMA_in_insertablePropertySpec899);  
-					stream_COMMA.Add(COMMA35);
-
-					DebugLocation(199, 35);
-					PushFollow(Follow._primaryExpression_in_insertablePropertySpec901);
-					primaryExpression36=primaryExpression();
-					PopFollow();
-
-					stream_primaryExpression.Add(primaryExpression36.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop9;
-				}
-			}
-
-			loop9:
-				;
-
-			} finally { DebugExitSubRule(9); }
-
-			DebugLocation(199, 56);
-			CLOSE37=(IToken)Match(input,CLOSE,Follow._CLOSE_in_insertablePropertySpec906);  
-			stream_CLOSE.Add(CLOSE37);
-
-
-
-			{
-			// AST REWRITE
-			// elements: primaryExpression
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 200:3: -> ^( RANGE[\"column-spec\"] ( primaryExpression )* )
-			{
-				DebugLocation(200, 6);
-				// Hql.g:200:6: ^( RANGE[\"column-spec\"] ( primaryExpression )* )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(200, 8);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(RANGE, "column-spec"), root_1);
-
-				DebugLocation(200, 29);
-				// Hql.g:200:29: ( primaryExpression )*
-				while ( stream_primaryExpression.HasNext )
-				{
-					DebugLocation(200, 29);
-					adaptor.AddChild(root_1, stream_primaryExpression.NextTree());
-
-				}
-				stream_primaryExpression.Reset();
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("insertablePropertySpec", 13);
-			LeaveRule("insertablePropertySpec", 13);
-			LeaveRule_insertablePropertySpec();
-		}
-		DebugLocation(201, 1);
-		} finally { DebugExitRule(GrammarFileName, "insertablePropertySpec"); }
-		return retval;
-
-	}
-	// $ANTLR end "insertablePropertySpec"
-
-	partial void EnterRule_queryRule();
-	partial void LeaveRule_queryRule();
-	// $ANTLR start "queryRule"
-	// Hql.g:206:1: queryRule : selectFrom ( whereClause )? ( groupByClause )? ( havingClause )? ( orderByClause )? ( skipClause )? ( takeClause )? ;
-	[GrammarRule("queryRule")]
-	private AstParserRuleReturnScope<IASTNode, IToken> queryRule()
-	{
-		EnterRule_queryRule();
-		EnterRule("queryRule", 14);
-		TraceIn("queryRule", 14);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> selectFrom38 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> whereClause39 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> groupByClause40 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> havingClause41 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> orderByClause42 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> skipClause43 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> takeClause44 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-
-				++queryDepth;
-			
-		try { DebugEnterRule(GrammarFileName, "queryRule");
-		DebugLocation(206, 2);
-		try
-		{
-			// Hql.g:213:2: ( selectFrom ( whereClause )? ( groupByClause )? ( havingClause )? ( orderByClause )? ( skipClause )? ( takeClause )? )
-			DebugEnterAlt(1);
-			// Hql.g:213:4: selectFrom ( whereClause )? ( groupByClause )? ( havingClause )? ( orderByClause )? ( skipClause )? ( takeClause )?
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(213, 4);
-			PushFollow(Follow._selectFrom_in_queryRule944);
-			selectFrom38=selectFrom();
-			PopFollow();
-
-			adaptor.AddChild(root_0, selectFrom38.Tree);
-			DebugLocation(214, 3);
-			// Hql.g:214:3: ( whereClause )?
-			int alt10=2;
-			try { DebugEnterSubRule(10);
-			try { DebugEnterDecision(10, false);
-			int LA10_1 = input.LA(1);
-
-			if ((LA10_1==WHERE))
-			{
-				alt10 = 1;
-			}
-			} finally { DebugExitDecision(10); }
-			switch (alt10)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:214:4: whereClause
-				{
-				DebugLocation(214, 4);
-				PushFollow(Follow._whereClause_in_queryRule949);
-				whereClause39=whereClause();
-				PopFollow();
-
-				adaptor.AddChild(root_0, whereClause39.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(10); }
-
-			DebugLocation(215, 3);
-			// Hql.g:215:3: ( groupByClause )?
-			int alt11=2;
-			try { DebugEnterSubRule(11);
-			try { DebugEnterDecision(11, false);
-			int LA11_1 = input.LA(1);
-
-			if ((LA11_1==GROUP))
-			{
-				alt11 = 1;
-			}
-			} finally { DebugExitDecision(11); }
-			switch (alt11)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:215:4: groupByClause
-				{
-				DebugLocation(215, 4);
-				PushFollow(Follow._groupByClause_in_queryRule956);
-				groupByClause40=groupByClause();
-				PopFollow();
-
-				adaptor.AddChild(root_0, groupByClause40.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(11); }
-
-			DebugLocation(216, 3);
-			// Hql.g:216:3: ( havingClause )?
-			int alt12=2;
-			try { DebugEnterSubRule(12);
-			try { DebugEnterDecision(12, false);
-			int LA12_1 = input.LA(1);
-
-			if ((LA12_1==HAVING))
-			{
-				alt12 = 1;
-			}
-			} finally { DebugExitDecision(12); }
-			switch (alt12)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:216:4: havingClause
-				{
-				DebugLocation(216, 4);
-				PushFollow(Follow._havingClause_in_queryRule963);
-				havingClause41=havingClause();
-				PopFollow();
-
-				adaptor.AddChild(root_0, havingClause41.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(12); }
-
-			DebugLocation(217, 3);
-			// Hql.g:217:3: ( orderByClause )?
-			int alt13=2;
-			try { DebugEnterSubRule(13);
-			try { DebugEnterDecision(13, false);
-			int LA13_1 = input.LA(1);
-
-			if ((LA13_1==ORDER))
-			{
-				alt13 = 1;
-			}
-			} finally { DebugExitDecision(13); }
-			switch (alt13)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:217:4: orderByClause
-				{
-				DebugLocation(217, 4);
-				PushFollow(Follow._orderByClause_in_queryRule970);
-				orderByClause42=orderByClause();
-				PopFollow();
-
-				adaptor.AddChild(root_0, orderByClause42.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(13); }
-
-			DebugLocation(218, 3);
-			// Hql.g:218:3: ( skipClause )?
-			int alt14=2;
-			try { DebugEnterSubRule(14);
-			try { DebugEnterDecision(14, false);
-			int LA14_1 = input.LA(1);
-
-			if ((LA14_1==SKIP))
-			{
-				alt14 = 1;
-			}
-			} finally { DebugExitDecision(14); }
-			switch (alt14)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:218:4: skipClause
-				{
-				DebugLocation(218, 4);
-				PushFollow(Follow._skipClause_in_queryRule977);
-				skipClause43=skipClause();
-				PopFollow();
-
-				adaptor.AddChild(root_0, skipClause43.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(14); }
-
-			DebugLocation(219, 3);
-			// Hql.g:219:3: ( takeClause )?
-			int alt15=2;
-			try { DebugEnterSubRule(15);
-			try { DebugEnterDecision(15, false);
-			int LA15_1 = input.LA(1);
-
-			if ((LA15_1==TAKE))
-			{
-				alt15 = 1;
-			}
-			} finally { DebugExitDecision(15); }
-			switch (alt15)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:219:4: takeClause
-				{
-				DebugLocation(219, 4);
-				PushFollow(Follow._takeClause_in_queryRule984);
-				takeClause44=takeClause();
-				PopFollow();
-
-				adaptor.AddChild(root_0, takeClause44.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(15); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-
-					--queryDepth;
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("queryRule", 14);
-			LeaveRule("queryRule", 14);
-			LeaveRule_queryRule();
-		}
-		DebugLocation(220, 2);
-		} finally { DebugExitRule(GrammarFileName, "queryRule"); }
-		return retval;
-
-	}
-	// $ANTLR end "queryRule"
-
-	partial void EnterRule_selectFrom();
-	partial void LeaveRule_selectFrom();
-	// $ANTLR start "selectFrom"
-	// Hql.g:222:1: selectFrom : (s= selectClause )? (f= fromClause )? -> {$f.tree == null && filter}? ^( SELECT_FROM FROM[\"{filter-implied FROM}\"] ( selectClause )? ) -> ^( SELECT_FROM ( fromClause )? ( selectClause )? ) ;
-	[GrammarRule("selectFrom")]
-	private AstParserRuleReturnScope<IASTNode, IToken> selectFrom()
-	{
-		EnterRule_selectFrom();
-		EnterRule("selectFrom", 15);
-		TraceIn("selectFrom", 15);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> s = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> f = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		RewriteRuleSubtreeStream stream_selectClause=new RewriteRuleSubtreeStream(adaptor,"rule selectClause");
-		RewriteRuleSubtreeStream stream_fromClause=new RewriteRuleSubtreeStream(adaptor,"rule fromClause");
-		try { DebugEnterRule(GrammarFileName, "selectFrom");
-		DebugLocation(222, 1);
-		try
-		{
-			// Hql.g:223:2: ( (s= selectClause )? (f= fromClause )? -> {$f.tree == null && filter}? ^( SELECT_FROM FROM[\"{filter-implied FROM}\"] ( selectClause )? ) -> ^( SELECT_FROM ( fromClause )? ( selectClause )? ) )
-			DebugEnterAlt(1);
-			// Hql.g:223:5: (s= selectClause )? (f= fromClause )?
-			{
-			DebugLocation(223, 5);
-			// Hql.g:223:5: (s= selectClause )?
-			int alt16=2;
-			try { DebugEnterSubRule(16);
-			try { DebugEnterDecision(16, false);
-			int LA16_1 = input.LA(1);
-
-			if ((LA16_1==SELECT))
-			{
-				alt16 = 1;
-			}
-			} finally { DebugExitDecision(16); }
-			switch (alt16)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:223:6: s= selectClause
-				{
-				DebugLocation(223, 7);
-				PushFollow(Follow._selectClause_in_selectFrom1002);
-				s=selectClause();
-				PopFollow();
-
-				stream_selectClause.Add(s.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(16); }
-
-			DebugLocation(223, 23);
-			// Hql.g:223:23: (f= fromClause )?
-			int alt17=2;
-			try { DebugEnterSubRule(17);
-			try { DebugEnterDecision(17, false);
-			int LA17_1 = input.LA(1);
-
-			if ((LA17_1==FROM))
-			{
-				alt17 = 1;
-			}
-			} finally { DebugExitDecision(17); }
-			switch (alt17)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:223:24: f= fromClause
-				{
-				DebugLocation(223, 25);
-				PushFollow(Follow._fromClause_in_selectFrom1009);
-				f=fromClause();
-				PopFollow();
-
-				stream_fromClause.Add(f.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(17); }
-
-			DebugLocation(224, 3);
-
-						if ((f!=null?((IASTNode)f.Tree):default(IASTNode)) == null && !(filter && queryDepth == 1)) 
-							throw new RecognitionException("FROM expected (non-filter queries must contain a FROM clause)");
-					
-
-
-			{
-			// AST REWRITE
-			// elements: selectClause, fromClause, selectClause
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 228:3: -> {$f.tree == null && filter}? ^( SELECT_FROM FROM[\"{filter-implied FROM}\"] ( selectClause )? )
-			if ((f!=null?((IASTNode)f.Tree):default(IASTNode)) == null && filter)
-			{
-				DebugLocation(228, 35);
-				// Hql.g:228:35: ^( SELECT_FROM FROM[\"{filter-implied FROM}\"] ( selectClause )? )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(228, 37);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(SELECT_FROM, "SELECT_FROM"), root_1);
-
-				DebugLocation(228, 49);
-				adaptor.AddChild(root_1, (IASTNode)adaptor.Create(FROM, "{filter-implied FROM}"));
-				DebugLocation(228, 79);
-				// Hql.g:228:79: ( selectClause )?
-				if (stream_selectClause.HasNext)
-				{
-					DebugLocation(228, 79);
-					adaptor.AddChild(root_1, stream_selectClause.NextTree());
-
-				}
-				stream_selectClause.Reset();
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-			else // 229:3: -> ^( SELECT_FROM ( fromClause )? ( selectClause )? )
-			{
-				DebugLocation(229, 6);
-				// Hql.g:229:6: ^( SELECT_FROM ( fromClause )? ( selectClause )? )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(229, 8);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(SELECT_FROM, "SELECT_FROM"), root_1);
-
-				DebugLocation(229, 20);
-				// Hql.g:229:20: ( fromClause )?
-				if (stream_fromClause.HasNext)
-				{
-					DebugLocation(229, 20);
-					adaptor.AddChild(root_1, stream_fromClause.NextTree());
-
-				}
-				stream_fromClause.Reset();
-				DebugLocation(229, 32);
-				// Hql.g:229:32: ( selectClause )?
-				if (stream_selectClause.HasNext)
-				{
-					DebugLocation(229, 32);
-					adaptor.AddChild(root_1, stream_selectClause.NextTree());
-
-				}
-				stream_selectClause.Reset();
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("selectFrom", 15);
-			LeaveRule("selectFrom", 15);
-			LeaveRule_selectFrom();
-		}
-		DebugLocation(230, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectFrom"); }
-		return retval;
-
-	}
-	// $ANTLR end "selectFrom"
-
-	partial void EnterRule_selectClause();
-	partial void LeaveRule_selectClause();
-	// $ANTLR start "selectClause"
-	// Hql.g:233:1: selectClause : SELECT ^ ( DISTINCT )? ( selectedPropertiesList | newExpression | selectObject ) ;
-	[GrammarRule("selectClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> selectClause()
-	{
-		EnterRule_selectClause();
-		EnterRule("selectClause", 16);
-		TraceIn("selectClause", 16);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken SELECT45 = default(IToken);
-		IToken DISTINCT46 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> selectedPropertiesList47 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> newExpression48 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> selectObject49 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode SELECT45_tree = default(IASTNode);
-		IASTNode DISTINCT46_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "selectClause");
-		DebugLocation(233, 1);
-		try
-		{
-			// Hql.g:234:2: ( SELECT ^ ( DISTINCT )? ( selectedPropertiesList | newExpression | selectObject ) )
-			DebugEnterAlt(1);
-			// Hql.g:234:4: SELECT ^ ( DISTINCT )? ( selectedPropertiesList | newExpression | selectObject )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(234, 10);
-			SELECT45=(IToken)Match(input,SELECT,Follow._SELECT_in_selectClause1058); 
-			SELECT45_tree = (IASTNode)adaptor.Create(SELECT45);
-			root_0 = (IASTNode)adaptor.BecomeRoot(SELECT45_tree, root_0);
-			DebugLocation(235, 3);
-			 WeakKeywords(); 
-			DebugLocation(236, 3);
-			// Hql.g:236:3: ( DISTINCT )?
-			int alt18=2;
-			try { DebugEnterSubRule(18);
-			try { DebugEnterDecision(18, false);
-			int LA18_1 = input.LA(1);
-
-			if ((LA18_1==DISTINCT))
-			{
-				alt18 = 1;
-			}
-			} finally { DebugExitDecision(18); }
-			switch (alt18)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:236:4: DISTINCT
-				{
-				DebugLocation(236, 4);
-				DISTINCT46=(IToken)Match(input,DISTINCT,Follow._DISTINCT_in_selectClause1070); 
-				DISTINCT46_tree = (IASTNode)adaptor.Create(DISTINCT46);
-				adaptor.AddChild(root_0, DISTINCT46_tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(18); }
-
-			DebugLocation(236, 15);
-			// Hql.g:236:15: ( selectedPropertiesList | newExpression | selectObject )
-			int alt19=3;
-			try { DebugEnterSubRule(19);
-			try { DebugEnterDecision(19, false);
-			switch (input.LA(1))
-			{
-			case ALL:
-			case ANY:
-			case AVG:
-			case BNOT:
-			case CASE:
-			case COLON:
-			case COUNT:
-			case ELEMENTS:
-			case EMPTY:
-			case EXISTS:
-			case FALSE:
-			case IDENT:
-			case INDICES:
-			case MAX:
-			case MIN:
-			case MINUS:
-			case NOT:
-			case NULL:
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case OPEN:
-			case PARAM:
-			case PLUS:
-			case QUOTED_String:
-			case SOME:
-			case SUM:
-			case TRUE:
-				{
-				alt19 = 1;
-				}
-				break;
-			case NEW:
-				{
-				alt19 = 2;
-				}
-				break;
-			case OBJECT:
-				{
-				alt19 = 3;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 19, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(19); }
-			switch (alt19)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:236:17: selectedPropertiesList
-				{
-				DebugLocation(236, 17);
-				PushFollow(Follow._selectedPropertiesList_in_selectClause1076);
-				selectedPropertiesList47=selectedPropertiesList();
-				PopFollow();
-
-				adaptor.AddChild(root_0, selectedPropertiesList47.Tree);
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:236:42: newExpression
-				{
-				DebugLocation(236, 42);
-				PushFollow(Follow._newExpression_in_selectClause1080);
-				newExpression48=newExpression();
-				PopFollow();
-
-				adaptor.AddChild(root_0, newExpression48.Tree);
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// Hql.g:236:58: selectObject
-				{
-				DebugLocation(236, 58);
-				PushFollow(Follow._selectObject_in_selectClause1084);
-				selectObject49=selectObject();
-				PopFollow();
-
-				adaptor.AddChild(root_0, selectObject49.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(19); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("selectClause", 16);
-			LeaveRule("selectClause", 16);
-			LeaveRule_selectClause();
-		}
-		DebugLocation(237, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "selectClause"
-
-	partial void EnterRule_newExpression();
-	partial void LeaveRule_newExpression();
-	// $ANTLR start "newExpression"
-	// Hql.g:239:1: newExpression : ( NEW path ) op= OPEN selectedPropertiesList CLOSE -> ^( CONSTRUCTOR[$op] path selectedPropertiesList ) ;
-	[GrammarRule("newExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> newExpression()
-	{
-		EnterRule_newExpression();
-		EnterRule("newExpression", 17);
-		TraceIn("newExpression", 17);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken op = default(IToken);
-		IToken NEW50 = default(IToken);
-		IToken CLOSE53 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> path51 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> selectedPropertiesList52 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode op_tree = default(IASTNode);
-		IASTNode NEW50_tree = default(IASTNode);
-		IASTNode CLOSE53_tree = default(IASTNode);
-		RewriteRuleITokenStream stream_NEW=new RewriteRuleITokenStream(adaptor,"token NEW");
-		RewriteRuleITokenStream stream_OPEN=new RewriteRuleITokenStream(adaptor,"token OPEN");
-		RewriteRuleITokenStream stream_CLOSE=new RewriteRuleITokenStream(adaptor,"token CLOSE");
-		RewriteRuleSubtreeStream stream_path=new RewriteRuleSubtreeStream(adaptor,"rule path");
-		RewriteRuleSubtreeStream stream_selectedPropertiesList=new RewriteRuleSubtreeStream(adaptor,"rule selectedPropertiesList");
-		try { DebugEnterRule(GrammarFileName, "newExpression");
-		DebugLocation(239, 1);
-		try
-		{
-			// Hql.g:240:2: ( ( NEW path ) op= OPEN selectedPropertiesList CLOSE -> ^( CONSTRUCTOR[$op] path selectedPropertiesList ) )
-			DebugEnterAlt(1);
-			// Hql.g:240:4: ( NEW path ) op= OPEN selectedPropertiesList CLOSE
-			{
-			DebugLocation(240, 4);
-			// Hql.g:240:4: ( NEW path )
-			DebugEnterAlt(1);
-			// Hql.g:240:5: NEW path
-			{
-			DebugLocation(240, 5);
-			NEW50=(IToken)Match(input,NEW,Follow._NEW_in_newExpression1098);  
-			stream_NEW.Add(NEW50);
-
-			DebugLocation(240, 9);
-			PushFollow(Follow._path_in_newExpression1100);
-			path51=path();
-			PopFollow();
-
-			stream_path.Add(path51.Tree);
-
-			}
-
-			DebugLocation(240, 17);
-			op=(IToken)Match(input,OPEN,Follow._OPEN_in_newExpression1105);  
-			stream_OPEN.Add(op);
-
-			DebugLocation(240, 23);
-			PushFollow(Follow._selectedPropertiesList_in_newExpression1107);
-			selectedPropertiesList52=selectedPropertiesList();
-			PopFollow();
-
-			stream_selectedPropertiesList.Add(selectedPropertiesList52.Tree);
-			DebugLocation(240, 46);
-			CLOSE53=(IToken)Match(input,CLOSE,Follow._CLOSE_in_newExpression1109);  
-			stream_CLOSE.Add(CLOSE53);
-
-
-
-			{
-			// AST REWRITE
-			// elements: path, selectedPropertiesList
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 241:3: -> ^( CONSTRUCTOR[$op] path selectedPropertiesList )
-			{
-				DebugLocation(241, 6);
-				// Hql.g:241:6: ^( CONSTRUCTOR[$op] path selectedPropertiesList )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(241, 8);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(CONSTRUCTOR, op), root_1);
-
-				DebugLocation(241, 25);
-				adaptor.AddChild(root_1, stream_path.NextTree());
-				DebugLocation(241, 30);
-				adaptor.AddChild(root_1, stream_selectedPropertiesList.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("newExpression", 17);
-			LeaveRule("newExpression", 17);
-			LeaveRule_newExpression();
-		}
-		DebugLocation(242, 1);
-		} finally { DebugExitRule(GrammarFileName, "newExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "newExpression"
-
-	partial void EnterRule_selectObject();
-	partial void LeaveRule_selectObject();
-	// $ANTLR start "selectObject"
-	// Hql.g:244:1: selectObject : OBJECT ^ OPEN ! identifier CLOSE !;
-	[GrammarRule("selectObject")]
-	private AstParserRuleReturnScope<IASTNode, IToken> selectObject()
-	{
-		EnterRule_selectObject();
-		EnterRule("selectObject", 18);
-		TraceIn("selectObject", 18);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken OBJECT54 = default(IToken);
-		IToken OPEN55 = default(IToken);
-		IToken CLOSE57 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> identifier56 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode OBJECT54_tree = default(IASTNode);
-		IASTNode OPEN55_tree = default(IASTNode);
-		IASTNode CLOSE57_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "selectObject");
-		DebugLocation(244, 3);
-		try
-		{
-			// Hql.g:245:4: ( OBJECT ^ OPEN ! identifier CLOSE !)
-			DebugEnterAlt(1);
-			// Hql.g:245:6: OBJECT ^ OPEN ! identifier CLOSE !
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(245, 12);
-			OBJECT54=(IToken)Match(input,OBJECT,Follow._OBJECT_in_selectObject1135); 
-			OBJECT54_tree = (IASTNode)adaptor.Create(OBJECT54);
-			root_0 = (IASTNode)adaptor.BecomeRoot(OBJECT54_tree, root_0);
-			DebugLocation(245, 18);
-			OPEN55=(IToken)Match(input,OPEN,Follow._OPEN_in_selectObject1138); 
-			DebugLocation(245, 20);
-			PushFollow(Follow._identifier_in_selectObject1141);
-			identifier56=identifier();
-			PopFollow();
-
-			adaptor.AddChild(root_0, identifier56.Tree);
-			DebugLocation(245, 36);
-			CLOSE57=(IToken)Match(input,CLOSE,Follow._CLOSE_in_selectObject1143); 
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("selectObject", 18);
-			LeaveRule("selectObject", 18);
-			LeaveRule_selectObject();
-		}
-		DebugLocation(246, 3);
-		} finally { DebugExitRule(GrammarFileName, "selectObject"); }
-		return retval;
-
-	}
-	// $ANTLR end "selectObject"
-
-	partial void EnterRule_fromClause();
-	partial void LeaveRule_fromClause();
-	// $ANTLR start "fromClause"
-	// Hql.g:252:1: fromClause : FROM ^ fromRange ( fromJoin | COMMA ! fromRange )* ;
-	[GrammarRule("fromClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> fromClause()
-	{
-		EnterRule_fromClause();
-		EnterRule("fromClause", 19);
-		TraceIn("fromClause", 19);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken FROM58 = default(IToken);
-		IToken COMMA61 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> fromRange59 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> fromJoin60 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> fromRange62 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode FROM58_tree = default(IASTNode);
-		IASTNode COMMA61_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "fromClause");
-		DebugLocation(252, 1);
-		try
-		{
-			// Hql.g:253:2: ( FROM ^ fromRange ( fromJoin | COMMA ! fromRange )* )
-			DebugEnterAlt(1);
-			// Hql.g:253:4: FROM ^ fromRange ( fromJoin | COMMA ! fromRange )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(253, 8);
-			FROM58=(IToken)Match(input,FROM,Follow._FROM_in_fromClause1161); 
-			FROM58_tree = (IASTNode)adaptor.Create(FROM58);
-			root_0 = (IASTNode)adaptor.BecomeRoot(FROM58_tree, root_0);
-			DebugLocation(253, 10);
-			 WeakKeywords(); 
-			DebugLocation(253, 30);
-			PushFollow(Follow._fromRange_in_fromClause1166);
-			fromRange59=fromRange();
-			PopFollow();
-
-			adaptor.AddChild(root_0, fromRange59.Tree);
-			DebugLocation(253, 40);
-			// Hql.g:253:40: ( fromJoin | COMMA ! fromRange )*
-			try { DebugEnterSubRule(20);
-			while (true)
-			{
-				int alt20=3;
-				try { DebugEnterDecision(20, false);
-				int LA20_1 = input.LA(1);
-
-				if ((LA20_1==FULL||LA20_1==INNER||LA20_1==JOIN||LA20_1==LEFT||LA20_1==RIGHT))
-				{
-					alt20 = 1;
-				}
-				else if ((LA20_1==COMMA))
-				{
-					alt20 = 2;
-				}
-
-
-				} finally { DebugExitDecision(20); }
-				switch ( alt20 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:253:42: fromJoin
-					{
-					DebugLocation(253, 42);
-					PushFollow(Follow._fromJoin_in_fromClause1170);
-					fromJoin60=fromJoin();
-					PopFollow();
-
-					adaptor.AddChild(root_0, fromJoin60.Tree);
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:253:53: COMMA ! fromRange
-					{
-					DebugLocation(253, 58);
-					COMMA61=(IToken)Match(input,COMMA,Follow._COMMA_in_fromClause1174); 
-					DebugLocation(253, 60);
-					 WeakKeywords(); 
-					DebugLocation(253, 80);
-					PushFollow(Follow._fromRange_in_fromClause1179);
-					fromRange62=fromRange();
-					PopFollow();
-
-					adaptor.AddChild(root_0, fromRange62.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop20;
-				}
-			}
-
-			loop20:
-				;
-
-			} finally { DebugExitSubRule(20); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("fromClause", 19);
-			LeaveRule("fromClause", 19);
-			LeaveRule_fromClause();
-		}
-		DebugLocation(254, 1);
-		} finally { DebugExitRule(GrammarFileName, "fromClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "fromClause"
-
-	partial void EnterRule_fromJoin();
-	partial void LeaveRule_fromJoin();
-	// $ANTLR start "fromJoin"
-	// Hql.g:256:1: fromJoin : ( ( ( ( LEFT | RIGHT ) ( OUTER )? ) | FULL | INNER )? JOIN ^ ( FETCH )? path ( asAlias )? ( propertyFetch )? ( withClause )? | ( ( ( LEFT | RIGHT ) ( OUTER )? ) | FULL | INNER )? JOIN ^ ( FETCH )? ELEMENTS ! OPEN ! path CLOSE ! ( asAlias )? ( propertyFetch )? ( withClause )? );
-	[GrammarRule("fromJoin")]
-	private AstParserRuleReturnScope<IASTNode, IToken> fromJoin()
-	{
-		EnterRule_fromJoin();
-		EnterRule("fromJoin", 20);
-		TraceIn("fromJoin", 20);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken set63 = default(IToken);
-		IToken OUTER64 = default(IToken);
-		IToken FULL65 = default(IToken);
-		IToken INNER66 = default(IToken);
-		IToken JOIN67 = default(IToken);
-		IToken FETCH68 = default(IToken);
-		IToken set73 = default(IToken);
-		IToken OUTER74 = default(IToken);
-		IToken FULL75 = default(IToken);
-		IToken INNER76 = default(IToken);
-		IToken JOIN77 = default(IToken);
-		IToken FETCH78 = default(IToken);
-		IToken ELEMENTS79 = default(IToken);
-		IToken OPEN80 = default(IToken);
-		IToken CLOSE82 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> path69 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> asAlias70 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> propertyFetch71 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> withClause72 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> path81 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> asAlias83 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> propertyFetch84 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> withClause85 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode set63_tree = default(IASTNode);
-		IASTNode OUTER64_tree = default(IASTNode);
-		IASTNode FULL65_tree = default(IASTNode);
-		IASTNode INNER66_tree = default(IASTNode);
-		IASTNode JOIN67_tree = default(IASTNode);
-		IASTNode FETCH68_tree = default(IASTNode);
-		IASTNode set73_tree = default(IASTNode);
-		IASTNode OUTER74_tree = default(IASTNode);
-		IASTNode FULL75_tree = default(IASTNode);
-		IASTNode INNER76_tree = default(IASTNode);
-		IASTNode JOIN77_tree = default(IASTNode);
-		IASTNode FETCH78_tree = default(IASTNode);
-		IASTNode ELEMENTS79_tree = default(IASTNode);
-		IASTNode OPEN80_tree = default(IASTNode);
-		IASTNode CLOSE82_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "fromJoin");
-		DebugLocation(256, 1);
-		try
-		{
-			// Hql.g:257:2: ( ( ( ( LEFT | RIGHT ) ( OUTER )? ) | FULL | INNER )? JOIN ^ ( FETCH )? path ( asAlias )? ( propertyFetch )? ( withClause )? | ( ( ( LEFT | RIGHT ) ( OUTER )? ) | FULL | INNER )? JOIN ^ ( FETCH )? ELEMENTS ! OPEN ! path CLOSE ! ( asAlias )? ( propertyFetch )? ( withClause )? )
-			int alt33=2;
-			try { DebugEnterDecision(33, false);
-			switch (input.LA(1))
-			{
-			case LEFT:
-			case RIGHT:
-				{
-				int LA33_2 = input.LA(2);
-
-				if ((LA33_2==OUTER))
-				{
-					int LA33_3 = input.LA(3);
-
-					if ((LA33_3==JOIN))
-					{
-						switch (input.LA(4))
-						{
-						case FETCH:
-							{
-							int LA33_5 = input.LA(5);
-
-							if ((LA33_5==IDENT))
-							{
-								alt33 = 1;
-							}
-							else if ((LA33_5==ELEMENTS))
-							{
-								alt33 = 2;
-							}
-							else
-							{
-								NoViableAltException nvae = new NoViableAltException("", 33, 6, input, 5);
-								DebugRecognitionException(nvae);
-								throw nvae;
-							}
-							}
-							break;
-						case IDENT:
-							{
-							alt33 = 1;
-							}
-							break;
-						case ELEMENTS:
-							{
-							alt33 = 2;
-							}
-							break;
-						default:
-							{
-								NoViableAltException nvae = new NoViableAltException("", 33, 4, input, 4);
-								DebugRecognitionException(nvae);
-								throw nvae;
-							}
-						}
-
-					}
-					else
-					{
-						NoViableAltException nvae = new NoViableAltException("", 33, 5, input, 3);
-						DebugRecognitionException(nvae);
-						throw nvae;
-					}
-				}
-				else if ((LA33_2==JOIN))
-				{
-					switch (input.LA(3))
-					{
-					case FETCH:
-						{
-						int LA33_4 = input.LA(4);
-
-						if ((LA33_4==IDENT))
-						{
-							alt33 = 1;
-						}
-						else if ((LA33_4==ELEMENTS))
-						{
-							alt33 = 2;
-						}
-						else
-						{
-							NoViableAltException nvae = new NoViableAltException("", 33, 6, input, 4);
-							DebugRecognitionException(nvae);
-							throw nvae;
-						}
-						}
-						break;
-					case IDENT:
-						{
-						alt33 = 1;
-						}
-						break;
-					case ELEMENTS:
-						{
-						alt33 = 2;
-						}
-						break;
-					default:
-						{
-							NoViableAltException nvae = new NoViableAltException("", 33, 4, input, 3);
-							DebugRecognitionException(nvae);
-							throw nvae;
-						}
-					}
-
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 33, 1, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case FULL:
-				{
-				int LA33_2 = input.LA(2);
-
-				if ((LA33_2==JOIN))
-				{
-					switch (input.LA(3))
-					{
-					case FETCH:
-						{
-						int LA33_4 = input.LA(4);
-
-						if ((LA33_4==IDENT))
-						{
-							alt33 = 1;
-						}
-						else if ((LA33_4==ELEMENTS))
-						{
-							alt33 = 2;
-						}
-						else
-						{
-							NoViableAltException nvae = new NoViableAltException("", 33, 6, input, 4);
-							DebugRecognitionException(nvae);
-							throw nvae;
-						}
-						}
-						break;
-					case IDENT:
-						{
-						alt33 = 1;
-						}
-						break;
-					case ELEMENTS:
-						{
-						alt33 = 2;
-						}
-						break;
-					default:
-						{
-							NoViableAltException nvae = new NoViableAltException("", 33, 4, input, 3);
-							DebugRecognitionException(nvae);
-							throw nvae;
-						}
-					}
-
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 33, 2, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case INNER:
-				{
-				int LA33_2 = input.LA(2);
-
-				if ((LA33_2==JOIN))
-				{
-					switch (input.LA(3))
-					{
-					case FETCH:
-						{
-						int LA33_4 = input.LA(4);
-
-						if ((LA33_4==IDENT))
-						{
-							alt33 = 1;
-						}
-						else if ((LA33_4==ELEMENTS))
-						{
-							alt33 = 2;
-						}
-						else
-						{
-							NoViableAltException nvae = new NoViableAltException("", 33, 6, input, 4);
-							DebugRecognitionException(nvae);
-							throw nvae;
-						}
-						}
-						break;
-					case IDENT:
-						{
-						alt33 = 1;
-						}
-						break;
-					case ELEMENTS:
-						{
-						alt33 = 2;
-						}
-						break;
-					default:
-						{
-							NoViableAltException nvae = new NoViableAltException("", 33, 4, input, 3);
-							DebugRecognitionException(nvae);
-							throw nvae;
-						}
-					}
-
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 33, 3, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case JOIN:
-				{
-				switch (input.LA(2))
-				{
-				case FETCH:
-					{
-					int LA33_3 = input.LA(3);
-
-					if ((LA33_3==IDENT))
-					{
-						alt33 = 1;
-					}
-					else if ((LA33_3==ELEMENTS))
-					{
-						alt33 = 2;
-					}
-					else
-					{
-						NoViableAltException nvae = new NoViableAltException("", 33, 6, input, 3);
-						DebugRecognitionException(nvae);
-						throw nvae;
-					}
-					}
-					break;
-				case IDENT:
-					{
-					alt33 = 1;
-					}
-					break;
-				case ELEMENTS:
-					{
-					alt33 = 2;
-					}
-					break;
-				default:
-					{
-						NoViableAltException nvae = new NoViableAltException("", 33, 4, input, 2);
-						DebugRecognitionException(nvae);
-						throw nvae;
-					}
-				}
-
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 33, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(33); }
-			switch (alt33)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:257:4: ( ( ( LEFT | RIGHT ) ( OUTER )? ) | FULL | INNER )? JOIN ^ ( FETCH )? path ( asAlias )? ( propertyFetch )? ( withClause )?
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(257, 4);
-				// Hql.g:257:4: ( ( ( LEFT | RIGHT ) ( OUTER )? ) | FULL | INNER )?
-				int alt22=4;
-				try { DebugEnterSubRule(22);
-				try { DebugEnterDecision(22, false);
-				switch (input.LA(1))
-				{
-				case LEFT:
-				case RIGHT:
-					{
-					alt22 = 1;
-					}
-					break;
-				case FULL:
-					{
-					alt22 = 2;
-					}
-					break;
-				case INNER:
-					{
-					alt22 = 3;
-					}
-					break;
-				}
-
-				} finally { DebugExitDecision(22); }
-				switch (alt22)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:257:6: ( ( LEFT | RIGHT ) ( OUTER )? )
-					{
-					DebugLocation(257, 6);
-					// Hql.g:257:6: ( ( LEFT | RIGHT ) ( OUTER )? )
-					DebugEnterAlt(1);
-					// Hql.g:257:8: ( LEFT | RIGHT ) ( OUTER )?
-					{
-					DebugLocation(257, 8);
-
-					set63=(IToken)input.LT(1);
-					if (input.LA(1)==LEFT||input.LA(1)==RIGHT)
-					{
-						input.Consume();
-						adaptor.AddChild(root_0, (IASTNode)adaptor.Create(set63));
-						state.errorRecovery=false;
-					}
-					else
-					{
-						MismatchedSetException mse = new MismatchedSetException(null,input);
-						DebugRecognitionException(mse);
-						throw mse;
-					}
-
-					DebugLocation(257, 25);
-					// Hql.g:257:25: ( OUTER )?
-					int alt21=2;
-					try { DebugEnterSubRule(21);
-					try { DebugEnterDecision(21, false);
-					int LA21_1 = input.LA(1);
-
-					if ((LA21_1==OUTER))
-					{
-						alt21 = 1;
-					}
-					} finally { DebugExitDecision(21); }
-					switch (alt21)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:257:26: OUTER
-						{
-						DebugLocation(257, 26);
-						OUTER64=(IToken)Match(input,OUTER,Follow._OUTER_in_fromJoin1208); 
-						OUTER64_tree = (IASTNode)adaptor.Create(OUTER64);
-						adaptor.AddChild(root_0, OUTER64_tree);
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(21); }
-
-
-					}
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:257:38: FULL
-					{
-					DebugLocation(257, 38);
-					FULL65=(IToken)Match(input,FULL,Follow._FULL_in_fromJoin1216); 
-					FULL65_tree = (IASTNode)adaptor.Create(FULL65);
-					adaptor.AddChild(root_0, FULL65_tree);
-
-					}
-					break;
-				case 3:
-					DebugEnterAlt(3);
-					// Hql.g:257:45: INNER
-					{
-					DebugLocation(257, 45);
-					INNER66=(IToken)Match(input,INNER,Follow._INNER_in_fromJoin1220); 
-					INNER66_tree = (IASTNode)adaptor.Create(INNER66);
-					adaptor.AddChild(root_0, INNER66_tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(22); }
-
-				DebugLocation(257, 58);
-				JOIN67=(IToken)Match(input,JOIN,Follow._JOIN_in_fromJoin1225); 
-				JOIN67_tree = (IASTNode)adaptor.Create(JOIN67);
-				root_0 = (IASTNode)adaptor.BecomeRoot(JOIN67_tree, root_0);
-				DebugLocation(257, 60);
-				// Hql.g:257:60: ( FETCH )?
-				int alt23=2;
-				try { DebugEnterSubRule(23);
-				try { DebugEnterDecision(23, false);
-				int LA23_1 = input.LA(1);
-
-				if ((LA23_1==FETCH))
-				{
-					alt23 = 1;
-				}
-				} finally { DebugExitDecision(23); }
-				switch (alt23)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:257:61: FETCH
-					{
-					DebugLocation(257, 61);
-					FETCH68=(IToken)Match(input,FETCH,Follow._FETCH_in_fromJoin1229); 
-					FETCH68_tree = (IASTNode)adaptor.Create(FETCH68);
-					adaptor.AddChild(root_0, FETCH68_tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(23); }
-
-				DebugLocation(257, 69);
-				PushFollow(Follow._path_in_fromJoin1233);
-				path69=path();
-				PopFollow();
-
-				adaptor.AddChild(root_0, path69.Tree);
-				DebugLocation(257, 74);
-				// Hql.g:257:74: ( asAlias )?
-				int alt24=2;
-				try { DebugEnterSubRule(24);
-				try { DebugEnterDecision(24, false);
-				int LA24_1 = input.LA(1);
-
-				if ((LA24_1==AS||LA24_1==IDENT))
-				{
-					alt24 = 1;
-				}
-				} finally { DebugExitDecision(24); }
-				switch (alt24)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:257:75: asAlias
-					{
-					DebugLocation(257, 75);
-					PushFollow(Follow._asAlias_in_fromJoin1236);
-					asAlias70=asAlias();
-					PopFollow();
-
-					adaptor.AddChild(root_0, asAlias70.Tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(24); }
-
-				DebugLocation(257, 85);
-				// Hql.g:257:85: ( propertyFetch )?
-				int alt25=2;
-				try { DebugEnterSubRule(25);
-				try { DebugEnterDecision(25, false);
-				int LA25_1 = input.LA(1);
-
-				if ((LA25_1==FETCH))
-				{
-					alt25 = 1;
-				}
-				} finally { DebugExitDecision(25); }
-				switch (alt25)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:257:86: propertyFetch
-					{
-					DebugLocation(257, 86);
-					PushFollow(Follow._propertyFetch_in_fromJoin1241);
-					propertyFetch71=propertyFetch();
-					PopFollow();
-
-					adaptor.AddChild(root_0, propertyFetch71.Tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(25); }
-
-				DebugLocation(257, 102);
-				// Hql.g:257:102: ( withClause )?
-				int alt26=2;
-				try { DebugEnterSubRule(26);
-				try { DebugEnterDecision(26, false);
-				int LA26_1 = input.LA(1);
-
-				if ((LA26_1==WITH))
-				{
-					alt26 = 1;
-				}
-				} finally { DebugExitDecision(26); }
-				switch (alt26)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:257:103: withClause
-					{
-					DebugLocation(257, 103);
-					PushFollow(Follow._withClause_in_fromJoin1246);
-					withClause72=withClause();
-					PopFollow();
-
-					adaptor.AddChild(root_0, withClause72.Tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(26); }
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:258:4: ( ( ( LEFT | RIGHT ) ( OUTER )? ) | FULL | INNER )? JOIN ^ ( FETCH )? ELEMENTS ! OPEN ! path CLOSE ! ( asAlias )? ( propertyFetch )? ( withClause )?
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(258, 4);
-				// Hql.g:258:4: ( ( ( LEFT | RIGHT ) ( OUTER )? ) | FULL | INNER )?
-				int alt28=4;
-				try { DebugEnterSubRule(28);
-				try { DebugEnterDecision(28, false);
-				switch (input.LA(1))
-				{
-				case LEFT:
-				case RIGHT:
-					{
-					alt28 = 1;
-					}
-					break;
-				case FULL:
-					{
-					alt28 = 2;
-					}
-					break;
-				case INNER:
-					{
-					alt28 = 3;
-					}
-					break;
-				}
-
-				} finally { DebugExitDecision(28); }
-				switch (alt28)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:258:6: ( ( LEFT | RIGHT ) ( OUTER )? )
-					{
-					DebugLocation(258, 6);
-					// Hql.g:258:6: ( ( LEFT | RIGHT ) ( OUTER )? )
-					DebugEnterAlt(1);
-					// Hql.g:258:8: ( LEFT | RIGHT ) ( OUTER )?
-					{
-					DebugLocation(258, 8);
-
-					set73=(IToken)input.LT(1);
-					if (input.LA(1)==LEFT||input.LA(1)==RIGHT)
-					{
-						input.Consume();
-						adaptor.AddChild(root_0, (IASTNode)adaptor.Create(set73));
-						state.errorRecovery=false;
-					}
-					else
-					{
-						MismatchedSetException mse = new MismatchedSetException(null,input);
-						DebugRecognitionException(mse);
-						throw mse;
-					}
-
-					DebugLocation(258, 25);
-					// Hql.g:258:25: ( OUTER )?
-					int alt27=2;
-					try { DebugEnterSubRule(27);
-					try { DebugEnterDecision(27, false);
-					int LA27_1 = input.LA(1);
-
-					if ((LA27_1==OUTER))
-					{
-						alt27 = 1;
-					}
-					} finally { DebugExitDecision(27); }
-					switch (alt27)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:258:26: OUTER
-						{
-						DebugLocation(258, 26);
-						OUTER74=(IToken)Match(input,OUTER,Follow._OUTER_in_fromJoin1268); 
-						OUTER74_tree = (IASTNode)adaptor.Create(OUTER74);
-						adaptor.AddChild(root_0, OUTER74_tree);
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(27); }
-
-
-					}
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:258:38: FULL
-					{
-					DebugLocation(258, 38);
-					FULL75=(IToken)Match(input,FULL,Follow._FULL_in_fromJoin1276); 
-					FULL75_tree = (IASTNode)adaptor.Create(FULL75);
-					adaptor.AddChild(root_0, FULL75_tree);
-
-					}
-					break;
-				case 3:
-					DebugEnterAlt(3);
-					// Hql.g:258:45: INNER
-					{
-					DebugLocation(258, 45);
-					INNER76=(IToken)Match(input,INNER,Follow._INNER_in_fromJoin1280); 
-					INNER76_tree = (IASTNode)adaptor.Create(INNER76);
-					adaptor.AddChild(root_0, INNER76_tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(28); }
-
-				DebugLocation(258, 58);
-				JOIN77=(IToken)Match(input,JOIN,Follow._JOIN_in_fromJoin1285); 
-				JOIN77_tree = (IASTNode)adaptor.Create(JOIN77);
-				root_0 = (IASTNode)adaptor.BecomeRoot(JOIN77_tree, root_0);
-				DebugLocation(258, 60);
-				// Hql.g:258:60: ( FETCH )?
-				int alt29=2;
-				try { DebugEnterSubRule(29);
-				try { DebugEnterDecision(29, false);
-				int LA29_1 = input.LA(1);
-
-				if ((LA29_1==FETCH))
-				{
-					alt29 = 1;
-				}
-				} finally { DebugExitDecision(29); }
-				switch (alt29)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:258:61: FETCH
-					{
-					DebugLocation(258, 61);
-					FETCH78=(IToken)Match(input,FETCH,Follow._FETCH_in_fromJoin1289); 
-					FETCH78_tree = (IASTNode)adaptor.Create(FETCH78);
-					adaptor.AddChild(root_0, FETCH78_tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(29); }
-
-				DebugLocation(258, 77);
-				ELEMENTS79=(IToken)Match(input,ELEMENTS,Follow._ELEMENTS_in_fromJoin1293); 
-				DebugLocation(258, 83);
-				OPEN80=(IToken)Match(input,OPEN,Follow._OPEN_in_fromJoin1296); 
-				DebugLocation(258, 85);
-				PushFollow(Follow._path_in_fromJoin1299);
-				path81=path();
-				PopFollow();
-
-				adaptor.AddChild(root_0, path81.Tree);
-				DebugLocation(258, 95);
-				CLOSE82=(IToken)Match(input,CLOSE,Follow._CLOSE_in_fromJoin1301); 
-				DebugLocation(258, 97);
-				// Hql.g:258:97: ( asAlias )?
-				int alt30=2;
-				try { DebugEnterSubRule(30);
-				try { DebugEnterDecision(30, false);
-				int LA30_1 = input.LA(1);
-
-				if ((LA30_1==AS||LA30_1==IDENT))
-				{
-					alt30 = 1;
-				}
-				} finally { DebugExitDecision(30); }
-				switch (alt30)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:258:98: asAlias
-					{
-					DebugLocation(258, 98);
-					PushFollow(Follow._asAlias_in_fromJoin1305);
-					asAlias83=asAlias();
-					PopFollow();
-
-					adaptor.AddChild(root_0, asAlias83.Tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(30); }
-
-				DebugLocation(258, 108);
-				// Hql.g:258:108: ( propertyFetch )?
-				int alt31=2;
-				try { DebugEnterSubRule(31);
-				try { DebugEnterDecision(31, false);
-				int LA31_1 = input.LA(1);
-
-				if ((LA31_1==FETCH))
-				{
-					alt31 = 1;
-				}
-				} finally { DebugExitDecision(31); }
-				switch (alt31)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:258:109: propertyFetch
-					{
-					DebugLocation(258, 109);
-					PushFollow(Follow._propertyFetch_in_fromJoin1310);
-					propertyFetch84=propertyFetch();
-					PopFollow();
-
-					adaptor.AddChild(root_0, propertyFetch84.Tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(31); }
-
-				DebugLocation(258, 125);
-				// Hql.g:258:125: ( withClause )?
-				int alt32=2;
-				try { DebugEnterSubRule(32);
-				try { DebugEnterDecision(32, false);
-				int LA32_1 = input.LA(1);
-
-				if ((LA32_1==WITH))
-				{
-					alt32 = 1;
-				}
-				} finally { DebugExitDecision(32); }
-				switch (alt32)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:258:126: withClause
-					{
-					DebugLocation(258, 126);
-					PushFollow(Follow._withClause_in_fromJoin1315);
-					withClause85=withClause();
-					PopFollow();
-
-					adaptor.AddChild(root_0, withClause85.Tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(32); }
-
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("fromJoin", 20);
-			LeaveRule("fromJoin", 20);
-			LeaveRule_fromJoin();
-		}
-		DebugLocation(259, 1);
-		} finally { DebugExitRule(GrammarFileName, "fromJoin"); }
-		return retval;
-
-	}
-	// $ANTLR end "fromJoin"
-
-	partial void EnterRule_withClause();
-	partial void LeaveRule_withClause();
-	// $ANTLR start "withClause"
-	// Hql.g:261:1: withClause : WITH ^ logicalExpression ;
-	[GrammarRule("withClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> withClause()
-	{
-		EnterRule_withClause();
-		EnterRule("withClause", 21);
-		TraceIn("withClause", 21);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken WITH86 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> logicalExpression87 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode WITH86_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "withClause");
-		DebugLocation(261, 1);
-		try
-		{
-			// Hql.g:262:2: ( WITH ^ logicalExpression )
-			DebugEnterAlt(1);
-			// Hql.g:262:4: WITH ^ logicalExpression
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(262, 8);
-			WITH86=(IToken)Match(input,WITH,Follow._WITH_in_withClause1328); 
-			WITH86_tree = (IASTNode)adaptor.Create(WITH86);
-			root_0 = (IASTNode)adaptor.BecomeRoot(WITH86_tree, root_0);
-			DebugLocation(262, 10);
-			PushFollow(Follow._logicalExpression_in_withClause1331);
-			logicalExpression87=logicalExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, logicalExpression87.Tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("withClause", 21);
-			LeaveRule("withClause", 21);
-			LeaveRule_withClause();
-		}
-		DebugLocation(263, 1);
-		} finally { DebugExitRule(GrammarFileName, "withClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "withClause"
-
-	partial void EnterRule_fromRange();
-	partial void LeaveRule_fromRange();
-	// $ANTLR start "fromRange"
-	// Hql.g:265:1: fromRange : ( fromClassOrOuterQueryPath | inClassDeclaration | inCollectionDeclaration | inCollectionElementsDeclaration );
-	[GrammarRule("fromRange")]
-	private AstParserRuleReturnScope<IASTNode, IToken> fromRange()
-	{
-		EnterRule_fromRange();
-		EnterRule("fromRange", 22);
-		TraceIn("fromRange", 22);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> fromClassOrOuterQueryPath88 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> inClassDeclaration89 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> inCollectionDeclaration90 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> inCollectionElementsDeclaration91 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		try { DebugEnterRule(GrammarFileName, "fromRange");
-		DebugLocation(265, 1);
-		try
-		{
-			// Hql.g:266:2: ( fromClassOrOuterQueryPath | inClassDeclaration | inCollectionDeclaration | inCollectionElementsDeclaration )
-			int alt34=4;
-			try { DebugEnterDecision(34, false);
-			switch (input.LA(1))
-			{
-			case IDENT:
-				{
-				int LA34_2 = input.LA(2);
-
-				if ((LA34_2==EOF||LA34_2==AS||LA34_2==CLOSE||LA34_2==COMMA||LA34_2==DOT||LA34_2==FETCH||LA34_2==FULL||LA34_2==GROUP||LA34_2==HAVING||LA34_2==IDENT||LA34_2==INNER||LA34_2==JOIN||LA34_2==LEFT||LA34_2==ORDER||LA34_2==RIGHT||LA34_2==SKIP||LA34_2==TAKE||LA34_2==UNION||LA34_2==WHERE))
-				{
-					alt34 = 1;
-				}
-				else if ((LA34_2==IN))
-				{
-					int LA34_3 = input.LA(3);
-
-					if ((LA34_3==ELEMENTS))
-					{
-						alt34 = 4;
-					}
-					else if ((LA34_3==CLASS||LA34_3==IDENT))
-					{
-						alt34 = 2;
-					}
-					else
-					{
-						NoViableAltException nvae = new NoViableAltException("", 34, 5, input, 3);
-						DebugRecognitionException(nvae);
-						throw nvae;
-					}
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 34, 1, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case IN:
-				{
-				alt34 = 3;
-				}
-				break;
-			case ELEMENTS:
-				{
-				alt34 = 4;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 34, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(34); }
-			switch (alt34)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:266:4: fromClassOrOuterQueryPath
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(266, 4);
-				PushFollow(Follow._fromClassOrOuterQueryPath_in_fromRange1342);
-				fromClassOrOuterQueryPath88=fromClassOrOuterQueryPath();
-				PopFollow();
-
-				adaptor.AddChild(root_0, fromClassOrOuterQueryPath88.Tree);
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:267:4: inClassDeclaration
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(267, 4);
-				PushFollow(Follow._inClassDeclaration_in_fromRange1347);
-				inClassDeclaration89=inClassDeclaration();
-				PopFollow();
-
-				adaptor.AddChild(root_0, inClassDeclaration89.Tree);
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// Hql.g:268:4: inCollectionDeclaration
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(268, 4);
-				PushFollow(Follow._inCollectionDeclaration_in_fromRange1352);
-				inCollectionDeclaration90=inCollectionDeclaration();
-				PopFollow();
-
-				adaptor.AddChild(root_0, inCollectionDeclaration90.Tree);
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// Hql.g:269:4: inCollectionElementsDeclaration
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(269, 4);
-				PushFollow(Follow._inCollectionElementsDeclaration_in_fromRange1357);
-				inCollectionElementsDeclaration91=inCollectionElementsDeclaration();
-				PopFollow();
-
-				adaptor.AddChild(root_0, inCollectionElementsDeclaration91.Tree);
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("fromRange", 22);
-			LeaveRule("fromRange", 22);
-			LeaveRule_fromRange();
-		}
-		DebugLocation(270, 1);
-		} finally { DebugExitRule(GrammarFileName, "fromRange"); }
-		return retval;
-
-	}
-	// $ANTLR end "fromRange"
-
-	partial void EnterRule_fromClassOrOuterQueryPath();
-	partial void LeaveRule_fromClassOrOuterQueryPath();
-	// $ANTLR start "fromClassOrOuterQueryPath"
-	// Hql.g:272:1: fromClassOrOuterQueryPath : path ( asAlias )? ( propertyFetch )? -> ^( RANGE path ( asAlias )? ( propertyFetch )? ) ;
-	[GrammarRule("fromClassOrOuterQueryPath")]
-	private AstParserRuleReturnScope<IASTNode, IToken> fromClassOrOuterQueryPath()
-	{
-		EnterRule_fromClassOrOuterQueryPath();
-		EnterRule("fromClassOrOuterQueryPath", 23);
-		TraceIn("fromClassOrOuterQueryPath", 23);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> path92 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> asAlias93 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> propertyFetch94 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		RewriteRuleSubtreeStream stream_path=new RewriteRuleSubtreeStream(adaptor,"rule path");
-		RewriteRuleSubtreeStream stream_asAlias=new RewriteRuleSubtreeStream(adaptor,"rule asAlias");
-		RewriteRuleSubtreeStream stream_propertyFetch=new RewriteRuleSubtreeStream(adaptor,"rule propertyFetch");
-		try { DebugEnterRule(GrammarFileName, "fromClassOrOuterQueryPath");
-		DebugLocation(272, 1);
-		try
-		{
-			// Hql.g:273:2: ( path ( asAlias )? ( propertyFetch )? -> ^( RANGE path ( asAlias )? ( propertyFetch )? ) )
-			DebugEnterAlt(1);
-			// Hql.g:273:4: path ( asAlias )? ( propertyFetch )?
-			{
-			DebugLocation(273, 4);
-			PushFollow(Follow._path_in_fromClassOrOuterQueryPath1369);
-			path92=path();
-			PopFollow();
-
-			stream_path.Add(path92.Tree);
-			DebugLocation(273, 9);
-			 WeakKeywords(); 
-			DebugLocation(273, 29);
-			// Hql.g:273:29: ( asAlias )?
-			int alt35=2;
-			try { DebugEnterSubRule(35);
-			try { DebugEnterDecision(35, false);
-			int LA35_1 = input.LA(1);
-
-			if ((LA35_1==AS||LA35_1==IDENT))
-			{
-				alt35 = 1;
-			}
-			} finally { DebugExitDecision(35); }
-			switch (alt35)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:273:30: asAlias
-				{
-				DebugLocation(273, 30);
-				PushFollow(Follow._asAlias_in_fromClassOrOuterQueryPath1374);
-				asAlias93=asAlias();
-				PopFollow();
-
-				stream_asAlias.Add(asAlias93.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(35); }
-
-			DebugLocation(273, 40);
-			// Hql.g:273:40: ( propertyFetch )?
-			int alt36=2;
-			try { DebugEnterSubRule(36);
-			try { DebugEnterDecision(36, false);
-			int LA36_1 = input.LA(1);
-
-			if ((LA36_1==FETCH))
-			{
-				alt36 = 1;
-			}
-			} finally { DebugExitDecision(36); }
-			switch (alt36)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:273:41: propertyFetch
-				{
-				DebugLocation(273, 41);
-				PushFollow(Follow._propertyFetch_in_fromClassOrOuterQueryPath1379);
-				propertyFetch94=propertyFetch();
-				PopFollow();
-
-				stream_propertyFetch.Add(propertyFetch94.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(36); }
-
-
-
-			{
-			// AST REWRITE
-			// elements: path, asAlias, propertyFetch
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 274:3: -> ^( RANGE path ( asAlias )? ( propertyFetch )? )
-			{
-				DebugLocation(274, 6);
-				// Hql.g:274:6: ^( RANGE path ( asAlias )? ( propertyFetch )? )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(274, 8);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(RANGE, "RANGE"), root_1);
-
-				DebugLocation(274, 14);
-				adaptor.AddChild(root_1, stream_path.NextTree());
-				DebugLocation(274, 19);
-				// Hql.g:274:19: ( asAlias )?
-				if (stream_asAlias.HasNext)
-				{
-					DebugLocation(274, 19);
-					adaptor.AddChild(root_1, stream_asAlias.NextTree());
-
-				}
-				stream_asAlias.Reset();
-				DebugLocation(274, 28);
-				// Hql.g:274:28: ( propertyFetch )?
-				if (stream_propertyFetch.HasNext)
-				{
-					DebugLocation(274, 28);
-					adaptor.AddChild(root_1, stream_propertyFetch.NextTree());
-
-				}
-				stream_propertyFetch.Reset();
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("fromClassOrOuterQueryPath", 23);
-			LeaveRule("fromClassOrOuterQueryPath", 23);
-			LeaveRule_fromClassOrOuterQueryPath();
-		}
-		DebugLocation(275, 1);
-		} finally { DebugExitRule(GrammarFileName, "fromClassOrOuterQueryPath"); }
-		return retval;
-
-	}
-	// $ANTLR end "fromClassOrOuterQueryPath"
-
-	partial void EnterRule_inClassDeclaration();
-	partial void LeaveRule_inClassDeclaration();
-	// $ANTLR start "inClassDeclaration"
-	// Hql.g:277:1: inClassDeclaration : alias IN ( CLASS )? path -> ^( RANGE path alias ) ;
-	[GrammarRule("inClassDeclaration")]
-	private AstParserRuleReturnScope<IASTNode, IToken> inClassDeclaration()
-	{
-		EnterRule_inClassDeclaration();
-		EnterRule("inClassDeclaration", 24);
-		TraceIn("inClassDeclaration", 24);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken IN96 = default(IToken);
-		IToken CLASS97 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> alias95 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> path98 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode IN96_tree = default(IASTNode);
-		IASTNode CLASS97_tree = default(IASTNode);
-		RewriteRuleITokenStream stream_IN=new RewriteRuleITokenStream(adaptor,"token IN");
-		RewriteRuleITokenStream stream_CLASS=new RewriteRuleITokenStream(adaptor,"token CLASS");
-		RewriteRuleSubtreeStream stream_alias=new RewriteRuleSubtreeStream(adaptor,"rule alias");
-		RewriteRuleSubtreeStream stream_path=new RewriteRuleSubtreeStream(adaptor,"rule path");
-		try { DebugEnterRule(GrammarFileName, "inClassDeclaration");
-		DebugLocation(277, 1);
-		try
-		{
-			// Hql.g:278:2: ( alias IN ( CLASS )? path -> ^( RANGE path alias ) )
-			DebugEnterAlt(1);
-			// Hql.g:278:4: alias IN ( CLASS )? path
-			{
-			DebugLocation(278, 4);
-			PushFollow(Follow._alias_in_inClassDeclaration1409);
-			alias95=alias();
-			PopFollow();
-
-			stream_alias.Add(alias95.Tree);
-			DebugLocation(278, 10);
-			IN96=(IToken)Match(input,IN,Follow._IN_in_inClassDeclaration1411);  
-			stream_IN.Add(IN96);
-
-			DebugLocation(278, 13);
-			// Hql.g:278:13: ( CLASS )?
-			int alt37=2;
-			try { DebugEnterSubRule(37);
-			try { DebugEnterDecision(37, false);
-			int LA37_1 = input.LA(1);
-
-			if ((LA37_1==CLASS))
-			{
-				alt37 = 1;
-			}
-			} finally { DebugExitDecision(37); }
-			switch (alt37)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:278:13: CLASS
-				{
-				DebugLocation(278, 13);
-				CLASS97=(IToken)Match(input,CLASS,Follow._CLASS_in_inClassDeclaration1413);  
-				stream_CLASS.Add(CLASS97);
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(37); }
-
-			DebugLocation(278, 20);
-			PushFollow(Follow._path_in_inClassDeclaration1416);
-			path98=path();
-			PopFollow();
-
-			stream_path.Add(path98.Tree);
-
-
-			{
-			// AST REWRITE
-			// elements: path, alias
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 279:3: -> ^( RANGE path alias )
-			{
-				DebugLocation(279, 6);
-				// Hql.g:279:6: ^( RANGE path alias )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(279, 8);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(RANGE, "RANGE"), root_1);
-
-				DebugLocation(279, 14);
-				adaptor.AddChild(root_1, stream_path.NextTree());
-				DebugLocation(279, 19);
-				adaptor.AddChild(root_1, stream_alias.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("inClassDeclaration", 24);
-			LeaveRule("inClassDeclaration", 24);
-			LeaveRule_inClassDeclaration();
-		}
-		DebugLocation(280, 1);
-		} finally { DebugExitRule(GrammarFileName, "inClassDeclaration"); }
-		return retval;
-
-	}
-	// $ANTLR end "inClassDeclaration"
-
-	partial void EnterRule_inCollectionDeclaration();
-	partial void LeaveRule_inCollectionDeclaration();
-	// $ANTLR start "inCollectionDeclaration"
-	// Hql.g:282:1: inCollectionDeclaration : IN OPEN path CLOSE alias -> ^( JOIN[\"join\"] INNER[\"inner\"] path alias ) ;
-	[GrammarRule("inCollectionDeclaration")]
-	private AstParserRuleReturnScope<IASTNode, IToken> inCollectionDeclaration()
-	{
-		EnterRule_inCollectionDeclaration();
-		EnterRule("inCollectionDeclaration", 25);
-		TraceIn("inCollectionDeclaration", 25);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken IN99 = default(IToken);
-		IToken OPEN100 = default(IToken);
-		IToken CLOSE102 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> path101 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> alias103 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode IN99_tree = default(IASTNode);
-		IASTNode OPEN100_tree = default(IASTNode);
-		IASTNode CLOSE102_tree = default(IASTNode);
-		RewriteRuleITokenStream stream_IN=new RewriteRuleITokenStream(adaptor,"token IN");
-		RewriteRuleITokenStream stream_OPEN=new RewriteRuleITokenStream(adaptor,"token OPEN");
-		RewriteRuleITokenStream stream_CLOSE=new RewriteRuleITokenStream(adaptor,"token CLOSE");
-		RewriteRuleSubtreeStream stream_path=new RewriteRuleSubtreeStream(adaptor,"rule path");
-		RewriteRuleSubtreeStream stream_alias=new RewriteRuleSubtreeStream(adaptor,"rule alias");
-		try { DebugEnterRule(GrammarFileName, "inCollectionDeclaration");
-		DebugLocation(282, 4);
-		try
-		{
-			// Hql.g:283:5: ( IN OPEN path CLOSE alias -> ^( JOIN[\"join\"] INNER[\"inner\"] path alias ) )
-			DebugEnterAlt(1);
-			// Hql.g:283:7: IN OPEN path CLOSE alias
-			{
-			DebugLocation(283, 7);
-			IN99=(IToken)Match(input,IN,Follow._IN_in_inCollectionDeclaration1444);  
-			stream_IN.Add(IN99);
-
-			DebugLocation(283, 10);
-			OPEN100=(IToken)Match(input,OPEN,Follow._OPEN_in_inCollectionDeclaration1446);  
-			stream_OPEN.Add(OPEN100);
-
-			DebugLocation(283, 15);
-			PushFollow(Follow._path_in_inCollectionDeclaration1448);
-			path101=path();
-			PopFollow();
-
-			stream_path.Add(path101.Tree);
-			DebugLocation(283, 20);
-			CLOSE102=(IToken)Match(input,CLOSE,Follow._CLOSE_in_inCollectionDeclaration1450);  
-			stream_CLOSE.Add(CLOSE102);
-
-			DebugLocation(283, 26);
-			PushFollow(Follow._alias_in_inCollectionDeclaration1452);
-			alias103=alias();
-			PopFollow();
-
-			stream_alias.Add(alias103.Tree);
-
-
-			{
-			// AST REWRITE
-			// elements: path, alias
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 284:6: -> ^( JOIN[\"join\"] INNER[\"inner\"] path alias )
-			{
-				DebugLocation(284, 9);
-				// Hql.g:284:9: ^( JOIN[\"join\"] INNER[\"inner\"] path alias )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(284, 11);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(JOIN, "join"), root_1);
-
-				DebugLocation(284, 24);
-				adaptor.AddChild(root_1, (IASTNode)adaptor.Create(INNER, "inner"));
-				DebugLocation(284, 39);
-				adaptor.AddChild(root_1, stream_path.NextTree());
-				DebugLocation(284, 44);
-				adaptor.AddChild(root_1, stream_alias.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("inCollectionDeclaration", 25);
-			LeaveRule("inCollectionDeclaration", 25);
-			LeaveRule_inCollectionDeclaration();
-		}
-		DebugLocation(285, 4);
-		} finally { DebugExitRule(GrammarFileName, "inCollectionDeclaration"); }
-		return retval;
-
-	}
-	// $ANTLR end "inCollectionDeclaration"
-
-	partial void EnterRule_inCollectionElementsDeclaration();
-	partial void LeaveRule_inCollectionElementsDeclaration();
-	// $ANTLR start "inCollectionElementsDeclaration"
-	// Hql.g:287:1: inCollectionElementsDeclaration : ( alias IN ELEMENTS OPEN path CLOSE -> ^( JOIN[\"join\"] INNER[\"inner\"] path alias ) | ELEMENTS OPEN path CLOSE AS alias -> ^( JOIN[\"join\"] INNER[\"inner\"] path alias ) );
-	[GrammarRule("inCollectionElementsDeclaration")]
-	private AstParserRuleReturnScope<IASTNode, IToken> inCollectionElementsDeclaration()
-	{
-		EnterRule_inCollectionElementsDeclaration();
-		EnterRule("inCollectionElementsDeclaration", 26);
-		TraceIn("inCollectionElementsDeclaration", 26);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken IN105 = default(IToken);
-		IToken ELEMENTS106 = default(IToken);
-		IToken OPEN107 = default(IToken);
-		IToken CLOSE109 = default(IToken);
-		IToken ELEMENTS110 = default(IToken);
-		IToken OPEN111 = default(IToken);
-		IToken CLOSE113 = default(IToken);
-		IToken AS114 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> alias104 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> path108 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> path112 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> alias115 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode IN105_tree = default(IASTNode);
-		IASTNode ELEMENTS106_tree = default(IASTNode);
-		IASTNode OPEN107_tree = default(IASTNode);
-		IASTNode CLOSE109_tree = default(IASTNode);
-		IASTNode ELEMENTS110_tree = default(IASTNode);
-		IASTNode OPEN111_tree = default(IASTNode);
-		IASTNode CLOSE113_tree = default(IASTNode);
-		IASTNode AS114_tree = default(IASTNode);
-		RewriteRuleITokenStream stream_IN=new RewriteRuleITokenStream(adaptor,"token IN");
-		RewriteRuleITokenStream stream_ELEMENTS=new RewriteRuleITokenStream(adaptor,"token ELEMENTS");
-		RewriteRuleITokenStream stream_OPEN=new RewriteRuleITokenStream(adaptor,"token OPEN");
-		RewriteRuleITokenStream stream_CLOSE=new RewriteRuleITokenStream(adaptor,"token CLOSE");
-		RewriteRuleITokenStream stream_AS=new RewriteRuleITokenStream(adaptor,"token AS");
-		RewriteRuleSubtreeStream stream_alias=new RewriteRuleSubtreeStream(adaptor,"rule alias");
-		RewriteRuleSubtreeStream stream_path=new RewriteRuleSubtreeStream(adaptor,"rule path");
-		try { DebugEnterRule(GrammarFileName, "inCollectionElementsDeclaration");
-		DebugLocation(287, 4);
-		try
-		{
-			// Hql.g:288:2: ( alias IN ELEMENTS OPEN path CLOSE -> ^( JOIN[\"join\"] INNER[\"inner\"] path alias ) | ELEMENTS OPEN path CLOSE AS alias -> ^( JOIN[\"join\"] INNER[\"inner\"] path alias ) )
-			int alt38=2;
-			try { DebugEnterDecision(38, false);
-			int LA38_1 = input.LA(1);
-
-			if ((LA38_1==IDENT))
-			{
-				alt38 = 1;
-			}
-			else if ((LA38_1==ELEMENTS))
-			{
-				alt38 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 38, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(38); }
-			switch (alt38)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:288:4: alias IN ELEMENTS OPEN path CLOSE
-				{
-				DebugLocation(288, 4);
-				PushFollow(Follow._alias_in_inCollectionElementsDeclaration1486);
-				alias104=alias();
-				PopFollow();
-
-				stream_alias.Add(alias104.Tree);
-				DebugLocation(288, 10);
-				IN105=(IToken)Match(input,IN,Follow._IN_in_inCollectionElementsDeclaration1488);  
-				stream_IN.Add(IN105);
-
-				DebugLocation(288, 13);
-				ELEMENTS106=(IToken)Match(input,ELEMENTS,Follow._ELEMENTS_in_inCollectionElementsDeclaration1490);  
-				stream_ELEMENTS.Add(ELEMENTS106);
-
-				DebugLocation(288, 22);
-				OPEN107=(IToken)Match(input,OPEN,Follow._OPEN_in_inCollectionElementsDeclaration1492);  
-				stream_OPEN.Add(OPEN107);
-
-				DebugLocation(288, 27);
-				PushFollow(Follow._path_in_inCollectionElementsDeclaration1494);
-				path108=path();
-				PopFollow();
-
-				stream_path.Add(path108.Tree);
-				DebugLocation(288, 32);
-				CLOSE109=(IToken)Match(input,CLOSE,Follow._CLOSE_in_inCollectionElementsDeclaration1496);  
-				stream_CLOSE.Add(CLOSE109);
-
-
-
-				{
-				// AST REWRITE
-				// elements: path, alias
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 289:3: -> ^( JOIN[\"join\"] INNER[\"inner\"] path alias )
-				{
-					DebugLocation(289, 6);
-					// Hql.g:289:6: ^( JOIN[\"join\"] INNER[\"inner\"] path alias )
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(289, 8);
-					root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(JOIN, "join"), root_1);
-
-					DebugLocation(289, 21);
-					adaptor.AddChild(root_1, (IASTNode)adaptor.Create(INNER, "inner"));
-					DebugLocation(289, 36);
-					adaptor.AddChild(root_1, stream_path.NextTree());
-					DebugLocation(289, 41);
-					adaptor.AddChild(root_1, stream_alias.NextTree());
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:290:4: ELEMENTS OPEN path CLOSE AS alias
-				{
-				DebugLocation(290, 4);
-				ELEMENTS110=(IToken)Match(input,ELEMENTS,Follow._ELEMENTS_in_inCollectionElementsDeclaration1518);  
-				stream_ELEMENTS.Add(ELEMENTS110);
-
-				DebugLocation(290, 13);
-				OPEN111=(IToken)Match(input,OPEN,Follow._OPEN_in_inCollectionElementsDeclaration1520);  
-				stream_OPEN.Add(OPEN111);
-
-				DebugLocation(290, 18);
-				PushFollow(Follow._path_in_inCollectionElementsDeclaration1522);
-				path112=path();
-				PopFollow();
-
-				stream_path.Add(path112.Tree);
-				DebugLocation(290, 23);
-				CLOSE113=(IToken)Match(input,CLOSE,Follow._CLOSE_in_inCollectionElementsDeclaration1524);  
-				stream_CLOSE.Add(CLOSE113);
-
-				DebugLocation(290, 29);
-				AS114=(IToken)Match(input,AS,Follow._AS_in_inCollectionElementsDeclaration1526);  
-				stream_AS.Add(AS114);
-
-				DebugLocation(290, 32);
-				PushFollow(Follow._alias_in_inCollectionElementsDeclaration1528);
-				alias115=alias();
-				PopFollow();
-
-				stream_alias.Add(alias115.Tree);
-
-
-				{
-				// AST REWRITE
-				// elements: path, alias
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 291:3: -> ^( JOIN[\"join\"] INNER[\"inner\"] path alias )
-				{
-					DebugLocation(291, 6);
-					// Hql.g:291:6: ^( JOIN[\"join\"] INNER[\"inner\"] path alias )
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(291, 8);
-					root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(JOIN, "join"), root_1);
-
-					DebugLocation(291, 21);
-					adaptor.AddChild(root_1, (IASTNode)adaptor.Create(INNER, "inner"));
-					DebugLocation(291, 36);
-					adaptor.AddChild(root_1, stream_path.NextTree());
-					DebugLocation(291, 41);
-					adaptor.AddChild(root_1, stream_alias.NextTree());
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("inCollectionElementsDeclaration", 26);
-			LeaveRule("inCollectionElementsDeclaration", 26);
-			LeaveRule_inCollectionElementsDeclaration();
-		}
-		DebugLocation(292, 4);
-		} finally { DebugExitRule(GrammarFileName, "inCollectionElementsDeclaration"); }
-		return retval;
-
-	}
-	// $ANTLR end "inCollectionElementsDeclaration"
-
-	partial void EnterRule_asAlias();
-	partial void LeaveRule_asAlias();
-	// $ANTLR start "asAlias"
-	// Hql.g:295:1: asAlias : ( AS !)? alias ;
-	[GrammarRule("asAlias")]
-	private AstParserRuleReturnScope<IASTNode, IToken> asAlias()
-	{
-		EnterRule_asAlias();
-		EnterRule("asAlias", 27);
-		TraceIn("asAlias", 27);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken AS116 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> alias117 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode AS116_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "asAlias");
-		DebugLocation(295, 1);
-		try
-		{
-			// Hql.g:296:2: ( ( AS !)? alias )
-			DebugEnterAlt(1);
-			// Hql.g:296:4: ( AS !)? alias
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(296, 4);
-			// Hql.g:296:4: ( AS !)?
-			int alt39=2;
-			try { DebugEnterSubRule(39);
-			try { DebugEnterDecision(39, false);
-			int LA39_1 = input.LA(1);
-
-			if ((LA39_1==AS))
-			{
-				alt39 = 1;
-			}
-			} finally { DebugExitDecision(39); }
-			switch (alt39)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:296:5: AS !
-				{
-				DebugLocation(296, 7);
-				AS116=(IToken)Match(input,AS,Follow._AS_in_asAlias1560); 
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(39); }
-
-			DebugLocation(296, 11);
-			PushFollow(Follow._alias_in_asAlias1565);
-			alias117=alias();
-			PopFollow();
-
-			adaptor.AddChild(root_0, alias117.Tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("asAlias", 27);
-			LeaveRule("asAlias", 27);
-			LeaveRule_asAlias();
-		}
-		DebugLocation(297, 1);
-		} finally { DebugExitRule(GrammarFileName, "asAlias"); }
-		return retval;
-
-	}
-	// $ANTLR end "asAlias"
-
-	partial void EnterRule_alias();
-	partial void LeaveRule_alias();
-	// $ANTLR start "alias"
-	// Hql.g:298:1: alias : i= identifier -> ^( ALIAS[$i.start] ) ;
-	[GrammarRule("alias")]
-	private AstParserRuleReturnScope<IASTNode, IToken> alias()
-	{
-		EnterRule_alias();
-		EnterRule("alias", 28);
-		TraceIn("alias", 28);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> i = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		RewriteRuleSubtreeStream stream_identifier=new RewriteRuleSubtreeStream(adaptor,"rule identifier");
-		try { DebugEnterRule(GrammarFileName, "alias");
-		DebugLocation(298, 1);
-		try
-		{
-			// Hql.g:299:2: (i= identifier -> ^( ALIAS[$i.start] ) )
-			DebugEnterAlt(1);
-			// Hql.g:299:4: i= identifier
-			{
-			DebugLocation(299, 5);
-			PushFollow(Follow._identifier_in_alias1577);
-			i=identifier();
-			PopFollow();
-
-			stream_identifier.Add(i.Tree);
-
-
-			{
-			// AST REWRITE
-			// elements: 
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 300:2: -> ^( ALIAS[$i.start] )
-			{
-				DebugLocation(300, 5);
-				// Hql.g:300:5: ^( ALIAS[$i.start] )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(300, 7);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(ALIAS, (i!=null?((IToken)i.Start):default(IToken))), root_1);
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("alias", 28);
-			LeaveRule("alias", 28);
-			LeaveRule_alias();
-		}
-		DebugLocation(301, 1);
-		} finally { DebugExitRule(GrammarFileName, "alias"); }
-		return retval;
-
-	}
-	// $ANTLR end "alias"
-
-	partial void EnterRule_propertyFetch();
-	partial void LeaveRule_propertyFetch();
-	// $ANTLR start "propertyFetch"
-	// Hql.g:303:1: propertyFetch : FETCH ALL ! PROPERTIES !;
-	[GrammarRule("propertyFetch")]
-	private AstParserRuleReturnScope<IASTNode, IToken> propertyFetch()
-	{
-		EnterRule_propertyFetch();
-		EnterRule("propertyFetch", 29);
-		TraceIn("propertyFetch", 29);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken FETCH118 = default(IToken);
-		IToken ALL119 = default(IToken);
-		IToken PROPERTIES120 = default(IToken);
-
-		IASTNode FETCH118_tree = default(IASTNode);
-		IASTNode ALL119_tree = default(IASTNode);
-		IASTNode PROPERTIES120_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "propertyFetch");
-		DebugLocation(303, 1);
-		try
-		{
-			// Hql.g:304:2: ( FETCH ALL ! PROPERTIES !)
-			DebugEnterAlt(1);
-			// Hql.g:304:4: FETCH ALL ! PROPERTIES !
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(304, 4);
-			FETCH118=(IToken)Match(input,FETCH,Follow._FETCH_in_propertyFetch1596); 
-			FETCH118_tree = (IASTNode)adaptor.Create(FETCH118);
-			adaptor.AddChild(root_0, FETCH118_tree);
-			DebugLocation(304, 13);
-			ALL119=(IToken)Match(input,ALL,Follow._ALL_in_propertyFetch1598); 
-			DebugLocation(304, 25);
-			PROPERTIES120=(IToken)Match(input,PROPERTIES,Follow._PROPERTIES_in_propertyFetch1601); 
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("propertyFetch", 29);
-			LeaveRule("propertyFetch", 29);
-			LeaveRule_propertyFetch();
-		}
-		DebugLocation(305, 1);
-		} finally { DebugExitRule(GrammarFileName, "propertyFetch"); }
-		return retval;
-
-	}
-	// $ANTLR end "propertyFetch"
-
-	partial void EnterRule_groupByClause();
-	partial void LeaveRule_groupByClause();
-	// $ANTLR start "groupByClause"
-	// Hql.g:307:1: groupByClause : GROUP ^ 'by' ! expression ( COMMA ! expression )* ;
-	[GrammarRule("groupByClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> groupByClause()
-	{
-		EnterRule_groupByClause();
-		EnterRule("groupByClause", 30);
-		TraceIn("groupByClause", 30);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken GROUP121 = default(IToken);
-		IToken string_literal122 = default(IToken);
-		IToken COMMA124 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> expression123 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> expression125 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode GROUP121_tree = default(IASTNode);
-		IASTNode string_literal122_tree = default(IASTNode);
-		IASTNode COMMA124_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "groupByClause");
-		DebugLocation(307, 1);
-		try
-		{
-			// Hql.g:308:2: ( GROUP ^ 'by' ! expression ( COMMA ! expression )* )
-			DebugEnterAlt(1);
-			// Hql.g:308:4: GROUP ^ 'by' ! expression ( COMMA ! expression )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(308, 9);
-			GROUP121=(IToken)Match(input,GROUP,Follow._GROUP_in_groupByClause1613); 
-			GROUP121_tree = (IASTNode)adaptor.Create(GROUP121);
-			root_0 = (IASTNode)adaptor.BecomeRoot(GROUP121_tree, root_0);
-			DebugLocation(309, 7);
-			string_literal122=(IToken)Match(input,LITERAL_by,Follow._LITERAL_by_in_groupByClause1619); 
-			DebugLocation(309, 9);
-			PushFollow(Follow._expression_in_groupByClause1622);
-			expression123=expression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, expression123.Tree);
-			DebugLocation(309, 20);
-			// Hql.g:309:20: ( COMMA ! expression )*
-			try { DebugEnterSubRule(40);
-			while (true)
-			{
-				int alt40=2;
-				try { DebugEnterDecision(40, false);
-				int LA40_1 = input.LA(1);
-
-				if ((LA40_1==COMMA))
-				{
-					alt40 = 1;
-				}
-
-
-				} finally { DebugExitDecision(40); }
-				switch ( alt40 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:309:22: COMMA ! expression
-					{
-					DebugLocation(309, 27);
-					COMMA124=(IToken)Match(input,COMMA,Follow._COMMA_in_groupByClause1626); 
-					DebugLocation(309, 29);
-					PushFollow(Follow._expression_in_groupByClause1629);
-					expression125=expression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, expression125.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop40;
-				}
-			}
-
-			loop40:
-				;
-
-			} finally { DebugExitSubRule(40); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("groupByClause", 30);
-			LeaveRule("groupByClause", 30);
-			LeaveRule_groupByClause();
-		}
-		DebugLocation(310, 1);
-		} finally { DebugExitRule(GrammarFileName, "groupByClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "groupByClause"
-
-	partial void EnterRule_orderByClause();
-	partial void LeaveRule_orderByClause();
-	// $ANTLR start "orderByClause"
-	// Hql.g:312:1: orderByClause : ORDER ^ 'by' ! orderElement ( COMMA ! orderElement )* ;
-	[GrammarRule("orderByClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> orderByClause()
-	{
-		EnterRule_orderByClause();
-		EnterRule("orderByClause", 31);
-		TraceIn("orderByClause", 31);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken ORDER126 = default(IToken);
-		IToken string_literal127 = default(IToken);
-		IToken COMMA129 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> orderElement128 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> orderElement130 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode ORDER126_tree = default(IASTNode);
-		IASTNode string_literal127_tree = default(IASTNode);
-		IASTNode COMMA129_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "orderByClause");
-		DebugLocation(312, 1);
-		try
-		{
-			// Hql.g:313:2: ( ORDER ^ 'by' ! orderElement ( COMMA ! orderElement )* )
-			DebugEnterAlt(1);
-			// Hql.g:313:4: ORDER ^ 'by' ! orderElement ( COMMA ! orderElement )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(313, 9);
-			ORDER126=(IToken)Match(input,ORDER,Follow._ORDER_in_orderByClause1643); 
-			ORDER126_tree = (IASTNode)adaptor.Create(ORDER126);
-			root_0 = (IASTNode)adaptor.BecomeRoot(ORDER126_tree, root_0);
-			DebugLocation(313, 15);
-			string_literal127=(IToken)Match(input,LITERAL_by,Follow._LITERAL_by_in_orderByClause1646); 
-			DebugLocation(313, 17);
-			PushFollow(Follow._orderElement_in_orderByClause1649);
-			orderElement128=orderElement();
-			PopFollow();
-
-			adaptor.AddChild(root_0, orderElement128.Tree);
-			DebugLocation(313, 30);
-			// Hql.g:313:30: ( COMMA ! orderElement )*
-			try { DebugEnterSubRule(41);
-			while (true)
-			{
-				int alt41=2;
-				try { DebugEnterDecision(41, false);
-				int LA41_1 = input.LA(1);
-
-				if ((LA41_1==COMMA))
-				{
-					alt41 = 1;
-				}
-
-
-				} finally { DebugExitDecision(41); }
-				switch ( alt41 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:313:32: COMMA ! orderElement
-					{
-					DebugLocation(313, 37);
-					COMMA129=(IToken)Match(input,COMMA,Follow._COMMA_in_orderByClause1653); 
-					DebugLocation(313, 39);
-					PushFollow(Follow._orderElement_in_orderByClause1656);
-					orderElement130=orderElement();
-					PopFollow();
-
-					adaptor.AddChild(root_0, orderElement130.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop41;
-				}
-			}
-
-			loop41:
-				;
-
-			} finally { DebugExitSubRule(41); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("orderByClause", 31);
-			LeaveRule("orderByClause", 31);
-			LeaveRule_orderByClause();
-		}
-		DebugLocation(314, 1);
-		} finally { DebugExitRule(GrammarFileName, "orderByClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "orderByClause"
-
-	partial void EnterRule_skipClause();
-	partial void LeaveRule_skipClause();
-	// $ANTLR start "skipClause"
-	// Hql.g:316:1: skipClause : SKIP ^ ( NUM_INT | parameter ) ;
-	[GrammarRule("skipClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> skipClause()
-	{
-		EnterRule_skipClause();
-		EnterRule("skipClause", 32);
-		TraceIn("skipClause", 32);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken SKIP131 = default(IToken);
-		IToken NUM_INT132 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> parameter133 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode SKIP131_tree = default(IASTNode);
-		IASTNode NUM_INT132_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "skipClause");
-		DebugLocation(316, 1);
-		try
-		{
-			// Hql.g:317:2: ( SKIP ^ ( NUM_INT | parameter ) )
-			DebugEnterAlt(1);
-			// Hql.g:317:4: SKIP ^ ( NUM_INT | parameter )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(317, 8);
-			SKIP131=(IToken)Match(input,SKIP,Follow._SKIP_in_skipClause1670); 
-			SKIP131_tree = (IASTNode)adaptor.Create(SKIP131);
-			root_0 = (IASTNode)adaptor.BecomeRoot(SKIP131_tree, root_0);
-			DebugLocation(317, 10);
-			// Hql.g:317:10: ( NUM_INT | parameter )
-			int alt42=2;
-			try { DebugEnterSubRule(42);
-			try { DebugEnterDecision(42, false);
-			int LA42_1 = input.LA(1);
-
-			if ((LA42_1==NUM_INT))
-			{
-				alt42 = 1;
-			}
-			else if ((LA42_1==COLON||LA42_1==PARAM))
-			{
-				alt42 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 42, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(42); }
-			switch (alt42)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:317:11: NUM_INT
-				{
-				DebugLocation(317, 11);
-				NUM_INT132=(IToken)Match(input,NUM_INT,Follow._NUM_INT_in_skipClause1674); 
-				NUM_INT132_tree = (IASTNode)adaptor.Create(NUM_INT132);
-				adaptor.AddChild(root_0, NUM_INT132_tree);
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:317:21: parameter
-				{
-				DebugLocation(317, 21);
-				PushFollow(Follow._parameter_in_skipClause1678);
-				parameter133=parameter();
-				PopFollow();
-
-				adaptor.AddChild(root_0, parameter133.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(42); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("skipClause", 32);
-			LeaveRule("skipClause", 32);
-			LeaveRule_skipClause();
-		}
-		DebugLocation(318, 1);
-		} finally { DebugExitRule(GrammarFileName, "skipClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "skipClause"
-
-	partial void EnterRule_takeClause();
-	partial void LeaveRule_takeClause();
-	// $ANTLR start "takeClause"
-	// Hql.g:320:1: takeClause : TAKE ^ ( NUM_INT | parameter ) ;
-	[GrammarRule("takeClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> takeClause()
-	{
-		EnterRule_takeClause();
-		EnterRule("takeClause", 33);
-		TraceIn("takeClause", 33);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken TAKE134 = default(IToken);
-		IToken NUM_INT135 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> parameter136 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode TAKE134_tree = default(IASTNode);
-		IASTNode NUM_INT135_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "takeClause");
-		DebugLocation(320, 1);
-		try
-		{
-			// Hql.g:321:2: ( TAKE ^ ( NUM_INT | parameter ) )
-			DebugEnterAlt(1);
-			// Hql.g:321:4: TAKE ^ ( NUM_INT | parameter )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(321, 8);
-			TAKE134=(IToken)Match(input,TAKE,Follow._TAKE_in_takeClause1690); 
-			TAKE134_tree = (IASTNode)adaptor.Create(TAKE134);
-			root_0 = (IASTNode)adaptor.BecomeRoot(TAKE134_tree, root_0);
-			DebugLocation(321, 10);
-			// Hql.g:321:10: ( NUM_INT | parameter )
-			int alt43=2;
-			try { DebugEnterSubRule(43);
-			try { DebugEnterDecision(43, false);
-			int LA43_1 = input.LA(1);
-
-			if ((LA43_1==NUM_INT))
-			{
-				alt43 = 1;
-			}
-			else if ((LA43_1==COLON||LA43_1==PARAM))
-			{
-				alt43 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 43, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(43); }
-			switch (alt43)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:321:11: NUM_INT
-				{
-				DebugLocation(321, 11);
-				NUM_INT135=(IToken)Match(input,NUM_INT,Follow._NUM_INT_in_takeClause1694); 
-				NUM_INT135_tree = (IASTNode)adaptor.Create(NUM_INT135);
-				adaptor.AddChild(root_0, NUM_INT135_tree);
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:321:21: parameter
-				{
-				DebugLocation(321, 21);
-				PushFollow(Follow._parameter_in_takeClause1698);
-				parameter136=parameter();
-				PopFollow();
-
-				adaptor.AddChild(root_0, parameter136.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(43); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("takeClause", 33);
-			LeaveRule("takeClause", 33);
-			LeaveRule_takeClause();
-		}
-		DebugLocation(322, 1);
-		} finally { DebugExitRule(GrammarFileName, "takeClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "takeClause"
-
-	partial void EnterRule_parameter();
-	partial void LeaveRule_parameter();
-	// $ANTLR start "parameter"
-	// Hql.g:324:1: parameter : ( COLON ^ identifier | PARAM ^ ( NUM_INT )? );
-	[GrammarRule("parameter")]
-	private AstParserRuleReturnScope<IASTNode, IToken> parameter()
-	{
-		EnterRule_parameter();
-		EnterRule("parameter", 34);
-		TraceIn("parameter", 34);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken COLON137 = default(IToken);
-		IToken PARAM139 = default(IToken);
-		IToken NUM_INT140 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> identifier138 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode COLON137_tree = default(IASTNode);
-		IASTNode PARAM139_tree = default(IASTNode);
-		IASTNode NUM_INT140_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "parameter");
-		DebugLocation(324, 1);
-		try
-		{
-			// Hql.g:325:2: ( COLON ^ identifier | PARAM ^ ( NUM_INT )? )
-			int alt45=2;
-			try { DebugEnterDecision(45, false);
-			int LA45_1 = input.LA(1);
-
-			if ((LA45_1==COLON))
-			{
-				alt45 = 1;
-			}
-			else if ((LA45_1==PARAM))
-			{
-				alt45 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 45, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(45); }
-			switch (alt45)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:325:4: COLON ^ identifier
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(325, 9);
-				COLON137=(IToken)Match(input,COLON,Follow._COLON_in_parameter1710); 
-				COLON137_tree = (IASTNode)adaptor.Create(COLON137);
-				root_0 = (IASTNode)adaptor.BecomeRoot(COLON137_tree, root_0);
-				DebugLocation(325, 11);
-				PushFollow(Follow._identifier_in_parameter1713);
-				identifier138=identifier();
-				PopFollow();
-
-				adaptor.AddChild(root_0, identifier138.Tree);
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:326:4: PARAM ^ ( NUM_INT )?
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(326, 9);
-				PARAM139=(IToken)Match(input,PARAM,Follow._PARAM_in_parameter1718); 
-				PARAM139_tree = (IASTNode)adaptor.Create(PARAM139);
-				root_0 = (IASTNode)adaptor.BecomeRoot(PARAM139_tree, root_0);
-				DebugLocation(326, 11);
-				// Hql.g:326:11: ( NUM_INT )?
-				int alt44=2;
-				try { DebugEnterSubRule(44);
-				try { DebugEnterDecision(44, false);
-				int LA44_1 = input.LA(1);
-
-				if ((LA44_1==NUM_INT))
-				{
-					alt44 = 1;
-				}
-				} finally { DebugExitDecision(44); }
-				switch (alt44)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:326:12: NUM_INT
-					{
-					DebugLocation(326, 12);
-					NUM_INT140=(IToken)Match(input,NUM_INT,Follow._NUM_INT_in_parameter1722); 
-					NUM_INT140_tree = (IASTNode)adaptor.Create(NUM_INT140);
-					adaptor.AddChild(root_0, NUM_INT140_tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(44); }
-
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("parameter", 34);
-			LeaveRule("parameter", 34);
-			LeaveRule_parameter();
-		}
-		DebugLocation(327, 1);
-		} finally { DebugExitRule(GrammarFileName, "parameter"); }
-		return retval;
-
-	}
-	// $ANTLR end "parameter"
-
-	partial void EnterRule_orderElement();
-	partial void LeaveRule_orderElement();
-	// $ANTLR start "orderElement"
-	// Hql.g:329:1: orderElement : expression ( ascendingOrDescending )? ;
-	[GrammarRule("orderElement")]
-	private AstParserRuleReturnScope<IASTNode, IToken> orderElement()
-	{
-		EnterRule_orderElement();
-		EnterRule("orderElement", 35);
-		TraceIn("orderElement", 35);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> expression141 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> ascendingOrDescending142 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		try { DebugEnterRule(GrammarFileName, "orderElement");
-		DebugLocation(329, 1);
-		try
-		{
-			// Hql.g:330:2: ( expression ( ascendingOrDescending )? )
-			DebugEnterAlt(1);
-			// Hql.g:330:4: expression ( ascendingOrDescending )?
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(330, 4);
-			PushFollow(Follow._expression_in_orderElement1735);
-			expression141=expression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, expression141.Tree);
-			DebugLocation(330, 15);
-			// Hql.g:330:15: ( ascendingOrDescending )?
-			int alt46=2;
-			try { DebugEnterSubRule(46);
-			try { DebugEnterDecision(46, false);
-			int LA46_1 = input.LA(1);
-
-			if ((LA46_1==ASCENDING||LA46_1==DESCENDING||(LA46_1>=133 && LA46_1<=134)))
-			{
-				alt46 = 1;
-			}
-			} finally { DebugExitDecision(46); }
-			switch (alt46)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:330:17: ascendingOrDescending
-				{
-				DebugLocation(330, 17);
-				PushFollow(Follow._ascendingOrDescending_in_orderElement1739);
-				ascendingOrDescending142=ascendingOrDescending();
-				PopFollow();
-
-				adaptor.AddChild(root_0, ascendingOrDescending142.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(46); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("orderElement", 35);
-			LeaveRule("orderElement", 35);
-			LeaveRule_orderElement();
-		}
-		DebugLocation(331, 1);
-		} finally { DebugExitRule(GrammarFileName, "orderElement"); }
-		return retval;
-
-	}
-	// $ANTLR end "orderElement"
-
-	partial void EnterRule_ascendingOrDescending();
-	partial void LeaveRule_ascendingOrDescending();
-	// $ANTLR start "ascendingOrDescending"
-	// Hql.g:333:1: ascendingOrDescending : ( (a= 'asc' |a= 'ascending' ) -> ^( ASCENDING[$a.Text] ) | (d= 'desc' |d= 'descending' ) -> ^( DESCENDING[$d.Text] ) );
-	[GrammarRule("ascendingOrDescending")]
-	private AstParserRuleReturnScope<IASTNode, IToken> ascendingOrDescending()
-	{
-		EnterRule_ascendingOrDescending();
-		EnterRule("ascendingOrDescending", 36);
-		TraceIn("ascendingOrDescending", 36);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken a = default(IToken);
-		IToken d = default(IToken);
-
-		IASTNode a_tree = default(IASTNode);
-		IASTNode d_tree = default(IASTNode);
-		RewriteRuleITokenStream stream_ASCENDING=new RewriteRuleITokenStream(adaptor,"token ASCENDING");
-		RewriteRuleITokenStream stream_133=new RewriteRuleITokenStream(adaptor,"token 133");
-		RewriteRuleITokenStream stream_DESCENDING=new RewriteRuleITokenStream(adaptor,"token DESCENDING");
-		RewriteRuleITokenStream stream_134=new RewriteRuleITokenStream(adaptor,"token 134");
-		try { DebugEnterRule(GrammarFileName, "ascendingOrDescending");
-		DebugLocation(333, 1);
-		try
-		{
-			// Hql.g:334:2: ( (a= 'asc' |a= 'ascending' ) -> ^( ASCENDING[$a.Text] ) | (d= 'desc' |d= 'descending' ) -> ^( DESCENDING[$d.Text] ) )
-			int alt49=2;
-			try { DebugEnterDecision(49, false);
-			int LA49_1 = input.LA(1);
-
-			if ((LA49_1==ASCENDING||LA49_1==133))
-			{
-				alt49 = 1;
-			}
-			else if ((LA49_1==DESCENDING||LA49_1==134))
-			{
-				alt49 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 49, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(49); }
-			switch (alt49)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:334:4: (a= 'asc' |a= 'ascending' )
-				{
-				DebugLocation(334, 4);
-				// Hql.g:334:4: (a= 'asc' |a= 'ascending' )
-				int alt47=2;
-				try { DebugEnterSubRule(47);
-				try { DebugEnterDecision(47, false);
-				int LA47_1 = input.LA(1);
-
-				if ((LA47_1==ASCENDING))
-				{
-					alt47 = 1;
-				}
-				else if ((LA47_1==133))
-				{
-					alt47 = 2;
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 47, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				} finally { DebugExitDecision(47); }
-				switch (alt47)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:334:6: a= 'asc'
-					{
-					DebugLocation(334, 7);
-					a=(IToken)Match(input,ASCENDING,Follow._ASCENDING_in_ascendingOrDescending1757);  
-					stream_ASCENDING.Add(a);
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:334:16: a= 'ascending'
-					{
-					DebugLocation(334, 17);
-					a=(IToken)Match(input,133,Follow._133_in_ascendingOrDescending1763);  
-					stream_133.Add(a);
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(47); }
-
-
-
-				{
-				// AST REWRITE
-				// elements: 
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 335:3: -> ^( ASCENDING[$a.Text] )
-				{
-					DebugLocation(335, 6);
-					// Hql.g:335:6: ^( ASCENDING[$a.Text] )
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(335, 8);
-					root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(ASCENDING, a.Text), root_1);
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:336:4: (d= 'desc' |d= 'descending' )
-				{
-				DebugLocation(336, 4);
-				// Hql.g:336:4: (d= 'desc' |d= 'descending' )
-				int alt48=2;
-				try { DebugEnterSubRule(48);
-				try { DebugEnterDecision(48, false);
-				int LA48_1 = input.LA(1);
-
-				if ((LA48_1==DESCENDING))
-				{
-					alt48 = 1;
-				}
-				else if ((LA48_1==134))
-				{
-					alt48 = 2;
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 48, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				} finally { DebugExitDecision(48); }
-				switch (alt48)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:336:6: d= 'desc'
-					{
-					DebugLocation(336, 7);
-					d=(IToken)Match(input,DESCENDING,Follow._DESCENDING_in_ascendingOrDescending1783);  
-					stream_DESCENDING.Add(d);
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:336:17: d= 'descending'
-					{
-					DebugLocation(336, 18);
-					d=(IToken)Match(input,134,Follow._134_in_ascendingOrDescending1789);  
-					stream_134.Add(d);
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(48); }
-
-
-
-				{
-				// AST REWRITE
-				// elements: 
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 337:3: -> ^( DESCENDING[$d.Text] )
-				{
-					DebugLocation(337, 6);
-					// Hql.g:337:6: ^( DESCENDING[$d.Text] )
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(337, 8);
-					root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(DESCENDING, d.Text), root_1);
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("ascendingOrDescending", 36);
-			LeaveRule("ascendingOrDescending", 36);
-			LeaveRule_ascendingOrDescending();
-		}
-		DebugLocation(338, 1);
-		} finally { DebugExitRule(GrammarFileName, "ascendingOrDescending"); }
-		return retval;
-
-	}
-	// $ANTLR end "ascendingOrDescending"
-
-	partial void EnterRule_havingClause();
-	partial void LeaveRule_havingClause();
-	// $ANTLR start "havingClause"
-	// Hql.g:340:1: havingClause : HAVING ^ logicalExpression ;
-	[GrammarRule("havingClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> havingClause()
-	{
-		EnterRule_havingClause();
-		EnterRule("havingClause", 37);
-		TraceIn("havingClause", 37);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken HAVING143 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> logicalExpression144 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode HAVING143_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "havingClause");
-		DebugLocation(340, 1);
-		try
-		{
-			// Hql.g:341:2: ( HAVING ^ logicalExpression )
-			DebugEnterAlt(1);
-			// Hql.g:341:4: HAVING ^ logicalExpression
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(341, 10);
-			HAVING143=(IToken)Match(input,HAVING,Follow._HAVING_in_havingClause1810); 
-			HAVING143_tree = (IASTNode)adaptor.Create(HAVING143);
-			root_0 = (IASTNode)adaptor.BecomeRoot(HAVING143_tree, root_0);
-			DebugLocation(341, 12);
-			PushFollow(Follow._logicalExpression_in_havingClause1813);
-			logicalExpression144=logicalExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, logicalExpression144.Tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("havingClause", 37);
-			LeaveRule("havingClause", 37);
-			LeaveRule_havingClause();
-		}
-		DebugLocation(342, 1);
-		} finally { DebugExitRule(GrammarFileName, "havingClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "havingClause"
-
-	partial void EnterRule_whereClause();
-	partial void LeaveRule_whereClause();
-	// $ANTLR start "whereClause"
-	// Hql.g:344:1: whereClause : WHERE ^ logicalExpression ;
-	[GrammarRule("whereClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> whereClause()
-	{
-		EnterRule_whereClause();
-		EnterRule("whereClause", 38);
-		TraceIn("whereClause", 38);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken WHERE145 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> logicalExpression146 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode WHERE145_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "whereClause");
-		DebugLocation(344, 1);
-		try
-		{
-			// Hql.g:345:2: ( WHERE ^ logicalExpression )
-			DebugEnterAlt(1);
-			// Hql.g:345:4: WHERE ^ logicalExpression
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(345, 9);
-			WHERE145=(IToken)Match(input,WHERE,Follow._WHERE_in_whereClause1824); 
-			WHERE145_tree = (IASTNode)adaptor.Create(WHERE145);
-			root_0 = (IASTNode)adaptor.BecomeRoot(WHERE145_tree, root_0);
-			DebugLocation(345, 11);
-			PushFollow(Follow._logicalExpression_in_whereClause1827);
-			logicalExpression146=logicalExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, logicalExpression146.Tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("whereClause", 38);
-			LeaveRule("whereClause", 38);
-			LeaveRule_whereClause();
-		}
-		DebugLocation(346, 1);
-		} finally { DebugExitRule(GrammarFileName, "whereClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "whereClause"
-
-	partial void EnterRule_selectedPropertiesList();
-	partial void LeaveRule_selectedPropertiesList();
-	// $ANTLR start "selectedPropertiesList"
-	// Hql.g:348:1: selectedPropertiesList : aliasedExpression ( COMMA ! aliasedExpression )* ;
-	[GrammarRule("selectedPropertiesList")]
-	private AstParserRuleReturnScope<IASTNode, IToken> selectedPropertiesList()
-	{
-		EnterRule_selectedPropertiesList();
-		EnterRule("selectedPropertiesList", 39);
-		TraceIn("selectedPropertiesList", 39);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken COMMA148 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> aliasedExpression147 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> aliasedExpression149 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode COMMA148_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "selectedPropertiesList");
-		DebugLocation(348, 1);
-		try
-		{
-			// Hql.g:349:2: ( aliasedExpression ( COMMA ! aliasedExpression )* )
-			DebugEnterAlt(1);
-			// Hql.g:349:4: aliasedExpression ( COMMA ! aliasedExpression )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(349, 4);
-			PushFollow(Follow._aliasedExpression_in_selectedPropertiesList1838);
-			aliasedExpression147=aliasedExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, aliasedExpression147.Tree);
-			DebugLocation(349, 22);
-			// Hql.g:349:22: ( COMMA ! aliasedExpression )*
-			try { DebugEnterSubRule(50);
-			while (true)
-			{
-				int alt50=2;
-				try { DebugEnterDecision(50, false);
-				int LA50_1 = input.LA(1);
-
-				if ((LA50_1==COMMA))
-				{
-					alt50 = 1;
-				}
-
-
-				} finally { DebugExitDecision(50); }
-				switch ( alt50 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:349:24: COMMA ! aliasedExpression
-					{
-					DebugLocation(349, 29);
-					COMMA148=(IToken)Match(input,COMMA,Follow._COMMA_in_selectedPropertiesList1842); 
-					DebugLocation(349, 31);
-					PushFollow(Follow._aliasedExpression_in_selectedPropertiesList1845);
-					aliasedExpression149=aliasedExpression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, aliasedExpression149.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop50;
-				}
-			}
-
-			loop50:
-				;
-
-			} finally { DebugExitSubRule(50); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("selectedPropertiesList", 39);
-			LeaveRule("selectedPropertiesList", 39);
-			LeaveRule_selectedPropertiesList();
-		}
-		DebugLocation(350, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectedPropertiesList"); }
-		return retval;
-
-	}
-	// $ANTLR end "selectedPropertiesList"
-
-	partial void EnterRule_aliasedExpression();
-	partial void LeaveRule_aliasedExpression();
-	// $ANTLR start "aliasedExpression"
-	// Hql.g:352:1: aliasedExpression : expression ( AS ^ identifier )? ;
-	[GrammarRule("aliasedExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> aliasedExpression()
-	{
-		EnterRule_aliasedExpression();
-		EnterRule("aliasedExpression", 40);
-		TraceIn("aliasedExpression", 40);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken AS151 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> expression150 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> identifier152 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode AS151_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "aliasedExpression");
-		DebugLocation(352, 1);
-		try
-		{
-			// Hql.g:353:2: ( expression ( AS ^ identifier )? )
-			DebugEnterAlt(1);
-			// Hql.g:353:4: expression ( AS ^ identifier )?
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(353, 4);
-			PushFollow(Follow._expression_in_aliasedExpression1860);
-			expression150=expression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, expression150.Tree);
-			DebugLocation(353, 15);
-			// Hql.g:353:15: ( AS ^ identifier )?
-			int alt51=2;
-			try { DebugEnterSubRule(51);
-			try { DebugEnterDecision(51, false);
-			int LA51_1 = input.LA(1);
-
-			if ((LA51_1==AS))
-			{
-				alt51 = 1;
-			}
-			} finally { DebugExitDecision(51); }
-			switch (alt51)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:353:17: AS ^ identifier
-				{
-				DebugLocation(353, 19);
-				AS151=(IToken)Match(input,AS,Follow._AS_in_aliasedExpression1864); 
-				AS151_tree = (IASTNode)adaptor.Create(AS151);
-				root_0 = (IASTNode)adaptor.BecomeRoot(AS151_tree, root_0);
-				DebugLocation(353, 21);
-				PushFollow(Follow._identifier_in_aliasedExpression1867);
-				identifier152=identifier();
-				PopFollow();
-
-				adaptor.AddChild(root_0, identifier152.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(51); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("aliasedExpression", 40);
-			LeaveRule("aliasedExpression", 40);
-			LeaveRule_aliasedExpression();
-		}
-		DebugLocation(354, 1);
-		} finally { DebugExitRule(GrammarFileName, "aliasedExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "aliasedExpression"
-
-	partial void EnterRule_logicalExpression();
-	partial void LeaveRule_logicalExpression();
-	// $ANTLR start "logicalExpression"
-	// Hql.g:381:1: logicalExpression : expression ;
-	[GrammarRule("logicalExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> logicalExpression()
-	{
-		EnterRule_logicalExpression();
-		EnterRule("logicalExpression", 41);
-		TraceIn("logicalExpression", 41);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> expression153 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		try { DebugEnterRule(GrammarFileName, "logicalExpression");
-		DebugLocation(381, 1);
-		try
-		{
-			// Hql.g:382:2: ( expression )
-			DebugEnterAlt(1);
-			// Hql.g:382:4: expression
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(382, 4);
-			PushFollow(Follow._expression_in_logicalExpression1906);
-			expression153=expression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, expression153.Tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("logicalExpression", 41);
-			LeaveRule("logicalExpression", 41);
-			LeaveRule_logicalExpression();
-		}
-		DebugLocation(383, 1);
-		} finally { DebugExitRule(GrammarFileName, "logicalExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "logicalExpression"
-
-	partial void EnterRule_expression();
-	partial void LeaveRule_expression();
-	// $ANTLR start "expression"
-	// Hql.g:386:1: expression : logicalOrExpression ;
-	[GrammarRule("expression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> expression()
-	{
-		EnterRule_expression();
-		EnterRule("expression", 42);
-		TraceIn("expression", 42);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> logicalOrExpression154 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		try { DebugEnterRule(GrammarFileName, "expression");
-		DebugLocation(386, 1);
-		try
-		{
-			// Hql.g:387:2: ( logicalOrExpression )
-			DebugEnterAlt(1);
-			// Hql.g:387:4: logicalOrExpression
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(387, 4);
-			PushFollow(Follow._logicalOrExpression_in_expression1918);
-			logicalOrExpression154=logicalOrExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, logicalOrExpression154.Tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("expression", 42);
-			LeaveRule("expression", 42);
-			LeaveRule_expression();
-		}
-		DebugLocation(388, 1);
-		} finally { DebugExitRule(GrammarFileName, "expression"); }
-		return retval;
-
-	}
-	// $ANTLR end "expression"
-
-	partial void EnterRule_logicalOrExpression();
-	partial void LeaveRule_logicalOrExpression();
-	// $ANTLR start "logicalOrExpression"
-	// Hql.g:391:1: logicalOrExpression : logicalAndExpression ( OR ^ logicalAndExpression )* ;
-	[GrammarRule("logicalOrExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> logicalOrExpression()
-	{
-		EnterRule_logicalOrExpression();
-		EnterRule("logicalOrExpression", 43);
-		TraceIn("logicalOrExpression", 43);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken OR156 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> logicalAndExpression155 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> logicalAndExpression157 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode OR156_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "logicalOrExpression");
-		DebugLocation(391, 1);
-		try
-		{
-			// Hql.g:392:2: ( logicalAndExpression ( OR ^ logicalAndExpression )* )
-			DebugEnterAlt(1);
-			// Hql.g:392:4: logicalAndExpression ( OR ^ logicalAndExpression )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(392, 4);
-			PushFollow(Follow._logicalAndExpression_in_logicalOrExpression1930);
-			logicalAndExpression155=logicalAndExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, logicalAndExpression155.Tree);
-			DebugLocation(392, 25);
-			// Hql.g:392:25: ( OR ^ logicalAndExpression )*
-			try { DebugEnterSubRule(52);
-			while (true)
-			{
-				int alt52=2;
-				try { DebugEnterDecision(52, false);
-				int LA52_1 = input.LA(1);
-
-				if ((LA52_1==OR))
-				{
-					alt52 = 1;
-				}
-
-
-				} finally { DebugExitDecision(52); }
-				switch ( alt52 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:392:27: OR ^ logicalAndExpression
-					{
-					DebugLocation(392, 29);
-					OR156=(IToken)Match(input,OR,Follow._OR_in_logicalOrExpression1934); 
-					OR156_tree = (IASTNode)adaptor.Create(OR156);
-					root_0 = (IASTNode)adaptor.BecomeRoot(OR156_tree, root_0);
-					DebugLocation(392, 31);
-					PushFollow(Follow._logicalAndExpression_in_logicalOrExpression1937);
-					logicalAndExpression157=logicalAndExpression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, logicalAndExpression157.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop52;
-				}
-			}
-
-			loop52:
-				;
-
-			} finally { DebugExitSubRule(52); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("logicalOrExpression", 43);
-			LeaveRule("logicalOrExpression", 43);
-			LeaveRule_logicalOrExpression();
-		}
-		DebugLocation(393, 1);
-		} finally { DebugExitRule(GrammarFileName, "logicalOrExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "logicalOrExpression"
-
-	partial void EnterRule_logicalAndExpression();
-	partial void LeaveRule_logicalAndExpression();
-	// $ANTLR start "logicalAndExpression"
-	// Hql.g:396:1: logicalAndExpression : negatedExpression ( AND ^ negatedExpression )* ;
-	[GrammarRule("logicalAndExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> logicalAndExpression()
-	{
-		EnterRule_logicalAndExpression();
-		EnterRule("logicalAndExpression", 44);
-		TraceIn("logicalAndExpression", 44);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken AND159 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> negatedExpression158 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> negatedExpression160 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode AND159_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "logicalAndExpression");
-		DebugLocation(396, 1);
-		try
-		{
-			// Hql.g:397:2: ( negatedExpression ( AND ^ negatedExpression )* )
-			DebugEnterAlt(1);
-			// Hql.g:397:4: negatedExpression ( AND ^ negatedExpression )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(397, 4);
-			PushFollow(Follow._negatedExpression_in_logicalAndExpression1952);
-			negatedExpression158=negatedExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, negatedExpression158.Tree);
-			DebugLocation(397, 22);
-			// Hql.g:397:22: ( AND ^ negatedExpression )*
-			try { DebugEnterSubRule(53);
-			while (true)
-			{
-				int alt53=2;
-				try { DebugEnterDecision(53, false);
-				int LA53_1 = input.LA(1);
-
-				if ((LA53_1==AND))
-				{
-					alt53 = 1;
-				}
-
-
-				} finally { DebugExitDecision(53); }
-				switch ( alt53 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:397:24: AND ^ negatedExpression
-					{
-					DebugLocation(397, 27);
-					AND159=(IToken)Match(input,AND,Follow._AND_in_logicalAndExpression1956); 
-					AND159_tree = (IASTNode)adaptor.Create(AND159);
-					root_0 = (IASTNode)adaptor.BecomeRoot(AND159_tree, root_0);
-					DebugLocation(397, 29);
-					PushFollow(Follow._negatedExpression_in_logicalAndExpression1959);
-					negatedExpression160=negatedExpression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, negatedExpression160.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop53;
-				}
-			}
-
-			loop53:
-				;
-
-			} finally { DebugExitSubRule(53); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("logicalAndExpression", 44);
-			LeaveRule("logicalAndExpression", 44);
-			LeaveRule_logicalAndExpression();
-		}
-		DebugLocation(398, 1);
-		} finally { DebugExitRule(GrammarFileName, "logicalAndExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "logicalAndExpression"
-
-	partial void EnterRule_negatedExpression();
-	partial void LeaveRule_negatedExpression();
-	// $ANTLR start "negatedExpression"
-	// Hql.g:402:1: negatedExpression : ( NOT x= negatedExpression -> ^() | equalityExpression );
-	[GrammarRule("negatedExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> negatedExpression()
-	{
-		EnterRule_negatedExpression();
-		EnterRule("negatedExpression", 45);
-		TraceIn("negatedExpression", 45);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken NOT161 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> x = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> equalityExpression162 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode NOT161_tree = default(IASTNode);
-		RewriteRuleITokenStream stream_NOT=new RewriteRuleITokenStream(adaptor,"token NOT");
-		RewriteRuleSubtreeStream stream_negatedExpression=new RewriteRuleSubtreeStream(adaptor,"rule negatedExpression");
-		 WeakKeywords(); 
-		try { DebugEnterRule(GrammarFileName, "negatedExpression");
-		DebugLocation(402, 1);
-		try
-		{
-			// Hql.g:404:2: ( NOT x= negatedExpression -> ^() | equalityExpression )
-			int alt54=2;
-			try { DebugEnterDecision(54, false);
-			int LA54_1 = input.LA(1);
-
-			if ((LA54_1==NOT))
-			{
-				alt54 = 1;
-			}
-			else if ((LA54_1==ALL||LA54_1==ANY||LA54_1==AVG||LA54_1==BNOT||LA54_1==CASE||LA54_1==COLON||LA54_1==COUNT||LA54_1==ELEMENTS||LA54_1==EMPTY||LA54_1==EXISTS||LA54_1==FALSE||LA54_1==IDENT||LA54_1==INDICES||LA54_1==MAX||(LA54_1>=MIN && LA54_1<=MINUS)||(LA54_1>=NULL && LA54_1<=NUM_LONG)||LA54_1==OPEN||(LA54_1>=PARAM && LA54_1<=PLUS)||LA54_1==QUOTED_String||LA54_1==SOME||LA54_1==SUM||LA54_1==TRUE))
-			{
-				alt54 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 54, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(54); }
-			switch (alt54)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:404:4: NOT x= negatedExpression
-				{
-				DebugLocation(404, 4);
-				NOT161=(IToken)Match(input,NOT,Follow._NOT_in_negatedExpression1980);  
-				stream_NOT.Add(NOT161);
-
-				DebugLocation(404, 9);
-				PushFollow(Follow._negatedExpression_in_negatedExpression1984);
-				x=negatedExpression();
-				PopFollow();
-
-				stream_negatedExpression.Add(x.Tree);
-
-
-				{
-				// AST REWRITE
-				// elements: 
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 405:3: -> ^()
-				{
-					DebugLocation(405, 6);
-					// Hql.g:405:6: ^()
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(405, 8);
-					root_1 = (IASTNode)adaptor.BecomeRoot(NegateNode((x!=null?((IASTNode)x.Tree):default(IASTNode))), root_1);
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:406:4: equalityExpression
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(406, 4);
-				PushFollow(Follow._equalityExpression_in_negatedExpression1997);
-				equalityExpression162=equalityExpression();
-				PopFollow();
-
-				adaptor.AddChild(root_0, equalityExpression162.Tree);
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("negatedExpression", 45);
-			LeaveRule("negatedExpression", 45);
-			LeaveRule_negatedExpression();
-		}
-		DebugLocation(407, 1);
-		} finally { DebugExitRule(GrammarFileName, "negatedExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "negatedExpression"
-
-	partial void EnterRule_equalityExpression();
-	partial void LeaveRule_equalityExpression();
-	// $ANTLR start "equalityExpression"
-	// Hql.g:412:1: equalityExpression : x= relationalExpression ( ( EQ ^|isx= IS ^ ( NOT !)? | NE ^|ne= SQL_NE ^) y= relationalExpression )* ;
-	[GrammarRule("equalityExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> equalityExpression()
-	{
-		EnterRule_equalityExpression();
-		EnterRule("equalityExpression", 46);
-		TraceIn("equalityExpression", 46);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken isx = default(IToken);
-		IToken ne = default(IToken);
-		IToken EQ163 = default(IToken);
-		IToken NOT164 = default(IToken);
-		IToken NE165 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> x = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> y = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode isx_tree = default(IASTNode);
-		IASTNode ne_tree = default(IASTNode);
-		IASTNode EQ163_tree = default(IASTNode);
-		IASTNode NOT164_tree = default(IASTNode);
-		IASTNode NE165_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "equalityExpression");
-		DebugLocation(412, 1);
-		try
-		{
-			// Hql.g:417:2: (x= relationalExpression ( ( EQ ^|isx= IS ^ ( NOT !)? | NE ^|ne= SQL_NE ^) y= relationalExpression )* )
-			DebugEnterAlt(1);
-			// Hql.g:417:4: x= relationalExpression ( ( EQ ^|isx= IS ^ ( NOT !)? | NE ^|ne= SQL_NE ^) y= relationalExpression )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(417, 5);
-			PushFollow(Follow._relationalExpression_in_equalityExpression2019);
-			x=relationalExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, x.Tree);
-			DebugLocation(417, 27);
-			// Hql.g:417:27: ( ( EQ ^|isx= IS ^ ( NOT !)? | NE ^|ne= SQL_NE ^) y= relationalExpression )*
-			try { DebugEnterSubRule(57);
-			while (true)
-			{
-				int alt57=2;
-				try { DebugEnterDecision(57, false);
-				int LA57_1 = input.LA(1);
-
-				if ((LA57_1==EQ||LA57_1==IS||LA57_1==NE||LA57_1==SQL_NE))
-				{
-					alt57 = 1;
-				}
-
-
-				} finally { DebugExitDecision(57); }
-				switch ( alt57 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:418:3: ( EQ ^|isx= IS ^ ( NOT !)? | NE ^|ne= SQL_NE ^) y= relationalExpression
-					{
-					DebugLocation(418, 3);
-					// Hql.g:418:3: ( EQ ^|isx= IS ^ ( NOT !)? | NE ^|ne= SQL_NE ^)
-					int alt56=4;
-					try { DebugEnterSubRule(56);
-					try { DebugEnterDecision(56, false);
-					switch (input.LA(1))
-					{
-					case EQ:
-						{
-						alt56 = 1;
-						}
-						break;
-					case IS:
-						{
-						alt56 = 2;
-						}
-						break;
-					case NE:
-						{
-						alt56 = 3;
-						}
-						break;
-					case SQL_NE:
-						{
-						alt56 = 4;
-						}
-						break;
-					default:
-						{
-							NoViableAltException nvae = new NoViableAltException("", 56, 0, input, 1);
-							DebugRecognitionException(nvae);
-							throw nvae;
-						}
-					}
-
-					} finally { DebugExitDecision(56); }
-					switch (alt56)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:418:5: EQ ^
-						{
-						DebugLocation(418, 7);
-						EQ163=(IToken)Match(input,EQ,Follow._EQ_in_equalityExpression2027); 
-						EQ163_tree = (IASTNode)adaptor.Create(EQ163);
-						root_0 = (IASTNode)adaptor.BecomeRoot(EQ163_tree, root_0);
-
-						}
-						break;
-					case 2:
-						DebugEnterAlt(2);
-						// Hql.g:419:5: isx= IS ^ ( NOT !)?
-						{
-						DebugLocation(419, 8);
-						isx=(IToken)Match(input,IS,Follow._IS_in_equalityExpression2036); 
-						isx_tree = (IASTNode)adaptor.Create(isx);
-						root_0 = (IASTNode)adaptor.BecomeRoot(isx_tree, root_0);
-						DebugLocation(419, 13);
-						 isx.Type = EQ; 
-						DebugLocation(419, 33);
-						// Hql.g:419:33: ( NOT !)?
-						int alt55=2;
-						try { DebugEnterSubRule(55);
-						try { DebugEnterDecision(55, false);
-						int LA55_1 = input.LA(1);
-
-						if ((LA55_1==NOT))
-						{
-							alt55 = 1;
-						}
-						} finally { DebugExitDecision(55); }
-						switch (alt55)
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// Hql.g:419:34: NOT !
-							{
-							DebugLocation(419, 37);
-							NOT164=(IToken)Match(input,NOT,Follow._NOT_in_equalityExpression2042); 
-							DebugLocation(419, 39);
-							 isx.Type =NE; 
-
-							}
-							break;
-
-						}
-						} finally { DebugExitSubRule(55); }
-
-
-						}
-						break;
-					case 3:
-						DebugEnterAlt(3);
-						// Hql.g:420:5: NE ^
-						{
-						DebugLocation(420, 7);
-						NE165=(IToken)Match(input,NE,Follow._NE_in_equalityExpression2054); 
-						NE165_tree = (IASTNode)adaptor.Create(NE165);
-						root_0 = (IASTNode)adaptor.BecomeRoot(NE165_tree, root_0);
-
-						}
-						break;
-					case 4:
-						DebugEnterAlt(4);
-						// Hql.g:421:5: ne= SQL_NE ^
-						{
-						DebugLocation(421, 7);
-						ne=(IToken)Match(input,SQL_NE,Follow._SQL_NE_in_equalityExpression2063); 
-						ne_tree = (IASTNode)adaptor.Create(ne);
-						root_0 = (IASTNode)adaptor.BecomeRoot(ne_tree, root_0);
-						DebugLocation(421, 16);
-						 ne.Type = NE; 
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(56); }
-
-					DebugLocation(422, 6);
-					PushFollow(Follow._relationalExpression_in_equalityExpression2074);
-					y=relationalExpression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, y.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop57;
-				}
-			}
-
-			loop57:
-				;
-
-			} finally { DebugExitSubRule(57); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-
-						// Post process the equality expression to clean up 'is null', etc.
-						retval.Tree =  ProcessEqualityExpression(retval.Tree);
-					
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("equalityExpression", 46);
-			LeaveRule("equalityExpression", 46);
-			LeaveRule_equalityExpression();
-		}
-		DebugLocation(423, 1);
-		} finally { DebugExitRule(GrammarFileName, "equalityExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "equalityExpression"
-
-	partial void EnterRule_relationalExpression();
-	partial void LeaveRule_relationalExpression();
-	// $ANTLR start "relationalExpression"
-	// Hql.g:429:1: relationalExpression : concatenation ( ( ( ( LT ^| GT ^| LE ^| GE ^) bitwiseNotExpression )* ) | (n= NOT !)? ( (i= IN ^ inList ) | (b= BETWEEN ^ betweenList ) | (l= LIKE ^ concatenation likeEscape ) | ( MEMBER ! ( OF !)? p= path !) ) ) ;
-	[GrammarRule("relationalExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> relationalExpression()
-	{
-		EnterRule_relationalExpression();
-		EnterRule("relationalExpression", 47);
-		TraceIn("relationalExpression", 47);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken n = default(IToken);
-		IToken i = default(IToken);
-		IToken b = default(IToken);
-		IToken l = default(IToken);
-		IToken LT167 = default(IToken);
-		IToken GT168 = default(IToken);
-		IToken LE169 = default(IToken);
-		IToken GE170 = default(IToken);
-		IToken MEMBER176 = default(IToken);
-		IToken OF177 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> p = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> concatenation166 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> bitwiseNotExpression171 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> inList172 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> betweenList173 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> concatenation174 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> likeEscape175 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode n_tree = default(IASTNode);
-		IASTNode i_tree = default(IASTNode);
-		IASTNode b_tree = default(IASTNode);
-		IASTNode l_tree = default(IASTNode);
-		IASTNode LT167_tree = default(IASTNode);
-		IASTNode GT168_tree = default(IASTNode);
-		IASTNode LE169_tree = default(IASTNode);
-		IASTNode GE170_tree = default(IASTNode);
-		IASTNode MEMBER176_tree = default(IASTNode);
-		IASTNode OF177_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "relationalExpression");
-		DebugLocation(429, 1);
-		try
-		{
-			// Hql.g:430:2: ( concatenation ( ( ( ( LT ^| GT ^| LE ^| GE ^) bitwiseNotExpression )* ) | (n= NOT !)? ( (i= IN ^ inList ) | (b= BETWEEN ^ betweenList ) | (l= LIKE ^ concatenation likeEscape ) | ( MEMBER ! ( OF !)? p= path !) ) ) )
-			DebugEnterAlt(1);
-			// Hql.g:430:4: concatenation ( ( ( ( LT ^| GT ^| LE ^| GE ^) bitwiseNotExpression )* ) | (n= NOT !)? ( (i= IN ^ inList ) | (b= BETWEEN ^ betweenList ) | (l= LIKE ^ concatenation likeEscape ) | ( MEMBER ! ( OF !)? p= path !) ) )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(430, 4);
-			PushFollow(Follow._concatenation_in_relationalExpression2091);
-			concatenation166=concatenation();
-			PopFollow();
-
-			adaptor.AddChild(root_0, concatenation166.Tree);
-			DebugLocation(430, 18);
-			// Hql.g:430:18: ( ( ( ( LT ^| GT ^| LE ^| GE ^) bitwiseNotExpression )* ) | (n= NOT !)? ( (i= IN ^ inList ) | (b= BETWEEN ^ betweenList ) | (l= LIKE ^ concatenation likeEscape ) | ( MEMBER ! ( OF !)? p= path !) ) )
-			int alt63=2;
-			try { DebugEnterSubRule(63);
-			try { DebugEnterDecision(63, false);
-			int LA63_1 = input.LA(1);
-
-			if ((LA63_1==EOF||LA63_1==AND||(LA63_1>=AS && LA63_1<=ASCENDING)||(LA63_1>=CLOSE && LA63_1<=CLOSE_BRACKET)||LA63_1==COMMA||LA63_1==DESCENDING||LA63_1==ELSE||(LA63_1>=END && LA63_1<=EQ)||(LA63_1>=FROM && LA63_1<=HAVING)||LA63_1==INNER||LA63_1==IS||(LA63_1>=JOIN && LA63_1<=LE)||LA63_1==LEFT||LA63_1==LT||LA63_1==NE||(LA63_1>=OR && LA63_1<=ORDER)||LA63_1==RIGHT||LA63_1==SKIP||LA63_1==SQL_NE||(LA63_1>=TAKE && LA63_1<=THEN)||LA63_1==UNION||(LA63_1>=WHEN && LA63_1<=WHERE)||(LA63_1>=133 && LA63_1<=134)))
-			{
-				alt63 = 1;
-			}
-			else if ((LA63_1==BETWEEN||LA63_1==IN||LA63_1==LIKE||LA63_1==MEMBER||LA63_1==NOT))
-			{
-				alt63 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 63, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(63); }
-			switch (alt63)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:431:3: ( ( ( LT ^| GT ^| LE ^| GE ^) bitwiseNotExpression )* )
-				{
-				DebugLocation(431, 3);
-				// Hql.g:431:3: ( ( ( LT ^| GT ^| LE ^| GE ^) bitwiseNotExpression )* )
-				DebugEnterAlt(1);
-				// Hql.g:431:5: ( ( LT ^| GT ^| LE ^| GE ^) bitwiseNotExpression )*
-				{
-				DebugLocation(431, 5);
-				// Hql.g:431:5: ( ( LT ^| GT ^| LE ^| GE ^) bitwiseNotExpression )*
-				try { DebugEnterSubRule(59);
-				while (true)
-				{
-					int alt59=2;
-					try { DebugEnterDecision(59, false);
-					int LA59_1 = input.LA(1);
-
-					if ((LA59_1==GE||LA59_1==GT||LA59_1==LE||LA59_1==LT))
-					{
-						alt59 = 1;
-					}
-
-
-					} finally { DebugExitDecision(59); }
-					switch ( alt59 )
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:431:7: ( LT ^| GT ^| LE ^| GE ^) bitwiseNotExpression
-						{
-						DebugLocation(431, 7);
-						// Hql.g:431:7: ( LT ^| GT ^| LE ^| GE ^)
-						int alt58=4;
-						try { DebugEnterSubRule(58);
-						try { DebugEnterDecision(58, false);
-						switch (input.LA(1))
-						{
-						case LT:
-							{
-							alt58 = 1;
-							}
-							break;
-						case GT:
-							{
-							alt58 = 2;
-							}
-							break;
-						case LE:
-							{
-							alt58 = 3;
-							}
-							break;
-						case GE:
-							{
-							alt58 = 4;
-							}
-							break;
-						default:
-							{
-								NoViableAltException nvae = new NoViableAltException("", 58, 0, input, 1);
-								DebugRecognitionException(nvae);
-								throw nvae;
-							}
-						}
-
-						} finally { DebugExitDecision(58); }
-						switch (alt58)
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// Hql.g:431:9: LT ^
-							{
-							DebugLocation(431, 11);
-							LT167=(IToken)Match(input,LT,Follow._LT_in_relationalExpression2103); 
-							LT167_tree = (IASTNode)adaptor.Create(LT167);
-							root_0 = (IASTNode)adaptor.BecomeRoot(LT167_tree, root_0);
-
-							}
-							break;
-						case 2:
-							DebugEnterAlt(2);
-							// Hql.g:431:15: GT ^
-							{
-							DebugLocation(431, 17);
-							GT168=(IToken)Match(input,GT,Follow._GT_in_relationalExpression2108); 
-							GT168_tree = (IASTNode)adaptor.Create(GT168);
-							root_0 = (IASTNode)adaptor.BecomeRoot(GT168_tree, root_0);
-
-							}
-							break;
-						case 3:
-							DebugEnterAlt(3);
-							// Hql.g:431:21: LE ^
-							{
-							DebugLocation(431, 23);
-							LE169=(IToken)Match(input,LE,Follow._LE_in_relationalExpression2113); 
-							LE169_tree = (IASTNode)adaptor.Create(LE169);
-							root_0 = (IASTNode)adaptor.BecomeRoot(LE169_tree, root_0);
-
-							}
-							break;
-						case 4:
-							DebugEnterAlt(4);
-							// Hql.g:431:27: GE ^
-							{
-							DebugLocation(431, 29);
-							GE170=(IToken)Match(input,GE,Follow._GE_in_relationalExpression2118); 
-							GE170_tree = (IASTNode)adaptor.Create(GE170);
-							root_0 = (IASTNode)adaptor.BecomeRoot(GE170_tree, root_0);
-
-							}
-							break;
-
-						}
-						} finally { DebugExitSubRule(58); }
-
-						DebugLocation(431, 33);
-						PushFollow(Follow._bitwiseNotExpression_in_relationalExpression2123);
-						bitwiseNotExpression171=bitwiseNotExpression();
-						PopFollow();
-
-						adaptor.AddChild(root_0, bitwiseNotExpression171.Tree);
-
-						}
-						break;
-
-					default:
-						goto loop59;
-					}
-				}
-
-				loop59:
-					;
-
-				} finally { DebugExitSubRule(59); }
-
-
-				}
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:433:5: (n= NOT !)? ( (i= IN ^ inList ) | (b= BETWEEN ^ betweenList ) | (l= LIKE ^ concatenation likeEscape ) | ( MEMBER ! ( OF !)? p= path !) )
-				{
-				DebugLocation(433, 5);
-				// Hql.g:433:5: (n= NOT !)?
-				int alt60=2;
-				try { DebugEnterSubRule(60);
-				try { DebugEnterDecision(60, false);
-				int LA60_1 = input.LA(1);
-
-				if ((LA60_1==NOT))
-				{
-					alt60 = 1;
-				}
-				} finally { DebugExitDecision(60); }
-				switch (alt60)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:433:6: n= NOT !
-					{
-					DebugLocation(433, 7);
-					n=(IToken)Match(input,NOT,Follow._NOT_in_relationalExpression2140); 
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(60); }
-
-				DebugLocation(433, 15);
-				// Hql.g:433:15: ( (i= IN ^ inList ) | (b= BETWEEN ^ betweenList ) | (l= LIKE ^ concatenation likeEscape ) | ( MEMBER ! ( OF !)? p= path !) )
-				int alt62=4;
-				try { DebugEnterSubRule(62);
-				try { DebugEnterDecision(62, false);
-				switch (input.LA(1))
-				{
-				case IN:
-					{
-					alt62 = 1;
-					}
-					break;
-				case BETWEEN:
-					{
-					alt62 = 2;
-					}
-					break;
-				case LIKE:
-					{
-					alt62 = 3;
-					}
-					break;
-				case MEMBER:
-					{
-					alt62 = 4;
-					}
-					break;
-				default:
-					{
-						NoViableAltException nvae = new NoViableAltException("", 62, 0, input, 1);
-						DebugRecognitionException(nvae);
-						throw nvae;
-					}
-				}
-
-				} finally { DebugExitDecision(62); }
-				switch (alt62)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:436:4: (i= IN ^ inList )
-					{
-					DebugLocation(436, 4);
-					// Hql.g:436:4: (i= IN ^ inList )
-					DebugEnterAlt(1);
-					// Hql.g:436:5: i= IN ^ inList
-					{
-					DebugLocation(436, 6);
-					i=(IToken)Match(input,IN,Follow._IN_in_relationalExpression2161); 
-					i_tree = (IASTNode)adaptor.Create(i);
-					root_0 = (IASTNode)adaptor.BecomeRoot(i_tree, root_0);
-					DebugLocation(436, 11);
-
-										i.Type = (n == null) ? IN : NOT_IN;
-										i.Text = (n == null) ? "in" : "not in";
-									
-					DebugLocation(440, 5);
-					PushFollow(Follow._inList_in_relationalExpression2170);
-					inList172=inList();
-					PopFollow();
-
-					adaptor.AddChild(root_0, inList172.Tree);
-
-					}
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:441:6: (b= BETWEEN ^ betweenList )
-					{
-					DebugLocation(441, 6);
-					// Hql.g:441:6: (b= BETWEEN ^ betweenList )
-					DebugEnterAlt(1);
-					// Hql.g:441:7: b= BETWEEN ^ betweenList
-					{
-					DebugLocation(441, 8);
-					b=(IToken)Match(input,BETWEEN,Follow._BETWEEN_in_relationalExpression2181); 
-					b_tree = (IASTNode)adaptor.Create(b);
-					root_0 = (IASTNode)adaptor.BecomeRoot(b_tree, root_0);
-					DebugLocation(441, 18);
-
-										b.Type = (n == null) ? BETWEEN : NOT_BETWEEN;
-										b.Text = (n == null) ? "between" : "not between";
-									
-					DebugLocation(445, 5);
-					PushFollow(Follow._betweenList_in_relationalExpression2190);
-					betweenList173=betweenList();
-					PopFollow();
-
-					adaptor.AddChild(root_0, betweenList173.Tree);
-
-					}
-
-
-					}
-					break;
-				case 3:
-					DebugEnterAlt(3);
-					// Hql.g:446:6: (l= LIKE ^ concatenation likeEscape )
-					{
-					DebugLocation(446, 6);
-					// Hql.g:446:6: (l= LIKE ^ concatenation likeEscape )
-					DebugEnterAlt(1);
-					// Hql.g:446:7: l= LIKE ^ concatenation likeEscape
-					{
-					DebugLocation(446, 8);
-					l=(IToken)Match(input,LIKE,Follow._LIKE_in_relationalExpression2202); 
-					l_tree = (IASTNode)adaptor.Create(l);
-					root_0 = (IASTNode)adaptor.BecomeRoot(l_tree, root_0);
-					DebugLocation(446, 15);
-
-										l.Type = (n == null) ? LIKE : NOT_LIKE;
-										l.Text = (n == null) ? "like" : "not like";
-									
-					DebugLocation(450, 5);
-					PushFollow(Follow._concatenation_in_relationalExpression2211);
-					concatenation174=concatenation();
-					PopFollow();
-
-					adaptor.AddChild(root_0, concatenation174.Tree);
-					DebugLocation(450, 19);
-					PushFollow(Follow._likeEscape_in_relationalExpression2213);
-					likeEscape175=likeEscape();
-					PopFollow();
-
-					adaptor.AddChild(root_0, likeEscape175.Tree);
-
-					}
-
-
-					}
-					break;
-				case 4:
-					DebugEnterAlt(4);
-					// Hql.g:451:6: ( MEMBER ! ( OF !)? p= path !)
-					{
-					DebugLocation(451, 6);
-					// Hql.g:451:6: ( MEMBER ! ( OF !)? p= path !)
-					DebugEnterAlt(1);
-					// Hql.g:451:7: MEMBER ! ( OF !)? p= path !
-					{
-					DebugLocation(451, 13);
-					MEMBER176=(IToken)Match(input,MEMBER,Follow._MEMBER_in_relationalExpression2222); 
-					DebugLocation(451, 15);
-					// Hql.g:451:15: ( OF !)?
-					int alt61=2;
-					try { DebugEnterSubRule(61);
-					try { DebugEnterDecision(61, false);
-					int LA61_1 = input.LA(1);
-
-					if ((LA61_1==OF))
-					{
-						alt61 = 1;
-					}
-					} finally { DebugExitDecision(61); }
-					switch (alt61)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:451:16: OF !
-						{
-						DebugLocation(451, 18);
-						OF177=(IToken)Match(input,OF,Follow._OF_in_relationalExpression2226); 
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(61); }
-
-					DebugLocation(451, 23);
-					PushFollow(Follow._path_in_relationalExpression2233);
-					p=path();
-					PopFollow();
-
-					DebugLocation(451, 30);
-
-									root_0 = ProcessMemberOf(n,(p!=null?((IASTNode)p.Tree):default(IASTNode)), root_0);
-								  
-
-					}
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(62); }
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(63); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("relationalExpression", 47);
-			LeaveRule("relationalExpression", 47);
-			LeaveRule_relationalExpression();
-		}
-		DebugLocation(456, 1);
-		} finally { DebugExitRule(GrammarFileName, "relationalExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "relationalExpression"
-
-	partial void EnterRule_likeEscape();
-	partial void LeaveRule_likeEscape();
-	// $ANTLR start "likeEscape"
-	// Hql.g:458:1: likeEscape : ( ESCAPE ^ concatenation )? ;
-	[GrammarRule("likeEscape")]
-	private AstParserRuleReturnScope<IASTNode, IToken> likeEscape()
-	{
-		EnterRule_likeEscape();
-		EnterRule("likeEscape", 48);
-		TraceIn("likeEscape", 48);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken ESCAPE178 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> concatenation179 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode ESCAPE178_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "likeEscape");
-		DebugLocation(458, 1);
-		try
-		{
-			// Hql.g:459:2: ( ( ESCAPE ^ concatenation )? )
-			DebugEnterAlt(1);
-			// Hql.g:459:4: ( ESCAPE ^ concatenation )?
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(459, 4);
-			// Hql.g:459:4: ( ESCAPE ^ concatenation )?
-			int alt64=2;
-			try { DebugEnterSubRule(64);
-			try { DebugEnterDecision(64, false);
-			int LA64_1 = input.LA(1);
-
-			if ((LA64_1==ESCAPE))
-			{
-				alt64 = 1;
-			}
-			} finally { DebugExitDecision(64); }
-			switch (alt64)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:459:5: ESCAPE ^ concatenation
-				{
-				DebugLocation(459, 11);
-				ESCAPE178=(IToken)Match(input,ESCAPE,Follow._ESCAPE_in_likeEscape2260); 
-				ESCAPE178_tree = (IASTNode)adaptor.Create(ESCAPE178);
-				root_0 = (IASTNode)adaptor.BecomeRoot(ESCAPE178_tree, root_0);
-				DebugLocation(459, 13);
-				PushFollow(Follow._concatenation_in_likeEscape2263);
-				concatenation179=concatenation();
-				PopFollow();
-
-				adaptor.AddChild(root_0, concatenation179.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(64); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("likeEscape", 48);
-			LeaveRule("likeEscape", 48);
-			LeaveRule_likeEscape();
-		}
-		DebugLocation(460, 1);
-		} finally { DebugExitRule(GrammarFileName, "likeEscape"); }
-		return retval;
-
-	}
-	// $ANTLR end "likeEscape"
-
-	partial void EnterRule_inList();
-	partial void LeaveRule_inList();
-	// $ANTLR start "inList"
-	// Hql.g:462:1: inList : compoundExpr -> ^( IN_LIST[\"inList\"] compoundExpr ) ;
-	[GrammarRule("inList")]
-	private AstParserRuleReturnScope<IASTNode, IToken> inList()
-	{
-		EnterRule_inList();
-		EnterRule("inList", 49);
-		TraceIn("inList", 49);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> compoundExpr180 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		RewriteRuleSubtreeStream stream_compoundExpr=new RewriteRuleSubtreeStream(adaptor,"rule compoundExpr");
-		try { DebugEnterRule(GrammarFileName, "inList");
-		DebugLocation(462, 1);
-		try
-		{
-			// Hql.g:463:2: ( compoundExpr -> ^( IN_LIST[\"inList\"] compoundExpr ) )
-			DebugEnterAlt(1);
-			// Hql.g:463:4: compoundExpr
-			{
-			DebugLocation(463, 4);
-			PushFollow(Follow._compoundExpr_in_inList2276);
-			compoundExpr180=compoundExpr();
-			PopFollow();
-
-			stream_compoundExpr.Add(compoundExpr180.Tree);
-
-
-			{
-			// AST REWRITE
-			// elements: compoundExpr
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 464:2: -> ^( IN_LIST[\"inList\"] compoundExpr )
-			{
-				DebugLocation(464, 5);
-				// Hql.g:464:5: ^( IN_LIST[\"inList\"] compoundExpr )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(464, 7);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(IN_LIST, "inList"), root_1);
-
-				DebugLocation(464, 25);
-				adaptor.AddChild(root_1, stream_compoundExpr.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("inList", 49);
-			LeaveRule("inList", 49);
-			LeaveRule_inList();
-		}
-		DebugLocation(465, 1);
-		} finally { DebugExitRule(GrammarFileName, "inList"); }
-		return retval;
-
-	}
-	// $ANTLR end "inList"
-
-	partial void EnterRule_betweenList();
-	partial void LeaveRule_betweenList();
-	// $ANTLR start "betweenList"
-	// Hql.g:467:1: betweenList : concatenation AND ! concatenation ;
-	[GrammarRule("betweenList")]
-	private AstParserRuleReturnScope<IASTNode, IToken> betweenList()
-	{
-		EnterRule_betweenList();
-		EnterRule("betweenList", 50);
-		TraceIn("betweenList", 50);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken AND182 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> concatenation181 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> concatenation183 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode AND182_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "betweenList");
-		DebugLocation(467, 1);
-		try
-		{
-			// Hql.g:468:2: ( concatenation AND ! concatenation )
-			DebugEnterAlt(1);
-			// Hql.g:468:4: concatenation AND ! concatenation
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(468, 4);
-			PushFollow(Follow._concatenation_in_betweenList2297);
-			concatenation181=concatenation();
-			PopFollow();
-
-			adaptor.AddChild(root_0, concatenation181.Tree);
-			DebugLocation(468, 21);
-			AND182=(IToken)Match(input,AND,Follow._AND_in_betweenList2299); 
-			DebugLocation(468, 23);
-			PushFollow(Follow._concatenation_in_betweenList2302);
-			concatenation183=concatenation();
-			PopFollow();
-
-			adaptor.AddChild(root_0, concatenation183.Tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("betweenList", 50);
-			LeaveRule("betweenList", 50);
-			LeaveRule_betweenList();
-		}
-		DebugLocation(469, 1);
-		} finally { DebugExitRule(GrammarFileName, "betweenList"); }
-		return retval;
-
-	}
-	// $ANTLR end "betweenList"
-
-	partial void EnterRule_concatenation();
-	partial void LeaveRule_concatenation();
-	// $ANTLR start "concatenation"
-	// Hql.g:472:1: concatenation : a= bitwiseNotExpression (c= CONCAT ^ bitwiseNotExpression ( CONCAT ! bitwiseNotExpression )* )? ;
-	[GrammarRule("concatenation")]
-	private AstParserRuleReturnScope<IASTNode, IToken> concatenation()
-	{
-		EnterRule_concatenation();
-		EnterRule("concatenation", 51);
-		TraceIn("concatenation", 51);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken c = default(IToken);
-		IToken CONCAT185 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> a = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> bitwiseNotExpression184 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> bitwiseNotExpression186 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode c_tree = default(IASTNode);
-		IASTNode CONCAT185_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "concatenation");
-		DebugLocation(472, 1);
-		try
-		{
-			// Hql.g:483:2: (a= bitwiseNotExpression (c= CONCAT ^ bitwiseNotExpression ( CONCAT ! bitwiseNotExpression )* )? )
-			DebugEnterAlt(1);
-			// Hql.g:483:4: a= bitwiseNotExpression (c= CONCAT ^ bitwiseNotExpression ( CONCAT ! bitwiseNotExpression )* )?
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(483, 5);
-			PushFollow(Follow._bitwiseNotExpression_in_concatenation2321);
-			a=bitwiseNotExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, a.Tree);
-			DebugLocation(484, 2);
-			// Hql.g:484:2: (c= CONCAT ^ bitwiseNotExpression ( CONCAT ! bitwiseNotExpression )* )?
-			int alt66=2;
-			try { DebugEnterSubRule(66);
-			try { DebugEnterDecision(66, false);
-			int LA66_1 = input.LA(1);
-
-			if ((LA66_1==CONCAT))
-			{
-				alt66 = 1;
-			}
-			} finally { DebugExitDecision(66); }
-			switch (alt66)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:484:4: c= CONCAT ^ bitwiseNotExpression ( CONCAT ! bitwiseNotExpression )*
-				{
-				DebugLocation(484, 5);
-				c=(IToken)Match(input,CONCAT,Follow._CONCAT_in_concatenation2329); 
-				c_tree = (IASTNode)adaptor.Create(c);
-				root_0 = (IASTNode)adaptor.BecomeRoot(c_tree, root_0);
-				DebugLocation(484, 14);
-				 c.Type = EXPR_LIST; c.Text = "concatList"; 
-				DebugLocation(485, 4);
-				PushFollow(Follow._bitwiseNotExpression_in_concatenation2338);
-				bitwiseNotExpression184=bitwiseNotExpression();
-				PopFollow();
-
-				adaptor.AddChild(root_0, bitwiseNotExpression184.Tree);
-				DebugLocation(486, 4);
-				// Hql.g:486:4: ( CONCAT ! bitwiseNotExpression )*
-				try { DebugEnterSubRule(65);
-				while (true)
-				{
-					int alt65=2;
-					try { DebugEnterDecision(65, false);
-					int LA65_1 = input.LA(1);
-
-					if ((LA65_1==CONCAT))
-					{
-						alt65 = 1;
-					}
-
-
-					} finally { DebugExitDecision(65); }
-					switch ( alt65 )
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:486:6: CONCAT ! bitwiseNotExpression
-						{
-						DebugLocation(486, 12);
-						CONCAT185=(IToken)Match(input,CONCAT,Follow._CONCAT_in_concatenation2345); 
-						DebugLocation(486, 14);
-						PushFollow(Follow._bitwiseNotExpression_in_concatenation2348);
-						bitwiseNotExpression186=bitwiseNotExpression();
-						PopFollow();
-
-						adaptor.AddChild(root_0, bitwiseNotExpression186.Tree);
-
-						}
-						break;
-
-					default:
-						goto loop65;
-					}
-				}
-
-				loop65:
-					;
-
-				} finally { DebugExitSubRule(65); }
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(66); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-
-			   if (c != null)
-			   {
-			      IASTNode mc = (IASTNode) adaptor.Create(METHOD_CALL, "||");
-			      IASTNode concat = (IASTNode) adaptor.Create(IDENT, "concat");
-			      mc.AddChild(concat);
-			      mc.AddChild((IASTNode) retval.Tree);
-			      retval.Tree = mc;
-			   }
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("concatenation", 51);
-			LeaveRule("concatenation", 51);
-			LeaveRule_concatenation();
-		}
-		DebugLocation(488, 1);
-		} finally { DebugExitRule(GrammarFileName, "concatenation"); }
-		return retval;
-
-	}
-	// $ANTLR end "concatenation"
-
-	partial void EnterRule_bitwiseNotExpression();
-	partial void LeaveRule_bitwiseNotExpression();
-	// $ANTLR start "bitwiseNotExpression"
-	// Hql.g:491:1: bitwiseNotExpression : ( ( BNOT ^ bitwiseOrExpression ) | bitwiseOrExpression );
-	[GrammarRule("bitwiseNotExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> bitwiseNotExpression()
-	{
-		EnterRule_bitwiseNotExpression();
-		EnterRule("bitwiseNotExpression", 52);
-		TraceIn("bitwiseNotExpression", 52);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken BNOT187 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> bitwiseOrExpression188 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> bitwiseOrExpression189 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode BNOT187_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "bitwiseNotExpression");
-		DebugLocation(491, 1);
-		try
-		{
-			// Hql.g:492:2: ( ( BNOT ^ bitwiseOrExpression ) | bitwiseOrExpression )
-			int alt67=2;
-			try { DebugEnterDecision(67, false);
-			int LA67_1 = input.LA(1);
-
-			if ((LA67_1==BNOT))
-			{
-				alt67 = 1;
-			}
-			else if ((LA67_1==ALL||LA67_1==ANY||LA67_1==AVG||LA67_1==CASE||LA67_1==COLON||LA67_1==COUNT||LA67_1==ELEMENTS||LA67_1==EMPTY||LA67_1==EXISTS||LA67_1==FALSE||LA67_1==IDENT||LA67_1==INDICES||LA67_1==MAX||(LA67_1>=MIN && LA67_1<=MINUS)||(LA67_1>=NULL && LA67_1<=NUM_LONG)||LA67_1==OPEN||(LA67_1>=PARAM && LA67_1<=PLUS)||LA67_1==QUOTED_String||LA67_1==SOME||LA67_1==SUM||LA67_1==TRUE))
-			{
-				alt67 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 67, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(67); }
-			switch (alt67)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:492:4: ( BNOT ^ bitwiseOrExpression )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(492, 4);
-				// Hql.g:492:4: ( BNOT ^ bitwiseOrExpression )
-				DebugEnterAlt(1);
-				// Hql.g:492:5: BNOT ^ bitwiseOrExpression
-				{
-				DebugLocation(492, 9);
-				BNOT187=(IToken)Match(input,BNOT,Follow._BNOT_in_bitwiseNotExpression2372); 
-				BNOT187_tree = (IASTNode)adaptor.Create(BNOT187);
-				root_0 = (IASTNode)adaptor.BecomeRoot(BNOT187_tree, root_0);
-				DebugLocation(492, 11);
-				PushFollow(Follow._bitwiseOrExpression_in_bitwiseNotExpression2375);
-				bitwiseOrExpression188=bitwiseOrExpression();
-				PopFollow();
-
-				adaptor.AddChild(root_0, bitwiseOrExpression188.Tree);
-
-				}
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:493:4: bitwiseOrExpression
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(493, 4);
-				PushFollow(Follow._bitwiseOrExpression_in_bitwiseNotExpression2381);
-				bitwiseOrExpression189=bitwiseOrExpression();
-				PopFollow();
-
-				adaptor.AddChild(root_0, bitwiseOrExpression189.Tree);
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("bitwiseNotExpression", 52);
-			LeaveRule("bitwiseNotExpression", 52);
-			LeaveRule_bitwiseNotExpression();
-		}
-		DebugLocation(494, 1);
-		} finally { DebugExitRule(GrammarFileName, "bitwiseNotExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "bitwiseNotExpression"
-
-	partial void EnterRule_bitwiseOrExpression();
-	partial void LeaveRule_bitwiseOrExpression();
-	// $ANTLR start "bitwiseOrExpression"
-	// Hql.g:496:1: bitwiseOrExpression : bitwiseXOrExpression ( BOR ^ bitwiseXOrExpression )* ;
-	[GrammarRule("bitwiseOrExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> bitwiseOrExpression()
-	{
-		EnterRule_bitwiseOrExpression();
-		EnterRule("bitwiseOrExpression", 53);
-		TraceIn("bitwiseOrExpression", 53);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken BOR191 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> bitwiseXOrExpression190 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> bitwiseXOrExpression192 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode BOR191_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "bitwiseOrExpression");
-		DebugLocation(496, 1);
-		try
-		{
-			// Hql.g:497:2: ( bitwiseXOrExpression ( BOR ^ bitwiseXOrExpression )* )
-			DebugEnterAlt(1);
-			// Hql.g:497:4: bitwiseXOrExpression ( BOR ^ bitwiseXOrExpression )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(497, 4);
-			PushFollow(Follow._bitwiseXOrExpression_in_bitwiseOrExpression2393);
-			bitwiseXOrExpression190=bitwiseXOrExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, bitwiseXOrExpression190.Tree);
-			DebugLocation(497, 25);
-			// Hql.g:497:25: ( BOR ^ bitwiseXOrExpression )*
-			try { DebugEnterSubRule(68);
-			while (true)
-			{
-				int alt68=2;
-				try { DebugEnterDecision(68, false);
-				int LA68_1 = input.LA(1);
-
-				if ((LA68_1==BOR))
-				{
-					alt68 = 1;
-				}
-
-
-				} finally { DebugExitDecision(68); }
-				switch ( alt68 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:497:26: BOR ^ bitwiseXOrExpression
-					{
-					DebugLocation(497, 29);
-					BOR191=(IToken)Match(input,BOR,Follow._BOR_in_bitwiseOrExpression2396); 
-					BOR191_tree = (IASTNode)adaptor.Create(BOR191);
-					root_0 = (IASTNode)adaptor.BecomeRoot(BOR191_tree, root_0);
-					DebugLocation(497, 31);
-					PushFollow(Follow._bitwiseXOrExpression_in_bitwiseOrExpression2399);
-					bitwiseXOrExpression192=bitwiseXOrExpression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, bitwiseXOrExpression192.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop68;
-				}
-			}
-
-			loop68:
-				;
-
-			} finally { DebugExitSubRule(68); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("bitwiseOrExpression", 53);
-			LeaveRule("bitwiseOrExpression", 53);
-			LeaveRule_bitwiseOrExpression();
-		}
-		DebugLocation(498, 1);
-		} finally { DebugExitRule(GrammarFileName, "bitwiseOrExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "bitwiseOrExpression"
-
-	partial void EnterRule_bitwiseXOrExpression();
-	partial void LeaveRule_bitwiseXOrExpression();
-	// $ANTLR start "bitwiseXOrExpression"
-	// Hql.g:500:1: bitwiseXOrExpression : bitwiseAndExpression ( BXOR ^ bitwiseAndExpression )* ;
-	[GrammarRule("bitwiseXOrExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> bitwiseXOrExpression()
-	{
-		EnterRule_bitwiseXOrExpression();
-		EnterRule("bitwiseXOrExpression", 54);
-		TraceIn("bitwiseXOrExpression", 54);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken BXOR194 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> bitwiseAndExpression193 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> bitwiseAndExpression195 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode BXOR194_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "bitwiseXOrExpression");
-		DebugLocation(500, 1);
-		try
-		{
-			// Hql.g:501:2: ( bitwiseAndExpression ( BXOR ^ bitwiseAndExpression )* )
-			DebugEnterAlt(1);
-			// Hql.g:501:4: bitwiseAndExpression ( BXOR ^ bitwiseAndExpression )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(501, 4);
-			PushFollow(Follow._bitwiseAndExpression_in_bitwiseXOrExpression2413);
-			bitwiseAndExpression193=bitwiseAndExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, bitwiseAndExpression193.Tree);
-			DebugLocation(501, 25);
-			// Hql.g:501:25: ( BXOR ^ bitwiseAndExpression )*
-			try { DebugEnterSubRule(69);
-			while (true)
-			{
-				int alt69=2;
-				try { DebugEnterDecision(69, false);
-				int LA69_1 = input.LA(1);
-
-				if ((LA69_1==BXOR))
-				{
-					alt69 = 1;
-				}
-
-
-				} finally { DebugExitDecision(69); }
-				switch ( alt69 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:501:26: BXOR ^ bitwiseAndExpression
-					{
-					DebugLocation(501, 30);
-					BXOR194=(IToken)Match(input,BXOR,Follow._BXOR_in_bitwiseXOrExpression2416); 
-					BXOR194_tree = (IASTNode)adaptor.Create(BXOR194);
-					root_0 = (IASTNode)adaptor.BecomeRoot(BXOR194_tree, root_0);
-					DebugLocation(501, 32);
-					PushFollow(Follow._bitwiseAndExpression_in_bitwiseXOrExpression2419);
-					bitwiseAndExpression195=bitwiseAndExpression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, bitwiseAndExpression195.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop69;
-				}
-			}
-
-			loop69:
-				;
-
-			} finally { DebugExitSubRule(69); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("bitwiseXOrExpression", 54);
-			LeaveRule("bitwiseXOrExpression", 54);
-			LeaveRule_bitwiseXOrExpression();
-		}
-		DebugLocation(502, 1);
-		} finally { DebugExitRule(GrammarFileName, "bitwiseXOrExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "bitwiseXOrExpression"
-
-	partial void EnterRule_bitwiseAndExpression();
-	partial void LeaveRule_bitwiseAndExpression();
-	// $ANTLR start "bitwiseAndExpression"
-	// Hql.g:504:1: bitwiseAndExpression : additiveExpression ( BAND ^ additiveExpression )* ;
-	[GrammarRule("bitwiseAndExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> bitwiseAndExpression()
-	{
-		EnterRule_bitwiseAndExpression();
-		EnterRule("bitwiseAndExpression", 55);
-		TraceIn("bitwiseAndExpression", 55);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken BAND197 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> additiveExpression196 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> additiveExpression198 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode BAND197_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "bitwiseAndExpression");
-		DebugLocation(504, 1);
-		try
-		{
-			// Hql.g:505:2: ( additiveExpression ( BAND ^ additiveExpression )* )
-			DebugEnterAlt(1);
-			// Hql.g:505:4: additiveExpression ( BAND ^ additiveExpression )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(505, 4);
-			PushFollow(Follow._additiveExpression_in_bitwiseAndExpression2433);
-			additiveExpression196=additiveExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, additiveExpression196.Tree);
-			DebugLocation(505, 23);
-			// Hql.g:505:23: ( BAND ^ additiveExpression )*
-			try { DebugEnterSubRule(70);
-			while (true)
-			{
-				int alt70=2;
-				try { DebugEnterDecision(70, false);
-				int LA70_1 = input.LA(1);
-
-				if ((LA70_1==BAND))
-				{
-					alt70 = 1;
-				}
-
-
-				} finally { DebugExitDecision(70); }
-				switch ( alt70 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:505:24: BAND ^ additiveExpression
-					{
-					DebugLocation(505, 28);
-					BAND197=(IToken)Match(input,BAND,Follow._BAND_in_bitwiseAndExpression2436); 
-					BAND197_tree = (IASTNode)adaptor.Create(BAND197);
-					root_0 = (IASTNode)adaptor.BecomeRoot(BAND197_tree, root_0);
-					DebugLocation(505, 30);
-					PushFollow(Follow._additiveExpression_in_bitwiseAndExpression2439);
-					additiveExpression198=additiveExpression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, additiveExpression198.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop70;
-				}
-			}
-
-			loop70:
-				;
-
-			} finally { DebugExitSubRule(70); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("bitwiseAndExpression", 55);
-			LeaveRule("bitwiseAndExpression", 55);
-			LeaveRule_bitwiseAndExpression();
-		}
-		DebugLocation(506, 1);
-		} finally { DebugExitRule(GrammarFileName, "bitwiseAndExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "bitwiseAndExpression"
-
-	partial void EnterRule_additiveExpression();
-	partial void LeaveRule_additiveExpression();
-	// $ANTLR start "additiveExpression"
-	// Hql.g:509:1: additiveExpression : multiplyExpression ( ( PLUS ^| MINUS ^) multiplyExpression )* ;
-	[GrammarRule("additiveExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> additiveExpression()
-	{
-		EnterRule_additiveExpression();
-		EnterRule("additiveExpression", 56);
-		TraceIn("additiveExpression", 56);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken PLUS200 = default(IToken);
-		IToken MINUS201 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> multiplyExpression199 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> multiplyExpression202 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode PLUS200_tree = default(IASTNode);
-		IASTNode MINUS201_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "additiveExpression");
-		DebugLocation(509, 1);
-		try
-		{
-			// Hql.g:510:2: ( multiplyExpression ( ( PLUS ^| MINUS ^) multiplyExpression )* )
-			DebugEnterAlt(1);
-			// Hql.g:510:4: multiplyExpression ( ( PLUS ^| MINUS ^) multiplyExpression )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(510, 4);
-			PushFollow(Follow._multiplyExpression_in_additiveExpression2453);
-			multiplyExpression199=multiplyExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, multiplyExpression199.Tree);
-			DebugLocation(510, 23);
-			// Hql.g:510:23: ( ( PLUS ^| MINUS ^) multiplyExpression )*
-			try { DebugEnterSubRule(72);
-			while (true)
-			{
-				int alt72=2;
-				try { DebugEnterDecision(72, false);
-				int LA72_1 = input.LA(1);
-
-				if ((LA72_1==MINUS||LA72_1==PLUS))
-				{
-					alt72 = 1;
-				}
-
-
-				} finally { DebugExitDecision(72); }
-				switch ( alt72 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:510:25: ( PLUS ^| MINUS ^) multiplyExpression
-					{
-					DebugLocation(510, 25);
-					// Hql.g:510:25: ( PLUS ^| MINUS ^)
-					int alt71=2;
-					try { DebugEnterSubRule(71);
-					try { DebugEnterDecision(71, false);
-					int LA71_1 = input.LA(1);
-
-					if ((LA71_1==PLUS))
-					{
-						alt71 = 1;
-					}
-					else if ((LA71_1==MINUS))
-					{
-						alt71 = 2;
-					}
-					else
-					{
-						NoViableAltException nvae = new NoViableAltException("", 71, 0, input, 1);
-						DebugRecognitionException(nvae);
-						throw nvae;
-					}
-					} finally { DebugExitDecision(71); }
-					switch (alt71)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:510:27: PLUS ^
-						{
-						DebugLocation(510, 31);
-						PLUS200=(IToken)Match(input,PLUS,Follow._PLUS_in_additiveExpression2459); 
-						PLUS200_tree = (IASTNode)adaptor.Create(PLUS200);
-						root_0 = (IASTNode)adaptor.BecomeRoot(PLUS200_tree, root_0);
-
-						}
-						break;
-					case 2:
-						DebugEnterAlt(2);
-						// Hql.g:510:35: MINUS ^
-						{
-						DebugLocation(510, 40);
-						MINUS201=(IToken)Match(input,MINUS,Follow._MINUS_in_additiveExpression2464); 
-						MINUS201_tree = (IASTNode)adaptor.Create(MINUS201);
-						root_0 = (IASTNode)adaptor.BecomeRoot(MINUS201_tree, root_0);
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(71); }
-
-					DebugLocation(510, 44);
-					PushFollow(Follow._multiplyExpression_in_additiveExpression2469);
-					multiplyExpression202=multiplyExpression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, multiplyExpression202.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop72;
-				}
-			}
-
-			loop72:
-				;
-
-			} finally { DebugExitSubRule(72); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("additiveExpression", 56);
-			LeaveRule("additiveExpression", 56);
-			LeaveRule_additiveExpression();
-		}
-		DebugLocation(511, 1);
-		} finally { DebugExitRule(GrammarFileName, "additiveExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "additiveExpression"
-
-	partial void EnterRule_multiplyExpression();
-	partial void LeaveRule_multiplyExpression();
-	// $ANTLR start "multiplyExpression"
-	// Hql.g:514:1: multiplyExpression : unaryExpression ( ( STAR ^| DIV ^) unaryExpression )* ;
-	[GrammarRule("multiplyExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> multiplyExpression()
-	{
-		EnterRule_multiplyExpression();
-		EnterRule("multiplyExpression", 57);
-		TraceIn("multiplyExpression", 57);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken STAR204 = default(IToken);
-		IToken DIV205 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> unaryExpression203 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> unaryExpression206 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode STAR204_tree = default(IASTNode);
-		IASTNode DIV205_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "multiplyExpression");
-		DebugLocation(514, 1);
-		try
-		{
-			// Hql.g:515:2: ( unaryExpression ( ( STAR ^| DIV ^) unaryExpression )* )
-			DebugEnterAlt(1);
-			// Hql.g:515:4: unaryExpression ( ( STAR ^| DIV ^) unaryExpression )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(515, 4);
-			PushFollow(Follow._unaryExpression_in_multiplyExpression2484);
-			unaryExpression203=unaryExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, unaryExpression203.Tree);
-			DebugLocation(515, 20);
-			// Hql.g:515:20: ( ( STAR ^| DIV ^) unaryExpression )*
-			try { DebugEnterSubRule(74);
-			while (true)
-			{
-				int alt74=2;
-				try { DebugEnterDecision(74, false);
-				int LA74_1 = input.LA(1);
-
-				if ((LA74_1==DIV||LA74_1==STAR))
-				{
-					alt74 = 1;
-				}
-
-
-				} finally { DebugExitDecision(74); }
-				switch ( alt74 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:515:22: ( STAR ^| DIV ^) unaryExpression
-					{
-					DebugLocation(515, 22);
-					// Hql.g:515:22: ( STAR ^| DIV ^)
-					int alt73=2;
-					try { DebugEnterSubRule(73);
-					try { DebugEnterDecision(73, false);
-					int LA73_1 = input.LA(1);
-
-					if ((LA73_1==STAR))
-					{
-						alt73 = 1;
-					}
-					else if ((LA73_1==DIV))
-					{
-						alt73 = 2;
-					}
-					else
-					{
-						NoViableAltException nvae = new NoViableAltException("", 73, 0, input, 1);
-						DebugRecognitionException(nvae);
-						throw nvae;
-					}
-					} finally { DebugExitDecision(73); }
-					switch (alt73)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:515:24: STAR ^
-						{
-						DebugLocation(515, 28);
-						STAR204=(IToken)Match(input,STAR,Follow._STAR_in_multiplyExpression2490); 
-						STAR204_tree = (IASTNode)adaptor.Create(STAR204);
-						root_0 = (IASTNode)adaptor.BecomeRoot(STAR204_tree, root_0);
-
-						}
-						break;
-					case 2:
-						DebugEnterAlt(2);
-						// Hql.g:515:32: DIV ^
-						{
-						DebugLocation(515, 35);
-						DIV205=(IToken)Match(input,DIV,Follow._DIV_in_multiplyExpression2495); 
-						DIV205_tree = (IASTNode)adaptor.Create(DIV205);
-						root_0 = (IASTNode)adaptor.BecomeRoot(DIV205_tree, root_0);
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(73); }
-
-					DebugLocation(515, 39);
-					PushFollow(Follow._unaryExpression_in_multiplyExpression2500);
-					unaryExpression206=unaryExpression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, unaryExpression206.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop74;
-				}
-			}
-
-			loop74:
-				;
-
-			} finally { DebugExitSubRule(74); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("multiplyExpression", 57);
-			LeaveRule("multiplyExpression", 57);
-			LeaveRule_multiplyExpression();
-		}
-		DebugLocation(516, 1);
-		} finally { DebugExitRule(GrammarFileName, "multiplyExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "multiplyExpression"
-
-	partial void EnterRule_unaryExpression();
-	partial void LeaveRule_unaryExpression();
-	// $ANTLR start "unaryExpression"
-	// Hql.g:519:1: unaryExpression : (m= MINUS mu= unaryExpression -> ^( UNARY_MINUS[$m] $mu) |p= PLUS pu= unaryExpression -> ^( UNARY_PLUS[$p] $pu) | caseExpression | quantifiedExpression | atom );
-	[GrammarRule("unaryExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> unaryExpression()
-	{
-		EnterRule_unaryExpression();
-		EnterRule("unaryExpression", 58);
-		TraceIn("unaryExpression", 58);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken m = default(IToken);
-		IToken p = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> mu = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> pu = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> caseExpression207 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> quantifiedExpression208 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> atom209 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode m_tree = default(IASTNode);
-		IASTNode p_tree = default(IASTNode);
-		RewriteRuleITokenStream stream_MINUS=new RewriteRuleITokenStream(adaptor,"token MINUS");
-		RewriteRuleITokenStream stream_PLUS=new RewriteRuleITokenStream(adaptor,"token PLUS");
-		RewriteRuleSubtreeStream stream_unaryExpression=new RewriteRuleSubtreeStream(adaptor,"rule unaryExpression");
-		try { DebugEnterRule(GrammarFileName, "unaryExpression");
-		DebugLocation(519, 1);
-		try
-		{
-			// Hql.g:520:2: (m= MINUS mu= unaryExpression -> ^( UNARY_MINUS[$m] $mu) |p= PLUS pu= unaryExpression -> ^( UNARY_PLUS[$p] $pu) | caseExpression | quantifiedExpression | atom )
-			int alt75=5;
-			try { DebugEnterDecision(75, false);
-			switch (input.LA(1))
-			{
-			case MINUS:
-				{
-				alt75 = 1;
-				}
-				break;
-			case PLUS:
-				{
-				alt75 = 2;
-				}
-				break;
-			case CASE:
-				{
-				alt75 = 3;
-				}
-				break;
-			case ALL:
-			case ANY:
-			case EXISTS:
-			case SOME:
-				{
-				alt75 = 4;
-				}
-				break;
-			case AVG:
-			case COLON:
-			case COUNT:
-			case ELEMENTS:
-			case EMPTY:
-			case FALSE:
-			case IDENT:
-			case INDICES:
-			case MAX:
-			case MIN:
-			case NULL:
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case OPEN:
-			case PARAM:
-			case QUOTED_String:
-			case SUM:
-			case TRUE:
-				{
-				alt75 = 5;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 75, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(75); }
-			switch (alt75)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:520:4: m= MINUS mu= unaryExpression
-				{
-				DebugLocation(520, 5);
-				m=(IToken)Match(input,MINUS,Follow._MINUS_in_unaryExpression2518);  
-				stream_MINUS.Add(m);
-
-				DebugLocation(520, 14);
-				PushFollow(Follow._unaryExpression_in_unaryExpression2522);
-				mu=unaryExpression();
-				PopFollow();
-
-				stream_unaryExpression.Add(mu.Tree);
-
-
-				{
-				// AST REWRITE
-				// elements: mu
-				// token labels: 
-				// rule labels: mu, retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_mu=new RewriteRuleSubtreeStream(adaptor,"rule mu",mu!=null?mu.Tree:null);
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 520:31: -> ^( UNARY_MINUS[$m] $mu)
-				{
-					DebugLocation(520, 34);
-					// Hql.g:520:34: ^( UNARY_MINUS[$m] $mu)
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(520, 36);
-					root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(UNARY_MINUS, m), root_1);
-
-					DebugLocation(520, 53);
-					adaptor.AddChild(root_1, stream_mu.NextTree());
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:521:4: p= PLUS pu= unaryExpression
-				{
-				DebugLocation(521, 5);
-				p=(IToken)Match(input,PLUS,Follow._PLUS_in_unaryExpression2539);  
-				stream_PLUS.Add(p);
-
-				DebugLocation(521, 13);
-				PushFollow(Follow._unaryExpression_in_unaryExpression2543);
-				pu=unaryExpression();
-				PopFollow();
-
-				stream_unaryExpression.Add(pu.Tree);
-
-
-				{
-				// AST REWRITE
-				// elements: pu
-				// token labels: 
-				// rule labels: pu, retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_pu=new RewriteRuleSubtreeStream(adaptor,"rule pu",pu!=null?pu.Tree:null);
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 521:30: -> ^( UNARY_PLUS[$p] $pu)
-				{
-					DebugLocation(521, 33);
-					// Hql.g:521:33: ^( UNARY_PLUS[$p] $pu)
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(521, 35);
-					root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(UNARY_PLUS, p), root_1);
-
-					DebugLocation(521, 51);
-					adaptor.AddChild(root_1, stream_pu.NextTree());
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// Hql.g:522:4: caseExpression
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(522, 4);
-				PushFollow(Follow._caseExpression_in_unaryExpression2558);
-				caseExpression207=caseExpression();
-				PopFollow();
-
-				adaptor.AddChild(root_0, caseExpression207.Tree);
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// Hql.g:523:4: quantifiedExpression
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(523, 4);
-				PushFollow(Follow._quantifiedExpression_in_unaryExpression2563);
-				quantifiedExpression208=quantifiedExpression();
-				PopFollow();
-
-				adaptor.AddChild(root_0, quantifiedExpression208.Tree);
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// Hql.g:524:4: atom
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(524, 4);
-				PushFollow(Follow._atom_in_unaryExpression2568);
-				atom209=atom();
-				PopFollow();
-
-				adaptor.AddChild(root_0, atom209.Tree);
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("unaryExpression", 58);
-			LeaveRule("unaryExpression", 58);
-			LeaveRule_unaryExpression();
-		}
-		DebugLocation(525, 1);
-		} finally { DebugExitRule(GrammarFileName, "unaryExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "unaryExpression"
-
-	partial void EnterRule_caseExpression();
-	partial void LeaveRule_caseExpression();
-	// $ANTLR start "caseExpression"
-	// Hql.g:527:1: caseExpression : ( CASE ( whenClause )+ ( elseClause )? END -> ^( CASE ( whenClause )+ ( elseClause )? ) | CASE unaryExpression ( altWhenClause )+ ( elseClause )? END -> ^( CASE2 unaryExpression ( altWhenClause )+ ( elseClause )? ) );
-	[GrammarRule("caseExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> caseExpression()
-	{
-		EnterRule_caseExpression();
-		EnterRule("caseExpression", 59);
-		TraceIn("caseExpression", 59);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken CASE210 = default(IToken);
-		IToken END213 = default(IToken);
-		IToken CASE214 = default(IToken);
-		IToken END218 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> whenClause211 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> elseClause212 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> unaryExpression215 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> altWhenClause216 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> elseClause217 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode CASE210_tree = default(IASTNode);
-		IASTNode END213_tree = default(IASTNode);
-		IASTNode CASE214_tree = default(IASTNode);
-		IASTNode END218_tree = default(IASTNode);
-		RewriteRuleITokenStream stream_CASE=new RewriteRuleITokenStream(adaptor,"token CASE");
-		RewriteRuleITokenStream stream_END=new RewriteRuleITokenStream(adaptor,"token END");
-		RewriteRuleSubtreeStream stream_whenClause=new RewriteRuleSubtreeStream(adaptor,"rule whenClause");
-		RewriteRuleSubtreeStream stream_elseClause=new RewriteRuleSubtreeStream(adaptor,"rule elseClause");
-		RewriteRuleSubtreeStream stream_unaryExpression=new RewriteRuleSubtreeStream(adaptor,"rule unaryExpression");
-		RewriteRuleSubtreeStream stream_altWhenClause=new RewriteRuleSubtreeStream(adaptor,"rule altWhenClause");
-		try { DebugEnterRule(GrammarFileName, "caseExpression");
-		DebugLocation(527, 1);
-		try
-		{
-			// Hql.g:528:2: ( CASE ( whenClause )+ ( elseClause )? END -> ^( CASE ( whenClause )+ ( elseClause )? ) | CASE unaryExpression ( altWhenClause )+ ( elseClause )? END -> ^( CASE2 unaryExpression ( altWhenClause )+ ( elseClause )? ) )
-			int alt80=2;
-			try { DebugEnterDecision(80, false);
-			int LA80_1 = input.LA(1);
-
-			if ((LA80_1==CASE))
-			{
-				int LA80_2 = input.LA(2);
-
-				if ((LA80_2==WHEN))
-				{
-					alt80 = 1;
-				}
-				else if ((LA80_2==ALL||LA80_2==ANY||LA80_2==AVG||LA80_2==CASE||LA80_2==COLON||LA80_2==COUNT||LA80_2==ELEMENTS||LA80_2==EMPTY||LA80_2==EXISTS||LA80_2==FALSE||LA80_2==IDENT||LA80_2==INDICES||LA80_2==MAX||(LA80_2>=MIN && LA80_2<=MINUS)||(LA80_2>=NULL && LA80_2<=NUM_LONG)||LA80_2==OPEN||(LA80_2>=PARAM && LA80_2<=PLUS)||LA80_2==QUOTED_String||LA80_2==SOME||LA80_2==SUM||LA80_2==TRUE))
-				{
-					alt80 = 2;
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 80, 1, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 80, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(80); }
-			switch (alt80)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:528:4: CASE ( whenClause )+ ( elseClause )? END
-				{
-				DebugLocation(528, 4);
-				CASE210=(IToken)Match(input,CASE,Follow._CASE_in_caseExpression2580);  
-				stream_CASE.Add(CASE210);
-
-				DebugLocation(528, 9);
-				// Hql.g:528:9: ( whenClause )+
-				int cnt76=0;
-				try { DebugEnterSubRule(76);
-				while (true)
-				{
-					int alt76=2;
-					try { DebugEnterDecision(76, false);
-					int LA76_1 = input.LA(1);
-
-					if ((LA76_1==WHEN))
-					{
-						alt76 = 1;
-					}
-
-
-					} finally { DebugExitDecision(76); }
-					switch (alt76)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:528:10: whenClause
-						{
-						DebugLocation(528, 10);
-						PushFollow(Follow._whenClause_in_caseExpression2583);
-						whenClause211=whenClause();
-						PopFollow();
-
-						stream_whenClause.Add(whenClause211.Tree);
-
-						}
-						break;
-
-					default:
-						if (cnt76 >= 1)
-							goto loop76;
-
-						EarlyExitException eee76 = new EarlyExitException( 76, input );
-						DebugRecognitionException(eee76);
-						throw eee76;
-					}
-					cnt76++;
-				}
-				loop76:
-					;
-
-				} finally { DebugExitSubRule(76); }
-
-				DebugLocation(528, 23);
-				// Hql.g:528:23: ( elseClause )?
-				int alt77=2;
-				try { DebugEnterSubRule(77);
-				try { DebugEnterDecision(77, false);
-				int LA77_1 = input.LA(1);
-
-				if ((LA77_1==ELSE))
-				{
-					alt77 = 1;
-				}
-				} finally { DebugExitDecision(77); }
-				switch (alt77)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:528:24: elseClause
-					{
-					DebugLocation(528, 24);
-					PushFollow(Follow._elseClause_in_caseExpression2588);
-					elseClause212=elseClause();
-					PopFollow();
-
-					stream_elseClause.Add(elseClause212.Tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(77); }
-
-				DebugLocation(528, 37);
-				END213=(IToken)Match(input,END,Follow._END_in_caseExpression2592);  
-				stream_END.Add(END213);
-
-
-
-				{
-				// AST REWRITE
-				// elements: CASE, whenClause, elseClause
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 529:3: -> ^( CASE ( whenClause )+ ( elseClause )? )
-				{
-					DebugLocation(529, 6);
-					// Hql.g:529:6: ^( CASE ( whenClause )+ ( elseClause )? )
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(529, 8);
-					root_1 = (IASTNode)adaptor.BecomeRoot(stream_CASE.NextNode(), root_1);
-
-					DebugLocation(529, 13);
-					if (!(stream_whenClause.HasNext))
-					{
-						throw new RewriteEarlyExitException();
-					}
-					while ( stream_whenClause.HasNext )
-					{
-						DebugLocation(529, 13);
-						adaptor.AddChild(root_1, stream_whenClause.NextTree());
-
-					}
-					stream_whenClause.Reset();
-					DebugLocation(529, 25);
-					// Hql.g:529:25: ( elseClause )?
-					if (stream_elseClause.HasNext)
-					{
-						DebugLocation(529, 25);
-						adaptor.AddChild(root_1, stream_elseClause.NextTree());
-
-					}
-					stream_elseClause.Reset();
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:530:4: CASE unaryExpression ( altWhenClause )+ ( elseClause )? END
-				{
-				DebugLocation(530, 4);
-				CASE214=(IToken)Match(input,CASE,Follow._CASE_in_caseExpression2612);  
-				stream_CASE.Add(CASE214);
-
-				DebugLocation(530, 9);
-				PushFollow(Follow._unaryExpression_in_caseExpression2614);
-				unaryExpression215=unaryExpression();
-				PopFollow();
-
-				stream_unaryExpression.Add(unaryExpression215.Tree);
-				DebugLocation(530, 25);
-				// Hql.g:530:25: ( altWhenClause )+
-				int cnt78=0;
-				try { DebugEnterSubRule(78);
-				while (true)
-				{
-					int alt78=2;
-					try { DebugEnterDecision(78, false);
-					int LA78_1 = input.LA(1);
-
-					if ((LA78_1==WHEN))
-					{
-						alt78 = 1;
-					}
-
-
-					} finally { DebugExitDecision(78); }
-					switch (alt78)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:530:26: altWhenClause
-						{
-						DebugLocation(530, 26);
-						PushFollow(Follow._altWhenClause_in_caseExpression2617);
-						altWhenClause216=altWhenClause();
-						PopFollow();
-
-						stream_altWhenClause.Add(altWhenClause216.Tree);
-
-						}
-						break;
-
-					default:
-						if (cnt78 >= 1)
-							goto loop78;
-
-						EarlyExitException eee78 = new EarlyExitException( 78, input );
-						DebugRecognitionException(eee78);
-						throw eee78;
-					}
-					cnt78++;
-				}
-				loop78:
-					;
-
-				} finally { DebugExitSubRule(78); }
-
-				DebugLocation(530, 42);
-				// Hql.g:530:42: ( elseClause )?
-				int alt79=2;
-				try { DebugEnterSubRule(79);
-				try { DebugEnterDecision(79, false);
-				int LA79_1 = input.LA(1);
-
-				if ((LA79_1==ELSE))
-				{
-					alt79 = 1;
-				}
-				} finally { DebugExitDecision(79); }
-				switch (alt79)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:530:43: elseClause
-					{
-					DebugLocation(530, 43);
-					PushFollow(Follow._elseClause_in_caseExpression2622);
-					elseClause217=elseClause();
-					PopFollow();
-
-					stream_elseClause.Add(elseClause217.Tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(79); }
-
-				DebugLocation(530, 56);
-				END218=(IToken)Match(input,END,Follow._END_in_caseExpression2626);  
-				stream_END.Add(END218);
-
-
-
-				{
-				// AST REWRITE
-				// elements: unaryExpression, altWhenClause, elseClause
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 531:3: -> ^( CASE2 unaryExpression ( altWhenClause )+ ( elseClause )? )
-				{
-					DebugLocation(531, 6);
-					// Hql.g:531:6: ^( CASE2 unaryExpression ( altWhenClause )+ ( elseClause )? )
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(531, 8);
-					root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(CASE2, "CASE2"), root_1);
-
-					DebugLocation(531, 14);
-					adaptor.AddChild(root_1, stream_unaryExpression.NextTree());
-					DebugLocation(531, 30);
-					if (!(stream_altWhenClause.HasNext))
-					{
-						throw new RewriteEarlyExitException();
-					}
-					while ( stream_altWhenClause.HasNext )
-					{
-						DebugLocation(531, 30);
-						adaptor.AddChild(root_1, stream_altWhenClause.NextTree());
-
-					}
-					stream_altWhenClause.Reset();
-					DebugLocation(531, 45);
-					// Hql.g:531:45: ( elseClause )?
-					if (stream_elseClause.HasNext)
-					{
-						DebugLocation(531, 45);
-						adaptor.AddChild(root_1, stream_elseClause.NextTree());
-
-					}
-					stream_elseClause.Reset();
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("caseExpression", 59);
-			LeaveRule("caseExpression", 59);
-			LeaveRule_caseExpression();
-		}
-		DebugLocation(532, 1);
-		} finally { DebugExitRule(GrammarFileName, "caseExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "caseExpression"
-
-	partial void EnterRule_whenClause();
-	partial void LeaveRule_whenClause();
-	// $ANTLR start "whenClause"
-	// Hql.g:534:1: whenClause : ( WHEN ^ logicalExpression THEN ! expression ) ;
-	[GrammarRule("whenClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> whenClause()
-	{
-		EnterRule_whenClause();
-		EnterRule("whenClause", 60);
-		TraceIn("whenClause", 60);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken WHEN219 = default(IToken);
-		IToken THEN221 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> logicalExpression220 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> expression222 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode WHEN219_tree = default(IASTNode);
-		IASTNode THEN221_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "whenClause");
-		DebugLocation(534, 1);
-		try
-		{
-			// Hql.g:535:2: ( ( WHEN ^ logicalExpression THEN ! expression ) )
-			DebugEnterAlt(1);
-			// Hql.g:535:4: ( WHEN ^ logicalExpression THEN ! expression )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(535, 4);
-			// Hql.g:535:4: ( WHEN ^ logicalExpression THEN ! expression )
-			DebugEnterAlt(1);
-			// Hql.g:535:5: WHEN ^ logicalExpression THEN ! expression
-			{
-			DebugLocation(535, 9);
-			WHEN219=(IToken)Match(input,WHEN,Follow._WHEN_in_whenClause2655); 
-			WHEN219_tree = (IASTNode)adaptor.Create(WHEN219);
-			root_0 = (IASTNode)adaptor.BecomeRoot(WHEN219_tree, root_0);
-			DebugLocation(535, 11);
-			PushFollow(Follow._logicalExpression_in_whenClause2658);
-			logicalExpression220=logicalExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, logicalExpression220.Tree);
-			DebugLocation(535, 33);
-			THEN221=(IToken)Match(input,THEN,Follow._THEN_in_whenClause2660); 
-			DebugLocation(535, 35);
-			PushFollow(Follow._expression_in_whenClause2663);
-			expression222=expression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, expression222.Tree);
-
-			}
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("whenClause", 60);
-			LeaveRule("whenClause", 60);
-			LeaveRule_whenClause();
-		}
-		DebugLocation(536, 1);
-		} finally { DebugExitRule(GrammarFileName, "whenClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "whenClause"
-
-	partial void EnterRule_altWhenClause();
-	partial void LeaveRule_altWhenClause();
-	// $ANTLR start "altWhenClause"
-	// Hql.g:538:1: altWhenClause : ( WHEN ^ unaryExpression THEN ! expression ) ;
-	[GrammarRule("altWhenClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> altWhenClause()
-	{
-		EnterRule_altWhenClause();
-		EnterRule("altWhenClause", 61);
-		TraceIn("altWhenClause", 61);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken WHEN223 = default(IToken);
-		IToken THEN225 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> unaryExpression224 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> expression226 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode WHEN223_tree = default(IASTNode);
-		IASTNode THEN225_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "altWhenClause");
-		DebugLocation(538, 1);
-		try
-		{
-			// Hql.g:539:2: ( ( WHEN ^ unaryExpression THEN ! expression ) )
-			DebugEnterAlt(1);
-			// Hql.g:539:4: ( WHEN ^ unaryExpression THEN ! expression )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(539, 4);
-			// Hql.g:539:4: ( WHEN ^ unaryExpression THEN ! expression )
-			DebugEnterAlt(1);
-			// Hql.g:539:5: WHEN ^ unaryExpression THEN ! expression
-			{
-			DebugLocation(539, 9);
-			WHEN223=(IToken)Match(input,WHEN,Follow._WHEN_in_altWhenClause2677); 
-			WHEN223_tree = (IASTNode)adaptor.Create(WHEN223);
-			root_0 = (IASTNode)adaptor.BecomeRoot(WHEN223_tree, root_0);
-			DebugLocation(539, 11);
-			PushFollow(Follow._unaryExpression_in_altWhenClause2680);
-			unaryExpression224=unaryExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, unaryExpression224.Tree);
-			DebugLocation(539, 31);
-			THEN225=(IToken)Match(input,THEN,Follow._THEN_in_altWhenClause2682); 
-			DebugLocation(539, 33);
-			PushFollow(Follow._expression_in_altWhenClause2685);
-			expression226=expression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, expression226.Tree);
-
-			}
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("altWhenClause", 61);
-			LeaveRule("altWhenClause", 61);
-			LeaveRule_altWhenClause();
-		}
-		DebugLocation(540, 1);
-		} finally { DebugExitRule(GrammarFileName, "altWhenClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "altWhenClause"
-
-	partial void EnterRule_elseClause();
-	partial void LeaveRule_elseClause();
-	// $ANTLR start "elseClause"
-	// Hql.g:542:1: elseClause : ( ELSE ^ expression ) ;
-	[GrammarRule("elseClause")]
-	private AstParserRuleReturnScope<IASTNode, IToken> elseClause()
-	{
-		EnterRule_elseClause();
-		EnterRule("elseClause", 62);
-		TraceIn("elseClause", 62);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken ELSE227 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> expression228 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode ELSE227_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "elseClause");
-		DebugLocation(542, 1);
-		try
-		{
-			// Hql.g:543:2: ( ( ELSE ^ expression ) )
-			DebugEnterAlt(1);
-			// Hql.g:543:4: ( ELSE ^ expression )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(543, 4);
-			// Hql.g:543:4: ( ELSE ^ expression )
-			DebugEnterAlt(1);
-			// Hql.g:543:5: ELSE ^ expression
-			{
-			DebugLocation(543, 9);
-			ELSE227=(IToken)Match(input,ELSE,Follow._ELSE_in_elseClause2699); 
-			ELSE227_tree = (IASTNode)adaptor.Create(ELSE227);
-			root_0 = (IASTNode)adaptor.BecomeRoot(ELSE227_tree, root_0);
-			DebugLocation(543, 11);
-			PushFollow(Follow._expression_in_elseClause2702);
-			expression228=expression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, expression228.Tree);
-
-			}
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("elseClause", 62);
-			LeaveRule("elseClause", 62);
-			LeaveRule_elseClause();
-		}
-		DebugLocation(544, 1);
-		} finally { DebugExitRule(GrammarFileName, "elseClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "elseClause"
-
-	partial void EnterRule_quantifiedExpression();
-	partial void LeaveRule_quantifiedExpression();
-	// $ANTLR start "quantifiedExpression"
-	// Hql.g:546:1: quantifiedExpression : ( SOME ^| EXISTS ^| ALL ^| ANY ^) ( identifier | collectionExpr | ( OPEN ! ( subQuery ) CLOSE !) ) ;
-	[GrammarRule("quantifiedExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> quantifiedExpression()
-	{
-		EnterRule_quantifiedExpression();
-		EnterRule("quantifiedExpression", 63);
-		TraceIn("quantifiedExpression", 63);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken SOME229 = default(IToken);
-		IToken EXISTS230 = default(IToken);
-		IToken ALL231 = default(IToken);
-		IToken ANY232 = default(IToken);
-		IToken OPEN235 = default(IToken);
-		IToken CLOSE237 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> identifier233 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> collectionExpr234 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> subQuery236 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode SOME229_tree = default(IASTNode);
-		IASTNode EXISTS230_tree = default(IASTNode);
-		IASTNode ALL231_tree = default(IASTNode);
-		IASTNode ANY232_tree = default(IASTNode);
-		IASTNode OPEN235_tree = default(IASTNode);
-		IASTNode CLOSE237_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "quantifiedExpression");
-		DebugLocation(546, 1);
-		try
-		{
-			// Hql.g:547:2: ( ( SOME ^| EXISTS ^| ALL ^| ANY ^) ( identifier | collectionExpr | ( OPEN ! ( subQuery ) CLOSE !) ) )
-			DebugEnterAlt(1);
-			// Hql.g:547:4: ( SOME ^| EXISTS ^| ALL ^| ANY ^) ( identifier | collectionExpr | ( OPEN ! ( subQuery ) CLOSE !) )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(547, 4);
-			// Hql.g:547:4: ( SOME ^| EXISTS ^| ALL ^| ANY ^)
-			int alt81=4;
-			try { DebugEnterSubRule(81);
-			try { DebugEnterDecision(81, false);
-			switch (input.LA(1))
-			{
-			case SOME:
-				{
-				alt81 = 1;
-				}
-				break;
-			case EXISTS:
-				{
-				alt81 = 2;
-				}
-				break;
-			case ALL:
-				{
-				alt81 = 3;
-				}
-				break;
-			case ANY:
-				{
-				alt81 = 4;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 81, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(81); }
-			switch (alt81)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:547:6: SOME ^
-				{
-				DebugLocation(547, 10);
-				SOME229=(IToken)Match(input,SOME,Follow._SOME_in_quantifiedExpression2717); 
-				SOME229_tree = (IASTNode)adaptor.Create(SOME229);
-				root_0 = (IASTNode)adaptor.BecomeRoot(SOME229_tree, root_0);
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:547:14: EXISTS ^
-				{
-				DebugLocation(547, 20);
-				EXISTS230=(IToken)Match(input,EXISTS,Follow._EXISTS_in_quantifiedExpression2722); 
-				EXISTS230_tree = (IASTNode)adaptor.Create(EXISTS230);
-				root_0 = (IASTNode)adaptor.BecomeRoot(EXISTS230_tree, root_0);
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// Hql.g:547:24: ALL ^
-				{
-				DebugLocation(547, 27);
-				ALL231=(IToken)Match(input,ALL,Follow._ALL_in_quantifiedExpression2727); 
-				ALL231_tree = (IASTNode)adaptor.Create(ALL231);
-				root_0 = (IASTNode)adaptor.BecomeRoot(ALL231_tree, root_0);
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// Hql.g:547:31: ANY ^
-				{
-				DebugLocation(547, 34);
-				ANY232=(IToken)Match(input,ANY,Follow._ANY_in_quantifiedExpression2732); 
-				ANY232_tree = (IASTNode)adaptor.Create(ANY232);
-				root_0 = (IASTNode)adaptor.BecomeRoot(ANY232_tree, root_0);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(81); }
-
-			DebugLocation(548, 2);
-			// Hql.g:548:2: ( identifier | collectionExpr | ( OPEN ! ( subQuery ) CLOSE !) )
-			int alt82=3;
-			try { DebugEnterSubRule(82);
-			try { DebugEnterDecision(82, false);
-			switch (input.LA(1))
-			{
-			case IDENT:
-				{
-				alt82 = 1;
-				}
-				break;
-			case ELEMENTS:
-			case INDICES:
-				{
-				alt82 = 2;
-				}
-				break;
-			case OPEN:
-				{
-				alt82 = 3;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 82, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(82); }
-			switch (alt82)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:548:4: identifier
-				{
-				DebugLocation(548, 4);
-				PushFollow(Follow._identifier_in_quantifiedExpression2741);
-				identifier233=identifier();
-				PopFollow();
-
-				adaptor.AddChild(root_0, identifier233.Tree);
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:548:17: collectionExpr
-				{
-				DebugLocation(548, 17);
-				PushFollow(Follow._collectionExpr_in_quantifiedExpression2745);
-				collectionExpr234=collectionExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_0, collectionExpr234.Tree);
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// Hql.g:548:34: ( OPEN ! ( subQuery ) CLOSE !)
-				{
-				DebugLocation(548, 34);
-				// Hql.g:548:34: ( OPEN ! ( subQuery ) CLOSE !)
-				DebugEnterAlt(1);
-				// Hql.g:548:35: OPEN ! ( subQuery ) CLOSE !
-				{
-				DebugLocation(548, 39);
-				OPEN235=(IToken)Match(input,OPEN,Follow._OPEN_in_quantifiedExpression2750); 
-				DebugLocation(548, 41);
-				// Hql.g:548:41: ( subQuery )
-				DebugEnterAlt(1);
-				// Hql.g:548:43: subQuery
-				{
-				DebugLocation(548, 43);
-				PushFollow(Follow._subQuery_in_quantifiedExpression2755);
-				subQuery236=subQuery();
-				PopFollow();
-
-				adaptor.AddChild(root_0, subQuery236.Tree);
-
-				}
-
-				DebugLocation(548, 59);
-				CLOSE237=(IToken)Match(input,CLOSE,Follow._CLOSE_in_quantifiedExpression2759); 
-
-				}
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(82); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("quantifiedExpression", 63);
-			LeaveRule("quantifiedExpression", 63);
-			LeaveRule_quantifiedExpression();
-		}
-		DebugLocation(549, 1);
-		} finally { DebugExitRule(GrammarFileName, "quantifiedExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "quantifiedExpression"
-
-	partial void EnterRule_atom();
-	partial void LeaveRule_atom();
-	// $ANTLR start "atom"
-	// Hql.g:554:1: atom : primaryExpression ( DOT ^ identifier ( options {greedy=true; } : (op= OPEN ^ exprList CLOSE !) )? |lb= OPEN_BRACKET ^ expression CLOSE_BRACKET !)* ;
-	[GrammarRule("atom")]
-	private AstParserRuleReturnScope<IASTNode, IToken> atom()
-	{
-		EnterRule_atom();
-		EnterRule("atom", 64);
-		TraceIn("atom", 64);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken op = default(IToken);
-		IToken lb = default(IToken);
-		IToken DOT239 = default(IToken);
-		IToken CLOSE242 = default(IToken);
-		IToken CLOSE_BRACKET244 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> primaryExpression238 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> identifier240 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> exprList241 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> expression243 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode op_tree = default(IASTNode);
-		IASTNode lb_tree = default(IASTNode);
-		IASTNode DOT239_tree = default(IASTNode);
-		IASTNode CLOSE242_tree = default(IASTNode);
-		IASTNode CLOSE_BRACKET244_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "atom");
-		DebugLocation(554, 1);
-		try
-		{
-			// Hql.g:555:3: ( primaryExpression ( DOT ^ identifier ( options {greedy=true; } : (op= OPEN ^ exprList CLOSE !) )? |lb= OPEN_BRACKET ^ expression CLOSE_BRACKET !)* )
-			DebugEnterAlt(1);
-			// Hql.g:555:5: primaryExpression ( DOT ^ identifier ( options {greedy=true; } : (op= OPEN ^ exprList CLOSE !) )? |lb= OPEN_BRACKET ^ expression CLOSE_BRACKET !)*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(555, 5);
-			PushFollow(Follow._primaryExpression_in_atom2778);
-			primaryExpression238=primaryExpression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, primaryExpression238.Tree);
-			DebugLocation(556, 3);
-			// Hql.g:556:3: ( DOT ^ identifier ( options {greedy=true; } : (op= OPEN ^ exprList CLOSE !) )? |lb= OPEN_BRACKET ^ expression CLOSE_BRACKET !)*
-			try { DebugEnterSubRule(84);
-			while (true)
-			{
-				int alt84=3;
-				try { DebugEnterDecision(84, false);
-				int LA84_1 = input.LA(1);
-
-				if ((LA84_1==DOT))
-				{
-					alt84 = 1;
-				}
-				else if ((LA84_1==OPEN_BRACKET))
-				{
-					alt84 = 2;
-				}
-
-
-				} finally { DebugExitDecision(84); }
-				switch ( alt84 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:557:4: DOT ^ identifier ( options {greedy=true; } : (op= OPEN ^ exprList CLOSE !) )?
-					{
-					DebugLocation(557, 7);
-					DOT239=(IToken)Match(input,DOT,Follow._DOT_in_atom2787); 
-					DOT239_tree = (IASTNode)adaptor.Create(DOT239);
-					root_0 = (IASTNode)adaptor.BecomeRoot(DOT239_tree, root_0);
-					DebugLocation(557, 9);
-					PushFollow(Follow._identifier_in_atom2790);
-					identifier240=identifier();
-					PopFollow();
-
-					adaptor.AddChild(root_0, identifier240.Tree);
-					DebugLocation(558, 5);
-					// Hql.g:558:5: ( options {greedy=true; } : (op= OPEN ^ exprList CLOSE !) )?
-					int alt83=2;
-					try { DebugEnterSubRule(83);
-					try { DebugEnterDecision(83, false);
-					int LA83_1 = input.LA(1);
-
-					if ((LA83_1==OPEN))
-					{
-						alt83 = 1;
-					}
-					} finally { DebugExitDecision(83); }
-					switch (alt83)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:559:6: (op= OPEN ^ exprList CLOSE !)
-						{
-						DebugLocation(559, 6);
-						// Hql.g:559:6: (op= OPEN ^ exprList CLOSE !)
-						DebugEnterAlt(1);
-						// Hql.g:559:8: op= OPEN ^ exprList CLOSE !
-						{
-						DebugLocation(559, 10);
-						op=(IToken)Match(input,OPEN,Follow._OPEN_in_atom2818); 
-						op_tree = (IASTNode)adaptor.Create(op);
-						root_0 = (IASTNode)adaptor.BecomeRoot(op_tree, root_0);
-						DebugLocation(559, 17);
-						op.Type = METHOD_CALL; 
-						DebugLocation(559, 44);
-						PushFollow(Follow._exprList_in_atom2823);
-						exprList241=exprList();
-						PopFollow();
-
-						adaptor.AddChild(root_0, exprList241.Tree);
-						DebugLocation(559, 58);
-						CLOSE242=(IToken)Match(input,CLOSE,Follow._CLOSE_in_atom2825); 
-
-						}
-
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(83); }
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:560:5: lb= OPEN_BRACKET ^ expression CLOSE_BRACKET !
-					{
-					DebugLocation(560, 7);
-					lb=(IToken)Match(input,OPEN_BRACKET,Follow._OPEN_BRACKET_in_atom2839); 
-					lb_tree = (IASTNode)adaptor.Create(lb);
-					root_0 = (IASTNode)adaptor.BecomeRoot(lb_tree, root_0);
-					DebugLocation(560, 22);
-					lb.Type = INDEX_OP; 
-					DebugLocation(560, 46);
-					PushFollow(Follow._expression_in_atom2844);
-					expression243=expression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, expression243.Tree);
-					DebugLocation(560, 70);
-					CLOSE_BRACKET244=(IToken)Match(input,CLOSE_BRACKET,Follow._CLOSE_BRACKET_in_atom2846); 
-
-					}
-					break;
-
-				default:
-					goto loop84;
-				}
-			}
-
-			loop84:
-				;
-
-			} finally { DebugExitSubRule(84); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("atom", 64);
-			LeaveRule("atom", 64);
-			LeaveRule_atom();
-		}
-		DebugLocation(562, 1);
-		} finally { DebugExitRule(GrammarFileName, "atom"); }
-		return retval;
-
-	}
-	// $ANTLR end "atom"
-
-	partial void EnterRule_primaryExpression();
-	partial void LeaveRule_primaryExpression();
-	// $ANTLR start "primaryExpression"
-	// Hql.g:565:1: primaryExpression : ( identPrimary ( options {greedy=true; } : DOT ^ 'class' )? | constant | COLON ^ identifier | OPEN ! ( expressionOrVector | subQuery ) CLOSE !| PARAM ^ ( NUM_INT )? );
-	[GrammarRule("primaryExpression")]
-	private AstParserRuleReturnScope<IASTNode, IToken> primaryExpression()
-	{
-		EnterRule_primaryExpression();
-		EnterRule("primaryExpression", 65);
-		TraceIn("primaryExpression", 65);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken DOT246 = default(IToken);
-		IToken string_literal247 = default(IToken);
-		IToken COLON249 = default(IToken);
-		IToken OPEN251 = default(IToken);
-		IToken CLOSE254 = default(IToken);
-		IToken PARAM255 = default(IToken);
-		IToken NUM_INT256 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> identPrimary245 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> constant248 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> identifier250 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> expressionOrVector252 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> subQuery253 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode DOT246_tree = default(IASTNode);
-		IASTNode string_literal247_tree = default(IASTNode);
-		IASTNode COLON249_tree = default(IASTNode);
-		IASTNode OPEN251_tree = default(IASTNode);
-		IASTNode CLOSE254_tree = default(IASTNode);
-		IASTNode PARAM255_tree = default(IASTNode);
-		IASTNode NUM_INT256_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "primaryExpression");
-		DebugLocation(565, 1);
-		try
-		{
-			// Hql.g:566:2: ( identPrimary ( options {greedy=true; } : DOT ^ 'class' )? | constant | COLON ^ identifier | OPEN ! ( expressionOrVector | subQuery ) CLOSE !| PARAM ^ ( NUM_INT )? )
-			int alt88=5;
-			try { DebugEnterDecision(88, false);
-			switch (input.LA(1))
-			{
-			case AVG:
-			case COUNT:
-			case ELEMENTS:
-			case IDENT:
-			case INDICES:
-			case MAX:
-			case MIN:
-			case SUM:
-				{
-				alt88 = 1;
-				}
-				break;
-			case EMPTY:
-			case FALSE:
-			case NULL:
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case QUOTED_String:
-			case TRUE:
-				{
-				alt88 = 2;
-				}
-				break;
-			case COLON:
-				{
-				alt88 = 3;
-				}
-				break;
-			case OPEN:
-				{
-				alt88 = 4;
-				}
-				break;
-			case PARAM:
-				{
-				alt88 = 5;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 88, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(88); }
-			switch (alt88)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:566:6: identPrimary ( options {greedy=true; } : DOT ^ 'class' )?
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(566, 6);
-				PushFollow(Follow._identPrimary_in_primaryExpression2866);
-				identPrimary245=identPrimary();
-				PopFollow();
-
-				adaptor.AddChild(root_0, identPrimary245.Tree);
-				DebugLocation(566, 19);
-				// Hql.g:566:19: ( options {greedy=true; } : DOT ^ 'class' )?
-				int alt85=2;
-				try { DebugEnterSubRule(85);
-				try { DebugEnterDecision(85, false);
-				int LA85_1 = input.LA(1);
-
-				if ((LA85_1==DOT))
-				{
-					int LA85_2 = input.LA(2);
-
-					if ((LA85_2==CLASS))
-					{
-						alt85 = 1;
-					}
-				}
-				} finally { DebugExitDecision(85); }
-				switch (alt85)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:566:46: DOT ^ 'class'
-					{
-					DebugLocation(566, 49);
-					DOT246=(IToken)Match(input,DOT,Follow._DOT_in_primaryExpression2879); 
-					DOT246_tree = (IASTNode)adaptor.Create(DOT246);
-					root_0 = (IASTNode)adaptor.BecomeRoot(DOT246_tree, root_0);
-					DebugLocation(566, 51);
-					string_literal247=(IToken)Match(input,CLASS,Follow._CLASS_in_primaryExpression2882); 
-					string_literal247_tree = (IASTNode)adaptor.Create(string_literal247);
-					adaptor.AddChild(root_0, string_literal247_tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(85); }
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:567:6: constant
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(567, 6);
-				PushFollow(Follow._constant_in_primaryExpression2892);
-				constant248=constant();
-				PopFollow();
-
-				adaptor.AddChild(root_0, constant248.Tree);
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// Hql.g:568:6: COLON ^ identifier
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(568, 11);
-				COLON249=(IToken)Match(input,COLON,Follow._COLON_in_primaryExpression2899); 
-				COLON249_tree = (IASTNode)adaptor.Create(COLON249);
-				root_0 = (IASTNode)adaptor.BecomeRoot(COLON249_tree, root_0);
-				DebugLocation(568, 13);
-				PushFollow(Follow._identifier_in_primaryExpression2902);
-				identifier250=identifier();
-				PopFollow();
-
-				adaptor.AddChild(root_0, identifier250.Tree);
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// Hql.g:570:6: OPEN ! ( expressionOrVector | subQuery ) CLOSE !
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(570, 10);
-				OPEN251=(IToken)Match(input,OPEN,Follow._OPEN_in_primaryExpression2911); 
-				DebugLocation(570, 12);
-				// Hql.g:570:12: ( expressionOrVector | subQuery )
-				int alt86=2;
-				try { DebugEnterSubRule(86);
-				try { DebugEnterDecision(86, false);
-				int LA86_1 = input.LA(1);
-
-				if ((LA86_1==ALL||LA86_1==ANY||LA86_1==AVG||LA86_1==BNOT||LA86_1==CASE||LA86_1==COLON||LA86_1==COUNT||LA86_1==ELEMENTS||LA86_1==EMPTY||LA86_1==EXISTS||LA86_1==FALSE||LA86_1==IDENT||LA86_1==INDICES||LA86_1==MAX||(LA86_1>=MIN && LA86_1<=MINUS)||LA86_1==NOT||(LA86_1>=NULL && LA86_1<=NUM_LONG)||LA86_1==OPEN||(LA86_1>=PARAM && LA86_1<=PLUS)||LA86_1==QUOTED_String||LA86_1==SOME||LA86_1==SUM||LA86_1==TRUE))
-				{
-					alt86 = 1;
-				}
-				else if ((LA86_1==EOF||LA86_1==CLOSE||LA86_1==FROM||LA86_1==GROUP||LA86_1==HAVING||LA86_1==ORDER||LA86_1==SELECT||LA86_1==SKIP||LA86_1==TAKE||LA86_1==UNION||LA86_1==WHERE))
-				{
-					alt86 = 2;
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 86, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				} finally { DebugExitDecision(86); }
-				switch (alt86)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:570:13: expressionOrVector
-					{
-					DebugLocation(570, 13);
-					PushFollow(Follow._expressionOrVector_in_primaryExpression2915);
-					expressionOrVector252=expressionOrVector();
-					PopFollow();
-
-					adaptor.AddChild(root_0, expressionOrVector252.Tree);
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:570:34: subQuery
-					{
-					DebugLocation(570, 34);
-					PushFollow(Follow._subQuery_in_primaryExpression2919);
-					subQuery253=subQuery();
-					PopFollow();
-
-					adaptor.AddChild(root_0, subQuery253.Tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(86); }
-
-				DebugLocation(570, 49);
-				CLOSE254=(IToken)Match(input,CLOSE,Follow._CLOSE_in_primaryExpression2922); 
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// Hql.g:571:6: PARAM ^ ( NUM_INT )?
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(571, 11);
-				PARAM255=(IToken)Match(input,PARAM,Follow._PARAM_in_primaryExpression2930); 
-				PARAM255_tree = (IASTNode)adaptor.Create(PARAM255);
-				root_0 = (IASTNode)adaptor.BecomeRoot(PARAM255_tree, root_0);
-				DebugLocation(571, 13);
-				// Hql.g:571:13: ( NUM_INT )?
-				int alt87=2;
-				try { DebugEnterSubRule(87);
-				try { DebugEnterDecision(87, false);
-				int LA87_1 = input.LA(1);
-
-				if ((LA87_1==NUM_INT))
-				{
-					alt87 = 1;
-				}
-				} finally { DebugExitDecision(87); }
-				switch (alt87)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:571:14: NUM_INT
-					{
-					DebugLocation(571, 14);
-					NUM_INT256=(IToken)Match(input,NUM_INT,Follow._NUM_INT_in_primaryExpression2934); 
-					NUM_INT256_tree = (IASTNode)adaptor.Create(NUM_INT256);
-					adaptor.AddChild(root_0, NUM_INT256_tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(87); }
-
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("primaryExpression", 65);
-			LeaveRule("primaryExpression", 65);
-			LeaveRule_primaryExpression();
-		}
-		DebugLocation(572, 1);
-		} finally { DebugExitRule(GrammarFileName, "primaryExpression"); }
-		return retval;
-
-	}
-	// $ANTLR end "primaryExpression"
-
-	partial void EnterRule_expressionOrVector();
-	partial void LeaveRule_expressionOrVector();
-	// $ANTLR start "expressionOrVector"
-	// Hql.g:576:1: expressionOrVector : e= expression (v= vectorExpr )? -> {v != null}? ^( VECTOR_EXPR[\"{vector}\"] $e $v) -> $e;
-	[GrammarRule("expressionOrVector")]
-	private AstParserRuleReturnScope<IASTNode, IToken> expressionOrVector()
-	{
-		EnterRule_expressionOrVector();
-		EnterRule("expressionOrVector", 66);
-		TraceIn("expressionOrVector", 66);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> e = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> v = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		RewriteRuleSubtreeStream stream_expression=new RewriteRuleSubtreeStream(adaptor,"rule expression");
-		RewriteRuleSubtreeStream stream_vectorExpr=new RewriteRuleSubtreeStream(adaptor,"rule vectorExpr");
-		try { DebugEnterRule(GrammarFileName, "expressionOrVector");
-		DebugLocation(576, 1);
-		try
-		{
-			// Hql.g:577:2: (e= expression (v= vectorExpr )? -> {v != null}? ^( VECTOR_EXPR[\"{vector}\"] $e $v) -> $e)
-			DebugEnterAlt(1);
-			// Hql.g:577:4: e= expression (v= vectorExpr )?
-			{
-			DebugLocation(577, 5);
-			PushFollow(Follow._expression_in_expressionOrVector2952);
-			e=expression();
-			PopFollow();
-
-			stream_expression.Add(e.Tree);
-			DebugLocation(577, 17);
-			// Hql.g:577:17: (v= vectorExpr )?
-			int alt89=2;
-			try { DebugEnterSubRule(89);
-			try { DebugEnterDecision(89, false);
-			int LA89_1 = input.LA(1);
-
-			if ((LA89_1==COMMA))
-			{
-				alt89 = 1;
-			}
-			} finally { DebugExitDecision(89); }
-			switch (alt89)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:577:19: v= vectorExpr
-				{
-				DebugLocation(577, 20);
-				PushFollow(Follow._vectorExpr_in_expressionOrVector2958);
-				v=vectorExpr();
-				PopFollow();
-
-				stream_vectorExpr.Add(v.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(89); }
-
-
-
-			{
-			// AST REWRITE
-			// elements: e, v, e
-			// token labels: 
-			// rule labels: e, v, retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_e=new RewriteRuleSubtreeStream(adaptor,"rule e",e!=null?e.Tree:null);
-			RewriteRuleSubtreeStream stream_v=new RewriteRuleSubtreeStream(adaptor,"rule v",v!=null?v.Tree:null);
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 578:2: -> {v != null}? ^( VECTOR_EXPR[\"{vector}\"] $e $v)
-			if (v != null)
-			{
-				DebugLocation(578, 18);
-				// Hql.g:578:18: ^( VECTOR_EXPR[\"{vector}\"] $e $v)
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(578, 20);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(VECTOR_EXPR, "{vector}"), root_1);
-
-				DebugLocation(578, 45);
-				adaptor.AddChild(root_1, stream_e.NextTree());
-				DebugLocation(578, 48);
-				adaptor.AddChild(root_1, stream_v.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-			else // 579:2: -> $e
-			{
-				DebugLocation(579, 6);
-				adaptor.AddChild(root_0, stream_e.NextTree());
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("expressionOrVector", 66);
-			LeaveRule("expressionOrVector", 66);
-			LeaveRule_expressionOrVector();
-		}
-		DebugLocation(580, 1);
-		} finally { DebugExitRule(GrammarFileName, "expressionOrVector"); }
-		return retval;
-
-	}
-	// $ANTLR end "expressionOrVector"
-
-	partial void EnterRule_vectorExpr();
-	partial void LeaveRule_vectorExpr();
-	// $ANTLR start "vectorExpr"
-	// Hql.g:582:1: vectorExpr : COMMA ! expression ( COMMA ! expression )* ;
-	[GrammarRule("vectorExpr")]
-	private AstParserRuleReturnScope<IASTNode, IToken> vectorExpr()
-	{
-		EnterRule_vectorExpr();
-		EnterRule("vectorExpr", 67);
-		TraceIn("vectorExpr", 67);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken COMMA257 = default(IToken);
-		IToken COMMA259 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> expression258 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> expression260 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode COMMA257_tree = default(IASTNode);
-		IASTNode COMMA259_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "vectorExpr");
-		DebugLocation(582, 1);
-		try
-		{
-			// Hql.g:583:2: ( COMMA ! expression ( COMMA ! expression )* )
-			DebugEnterAlt(1);
-			// Hql.g:583:4: COMMA ! expression ( COMMA ! expression )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(583, 9);
-			COMMA257=(IToken)Match(input,COMMA,Follow._COMMA_in_vectorExpr2995); 
-			DebugLocation(583, 11);
-			PushFollow(Follow._expression_in_vectorExpr2998);
-			expression258=expression();
-			PopFollow();
-
-			adaptor.AddChild(root_0, expression258.Tree);
-			DebugLocation(583, 22);
-			// Hql.g:583:22: ( COMMA ! expression )*
-			try { DebugEnterSubRule(90);
-			while (true)
-			{
-				int alt90=2;
-				try { DebugEnterDecision(90, false);
-				int LA90_1 = input.LA(1);
-
-				if ((LA90_1==COMMA))
-				{
-					alt90 = 1;
-				}
-
-
-				} finally { DebugExitDecision(90); }
-				switch ( alt90 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:583:23: COMMA ! expression
-					{
-					DebugLocation(583, 28);
-					COMMA259=(IToken)Match(input,COMMA,Follow._COMMA_in_vectorExpr3001); 
-					DebugLocation(583, 30);
-					PushFollow(Follow._expression_in_vectorExpr3004);
-					expression260=expression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, expression260.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop90;
-				}
-			}
-
-			loop90:
-				;
-
-			} finally { DebugExitSubRule(90); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("vectorExpr", 67);
-			LeaveRule("vectorExpr", 67);
-			LeaveRule_vectorExpr();
-		}
-		DebugLocation(584, 1);
-		} finally { DebugExitRule(GrammarFileName, "vectorExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "vectorExpr"
-
-	partial void EnterRule_identPrimary();
-	partial void LeaveRule_identPrimary();
-	// $ANTLR start "identPrimary"
-	// Hql.g:589:1: identPrimary : ( identifier ( options {greedy=true; } : DOT ^ ( identifier |o= OBJECT ) )* ( (op= OPEN ^ exprList CLOSE !) )? | aggregate );
-	[GrammarRule("identPrimary")]
-	private AstParserRuleReturnScope<IASTNode, IToken> identPrimary()
-	{
-		EnterRule_identPrimary();
-		EnterRule("identPrimary", 68);
-		TraceIn("identPrimary", 68);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken o = default(IToken);
-		IToken op = default(IToken);
-		IToken DOT262 = default(IToken);
-		IToken CLOSE265 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> identifier261 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> identifier263 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> exprList264 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> aggregate266 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode o_tree = default(IASTNode);
-		IASTNode op_tree = default(IASTNode);
-		IASTNode DOT262_tree = default(IASTNode);
-		IASTNode CLOSE265_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "identPrimary");
-		DebugLocation(589, 1);
-		try
-		{
-			// Hql.g:590:2: ( identifier ( options {greedy=true; } : DOT ^ ( identifier |o= OBJECT ) )* ( (op= OPEN ^ exprList CLOSE !) )? | aggregate )
-			int alt94=2;
-			try { DebugEnterDecision(94, false);
-			int LA94_1 = input.LA(1);
-
-			if ((LA94_1==IDENT))
-			{
-				alt94 = 1;
-			}
-			else if ((LA94_1==AVG||LA94_1==COUNT||LA94_1==ELEMENTS||LA94_1==INDICES||LA94_1==MAX||LA94_1==MIN||LA94_1==SUM))
-			{
-				alt94 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 94, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(94); }
-			switch (alt94)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:590:4: identifier ( options {greedy=true; } : DOT ^ ( identifier |o= OBJECT ) )* ( (op= OPEN ^ exprList CLOSE !) )?
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(590, 4);
-				PushFollow(Follow._identifier_in_identPrimary3020);
-				identifier261=identifier();
-				PopFollow();
-
-				adaptor.AddChild(root_0, identifier261.Tree);
-				DebugLocation(590, 15);
-				 HandleDotIdent(); 
-				DebugLocation(591, 4);
-				// Hql.g:591:4: ( options {greedy=true; } : DOT ^ ( identifier |o= OBJECT ) )*
-				try { DebugEnterSubRule(92);
-				while (true)
-				{
-					int alt92=2;
-					try { DebugEnterDecision(92, false);
-					int LA92_1 = input.LA(1);
-
-					if ((LA92_1==DOT))
-					{
-						int LA92_2 = input.LA(2);
-
-						if ((LA92_2==IDENT||LA92_2==OBJECT))
-						{
-							alt92 = 1;
-						}
-
-
-					}
-
-
-					} finally { DebugExitDecision(92); }
-					switch ( alt92 )
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// Hql.g:591:31: DOT ^ ( identifier |o= OBJECT )
-						{
-						DebugLocation(591, 34);
-						DOT262=(IToken)Match(input,DOT,Follow._DOT_in_identPrimary3038); 
-						DOT262_tree = (IASTNode)adaptor.Create(DOT262);
-						root_0 = (IASTNode)adaptor.BecomeRoot(DOT262_tree, root_0);
-						DebugLocation(591, 36);
-						// Hql.g:591:36: ( identifier |o= OBJECT )
-						int alt91=2;
-						try { DebugEnterSubRule(91);
-						try { DebugEnterDecision(91, false);
-						int LA91_1 = input.LA(1);
-
-						if ((LA91_1==IDENT))
-						{
-							alt91 = 1;
-						}
-						else if ((LA91_1==OBJECT))
-						{
-							alt91 = 2;
-						}
-						else
-						{
-							NoViableAltException nvae = new NoViableAltException("", 91, 0, input, 1);
-							DebugRecognitionException(nvae);
-							throw nvae;
-						}
-						} finally { DebugExitDecision(91); }
-						switch (alt91)
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// Hql.g:591:38: identifier
-							{
-							DebugLocation(591, 38);
-							PushFollow(Follow._identifier_in_identPrimary3043);
-							identifier263=identifier();
-							PopFollow();
-
-							adaptor.AddChild(root_0, identifier263.Tree);
-
-							}
-							break;
-						case 2:
-							DebugEnterAlt(2);
-							// Hql.g:591:51: o= OBJECT
-							{
-							DebugLocation(591, 52);
-							o=(IToken)Match(input,OBJECT,Follow._OBJECT_in_identPrimary3049); 
-							o_tree = (IASTNode)adaptor.Create(o);
-							adaptor.AddChild(root_0, o_tree);
-							DebugLocation(591, 60);
-							 o.Type = IDENT; 
-
-							}
-							break;
-
-						}
-						} finally { DebugExitSubRule(91); }
-
-
-						}
-						break;
-
-					default:
-						goto loop92;
-					}
-				}
-
-				loop92:
-					;
-
-				} finally { DebugExitSubRule(92); }
-
-				DebugLocation(592, 4);
-				// Hql.g:592:4: ( (op= OPEN ^ exprList CLOSE !) )?
-				int alt93=2;
-				try { DebugEnterSubRule(93);
-				try { DebugEnterDecision(93, false);
-				int LA93_1 = input.LA(1);
-
-				if ((LA93_1==OPEN))
-				{
-					alt93 = 1;
-				}
-				} finally { DebugExitDecision(93); }
-				switch (alt93)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:592:6: (op= OPEN ^ exprList CLOSE !)
-					{
-					DebugLocation(592, 6);
-					// Hql.g:592:6: (op= OPEN ^ exprList CLOSE !)
-					DebugEnterAlt(1);
-					// Hql.g:592:8: op= OPEN ^ exprList CLOSE !
-					{
-					DebugLocation(592, 10);
-					op=(IToken)Match(input,OPEN,Follow._OPEN_in_identPrimary3067); 
-					op_tree = (IASTNode)adaptor.Create(op);
-					root_0 = (IASTNode)adaptor.BecomeRoot(op_tree, root_0);
-					DebugLocation(592, 17);
-					 op.Type = METHOD_CALL;
-					DebugLocation(592, 44);
-					PushFollow(Follow._exprList_in_identPrimary3072);
-					exprList264=exprList();
-					PopFollow();
-
-					adaptor.AddChild(root_0, exprList264.Tree);
-					DebugLocation(592, 58);
-					CLOSE265=(IToken)Match(input,CLOSE,Follow._CLOSE_in_identPrimary3074); 
-
-					}
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(93); }
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:595:4: aggregate
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(595, 4);
-				PushFollow(Follow._aggregate_in_identPrimary3090);
-				aggregate266=aggregate();
-				PopFollow();
-
-				adaptor.AddChild(root_0, aggregate266.Tree);
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("identPrimary", 68);
-			LeaveRule("identPrimary", 68);
-			LeaveRule_identPrimary();
-		}
-		DebugLocation(596, 1);
-		} finally { DebugExitRule(GrammarFileName, "identPrimary"); }
-		return retval;
-
-	}
-	// $ANTLR end "identPrimary"
-
-	partial void EnterRule_aggregate();
-	partial void LeaveRule_aggregate();
-	// $ANTLR start "aggregate"
-	// Hql.g:603:1: aggregate : ( (op= SUM |op= AVG |op= MAX |op= MIN ) OPEN additiveExpression CLOSE -> ^( AGGREGATE[$op] additiveExpression ) | COUNT OPEN (s= STAR |p= aggregateDistinctAll ) CLOSE -> {s == null}? ^( COUNT $p) -> ^( COUNT ^( ROW_STAR[\"*\"] ) ) | collectionExpr );
-	[GrammarRule("aggregate")]
-	private AstParserRuleReturnScope<IASTNode, IToken> aggregate()
-	{
-		EnterRule_aggregate();
-		EnterRule("aggregate", 69);
-		TraceIn("aggregate", 69);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken op = default(IToken);
-		IToken s = default(IToken);
-		IToken OPEN267 = default(IToken);
-		IToken CLOSE269 = default(IToken);
-		IToken COUNT270 = default(IToken);
-		IToken OPEN271 = default(IToken);
-		IToken CLOSE272 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> p = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> additiveExpression268 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> collectionExpr273 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode op_tree = default(IASTNode);
-		IASTNode s_tree = default(IASTNode);
-		IASTNode OPEN267_tree = default(IASTNode);
-		IASTNode CLOSE269_tree = default(IASTNode);
-		IASTNode COUNT270_tree = default(IASTNode);
-		IASTNode OPEN271_tree = default(IASTNode);
-		IASTNode CLOSE272_tree = default(IASTNode);
-		RewriteRuleITokenStream stream_SUM=new RewriteRuleITokenStream(adaptor,"token SUM");
-		RewriteRuleITokenStream stream_AVG=new RewriteRuleITokenStream(adaptor,"token AVG");
-		RewriteRuleITokenStream stream_MAX=new RewriteRuleITokenStream(adaptor,"token MAX");
-		RewriteRuleITokenStream stream_MIN=new RewriteRuleITokenStream(adaptor,"token MIN");
-		RewriteRuleITokenStream stream_OPEN=new RewriteRuleITokenStream(adaptor,"token OPEN");
-		RewriteRuleITokenStream stream_CLOSE=new RewriteRuleITokenStream(adaptor,"token CLOSE");
-		RewriteRuleITokenStream stream_COUNT=new RewriteRuleITokenStream(adaptor,"token COUNT");
-		RewriteRuleITokenStream stream_STAR=new RewriteRuleITokenStream(adaptor,"token STAR");
-		RewriteRuleSubtreeStream stream_additiveExpression=new RewriteRuleSubtreeStream(adaptor,"rule additiveExpression");
-		RewriteRuleSubtreeStream stream_aggregateDistinctAll=new RewriteRuleSubtreeStream(adaptor,"rule aggregateDistinctAll");
-		try { DebugEnterRule(GrammarFileName, "aggregate");
-		DebugLocation(603, 1);
-		try
-		{
-			// Hql.g:604:2: ( (op= SUM |op= AVG |op= MAX |op= MIN ) OPEN additiveExpression CLOSE -> ^( AGGREGATE[$op] additiveExpression ) | COUNT OPEN (s= STAR |p= aggregateDistinctAll ) CLOSE -> {s == null}? ^( COUNT $p) -> ^( COUNT ^( ROW_STAR[\"*\"] ) ) | collectionExpr )
-			int alt97=3;
-			try { DebugEnterDecision(97, false);
-			switch (input.LA(1))
-			{
-			case AVG:
-			case MAX:
-			case MIN:
-			case SUM:
-				{
-				alt97 = 1;
-				}
-				break;
-			case COUNT:
-				{
-				alt97 = 2;
-				}
-				break;
-			case ELEMENTS:
-			case INDICES:
-				{
-				alt97 = 3;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 97, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(97); }
-			switch (alt97)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:604:4: (op= SUM |op= AVG |op= MAX |op= MIN ) OPEN additiveExpression CLOSE
-				{
-				DebugLocation(604, 4);
-				// Hql.g:604:4: (op= SUM |op= AVG |op= MAX |op= MIN )
-				int alt95=4;
-				try { DebugEnterSubRule(95);
-				try { DebugEnterDecision(95, false);
-				switch (input.LA(1))
-				{
-				case SUM:
-					{
-					alt95 = 1;
-					}
-					break;
-				case AVG:
-					{
-					alt95 = 2;
-					}
-					break;
-				case MAX:
-					{
-					alt95 = 3;
-					}
-					break;
-				case MIN:
-					{
-					alt95 = 4;
-					}
-					break;
-				default:
-					{
-						NoViableAltException nvae = new NoViableAltException("", 95, 0, input, 1);
-						DebugRecognitionException(nvae);
-						throw nvae;
-					}
-				}
-
-				} finally { DebugExitDecision(95); }
-				switch (alt95)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:604:6: op= SUM
-					{
-					DebugLocation(604, 8);
-					op=(IToken)Match(input,SUM,Follow._SUM_in_aggregate3111);  
-					stream_SUM.Add(op);
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:604:15: op= AVG
-					{
-					DebugLocation(604, 17);
-					op=(IToken)Match(input,AVG,Follow._AVG_in_aggregate3117);  
-					stream_AVG.Add(op);
-
-
-					}
-					break;
-				case 3:
-					DebugEnterAlt(3);
-					// Hql.g:604:24: op= MAX
-					{
-					DebugLocation(604, 26);
-					op=(IToken)Match(input,MAX,Follow._MAX_in_aggregate3123);  
-					stream_MAX.Add(op);
-
-
-					}
-					break;
-				case 4:
-					DebugEnterAlt(4);
-					// Hql.g:604:33: op= MIN
-					{
-					DebugLocation(604, 35);
-					op=(IToken)Match(input,MIN,Follow._MIN_in_aggregate3129);  
-					stream_MIN.Add(op);
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(95); }
-
-				DebugLocation(604, 42);
-				OPEN267=(IToken)Match(input,OPEN,Follow._OPEN_in_aggregate3133);  
-				stream_OPEN.Add(OPEN267);
-
-				DebugLocation(604, 47);
-				PushFollow(Follow._additiveExpression_in_aggregate3135);
-				additiveExpression268=additiveExpression();
-				PopFollow();
-
-				stream_additiveExpression.Add(additiveExpression268.Tree);
-				DebugLocation(604, 66);
-				CLOSE269=(IToken)Match(input,CLOSE,Follow._CLOSE_in_aggregate3137);  
-				stream_CLOSE.Add(CLOSE269);
-
-
-
-				{
-				// AST REWRITE
-				// elements: additiveExpression
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 605:3: -> ^( AGGREGATE[$op] additiveExpression )
-				{
-					DebugLocation(605, 6);
-					// Hql.g:605:6: ^( AGGREGATE[$op] additiveExpression )
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(605, 8);
-					root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(AGGREGATE, op), root_1);
-
-					DebugLocation(605, 23);
-					adaptor.AddChild(root_1, stream_additiveExpression.NextTree());
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:607:5: COUNT OPEN (s= STAR |p= aggregateDistinctAll ) CLOSE
-				{
-				DebugLocation(607, 5);
-				COUNT270=(IToken)Match(input,COUNT,Follow._COUNT_in_aggregate3156);  
-				stream_COUNT.Add(COUNT270);
-
-				DebugLocation(607, 11);
-				OPEN271=(IToken)Match(input,OPEN,Follow._OPEN_in_aggregate3158);  
-				stream_OPEN.Add(OPEN271);
-
-				DebugLocation(607, 16);
-				// Hql.g:607:16: (s= STAR |p= aggregateDistinctAll )
-				int alt96=2;
-				try { DebugEnterSubRule(96);
-				try { DebugEnterDecision(96, false);
-				int LA96_1 = input.LA(1);
-
-				if ((LA96_1==STAR))
-				{
-					alt96 = 1;
-				}
-				else if ((LA96_1==ALL||LA96_1==DISTINCT||LA96_1==ELEMENTS||LA96_1==IDENT||LA96_1==INDICES))
-				{
-					alt96 = 2;
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 96, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				} finally { DebugExitDecision(96); }
-				switch (alt96)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:607:18: s= STAR
-					{
-					DebugLocation(607, 19);
-					s=(IToken)Match(input,STAR,Follow._STAR_in_aggregate3164);  
-					stream_STAR.Add(s);
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:607:27: p= aggregateDistinctAll
-					{
-					DebugLocation(607, 28);
-					PushFollow(Follow._aggregateDistinctAll_in_aggregate3170);
-					p=aggregateDistinctAll();
-					PopFollow();
-
-					stream_aggregateDistinctAll.Add(p.Tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(96); }
-
-				DebugLocation(607, 52);
-				CLOSE272=(IToken)Match(input,CLOSE,Follow._CLOSE_in_aggregate3174);  
-				stream_CLOSE.Add(CLOSE272);
-
-
-
-				{
-				// AST REWRITE
-				// elements: COUNT, p, COUNT
-				// token labels: 
-				// rule labels: p, retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_p=new RewriteRuleSubtreeStream(adaptor,"rule p",p!=null?p.Tree:null);
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 608:3: -> {s == null}? ^( COUNT $p)
-				if (s == null)
-				{
-					DebugLocation(608, 19);
-					// Hql.g:608:19: ^( COUNT $p)
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(608, 21);
-					root_1 = (IASTNode)adaptor.BecomeRoot(stream_COUNT.NextNode(), root_1);
-
-					DebugLocation(608, 28);
-					adaptor.AddChild(root_1, stream_p.NextTree());
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-				else // 609:3: -> ^( COUNT ^( ROW_STAR[\"*\"] ) )
-				{
-					DebugLocation(609, 6);
-					// Hql.g:609:6: ^( COUNT ^( ROW_STAR[\"*\"] ) )
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(609, 8);
-					root_1 = (IASTNode)adaptor.BecomeRoot(stream_COUNT.NextNode(), root_1);
-
-					DebugLocation(609, 14);
-					// Hql.g:609:14: ^( ROW_STAR[\"*\"] )
-					{
-					IASTNode root_2 = (IASTNode)adaptor.Nil();
-					DebugLocation(609, 16);
-					root_2 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(ROW_STAR, "*"), root_2);
-
-					adaptor.AddChild(root_1, root_2);
-					}
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// Hql.g:610:5: collectionExpr
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(610, 5);
-				PushFollow(Follow._collectionExpr_in_aggregate3206);
-				collectionExpr273=collectionExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_0, collectionExpr273.Tree);
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("aggregate", 69);
-			LeaveRule("aggregate", 69);
-			LeaveRule_aggregate();
-		}
-		DebugLocation(611, 1);
-		} finally { DebugExitRule(GrammarFileName, "aggregate"); }
-		return retval;
-
-	}
-	// $ANTLR end "aggregate"
-
-	partial void EnterRule_aggregateDistinctAll();
-	partial void LeaveRule_aggregateDistinctAll();
-	// $ANTLR start "aggregateDistinctAll"
-	// Hql.g:613:1: aggregateDistinctAll : ( ( DISTINCT | ALL )? ( path | collectionExpr ) ) ;
-	[GrammarRule("aggregateDistinctAll")]
-	private AstParserRuleReturnScope<IASTNode, IToken> aggregateDistinctAll()
-	{
-		EnterRule_aggregateDistinctAll();
-		EnterRule("aggregateDistinctAll", 70);
-		TraceIn("aggregateDistinctAll", 70);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken set274 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> path275 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> collectionExpr276 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode set274_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "aggregateDistinctAll");
-		DebugLocation(613, 1);
-		try
-		{
-			// Hql.g:614:2: ( ( ( DISTINCT | ALL )? ( path | collectionExpr ) ) )
-			DebugEnterAlt(1);
-			// Hql.g:614:4: ( ( DISTINCT | ALL )? ( path | collectionExpr ) )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(614, 4);
-			// Hql.g:614:4: ( ( DISTINCT | ALL )? ( path | collectionExpr ) )
-			DebugEnterAlt(1);
-			// Hql.g:614:6: ( DISTINCT | ALL )? ( path | collectionExpr )
-			{
-			DebugLocation(614, 6);
-			// Hql.g:614:6: ( DISTINCT | ALL )?
-			int alt98=2;
-			try { DebugEnterSubRule(98);
-			try { DebugEnterDecision(98, false);
-			int LA98_1 = input.LA(1);
-
-			if ((LA98_1==ALL||LA98_1==DISTINCT))
-			{
-				alt98 = 1;
-			}
-			} finally { DebugExitDecision(98); }
-			switch (alt98)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:
-				{
-				DebugLocation(614, 6);
-
-				set274=(IToken)input.LT(1);
-				if (input.LA(1)==ALL||input.LA(1)==DISTINCT)
-				{
-					input.Consume();
-					adaptor.AddChild(root_0, (IASTNode)adaptor.Create(set274));
-					state.errorRecovery=false;
-				}
-				else
-				{
-					MismatchedSetException mse = new MismatchedSetException(null,input);
-					DebugRecognitionException(mse);
-					throw mse;
-				}
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(98); }
-
-			DebugLocation(614, 26);
-			// Hql.g:614:26: ( path | collectionExpr )
-			int alt99=2;
-			try { DebugEnterSubRule(99);
-			try { DebugEnterDecision(99, false);
-			int LA99_1 = input.LA(1);
-
-			if ((LA99_1==IDENT))
-			{
-				alt99 = 1;
-			}
-			else if ((LA99_1==ELEMENTS||LA99_1==INDICES))
-			{
-				alt99 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 99, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(99); }
-			switch (alt99)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:614:28: path
-				{
-				DebugLocation(614, 28);
-				PushFollow(Follow._path_in_aggregateDistinctAll3232);
-				path275=path();
-				PopFollow();
-
-				adaptor.AddChild(root_0, path275.Tree);
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:614:35: collectionExpr
-				{
-				DebugLocation(614, 35);
-				PushFollow(Follow._collectionExpr_in_aggregateDistinctAll3236);
-				collectionExpr276=collectionExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_0, collectionExpr276.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(99); }
-
-
-			}
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("aggregateDistinctAll", 70);
-			LeaveRule("aggregateDistinctAll", 70);
-			LeaveRule_aggregateDistinctAll();
-		}
-		DebugLocation(615, 1);
-		} finally { DebugExitRule(GrammarFileName, "aggregateDistinctAll"); }
-		return retval;
-
-	}
-	// $ANTLR end "aggregateDistinctAll"
-
-	partial void EnterRule_collectionExpr();
-	partial void LeaveRule_collectionExpr();
-	// $ANTLR start "collectionExpr"
-	// Hql.g:619:1: collectionExpr : ( ELEMENTS ^| INDICES ^) OPEN ! path CLOSE !;
-	[GrammarRule("collectionExpr")]
-	private AstParserRuleReturnScope<IASTNode, IToken> collectionExpr()
-	{
-		EnterRule_collectionExpr();
-		EnterRule("collectionExpr", 71);
-		TraceIn("collectionExpr", 71);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken ELEMENTS277 = default(IToken);
-		IToken INDICES278 = default(IToken);
-		IToken OPEN279 = default(IToken);
-		IToken CLOSE281 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> path280 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode ELEMENTS277_tree = default(IASTNode);
-		IASTNode INDICES278_tree = default(IASTNode);
-		IASTNode OPEN279_tree = default(IASTNode);
-		IASTNode CLOSE281_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "collectionExpr");
-		DebugLocation(619, 1);
-		try
-		{
-			// Hql.g:620:2: ( ( ELEMENTS ^| INDICES ^) OPEN ! path CLOSE !)
-			DebugEnterAlt(1);
-			// Hql.g:620:4: ( ELEMENTS ^| INDICES ^) OPEN ! path CLOSE !
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(620, 4);
-			// Hql.g:620:4: ( ELEMENTS ^| INDICES ^)
-			int alt100=2;
-			try { DebugEnterSubRule(100);
-			try { DebugEnterDecision(100, false);
-			int LA100_1 = input.LA(1);
-
-			if ((LA100_1==ELEMENTS))
-			{
-				alt100 = 1;
-			}
-			else if ((LA100_1==INDICES))
-			{
-				alt100 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 100, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(100); }
-			switch (alt100)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:620:5: ELEMENTS ^
-				{
-				DebugLocation(620, 13);
-				ELEMENTS277=(IToken)Match(input,ELEMENTS,Follow._ELEMENTS_in_collectionExpr3255); 
-				ELEMENTS277_tree = (IASTNode)adaptor.Create(ELEMENTS277);
-				root_0 = (IASTNode)adaptor.BecomeRoot(ELEMENTS277_tree, root_0);
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:620:17: INDICES ^
-				{
-				DebugLocation(620, 24);
-				INDICES278=(IToken)Match(input,INDICES,Follow._INDICES_in_collectionExpr3260); 
-				INDICES278_tree = (IASTNode)adaptor.Create(INDICES278);
-				root_0 = (IASTNode)adaptor.BecomeRoot(INDICES278_tree, root_0);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(100); }
-
-			DebugLocation(620, 31);
-			OPEN279=(IToken)Match(input,OPEN,Follow._OPEN_in_collectionExpr3264); 
-			DebugLocation(620, 33);
-			PushFollow(Follow._path_in_collectionExpr3267);
-			path280=path();
-			PopFollow();
-
-			adaptor.AddChild(root_0, path280.Tree);
-			DebugLocation(620, 43);
-			CLOSE281=(IToken)Match(input,CLOSE,Follow._CLOSE_in_collectionExpr3269); 
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("collectionExpr", 71);
-			LeaveRule("collectionExpr", 71);
-			LeaveRule_collectionExpr();
-		}
-		DebugLocation(621, 1);
-		} finally { DebugExitRule(GrammarFileName, "collectionExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "collectionExpr"
-
-	partial void EnterRule_compoundExpr();
-	partial void LeaveRule_compoundExpr();
-	// $ANTLR start "compoundExpr"
-	// Hql.g:623:1: compoundExpr : ( collectionExpr | path | ( OPEN ! ( subQuery | ( expression ( COMMA ! expression )* ) ) CLOSE !) );
-	[GrammarRule("compoundExpr")]
-	private AstParserRuleReturnScope<IASTNode, IToken> compoundExpr()
-	{
-		EnterRule_compoundExpr();
-		EnterRule("compoundExpr", 72);
-		TraceIn("compoundExpr", 72);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken OPEN284 = default(IToken);
-		IToken COMMA287 = default(IToken);
-		IToken CLOSE289 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> collectionExpr282 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> path283 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> subQuery285 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> expression286 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> expression288 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode OPEN284_tree = default(IASTNode);
-		IASTNode COMMA287_tree = default(IASTNode);
-		IASTNode CLOSE289_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "compoundExpr");
-		DebugLocation(623, 1);
-		try
-		{
-			// Hql.g:624:2: ( collectionExpr | path | ( OPEN ! ( subQuery | ( expression ( COMMA ! expression )* ) ) CLOSE !) )
-			int alt103=3;
-			try { DebugEnterDecision(103, false);
-			switch (input.LA(1))
-			{
-			case ELEMENTS:
-			case INDICES:
-				{
-				alt103 = 1;
-				}
-				break;
-			case IDENT:
-				{
-				alt103 = 2;
-				}
-				break;
-			case OPEN:
-				{
-				alt103 = 3;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 103, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(103); }
-			switch (alt103)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:624:4: collectionExpr
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(624, 4);
-				PushFollow(Follow._collectionExpr_in_compoundExpr3324);
-				collectionExpr282=collectionExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_0, collectionExpr282.Tree);
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:625:4: path
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(625, 4);
-				PushFollow(Follow._path_in_compoundExpr3329);
-				path283=path();
-				PopFollow();
-
-				adaptor.AddChild(root_0, path283.Tree);
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// Hql.g:626:4: ( OPEN ! ( subQuery | ( expression ( COMMA ! expression )* ) ) CLOSE !)
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(626, 4);
-				// Hql.g:626:4: ( OPEN ! ( subQuery | ( expression ( COMMA ! expression )* ) ) CLOSE !)
-				DebugEnterAlt(1);
-				// Hql.g:626:5: OPEN ! ( subQuery | ( expression ( COMMA ! expression )* ) ) CLOSE !
-				{
-				DebugLocation(626, 9);
-				OPEN284=(IToken)Match(input,OPEN,Follow._OPEN_in_compoundExpr3335); 
-				DebugLocation(626, 11);
-				// Hql.g:626:11: ( subQuery | ( expression ( COMMA ! expression )* ) )
-				int alt102=2;
-				try { DebugEnterSubRule(102);
-				try { DebugEnterDecision(102, false);
-				int LA102_1 = input.LA(1);
-
-				if ((LA102_1==EOF||LA102_1==CLOSE||LA102_1==FROM||LA102_1==GROUP||LA102_1==HAVING||LA102_1==ORDER||LA102_1==SELECT||LA102_1==SKIP||LA102_1==TAKE||LA102_1==UNION||LA102_1==WHERE))
-				{
-					alt102 = 1;
-				}
-				else if ((LA102_1==ALL||LA102_1==ANY||LA102_1==AVG||LA102_1==BNOT||LA102_1==CASE||LA102_1==COLON||LA102_1==COUNT||LA102_1==ELEMENTS||LA102_1==EMPTY||LA102_1==EXISTS||LA102_1==FALSE||LA102_1==IDENT||LA102_1==INDICES||LA102_1==MAX||(LA102_1>=MIN && LA102_1<=MINUS)||LA102_1==NOT||(LA102_1>=NULL && LA102_1<=NUM_LONG)||LA102_1==OPEN||(LA102_1>=PARAM && LA102_1<=PLUS)||LA102_1==QUOTED_String||LA102_1==SOME||LA102_1==SUM||LA102_1==TRUE))
-				{
-					alt102 = 2;
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 102, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				} finally { DebugExitDecision(102); }
-				switch (alt102)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:626:13: subQuery
-					{
-					DebugLocation(626, 13);
-					PushFollow(Follow._subQuery_in_compoundExpr3340);
-					subQuery285=subQuery();
-					PopFollow();
-
-					adaptor.AddChild(root_0, subQuery285.Tree);
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:626:24: ( expression ( COMMA ! expression )* )
-					{
-					DebugLocation(626, 24);
-					// Hql.g:626:24: ( expression ( COMMA ! expression )* )
-					DebugEnterAlt(1);
-					// Hql.g:626:25: expression ( COMMA ! expression )*
-					{
-					DebugLocation(626, 25);
-					PushFollow(Follow._expression_in_compoundExpr3345);
-					expression286=expression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, expression286.Tree);
-					DebugLocation(626, 36);
-					// Hql.g:626:36: ( COMMA ! expression )*
-					try { DebugEnterSubRule(101);
-					while (true)
-					{
-						int alt101=2;
-						try { DebugEnterDecision(101, false);
-						int LA101_1 = input.LA(1);
-
-						if ((LA101_1==COMMA))
-						{
-							alt101 = 1;
-						}
-
-
-						} finally { DebugExitDecision(101); }
-						switch ( alt101 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// Hql.g:626:37: COMMA ! expression
-							{
-							DebugLocation(626, 42);
-							COMMA287=(IToken)Match(input,COMMA,Follow._COMMA_in_compoundExpr3348); 
-							DebugLocation(626, 44);
-							PushFollow(Follow._expression_in_compoundExpr3351);
-							expression288=expression();
-							PopFollow();
-
-							adaptor.AddChild(root_0, expression288.Tree);
-
-							}
-							break;
-
-						default:
-							goto loop101;
-						}
-					}
-
-					loop101:
-						;
-
-					} finally { DebugExitSubRule(101); }
-
-
-					}
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(102); }
-
-				DebugLocation(626, 65);
-				CLOSE289=(IToken)Match(input,CLOSE,Follow._CLOSE_in_compoundExpr3358); 
-
-				}
-
-
-				}
-				break;
-
-			}
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("compoundExpr", 72);
-			LeaveRule("compoundExpr", 72);
-			LeaveRule_compoundExpr();
-		}
-		DebugLocation(627, 1);
-		} finally { DebugExitRule(GrammarFileName, "compoundExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "compoundExpr"
-
-	partial void EnterRule_exprList();
-	partial void LeaveRule_exprList();
-	// $ANTLR start "exprList"
-	// Hql.g:629:1: exprList : ( TRAILING | LEADING | BOTH )? ( expression ( ( COMMA ! expression )+ |f= FROM expression | AS ! identifier )? |f2= FROM expression )? ;
-	[GrammarRule("exprList")]
-	private AstParserRuleReturnScope<IASTNode, IToken> exprList()
-	{
-		EnterRule_exprList();
-		EnterRule("exprList", 73);
-		TraceIn("exprList", 73);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken f = default(IToken);
-		IToken f2 = default(IToken);
-		IToken TRAILING290 = default(IToken);
-		IToken LEADING291 = default(IToken);
-		IToken BOTH292 = default(IToken);
-		IToken COMMA294 = default(IToken);
-		IToken AS297 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> expression293 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> expression295 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> expression296 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> identifier298 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> expression299 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode f_tree = default(IASTNode);
-		IASTNode f2_tree = default(IASTNode);
-		IASTNode TRAILING290_tree = default(IASTNode);
-		IASTNode LEADING291_tree = default(IASTNode);
-		IASTNode BOTH292_tree = default(IASTNode);
-		IASTNode COMMA294_tree = default(IASTNode);
-		IASTNode AS297_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "exprList");
-		DebugLocation(629, 1);
-		try
-		{
-			// Hql.g:635:2: ( ( TRAILING | LEADING | BOTH )? ( expression ( ( COMMA ! expression )+ |f= FROM expression | AS ! identifier )? |f2= FROM expression )? )
-			DebugEnterAlt(1);
-			// Hql.g:635:4: ( TRAILING | LEADING | BOTH )? ( expression ( ( COMMA ! expression )+ |f= FROM expression | AS ! identifier )? |f2= FROM expression )?
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(635, 4);
-			// Hql.g:635:4: ( TRAILING | LEADING | BOTH )?
-			int alt104=4;
-			try { DebugEnterSubRule(104);
-			try { DebugEnterDecision(104, false);
-			switch (input.LA(1))
-			{
-			case TRAILING:
-				{
-				alt104 = 1;
-				}
-				break;
-			case LEADING:
-				{
-				alt104 = 2;
-				}
-				break;
-			case BOTH:
-				{
-				alt104 = 3;
-				}
-				break;
-			}
-
-			} finally { DebugExitDecision(104); }
-			switch (alt104)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:635:5: TRAILING
-				{
-				DebugLocation(635, 5);
-				TRAILING290=(IToken)Match(input,TRAILING,Follow._TRAILING_in_exprList3377); 
-				TRAILING290_tree = (IASTNode)adaptor.Create(TRAILING290);
-				adaptor.AddChild(root_0, TRAILING290_tree);
-				DebugLocation(635, 14);
-				TRAILING290.Type = IDENT;
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:636:10: LEADING
-				{
-				DebugLocation(636, 10);
-				LEADING291=(IToken)Match(input,LEADING,Follow._LEADING_in_exprList3390); 
-				LEADING291_tree = (IASTNode)adaptor.Create(LEADING291);
-				adaptor.AddChild(root_0, LEADING291_tree);
-				DebugLocation(636, 18);
-				LEADING291.Type = IDENT;
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// Hql.g:637:10: BOTH
-				{
-				DebugLocation(637, 10);
-				BOTH292=(IToken)Match(input,BOTH,Follow._BOTH_in_exprList3403); 
-				BOTH292_tree = (IASTNode)adaptor.Create(BOTH292);
-				adaptor.AddChild(root_0, BOTH292_tree);
-				DebugLocation(637, 15);
-				BOTH292.Type = IDENT;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(104); }
-
-			DebugLocation(639, 4);
-			// Hql.g:639:4: ( expression ( ( COMMA ! expression )+ |f= FROM expression | AS ! identifier )? |f2= FROM expression )?
-			int alt107=3;
-			try { DebugEnterSubRule(107);
-			try { DebugEnterDecision(107, false);
-			int LA107_1 = input.LA(1);
-
-			if ((LA107_1==ALL||LA107_1==ANY||LA107_1==AVG||LA107_1==BNOT||LA107_1==CASE||LA107_1==COLON||LA107_1==COUNT||LA107_1==ELEMENTS||LA107_1==EMPTY||LA107_1==EXISTS||LA107_1==FALSE||LA107_1==IDENT||LA107_1==INDICES||LA107_1==MAX||(LA107_1>=MIN && LA107_1<=MINUS)||LA107_1==NOT||(LA107_1>=NULL && LA107_1<=NUM_LONG)||LA107_1==OPEN||(LA107_1>=PARAM && LA107_1<=PLUS)||LA107_1==QUOTED_String||LA107_1==SOME||LA107_1==SUM||LA107_1==TRUE))
-			{
-				alt107 = 1;
-			}
-			else if ((LA107_1==FROM))
-			{
-				alt107 = 2;
-			}
-			} finally { DebugExitDecision(107); }
-			switch (alt107)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// Hql.g:640:5: expression ( ( COMMA ! expression )+ |f= FROM expression | AS ! identifier )?
-				{
-				DebugLocation(640, 5);
-				PushFollow(Follow._expression_in_exprList3427);
-				expression293=expression();
-				PopFollow();
-
-				adaptor.AddChild(root_0, expression293.Tree);
-				DebugLocation(640, 16);
-				// Hql.g:640:16: ( ( COMMA ! expression )+ |f= FROM expression | AS ! identifier )?
-				int alt106=4;
-				try { DebugEnterSubRule(106);
-				try { DebugEnterDecision(106, false);
-				switch (input.LA(1))
-				{
-				case COMMA:
-					{
-					alt106 = 1;
-					}
-					break;
-				case FROM:
-					{
-					alt106 = 2;
-					}
-					break;
-				case AS:
-					{
-					alt106 = 3;
-					}
-					break;
-				}
-
-				} finally { DebugExitDecision(106); }
-				switch (alt106)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:640:18: ( COMMA ! expression )+
-					{
-					DebugLocation(640, 18);
-					// Hql.g:640:18: ( COMMA ! expression )+
-					int cnt105=0;
-					try { DebugEnterSubRule(105);
-					while (true)
-					{
-						int alt105=2;
-						try { DebugEnterDecision(105, false);
-						int LA105_1 = input.LA(1);
-
-						if ((LA105_1==COMMA))
-						{
-							alt105 = 1;
-						}
-
-
-						} finally { DebugExitDecision(105); }
-						switch (alt105)
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// Hql.g:640:19: COMMA ! expression
-							{
-							DebugLocation(640, 24);
-							COMMA294=(IToken)Match(input,COMMA,Follow._COMMA_in_exprList3432); 
-							DebugLocation(640, 26);
-							PushFollow(Follow._expression_in_exprList3435);
-							expression295=expression();
-							PopFollow();
-
-							adaptor.AddChild(root_0, expression295.Tree);
-
-							}
-							break;
-
-						default:
-							if (cnt105 >= 1)
-								goto loop105;
-
-							EarlyExitException eee105 = new EarlyExitException( 105, input );
-							DebugRecognitionException(eee105);
-							throw eee105;
-						}
-						cnt105++;
-					}
-					loop105:
-						;
-
-					} finally { DebugExitSubRule(105); }
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// Hql.g:641:9: f= FROM expression
-					{
-					DebugLocation(641, 10);
-					f=(IToken)Match(input,FROM,Follow._FROM_in_exprList3450); 
-					f_tree = (IASTNode)adaptor.Create(f);
-					adaptor.AddChild(root_0, f_tree);
-					DebugLocation(641, 16);
-					PushFollow(Follow._expression_in_exprList3452);
-					expression296=expression();
-					PopFollow();
-
-					adaptor.AddChild(root_0, expression296.Tree);
-					DebugLocation(641, 27);
-					f.Type = IDENT;
-
-					}
-					break;
-				case 3:
-					DebugEnterAlt(3);
-					// Hql.g:642:9: AS ! identifier
-					{
-					DebugLocation(642, 11);
-					AS297=(IToken)Match(input,AS,Follow._AS_in_exprList3464); 
-					DebugLocation(642, 13);
-					PushFollow(Follow._identifier_in_exprList3467);
-					identifier298=identifier();
-					PopFollow();
-
-					adaptor.AddChild(root_0, identifier298.Tree);
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(106); }
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// Hql.g:643:7: f2= FROM expression
-				{
-				DebugLocation(643, 9);
-				f2=(IToken)Match(input,FROM,Follow._FROM_in_exprList3481); 
-				f2_tree = (IASTNode)adaptor.Create(f2);
-				adaptor.AddChild(root_0, f2_tree);
-				DebugLocation(643, 15);
-				PushFollow(Follow._expression_in_exprList3483);
-				expression299=expression();
-				PopFollow();
-
-				adaptor.AddChild(root_0, expression299.Tree);
-				DebugLocation(643, 26);
-				f2.Type = IDENT;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(107); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-
-			   IASTNode root = (IASTNode) adaptor.Create(EXPR_LIST, "exprList");
-			   root.AddChild((IASTNode)retval.Tree);
-			   retval.Tree = root;
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("exprList", 73);
-			LeaveRule("exprList", 73);
-			LeaveRule_exprList();
-		}
-		DebugLocation(645, 1);
-		} finally { DebugExitRule(GrammarFileName, "exprList"); }
-		return retval;
-
-	}
-	// $ANTLR end "exprList"
-
-	partial void EnterRule_subQuery();
-	partial void LeaveRule_subQuery();
-	// $ANTLR start "subQuery"
-	// Hql.g:647:1: subQuery : innerSubQuery ( UNION ^ innerSubQuery )* ;
-	[GrammarRule("subQuery")]
-	private AstParserRuleReturnScope<IASTNode, IToken> subQuery()
-	{
-		EnterRule_subQuery();
-		EnterRule("subQuery", 74);
-		TraceIn("subQuery", 74);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken UNION301 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> innerSubQuery300 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> innerSubQuery302 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode UNION301_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "subQuery");
-		DebugLocation(647, 1);
-		try
-		{
-			// Hql.g:648:2: ( innerSubQuery ( UNION ^ innerSubQuery )* )
-			DebugEnterAlt(1);
-			// Hql.g:648:4: innerSubQuery ( UNION ^ innerSubQuery )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(648, 4);
-			PushFollow(Follow._innerSubQuery_in_subQuery3503);
-			innerSubQuery300=innerSubQuery();
-			PopFollow();
-
-			adaptor.AddChild(root_0, innerSubQuery300.Tree);
-			DebugLocation(648, 18);
-			// Hql.g:648:18: ( UNION ^ innerSubQuery )*
-			try { DebugEnterSubRule(108);
-			while (true)
-			{
-				int alt108=2;
-				try { DebugEnterDecision(108, false);
-				int LA108_1 = input.LA(1);
-
-				if ((LA108_1==UNION))
-				{
-					alt108 = 1;
-				}
-
-
-				} finally { DebugExitDecision(108); }
-				switch ( alt108 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:648:19: UNION ^ innerSubQuery
-					{
-					DebugLocation(648, 24);
-					UNION301=(IToken)Match(input,UNION,Follow._UNION_in_subQuery3506); 
-					UNION301_tree = (IASTNode)adaptor.Create(UNION301);
-					root_0 = (IASTNode)adaptor.BecomeRoot(UNION301_tree, root_0);
-					DebugLocation(648, 26);
-					PushFollow(Follow._innerSubQuery_in_subQuery3509);
-					innerSubQuery302=innerSubQuery();
-					PopFollow();
-
-					adaptor.AddChild(root_0, innerSubQuery302.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop108;
-				}
-			}
-
-			loop108:
-				;
-
-			} finally { DebugExitSubRule(108); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("subQuery", 74);
-			LeaveRule("subQuery", 74);
-			LeaveRule_subQuery();
-		}
-		DebugLocation(649, 1);
-		} finally { DebugExitRule(GrammarFileName, "subQuery"); }
-		return retval;
-
-	}
-	// $ANTLR end "subQuery"
-
-	partial void EnterRule_innerSubQuery();
-	partial void LeaveRule_innerSubQuery();
-	// $ANTLR start "innerSubQuery"
-	// Hql.g:651:1: innerSubQuery : queryRule -> ^( QUERY[\"query\"] queryRule ) ;
-	[GrammarRule("innerSubQuery")]
-	private AstParserRuleReturnScope<IASTNode, IToken> innerSubQuery()
-	{
-		EnterRule_innerSubQuery();
-		EnterRule("innerSubQuery", 75);
-		TraceIn("innerSubQuery", 75);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		AstParserRuleReturnScope<IASTNode, IToken> queryRule303 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		RewriteRuleSubtreeStream stream_queryRule=new RewriteRuleSubtreeStream(adaptor,"rule queryRule");
-		try { DebugEnterRule(GrammarFileName, "innerSubQuery");
-		DebugLocation(651, 1);
-		try
-		{
-			// Hql.g:652:2: ( queryRule -> ^( QUERY[\"query\"] queryRule ) )
-			DebugEnterAlt(1);
-			// Hql.g:652:4: queryRule
-			{
-			DebugLocation(652, 4);
-			PushFollow(Follow._queryRule_in_innerSubQuery3523);
-			queryRule303=queryRule();
-			PopFollow();
-
-			stream_queryRule.Add(queryRule303.Tree);
-
-
-			{
-			// AST REWRITE
-			// elements: queryRule
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 653:2: -> ^( QUERY[\"query\"] queryRule )
-			{
-				DebugLocation(653, 5);
-				// Hql.g:653:5: ^( QUERY[\"query\"] queryRule )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(653, 7);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(QUERY, "query"), root_1);
-
-				DebugLocation(653, 22);
-				adaptor.AddChild(root_1, stream_queryRule.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("innerSubQuery", 75);
-			LeaveRule("innerSubQuery", 75);
-			LeaveRule_innerSubQuery();
-		}
-		DebugLocation(654, 1);
-		} finally { DebugExitRule(GrammarFileName, "innerSubQuery"); }
-		return retval;
-
-	}
-	// $ANTLR end "innerSubQuery"
-
-	partial void EnterRule_constant();
-	partial void LeaveRule_constant();
-	// $ANTLR start "constant"
-	// Hql.g:656:1: constant : ( NUM_INT | NUM_FLOAT | NUM_LONG | NUM_DOUBLE | NUM_DECIMAL | QUOTED_String | NULL | TRUE | FALSE | EMPTY );
-	[GrammarRule("constant")]
-	private AstParserRuleReturnScope<IASTNode, IToken> constant()
-	{
-		EnterRule_constant();
-		EnterRule("constant", 76);
-		TraceIn("constant", 76);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken set304 = default(IToken);
-
-		IASTNode set304_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "constant");
-		DebugLocation(656, 1);
-		try
-		{
-			// Hql.g:657:2: ( NUM_INT | NUM_FLOAT | NUM_LONG | NUM_DOUBLE | NUM_DECIMAL | QUOTED_String | NULL | TRUE | FALSE | EMPTY )
-			DebugEnterAlt(1);
-			// Hql.g:
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(657, 2);
-
-			set304=(IToken)input.LT(1);
-			if (input.LA(1)==EMPTY||input.LA(1)==FALSE||(input.LA(1)>=NULL && input.LA(1)<=NUM_LONG)||input.LA(1)==QUOTED_String||input.LA(1)==TRUE)
-			{
-				input.Consume();
-				adaptor.AddChild(root_0, (IASTNode)adaptor.Create(set304));
-				state.errorRecovery=false;
-			}
-			else
-			{
-				MismatchedSetException mse = new MismatchedSetException(null,input);
-				DebugRecognitionException(mse);
-				throw mse;
-			}
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("constant", 76);
-			LeaveRule("constant", 76);
-			LeaveRule_constant();
-		}
-		DebugLocation(667, 1);
-		} finally { DebugExitRule(GrammarFileName, "constant"); }
-		return retval;
-
-	}
-	// $ANTLR end "constant"
-
-	partial void EnterRule_path();
-	partial void LeaveRule_path();
-	// $ANTLR start "path"
-	// Hql.g:675:1: path : identifier ( DOT ^ identifier )* ;
-	[GrammarRule("path")]
-	private AstParserRuleReturnScope<IASTNode, IToken> path()
-	{
-		EnterRule_path();
-		EnterRule("path", 77);
-		TraceIn("path", 77);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken DOT306 = default(IToken);
-		AstParserRuleReturnScope<IASTNode, IToken> identifier305 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-		AstParserRuleReturnScope<IASTNode, IToken> identifier307 = default(AstParserRuleReturnScope<IASTNode, IToken>);
-
-		IASTNode DOT306_tree = default(IASTNode);
-
-		// TODO - need to clean up DotIdent - suspect that DotIdent2 supersedes the other one, but need to do the analysis
-		//HandleDotIdent2();
-
-		try { DebugEnterRule(GrammarFileName, "path");
-		DebugLocation(675, 1);
-		try
-		{
-			// Hql.g:680:2: ( identifier ( DOT ^ identifier )* )
-			DebugEnterAlt(1);
-			// Hql.g:680:4: identifier ( DOT ^ identifier )*
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(680, 4);
-			PushFollow(Follow._identifier_in_path3611);
-			identifier305=identifier();
-			PopFollow();
-
-			adaptor.AddChild(root_0, identifier305.Tree);
-			DebugLocation(680, 15);
-			// Hql.g:680:15: ( DOT ^ identifier )*
-			try { DebugEnterSubRule(109);
-			while (true)
-			{
-				int alt109=2;
-				try { DebugEnterDecision(109, false);
-				int LA109_1 = input.LA(1);
-
-				if ((LA109_1==DOT))
-				{
-					alt109 = 1;
-				}
-
-
-				} finally { DebugExitDecision(109); }
-				switch ( alt109 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// Hql.g:680:17: DOT ^ identifier
-					{
-					DebugLocation(680, 20);
-					DOT306=(IToken)Match(input,DOT,Follow._DOT_in_path3615); 
-					DOT306_tree = (IASTNode)adaptor.Create(DOT306);
-					root_0 = (IASTNode)adaptor.BecomeRoot(DOT306_tree, root_0);
-					DebugLocation(680, 22);
-					 WeakKeywords(); 
-					DebugLocation(680, 42);
-					PushFollow(Follow._identifier_in_path3620);
-					identifier307=identifier();
-					PopFollow();
-
-					adaptor.AddChild(root_0, identifier307.Tree);
-
-					}
-					break;
-
-				default:
-					goto loop109;
-				}
-			}
-
-			loop109:
-				;
-
-			} finally { DebugExitSubRule(109); }
-
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-			retval.Tree = (IASTNode)adaptor.ErrorNode(input, retval.Start, input.LT(-1), re);
-
-		}
-		finally
-		{
-			TraceOut("path", 77);
-			LeaveRule("path", 77);
-			LeaveRule_path();
-		}
-		DebugLocation(681, 1);
-		} finally { DebugExitRule(GrammarFileName, "path"); }
-		return retval;
-
-	}
-	// $ANTLR end "path"
-
-	partial void EnterRule_identifier();
-	partial void LeaveRule_identifier();
-	// $ANTLR start "identifier"
-	// Hql.g:685:1: identifier : IDENT ;
-	[GrammarRule("identifier")]
-	private AstParserRuleReturnScope<IASTNode, IToken> identifier()
-	{
-		EnterRule_identifier();
-		EnterRule("identifier", 78);
-		TraceIn("identifier", 78);
-		AstParserRuleReturnScope<IASTNode, IToken> retval = new AstParserRuleReturnScope<IASTNode, IToken>();
-		retval.Start = (IToken)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IToken IDENT308 = default(IToken);
-
-		IASTNode IDENT308_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "identifier");
-		DebugLocation(685, 1);
-		try
-		{
-			// Hql.g:686:2: ( IDENT )
-			DebugEnterAlt(1);
-			// Hql.g:686:4: IDENT
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(686, 4);
-			IDENT308=(IToken)Match(input,IDENT,Follow._IDENT_in_identifier3636); 
-			IDENT308_tree = (IASTNode)adaptor.Create(IDENT308);
-			adaptor.AddChild(root_0, IDENT308_tree);
-
-			}
-
-			retval.Stop = (IToken)input.LT(-1);
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-			adaptor.SetTokenBoundaries(retval.Tree, retval.Start, retval.Stop);
-
-		}
-		catch (RecognitionException ex)
-		{
-
-					retval.Tree = HandleIdentifierError(input.LT(1),ex);
-				
-		}
-
-		finally
-		{
-			TraceOut("identifier", 78);
-			LeaveRule("identifier", 78);
-			LeaveRule_identifier();
-		}
-		DebugLocation(687, 1);
-		} finally { DebugExitRule(GrammarFileName, "identifier"); }
-		return retval;
-
-	}
-	// $ANTLR end "identifier"
-	#endregion Rules
-
-
-	#region Follow sets
-	private static class Follow
-	{
-		public static readonly BitSet _updateStatement_in_statement620 = new BitSet(new ulong[]{0x0UL});
-		public static readonly BitSet _deleteStatement_in_statement624 = new BitSet(new ulong[]{0x0UL});
-		public static readonly BitSet _insertStatement_in_statement628 = new BitSet(new ulong[]{0x0UL});
-		public static readonly BitSet _selectStatement_in_statement637 = new BitSet(new ulong[]{0x0UL});
-		public static readonly BitSet _EOF_in_statement642 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _UPDATE_in_updateStatement654 = new BitSet(new ulong[]{0x81000000000000UL,0x8000000000000000UL});
-		public static readonly BitSet _VERSIONED_in_updateStatement658 = new BitSet(new ulong[]{0x81000000000000UL});
-		public static readonly BitSet _optionalFromTokenFromClause_in_updateStatement664 = new BitSet(new ulong[]{0x0UL,0x1000000000000UL});
-		public static readonly BitSet _setClause_in_updateStatement668 = new BitSet(new ulong[]{0x2UL,0x0UL,0x4UL});
-		public static readonly BitSet _whereClause_in_updateStatement673 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _SET_in_setClause687 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _assignment_in_setClause690 = new BitSet(new ulong[]{0x1000002UL});
-		public static readonly BitSet _COMMA_in_setClause693 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _assignment_in_setClause696 = new BitSet(new ulong[]{0x1000002UL});
-		public static readonly BitSet _stateField_in_assignment710 = new BitSet(new ulong[]{0x4000000000UL});
-		public static readonly BitSet _EQ_in_assignment712 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _newValue_in_assignment715 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _path_in_stateField728 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _concatenation_in_newValue741 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _DELETE_in_deleteStatement752 = new BitSet(new ulong[]{0x81000000000000UL});
-		public static readonly BitSet _optionalFromTokenFromClause_in_deleteStatement758 = new BitSet(new ulong[]{0x2UL,0x0UL,0x4UL});
-		public static readonly BitSet _whereClause_in_deleteStatement764 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _optionalFromTokenFromClause2_in_optionalFromTokenFromClause779 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _path_in_optionalFromTokenFromClause781 = new BitSet(new ulong[]{0x80000000000202UL});
-		public static readonly BitSet _asAlias_in_optionalFromTokenFromClause784 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _FROM_in_optionalFromTokenFromClause2815 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _queryRule_in_selectStatement830 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _INSERT_in_insertStatement859 = new BitSet(new ulong[]{0x8000000000000000UL});
-		public static readonly BitSet _intoClause_in_insertStatement862 = new BitSet(new ulong[]{0x29000000000000UL,0x42400800000000UL,0x4UL});
-		public static readonly BitSet _selectStatement_in_insertStatement864 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _INTO_in_intoClause875 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _path_in_intoClause878 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _insertablePropertySpec_in_intoClause882 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _OPEN_in_insertablePropertySpec893 = new BitSet(new ulong[]{0x1080101410800800UL,0x22004411F809000UL});
-		public static readonly BitSet _primaryExpression_in_insertablePropertySpec895 = new BitSet(new ulong[]{0x1200000UL});
-		public static readonly BitSet _COMMA_in_insertablePropertySpec899 = new BitSet(new ulong[]{0x1080101410800800UL,0x22004411F809000UL});
-		public static readonly BitSet _primaryExpression_in_insertablePropertySpec901 = new BitSet(new ulong[]{0x1200000UL});
-		public static readonly BitSet _CLOSE_in_insertablePropertySpec906 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _selectFrom_in_queryRule944 = new BitSet(new ulong[]{0x28000000000002UL,0x42000800000000UL,0x4UL});
-		public static readonly BitSet _whereClause_in_queryRule949 = new BitSet(new ulong[]{0x28000000000002UL,0x42000800000000UL});
-		public static readonly BitSet _groupByClause_in_queryRule956 = new BitSet(new ulong[]{0x20000000000002UL,0x42000800000000UL});
-		public static readonly BitSet _havingClause_in_queryRule963 = new BitSet(new ulong[]{0x2UL,0x42000800000000UL});
-		public static readonly BitSet _orderByClause_in_queryRule970 = new BitSet(new ulong[]{0x2UL,0x42000000000000UL});
-		public static readonly BitSet _skipClause_in_queryRule977 = new BitSet(new ulong[]{0x2UL,0x40000000000000UL});
-		public static readonly BitSet _takeClause_in_queryRule984 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _selectClause_in_selectFrom1002 = new BitSet(new ulong[]{0x1000000000002UL});
-		public static readonly BitSet _fromClause_in_selectFrom1009 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _SELECT_in_selectClause1058 = new BitSet(new ulong[]{0x1080121490844940UL,0x22404C13F8D9000UL});
-		public static readonly BitSet _DISTINCT_in_selectClause1070 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C13F8D9000UL});
-		public static readonly BitSet _selectedPropertiesList_in_selectClause1076 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _newExpression_in_selectClause1080 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _selectObject_in_selectClause1084 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _NEW_in_newExpression1098 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _path_in_newExpression1100 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _OPEN_in_newExpression1105 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _selectedPropertiesList_in_newExpression1107 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_newExpression1109 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _OBJECT_in_selectObject1135 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _OPEN_in_selectObject1138 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _identifier_in_selectObject1141 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_selectObject1143 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _FROM_in_fromClause1161 = new BitSet(new ulong[]{0x480000400000000UL});
-		public static readonly BitSet _fromRange_in_fromClause1166 = new BitSet(new ulong[]{0x2002000001000002UL,0x100000000120UL});
-		public static readonly BitSet _fromJoin_in_fromClause1170 = new BitSet(new ulong[]{0x2002000001000002UL,0x100000000120UL});
-		public static readonly BitSet _COMMA_in_fromClause1174 = new BitSet(new ulong[]{0x480000400000000UL});
-		public static readonly BitSet _fromRange_in_fromClause1179 = new BitSet(new ulong[]{0x2002000001000002UL,0x100000000120UL});
-		public static readonly BitSet _set_in_fromJoin1197 = new BitSet(new ulong[]{0x0UL,0x2000000020UL});
-		public static readonly BitSet _OUTER_in_fromJoin1208 = new BitSet(new ulong[]{0x0UL,0x20UL});
-		public static readonly BitSet _FULL_in_fromJoin1216 = new BitSet(new ulong[]{0x0UL,0x20UL});
-		public static readonly BitSet _INNER_in_fromJoin1220 = new BitSet(new ulong[]{0x0UL,0x20UL});
-		public static readonly BitSet _JOIN_in_fromJoin1225 = new BitSet(new ulong[]{0x80200000000000UL});
-		public static readonly BitSet _FETCH_in_fromJoin1229 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _path_in_fromJoin1233 = new BitSet(new ulong[]{0x80200000000202UL,0x0UL,0x8UL});
-		public static readonly BitSet _asAlias_in_fromJoin1236 = new BitSet(new ulong[]{0x200000000002UL,0x0UL,0x8UL});
-		public static readonly BitSet _propertyFetch_in_fromJoin1241 = new BitSet(new ulong[]{0x2UL,0x0UL,0x8UL});
-		public static readonly BitSet _withClause_in_fromJoin1246 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _set_in_fromJoin1257 = new BitSet(new ulong[]{0x0UL,0x2000000020UL});
-		public static readonly BitSet _OUTER_in_fromJoin1268 = new BitSet(new ulong[]{0x0UL,0x20UL});
-		public static readonly BitSet _FULL_in_fromJoin1276 = new BitSet(new ulong[]{0x0UL,0x20UL});
-		public static readonly BitSet _INNER_in_fromJoin1280 = new BitSet(new ulong[]{0x0UL,0x20UL});
-		public static readonly BitSet _JOIN_in_fromJoin1285 = new BitSet(new ulong[]{0x200400000000UL});
-		public static readonly BitSet _FETCH_in_fromJoin1289 = new BitSet(new ulong[]{0x400000000UL});
-		public static readonly BitSet _ELEMENTS_in_fromJoin1293 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _OPEN_in_fromJoin1296 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _path_in_fromJoin1299 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_fromJoin1301 = new BitSet(new ulong[]{0x80200000000202UL,0x0UL,0x8UL});
-		public static readonly BitSet _asAlias_in_fromJoin1305 = new BitSet(new ulong[]{0x200000000002UL,0x0UL,0x8UL});
-		public static readonly BitSet _propertyFetch_in_fromJoin1310 = new BitSet(new ulong[]{0x2UL,0x0UL,0x8UL});
-		public static readonly BitSet _withClause_in_fromJoin1315 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _WITH_in_withClause1328 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _logicalExpression_in_withClause1331 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _fromClassOrOuterQueryPath_in_fromRange1342 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _inClassDeclaration_in_fromRange1347 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _inCollectionDeclaration_in_fromRange1352 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _inCollectionElementsDeclaration_in_fromRange1357 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _path_in_fromClassOrOuterQueryPath1369 = new BitSet(new ulong[]{0x80200000000202UL});
-		public static readonly BitSet _asAlias_in_fromClassOrOuterQueryPath1374 = new BitSet(new ulong[]{0x200000000002UL});
-		public static readonly BitSet _propertyFetch_in_fromClassOrOuterQueryPath1379 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _alias_in_inClassDeclaration1409 = new BitSet(new ulong[]{0x400000000000000UL});
-		public static readonly BitSet _IN_in_inClassDeclaration1411 = new BitSet(new ulong[]{0x80000000100000UL});
-		public static readonly BitSet _CLASS_in_inClassDeclaration1413 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _path_in_inClassDeclaration1416 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _IN_in_inCollectionDeclaration1444 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _OPEN_in_inCollectionDeclaration1446 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _path_in_inCollectionDeclaration1448 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_inCollectionDeclaration1450 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _alias_in_inCollectionDeclaration1452 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _alias_in_inCollectionElementsDeclaration1486 = new BitSet(new ulong[]{0x400000000000000UL});
-		public static readonly BitSet _IN_in_inCollectionElementsDeclaration1488 = new BitSet(new ulong[]{0x400000000UL});
-		public static readonly BitSet _ELEMENTS_in_inCollectionElementsDeclaration1490 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _OPEN_in_inCollectionElementsDeclaration1492 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _path_in_inCollectionElementsDeclaration1494 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_inCollectionElementsDeclaration1496 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _ELEMENTS_in_inCollectionElementsDeclaration1518 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _OPEN_in_inCollectionElementsDeclaration1520 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _path_in_inCollectionElementsDeclaration1522 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_inCollectionElementsDeclaration1524 = new BitSet(new ulong[]{0x200UL});
-		public static readonly BitSet _AS_in_inCollectionElementsDeclaration1526 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _alias_in_inCollectionElementsDeclaration1528 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _AS_in_asAlias1560 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _alias_in_asAlias1565 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _identifier_in_alias1577 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _FETCH_in_propertyFetch1596 = new BitSet(new ulong[]{0x40UL});
-		public static readonly BitSet _ALL_in_propertyFetch1598 = new BitSet(new ulong[]{0x0UL,0x10000000000UL});
-		public static readonly BitSet _PROPERTIES_in_propertyFetch1601 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _GROUP_in_groupByClause1613 = new BitSet(new ulong[]{0x0UL,0x400UL});
-		public static readonly BitSet _LITERAL_by_in_groupByClause1619 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_groupByClause1622 = new BitSet(new ulong[]{0x1000002UL});
-		public static readonly BitSet _COMMA_in_groupByClause1626 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_groupByClause1629 = new BitSet(new ulong[]{0x1000002UL});
-		public static readonly BitSet _ORDER_in_orderByClause1643 = new BitSet(new ulong[]{0x0UL,0x400UL});
-		public static readonly BitSet _LITERAL_by_in_orderByClause1646 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _orderElement_in_orderByClause1649 = new BitSet(new ulong[]{0x1000002UL});
-		public static readonly BitSet _COMMA_in_orderByClause1653 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _orderElement_in_orderByClause1656 = new BitSet(new ulong[]{0x1000002UL});
-		public static readonly BitSet _SKIP_in_skipClause1670 = new BitSet(new ulong[]{0x800000UL,0x4008000000UL});
-		public static readonly BitSet _NUM_INT_in_skipClause1674 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _parameter_in_skipClause1678 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _TAKE_in_takeClause1690 = new BitSet(new ulong[]{0x800000UL,0x4008000000UL});
-		public static readonly BitSet _NUM_INT_in_takeClause1694 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _parameter_in_takeClause1698 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _COLON_in_parameter1710 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _identifier_in_parameter1713 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _PARAM_in_parameter1718 = new BitSet(new ulong[]{0x2UL,0x8000000UL});
-		public static readonly BitSet _NUM_INT_in_parameter1722 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _expression_in_orderElement1735 = new BitSet(new ulong[]{0x40000402UL,0x0UL,0x60UL});
-		public static readonly BitSet _ascendingOrDescending_in_orderElement1739 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _ASCENDING_in_ascendingOrDescending1757 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _133_in_ascendingOrDescending1763 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _DESCENDING_in_ascendingOrDescending1783 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _134_in_ascendingOrDescending1789 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _HAVING_in_havingClause1810 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _logicalExpression_in_havingClause1813 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _WHERE_in_whereClause1824 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _logicalExpression_in_whereClause1827 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _aliasedExpression_in_selectedPropertiesList1838 = new BitSet(new ulong[]{0x1000002UL});
-		public static readonly BitSet _COMMA_in_selectedPropertiesList1842 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _aliasedExpression_in_selectedPropertiesList1845 = new BitSet(new ulong[]{0x1000002UL});
-		public static readonly BitSet _expression_in_aliasedExpression1860 = new BitSet(new ulong[]{0x202UL});
-		public static readonly BitSet _AS_in_aliasedExpression1864 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _identifier_in_aliasedExpression1867 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _expression_in_logicalExpression1906 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _logicalOrExpression_in_expression1918 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _logicalAndExpression_in_logicalOrExpression1930 = new BitSet(new ulong[]{0x2UL,0x400000000UL});
-		public static readonly BitSet _OR_in_logicalOrExpression1934 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _logicalAndExpression_in_logicalOrExpression1937 = new BitSet(new ulong[]{0x2UL,0x400000000UL});
-		public static readonly BitSet _negatedExpression_in_logicalAndExpression1952 = new BitSet(new ulong[]{0x82UL});
-		public static readonly BitSet _AND_in_logicalAndExpression1956 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _negatedExpression_in_logicalAndExpression1959 = new BitSet(new ulong[]{0x82UL});
-		public static readonly BitSet _NOT_in_negatedExpression1980 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _negatedExpression_in_negatedExpression1984 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _equalityExpression_in_negatedExpression1997 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _relationalExpression_in_equalityExpression2019 = new BitSet(new ulong[]{0x4000000002UL,0x8000000020002UL});
-		public static readonly BitSet _EQ_in_equalityExpression2027 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _IS_in_equalityExpression2036 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _NOT_in_equalityExpression2042 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _NE_in_equalityExpression2054 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _SQL_NE_in_equalityExpression2063 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _relationalExpression_in_equalityExpression2074 = new BitSet(new ulong[]{0x4000000002UL,0x8000000020002UL});
-		public static readonly BitSet _concatenation_in_relationalExpression2091 = new BitSet(new ulong[]{0x414000000002002UL,0x82A40UL});
-		public static readonly BitSet _LT_in_relationalExpression2103 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _GT_in_relationalExpression2108 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _LE_in_relationalExpression2113 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _GE_in_relationalExpression2118 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _bitwiseNotExpression_in_relationalExpression2123 = new BitSet(new ulong[]{0x14000000000002UL,0x840UL});
-		public static readonly BitSet _NOT_in_relationalExpression2140 = new BitSet(new ulong[]{0x400000000002000UL,0x2200UL});
-		public static readonly BitSet _IN_in_relationalExpression2161 = new BitSet(new ulong[]{0x1080000400000000UL,0x100000000UL});
-		public static readonly BitSet _inList_in_relationalExpression2170 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _BETWEEN_in_relationalExpression2181 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _betweenList_in_relationalExpression2190 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _LIKE_in_relationalExpression2202 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _concatenation_in_relationalExpression2211 = new BitSet(new ulong[]{0x8000000000UL});
-		public static readonly BitSet _likeEscape_in_relationalExpression2213 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _MEMBER_in_relationalExpression2222 = new BitSet(new ulong[]{0x80000000000000UL,0x40000000UL});
-		public static readonly BitSet _OF_in_relationalExpression2226 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _path_in_relationalExpression2233 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _ESCAPE_in_likeEscape2260 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _concatenation_in_likeEscape2263 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _compoundExpr_in_inList2276 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _concatenation_in_betweenList2297 = new BitSet(new ulong[]{0x80UL});
-		public static readonly BitSet _AND_in_betweenList2299 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _concatenation_in_betweenList2302 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _bitwiseNotExpression_in_concatenation2321 = new BitSet(new ulong[]{0x2000002UL});
-		public static readonly BitSet _CONCAT_in_concatenation2329 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _bitwiseNotExpression_in_concatenation2338 = new BitSet(new ulong[]{0x2000002UL});
-		public static readonly BitSet _CONCAT_in_concatenation2345 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F819000UL});
-		public static readonly BitSet _bitwiseNotExpression_in_concatenation2348 = new BitSet(new ulong[]{0x2000002UL});
-		public static readonly BitSet _BNOT_in_bitwiseNotExpression2372 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _bitwiseOrExpression_in_bitwiseNotExpression2375 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _bitwiseOrExpression_in_bitwiseNotExpression2381 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _bitwiseXOrExpression_in_bitwiseOrExpression2393 = new BitSet(new ulong[]{0x8002UL});
-		public static readonly BitSet _BOR_in_bitwiseOrExpression2396 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _bitwiseXOrExpression_in_bitwiseOrExpression2399 = new BitSet(new ulong[]{0x8002UL});
-		public static readonly BitSet _bitwiseAndExpression_in_bitwiseXOrExpression2413 = new BitSet(new ulong[]{0x20002UL});
-		public static readonly BitSet _BXOR_in_bitwiseXOrExpression2416 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _bitwiseAndExpression_in_bitwiseXOrExpression2419 = new BitSet(new ulong[]{0x20002UL});
-		public static readonly BitSet _additiveExpression_in_bitwiseAndExpression2433 = new BitSet(new ulong[]{0x1002UL});
-		public static readonly BitSet _BAND_in_bitwiseAndExpression2436 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _additiveExpression_in_bitwiseAndExpression2439 = new BitSet(new ulong[]{0x1002UL});
-		public static readonly BitSet _multiplyExpression_in_additiveExpression2453 = new BitSet(new ulong[]{0x2UL,0x8000010000UL});
-		public static readonly BitSet _PLUS_in_additiveExpression2459 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _MINUS_in_additiveExpression2464 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _multiplyExpression_in_additiveExpression2469 = new BitSet(new ulong[]{0x2UL,0x8000010000UL});
-		public static readonly BitSet _unaryExpression_in_multiplyExpression2484 = new BitSet(new ulong[]{0x100000002UL,0x10000000000000UL});
-		public static readonly BitSet _STAR_in_multiplyExpression2490 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _DIV_in_multiplyExpression2495 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _unaryExpression_in_multiplyExpression2500 = new BitSet(new ulong[]{0x100000002UL,0x10000000000000UL});
-		public static readonly BitSet _MINUS_in_unaryExpression2518 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _unaryExpression_in_unaryExpression2522 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _PLUS_in_unaryExpression2539 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _unaryExpression_in_unaryExpression2543 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _caseExpression_in_unaryExpression2558 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _quantifiedExpression_in_unaryExpression2563 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _atom_in_unaryExpression2568 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _CASE_in_caseExpression2580 = new BitSet(new ulong[]{0x0UL,0x0UL,0x2UL});
-		public static readonly BitSet _whenClause_in_caseExpression2583 = new BitSet(new ulong[]{0x2800000000UL,0x0UL,0x2UL});
-		public static readonly BitSet _elseClause_in_caseExpression2588 = new BitSet(new ulong[]{0x2000000000UL});
-		public static readonly BitSet _END_in_caseExpression2592 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _CASE_in_caseExpression2612 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _unaryExpression_in_caseExpression2614 = new BitSet(new ulong[]{0x0UL,0x0UL,0x2UL});
-		public static readonly BitSet _altWhenClause_in_caseExpression2617 = new BitSet(new ulong[]{0x2800000000UL,0x0UL,0x2UL});
-		public static readonly BitSet _elseClause_in_caseExpression2622 = new BitSet(new ulong[]{0x2000000000UL});
-		public static readonly BitSet _END_in_caseExpression2626 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _WHEN_in_whenClause2655 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _logicalExpression_in_whenClause2658 = new BitSet(new ulong[]{0x0UL,0x80000000000000UL});
-		public static readonly BitSet _THEN_in_whenClause2660 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_whenClause2663 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _WHEN_in_altWhenClause2677 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _unaryExpression_in_altWhenClause2680 = new BitSet(new ulong[]{0x0UL,0x80000000000000UL});
-		public static readonly BitSet _THEN_in_altWhenClause2682 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_altWhenClause2685 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _ELSE_in_elseClause2699 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_elseClause2702 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _SOME_in_quantifiedExpression2717 = new BitSet(new ulong[]{0x1080000400000000UL,0x100000000UL});
-		public static readonly BitSet _EXISTS_in_quantifiedExpression2722 = new BitSet(new ulong[]{0x1080000400000000UL,0x100000000UL});
-		public static readonly BitSet _ALL_in_quantifiedExpression2727 = new BitSet(new ulong[]{0x1080000400000000UL,0x100000000UL});
-		public static readonly BitSet _ANY_in_quantifiedExpression2732 = new BitSet(new ulong[]{0x1080000400000000UL,0x100000000UL});
-		public static readonly BitSet _identifier_in_quantifiedExpression2741 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _collectionExpr_in_quantifiedExpression2745 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _OPEN_in_quantifiedExpression2750 = new BitSet(new ulong[]{0x29000000000000UL,0x42400800000000UL,0x4UL});
-		public static readonly BitSet _subQuery_in_quantifiedExpression2755 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_quantifiedExpression2759 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _primaryExpression_in_atom2778 = new BitSet(new ulong[]{0x200000002UL,0x200000000UL});
-		public static readonly BitSet _DOT_in_atom2787 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _identifier_in_atom2790 = new BitSet(new ulong[]{0x200000002UL,0x300000000UL});
-		public static readonly BitSet _OPEN_in_atom2818 = new BitSet(new ulong[]{0x1081121410A54940UL,0x32404C11F899080UL});
-		public static readonly BitSet _exprList_in_atom2823 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_atom2825 = new BitSet(new ulong[]{0x200000002UL,0x200000000UL});
-		public static readonly BitSet _OPEN_BRACKET_in_atom2839 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_atom2844 = new BitSet(new ulong[]{0x400000UL});
-		public static readonly BitSet _CLOSE_BRACKET_in_atom2846 = new BitSet(new ulong[]{0x200000002UL,0x200000000UL});
-		public static readonly BitSet _identPrimary_in_primaryExpression2866 = new BitSet(new ulong[]{0x200000002UL});
-		public static readonly BitSet _DOT_in_primaryExpression2879 = new BitSet(new ulong[]{0x100000UL});
-		public static readonly BitSet _CLASS_in_primaryExpression2882 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _constant_in_primaryExpression2892 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _COLON_in_primaryExpression2899 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _identifier_in_primaryExpression2902 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _OPEN_in_primaryExpression2911 = new BitSet(new ulong[]{0x10A9121410844940UL,0x26644C91F899000UL,0x4UL});
-		public static readonly BitSet _expressionOrVector_in_primaryExpression2915 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _subQuery_in_primaryExpression2919 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_primaryExpression2922 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _PARAM_in_primaryExpression2930 = new BitSet(new ulong[]{0x2UL,0x8000000UL});
-		public static readonly BitSet _NUM_INT_in_primaryExpression2934 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _expression_in_expressionOrVector2952 = new BitSet(new ulong[]{0x1000002UL});
-		public static readonly BitSet _vectorExpr_in_expressionOrVector2958 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _COMMA_in_vectorExpr2995 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_vectorExpr2998 = new BitSet(new ulong[]{0x1000002UL});
-		public static readonly BitSet _COMMA_in_vectorExpr3001 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_vectorExpr3004 = new BitSet(new ulong[]{0x1000002UL});
-		public static readonly BitSet _identifier_in_identPrimary3020 = new BitSet(new ulong[]{0x200000002UL,0x100000000UL});
-		public static readonly BitSet _DOT_in_identPrimary3038 = new BitSet(new ulong[]{0x80000000000000UL,0x20000000UL});
-		public static readonly BitSet _identifier_in_identPrimary3043 = new BitSet(new ulong[]{0x200000002UL,0x100000000UL});
-		public static readonly BitSet _OBJECT_in_identPrimary3049 = new BitSet(new ulong[]{0x200000002UL,0x100000000UL});
-		public static readonly BitSet _OPEN_in_identPrimary3067 = new BitSet(new ulong[]{0x1081121410A54940UL,0x32404C11F899080UL});
-		public static readonly BitSet _exprList_in_identPrimary3072 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_identPrimary3074 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _aggregate_in_identPrimary3090 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _SUM_in_aggregate3111 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _AVG_in_aggregate3117 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _MAX_in_aggregate3123 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _MIN_in_aggregate3129 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _OPEN_in_aggregate3133 = new BitSet(new ulong[]{0x1080121410840940UL,0x22404C11F819000UL});
-		public static readonly BitSet _additiveExpression_in_aggregate3135 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_aggregate3137 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _COUNT_in_aggregate3156 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _OPEN_in_aggregate3158 = new BitSet(new ulong[]{0x1080000480000040UL,0x10000000000000UL});
-		public static readonly BitSet _STAR_in_aggregate3164 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _aggregateDistinctAll_in_aggregate3170 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_aggregate3174 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _collectionExpr_in_aggregate3206 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _path_in_aggregateDistinctAll3232 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _collectionExpr_in_aggregateDistinctAll3236 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _ELEMENTS_in_collectionExpr3255 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _INDICES_in_collectionExpr3260 = new BitSet(new ulong[]{0x0UL,0x100000000UL});
-		public static readonly BitSet _OPEN_in_collectionExpr3264 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _path_in_collectionExpr3267 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _CLOSE_in_collectionExpr3269 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _collectionExpr_in_compoundExpr3324 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _path_in_compoundExpr3329 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _OPEN_in_compoundExpr3335 = new BitSet(new ulong[]{0x10A9121410844940UL,0x26644C91F899000UL,0x4UL});
-		public static readonly BitSet _subQuery_in_compoundExpr3340 = new BitSet(new ulong[]{0x200000UL});
-		public static readonly BitSet _expression_in_compoundExpr3345 = new BitSet(new ulong[]{0x1200000UL});
-		public static readonly BitSet _COMMA_in_compoundExpr3348 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_compoundExpr3351 = new BitSet(new ulong[]{0x1200000UL});
-		public static readonly BitSet _CLOSE_in_compoundExpr3358 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _TRAILING_in_exprList3377 = new BitSet(new ulong[]{0x1081121410844942UL,0x22404C11F899000UL});
-		public static readonly BitSet _LEADING_in_exprList3390 = new BitSet(new ulong[]{0x1081121410844942UL,0x22404C11F899000UL});
-		public static readonly BitSet _BOTH_in_exprList3403 = new BitSet(new ulong[]{0x1081121410844942UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_exprList3427 = new BitSet(new ulong[]{0x1000001000202UL});
-		public static readonly BitSet _COMMA_in_exprList3432 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_exprList3435 = new BitSet(new ulong[]{0x1000002UL});
-		public static readonly BitSet _FROM_in_exprList3450 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_exprList3452 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _AS_in_exprList3464 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _identifier_in_exprList3467 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _FROM_in_exprList3481 = new BitSet(new ulong[]{0x1080121410844940UL,0x22404C11F899000UL});
-		public static readonly BitSet _expression_in_exprList3483 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _innerSubQuery_in_subQuery3503 = new BitSet(new ulong[]{0x2UL,0x1000000000000000UL});
-		public static readonly BitSet _UNION_in_subQuery3506 = new BitSet(new ulong[]{0x29000000000000UL,0x42400800000000UL,0x4UL});
-		public static readonly BitSet _innerSubQuery_in_subQuery3509 = new BitSet(new ulong[]{0x2UL,0x1000000000000000UL});
-		public static readonly BitSet _queryRule_in_innerSubQuery3523 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _identifier_in_path3611 = new BitSet(new ulong[]{0x200000002UL});
-		public static readonly BitSet _DOT_in_path3615 = new BitSet(new ulong[]{0x80000000000000UL});
-		public static readonly BitSet _identifier_in_path3620 = new BitSet(new ulong[]{0x200000002UL});
-		public static readonly BitSet _IDENT_in_identifier3636 = new BitSet(new ulong[]{0x2UL});
-	}
-	#endregion Follow sets
-}
-
-} // namespace  NHibernate.Hql.Ast.ANTLR 
diff --git a/src/NHibernate/Hql/Ast/ANTLR/Generated/HqlSqlWalker.cs b/src/NHibernate/Hql/Ast/ANTLR/Generated/HqlSqlWalker.cs
deleted file mode 100644
index f5fd6291738..00000000000
--- a/src/NHibernate/Hql/Ast/ANTLR/Generated/HqlSqlWalker.cs
+++ /dev/null
@@ -1,12398 +0,0 @@
-//------------------------------------------------------------------------------
-// <auto-generated>
-//     This code was generated by a tool.
-//     ANTLR Version: 3.5.0.2
-//
-//     Changes to this file may cause incorrect behavior and will be lost if
-//     the code is regenerated.
-// </auto-generated>
-//------------------------------------------------------------------------------
-
-// $ANTLR 3.5.0.2 HqlSqlWalker.g 2016-04-29 17:08:21
-
-// The variable 'variable' is assigned but its value is never used.
-#pragma warning disable 219
-// Unreachable code detected.
-#pragma warning disable 162
-// Missing XML comment for publicly visible type or member 'Type_or_Member'
-#pragma warning disable 1591
-// CLS compliance checking will not be performed on 'type' because it is not visible from outside this assembly.
-#pragma warning disable 3019
-
-
-using System;
-using System.Text;
-using NHibernate.Hql.Ast.ANTLR.Tree;
-
-
-using System.Collections.Generic;
-using Antlr.Runtime;
-using Antlr.Runtime.Misc;
-using Antlr.Runtime.Tree;
-using RewriteRuleITokenStream = Antlr.Runtime.Tree.RewriteRuleTokenStream;
-
-
-
-namespace  NHibernate.Hql.Ast.ANTLR 
-{
-[System.CodeDom.Compiler.GeneratedCode("ANTLR", "3.5.0.2")]
-[System.CLSCompliant(false)]
-public partial class HqlSqlWalker : Antlr.Runtime.Tree.TreeParser
-{
-	internal static readonly string[] tokenNames = new string[] {
-		"<invalid>", "<EOR>", "<DOWN>", "<UP>", "AGGREGATE", "ALIAS", "ALL", "AND", "ANY", "AS", "ASCENDING", "AVG", "BAND", "BETWEEN", "BNOT", "BOR", "BOTH", "BXOR", "CASE", "CASE2", "CLASS", "CLOSE", "CLOSE_BRACKET", "COLON", "COMMA", "CONCAT", "CONSTANT", "CONSTRUCTOR", "COUNT", "DELETE", "DESCENDING", "DISTINCT", "DIV", "DOT", "ELEMENTS", "ELSE", "EMPTY", "END", "EQ", "ESCAPE", "ESCqs", "EXISTS", "EXPONENT", "EXPR_LIST", "FALSE", "FETCH", "FILTER_ENTITY", "FLOAT_SUFFIX", "FROM", "FULL", "GE", "GROUP", "GT", "HAVING", "HEX_DIGIT", "IDENT", "ID_LETTER", "ID_START_LETTER", "IN", "INDEX_OP", "INDICES", "INNER", "INSERT", "INTO", "IN_LIST", "IS", "IS_NOT_NULL", "IS_NULL", "JAVA_CONSTANT", "JOIN", "LE", "LEADING", "LEFT", "LIKE", "LITERAL_by", "LT", "MAX", "MEMBER", "METHOD_CALL", "MIN", "MINUS", "NE", "NEW", "NOT", "NOT_BETWEEN", "NOT_IN", "NOT_LIKE", "NULL", "NUM_DECIMAL", "NUM_DOUBLE", "NUM_FLOAT", "NUM_INT", "NUM_LONG", "OBJECT", "OF", "ON", "OPEN", "OPEN_BRACKET", "OR", "ORDER", "ORDER_ELEMENT", "OUTER", "PARAM", "PLUS", "PROPERTIES", "QUERY", "QUOTED_String", "RANGE", "RIGHT", "ROW_STAR", "SELECT", "SELECT_FROM", "SET", "SKIP", "SOME", "SQL_NE", "STAR", "SUM", "TAKE", "THEN", "TRAILING", "TRUE", "UNARY_MINUS", "UNARY_PLUS", "UNION", "UPDATE", "VECTOR_EXPR", "VERSIONED", "WEIRD_IDENT", "WHEN", "WHERE", "WITH", "WS", "'ascending'", "'descending'", "ALIAS_REF", "BOGUS", "FILTERS", "FROM_FRAGMENT", "IMPLIED_FROM", "JOIN_FRAGMENT", "LEFT_OUTER", "METHOD_NAME", "NAMED_PARAM", "PROPERTY_REF", "RESULT_VARIABLE_REF", "RIGHT_OUTER", "SELECT_CLAUSE", "SELECT_COLUMNS", "SELECT_EXPR", "SQL_TOKEN", "THETA_JOINS"
-	};
-	public const int EOF=-1;
-	public const int AGGREGATE=4;
-	public const int ALIAS=5;
-	public const int ALL=6;
-	public const int AND=7;
-	public const int ANY=8;
-	public const int AS=9;
-	public const int ASCENDING=10;
-	public const int AVG=11;
-	public const int BAND=12;
-	public const int BETWEEN=13;
-	public const int BNOT=14;
-	public const int BOR=15;
-	public const int BOTH=16;
-	public const int BXOR=17;
-	public const int CASE=18;
-	public const int CASE2=19;
-	public const int CLASS=20;
-	public const int CLOSE=21;
-	public const int CLOSE_BRACKET=22;
-	public const int COLON=23;
-	public const int COMMA=24;
-	public const int CONCAT=25;
-	public const int CONSTANT=26;
-	public const int CONSTRUCTOR=27;
-	public const int COUNT=28;
-	public const int DELETE=29;
-	public const int DESCENDING=30;
-	public const int DISTINCT=31;
-	public const int DIV=32;
-	public const int DOT=33;
-	public const int ELEMENTS=34;
-	public const int ELSE=35;
-	public const int EMPTY=36;
-	public const int END=37;
-	public const int EQ=38;
-	public const int ESCAPE=39;
-	public const int ESCqs=40;
-	public const int EXISTS=41;
-	public const int EXPONENT=42;
-	public const int EXPR_LIST=43;
-	public const int FALSE=44;
-	public const int FETCH=45;
-	public const int FILTER_ENTITY=46;
-	public const int FLOAT_SUFFIX=47;
-	public const int FROM=48;
-	public const int FULL=49;
-	public const int GE=50;
-	public const int GROUP=51;
-	public const int GT=52;
-	public const int HAVING=53;
-	public const int HEX_DIGIT=54;
-	public const int IDENT=55;
-	public const int ID_LETTER=56;
-	public const int ID_START_LETTER=57;
-	public const int IN=58;
-	public const int INDEX_OP=59;
-	public const int INDICES=60;
-	public const int INNER=61;
-	public const int INSERT=62;
-	public const int INTO=63;
-	public const int IN_LIST=64;
-	public const int IS=65;
-	public const int IS_NOT_NULL=66;
-	public const int IS_NULL=67;
-	public const int JAVA_CONSTANT=68;
-	public const int JOIN=69;
-	public const int LE=70;
-	public const int LEADING=71;
-	public const int LEFT=72;
-	public const int LIKE=73;
-	public const int LITERAL_by=74;
-	public const int LT=75;
-	public const int MAX=76;
-	public const int MEMBER=77;
-	public const int METHOD_CALL=78;
-	public const int MIN=79;
-	public const int MINUS=80;
-	public const int NE=81;
-	public const int NEW=82;
-	public const int NOT=83;
-	public const int NOT_BETWEEN=84;
-	public const int NOT_IN=85;
-	public const int NOT_LIKE=86;
-	public const int NULL=87;
-	public const int NUM_DECIMAL=88;
-	public const int NUM_DOUBLE=89;
-	public const int NUM_FLOAT=90;
-	public const int NUM_INT=91;
-	public const int NUM_LONG=92;
-	public const int OBJECT=93;
-	public const int OF=94;
-	public const int ON=95;
-	public const int OPEN=96;
-	public const int OPEN_BRACKET=97;
-	public const int OR=98;
-	public const int ORDER=99;
-	public const int ORDER_ELEMENT=100;
-	public const int OUTER=101;
-	public const int PARAM=102;
-	public const int PLUS=103;
-	public const int PROPERTIES=104;
-	public const int QUERY=105;
-	public const int QUOTED_String=106;
-	public const int RANGE=107;
-	public const int RIGHT=108;
-	public const int ROW_STAR=109;
-	public const int SELECT=110;
-	public const int SELECT_FROM=111;
-	public const int SET=112;
-	public const int SKIP=113;
-	public const int SOME=114;
-	public const int SQL_NE=115;
-	public const int STAR=116;
-	public const int SUM=117;
-	public const int TAKE=118;
-	public const int THEN=119;
-	public const int TRAILING=120;
-	public const int TRUE=121;
-	public const int UNARY_MINUS=122;
-	public const int UNARY_PLUS=123;
-	public const int UNION=124;
-	public const int UPDATE=125;
-	public const int VECTOR_EXPR=126;
-	public const int VERSIONED=127;
-	public const int WEIRD_IDENT=128;
-	public const int WHEN=129;
-	public const int WHERE=130;
-	public const int WITH=131;
-	public const int WS=132;
-	public const int T__133=133;
-	public const int T__134=134;
-	public const int ALIAS_REF=135;
-	public const int BOGUS=136;
-	public const int FILTERS=137;
-	public const int FROM_FRAGMENT=138;
-	public const int IMPLIED_FROM=139;
-	public const int JOIN_FRAGMENT=140;
-	public const int LEFT_OUTER=141;
-	public const int METHOD_NAME=142;
-	public const int NAMED_PARAM=143;
-	public const int PROPERTY_REF=144;
-	public const int RESULT_VARIABLE_REF=145;
-	public const int RIGHT_OUTER=146;
-	public const int SELECT_CLAUSE=147;
-	public const int SELECT_COLUMNS=148;
-	public const int SELECT_EXPR=149;
-	public const int SQL_TOKEN=150;
-	public const int THETA_JOINS=151;
-
-	public HqlSqlWalker(ITreeNodeStream input)
-		: this(input, new RecognizerSharedState())
-	{
-	}
-	public HqlSqlWalker(ITreeNodeStream input, RecognizerSharedState state)
-		: base(input, state)
-	{
-		ITreeAdaptor treeAdaptor = default(ITreeAdaptor);
-		CreateTreeAdaptor(ref treeAdaptor);
-		TreeAdaptor = treeAdaptor ?? new CommonTreeAdaptor();
-		OnCreated();
-	}
-	// Implement this function in your helper file to use a custom tree adaptor
-	partial void CreateTreeAdaptor(ref ITreeAdaptor adaptor);
-
-	private ITreeAdaptor adaptor;
-
-	public ITreeAdaptor TreeAdaptor
-	{
-		get
-		{
-			return adaptor;
-		}
-
-		set
-		{
-			this.adaptor = value;
-		}
-	}
-
-	public override string[] TokenNames { get { return HqlSqlWalker.tokenNames; } }
-	public override string GrammarFileName { get { return "HqlSqlWalker.g"; } }
-
-
-	partial void OnCreated();
-	partial void EnterRule(string ruleName, int ruleIndex);
-	partial void LeaveRule(string ruleName, int ruleIndex);
-
-	#region Rules
-	partial void EnterRule_statement();
-	partial void LeaveRule_statement();
-	// $ANTLR start "statement"
-	// HqlSqlWalker.g:43:8: public statement : ( selectStatement | updateStatement | deleteStatement | insertStatement );
-	[GrammarRule("statement")]
-	public AstTreeRuleReturnScope<IASTNode, IASTNode> statement()
-	{
-		EnterRule_statement();
-		EnterRule("statement", 1);
-		TraceIn("statement", 1);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> selectStatement1 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> updateStatement2 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> deleteStatement3 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> insertStatement4 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "statement");
-		DebugLocation(43, 1);
-		try
-		{
-			// HqlSqlWalker.g:44:2: ( selectStatement | updateStatement | deleteStatement | insertStatement )
-			int alt1=4;
-			try { DebugEnterDecision(1, false);
-			switch (input.LA(1))
-			{
-			case QUERY:
-			case UNION:
-				{
-				alt1 = 1;
-				}
-				break;
-			case UPDATE:
-				{
-				alt1 = 2;
-				}
-				break;
-			case DELETE:
-				{
-				alt1 = 3;
-				}
-				break;
-			case INSERT:
-				{
-				alt1 = 4;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 1, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(1); }
-			switch (alt1)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:44:4: selectStatement
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(44, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._selectStatement_in_statement202);
-				selectStatement1=selectStatement();
-				PopFollow();
-
-				adaptor.AddChild(root_0, selectStatement1.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:44:22: updateStatement
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(44, 22);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._updateStatement_in_statement206);
-				updateStatement2=updateStatement();
-				PopFollow();
-
-				adaptor.AddChild(root_0, updateStatement2.Tree);
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:44:40: deleteStatement
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(44, 40);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._deleteStatement_in_statement210);
-				deleteStatement3=deleteStatement();
-				PopFollow();
-
-				adaptor.AddChild(root_0, deleteStatement3.Tree);
-
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// HqlSqlWalker.g:44:58: insertStatement
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(44, 58);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._insertStatement_in_statement214);
-				insertStatement4=insertStatement();
-				PopFollow();
-
-				adaptor.AddChild(root_0, insertStatement4.Tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("statement", 1);
-			LeaveRule("statement", 1);
-			LeaveRule_statement();
-		}
-		DebugLocation(45, 1);
-		} finally { DebugExitRule(GrammarFileName, "statement"); }
-		return retval;
-
-	}
-	// $ANTLR end "statement"
-
-	partial void EnterRule_selectStatement();
-	partial void LeaveRule_selectStatement();
-	// $ANTLR start "selectStatement"
-	// HqlSqlWalker.g:47:1: selectStatement : query ;
-	[GrammarRule("selectStatement")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> selectStatement()
-	{
-		EnterRule_selectStatement();
-		EnterRule("selectStatement", 2);
-		TraceIn("selectStatement", 2);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> query5 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-
-				PrepareFilterParameter();
-			
-		try { DebugEnterRule(GrammarFileName, "selectStatement");
-		DebugLocation(47, 1);
-		try
-		{
-			// HqlSqlWalker.g:51:2: ( query )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:51:4: query
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(51, 4);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._query_in_selectStatement231);
-			query5=query();
-			PopFollow();
-
-			adaptor.AddChild(root_0, query5.Tree);
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("selectStatement", 2);
-			LeaveRule("selectStatement", 2);
-			LeaveRule_selectStatement();
-		}
-		DebugLocation(52, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectStatement"); }
-		return retval;
-
-	}
-	// $ANTLR end "selectStatement"
-
-	partial void EnterRule_updateStatement();
-	partial void LeaveRule_updateStatement();
-	// $ANTLR start "updateStatement"
-	// HqlSqlWalker.g:57:1: updateStatement : ^(u= UPDATE (v= VERSIONED )? f= fromClause s= setClause (w= whereClause )? ) -> ^( $u $f $s ( $w)? ) ;
-	[GrammarRule("updateStatement")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> updateStatement()
-	{
-		EnterRule_updateStatement();
-		EnterRule("updateStatement", 3);
-		TraceIn("updateStatement", 3);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode u = default(IASTNode);
-		IASTNode v = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> f = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> s = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> w = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode u_tree = default(IASTNode);
-		IASTNode v_tree = default(IASTNode);
-		RewriteRuleNodeStream stream_UPDATE=new RewriteRuleNodeStream(adaptor,"token UPDATE");
-		RewriteRuleNodeStream stream_VERSIONED=new RewriteRuleNodeStream(adaptor,"token VERSIONED");
-		RewriteRuleSubtreeStream stream_fromClause=new RewriteRuleSubtreeStream(adaptor,"rule fromClause");
-		RewriteRuleSubtreeStream stream_setClause=new RewriteRuleSubtreeStream(adaptor,"rule setClause");
-		RewriteRuleSubtreeStream stream_whereClause=new RewriteRuleSubtreeStream(adaptor,"rule whereClause");
-		try { DebugEnterRule(GrammarFileName, "updateStatement");
-		DebugLocation(57, 1);
-		try
-		{
-			// HqlSqlWalker.g:64:2: ( ^(u= UPDATE (v= VERSIONED )? f= fromClause s= setClause (w= whereClause )? ) -> ^( $u $f $s ( $w)? ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:64:4: ^(u= UPDATE (v= VERSIONED )? f= fromClause s= setClause (w= whereClause )? )
-			{
-			DebugLocation(64, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(64, 8);
-
-			_last = (IASTNode)input.LT(1);
-			u=(IASTNode)Match(input,UPDATE,Follow._UPDATE_in_updateStatement255); 
-			 
-			stream_UPDATE.Add(u);
-
-
-			DebugLocation(64, 16);
-			 BeforeStatement( "update", UPDATE ); 
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(64, 57);
-			// HqlSqlWalker.g:64:57: (v= VERSIONED )?
-			int alt2=2;
-			try { DebugEnterSubRule(2);
-			try { DebugEnterDecision(2, false);
-			int LA2_1 = input.LA(1);
-
-			if ((LA2_1==VERSIONED))
-			{
-				alt2 = 1;
-			}
-			} finally { DebugExitDecision(2); }
-			switch (alt2)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:64:58: v= VERSIONED
-				{
-				DebugLocation(64, 59);
-
-				_last = (IASTNode)input.LT(1);
-				v=(IASTNode)Match(input,VERSIONED,Follow._VERSIONED_in_updateStatement262); 
-				 
-				stream_VERSIONED.Add(v);
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(2); }
-
-			DebugLocation(64, 73);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._fromClause_in_updateStatement268);
-			f=fromClause();
-			PopFollow();
-
-			stream_fromClause.Add(f.Tree);
-			DebugLocation(64, 86);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._setClause_in_updateStatement272);
-			s=setClause();
-			PopFollow();
-
-			stream_setClause.Add(s.Tree);
-			DebugLocation(64, 97);
-			// HqlSqlWalker.g:64:97: (w= whereClause )?
-			int alt3=2;
-			try { DebugEnterSubRule(3);
-			try { DebugEnterDecision(3, false);
-			int LA3_1 = input.LA(1);
-
-			if ((LA3_1==WHERE))
-			{
-				alt3 = 1;
-			}
-			} finally { DebugExitDecision(3); }
-			switch (alt3)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:64:98: w= whereClause
-				{
-				DebugLocation(64, 99);
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._whereClause_in_updateStatement277);
-				w=whereClause();
-				PopFollow();
-
-				stream_whereClause.Add(w.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(3); }
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-
-			{
-			// AST REWRITE
-			// elements: u, f, s, w
-			// token labels: u
-			// rule labels: f, s, w, retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleNodeStream stream_u=new RewriteRuleNodeStream(adaptor,"token u",u);
-			RewriteRuleSubtreeStream stream_f=new RewriteRuleSubtreeStream(adaptor,"rule f",f!=null?f.Tree:null);
-			RewriteRuleSubtreeStream stream_s=new RewriteRuleSubtreeStream(adaptor,"rule s",s!=null?s.Tree:null);
-			RewriteRuleSubtreeStream stream_w=new RewriteRuleSubtreeStream(adaptor,"rule w",w!=null?w.Tree:null);
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 65:3: -> ^( $u $f $s ( $w)? )
-			{
-				DebugLocation(65, 6);
-				// HqlSqlWalker.g:65:6: ^( $u $f $s ( $w)? )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(65, 9);
-				root_1 = (IASTNode)adaptor.BecomeRoot(stream_u.NextNode(), root_1);
-
-				DebugLocation(65, 12);
-				adaptor.AddChild(root_1, stream_f.NextTree());
-				DebugLocation(65, 15);
-				adaptor.AddChild(root_1, stream_s.NextTree());
-				DebugLocation(65, 18);
-				// HqlSqlWalker.g:65:18: ( $w)?
-				if (stream_w.HasNext)
-				{
-					DebugLocation(65, 18);
-					adaptor.AddChild(root_1, stream_w.NextTree());
-
-				}
-				stream_w.Reset();
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-					BeforeStatementCompletion( "update" );
-					PrepareVersioned( retval.Tree, v );
-					PostProcessUpdate( retval.Tree );
-					AfterStatementCompletion( "update" );
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("updateStatement", 3);
-			LeaveRule("updateStatement", 3);
-			LeaveRule_updateStatement();
-		}
-		DebugLocation(66, 1);
-		} finally { DebugExitRule(GrammarFileName, "updateStatement"); }
-		return retval;
-
-	}
-	// $ANTLR end "updateStatement"
-
-	partial void EnterRule_deleteStatement();
-	partial void LeaveRule_deleteStatement();
-	// $ANTLR start "deleteStatement"
-	// HqlSqlWalker.g:68:1: deleteStatement : ^( DELETE fromClause ( whereClause )? ) ;
-	[GrammarRule("deleteStatement")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> deleteStatement()
-	{
-		EnterRule_deleteStatement();
-		EnterRule("deleteStatement", 4);
-		TraceIn("deleteStatement", 4);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode DELETE6 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> fromClause7 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> whereClause8 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode DELETE6_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "deleteStatement");
-		DebugLocation(68, 1);
-		try
-		{
-			// HqlSqlWalker.g:74:2: ( ^( DELETE fromClause ( whereClause )? ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:74:4: ^( DELETE fromClause ( whereClause )? )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(74, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(74, 7);
-
-			_last = (IASTNode)input.LT(1);
-			DELETE6=(IASTNode)Match(input,DELETE,Follow._DELETE_in_deleteStatement320); 
-			DELETE6_tree = (IASTNode)adaptor.DupNode(DELETE6);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(DELETE6_tree, root_1);
-
-
-			DebugLocation(74, 14);
-			 BeforeStatement( "delete", DELETE ); 
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(74, 55);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._fromClause_in_deleteStatement324);
-			fromClause7=fromClause();
-			PopFollow();
-
-			adaptor.AddChild(root_1, fromClause7.Tree);
-
-			DebugLocation(74, 66);
-			// HqlSqlWalker.g:74:66: ( whereClause )?
-			int alt4=2;
-			try { DebugEnterSubRule(4);
-			try { DebugEnterDecision(4, false);
-			int LA4_1 = input.LA(1);
-
-			if ((LA4_1==WHERE))
-			{
-				alt4 = 1;
-			}
-			} finally { DebugExitDecision(4); }
-			switch (alt4)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:74:67: whereClause
-				{
-				DebugLocation(74, 67);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._whereClause_in_deleteStatement327);
-				whereClause8=whereClause();
-				PopFollow();
-
-				adaptor.AddChild(root_1, whereClause8.Tree);
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(4); }
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-					BeforeStatementCompletion( "delete" );
-					PostProcessDelete( retval.Tree );
-					AfterStatementCompletion( "delete" );
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("deleteStatement", 4);
-			LeaveRule("deleteStatement", 4);
-			LeaveRule_deleteStatement();
-		}
-		DebugLocation(75, 1);
-		} finally { DebugExitRule(GrammarFileName, "deleteStatement"); }
-		return retval;
-
-	}
-	// $ANTLR end "deleteStatement"
-
-	partial void EnterRule_insertStatement();
-	partial void LeaveRule_insertStatement();
-	// $ANTLR start "insertStatement"
-	// HqlSqlWalker.g:77:1: insertStatement : ^( INSERT intoClause query ) ;
-	[GrammarRule("insertStatement")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> insertStatement()
-	{
-		EnterRule_insertStatement();
-		EnterRule("insertStatement", 5);
-		TraceIn("insertStatement", 5);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode INSERT9 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> intoClause10 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> query11 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode INSERT9_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "insertStatement");
-		DebugLocation(77, 1);
-		try
-		{
-			// HqlSqlWalker.g:86:2: ( ^( INSERT intoClause query ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:86:4: ^( INSERT intoClause query )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(86, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(86, 7);
-
-			_last = (IASTNode)input.LT(1);
-			INSERT9=(IASTNode)Match(input,INSERT,Follow._INSERT_in_insertStatement357); 
-			INSERT9_tree = (IASTNode)adaptor.DupNode(INSERT9);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(INSERT9_tree, root_1);
-
-
-			DebugLocation(86, 14);
-			 BeforeStatement( "insert", INSERT ); 
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(86, 55);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._intoClause_in_insertStatement361);
-			intoClause10=intoClause();
-			PopFollow();
-
-			adaptor.AddChild(root_1, intoClause10.Tree);
-
-			DebugLocation(86, 66);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._query_in_insertStatement363);
-			query11=query();
-			PopFollow();
-
-			adaptor.AddChild(root_1, query11.Tree);
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-					BeforeStatementCompletion( "insert" );
-					PostProcessInsert( retval.Tree );
-					AfterStatementCompletion( "insert" );
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("insertStatement", 5);
-			LeaveRule("insertStatement", 5);
-			LeaveRule_insertStatement();
-		}
-		DebugLocation(87, 1);
-		} finally { DebugExitRule(GrammarFileName, "insertStatement"); }
-		return retval;
-
-	}
-	// $ANTLR end "insertStatement"
-
-	partial void EnterRule_intoClause();
-	partial void LeaveRule_intoClause();
-	// $ANTLR start "intoClause"
-	// HqlSqlWalker.g:89:1: intoClause : ^( INTO (p= path ) ps= insertablePropertySpec ) ;
-	[GrammarRule("intoClause")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> intoClause()
-	{
-		EnterRule_intoClause();
-		EnterRule("intoClause", 6);
-		TraceIn("intoClause", 6);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode INTO12 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> p = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> ps = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode INTO12_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "intoClause");
-		DebugLocation(89, 1);
-		try
-		{
-			// HqlSqlWalker.g:93:2: ( ^( INTO (p= path ) ps= insertablePropertySpec ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:93:4: ^( INTO (p= path ) ps= insertablePropertySpec )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(93, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(93, 7);
-
-			_last = (IASTNode)input.LT(1);
-			INTO12=(IASTNode)Match(input,INTO,Follow._INTO_in_intoClause387); 
-			INTO12_tree = (IASTNode)adaptor.DupNode(INTO12);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(INTO12_tree, root_1);
-
-
-			DebugLocation(93, 12);
-			 HandleClauseStart( INTO ); 
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(93, 43);
-			// HqlSqlWalker.g:93:43: (p= path )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:93:44: p= path
-			{
-			DebugLocation(93, 45);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._path_in_intoClause394);
-			p=path();
-			PopFollow();
-
-			adaptor.AddChild(root_1, p.Tree);
-
-
-			}
-
-			DebugLocation(93, 54);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._insertablePropertySpec_in_intoClause399);
-			ps=insertablePropertySpec();
-			PopFollow();
-
-			adaptor.AddChild(root_1, ps.Tree);
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-					retval.Tree =  CreateIntoClause((p!=null?((HqlSqlWalker.path_return)p).p:default(String)), (ps!=null?((IASTNode)ps.Tree):default(IASTNode)));
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("intoClause", 6);
-			LeaveRule("intoClause", 6);
-			LeaveRule_intoClause();
-		}
-		DebugLocation(94, 1);
-		} finally { DebugExitRule(GrammarFileName, "intoClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "intoClause"
-
-	partial void EnterRule_insertablePropertySpec();
-	partial void LeaveRule_insertablePropertySpec();
-	// $ANTLR start "insertablePropertySpec"
-	// HqlSqlWalker.g:96:1: insertablePropertySpec : ^( RANGE ( IDENT )+ ) ;
-	[GrammarRule("insertablePropertySpec")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> insertablePropertySpec()
-	{
-		EnterRule_insertablePropertySpec();
-		EnterRule("insertablePropertySpec", 7);
-		TraceIn("insertablePropertySpec", 7);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode RANGE13 = default(IASTNode);
-		IASTNode IDENT14 = default(IASTNode);
-
-		IASTNode RANGE13_tree = default(IASTNode);
-		IASTNode IDENT14_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "insertablePropertySpec");
-		DebugLocation(96, 1);
-		try
-		{
-			// HqlSqlWalker.g:97:2: ( ^( RANGE ( IDENT )+ ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:97:4: ^( RANGE ( IDENT )+ )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(97, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(97, 7);
-
-			_last = (IASTNode)input.LT(1);
-			RANGE13=(IASTNode)Match(input,RANGE,Follow._RANGE_in_insertablePropertySpec415); 
-			RANGE13_tree = (IASTNode)adaptor.DupNode(RANGE13);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(RANGE13_tree, root_1);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(97, 13);
-			// HqlSqlWalker.g:97:13: ( IDENT )+
-			int cnt5=0;
-			try { DebugEnterSubRule(5);
-			while (true)
-			{
-				int alt5=2;
-				try { DebugEnterDecision(5, false);
-				int LA5_1 = input.LA(1);
-
-				if ((LA5_1==IDENT))
-				{
-					alt5 = 1;
-				}
-
-
-				} finally { DebugExitDecision(5); }
-				switch (alt5)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:97:14: IDENT
-					{
-					DebugLocation(97, 14);
-
-					_last = (IASTNode)input.LT(1);
-					IDENT14=(IASTNode)Match(input,IDENT,Follow._IDENT_in_insertablePropertySpec418); 
-					IDENT14_tree = (IASTNode)adaptor.DupNode(IDENT14);
-
-
-					adaptor.AddChild(root_1, IDENT14_tree);
-
-
-					}
-					break;
-
-				default:
-					if (cnt5 >= 1)
-						goto loop5;
-
-					EarlyExitException eee5 = new EarlyExitException( 5, input );
-					DebugRecognitionException(eee5);
-					throw eee5;
-				}
-				cnt5++;
-			}
-			loop5:
-				;
-
-			} finally { DebugExitSubRule(5); }
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("insertablePropertySpec", 7);
-			LeaveRule("insertablePropertySpec", 7);
-			LeaveRule_insertablePropertySpec();
-		}
-		DebugLocation(98, 1);
-		} finally { DebugExitRule(GrammarFileName, "insertablePropertySpec"); }
-		return retval;
-
-	}
-	// $ANTLR end "insertablePropertySpec"
-
-	partial void EnterRule_setClause();
-	partial void LeaveRule_setClause();
-	// $ANTLR start "setClause"
-	// HqlSqlWalker.g:100:1: setClause : ^( SET ( assignment )* ) ;
-	[GrammarRule("setClause")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> setClause()
-	{
-		EnterRule_setClause();
-		EnterRule("setClause", 8);
-		TraceIn("setClause", 8);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode SET15 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> assignment16 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode SET15_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "setClause");
-		DebugLocation(100, 1);
-		try
-		{
-			// HqlSqlWalker.g:101:2: ( ^( SET ( assignment )* ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:101:4: ^( SET ( assignment )* )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(101, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(101, 7);
-
-			_last = (IASTNode)input.LT(1);
-			SET15=(IASTNode)Match(input,SET,Follow._SET_in_setClause435); 
-			SET15_tree = (IASTNode)adaptor.DupNode(SET15);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(SET15_tree, root_1);
-
-
-			DebugLocation(101, 11);
-			 HandleClauseStart( SET ); 
-
-			if (input.LA(1) == TokenTypes.Down) {
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(101, 41);
-				// HqlSqlWalker.g:101:41: ( assignment )*
-				try { DebugEnterSubRule(6);
-				while (true)
-				{
-					int alt6=2;
-					try { DebugEnterDecision(6, false);
-					int LA6_1 = input.LA(1);
-
-					if ((LA6_1==EQ))
-					{
-						alt6 = 1;
-					}
-
-
-					} finally { DebugExitDecision(6); }
-					switch ( alt6 )
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// HqlSqlWalker.g:101:42: assignment
-						{
-						DebugLocation(101, 42);
-
-						_last = (IASTNode)input.LT(1);
-						PushFollow(Follow._assignment_in_setClause440);
-						assignment16=assignment();
-						PopFollow();
-
-						adaptor.AddChild(root_1, assignment16.Tree);
-
-
-						}
-						break;
-
-					default:
-						goto loop6;
-					}
-				}
-
-				loop6:
-					;
-
-				} finally { DebugExitSubRule(6); }
-
-
-				Match(input, TokenTypes.Up, null); 
-			}
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("setClause", 8);
-			LeaveRule("setClause", 8);
-			LeaveRule_setClause();
-		}
-		DebugLocation(102, 1);
-		} finally { DebugExitRule(GrammarFileName, "setClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "setClause"
-
-	partial void EnterRule_assignment();
-	partial void LeaveRule_assignment();
-	// $ANTLR start "assignment"
-	// HqlSqlWalker.g:104:1: assignment : ^( EQ (p= propertyRef ) ( newValue ) ) ;
-	[GrammarRule("assignment")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> assignment()
-	{
-		EnterRule_assignment();
-		EnterRule("assignment", 9);
-		TraceIn("assignment", 9);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode EQ17 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> p = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> newValue18 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode EQ17_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "assignment");
-		DebugLocation(104, 1);
-		try
-		{
-			// HqlSqlWalker.g:110:2: ( ^( EQ (p= propertyRef ) ( newValue ) ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:110:4: ^( EQ (p= propertyRef ) ( newValue ) )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(110, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(110, 7);
-
-			_last = (IASTNode)input.LT(1);
-			EQ17=(IASTNode)Match(input,EQ,Follow._EQ_in_assignment467); 
-			EQ17_tree = (IASTNode)adaptor.DupNode(EQ17);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(EQ17_tree, root_1);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(110, 10);
-			// HqlSqlWalker.g:110:10: (p= propertyRef )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:110:11: p= propertyRef
-			{
-			DebugLocation(110, 12);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._propertyRef_in_assignment472);
-			p=propertyRef();
-			PopFollow();
-
-			adaptor.AddChild(root_1, p.Tree);
-
-
-			}
-
-			DebugLocation(110, 26);
-			 Resolve((p!=null?((IASTNode)p.Tree):default(IASTNode))); 
-			DebugLocation(110, 48);
-			// HqlSqlWalker.g:110:48: ( newValue )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:110:49: newValue
-			{
-			DebugLocation(110, 49);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._newValue_in_assignment478);
-			newValue18=newValue();
-			PopFollow();
-
-			adaptor.AddChild(root_1, newValue18.Tree);
-
-
-			}
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-					EvaluateAssignment( retval.Tree );
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("assignment", 9);
-			LeaveRule("assignment", 9);
-			LeaveRule_assignment();
-		}
-		DebugLocation(111, 1);
-		} finally { DebugExitRule(GrammarFileName, "assignment"); }
-		return retval;
-
-	}
-	// $ANTLR end "assignment"
-
-	partial void EnterRule_newValue();
-	partial void LeaveRule_newValue();
-	// $ANTLR start "newValue"
-	// HqlSqlWalker.g:114:1: newValue : ( expr | query );
-	[GrammarRule("newValue")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> newValue()
-	{
-		EnterRule_newValue();
-		EnterRule("newValue", 10);
-		TraceIn("newValue", 10);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr19 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> query20 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "newValue");
-		DebugLocation(114, 1);
-		try
-		{
-			// HqlSqlWalker.g:115:2: ( expr | query )
-			int alt7=2;
-			try { DebugEnterDecision(7, false);
-			int LA7_1 = input.LA(1);
-
-			if ((LA7_1==AGGREGATE||LA7_1==BAND||(LA7_1>=BNOT && LA7_1<=BOR)||(LA7_1>=BXOR && LA7_1<=CASE2)||LA7_1==COLON||LA7_1==COUNT||(LA7_1>=DIV && LA7_1<=DOT)||LA7_1==FALSE||LA7_1==IDENT||LA7_1==INDEX_OP||LA7_1==JAVA_CONSTANT||LA7_1==METHOD_CALL||LA7_1==MINUS||(LA7_1>=NULL && LA7_1<=NUM_LONG)||(LA7_1>=PARAM && LA7_1<=PLUS)||LA7_1==QUOTED_String||LA7_1==STAR||(LA7_1>=TRUE && LA7_1<=UNARY_MINUS)||LA7_1==VECTOR_EXPR||LA7_1==WEIRD_IDENT))
-			{
-				alt7 = 1;
-			}
-			else if ((LA7_1==QUERY||LA7_1==UNION))
-			{
-				alt7 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 7, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(7); }
-			switch (alt7)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:115:4: expr
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(115, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._expr_in_newValue494);
-				expr19=expr();
-				PopFollow();
-
-				adaptor.AddChild(root_0, expr19.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:115:11: query
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(115, 11);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._query_in_newValue498);
-				query20=query();
-				PopFollow();
-
-				adaptor.AddChild(root_0, query20.Tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("newValue", 10);
-			LeaveRule("newValue", 10);
-			LeaveRule_newValue();
-		}
-		DebugLocation(116, 1);
-		} finally { DebugExitRule(GrammarFileName, "newValue"); }
-		return retval;
-
-	}
-	// $ANTLR end "newValue"
-
-	partial void EnterRule_query();
-	partial void LeaveRule_query();
-	// $ANTLR start "query"
-	// HqlSqlWalker.g:118:1: query : ( unionedQuery | ^( UNION unionedQuery query ) );
-	[GrammarRule("query")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> query()
-	{
-		EnterRule_query();
-		EnterRule("query", 11);
-		TraceIn("query", 11);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode UNION22 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> unionedQuery21 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> unionedQuery23 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> query24 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode UNION22_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "query");
-		DebugLocation(118, 1);
-		try
-		{
-			// HqlSqlWalker.g:119:2: ( unionedQuery | ^( UNION unionedQuery query ) )
-			int alt8=2;
-			try { DebugEnterDecision(8, false);
-			int LA8_1 = input.LA(1);
-
-			if ((LA8_1==QUERY))
-			{
-				alt8 = 1;
-			}
-			else if ((LA8_1==UNION))
-			{
-				alt8 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 8, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(8); }
-			switch (alt8)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:119:4: unionedQuery
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(119, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._unionedQuery_in_query509);
-				unionedQuery21=unionedQuery();
-				PopFollow();
-
-				adaptor.AddChild(root_0, unionedQuery21.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:120:4: ^( UNION unionedQuery query )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(120, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(120, 6);
-
-				_last = (IASTNode)input.LT(1);
-				UNION22=(IASTNode)Match(input,UNION,Follow._UNION_in_query516); 
-				UNION22_tree = (IASTNode)adaptor.DupNode(UNION22);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(UNION22_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(120, 12);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._unionedQuery_in_query518);
-				unionedQuery23=unionedQuery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, unionedQuery23.Tree);
-
-				DebugLocation(120, 25);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._query_in_query520);
-				query24=query();
-				PopFollow();
-
-				adaptor.AddChild(root_1, query24.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("query", 11);
-			LeaveRule("query", 11);
-			LeaveRule_query();
-		}
-		DebugLocation(121, 1);
-		} finally { DebugExitRule(GrammarFileName, "query"); }
-		return retval;
-
-	}
-	// $ANTLR end "query"
-
-	partial void EnterRule_unionedQuery();
-	partial void LeaveRule_unionedQuery();
-	// $ANTLR start "unionedQuery"
-	// HqlSqlWalker.g:125:1: unionedQuery : ^( QUERY ^( SELECT_FROM f= fromClause (s= selectClause )? ) (w= whereClause )? (g= groupClause )? (h= havingClause )? (o= orderClause )? (sk= skipClause )? (tk= takeClause )? ) -> ^( SELECT ( $s)? $f ( $w)? ( $g)? ( $h)? ( $o)? ( $sk)? ( $tk)? ) ;
-	[GrammarRule("unionedQuery")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> unionedQuery()
-	{
-		EnterRule_unionedQuery();
-		EnterRule("unionedQuery", 12);
-		TraceIn("unionedQuery", 12);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode QUERY25 = default(IASTNode);
-		IASTNode SELECT_FROM26 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> f = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> s = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> w = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> g = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> h = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> o = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> sk = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> tk = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode QUERY25_tree = default(IASTNode);
-		IASTNode SELECT_FROM26_tree = default(IASTNode);
-		RewriteRuleNodeStream stream_QUERY=new RewriteRuleNodeStream(adaptor,"token QUERY");
-		RewriteRuleNodeStream stream_SELECT_FROM=new RewriteRuleNodeStream(adaptor,"token SELECT_FROM");
-		RewriteRuleSubtreeStream stream_fromClause=new RewriteRuleSubtreeStream(adaptor,"rule fromClause");
-		RewriteRuleSubtreeStream stream_selectClause=new RewriteRuleSubtreeStream(adaptor,"rule selectClause");
-		RewriteRuleSubtreeStream stream_whereClause=new RewriteRuleSubtreeStream(adaptor,"rule whereClause");
-		RewriteRuleSubtreeStream stream_groupClause=new RewriteRuleSubtreeStream(adaptor,"rule groupClause");
-		RewriteRuleSubtreeStream stream_havingClause=new RewriteRuleSubtreeStream(adaptor,"rule havingClause");
-		RewriteRuleSubtreeStream stream_orderClause=new RewriteRuleSubtreeStream(adaptor,"rule orderClause");
-		RewriteRuleSubtreeStream stream_skipClause=new RewriteRuleSubtreeStream(adaptor,"rule skipClause");
-		RewriteRuleSubtreeStream stream_takeClause=new RewriteRuleSubtreeStream(adaptor,"rule takeClause");
-		try { DebugEnterRule(GrammarFileName, "unionedQuery");
-		DebugLocation(125, 1);
-		try
-		{
-			// HqlSqlWalker.g:132:2: ( ^( QUERY ^( SELECT_FROM f= fromClause (s= selectClause )? ) (w= whereClause )? (g= groupClause )? (h= havingClause )? (o= orderClause )? (sk= skipClause )? (tk= takeClause )? ) -> ^( SELECT ( $s)? $f ( $w)? ( $g)? ( $h)? ( $o)? ( $sk)? ( $tk)? ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:132:4: ^( QUERY ^( SELECT_FROM f= fromClause (s= selectClause )? ) (w= whereClause )? (g= groupClause )? (h= havingClause )? (o= orderClause )? (sk= skipClause )? (tk= takeClause )? )
-			{
-			DebugLocation(132, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(132, 7);
-
-			_last = (IASTNode)input.LT(1);
-			QUERY25=(IASTNode)Match(input,QUERY,Follow._QUERY_in_unionedQuery543); 
-			 
-			stream_QUERY.Add(QUERY25);
-
-
-			DebugLocation(132, 13);
-			 BeforeStatement( "select", SELECT ); 
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(134, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_2 = _last;
-			IASTNode _first_2 = default(IASTNode);
-			IASTNode root_2 = (IASTNode)adaptor.Nil();
-			DebugLocation(134, 6);
-
-			_last = (IASTNode)input.LT(1);
-			SELECT_FROM26=(IASTNode)Match(input,SELECT_FROM,Follow._SELECT_FROM_in_unionedQuery555); 
-			 
-			stream_SELECT_FROM.Add(SELECT_FROM26);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(135, 6);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._fromClause_in_unionedQuery563);
-			f=fromClause();
-			PopFollow();
-
-			stream_fromClause.Add(f.Tree);
-			DebugLocation(136, 5);
-			// HqlSqlWalker.g:136:5: (s= selectClause )?
-			int alt9=2;
-			try { DebugEnterSubRule(9);
-			try { DebugEnterDecision(9, false);
-			int LA9_1 = input.LA(1);
-
-			if ((LA9_1==SELECT))
-			{
-				alt9 = 1;
-			}
-			} finally { DebugExitDecision(9); }
-			switch (alt9)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:136:6: s= selectClause
-				{
-				DebugLocation(136, 7);
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._selectClause_in_unionedQuery572);
-				s=selectClause();
-				PopFollow();
-
-				stream_selectClause.Add(s.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(9); }
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_1, root_2);
-			_last = _save_last_2;
-			}
-
-			DebugLocation(138, 4);
-			// HqlSqlWalker.g:138:4: (w= whereClause )?
-			int alt10=2;
-			try { DebugEnterSubRule(10);
-			try { DebugEnterDecision(10, false);
-			int LA10_1 = input.LA(1);
-
-			if ((LA10_1==WHERE))
-			{
-				alt10 = 1;
-			}
-			} finally { DebugExitDecision(10); }
-			switch (alt10)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:138:5: w= whereClause
-				{
-				DebugLocation(138, 6);
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._whereClause_in_unionedQuery587);
-				w=whereClause();
-				PopFollow();
-
-				stream_whereClause.Add(w.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(10); }
-
-			DebugLocation(139, 4);
-			// HqlSqlWalker.g:139:4: (g= groupClause )?
-			int alt11=2;
-			try { DebugEnterSubRule(11);
-			try { DebugEnterDecision(11, false);
-			int LA11_1 = input.LA(1);
-
-			if ((LA11_1==GROUP))
-			{
-				alt11 = 1;
-			}
-			} finally { DebugExitDecision(11); }
-			switch (alt11)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:139:5: g= groupClause
-				{
-				DebugLocation(139, 6);
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._groupClause_in_unionedQuery597);
-				g=groupClause();
-				PopFollow();
-
-				stream_groupClause.Add(g.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(11); }
-
-			DebugLocation(140, 4);
-			// HqlSqlWalker.g:140:4: (h= havingClause )?
-			int alt12=2;
-			try { DebugEnterSubRule(12);
-			try { DebugEnterDecision(12, false);
-			int LA12_1 = input.LA(1);
-
-			if ((LA12_1==HAVING))
-			{
-				alt12 = 1;
-			}
-			} finally { DebugExitDecision(12); }
-			switch (alt12)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:140:5: h= havingClause
-				{
-				DebugLocation(140, 6);
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._havingClause_in_unionedQuery607);
-				h=havingClause();
-				PopFollow();
-
-				stream_havingClause.Add(h.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(12); }
-
-			DebugLocation(141, 4);
-			// HqlSqlWalker.g:141:4: (o= orderClause )?
-			int alt13=2;
-			try { DebugEnterSubRule(13);
-			try { DebugEnterDecision(13, false);
-			int LA13_1 = input.LA(1);
-
-			if ((LA13_1==ORDER))
-			{
-				alt13 = 1;
-			}
-			} finally { DebugExitDecision(13); }
-			switch (alt13)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:141:5: o= orderClause
-				{
-				DebugLocation(141, 6);
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._orderClause_in_unionedQuery617);
-				o=orderClause();
-				PopFollow();
-
-				stream_orderClause.Add(o.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(13); }
-
-			DebugLocation(142, 4);
-			// HqlSqlWalker.g:142:4: (sk= skipClause )?
-			int alt14=2;
-			try { DebugEnterSubRule(14);
-			try { DebugEnterDecision(14, false);
-			int LA14_1 = input.LA(1);
-
-			if ((LA14_1==SKIP))
-			{
-				alt14 = 1;
-			}
-			} finally { DebugExitDecision(14); }
-			switch (alt14)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:142:5: sk= skipClause
-				{
-				DebugLocation(142, 7);
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._skipClause_in_unionedQuery627);
-				sk=skipClause();
-				PopFollow();
-
-				stream_skipClause.Add(sk.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(14); }
-
-			DebugLocation(143, 4);
-			// HqlSqlWalker.g:143:4: (tk= takeClause )?
-			int alt15=2;
-			try { DebugEnterSubRule(15);
-			try { DebugEnterDecision(15, false);
-			int LA15_1 = input.LA(1);
-
-			if ((LA15_1==TAKE))
-			{
-				alt15 = 1;
-			}
-			} finally { DebugExitDecision(15); }
-			switch (alt15)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:143:5: tk= takeClause
-				{
-				DebugLocation(143, 7);
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._takeClause_in_unionedQuery637);
-				tk=takeClause();
-				PopFollow();
-
-				stream_takeClause.Add(tk.Tree);
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(15); }
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-
-			{
-			// AST REWRITE
-			// elements: s, f, w, g, h, o, sk, tk
-			// token labels: 
-			// rule labels: s, f, w, g, h, o, sk, tk, retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_s=new RewriteRuleSubtreeStream(adaptor,"rule s",s!=null?s.Tree:null);
-			RewriteRuleSubtreeStream stream_f=new RewriteRuleSubtreeStream(adaptor,"rule f",f!=null?f.Tree:null);
-			RewriteRuleSubtreeStream stream_w=new RewriteRuleSubtreeStream(adaptor,"rule w",w!=null?w.Tree:null);
-			RewriteRuleSubtreeStream stream_g=new RewriteRuleSubtreeStream(adaptor,"rule g",g!=null?g.Tree:null);
-			RewriteRuleSubtreeStream stream_h=new RewriteRuleSubtreeStream(adaptor,"rule h",h!=null?h.Tree:null);
-			RewriteRuleSubtreeStream stream_o=new RewriteRuleSubtreeStream(adaptor,"rule o",o!=null?o.Tree:null);
-			RewriteRuleSubtreeStream stream_sk=new RewriteRuleSubtreeStream(adaptor,"rule sk",sk!=null?sk.Tree:null);
-			RewriteRuleSubtreeStream stream_tk=new RewriteRuleSubtreeStream(adaptor,"rule tk",tk!=null?tk.Tree:null);
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 145:2: -> ^( SELECT ( $s)? $f ( $w)? ( $g)? ( $h)? ( $o)? ( $sk)? ( $tk)? )
-			{
-				DebugLocation(145, 5);
-				// HqlSqlWalker.g:145:5: ^( SELECT ( $s)? $f ( $w)? ( $g)? ( $h)? ( $o)? ( $sk)? ( $tk)? )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(145, 7);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(SELECT, "SELECT"), root_1);
-
-				DebugLocation(145, 15);
-				// HqlSqlWalker.g:145:15: ( $s)?
-				if (stream_s.HasNext)
-				{
-					DebugLocation(145, 15);
-					adaptor.AddChild(root_1, stream_s.NextTree());
-
-				}
-				stream_s.Reset();
-				DebugLocation(145, 19);
-				adaptor.AddChild(root_1, stream_f.NextTree());
-				DebugLocation(145, 22);
-				// HqlSqlWalker.g:145:22: ( $w)?
-				if (stream_w.HasNext)
-				{
-					DebugLocation(145, 22);
-					adaptor.AddChild(root_1, stream_w.NextTree());
-
-				}
-				stream_w.Reset();
-				DebugLocation(145, 26);
-				// HqlSqlWalker.g:145:26: ( $g)?
-				if (stream_g.HasNext)
-				{
-					DebugLocation(145, 26);
-					adaptor.AddChild(root_1, stream_g.NextTree());
-
-				}
-				stream_g.Reset();
-				DebugLocation(145, 30);
-				// HqlSqlWalker.g:145:30: ( $h)?
-				if (stream_h.HasNext)
-				{
-					DebugLocation(145, 30);
-					adaptor.AddChild(root_1, stream_h.NextTree());
-
-				}
-				stream_h.Reset();
-				DebugLocation(145, 34);
-				// HqlSqlWalker.g:145:34: ( $o)?
-				if (stream_o.HasNext)
-				{
-					DebugLocation(145, 34);
-					adaptor.AddChild(root_1, stream_o.NextTree());
-
-				}
-				stream_o.Reset();
-				DebugLocation(145, 38);
-				// HqlSqlWalker.g:145:38: ( $sk)?
-				if (stream_sk.HasNext)
-				{
-					DebugLocation(145, 38);
-					adaptor.AddChild(root_1, stream_sk.NextTree());
-
-				}
-				stream_sk.Reset();
-				DebugLocation(145, 43);
-				// HqlSqlWalker.g:145:43: ( $tk)?
-				if (stream_tk.HasNext)
-				{
-					DebugLocation(145, 43);
-					adaptor.AddChild(root_1, stream_tk.NextTree());
-
-				}
-				stream_tk.Reset();
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-					// Antlr note: #x_in refers to the input AST, #x refers to the output AST
-					BeforeStatementCompletion( "select" );
-					ProcessQuery( (s!=null?((IASTNode)s.Tree):default(IASTNode)), retval.Tree );
-					AfterStatementCompletion( "select" );
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("unionedQuery", 12);
-			LeaveRule("unionedQuery", 12);
-			LeaveRule_unionedQuery();
-		}
-		DebugLocation(146, 1);
-		} finally { DebugExitRule(GrammarFileName, "unionedQuery"); }
-		return retval;
-
-	}
-	// $ANTLR end "unionedQuery"
-
-	partial void EnterRule_orderClause();
-	partial void LeaveRule_orderClause();
-	// $ANTLR start "orderClause"
-	// HqlSqlWalker.g:148:1: orderClause : ^( ORDER ( orderExprs ) ) ;
-	[GrammarRule("orderClause")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> orderClause()
-	{
-		EnterRule_orderClause();
-		EnterRule("orderClause", 13);
-		TraceIn("orderClause", 13);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode ORDER27 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> orderExprs28 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode ORDER27_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "orderClause");
-		DebugLocation(148, 1);
-		try
-		{
-			// HqlSqlWalker.g:149:2: ( ^( ORDER ( orderExprs ) ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:149:4: ^( ORDER ( orderExprs ) )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(149, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(149, 6);
-
-			_last = (IASTNode)input.LT(1);
-			ORDER27=(IASTNode)Match(input,ORDER,Follow._ORDER_in_orderClause694); 
-			ORDER27_tree = (IASTNode)adaptor.DupNode(ORDER27);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(ORDER27_tree, root_1);
-
-
-			DebugLocation(149, 12);
-			 HandleClauseStart( ORDER ); 
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(149, 44);
-			// HqlSqlWalker.g:149:44: ( orderExprs )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:149:45: orderExprs
-			{
-			DebugLocation(149, 45);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._orderExprs_in_orderClause699);
-			orderExprs28=orderExprs();
-			PopFollow();
-
-			adaptor.AddChild(root_1, orderExprs28.Tree);
-
-
-			}
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("orderClause", 13);
-			LeaveRule("orderClause", 13);
-			LeaveRule_orderClause();
-		}
-		DebugLocation(150, 1);
-		} finally { DebugExitRule(GrammarFileName, "orderClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "orderClause"
-
-	partial void EnterRule_orderExprs();
-	partial void LeaveRule_orderExprs();
-	// $ANTLR start "orderExprs"
-	// HqlSqlWalker.g:152:1: orderExprs : orderExpr ( ASCENDING | DESCENDING )? ( orderExprs )? ;
-	[GrammarRule("orderExprs")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> orderExprs()
-	{
-		EnterRule_orderExprs();
-		EnterRule("orderExprs", 14);
-		TraceIn("orderExprs", 14);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode set30 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> orderExpr29 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> orderExprs31 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode set30_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "orderExprs");
-		DebugLocation(152, 1);
-		try
-		{
-			// HqlSqlWalker.g:153:2: ( orderExpr ( ASCENDING | DESCENDING )? ( orderExprs )? )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:153:4: orderExpr ( ASCENDING | DESCENDING )? ( orderExprs )?
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(153, 4);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._orderExpr_in_orderExprs712);
-			orderExpr29=orderExpr();
-			PopFollow();
-
-			adaptor.AddChild(root_0, orderExpr29.Tree);
-
-			DebugLocation(153, 14);
-			// HqlSqlWalker.g:153:14: ( ASCENDING | DESCENDING )?
-			int alt16=2;
-			try { DebugEnterSubRule(16);
-			try { DebugEnterDecision(16, false);
-			int LA16_1 = input.LA(1);
-
-			if ((LA16_1==ASCENDING||LA16_1==DESCENDING))
-			{
-				alt16 = 1;
-			}
-			} finally { DebugExitDecision(16); }
-			switch (alt16)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:
-				{
-				DebugLocation(153, 14);
-
-				_last = (IASTNode)input.LT(1);
-				set30=(IASTNode)input.LT(1);
-				if (input.LA(1)==ASCENDING||input.LA(1)==DESCENDING)
-				{
-					input.Consume();
-					set30_tree = (IASTNode)adaptor.DupNode(set30);
-
-
-					adaptor.AddChild(root_0, set30_tree);
-
-					state.errorRecovery=false;
-				}
-				else
-				{
-					MismatchedSetException mse = new MismatchedSetException(null,input);
-					DebugRecognitionException(mse);
-					throw mse;
-				}
-
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(16); }
-
-			DebugLocation(153, 42);
-			// HqlSqlWalker.g:153:42: ( orderExprs )?
-			int alt17=2;
-			try { DebugEnterSubRule(17);
-			try { DebugEnterDecision(17, false);
-			int LA17_1 = input.LA(1);
-
-			if ((LA17_1==AGGREGATE||LA17_1==BAND||(LA17_1>=BNOT && LA17_1<=BOR)||(LA17_1>=BXOR && LA17_1<=CASE2)||LA17_1==COLON||LA17_1==COUNT||(LA17_1>=DIV && LA17_1<=DOT)||LA17_1==FALSE||LA17_1==IDENT||LA17_1==INDEX_OP||LA17_1==JAVA_CONSTANT||LA17_1==METHOD_CALL||LA17_1==MINUS||(LA17_1>=NULL && LA17_1<=NUM_LONG)||(LA17_1>=PARAM && LA17_1<=PLUS)||(LA17_1>=QUERY && LA17_1<=QUOTED_String)||LA17_1==STAR||(LA17_1>=TRUE && LA17_1<=UNARY_MINUS)||LA17_1==UNION||LA17_1==VECTOR_EXPR||LA17_1==WEIRD_IDENT))
-			{
-				alt17 = 1;
-			}
-			} finally { DebugExitDecision(17); }
-			switch (alt17)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:153:43: orderExprs
-				{
-				DebugLocation(153, 43);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._orderExprs_in_orderExprs726);
-				orderExprs31=orderExprs();
-				PopFollow();
-
-				adaptor.AddChild(root_0, orderExprs31.Tree);
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(17); }
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("orderExprs", 14);
-			LeaveRule("orderExprs", 14);
-			LeaveRule_orderExprs();
-		}
-		DebugLocation(154, 1);
-		} finally { DebugExitRule(GrammarFileName, "orderExprs"); }
-		return retval;
-
-	}
-	// $ANTLR end "orderExprs"
-
-	partial void EnterRule_orderExpr();
-	partial void LeaveRule_orderExpr();
-	// $ANTLR start "orderExpr"
-	// HqlSqlWalker.g:156:1: orderExpr : ({...}? resultVariableRef | expr | query );
-	[GrammarRule("orderExpr")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> orderExpr()
-	{
-		EnterRule_orderExpr();
-		EnterRule("orderExpr", 15);
-		TraceIn("orderExpr", 15);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> resultVariableRef32 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr33 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> query34 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "orderExpr");
-		DebugLocation(156, 1);
-		try
-		{
-			// HqlSqlWalker.g:157:2: ({...}? resultVariableRef | expr | query )
-			int alt18=3;
-			try { DebugEnterDecision(18, false);
-			switch (input.LA(1))
-			{
-			case IDENT:
-			case WEIRD_IDENT:
-				{
-				int LA18_2 = input.LA(2);
-
-				if ((( IsOrderExpressionResultVariableRef( (IASTNode) input.LT(1) ) )))
-				{
-					alt18 = 1;
-				}
-				else if ((true))
-				{
-					alt18 = 2;
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 18, 1, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case AGGREGATE:
-			case BAND:
-			case BNOT:
-			case BOR:
-			case BXOR:
-			case CASE:
-			case CASE2:
-			case COLON:
-			case COUNT:
-			case DIV:
-			case DOT:
-			case FALSE:
-			case INDEX_OP:
-			case JAVA_CONSTANT:
-			case METHOD_CALL:
-			case MINUS:
-			case NULL:
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case PARAM:
-			case PLUS:
-			case QUOTED_String:
-			case STAR:
-			case TRUE:
-			case UNARY_MINUS:
-			case VECTOR_EXPR:
-				{
-				alt18 = 2;
-				}
-				break;
-			case QUERY:
-			case UNION:
-				{
-				alt18 = 3;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 18, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(18); }
-			switch (alt18)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:157:4: {...}? resultVariableRef
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(157, 4);
-				if (!(( IsOrderExpressionResultVariableRef( (IASTNode) input.LT(1) ) )))
-				{
-					throw new FailedPredicateException(input, "orderExpr", " IsOrderExpressionResultVariableRef( (IASTNode) input.LT(1) ) ");
-				}
-				DebugLocation(157, 70);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._resultVariableRef_in_orderExpr741);
-				resultVariableRef32=resultVariableRef();
-				PopFollow();
-
-				adaptor.AddChild(root_0, resultVariableRef32.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:158:4: expr
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(158, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._expr_in_orderExpr746);
-				expr33=expr();
-				PopFollow();
-
-				adaptor.AddChild(root_0, expr33.Tree);
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:159:4: query
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(159, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._query_in_orderExpr751);
-				query34=query();
-				PopFollow();
-
-				adaptor.AddChild(root_0, query34.Tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("orderExpr", 15);
-			LeaveRule("orderExpr", 15);
-			LeaveRule_orderExpr();
-		}
-		DebugLocation(160, 1);
-		} finally { DebugExitRule(GrammarFileName, "orderExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "orderExpr"
-
-	partial void EnterRule_resultVariableRef();
-	partial void LeaveRule_resultVariableRef();
-	// $ANTLR start "resultVariableRef"
-	// HqlSqlWalker.g:162:1: resultVariableRef : i= identifier -> ^( RESULT_VARIABLE_REF[$i.tree.Text] ) ;
-	[GrammarRule("resultVariableRef")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> resultVariableRef()
-	{
-		EnterRule_resultVariableRef();
-		EnterRule("resultVariableRef", 16);
-		TraceIn("resultVariableRef", 16);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> i = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		RewriteRuleSubtreeStream stream_identifier=new RewriteRuleSubtreeStream(adaptor,"rule identifier");
-		try { DebugEnterRule(GrammarFileName, "resultVariableRef");
-		DebugLocation(162, 1);
-		try
-		{
-			// HqlSqlWalker.g:166:2: (i= identifier -> ^( RESULT_VARIABLE_REF[$i.tree.Text] ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:166:4: i= identifier
-			{
-			DebugLocation(166, 5);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._identifier_in_resultVariableRef771);
-			i=identifier();
-			PopFollow();
-
-			stream_identifier.Add(i.Tree);
-
-
-			{
-			// AST REWRITE
-			// elements: 
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 167:2: -> ^( RESULT_VARIABLE_REF[$i.tree.Text] )
-			{
-				DebugLocation(167, 5);
-				// HqlSqlWalker.g:167:5: ^( RESULT_VARIABLE_REF[$i.tree.Text] )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(167, 7);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(RESULT_VARIABLE_REF, (i!=null?((IASTNode)i.Tree):default(IASTNode)).Text), root_1);
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-					HandleResultVariableRef( retval.Tree );
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("resultVariableRef", 16);
-			LeaveRule("resultVariableRef", 16);
-			LeaveRule_resultVariableRef();
-		}
-		DebugLocation(168, 1);
-		} finally { DebugExitRule(GrammarFileName, "resultVariableRef"); }
-		return retval;
-
-	}
-	// $ANTLR end "resultVariableRef"
-
-	partial void EnterRule_skipClause();
-	partial void LeaveRule_skipClause();
-	// $ANTLR start "skipClause"
-	// HqlSqlWalker.g:170:1: skipClause : ^( SKIP ( NUM_INT | parameter ) ) ;
-	[GrammarRule("skipClause")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> skipClause()
-	{
-		EnterRule_skipClause();
-		EnterRule("skipClause", 17);
-		TraceIn("skipClause", 17);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode SKIP35 = default(IASTNode);
-		IASTNode NUM_INT36 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> parameter37 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode SKIP35_tree = default(IASTNode);
-		IASTNode NUM_INT36_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "skipClause");
-		DebugLocation(170, 1);
-		try
-		{
-			// HqlSqlWalker.g:171:2: ( ^( SKIP ( NUM_INT | parameter ) ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:171:4: ^( SKIP ( NUM_INT | parameter ) )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(171, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(171, 6);
-
-			_last = (IASTNode)input.LT(1);
-			SKIP35=(IASTNode)Match(input,SKIP,Follow._SKIP_in_skipClause793); 
-			SKIP35_tree = (IASTNode)adaptor.DupNode(SKIP35);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(SKIP35_tree, root_1);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(171, 11);
-			// HqlSqlWalker.g:171:11: ( NUM_INT | parameter )
-			int alt19=2;
-			try { DebugEnterSubRule(19);
-			try { DebugEnterDecision(19, false);
-			int LA19_1 = input.LA(1);
-
-			if ((LA19_1==NUM_INT))
-			{
-				alt19 = 1;
-			}
-			else if ((LA19_1==COLON||LA19_1==PARAM))
-			{
-				alt19 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 19, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(19); }
-			switch (alt19)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:171:12: NUM_INT
-				{
-				DebugLocation(171, 12);
-
-				_last = (IASTNode)input.LT(1);
-				NUM_INT36=(IASTNode)Match(input,NUM_INT,Follow._NUM_INT_in_skipClause796); 
-				NUM_INT36_tree = (IASTNode)adaptor.DupNode(NUM_INT36);
-
-
-				adaptor.AddChild(root_1, NUM_INT36_tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:171:22: parameter
-				{
-				DebugLocation(171, 22);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._parameter_in_skipClause800);
-				parameter37=parameter();
-				PopFollow();
-
-				adaptor.AddChild(root_1, parameter37.Tree);
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(19); }
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("skipClause", 17);
-			LeaveRule("skipClause", 17);
-			LeaveRule_skipClause();
-		}
-		DebugLocation(172, 1);
-		} finally { DebugExitRule(GrammarFileName, "skipClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "skipClause"
-
-	partial void EnterRule_takeClause();
-	partial void LeaveRule_takeClause();
-	// $ANTLR start "takeClause"
-	// HqlSqlWalker.g:174:1: takeClause : ^( TAKE ( NUM_INT | parameter ) ) ;
-	[GrammarRule("takeClause")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> takeClause()
-	{
-		EnterRule_takeClause();
-		EnterRule("takeClause", 18);
-		TraceIn("takeClause", 18);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode TAKE38 = default(IASTNode);
-		IASTNode NUM_INT39 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> parameter40 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode TAKE38_tree = default(IASTNode);
-		IASTNode NUM_INT39_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "takeClause");
-		DebugLocation(174, 1);
-		try
-		{
-			// HqlSqlWalker.g:175:2: ( ^( TAKE ( NUM_INT | parameter ) ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:175:4: ^( TAKE ( NUM_INT | parameter ) )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(175, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(175, 6);
-
-			_last = (IASTNode)input.LT(1);
-			TAKE38=(IASTNode)Match(input,TAKE,Follow._TAKE_in_takeClause814); 
-			TAKE38_tree = (IASTNode)adaptor.DupNode(TAKE38);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(TAKE38_tree, root_1);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(175, 11);
-			// HqlSqlWalker.g:175:11: ( NUM_INT | parameter )
-			int alt20=2;
-			try { DebugEnterSubRule(20);
-			try { DebugEnterDecision(20, false);
-			int LA20_1 = input.LA(1);
-
-			if ((LA20_1==NUM_INT))
-			{
-				alt20 = 1;
-			}
-			else if ((LA20_1==COLON||LA20_1==PARAM))
-			{
-				alt20 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 20, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(20); }
-			switch (alt20)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:175:12: NUM_INT
-				{
-				DebugLocation(175, 12);
-
-				_last = (IASTNode)input.LT(1);
-				NUM_INT39=(IASTNode)Match(input,NUM_INT,Follow._NUM_INT_in_takeClause817); 
-				NUM_INT39_tree = (IASTNode)adaptor.DupNode(NUM_INT39);
-
-
-				adaptor.AddChild(root_1, NUM_INT39_tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:175:22: parameter
-				{
-				DebugLocation(175, 22);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._parameter_in_takeClause821);
-				parameter40=parameter();
-				PopFollow();
-
-				adaptor.AddChild(root_1, parameter40.Tree);
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(20); }
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("takeClause", 18);
-			LeaveRule("takeClause", 18);
-			LeaveRule_takeClause();
-		}
-		DebugLocation(176, 1);
-		} finally { DebugExitRule(GrammarFileName, "takeClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "takeClause"
-
-	partial void EnterRule_groupClause();
-	partial void LeaveRule_groupClause();
-	// $ANTLR start "groupClause"
-	// HqlSqlWalker.g:178:1: groupClause : ^( GROUP ( expr )+ ) ;
-	[GrammarRule("groupClause")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> groupClause()
-	{
-		EnterRule_groupClause();
-		EnterRule("groupClause", 19);
-		TraceIn("groupClause", 19);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode GROUP41 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr42 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode GROUP41_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "groupClause");
-		DebugLocation(178, 1);
-		try
-		{
-			// HqlSqlWalker.g:179:2: ( ^( GROUP ( expr )+ ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:179:4: ^( GROUP ( expr )+ )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(179, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(179, 6);
-
-			_last = (IASTNode)input.LT(1);
-			GROUP41=(IASTNode)Match(input,GROUP,Follow._GROUP_in_groupClause835); 
-			GROUP41_tree = (IASTNode)adaptor.DupNode(GROUP41);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(GROUP41_tree, root_1);
-
-
-			DebugLocation(179, 12);
-			 HandleClauseStart( GROUP ); 
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(179, 44);
-			// HqlSqlWalker.g:179:44: ( expr )+
-			int cnt21=0;
-			try { DebugEnterSubRule(21);
-			while (true)
-			{
-				int alt21=2;
-				try { DebugEnterDecision(21, false);
-				int LA21_1 = input.LA(1);
-
-				if ((LA21_1==AGGREGATE||LA21_1==BAND||(LA21_1>=BNOT && LA21_1<=BOR)||(LA21_1>=BXOR && LA21_1<=CASE2)||LA21_1==COLON||LA21_1==COUNT||(LA21_1>=DIV && LA21_1<=DOT)||LA21_1==FALSE||LA21_1==IDENT||LA21_1==INDEX_OP||LA21_1==JAVA_CONSTANT||LA21_1==METHOD_CALL||LA21_1==MINUS||(LA21_1>=NULL && LA21_1<=NUM_LONG)||(LA21_1>=PARAM && LA21_1<=PLUS)||LA21_1==QUOTED_String||LA21_1==STAR||(LA21_1>=TRUE && LA21_1<=UNARY_MINUS)||LA21_1==VECTOR_EXPR||LA21_1==WEIRD_IDENT))
-				{
-					alt21 = 1;
-				}
-
-
-				} finally { DebugExitDecision(21); }
-				switch (alt21)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:179:45: expr
-					{
-					DebugLocation(179, 45);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._expr_in_groupClause840);
-					expr42=expr();
-					PopFollow();
-
-					adaptor.AddChild(root_1, expr42.Tree);
-
-
-					}
-					break;
-
-				default:
-					if (cnt21 >= 1)
-						goto loop21;
-
-					EarlyExitException eee21 = new EarlyExitException( 21, input );
-					DebugRecognitionException(eee21);
-					throw eee21;
-				}
-				cnt21++;
-			}
-			loop21:
-				;
-
-			} finally { DebugExitSubRule(21); }
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("groupClause", 19);
-			LeaveRule("groupClause", 19);
-			LeaveRule_groupClause();
-		}
-		DebugLocation(180, 1);
-		} finally { DebugExitRule(GrammarFileName, "groupClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "groupClause"
-
-	partial void EnterRule_havingClause();
-	partial void LeaveRule_havingClause();
-	// $ANTLR start "havingClause"
-	// HqlSqlWalker.g:182:1: havingClause : ^( HAVING logicalExpr ) ;
-	[GrammarRule("havingClause")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> havingClause()
-	{
-		EnterRule_havingClause();
-		EnterRule("havingClause", 20);
-		TraceIn("havingClause", 20);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode HAVING43 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> logicalExpr44 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode HAVING43_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "havingClause");
-		DebugLocation(182, 1);
-		try
-		{
-			// HqlSqlWalker.g:183:2: ( ^( HAVING logicalExpr ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:183:4: ^( HAVING logicalExpr )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(183, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(183, 6);
-
-			_last = (IASTNode)input.LT(1);
-			HAVING43=(IASTNode)Match(input,HAVING,Follow._HAVING_in_havingClause856); 
-			HAVING43_tree = (IASTNode)adaptor.DupNode(HAVING43);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(HAVING43_tree, root_1);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(183, 13);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._logicalExpr_in_havingClause858);
-			logicalExpr44=logicalExpr();
-			PopFollow();
-
-			adaptor.AddChild(root_1, logicalExpr44.Tree);
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("havingClause", 20);
-			LeaveRule("havingClause", 20);
-			LeaveRule_havingClause();
-		}
-		DebugLocation(184, 1);
-		} finally { DebugExitRule(GrammarFileName, "havingClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "havingClause"
-
-	partial void EnterRule_selectClause();
-	partial void LeaveRule_selectClause();
-	// $ANTLR start "selectClause"
-	// HqlSqlWalker.g:186:1: selectClause : ^( SELECT (d= DISTINCT )? x= selectExprList ) -> ^( SELECT_CLAUSE[\"{select clause}\"] ( $d)? $x) ;
-	[GrammarRule("selectClause")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> selectClause()
-	{
-		EnterRule_selectClause();
-		EnterRule("selectClause", 21);
-		TraceIn("selectClause", 21);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode d = default(IASTNode);
-		IASTNode SELECT45 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> x = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode d_tree = default(IASTNode);
-		IASTNode SELECT45_tree = default(IASTNode);
-		RewriteRuleNodeStream stream_SELECT=new RewriteRuleNodeStream(adaptor,"token SELECT");
-		RewriteRuleNodeStream stream_DISTINCT=new RewriteRuleNodeStream(adaptor,"token DISTINCT");
-		RewriteRuleSubtreeStream stream_selectExprList=new RewriteRuleSubtreeStream(adaptor,"rule selectExprList");
-		try { DebugEnterRule(GrammarFileName, "selectClause");
-		DebugLocation(186, 1);
-		try
-		{
-			// HqlSqlWalker.g:187:2: ( ^( SELECT (d= DISTINCT )? x= selectExprList ) -> ^( SELECT_CLAUSE[\"{select clause}\"] ( $d)? $x) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:187:4: ^( SELECT (d= DISTINCT )? x= selectExprList )
-			{
-			DebugLocation(187, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(187, 6);
-
-			_last = (IASTNode)input.LT(1);
-			SELECT45=(IASTNode)Match(input,SELECT,Follow._SELECT_in_selectClause872); 
-			 
-			stream_SELECT.Add(SELECT45);
-
-
-			DebugLocation(187, 13);
-			 HandleClauseStart( SELECT ); BeforeSelectClause(); 
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(187, 68);
-			// HqlSqlWalker.g:187:68: (d= DISTINCT )?
-			int alt22=2;
-			try { DebugEnterSubRule(22);
-			try { DebugEnterDecision(22, false);
-			int LA22_1 = input.LA(1);
-
-			if ((LA22_1==DISTINCT))
-			{
-				alt22 = 1;
-			}
-			} finally { DebugExitDecision(22); }
-			switch (alt22)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:187:69: d= DISTINCT
-				{
-				DebugLocation(187, 70);
-
-				_last = (IASTNode)input.LT(1);
-				d=(IASTNode)Match(input,DISTINCT,Follow._DISTINCT_in_selectClause879); 
-				 
-				stream_DISTINCT.Add(d);
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(22); }
-
-			DebugLocation(187, 83);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._selectExprList_in_selectClause885);
-			x=selectExprList();
-			PopFollow();
-
-			stream_selectExprList.Add(x.Tree);
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-
-			{
-			// AST REWRITE
-			// elements: d, x
-			// token labels: d
-			// rule labels: x, retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleNodeStream stream_d=new RewriteRuleNodeStream(adaptor,"token d",d);
-			RewriteRuleSubtreeStream stream_x=new RewriteRuleSubtreeStream(adaptor,"rule x",x!=null?x.Tree:null);
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 188:2: -> ^( SELECT_CLAUSE[\"{select clause}\"] ( $d)? $x)
-			{
-				DebugLocation(188, 5);
-				// HqlSqlWalker.g:188:5: ^( SELECT_CLAUSE[\"{select clause}\"] ( $d)? $x)
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(188, 7);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(SELECT_CLAUSE, "{select clause}"), root_1);
-
-				DebugLocation(188, 41);
-				// HqlSqlWalker.g:188:41: ( $d)?
-				if (stream_d.HasNext)
-				{
-					DebugLocation(188, 41);
-					adaptor.AddChild(root_1, stream_d.NextNode());
-
-				}
-				stream_d.Reset();
-				DebugLocation(188, 45);
-				adaptor.AddChild(root_1, stream_x.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("selectClause", 21);
-			LeaveRule("selectClause", 21);
-			LeaveRule_selectClause();
-		}
-		DebugLocation(189, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "selectClause"
-
-	partial void EnterRule_selectExprList();
-	partial void LeaveRule_selectExprList();
-	// $ANTLR start "selectExprList"
-	// HqlSqlWalker.g:191:1: selectExprList : ( selectExpr | aliasedSelectExpr )+ ;
-	[GrammarRule("selectExprList")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> selectExprList()
-	{
-		EnterRule_selectExprList();
-		EnterRule("selectExprList", 22);
-		TraceIn("selectExprList", 22);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> selectExpr46 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> aliasedSelectExpr47 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-
-				bool oldInSelect = _inSelect;
-				_inSelect = true;
-			
-		try { DebugEnterRule(GrammarFileName, "selectExprList");
-		DebugLocation(191, 1);
-		try
-		{
-			// HqlSqlWalker.g:195:2: ( ( selectExpr | aliasedSelectExpr )+ )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:195:4: ( selectExpr | aliasedSelectExpr )+
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(195, 4);
-			// HqlSqlWalker.g:195:4: ( selectExpr | aliasedSelectExpr )+
-			int cnt23=0;
-			try { DebugEnterSubRule(23);
-			while (true)
-			{
-				int alt23=3;
-				try { DebugEnterDecision(23, false);
-				int LA23_1 = input.LA(1);
-
-				if ((LA23_1==AGGREGATE||LA23_1==ALL||LA23_1==BAND||(LA23_1>=BNOT && LA23_1<=BOR)||(LA23_1>=BXOR && LA23_1<=CASE2)||LA23_1==COLON||(LA23_1>=CONSTRUCTOR && LA23_1<=COUNT)||(LA23_1>=DIV && LA23_1<=ELEMENTS)||LA23_1==IDENT||LA23_1==INDICES||LA23_1==METHOD_CALL||LA23_1==MINUS||(LA23_1>=NUM_DECIMAL && LA23_1<=OBJECT)||(LA23_1>=PARAM && LA23_1<=PLUS)||(LA23_1>=QUERY && LA23_1<=QUOTED_String)||LA23_1==STAR||LA23_1==UNARY_MINUS||LA23_1==UNION||LA23_1==WEIRD_IDENT))
-				{
-					alt23 = 1;
-				}
-				else if ((LA23_1==AS))
-				{
-					alt23 = 2;
-				}
-
-
-				} finally { DebugExitDecision(23); }
-				switch (alt23)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:195:6: selectExpr
-					{
-					DebugLocation(195, 6);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._selectExpr_in_selectExprList920);
-					selectExpr46=selectExpr();
-					PopFollow();
-
-					adaptor.AddChild(root_0, selectExpr46.Tree);
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// HqlSqlWalker.g:195:19: aliasedSelectExpr
-					{
-					DebugLocation(195, 19);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._aliasedSelectExpr_in_selectExprList924);
-					aliasedSelectExpr47=aliasedSelectExpr();
-					PopFollow();
-
-					adaptor.AddChild(root_0, aliasedSelectExpr47.Tree);
-
-
-					}
-					break;
-
-				default:
-					if (cnt23 >= 1)
-						goto loop23;
-
-					EarlyExitException eee23 = new EarlyExitException( 23, input );
-					DebugRecognitionException(eee23);
-					throw eee23;
-				}
-				cnt23++;
-			}
-			loop23:
-				;
-
-			} finally { DebugExitSubRule(23); }
-
-			DebugLocation(195, 40);
-
-					_inSelect = oldInSelect;
-				
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("selectExprList", 22);
-			LeaveRule("selectExprList", 22);
-			LeaveRule_selectExprList();
-		}
-		DebugLocation(198, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectExprList"); }
-		return retval;
-
-	}
-	// $ANTLR end "selectExprList"
-
-	partial void EnterRule_aliasedSelectExpr();
-	partial void LeaveRule_aliasedSelectExpr();
-	// $ANTLR start "aliasedSelectExpr"
-	// HqlSqlWalker.g:200:1: aliasedSelectExpr : ^( AS se= selectExpr i= identifier ) ;
-	[GrammarRule("aliasedSelectExpr")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> aliasedSelectExpr()
-	{
-		EnterRule_aliasedSelectExpr();
-		EnterRule("aliasedSelectExpr", 23);
-		TraceIn("aliasedSelectExpr", 23);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode AS48 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> se = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> i = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode AS48_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "aliasedSelectExpr");
-		DebugLocation(200, 1);
-		try
-		{
-			// HqlSqlWalker.g:205:2: ( ^( AS se= selectExpr i= identifier ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:205:4: ^( AS se= selectExpr i= identifier )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(205, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(205, 6);
-
-			_last = (IASTNode)input.LT(1);
-			AS48=(IASTNode)Match(input,AS,Follow._AS_in_aliasedSelectExpr948); 
-			AS48_tree = (IASTNode)adaptor.DupNode(AS48);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(AS48_tree, root_1);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(205, 11);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._selectExpr_in_aliasedSelectExpr952);
-			se=selectExpr();
-			PopFollow();
-
-			adaptor.AddChild(root_1, se.Tree);
-
-			DebugLocation(205, 24);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._identifier_in_aliasedSelectExpr956);
-			i=identifier();
-			PopFollow();
-
-			adaptor.AddChild(root_1, i.Tree);
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-				    SetAlias((se!=null?((IASTNode)se.Tree):default(IASTNode)),(i!=null?((IASTNode)i.Tree):default(IASTNode)));
-				    retval.Tree =  (se!=null?((IASTNode)se.Tree):default(IASTNode));
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("aliasedSelectExpr", 23);
-			LeaveRule("aliasedSelectExpr", 23);
-			LeaveRule_aliasedSelectExpr();
-		}
-		DebugLocation(206, 1);
-		} finally { DebugExitRule(GrammarFileName, "aliasedSelectExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "aliasedSelectExpr"
-
-	partial void EnterRule_selectExpr();
-	partial void LeaveRule_selectExpr();
-	// $ANTLR start "selectExpr"
-	// HqlSqlWalker.g:208:1: selectExpr : (p= propertyRef | ^( ALL ar2= aliasRef ) | ^( OBJECT ar3= aliasRef ) |con= constructor | functionCall | parameter | count | collectionFunction | literal | arithmeticExpr | query );
-	[GrammarRule("selectExpr")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> selectExpr()
-	{
-		EnterRule_selectExpr();
-		EnterRule("selectExpr", 24);
-		TraceIn("selectExpr", 24);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode ALL49 = default(IASTNode);
-		IASTNode OBJECT50 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> p = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> ar2 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> ar3 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> con = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> functionCall51 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> parameter52 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> count53 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> collectionFunction54 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> literal55 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> arithmeticExpr56 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> query57 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode ALL49_tree = default(IASTNode);
-		IASTNode OBJECT50_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "selectExpr");
-		DebugLocation(208, 1);
-		try
-		{
-			// HqlSqlWalker.g:209:2: (p= propertyRef | ^( ALL ar2= aliasRef ) | ^( OBJECT ar3= aliasRef ) |con= constructor | functionCall | parameter | count | collectionFunction | literal | arithmeticExpr | query )
-			int alt24=11;
-			try { DebugEnterDecision(24, false);
-			switch (input.LA(1))
-			{
-			case DOT:
-			case IDENT:
-			case WEIRD_IDENT:
-				{
-				alt24 = 1;
-				}
-				break;
-			case ALL:
-				{
-				alt24 = 2;
-				}
-				break;
-			case OBJECT:
-				{
-				alt24 = 3;
-				}
-				break;
-			case CONSTRUCTOR:
-				{
-				alt24 = 4;
-				}
-				break;
-			case AGGREGATE:
-			case METHOD_CALL:
-				{
-				alt24 = 5;
-				}
-				break;
-			case COLON:
-			case PARAM:
-				{
-				alt24 = 6;
-				}
-				break;
-			case COUNT:
-				{
-				alt24 = 7;
-				}
-				break;
-			case ELEMENTS:
-			case INDICES:
-				{
-				alt24 = 8;
-				}
-				break;
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case QUOTED_String:
-				{
-				alt24 = 9;
-				}
-				break;
-			case BAND:
-			case BNOT:
-			case BOR:
-			case BXOR:
-			case CASE:
-			case CASE2:
-			case DIV:
-			case MINUS:
-			case PLUS:
-			case STAR:
-			case UNARY_MINUS:
-				{
-				alt24 = 10;
-				}
-				break;
-			case QUERY:
-			case UNION:
-				{
-				alt24 = 11;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 24, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(24); }
-			switch (alt24)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:209:4: p= propertyRef
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(209, 5);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._propertyRef_in_selectExpr971);
-				p=propertyRef();
-				PopFollow();
-
-				adaptor.AddChild(root_0, p.Tree);
-
-				DebugLocation(209, 22);
-				 ResolveSelectExpression((p!=null?((IASTNode)p.Tree):default(IASTNode))); 
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:210:4: ^( ALL ar2= aliasRef )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(210, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(210, 6);
-
-				_last = (IASTNode)input.LT(1);
-				ALL49=(IASTNode)Match(input,ALL,Follow._ALL_in_selectExpr983); 
-				ALL49_tree = (IASTNode)adaptor.DupNode(ALL49);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(ALL49_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(210, 13);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._aliasRef_in_selectExpr987);
-				ar2=aliasRef();
-				PopFollow();
-
-				adaptor.AddChild(root_1, ar2.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-				DebugLocation(210, 27);
-				 ResolveSelectExpression((ar2!=null?((IASTNode)ar2.Tree):default(IASTNode))); retval.Tree =  (ar2!=null?((IASTNode)ar2.Tree):default(IASTNode)); 
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:211:4: ^( OBJECT ar3= aliasRef )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(211, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(211, 6);
-
-				_last = (IASTNode)input.LT(1);
-				OBJECT50=(IASTNode)Match(input,OBJECT,Follow._OBJECT_in_selectExpr999); 
-				OBJECT50_tree = (IASTNode)adaptor.DupNode(OBJECT50);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(OBJECT50_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(211, 16);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._aliasRef_in_selectExpr1003);
-				ar3=aliasRef();
-				PopFollow();
-
-				adaptor.AddChild(root_1, ar3.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-				DebugLocation(211, 28);
-				 ResolveSelectExpression((ar3!=null?((IASTNode)ar3.Tree):default(IASTNode))); retval.Tree =  (ar3!=null?((IASTNode)ar3.Tree):default(IASTNode)); 
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// HqlSqlWalker.g:212:4: con= constructor
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(212, 7);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._constructor_in_selectExpr1014);
-				con=constructor();
-				PopFollow();
-
-				adaptor.AddChild(root_0, con.Tree);
-
-				DebugLocation(212, 24);
-				 ProcessConstructor((con!=null?((IASTNode)con.Tree):default(IASTNode))); 
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// HqlSqlWalker.g:213:4: functionCall
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(213, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._functionCall_in_selectExpr1025);
-				functionCall51=functionCall();
-				PopFollow();
-
-				adaptor.AddChild(root_0, functionCall51.Tree);
-
-
-				}
-				break;
-			case 6:
-				DebugEnterAlt(6);
-				// HqlSqlWalker.g:214:4: parameter
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(214, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._parameter_in_selectExpr1030);
-				parameter52=parameter();
-				PopFollow();
-
-				adaptor.AddChild(root_0, parameter52.Tree);
-
-
-				}
-				break;
-			case 7:
-				DebugEnterAlt(7);
-				// HqlSqlWalker.g:215:4: count
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(215, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._count_in_selectExpr1035);
-				count53=count();
-				PopFollow();
-
-				adaptor.AddChild(root_0, count53.Tree);
-
-
-				}
-				break;
-			case 8:
-				DebugEnterAlt(8);
-				// HqlSqlWalker.g:216:4: collectionFunction
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(216, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._collectionFunction_in_selectExpr1040);
-				collectionFunction54=collectionFunction();
-				PopFollow();
-
-				adaptor.AddChild(root_0, collectionFunction54.Tree);
-
-
-				}
-				break;
-			case 9:
-				DebugEnterAlt(9);
-				// HqlSqlWalker.g:217:4: literal
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(217, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._literal_in_selectExpr1048);
-				literal55=literal();
-				PopFollow();
-
-				adaptor.AddChild(root_0, literal55.Tree);
-
-
-				}
-				break;
-			case 10:
-				DebugEnterAlt(10);
-				// HqlSqlWalker.g:218:4: arithmeticExpr
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(218, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._arithmeticExpr_in_selectExpr1053);
-				arithmeticExpr56=arithmeticExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_0, arithmeticExpr56.Tree);
-
-
-				}
-				break;
-			case 11:
-				DebugEnterAlt(11);
-				// HqlSqlWalker.g:219:4: query
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(219, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._query_in_selectExpr1058);
-				query57=query();
-				PopFollow();
-
-				adaptor.AddChild(root_0, query57.Tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("selectExpr", 24);
-			LeaveRule("selectExpr", 24);
-			LeaveRule_selectExpr();
-		}
-		DebugLocation(220, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "selectExpr"
-
-	partial void EnterRule_count();
-	partial void LeaveRule_count();
-	// $ANTLR start "count"
-	// HqlSqlWalker.g:222:1: count : ^( COUNT ( DISTINCT | ALL )? ( aggregateExpr | ROW_STAR ) ) ;
-	[GrammarRule("count")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> count()
-	{
-		EnterRule_count();
-		EnterRule("count", 25);
-		TraceIn("count", 25);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode COUNT58 = default(IASTNode);
-		IASTNode set59 = default(IASTNode);
-		IASTNode ROW_STAR61 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> aggregateExpr60 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode COUNT58_tree = default(IASTNode);
-		IASTNode set59_tree = default(IASTNode);
-		IASTNode ROW_STAR61_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "count");
-		DebugLocation(222, 1);
-		try
-		{
-			// HqlSqlWalker.g:223:2: ( ^( COUNT ( DISTINCT | ALL )? ( aggregateExpr | ROW_STAR ) ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:223:4: ^( COUNT ( DISTINCT | ALL )? ( aggregateExpr | ROW_STAR ) )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(223, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(223, 6);
-
-			_last = (IASTNode)input.LT(1);
-			COUNT58=(IASTNode)Match(input,COUNT,Follow._COUNT_in_count1070); 
-			COUNT58_tree = (IASTNode)adaptor.DupNode(COUNT58);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(COUNT58_tree, root_1);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(223, 12);
-			// HqlSqlWalker.g:223:12: ( DISTINCT | ALL )?
-			int alt25=2;
-			try { DebugEnterSubRule(25);
-			try { DebugEnterDecision(25, false);
-			int LA25_1 = input.LA(1);
-
-			if ((LA25_1==ALL||LA25_1==DISTINCT))
-			{
-				alt25 = 1;
-			}
-			} finally { DebugExitDecision(25); }
-			switch (alt25)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:
-				{
-				DebugLocation(223, 12);
-
-				_last = (IASTNode)input.LT(1);
-				set59=(IASTNode)input.LT(1);
-				if (input.LA(1)==ALL||input.LA(1)==DISTINCT)
-				{
-					input.Consume();
-					set59_tree = (IASTNode)adaptor.DupNode(set59);
-
-
-					adaptor.AddChild(root_1, set59_tree);
-
-					state.errorRecovery=false;
-				}
-				else
-				{
-					MismatchedSetException mse = new MismatchedSetException(null,input);
-					DebugRecognitionException(mse);
-					throw mse;
-				}
-
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(25); }
-
-			DebugLocation(223, 32);
-			// HqlSqlWalker.g:223:32: ( aggregateExpr | ROW_STAR )
-			int alt26=2;
-			try { DebugEnterSubRule(26);
-			try { DebugEnterDecision(26, false);
-			int LA26_1 = input.LA(1);
-
-			if ((LA26_1==AGGREGATE||LA26_1==BAND||(LA26_1>=BNOT && LA26_1<=BOR)||(LA26_1>=BXOR && LA26_1<=CASE2)||LA26_1==COLON||LA26_1==COUNT||(LA26_1>=DIV && LA26_1<=ELEMENTS)||LA26_1==FALSE||LA26_1==IDENT||(LA26_1>=INDEX_OP && LA26_1<=INDICES)||LA26_1==JAVA_CONSTANT||LA26_1==METHOD_CALL||LA26_1==MINUS||(LA26_1>=NULL && LA26_1<=NUM_LONG)||(LA26_1>=PARAM && LA26_1<=PLUS)||LA26_1==QUOTED_String||LA26_1==STAR||(LA26_1>=TRUE && LA26_1<=UNARY_MINUS)||LA26_1==VECTOR_EXPR||LA26_1==WEIRD_IDENT))
-			{
-				alt26 = 1;
-			}
-			else if ((LA26_1==ROW_STAR))
-			{
-				alt26 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 26, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(26); }
-			switch (alt26)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:223:34: aggregateExpr
-				{
-				DebugLocation(223, 34);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._aggregateExpr_in_count1085);
-				aggregateExpr60=aggregateExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_1, aggregateExpr60.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:223:50: ROW_STAR
-				{
-				DebugLocation(223, 50);
-
-				_last = (IASTNode)input.LT(1);
-				ROW_STAR61=(IASTNode)Match(input,ROW_STAR,Follow._ROW_STAR_in_count1089); 
-				ROW_STAR61_tree = (IASTNode)adaptor.DupNode(ROW_STAR61);
-
-
-				adaptor.AddChild(root_1, ROW_STAR61_tree);
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(26); }
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("count", 25);
-			LeaveRule("count", 25);
-			LeaveRule_count();
-		}
-		DebugLocation(224, 1);
-		} finally { DebugExitRule(GrammarFileName, "count"); }
-		return retval;
-
-	}
-	// $ANTLR end "count"
-
-	partial void EnterRule_constructor();
-	partial void LeaveRule_constructor();
-	// $ANTLR start "constructor"
-	// HqlSqlWalker.g:226:1: constructor : ^( CONSTRUCTOR path ( selectExpr | aliasedSelectExpr )* ) ;
-	[GrammarRule("constructor")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> constructor()
-	{
-		EnterRule_constructor();
-		EnterRule("constructor", 26);
-		TraceIn("constructor", 26);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode CONSTRUCTOR62 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> path63 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> selectExpr64 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> aliasedSelectExpr65 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode CONSTRUCTOR62_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "constructor");
-		DebugLocation(226, 1);
-		try
-		{
-			// HqlSqlWalker.g:227:2: ( ^( CONSTRUCTOR path ( selectExpr | aliasedSelectExpr )* ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:227:4: ^( CONSTRUCTOR path ( selectExpr | aliasedSelectExpr )* )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(227, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(227, 6);
-
-			_last = (IASTNode)input.LT(1);
-			CONSTRUCTOR62=(IASTNode)Match(input,CONSTRUCTOR,Follow._CONSTRUCTOR_in_constructor1105); 
-			CONSTRUCTOR62_tree = (IASTNode)adaptor.DupNode(CONSTRUCTOR62);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(CONSTRUCTOR62_tree, root_1);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(227, 18);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._path_in_constructor1107);
-			path63=path();
-			PopFollow();
-
-			adaptor.AddChild(root_1, path63.Tree);
-
-			DebugLocation(227, 23);
-			// HqlSqlWalker.g:227:23: ( selectExpr | aliasedSelectExpr )*
-			try { DebugEnterSubRule(27);
-			while (true)
-			{
-				int alt27=3;
-				try { DebugEnterDecision(27, false);
-				int LA27_1 = input.LA(1);
-
-				if ((LA27_1==AGGREGATE||LA27_1==ALL||LA27_1==BAND||(LA27_1>=BNOT && LA27_1<=BOR)||(LA27_1>=BXOR && LA27_1<=CASE2)||LA27_1==COLON||(LA27_1>=CONSTRUCTOR && LA27_1<=COUNT)||(LA27_1>=DIV && LA27_1<=ELEMENTS)||LA27_1==IDENT||LA27_1==INDICES||LA27_1==METHOD_CALL||LA27_1==MINUS||(LA27_1>=NUM_DECIMAL && LA27_1<=OBJECT)||(LA27_1>=PARAM && LA27_1<=PLUS)||(LA27_1>=QUERY && LA27_1<=QUOTED_String)||LA27_1==STAR||LA27_1==UNARY_MINUS||LA27_1==UNION||LA27_1==WEIRD_IDENT))
-				{
-					alt27 = 1;
-				}
-				else if ((LA27_1==AS))
-				{
-					alt27 = 2;
-				}
-
-
-				} finally { DebugExitDecision(27); }
-				switch ( alt27 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:227:25: selectExpr
-					{
-					DebugLocation(227, 25);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._selectExpr_in_constructor1111);
-					selectExpr64=selectExpr();
-					PopFollow();
-
-					adaptor.AddChild(root_1, selectExpr64.Tree);
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// HqlSqlWalker.g:227:38: aliasedSelectExpr
-					{
-					DebugLocation(227, 38);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._aliasedSelectExpr_in_constructor1115);
-					aliasedSelectExpr65=aliasedSelectExpr();
-					PopFollow();
-
-					adaptor.AddChild(root_1, aliasedSelectExpr65.Tree);
-
-
-					}
-					break;
-
-				default:
-					goto loop27;
-				}
-			}
-
-			loop27:
-				;
-
-			} finally { DebugExitSubRule(27); }
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("constructor", 26);
-			LeaveRule("constructor", 26);
-			LeaveRule_constructor();
-		}
-		DebugLocation(228, 1);
-		} finally { DebugExitRule(GrammarFileName, "constructor"); }
-		return retval;
-
-	}
-	// $ANTLR end "constructor"
-
-	partial void EnterRule_aggregateExpr();
-	partial void LeaveRule_aggregateExpr();
-	// $ANTLR start "aggregateExpr"
-	// HqlSqlWalker.g:230:1: aggregateExpr : ( expr | collectionFunction );
-	[GrammarRule("aggregateExpr")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> aggregateExpr()
-	{
-		EnterRule_aggregateExpr();
-		EnterRule("aggregateExpr", 27);
-		TraceIn("aggregateExpr", 27);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr66 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> collectionFunction67 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "aggregateExpr");
-		DebugLocation(230, 1);
-		try
-		{
-			// HqlSqlWalker.g:231:2: ( expr | collectionFunction )
-			int alt28=2;
-			try { DebugEnterDecision(28, false);
-			int LA28_1 = input.LA(1);
-
-			if ((LA28_1==AGGREGATE||LA28_1==BAND||(LA28_1>=BNOT && LA28_1<=BOR)||(LA28_1>=BXOR && LA28_1<=CASE2)||LA28_1==COLON||LA28_1==COUNT||(LA28_1>=DIV && LA28_1<=DOT)||LA28_1==FALSE||LA28_1==IDENT||LA28_1==INDEX_OP||LA28_1==JAVA_CONSTANT||LA28_1==METHOD_CALL||LA28_1==MINUS||(LA28_1>=NULL && LA28_1<=NUM_LONG)||(LA28_1>=PARAM && LA28_1<=PLUS)||LA28_1==QUOTED_String||LA28_1==STAR||(LA28_1>=TRUE && LA28_1<=UNARY_MINUS)||LA28_1==VECTOR_EXPR||LA28_1==WEIRD_IDENT))
-			{
-				alt28 = 1;
-			}
-			else if ((LA28_1==ELEMENTS||LA28_1==INDICES))
-			{
-				alt28 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 28, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(28); }
-			switch (alt28)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:231:4: expr
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(231, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._expr_in_aggregateExpr1131);
-				expr66=expr();
-				PopFollow();
-
-				adaptor.AddChild(root_0, expr66.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:232:4: collectionFunction
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(232, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._collectionFunction_in_aggregateExpr1137);
-				collectionFunction67=collectionFunction();
-				PopFollow();
-
-				adaptor.AddChild(root_0, collectionFunction67.Tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("aggregateExpr", 27);
-			LeaveRule("aggregateExpr", 27);
-			LeaveRule_aggregateExpr();
-		}
-		DebugLocation(233, 1);
-		} finally { DebugExitRule(GrammarFileName, "aggregateExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "aggregateExpr"
-
-	partial void EnterRule_fromClause();
-	partial void LeaveRule_fromClause();
-	// $ANTLR start "fromClause"
-	// HqlSqlWalker.g:236:1: fromClause : ^(f= FROM fromElementList ) ;
-	[GrammarRule("fromClause")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> fromClause()
-	{
-		EnterRule_fromClause();
-		EnterRule("fromClause", 28);
-		TraceIn("fromClause", 28);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode f = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> fromElementList68 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode f_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "fromClause");
-		DebugLocation(236, 1);
-		try
-		{
-			// HqlSqlWalker.g:237:2: ( ^(f= FROM fromElementList ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:237:4: ^(f= FROM fromElementList )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(237, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(237, 7);
-
-			_last = (IASTNode)input.LT(1);
-			f=(IASTNode)Match(input,FROM,Follow._FROM_in_fromClause1153); 
-			f_tree = (IASTNode)adaptor.DupNode(f);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(f_tree, root_1);
-
-
-			DebugLocation(237, 13);
-			 PushFromClause(f_tree); HandleClauseStart( FROM ); 
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(237, 69);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._fromElementList_in_fromClause1157);
-			fromElementList68=fromElementList();
-			PopFollow();
-
-			adaptor.AddChild(root_1, fromElementList68.Tree);
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("fromClause", 28);
-			LeaveRule("fromClause", 28);
-			LeaveRule_fromClause();
-		}
-		DebugLocation(238, 1);
-		} finally { DebugExitRule(GrammarFileName, "fromClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "fromClause"
-
-	partial void EnterRule_fromElementList();
-	partial void LeaveRule_fromElementList();
-	// $ANTLR start "fromElementList"
-	// HqlSqlWalker.g:240:1: fromElementList : ( fromElement )+ ;
-	[GrammarRule("fromElementList")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> fromElementList()
-	{
-		EnterRule_fromElementList();
-		EnterRule("fromElementList", 29);
-		TraceIn("fromElementList", 29);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> fromElement69 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-
-				bool oldInFrom = _inFrom;
-				_inFrom = true;
-				
-		try { DebugEnterRule(GrammarFileName, "fromElementList");
-		DebugLocation(240, 1);
-		try
-		{
-			// HqlSqlWalker.g:244:2: ( ( fromElement )+ )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:244:4: ( fromElement )+
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(244, 4);
-			// HqlSqlWalker.g:244:4: ( fromElement )+
-			int cnt29=0;
-			try { DebugEnterSubRule(29);
-			while (true)
-			{
-				int alt29=2;
-				try { DebugEnterDecision(29, false);
-				int LA29_1 = input.LA(1);
-
-				if ((LA29_1==FILTER_ENTITY||LA29_1==JOIN||LA29_1==RANGE))
-				{
-					alt29 = 1;
-				}
-
-
-				} finally { DebugExitDecision(29); }
-				switch (alt29)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:244:5: fromElement
-					{
-					DebugLocation(244, 5);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._fromElement_in_fromElementList1175);
-					fromElement69=fromElement();
-					PopFollow();
-
-					adaptor.AddChild(root_0, fromElement69.Tree);
-
-
-					}
-					break;
-
-				default:
-					if (cnt29 >= 1)
-						goto loop29;
-
-					EarlyExitException eee29 = new EarlyExitException( 29, input );
-					DebugRecognitionException(eee29);
-					throw eee29;
-				}
-				cnt29++;
-			}
-			loop29:
-				;
-
-			} finally { DebugExitSubRule(29); }
-
-			DebugLocation(244, 19);
-
-					_inFrom = oldInFrom;
-					
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("fromElementList", 29);
-			LeaveRule("fromElementList", 29);
-			LeaveRule_fromElementList();
-		}
-		DebugLocation(247, 1);
-		} finally { DebugExitRule(GrammarFileName, "fromElementList"); }
-		return retval;
-
-	}
-	// $ANTLR end "fromElementList"
-
-	partial void EnterRule_fromElement();
-	partial void LeaveRule_fromElement();
-	// $ANTLR start "fromElement"
-	// HqlSqlWalker.g:249:1: fromElement : ( ^( RANGE p= path (a= ALIAS )? (pf= FETCH )? ) -> {fromElement != null}? ^() ->|je= joinElement ->|fe= FILTER_ENTITY a3= ALIAS -> ^() );
-	[GrammarRule("fromElement")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> fromElement()
-	{
-		EnterRule_fromElement();
-		EnterRule("fromElement", 30);
-		TraceIn("fromElement", 30);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode a = default(IASTNode);
-		IASTNode pf = default(IASTNode);
-		IASTNode fe = default(IASTNode);
-		IASTNode a3 = default(IASTNode);
-		IASTNode RANGE70 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> p = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> je = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode a_tree = default(IASTNode);
-		IASTNode pf_tree = default(IASTNode);
-		IASTNode fe_tree = default(IASTNode);
-		IASTNode a3_tree = default(IASTNode);
-		IASTNode RANGE70_tree = default(IASTNode);
-		RewriteRuleNodeStream stream_RANGE=new RewriteRuleNodeStream(adaptor,"token RANGE");
-		RewriteRuleNodeStream stream_ALIAS=new RewriteRuleNodeStream(adaptor,"token ALIAS");
-		RewriteRuleNodeStream stream_FETCH=new RewriteRuleNodeStream(adaptor,"token FETCH");
-		RewriteRuleNodeStream stream_FILTER_ENTITY=new RewriteRuleNodeStream(adaptor,"token FILTER_ENTITY");
-		RewriteRuleSubtreeStream stream_path=new RewriteRuleSubtreeStream(adaptor,"rule path");
-		RewriteRuleSubtreeStream stream_joinElement=new RewriteRuleSubtreeStream(adaptor,"rule joinElement");
-
-		   IASTNode fromElement = null;
-
-		try { DebugEnterRule(GrammarFileName, "fromElement");
-		DebugLocation(249, 1);
-		try
-		{
-			// HqlSqlWalker.g:254:2: ( ^( RANGE p= path (a= ALIAS )? (pf= FETCH )? ) -> {fromElement != null}? ^() ->|je= joinElement ->|fe= FILTER_ENTITY a3= ALIAS -> ^() )
-			int alt32=3;
-			try { DebugEnterDecision(32, false);
-			switch (input.LA(1))
-			{
-			case RANGE:
-				{
-				alt32 = 1;
-				}
-				break;
-			case JOIN:
-				{
-				alt32 = 2;
-				}
-				break;
-			case FILTER_ENTITY:
-				{
-				alt32 = 3;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 32, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(32); }
-			switch (alt32)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:254:4: ^( RANGE p= path (a= ALIAS )? (pf= FETCH )? )
-				{
-				DebugLocation(254, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(254, 6);
-
-				_last = (IASTNode)input.LT(1);
-				RANGE70=(IASTNode)Match(input,RANGE,Follow._RANGE_in_fromElement1200); 
-				 
-				stream_RANGE.Add(RANGE70);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(254, 13);
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._path_in_fromElement1204);
-				p=path();
-				PopFollow();
-
-				stream_path.Add(p.Tree);
-				DebugLocation(254, 19);
-				// HqlSqlWalker.g:254:19: (a= ALIAS )?
-				int alt30=2;
-				try { DebugEnterSubRule(30);
-				try { DebugEnterDecision(30, false);
-				int LA30_1 = input.LA(1);
-
-				if ((LA30_1==ALIAS))
-				{
-					alt30 = 1;
-				}
-				} finally { DebugExitDecision(30); }
-				switch (alt30)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:254:20: a= ALIAS
-					{
-					DebugLocation(254, 21);
-
-					_last = (IASTNode)input.LT(1);
-					a=(IASTNode)Match(input,ALIAS,Follow._ALIAS_in_fromElement1209); 
-					 
-					stream_ALIAS.Add(a);
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(30); }
-
-				DebugLocation(254, 30);
-				// HqlSqlWalker.g:254:30: (pf= FETCH )?
-				int alt31=2;
-				try { DebugEnterSubRule(31);
-				try { DebugEnterDecision(31, false);
-				int LA31_1 = input.LA(1);
-
-				if ((LA31_1==FETCH))
-				{
-					alt31 = 1;
-				}
-				} finally { DebugExitDecision(31); }
-				switch (alt31)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:254:31: pf= FETCH
-					{
-					DebugLocation(254, 33);
-
-					_last = (IASTNode)input.LT(1);
-					pf=(IASTNode)Match(input,FETCH,Follow._FETCH_in_fromElement1216); 
-					 
-					stream_FETCH.Add(pf);
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(31); }
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-				DebugLocation(254, 44);
-				 fromElement = CreateFromElement((p!=null?((HqlSqlWalker.path_return)p).p:default(String)), (p!=null?((IASTNode)p.Tree):default(IASTNode)), a, pf); 
-
-
-				{
-				// AST REWRITE
-				// elements: 
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 255:3: -> {fromElement != null}? ^()
-				if (fromElement != null)
-				{
-					DebugLocation(255, 29);
-					// HqlSqlWalker.g:255:29: ^()
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(255, 31);
-					root_1 = (IASTNode)adaptor.BecomeRoot(fromElement, root_1);
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-				else // 256:3: ->
-				{
-					DebugLocation(257, 2);
-					root_0 = null;
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:257:4: je= joinElement
-				{
-				DebugLocation(257, 6);
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._joinElement_in_fromElement1243);
-				je=joinElement();
-				PopFollow();
-
-				stream_joinElement.Add(je.Tree);
-
-
-				{
-				// AST REWRITE
-				// elements: 
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 258:3: ->
-				{
-					DebugLocation(260, 2);
-					root_0 = null;
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:260:4: fe= FILTER_ENTITY a3= ALIAS
-				{
-				DebugLocation(260, 6);
-
-				_last = (IASTNode)input.LT(1);
-				fe=(IASTNode)Match(input,FILTER_ENTITY,Follow._FILTER_ENTITY_in_fromElement1258); 
-				 
-				stream_FILTER_ENTITY.Add(fe);
-
-				DebugLocation(260, 23);
-
-				_last = (IASTNode)input.LT(1);
-				a3=(IASTNode)Match(input,ALIAS,Follow._ALIAS_in_fromElement1262); 
-				 
-				stream_ALIAS.Add(a3);
-
-
-
-				{
-				// AST REWRITE
-				// elements: 
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 261:3: -> ^()
-				{
-					DebugLocation(261, 6);
-					// HqlSqlWalker.g:261:6: ^()
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(261, 8);
-					root_1 = (IASTNode)adaptor.BecomeRoot(CreateFromFilterElement(fe,a3), root_1);
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("fromElement", 30);
-			LeaveRule("fromElement", 30);
-			LeaveRule_fromElement();
-		}
-		DebugLocation(262, 1);
-		} finally { DebugExitRule(GrammarFileName, "fromElement"); }
-		return retval;
-
-	}
-	// $ANTLR end "fromElement"
-
-	partial void EnterRule_joinElement();
-	partial void LeaveRule_joinElement();
-	// $ANTLR start "joinElement"
-	// HqlSqlWalker.g:264:1: joinElement : ^( JOIN (j= joinType )? (f= FETCH )? pRef= propertyRef (a= ALIAS )? (pf= FETCH )? ( ^( (with= WITH ) ( . )* ) )? ) ;
-	[GrammarRule("joinElement")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> joinElement()
-	{
-		EnterRule_joinElement();
-		EnterRule("joinElement", 31);
-		TraceIn("joinElement", 31);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode f = default(IASTNode);
-		IASTNode a = default(IASTNode);
-		IASTNode pf = default(IASTNode);
-		IASTNode with = default(IASTNode);
-		IASTNode JOIN71 = default(IASTNode);
-		IASTNode wildcard72 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> j = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> pRef = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode f_tree = default(IASTNode);
-		IASTNode a_tree = default(IASTNode);
-		IASTNode pf_tree = default(IASTNode);
-		IASTNode with_tree = default(IASTNode);
-		IASTNode JOIN71_tree = default(IASTNode);
-		IASTNode wildcard72_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "joinElement");
-		DebugLocation(264, 1);
-		try
-		{
-			// HqlSqlWalker.g:268:2: ( ^( JOIN (j= joinType )? (f= FETCH )? pRef= propertyRef (a= ALIAS )? (pf= FETCH )? ( ^( (with= WITH ) ( . )* ) )? ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:268:4: ^( JOIN (j= joinType )? (f= FETCH )? pRef= propertyRef (a= ALIAS )? (pf= FETCH )? ( ^( (with= WITH ) ( . )* ) )? )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(268, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(268, 6);
-
-			_last = (IASTNode)input.LT(1);
-			JOIN71=(IASTNode)Match(input,JOIN,Follow._JOIN_in_joinElement1291); 
-			JOIN71_tree = (IASTNode)adaptor.DupNode(JOIN71);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(JOIN71_tree, root_1);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(268, 11);
-			// HqlSqlWalker.g:268:11: (j= joinType )?
-			int alt33=2;
-			try { DebugEnterSubRule(33);
-			try { DebugEnterDecision(33, false);
-			int LA33_1 = input.LA(1);
-
-			if ((LA33_1==FULL||LA33_1==INNER||LA33_1==LEFT||LA33_1==RIGHT))
-			{
-				alt33 = 1;
-			}
-			} finally { DebugExitDecision(33); }
-			switch (alt33)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:268:12: j= joinType
-				{
-				DebugLocation(268, 13);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._joinType_in_joinElement1296);
-				j=joinType();
-				PopFollow();
-
-				adaptor.AddChild(root_1, j.Tree);
-
-				DebugLocation(268, 23);
-				 SetImpliedJoinType((j!=null?((HqlSqlWalker.joinType_return)j).j:default(int))); 
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(33); }
-
-			DebugLocation(268, 56);
-			// HqlSqlWalker.g:268:56: (f= FETCH )?
-			int alt34=2;
-			try { DebugEnterSubRule(34);
-			try { DebugEnterDecision(34, false);
-			int LA34_1 = input.LA(1);
-
-			if ((LA34_1==FETCH))
-			{
-				alt34 = 1;
-			}
-			} finally { DebugExitDecision(34); }
-			switch (alt34)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:268:57: f= FETCH
-				{
-				DebugLocation(268, 58);
-
-				_last = (IASTNode)input.LT(1);
-				f=(IASTNode)Match(input,FETCH,Follow._FETCH_in_joinElement1306); 
-				f_tree = (IASTNode)adaptor.DupNode(f);
-
-
-				adaptor.AddChild(root_1, f_tree);
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(34); }
-
-			DebugLocation(268, 71);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._propertyRef_in_joinElement1312);
-			pRef=propertyRef();
-			PopFollow();
-
-			adaptor.AddChild(root_1, pRef.Tree);
-
-			DebugLocation(268, 84);
-			// HqlSqlWalker.g:268:84: (a= ALIAS )?
-			int alt35=2;
-			try { DebugEnterSubRule(35);
-			try { DebugEnterDecision(35, false);
-			int LA35_1 = input.LA(1);
-
-			if ((LA35_1==ALIAS))
-			{
-				alt35 = 1;
-			}
-			} finally { DebugExitDecision(35); }
-			switch (alt35)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:268:85: a= ALIAS
-				{
-				DebugLocation(268, 86);
-
-				_last = (IASTNode)input.LT(1);
-				a=(IASTNode)Match(input,ALIAS,Follow._ALIAS_in_joinElement1317); 
-				a_tree = (IASTNode)adaptor.DupNode(a);
-
-
-				adaptor.AddChild(root_1, a_tree);
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(35); }
-
-			DebugLocation(268, 95);
-			// HqlSqlWalker.g:268:95: (pf= FETCH )?
-			int alt36=2;
-			try { DebugEnterSubRule(36);
-			try { DebugEnterDecision(36, false);
-			int LA36_1 = input.LA(1);
-
-			if ((LA36_1==FETCH))
-			{
-				alt36 = 1;
-			}
-			} finally { DebugExitDecision(36); }
-			switch (alt36)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:268:96: pf= FETCH
-				{
-				DebugLocation(268, 98);
-
-				_last = (IASTNode)input.LT(1);
-				pf=(IASTNode)Match(input,FETCH,Follow._FETCH_in_joinElement1324); 
-				pf_tree = (IASTNode)adaptor.DupNode(pf);
-
-
-				adaptor.AddChild(root_1, pf_tree);
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(36); }
-
-			DebugLocation(268, 107);
-			// HqlSqlWalker.g:268:107: ( ^( (with= WITH ) ( . )* ) )?
-			int alt38=2;
-			try { DebugEnterSubRule(38);
-			try { DebugEnterDecision(38, false);
-			int LA38_1 = input.LA(1);
-
-			if ((LA38_1==WITH))
-			{
-				alt38 = 1;
-			}
-			} finally { DebugExitDecision(38); }
-			switch (alt38)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:268:108: ^( (with= WITH ) ( . )* )
-				{
-				DebugLocation(268, 108);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_2 = _last;
-				IASTNode _first_2 = default(IASTNode);
-				IASTNode root_2 = (IASTNode)adaptor.Nil();
-				DebugLocation(268, 110);
-				// HqlSqlWalker.g:268:110: (with= WITH )
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:268:111: with= WITH
-				{
-				DebugLocation(268, 115);
-
-				_last = (IASTNode)input.LT(1);
-				with=(IASTNode)Match(input,WITH,Follow._WITH_in_joinElement1333); 
-				with_tree = (IASTNode)adaptor.DupNode(with);
-
-
-				adaptor.AddChild(root_2, with_tree);
-
-
-				}
-
-
-				if (input.LA(1) == TokenTypes.Down) {
-					Match(input, TokenTypes.Down, null); 
-					DebugLocation(268, 122);
-					// HqlSqlWalker.g:268:122: ( . )*
-					try { DebugEnterSubRule(37);
-					while (true)
-					{
-						int alt37=2;
-						try { DebugEnterDecision(37, false);
-						int LA37_1 = input.LA(1);
-
-						if (((LA37_1>=AGGREGATE && LA37_1<=THETA_JOINS)))
-						{
-							alt37 = 1;
-						}
-						else if ((LA37_1==UP))
-						{
-							alt37 = 2;
-						}
-
-
-						} finally { DebugExitDecision(37); }
-						switch ( alt37 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// HqlSqlWalker.g:268:122: .
-							{
-							DebugLocation(268, 122);
-
-							_last = (IASTNode)input.LT(1);
-							wildcard72=(IASTNode)input.LT(1);
-
-							MatchAny(input); 
-							wildcard72_tree = (IASTNode)adaptor.DupTree(wildcard72);
-							adaptor.AddChild(root_2, wildcard72_tree);
-
-
-							}
-							break;
-
-						default:
-							goto loop37;
-						}
-					}
-
-					loop37:
-						;
-
-					} finally { DebugExitSubRule(37); }
-
-
-					Match(input, TokenTypes.Up, null); 
-				}
-				adaptor.AddChild(root_1, root_2);
-				_last = _save_last_2;
-				}
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(38); }
-
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-			DebugLocation(269, 2);
-
-					CreateFromJoinElement((pRef!=null?((IASTNode)pRef.Tree):default(IASTNode)),a,(j!=null?((HqlSqlWalker.joinType_return)j).j:default(int)),f, pf, with);
-					SetImpliedJoinType(INNER);	// Reset the implied join type.
-				
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("joinElement", 31);
-			LeaveRule("joinElement", 31);
-			LeaveRule_joinElement();
-		}
-		DebugLocation(273, 1);
-		} finally { DebugExitRule(GrammarFileName, "joinElement"); }
-		return retval;
-
-	}
-	// $ANTLR end "joinElement"
-
-	private sealed partial class joinType_return : AstTreeRuleReturnScope<IASTNode, IASTNode>
-	{
-		public int j;
-		public joinType_return(HqlSqlWalker grammar) {OnCreated(grammar);}
-		partial void OnCreated(HqlSqlWalker grammar);
-	}
-
-	partial void EnterRule_joinType();
-	partial void LeaveRule_joinType();
-	// $ANTLR start "joinType"
-	// HqlSqlWalker.g:277:1: joinType returns [int j] : ( ( (left= LEFT |right= RIGHT ) (outer= OUTER )? ) | FULL | INNER );
-	[GrammarRule("joinType")]
-	private HqlSqlWalker.joinType_return joinType()
-	{
-		EnterRule_joinType();
-		EnterRule("joinType", 32);
-		TraceIn("joinType", 32);
-		HqlSqlWalker.joinType_return retval = new HqlSqlWalker.joinType_return(this);
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode left = default(IASTNode);
-		IASTNode right = default(IASTNode);
-		IASTNode outer = default(IASTNode);
-		IASTNode FULL73 = default(IASTNode);
-		IASTNode INNER74 = default(IASTNode);
-
-		IASTNode left_tree = default(IASTNode);
-		IASTNode right_tree = default(IASTNode);
-		IASTNode outer_tree = default(IASTNode);
-		IASTNode FULL73_tree = default(IASTNode);
-		IASTNode INNER74_tree = default(IASTNode);
-
-		   retval.j = INNER;
-
-		try { DebugEnterRule(GrammarFileName, "joinType");
-		DebugLocation(277, 1);
-		try
-		{
-			// HqlSqlWalker.g:281:2: ( ( (left= LEFT |right= RIGHT ) (outer= OUTER )? ) | FULL | INNER )
-			int alt41=3;
-			try { DebugEnterDecision(41, false);
-			switch (input.LA(1))
-			{
-			case LEFT:
-			case RIGHT:
-				{
-				alt41 = 1;
-				}
-				break;
-			case FULL:
-				{
-				alt41 = 2;
-				}
-				break;
-			case INNER:
-				{
-				alt41 = 3;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 41, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(41); }
-			switch (alt41)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:281:4: ( (left= LEFT |right= RIGHT ) (outer= OUTER )? )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(281, 4);
-				// HqlSqlWalker.g:281:4: ( (left= LEFT |right= RIGHT ) (outer= OUTER )? )
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:281:6: (left= LEFT |right= RIGHT ) (outer= OUTER )?
-				{
-				DebugLocation(281, 6);
-				// HqlSqlWalker.g:281:6: (left= LEFT |right= RIGHT )
-				int alt39=2;
-				try { DebugEnterSubRule(39);
-				try { DebugEnterDecision(39, false);
-				int LA39_1 = input.LA(1);
-
-				if ((LA39_1==LEFT))
-				{
-					alt39 = 1;
-				}
-				else if ((LA39_1==RIGHT))
-				{
-					alt39 = 2;
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 39, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				} finally { DebugExitDecision(39); }
-				switch (alt39)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:281:7: left= LEFT
-					{
-					DebugLocation(281, 11);
-
-					_last = (IASTNode)input.LT(1);
-					left=(IASTNode)Match(input,LEFT,Follow._LEFT_in_joinType1374); 
-					left_tree = (IASTNode)adaptor.DupNode(left);
-
-
-					adaptor.AddChild(root_0, left_tree);
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// HqlSqlWalker.g:281:19: right= RIGHT
-					{
-					DebugLocation(281, 24);
-
-					_last = (IASTNode)input.LT(1);
-					right=(IASTNode)Match(input,RIGHT,Follow._RIGHT_in_joinType1380); 
-					right_tree = (IASTNode)adaptor.DupNode(right);
-
-
-					adaptor.AddChild(root_0, right_tree);
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(39); }
-
-				DebugLocation(281, 32);
-				// HqlSqlWalker.g:281:32: (outer= OUTER )?
-				int alt40=2;
-				try { DebugEnterSubRule(40);
-				try { DebugEnterDecision(40, false);
-				int LA40_1 = input.LA(1);
-
-				if ((LA40_1==OUTER))
-				{
-					alt40 = 1;
-				}
-				} finally { DebugExitDecision(40); }
-				switch (alt40)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:281:33: outer= OUTER
-					{
-					DebugLocation(281, 38);
-
-					_last = (IASTNode)input.LT(1);
-					outer=(IASTNode)Match(input,OUTER,Follow._OUTER_in_joinType1386); 
-					outer_tree = (IASTNode)adaptor.DupNode(outer);
-
-
-					adaptor.AddChild(root_0, outer_tree);
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(40); }
-
-				DebugLocation(282, 2);
-
-						if (left != null)       retval.j = LEFT_OUTER;
-						else if (right != null) retval.j = RIGHT_OUTER;
-						else if (outer != null) retval.j = RIGHT_OUTER;
-					
-
-				}
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:287:4: FULL
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(287, 4);
-
-				_last = (IASTNode)input.LT(1);
-				FULL73=(IASTNode)Match(input,FULL,Follow._FULL_in_joinType1400); 
-				FULL73_tree = (IASTNode)adaptor.DupNode(FULL73);
-
-
-				adaptor.AddChild(root_0, FULL73_tree);
-
-				DebugLocation(287, 9);
-
-						retval.j = FULL;
-					
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:290:4: INNER
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(290, 4);
-
-				_last = (IASTNode)input.LT(1);
-				INNER74=(IASTNode)Match(input,INNER,Follow._INNER_in_joinType1407); 
-				INNER74_tree = (IASTNode)adaptor.DupNode(INNER74);
-
-
-				adaptor.AddChild(root_0, INNER74_tree);
-
-				DebugLocation(290, 10);
-
-						retval.j = INNER;
-					
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("joinType", 32);
-			LeaveRule("joinType", 32);
-			LeaveRule_joinType();
-		}
-		DebugLocation(293, 1);
-		} finally { DebugExitRule(GrammarFileName, "joinType"); }
-		return retval;
-
-	}
-	// $ANTLR end "joinType"
-
-	private sealed partial class path_return : AstTreeRuleReturnScope<IASTNode, IASTNode>
-	{
-		public String p;
-		public path_return(HqlSqlWalker grammar) {OnCreated(grammar);}
-		partial void OnCreated(HqlSqlWalker grammar);
-	}
-
-	partial void EnterRule_path();
-	partial void LeaveRule_path();
-	// $ANTLR start "path"
-	// HqlSqlWalker.g:297:1: path returns [String p] : (a= identifier | ^( DOT x= path y= identifier ) );
-	[GrammarRule("path")]
-	private HqlSqlWalker.path_return path()
-	{
-		EnterRule_path();
-		EnterRule("path", 33);
-		TraceIn("path", 33);
-		HqlSqlWalker.path_return retval = new HqlSqlWalker.path_return(this);
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode DOT75 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> a = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> x = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> y = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode DOT75_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "path");
-		DebugLocation(297, 1);
-		try
-		{
-			// HqlSqlWalker.g:298:2: (a= identifier | ^( DOT x= path y= identifier ) )
-			int alt42=2;
-			try { DebugEnterDecision(42, false);
-			int LA42_1 = input.LA(1);
-
-			if ((LA42_1==IDENT||LA42_1==WEIRD_IDENT))
-			{
-				alt42 = 1;
-			}
-			else if ((LA42_1==DOT))
-			{
-				alt42 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 42, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(42); }
-			switch (alt42)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:298:4: a= identifier
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(298, 5);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._identifier_in_path1429);
-				a=identifier();
-				PopFollow();
-
-				adaptor.AddChild(root_0, a.Tree);
-
-				DebugLocation(298, 17);
-				 retval.p = (a!=null?((IASTNode)a.Start):default(IASTNode)).ToString();
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:299:4: ^( DOT x= path y= identifier )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(299, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(299, 6);
-
-				_last = (IASTNode)input.LT(1);
-				DOT75=(IASTNode)Match(input,DOT,Follow._DOT_in_path1437); 
-				DOT75_tree = (IASTNode)adaptor.DupNode(DOT75);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(DOT75_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(299, 11);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._path_in_path1441);
-				x=path();
-				PopFollow();
-
-				adaptor.AddChild(root_1, x.Tree);
-
-				DebugLocation(299, 18);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._identifier_in_path1445);
-				y=identifier();
-				PopFollow();
-
-				adaptor.AddChild(root_1, y.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-				DebugLocation(299, 31);
-
-							StringBuilder buf = new StringBuilder();
-							buf.Append((x!=null?((HqlSqlWalker.path_return)x).p:default(String))).Append('.').Append((y!=null?((IASTNode)y.Start):default(IASTNode)).ToString());
-							retval.p = buf.ToString();
-						
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("path", 33);
-			LeaveRule("path", 33);
-			LeaveRule_path();
-		}
-		DebugLocation(304, 1);
-		} finally { DebugExitRule(GrammarFileName, "path"); }
-		return retval;
-
-	}
-	// $ANTLR end "path"
-
-	partial void EnterRule_pathAsIdent();
-	partial void LeaveRule_pathAsIdent();
-	// $ANTLR start "pathAsIdent"
-	// HqlSqlWalker.g:307:1: pathAsIdent : path -> ^( IDENT[$path.p] ) ;
-	[GrammarRule("pathAsIdent")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> pathAsIdent()
-	{
-		EnterRule_pathAsIdent();
-		EnterRule("pathAsIdent", 34);
-		TraceIn("pathAsIdent", 34);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> path76 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		RewriteRuleSubtreeStream stream_path=new RewriteRuleSubtreeStream(adaptor,"rule path");
-		try { DebugEnterRule(GrammarFileName, "pathAsIdent");
-		DebugLocation(307, 4);
-		try
-		{
-			// HqlSqlWalker.g:308:5: ( path -> ^( IDENT[$path.p] ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:308:7: path
-			{
-			DebugLocation(308, 7);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._path_in_pathAsIdent1464);
-			path76=path();
-			PopFollow();
-
-			stream_path.Add(path76.Tree);
-
-
-			{
-			// AST REWRITE
-			// elements: 
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 309:5: -> ^( IDENT[$path.p] )
-			{
-				DebugLocation(309, 8);
-				// HqlSqlWalker.g:309:8: ^( IDENT[$path.p] )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(309, 10);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(IDENT, (path76!=null?((HqlSqlWalker.path_return)path76).p:default(String))), root_1);
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("pathAsIdent", 34);
-			LeaveRule("pathAsIdent", 34);
-			LeaveRule_pathAsIdent();
-		}
-		DebugLocation(310, 4);
-		} finally { DebugExitRule(GrammarFileName, "pathAsIdent"); }
-		return retval;
-
-	}
-	// $ANTLR end "pathAsIdent"
-
-	partial void EnterRule_withClause();
-	partial void LeaveRule_withClause();
-	// $ANTLR start "withClause"
-	// HqlSqlWalker.g:312:1: withClause : ^(w= WITH b= logicalExpr ) -> ^( $w $b) ;
-	[GrammarRule("withClause")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> withClause()
-	{
-		EnterRule_withClause();
-		EnterRule("withClause", 35);
-		TraceIn("withClause", 35);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode w = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> b = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode w_tree = default(IASTNode);
-		RewriteRuleNodeStream stream_WITH=new RewriteRuleNodeStream(adaptor,"token WITH");
-		RewriteRuleSubtreeStream stream_logicalExpr=new RewriteRuleSubtreeStream(adaptor,"rule logicalExpr");
-		try { DebugEnterRule(GrammarFileName, "withClause");
-		DebugLocation(312, 1);
-		try
-		{
-			// HqlSqlWalker.g:319:2: ( ^(w= WITH b= logicalExpr ) -> ^( $w $b) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:319:4: ^(w= WITH b= logicalExpr )
-			{
-			DebugLocation(319, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(319, 7);
-
-			_last = (IASTNode)input.LT(1);
-			w=(IASTNode)Match(input,WITH,Follow._WITH_in_withClause1505); 
-			 
-			stream_WITH.Add(w);
-
-
-			DebugLocation(319, 13);
-			 HandleClauseStart( WITH ); 
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(319, 45);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._logicalExpr_in_withClause1511);
-			b=logicalExpr();
-			PopFollow();
-
-			stream_logicalExpr.Add(b.Tree);
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-
-			{
-			// AST REWRITE
-			// elements: w, b
-			// token labels: w
-			// rule labels: b, retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleNodeStream stream_w=new RewriteRuleNodeStream(adaptor,"token w",w);
-			RewriteRuleSubtreeStream stream_b=new RewriteRuleSubtreeStream(adaptor,"rule b",b!=null?b.Tree:null);
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 320:2: -> ^( $w $b)
-			{
-				DebugLocation(320, 5);
-				// HqlSqlWalker.g:320:5: ^( $w $b)
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(320, 8);
-				root_1 = (IASTNode)adaptor.BecomeRoot(stream_w.NextNode(), root_1);
-
-				DebugLocation(320, 11);
-				adaptor.AddChild(root_1, stream_b.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("withClause", 35);
-			LeaveRule("withClause", 35);
-			LeaveRule_withClause();
-		}
-		DebugLocation(321, 1);
-		} finally { DebugExitRule(GrammarFileName, "withClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "withClause"
-
-	partial void EnterRule_whereClause();
-	partial void LeaveRule_whereClause();
-	// $ANTLR start "whereClause"
-	// HqlSqlWalker.g:323:1: whereClause : ^(w= WHERE b= logicalExpr ) -> ^( $w $b) ;
-	[GrammarRule("whereClause")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> whereClause()
-	{
-		EnterRule_whereClause();
-		EnterRule("whereClause", 36);
-		TraceIn("whereClause", 36);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode w = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> b = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode w_tree = default(IASTNode);
-		RewriteRuleNodeStream stream_WHERE=new RewriteRuleNodeStream(adaptor,"token WHERE");
-		RewriteRuleSubtreeStream stream_logicalExpr=new RewriteRuleSubtreeStream(adaptor,"rule logicalExpr");
-		try { DebugEnterRule(GrammarFileName, "whereClause");
-		DebugLocation(323, 1);
-		try
-		{
-			// HqlSqlWalker.g:324:2: ( ^(w= WHERE b= logicalExpr ) -> ^( $w $b) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:324:4: ^(w= WHERE b= logicalExpr )
-			{
-			DebugLocation(324, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(324, 7);
-
-			_last = (IASTNode)input.LT(1);
-			w=(IASTNode)Match(input,WHERE,Follow._WHERE_in_whereClause1539); 
-			 
-			stream_WHERE.Add(w);
-
-
-			DebugLocation(324, 14);
-			 HandleClauseStart( WHERE ); 
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(324, 47);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._logicalExpr_in_whereClause1545);
-			b=logicalExpr();
-			PopFollow();
-
-			stream_logicalExpr.Add(b.Tree);
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-
-			{
-			// AST REWRITE
-			// elements: w, b
-			// token labels: w
-			// rule labels: b, retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleNodeStream stream_w=new RewriteRuleNodeStream(adaptor,"token w",w);
-			RewriteRuleSubtreeStream stream_b=new RewriteRuleSubtreeStream(adaptor,"rule b",b!=null?b.Tree:null);
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 325:2: -> ^( $w $b)
-			{
-				DebugLocation(325, 5);
-				// HqlSqlWalker.g:325:5: ^( $w $b)
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(325, 8);
-				root_1 = (IASTNode)adaptor.BecomeRoot(stream_w.NextNode(), root_1);
-
-				DebugLocation(325, 11);
-				adaptor.AddChild(root_1, stream_b.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("whereClause", 36);
-			LeaveRule("whereClause", 36);
-			LeaveRule_whereClause();
-		}
-		DebugLocation(326, 1);
-		} finally { DebugExitRule(GrammarFileName, "whereClause"); }
-		return retval;
-
-	}
-	// $ANTLR end "whereClause"
-
-	partial void EnterRule_logicalExpr();
-	partial void LeaveRule_logicalExpr();
-	// $ANTLR start "logicalExpr"
-	// HqlSqlWalker.g:328:1: logicalExpr : ( ^( AND logicalExpr logicalExpr ) | ^( OR logicalExpr logicalExpr ) | ^( NOT logicalExpr ) | comparisonExpr | functionCall | logicalPath );
-	[GrammarRule("logicalExpr")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> logicalExpr()
-	{
-		EnterRule_logicalExpr();
-		EnterRule("logicalExpr", 37);
-		TraceIn("logicalExpr", 37);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode AND77 = default(IASTNode);
-		IASTNode OR80 = default(IASTNode);
-		IASTNode NOT83 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> logicalExpr78 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> logicalExpr79 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> logicalExpr81 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> logicalExpr82 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> logicalExpr84 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> comparisonExpr85 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> functionCall86 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> logicalPath87 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode AND77_tree = default(IASTNode);
-		IASTNode OR80_tree = default(IASTNode);
-		IASTNode NOT83_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "logicalExpr");
-		DebugLocation(328, 1);
-		try
-		{
-			// HqlSqlWalker.g:329:2: ( ^( AND logicalExpr logicalExpr ) | ^( OR logicalExpr logicalExpr ) | ^( NOT logicalExpr ) | comparisonExpr | functionCall | logicalPath )
-			int alt43=6;
-			try { DebugEnterDecision(43, false);
-			switch (input.LA(1))
-			{
-			case AND:
-				{
-				alt43 = 1;
-				}
-				break;
-			case OR:
-				{
-				alt43 = 2;
-				}
-				break;
-			case NOT:
-				{
-				alt43 = 3;
-				}
-				break;
-			case BETWEEN:
-			case EQ:
-			case EXISTS:
-			case GE:
-			case GT:
-			case IN:
-			case IS_NOT_NULL:
-			case IS_NULL:
-			case LE:
-			case LIKE:
-			case LT:
-			case NE:
-			case NOT_BETWEEN:
-			case NOT_IN:
-			case NOT_LIKE:
-				{
-				alt43 = 4;
-				}
-				break;
-			case AGGREGATE:
-			case METHOD_CALL:
-				{
-				alt43 = 5;
-				}
-				break;
-			case DOT:
-			case IDENT:
-			case INDEX_OP:
-			case WEIRD_IDENT:
-				{
-				alt43 = 6;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 43, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(43); }
-			switch (alt43)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:329:4: ^( AND logicalExpr logicalExpr )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(329, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(329, 6);
-
-				_last = (IASTNode)input.LT(1);
-				AND77=(IASTNode)Match(input,AND,Follow._AND_in_logicalExpr1571); 
-				AND77_tree = (IASTNode)adaptor.DupNode(AND77);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(AND77_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(329, 10);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._logicalExpr_in_logicalExpr1573);
-				logicalExpr78=logicalExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_1, logicalExpr78.Tree);
-
-				DebugLocation(329, 22);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._logicalExpr_in_logicalExpr1575);
-				logicalExpr79=logicalExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_1, logicalExpr79.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:330:4: ^( OR logicalExpr logicalExpr )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(330, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(330, 6);
-
-				_last = (IASTNode)input.LT(1);
-				OR80=(IASTNode)Match(input,OR,Follow._OR_in_logicalExpr1582); 
-				OR80_tree = (IASTNode)adaptor.DupNode(OR80);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(OR80_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(330, 9);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._logicalExpr_in_logicalExpr1584);
-				logicalExpr81=logicalExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_1, logicalExpr81.Tree);
-
-				DebugLocation(330, 21);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._logicalExpr_in_logicalExpr1586);
-				logicalExpr82=logicalExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_1, logicalExpr82.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:331:4: ^( NOT logicalExpr )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(331, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(331, 6);
-
-				_last = (IASTNode)input.LT(1);
-				NOT83=(IASTNode)Match(input,NOT,Follow._NOT_in_logicalExpr1593); 
-				NOT83_tree = (IASTNode)adaptor.DupNode(NOT83);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(NOT83_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(331, 10);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._logicalExpr_in_logicalExpr1595);
-				logicalExpr84=logicalExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_1, logicalExpr84.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// HqlSqlWalker.g:332:4: comparisonExpr
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(332, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._comparisonExpr_in_logicalExpr1601);
-				comparisonExpr85=comparisonExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_0, comparisonExpr85.Tree);
-
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// HqlSqlWalker.g:333:4: functionCall
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(333, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._functionCall_in_logicalExpr1606);
-				functionCall86=functionCall();
-				PopFollow();
-
-				adaptor.AddChild(root_0, functionCall86.Tree);
-
-
-				}
-				break;
-			case 6:
-				DebugEnterAlt(6);
-				// HqlSqlWalker.g:334:4: logicalPath
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(334, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._logicalPath_in_logicalExpr1611);
-				logicalPath87=logicalPath();
-				PopFollow();
-
-				adaptor.AddChild(root_0, logicalPath87.Tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("logicalExpr", 37);
-			LeaveRule("logicalExpr", 37);
-			LeaveRule_logicalExpr();
-		}
-		DebugLocation(335, 1);
-		} finally { DebugExitRule(GrammarFileName, "logicalExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "logicalExpr"
-
-	partial void EnterRule_logicalPath();
-	partial void LeaveRule_logicalPath();
-	// $ANTLR start "logicalPath"
-	// HqlSqlWalker.g:337:1: logicalPath : p= addrExpr[ true ] -> ^( EQ $p TRUE ) ;
-	[GrammarRule("logicalPath")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> logicalPath()
-	{
-		EnterRule_logicalPath();
-		EnterRule("logicalPath", 38);
-		TraceIn("logicalPath", 38);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> p = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		RewriteRuleSubtreeStream stream_addrExpr=new RewriteRuleSubtreeStream(adaptor,"rule addrExpr");
-		try { DebugEnterRule(GrammarFileName, "logicalPath");
-		DebugLocation(337, 1);
-		try
-		{
-			// HqlSqlWalker.g:341:2: (p= addrExpr[ true ] -> ^( EQ $p TRUE ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:341:4: p= addrExpr[ true ]
-			{
-			DebugLocation(341, 5);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._addrExpr_in_logicalPath1630);
-			p=addrExpr(true);
-			PopFollow();
-
-			stream_addrExpr.Add(p.Tree);
-			DebugLocation(341, 24);
-			Resolve((p!=null?((IASTNode)p.Tree):default(IASTNode)));
-
-
-			{
-			// AST REWRITE
-			// elements: p
-			// token labels: 
-			// rule labels: p, retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_p=new RewriteRuleSubtreeStream(adaptor,"rule p",p!=null?p.Tree:null);
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 341:45: -> ^( EQ $p TRUE )
-			{
-				DebugLocation(341, 48);
-				// HqlSqlWalker.g:341:48: ^( EQ $p TRUE )
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(341, 50);
-				root_1 = (IASTNode)adaptor.BecomeRoot((IASTNode)adaptor.Create(EQ, "EQ"), root_1);
-
-				DebugLocation(341, 54);
-				adaptor.AddChild(root_1, stream_p.NextTree());
-				DebugLocation(341, 56);
-				adaptor.AddChild(root_1, (IASTNode)adaptor.Create(TRUE, "TRUE"));
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-				    PrepareLogicOperator( retval.Tree );
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("logicalPath", 38);
-			LeaveRule("logicalPath", 38);
-			LeaveRule_logicalPath();
-		}
-		DebugLocation(342, 1);
-		} finally { DebugExitRule(GrammarFileName, "logicalPath"); }
-		return retval;
-
-	}
-	// $ANTLR end "logicalPath"
-
-	partial void EnterRule_comparisonExpr();
-	partial void LeaveRule_comparisonExpr();
-	// $ANTLR start "comparisonExpr"
-	// HqlSqlWalker.g:345:1: comparisonExpr : ( ^( EQ exprOrSubquery exprOrSubquery ) | ^( NE exprOrSubquery exprOrSubquery ) | ^( LT exprOrSubquery exprOrSubquery ) | ^( GT exprOrSubquery exprOrSubquery ) | ^( LE exprOrSubquery exprOrSubquery ) | ^( GE exprOrSubquery exprOrSubquery ) | ^( LIKE exprOrSubquery expr ( ^( ESCAPE expr ) )? ) | ^( NOT_LIKE exprOrSubquery expr ( ^( ESCAPE expr ) )? ) | ^( BETWEEN exprOrSubquery exprOrSubquery exprOrSubquery ) | ^( NOT_BETWEEN exprOrSubquery exprOrSubquery exprOrSubquery ) | ^( IN exprOrSubquery inRhs ) | ^( NOT_IN exprOrSubquery inRhs ) | ^( IS_NULL exprOrSubquery ) | ^( IS_NOT_NULL exprOrSubquery ) | ^( EXISTS ( expr | collectionFunctionOrSubselect ) ) ) ;
-	[GrammarRule("comparisonExpr")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> comparisonExpr()
-	{
-		EnterRule_comparisonExpr();
-		EnterRule("comparisonExpr", 39);
-		TraceIn("comparisonExpr", 39);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode EQ88 = default(IASTNode);
-		IASTNode NE91 = default(IASTNode);
-		IASTNode LT94 = default(IASTNode);
-		IASTNode GT97 = default(IASTNode);
-		IASTNode LE100 = default(IASTNode);
-		IASTNode GE103 = default(IASTNode);
-		IASTNode LIKE106 = default(IASTNode);
-		IASTNode ESCAPE109 = default(IASTNode);
-		IASTNode NOT_LIKE111 = default(IASTNode);
-		IASTNode ESCAPE114 = default(IASTNode);
-		IASTNode BETWEEN116 = default(IASTNode);
-		IASTNode NOT_BETWEEN120 = default(IASTNode);
-		IASTNode IN124 = default(IASTNode);
-		IASTNode NOT_IN127 = default(IASTNode);
-		IASTNode IS_NULL130 = default(IASTNode);
-		IASTNode IS_NOT_NULL132 = default(IASTNode);
-		IASTNode EXISTS134 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery89 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery90 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery92 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery93 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery95 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery96 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery98 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery99 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery101 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery102 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery104 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery105 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery107 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr108 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr110 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery112 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr113 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr115 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery117 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery118 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery119 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery121 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery122 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery123 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery125 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> inRhs126 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery128 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> inRhs129 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery131 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery133 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr135 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> collectionFunctionOrSubselect136 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode EQ88_tree = default(IASTNode);
-		IASTNode NE91_tree = default(IASTNode);
-		IASTNode LT94_tree = default(IASTNode);
-		IASTNode GT97_tree = default(IASTNode);
-		IASTNode LE100_tree = default(IASTNode);
-		IASTNode GE103_tree = default(IASTNode);
-		IASTNode LIKE106_tree = default(IASTNode);
-		IASTNode ESCAPE109_tree = default(IASTNode);
-		IASTNode NOT_LIKE111_tree = default(IASTNode);
-		IASTNode ESCAPE114_tree = default(IASTNode);
-		IASTNode BETWEEN116_tree = default(IASTNode);
-		IASTNode NOT_BETWEEN120_tree = default(IASTNode);
-		IASTNode IN124_tree = default(IASTNode);
-		IASTNode NOT_IN127_tree = default(IASTNode);
-		IASTNode IS_NULL130_tree = default(IASTNode);
-		IASTNode IS_NOT_NULL132_tree = default(IASTNode);
-		IASTNode EXISTS134_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "comparisonExpr");
-		DebugLocation(345, 1);
-		try
-		{
-			// HqlSqlWalker.g:349:2: ( ( ^( EQ exprOrSubquery exprOrSubquery ) | ^( NE exprOrSubquery exprOrSubquery ) | ^( LT exprOrSubquery exprOrSubquery ) | ^( GT exprOrSubquery exprOrSubquery ) | ^( LE exprOrSubquery exprOrSubquery ) | ^( GE exprOrSubquery exprOrSubquery ) | ^( LIKE exprOrSubquery expr ( ^( ESCAPE expr ) )? ) | ^( NOT_LIKE exprOrSubquery expr ( ^( ESCAPE expr ) )? ) | ^( BETWEEN exprOrSubquery exprOrSubquery exprOrSubquery ) | ^( NOT_BETWEEN exprOrSubquery exprOrSubquery exprOrSubquery ) | ^( IN exprOrSubquery inRhs ) | ^( NOT_IN exprOrSubquery inRhs ) | ^( IS_NULL exprOrSubquery ) | ^( IS_NOT_NULL exprOrSubquery ) | ^( EXISTS ( expr | collectionFunctionOrSubselect ) ) ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:350:2: ( ^( EQ exprOrSubquery exprOrSubquery ) | ^( NE exprOrSubquery exprOrSubquery ) | ^( LT exprOrSubquery exprOrSubquery ) | ^( GT exprOrSubquery exprOrSubquery ) | ^( LE exprOrSubquery exprOrSubquery ) | ^( GE exprOrSubquery exprOrSubquery ) | ^( LIKE exprOrSubquery expr ( ^( ESCAPE expr ) )? ) | ^( NOT_LIKE exprOrSubquery expr ( ^( ESCAPE expr ) )? ) | ^( BETWEEN exprOrSubquery exprOrSubquery exprOrSubquery ) | ^( NOT_BETWEEN exprOrSubquery exprOrSubquery exprOrSubquery ) | ^( IN exprOrSubquery inRhs ) | ^( NOT_IN exprOrSubquery inRhs ) | ^( IS_NULL exprOrSubquery ) | ^( IS_NOT_NULL exprOrSubquery ) | ^( EXISTS ( expr | collectionFunctionOrSubselect ) ) )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(350, 2);
-			// HqlSqlWalker.g:350:2: ( ^( EQ exprOrSubquery exprOrSubquery ) | ^( NE exprOrSubquery exprOrSubquery ) | ^( LT exprOrSubquery exprOrSubquery ) | ^( GT exprOrSubquery exprOrSubquery ) | ^( LE exprOrSubquery exprOrSubquery ) | ^( GE exprOrSubquery exprOrSubquery ) | ^( LIKE exprOrSubquery expr ( ^( ESCAPE expr ) )? ) | ^( NOT_LIKE exprOrSubquery expr ( ^( ESCAPE expr ) )? ) | ^( BETWEEN exprOrSubquery exprOrSubquery exprOrSubquery ) | ^( NOT_BETWEEN exprOrSubquery exprOrSubquery exprOrSubquery ) | ^( IN exprOrSubquery inRhs ) | ^( NOT_IN exprOrSubquery inRhs ) | ^( IS_NULL exprOrSubquery ) | ^( IS_NOT_NULL exprOrSubquery ) | ^( EXISTS ( expr | collectionFunctionOrSubselect ) ) )
-			int alt47=15;
-			try { DebugEnterSubRule(47);
-			try { DebugEnterDecision(47, false);
-			switch (input.LA(1))
-			{
-			case EQ:
-				{
-				alt47 = 1;
-				}
-				break;
-			case NE:
-				{
-				alt47 = 2;
-				}
-				break;
-			case LT:
-				{
-				alt47 = 3;
-				}
-				break;
-			case GT:
-				{
-				alt47 = 4;
-				}
-				break;
-			case LE:
-				{
-				alt47 = 5;
-				}
-				break;
-			case GE:
-				{
-				alt47 = 6;
-				}
-				break;
-			case LIKE:
-				{
-				alt47 = 7;
-				}
-				break;
-			case NOT_LIKE:
-				{
-				alt47 = 8;
-				}
-				break;
-			case BETWEEN:
-				{
-				alt47 = 9;
-				}
-				break;
-			case NOT_BETWEEN:
-				{
-				alt47 = 10;
-				}
-				break;
-			case IN:
-				{
-				alt47 = 11;
-				}
-				break;
-			case NOT_IN:
-				{
-				alt47 = 12;
-				}
-				break;
-			case IS_NULL:
-				{
-				alt47 = 13;
-				}
-				break;
-			case IS_NOT_NULL:
-				{
-				alt47 = 14;
-				}
-				break;
-			case EXISTS:
-				{
-				alt47 = 15;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 47, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(47); }
-			switch (alt47)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:350:4: ^( EQ exprOrSubquery exprOrSubquery )
-				{
-				DebugLocation(350, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(350, 6);
-
-				_last = (IASTNode)input.LT(1);
-				EQ88=(IASTNode)Match(input,EQ,Follow._EQ_in_comparisonExpr1668); 
-				EQ88_tree = (IASTNode)adaptor.DupNode(EQ88);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(EQ88_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(350, 9);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1670);
-				exprOrSubquery89=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery89.Tree);
-
-				DebugLocation(350, 24);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1672);
-				exprOrSubquery90=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery90.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:351:4: ^( NE exprOrSubquery exprOrSubquery )
-				{
-				DebugLocation(351, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(351, 6);
-
-				_last = (IASTNode)input.LT(1);
-				NE91=(IASTNode)Match(input,NE,Follow._NE_in_comparisonExpr1679); 
-				NE91_tree = (IASTNode)adaptor.DupNode(NE91);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(NE91_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(351, 9);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1681);
-				exprOrSubquery92=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery92.Tree);
-
-				DebugLocation(351, 24);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1683);
-				exprOrSubquery93=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery93.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:352:4: ^( LT exprOrSubquery exprOrSubquery )
-				{
-				DebugLocation(352, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(352, 6);
-
-				_last = (IASTNode)input.LT(1);
-				LT94=(IASTNode)Match(input,LT,Follow._LT_in_comparisonExpr1690); 
-				LT94_tree = (IASTNode)adaptor.DupNode(LT94);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(LT94_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(352, 9);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1692);
-				exprOrSubquery95=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery95.Tree);
-
-				DebugLocation(352, 24);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1694);
-				exprOrSubquery96=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery96.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// HqlSqlWalker.g:353:4: ^( GT exprOrSubquery exprOrSubquery )
-				{
-				DebugLocation(353, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(353, 6);
-
-				_last = (IASTNode)input.LT(1);
-				GT97=(IASTNode)Match(input,GT,Follow._GT_in_comparisonExpr1701); 
-				GT97_tree = (IASTNode)adaptor.DupNode(GT97);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(GT97_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(353, 9);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1703);
-				exprOrSubquery98=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery98.Tree);
-
-				DebugLocation(353, 24);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1705);
-				exprOrSubquery99=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery99.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// HqlSqlWalker.g:354:4: ^( LE exprOrSubquery exprOrSubquery )
-				{
-				DebugLocation(354, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(354, 6);
-
-				_last = (IASTNode)input.LT(1);
-				LE100=(IASTNode)Match(input,LE,Follow._LE_in_comparisonExpr1712); 
-				LE100_tree = (IASTNode)adaptor.DupNode(LE100);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(LE100_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(354, 9);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1714);
-				exprOrSubquery101=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery101.Tree);
-
-				DebugLocation(354, 24);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1716);
-				exprOrSubquery102=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery102.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 6:
-				DebugEnterAlt(6);
-				// HqlSqlWalker.g:355:4: ^( GE exprOrSubquery exprOrSubquery )
-				{
-				DebugLocation(355, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(355, 6);
-
-				_last = (IASTNode)input.LT(1);
-				GE103=(IASTNode)Match(input,GE,Follow._GE_in_comparisonExpr1723); 
-				GE103_tree = (IASTNode)adaptor.DupNode(GE103);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(GE103_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(355, 9);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1725);
-				exprOrSubquery104=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery104.Tree);
-
-				DebugLocation(355, 24);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1727);
-				exprOrSubquery105=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery105.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 7:
-				DebugEnterAlt(7);
-				// HqlSqlWalker.g:356:4: ^( LIKE exprOrSubquery expr ( ^( ESCAPE expr ) )? )
-				{
-				DebugLocation(356, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(356, 6);
-
-				_last = (IASTNode)input.LT(1);
-				LIKE106=(IASTNode)Match(input,LIKE,Follow._LIKE_in_comparisonExpr1734); 
-				LIKE106_tree = (IASTNode)adaptor.DupNode(LIKE106);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(LIKE106_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(356, 11);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1736);
-				exprOrSubquery107=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery107.Tree);
-
-				DebugLocation(356, 26);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._expr_in_comparisonExpr1738);
-				expr108=expr();
-				PopFollow();
-
-				adaptor.AddChild(root_1, expr108.Tree);
-
-				DebugLocation(356, 31);
-				// HqlSqlWalker.g:356:31: ( ^( ESCAPE expr ) )?
-				int alt44=2;
-				try { DebugEnterSubRule(44);
-				try { DebugEnterDecision(44, false);
-				int LA44_1 = input.LA(1);
-
-				if ((LA44_1==ESCAPE))
-				{
-					alt44 = 1;
-				}
-				} finally { DebugExitDecision(44); }
-				switch (alt44)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:356:33: ^( ESCAPE expr )
-					{
-					DebugLocation(356, 33);
-
-					_last = (IASTNode)input.LT(1);
-					{
-					IASTNode _save_last_2 = _last;
-					IASTNode _first_2 = default(IASTNode);
-					IASTNode root_2 = (IASTNode)adaptor.Nil();
-					DebugLocation(356, 35);
-
-					_last = (IASTNode)input.LT(1);
-					ESCAPE109=(IASTNode)Match(input,ESCAPE,Follow._ESCAPE_in_comparisonExpr1743); 
-					ESCAPE109_tree = (IASTNode)adaptor.DupNode(ESCAPE109);
-
-
-					root_2 = (IASTNode)adaptor.BecomeRoot(ESCAPE109_tree, root_2);
-
-
-					Match(input, TokenTypes.Down, null); 
-					DebugLocation(356, 42);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._expr_in_comparisonExpr1745);
-					expr110=expr();
-					PopFollow();
-
-					adaptor.AddChild(root_2, expr110.Tree);
-
-
-					Match(input, TokenTypes.Up, null); 
-					adaptor.AddChild(root_1, root_2);
-					_last = _save_last_2;
-					}
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(44); }
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 8:
-				DebugEnterAlt(8);
-				// HqlSqlWalker.g:357:4: ^( NOT_LIKE exprOrSubquery expr ( ^( ESCAPE expr ) )? )
-				{
-				DebugLocation(357, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(357, 6);
-
-				_last = (IASTNode)input.LT(1);
-				NOT_LIKE111=(IASTNode)Match(input,NOT_LIKE,Follow._NOT_LIKE_in_comparisonExpr1757); 
-				NOT_LIKE111_tree = (IASTNode)adaptor.DupNode(NOT_LIKE111);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(NOT_LIKE111_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(357, 15);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1759);
-				exprOrSubquery112=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery112.Tree);
-
-				DebugLocation(357, 30);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._expr_in_comparisonExpr1761);
-				expr113=expr();
-				PopFollow();
-
-				adaptor.AddChild(root_1, expr113.Tree);
-
-				DebugLocation(357, 35);
-				// HqlSqlWalker.g:357:35: ( ^( ESCAPE expr ) )?
-				int alt45=2;
-				try { DebugEnterSubRule(45);
-				try { DebugEnterDecision(45, false);
-				int LA45_1 = input.LA(1);
-
-				if ((LA45_1==ESCAPE))
-				{
-					alt45 = 1;
-				}
-				} finally { DebugExitDecision(45); }
-				switch (alt45)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:357:37: ^( ESCAPE expr )
-					{
-					DebugLocation(357, 37);
-
-					_last = (IASTNode)input.LT(1);
-					{
-					IASTNode _save_last_2 = _last;
-					IASTNode _first_2 = default(IASTNode);
-					IASTNode root_2 = (IASTNode)adaptor.Nil();
-					DebugLocation(357, 39);
-
-					_last = (IASTNode)input.LT(1);
-					ESCAPE114=(IASTNode)Match(input,ESCAPE,Follow._ESCAPE_in_comparisonExpr1766); 
-					ESCAPE114_tree = (IASTNode)adaptor.DupNode(ESCAPE114);
-
-
-					root_2 = (IASTNode)adaptor.BecomeRoot(ESCAPE114_tree, root_2);
-
-
-					Match(input, TokenTypes.Down, null); 
-					DebugLocation(357, 46);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._expr_in_comparisonExpr1768);
-					expr115=expr();
-					PopFollow();
-
-					adaptor.AddChild(root_2, expr115.Tree);
-
-
-					Match(input, TokenTypes.Up, null); 
-					adaptor.AddChild(root_1, root_2);
-					_last = _save_last_2;
-					}
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(45); }
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 9:
-				DebugEnterAlt(9);
-				// HqlSqlWalker.g:358:4: ^( BETWEEN exprOrSubquery exprOrSubquery exprOrSubquery )
-				{
-				DebugLocation(358, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(358, 6);
-
-				_last = (IASTNode)input.LT(1);
-				BETWEEN116=(IASTNode)Match(input,BETWEEN,Follow._BETWEEN_in_comparisonExpr1780); 
-				BETWEEN116_tree = (IASTNode)adaptor.DupNode(BETWEEN116);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(BETWEEN116_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(358, 14);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1782);
-				exprOrSubquery117=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery117.Tree);
-
-				DebugLocation(358, 29);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1784);
-				exprOrSubquery118=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery118.Tree);
-
-				DebugLocation(358, 44);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1786);
-				exprOrSubquery119=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery119.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 10:
-				DebugEnterAlt(10);
-				// HqlSqlWalker.g:359:4: ^( NOT_BETWEEN exprOrSubquery exprOrSubquery exprOrSubquery )
-				{
-				DebugLocation(359, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(359, 6);
-
-				_last = (IASTNode)input.LT(1);
-				NOT_BETWEEN120=(IASTNode)Match(input,NOT_BETWEEN,Follow._NOT_BETWEEN_in_comparisonExpr1793); 
-				NOT_BETWEEN120_tree = (IASTNode)adaptor.DupNode(NOT_BETWEEN120);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(NOT_BETWEEN120_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(359, 18);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1795);
-				exprOrSubquery121=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery121.Tree);
-
-				DebugLocation(359, 33);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1797);
-				exprOrSubquery122=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery122.Tree);
-
-				DebugLocation(359, 48);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1799);
-				exprOrSubquery123=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery123.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 11:
-				DebugEnterAlt(11);
-				// HqlSqlWalker.g:360:4: ^( IN exprOrSubquery inRhs )
-				{
-				DebugLocation(360, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(360, 6);
-
-				_last = (IASTNode)input.LT(1);
-				IN124=(IASTNode)Match(input,IN,Follow._IN_in_comparisonExpr1806); 
-				IN124_tree = (IASTNode)adaptor.DupNode(IN124);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(IN124_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(360, 9);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1808);
-				exprOrSubquery125=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery125.Tree);
-
-				DebugLocation(360, 24);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._inRhs_in_comparisonExpr1810);
-				inRhs126=inRhs();
-				PopFollow();
-
-				adaptor.AddChild(root_1, inRhs126.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 12:
-				DebugEnterAlt(12);
-				// HqlSqlWalker.g:361:4: ^( NOT_IN exprOrSubquery inRhs )
-				{
-				DebugLocation(361, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(361, 6);
-
-				_last = (IASTNode)input.LT(1);
-				NOT_IN127=(IASTNode)Match(input,NOT_IN,Follow._NOT_IN_in_comparisonExpr1818); 
-				NOT_IN127_tree = (IASTNode)adaptor.DupNode(NOT_IN127);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(NOT_IN127_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(361, 13);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1820);
-				exprOrSubquery128=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery128.Tree);
-
-				DebugLocation(361, 28);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._inRhs_in_comparisonExpr1822);
-				inRhs129=inRhs();
-				PopFollow();
-
-				adaptor.AddChild(root_1, inRhs129.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 13:
-				DebugEnterAlt(13);
-				// HqlSqlWalker.g:362:4: ^( IS_NULL exprOrSubquery )
-				{
-				DebugLocation(362, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(362, 6);
-
-				_last = (IASTNode)input.LT(1);
-				IS_NULL130=(IASTNode)Match(input,IS_NULL,Follow._IS_NULL_in_comparisonExpr1830); 
-				IS_NULL130_tree = (IASTNode)adaptor.DupNode(IS_NULL130);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(IS_NULL130_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(362, 14);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1832);
-				exprOrSubquery131=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery131.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 14:
-				DebugEnterAlt(14);
-				// HqlSqlWalker.g:363:4: ^( IS_NOT_NULL exprOrSubquery )
-				{
-				DebugLocation(363, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(363, 6);
-
-				_last = (IASTNode)input.LT(1);
-				IS_NOT_NULL132=(IASTNode)Match(input,IS_NOT_NULL,Follow._IS_NOT_NULL_in_comparisonExpr1839); 
-				IS_NOT_NULL132_tree = (IASTNode)adaptor.DupNode(IS_NOT_NULL132);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(IS_NOT_NULL132_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(363, 18);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_comparisonExpr1841);
-				exprOrSubquery133=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery133.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 15:
-				DebugEnterAlt(15);
-				// HqlSqlWalker.g:366:4: ^( EXISTS ( expr | collectionFunctionOrSubselect ) )
-				{
-				DebugLocation(366, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(366, 6);
-
-				_last = (IASTNode)input.LT(1);
-				EXISTS134=(IASTNode)Match(input,EXISTS,Follow._EXISTS_in_comparisonExpr1850); 
-				EXISTS134_tree = (IASTNode)adaptor.DupNode(EXISTS134);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(EXISTS134_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(366, 13);
-				// HqlSqlWalker.g:366:13: ( expr | collectionFunctionOrSubselect )
-				int alt46=2;
-				try { DebugEnterSubRule(46);
-				try { DebugEnterDecision(46, false);
-				int LA46_1 = input.LA(1);
-
-				if ((LA46_1==AGGREGATE||LA46_1==BAND||(LA46_1>=BNOT && LA46_1<=BOR)||(LA46_1>=BXOR && LA46_1<=CASE2)||LA46_1==COLON||LA46_1==COUNT||(LA46_1>=DIV && LA46_1<=DOT)||LA46_1==FALSE||LA46_1==IDENT||LA46_1==INDEX_OP||LA46_1==JAVA_CONSTANT||LA46_1==METHOD_CALL||LA46_1==MINUS||(LA46_1>=NULL && LA46_1<=NUM_LONG)||(LA46_1>=PARAM && LA46_1<=PLUS)||LA46_1==QUOTED_String||LA46_1==STAR||(LA46_1>=TRUE && LA46_1<=UNARY_MINUS)||LA46_1==VECTOR_EXPR||LA46_1==WEIRD_IDENT))
-				{
-					alt46 = 1;
-				}
-				else if ((LA46_1==ELEMENTS||LA46_1==INDICES||LA46_1==QUERY||LA46_1==UNION))
-				{
-					alt46 = 2;
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 46, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				} finally { DebugExitDecision(46); }
-				switch (alt46)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:366:15: expr
-					{
-					DebugLocation(366, 15);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._expr_in_comparisonExpr1854);
-					expr135=expr();
-					PopFollow();
-
-					adaptor.AddChild(root_1, expr135.Tree);
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// HqlSqlWalker.g:366:22: collectionFunctionOrSubselect
-					{
-					DebugLocation(366, 22);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._collectionFunctionOrSubselect_in_comparisonExpr1858);
-					collectionFunctionOrSubselect136=collectionFunctionOrSubselect();
-					PopFollow();
-
-					adaptor.AddChild(root_1, collectionFunctionOrSubselect136.Tree);
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(46); }
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(47); }
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-				    PrepareLogicOperator( retval.Tree );
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("comparisonExpr", 39);
-			LeaveRule("comparisonExpr", 39);
-			LeaveRule_comparisonExpr();
-		}
-		DebugLocation(368, 1);
-		} finally { DebugExitRule(GrammarFileName, "comparisonExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "comparisonExpr"
-
-	partial void EnterRule_inRhs();
-	partial void LeaveRule_inRhs();
-	// $ANTLR start "inRhs"
-	// HqlSqlWalker.g:370:1: inRhs : ^( IN_LIST ( collectionFunctionOrSubselect | ( expr )* ) ) ;
-	[GrammarRule("inRhs")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> inRhs()
-	{
-		EnterRule_inRhs();
-		EnterRule("inRhs", 40);
-		TraceIn("inRhs", 40);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode IN_LIST137 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> collectionFunctionOrSubselect138 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr139 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode IN_LIST137_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "inRhs");
-		DebugLocation(370, 1);
-		try
-		{
-			// HqlSqlWalker.g:371:2: ( ^( IN_LIST ( collectionFunctionOrSubselect | ( expr )* ) ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:371:4: ^( IN_LIST ( collectionFunctionOrSubselect | ( expr )* ) )
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(371, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(371, 6);
-
-			_last = (IASTNode)input.LT(1);
-			IN_LIST137=(IASTNode)Match(input,IN_LIST,Follow._IN_LIST_in_inRhs1877); 
-			IN_LIST137_tree = (IASTNode)adaptor.DupNode(IN_LIST137);
-
-
-			root_1 = (IASTNode)adaptor.BecomeRoot(IN_LIST137_tree, root_1);
-
-
-			if (input.LA(1) == TokenTypes.Down) {
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(371, 14);
-				// HqlSqlWalker.g:371:14: ( collectionFunctionOrSubselect | ( expr )* )
-				int alt49=2;
-				try { DebugEnterSubRule(49);
-				try { DebugEnterDecision(49, false);
-				int LA49_1 = input.LA(1);
-
-				if ((LA49_1==ELEMENTS||LA49_1==INDICES||LA49_1==QUERY||LA49_1==UNION))
-				{
-					alt49 = 1;
-				}
-				else if (((LA49_1>=UP && LA49_1<=AGGREGATE)||LA49_1==BAND||(LA49_1>=BNOT && LA49_1<=BOR)||(LA49_1>=BXOR && LA49_1<=CASE2)||LA49_1==COLON||LA49_1==COUNT||(LA49_1>=DIV && LA49_1<=DOT)||LA49_1==FALSE||LA49_1==IDENT||LA49_1==INDEX_OP||LA49_1==JAVA_CONSTANT||LA49_1==METHOD_CALL||LA49_1==MINUS||(LA49_1>=NULL && LA49_1<=NUM_LONG)||(LA49_1>=PARAM && LA49_1<=PLUS)||LA49_1==QUOTED_String||LA49_1==STAR||(LA49_1>=TRUE && LA49_1<=UNARY_MINUS)||LA49_1==VECTOR_EXPR||LA49_1==WEIRD_IDENT))
-				{
-					alt49 = 2;
-				}
-				else
-				{
-					NoViableAltException nvae = new NoViableAltException("", 49, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				} finally { DebugExitDecision(49); }
-				switch (alt49)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:371:16: collectionFunctionOrSubselect
-					{
-					DebugLocation(371, 16);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._collectionFunctionOrSubselect_in_inRhs1881);
-					collectionFunctionOrSubselect138=collectionFunctionOrSubselect();
-					PopFollow();
-
-					adaptor.AddChild(root_1, collectionFunctionOrSubselect138.Tree);
-
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// HqlSqlWalker.g:371:48: ( expr )*
-					{
-					DebugLocation(371, 48);
-					// HqlSqlWalker.g:371:48: ( expr )*
-					try { DebugEnterSubRule(48);
-					while (true)
-					{
-						int alt48=2;
-						try { DebugEnterDecision(48, false);
-						int LA48_1 = input.LA(1);
-
-						if ((LA48_1==AGGREGATE||LA48_1==BAND||(LA48_1>=BNOT && LA48_1<=BOR)||(LA48_1>=BXOR && LA48_1<=CASE2)||LA48_1==COLON||LA48_1==COUNT||(LA48_1>=DIV && LA48_1<=DOT)||LA48_1==FALSE||LA48_1==IDENT||LA48_1==INDEX_OP||LA48_1==JAVA_CONSTANT||LA48_1==METHOD_CALL||LA48_1==MINUS||(LA48_1>=NULL && LA48_1<=NUM_LONG)||(LA48_1>=PARAM && LA48_1<=PLUS)||LA48_1==QUOTED_String||LA48_1==STAR||(LA48_1>=TRUE && LA48_1<=UNARY_MINUS)||LA48_1==VECTOR_EXPR||LA48_1==WEIRD_IDENT))
-						{
-							alt48 = 1;
-						}
-
-
-						} finally { DebugExitDecision(48); }
-						switch ( alt48 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// HqlSqlWalker.g:371:48: expr
-							{
-							DebugLocation(371, 48);
-
-							_last = (IASTNode)input.LT(1);
-							PushFollow(Follow._expr_in_inRhs1885);
-							expr139=expr();
-							PopFollow();
-
-							adaptor.AddChild(root_1, expr139.Tree);
-
-
-							}
-							break;
-
-						default:
-							goto loop48;
-						}
-					}
-
-					loop48:
-						;
-
-					} finally { DebugExitSubRule(48); }
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(49); }
-
-
-				Match(input, TokenTypes.Up, null); 
-			}
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("inRhs", 40);
-			LeaveRule("inRhs", 40);
-			LeaveRule_inRhs();
-		}
-		DebugLocation(372, 1);
-		} finally { DebugExitRule(GrammarFileName, "inRhs"); }
-		return retval;
-
-	}
-	// $ANTLR end "inRhs"
-
-	partial void EnterRule_exprOrSubquery();
-	partial void LeaveRule_exprOrSubquery();
-	// $ANTLR start "exprOrSubquery"
-	// HqlSqlWalker.g:374:1: exprOrSubquery : ( expr | query | ^( ANY collectionFunctionOrSubselect ) | ^( ALL collectionFunctionOrSubselect ) | ^( SOME collectionFunctionOrSubselect ) );
-	[GrammarRule("exprOrSubquery")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery()
-	{
-		EnterRule_exprOrSubquery();
-		EnterRule("exprOrSubquery", 41);
-		TraceIn("exprOrSubquery", 41);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode ANY142 = default(IASTNode);
-		IASTNode ALL144 = default(IASTNode);
-		IASTNode SOME146 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr140 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> query141 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> collectionFunctionOrSubselect143 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> collectionFunctionOrSubselect145 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> collectionFunctionOrSubselect147 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode ANY142_tree = default(IASTNode);
-		IASTNode ALL144_tree = default(IASTNode);
-		IASTNode SOME146_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "exprOrSubquery");
-		DebugLocation(374, 1);
-		try
-		{
-			// HqlSqlWalker.g:375:2: ( expr | query | ^( ANY collectionFunctionOrSubselect ) | ^( ALL collectionFunctionOrSubselect ) | ^( SOME collectionFunctionOrSubselect ) )
-			int alt50=5;
-			try { DebugEnterDecision(50, false);
-			switch (input.LA(1))
-			{
-			case AGGREGATE:
-			case BAND:
-			case BNOT:
-			case BOR:
-			case BXOR:
-			case CASE:
-			case CASE2:
-			case COLON:
-			case COUNT:
-			case DIV:
-			case DOT:
-			case FALSE:
-			case IDENT:
-			case INDEX_OP:
-			case JAVA_CONSTANT:
-			case METHOD_CALL:
-			case MINUS:
-			case NULL:
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case PARAM:
-			case PLUS:
-			case QUOTED_String:
-			case STAR:
-			case TRUE:
-			case UNARY_MINUS:
-			case VECTOR_EXPR:
-			case WEIRD_IDENT:
-				{
-				alt50 = 1;
-				}
-				break;
-			case QUERY:
-			case UNION:
-				{
-				alt50 = 2;
-				}
-				break;
-			case ANY:
-				{
-				alt50 = 3;
-				}
-				break;
-			case ALL:
-				{
-				alt50 = 4;
-				}
-				break;
-			case SOME:
-				{
-				alt50 = 5;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 50, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(50); }
-			switch (alt50)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:375:4: expr
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(375, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._expr_in_exprOrSubquery1901);
-				expr140=expr();
-				PopFollow();
-
-				adaptor.AddChild(root_0, expr140.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:376:4: query
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(376, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._query_in_exprOrSubquery1906);
-				query141=query();
-				PopFollow();
-
-				adaptor.AddChild(root_0, query141.Tree);
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:377:4: ^( ANY collectionFunctionOrSubselect )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(377, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(377, 6);
-
-				_last = (IASTNode)input.LT(1);
-				ANY142=(IASTNode)Match(input,ANY,Follow._ANY_in_exprOrSubquery1912); 
-				ANY142_tree = (IASTNode)adaptor.DupNode(ANY142);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(ANY142_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(377, 10);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._collectionFunctionOrSubselect_in_exprOrSubquery1914);
-				collectionFunctionOrSubselect143=collectionFunctionOrSubselect();
-				PopFollow();
-
-				adaptor.AddChild(root_1, collectionFunctionOrSubselect143.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// HqlSqlWalker.g:378:4: ^( ALL collectionFunctionOrSubselect )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(378, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(378, 6);
-
-				_last = (IASTNode)input.LT(1);
-				ALL144=(IASTNode)Match(input,ALL,Follow._ALL_in_exprOrSubquery1921); 
-				ALL144_tree = (IASTNode)adaptor.DupNode(ALL144);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(ALL144_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(378, 10);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._collectionFunctionOrSubselect_in_exprOrSubquery1923);
-				collectionFunctionOrSubselect145=collectionFunctionOrSubselect();
-				PopFollow();
-
-				adaptor.AddChild(root_1, collectionFunctionOrSubselect145.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// HqlSqlWalker.g:379:4: ^( SOME collectionFunctionOrSubselect )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(379, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(379, 6);
-
-				_last = (IASTNode)input.LT(1);
-				SOME146=(IASTNode)Match(input,SOME,Follow._SOME_in_exprOrSubquery1930); 
-				SOME146_tree = (IASTNode)adaptor.DupNode(SOME146);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(SOME146_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(379, 11);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._collectionFunctionOrSubselect_in_exprOrSubquery1932);
-				collectionFunctionOrSubselect147=collectionFunctionOrSubselect();
-				PopFollow();
-
-				adaptor.AddChild(root_1, collectionFunctionOrSubselect147.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("exprOrSubquery", 41);
-			LeaveRule("exprOrSubquery", 41);
-			LeaveRule_exprOrSubquery();
-		}
-		DebugLocation(380, 1);
-		} finally { DebugExitRule(GrammarFileName, "exprOrSubquery"); }
-		return retval;
-
-	}
-	// $ANTLR end "exprOrSubquery"
-
-	partial void EnterRule_collectionFunctionOrSubselect();
-	partial void LeaveRule_collectionFunctionOrSubselect();
-	// $ANTLR start "collectionFunctionOrSubselect"
-	// HqlSqlWalker.g:382:1: collectionFunctionOrSubselect : ( collectionFunction | query );
-	[GrammarRule("collectionFunctionOrSubselect")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> collectionFunctionOrSubselect()
-	{
-		EnterRule_collectionFunctionOrSubselect();
-		EnterRule("collectionFunctionOrSubselect", 42);
-		TraceIn("collectionFunctionOrSubselect", 42);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> collectionFunction148 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> query149 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "collectionFunctionOrSubselect");
-		DebugLocation(382, 1);
-		try
-		{
-			// HqlSqlWalker.g:383:2: ( collectionFunction | query )
-			int alt51=2;
-			try { DebugEnterDecision(51, false);
-			int LA51_1 = input.LA(1);
-
-			if ((LA51_1==ELEMENTS||LA51_1==INDICES))
-			{
-				alt51 = 1;
-			}
-			else if ((LA51_1==QUERY||LA51_1==UNION))
-			{
-				alt51 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 51, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(51); }
-			switch (alt51)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:383:4: collectionFunction
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(383, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._collectionFunction_in_collectionFunctionOrSubselect1945);
-				collectionFunction148=collectionFunction();
-				PopFollow();
-
-				adaptor.AddChild(root_0, collectionFunction148.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:384:4: query
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(384, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._query_in_collectionFunctionOrSubselect1950);
-				query149=query();
-				PopFollow();
-
-				adaptor.AddChild(root_0, query149.Tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("collectionFunctionOrSubselect", 42);
-			LeaveRule("collectionFunctionOrSubselect", 42);
-			LeaveRule_collectionFunctionOrSubselect();
-		}
-		DebugLocation(385, 1);
-		} finally { DebugExitRule(GrammarFileName, "collectionFunctionOrSubselect"); }
-		return retval;
-
-	}
-	// $ANTLR end "collectionFunctionOrSubselect"
-
-	partial void EnterRule_expr();
-	partial void LeaveRule_expr();
-	// $ANTLR start "expr"
-	// HqlSqlWalker.g:387:1: expr : (ae= addrExpr[ true ] | ^( VECTOR_EXPR ( expr )* ) | constant | arithmeticExpr | functionCall | parameter | count );
-	[GrammarRule("expr")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> expr()
-	{
-		EnterRule_expr();
-		EnterRule("expr", 43);
-		TraceIn("expr", 43);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode VECTOR_EXPR150 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> ae = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr151 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> constant152 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> arithmeticExpr153 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> functionCall154 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> parameter155 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> count156 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode VECTOR_EXPR150_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "expr");
-		DebugLocation(387, 1);
-		try
-		{
-			// HqlSqlWalker.g:388:2: (ae= addrExpr[ true ] | ^( VECTOR_EXPR ( expr )* ) | constant | arithmeticExpr | functionCall | parameter | count )
-			int alt53=7;
-			try { DebugEnterDecision(53, false);
-			switch (input.LA(1))
-			{
-			case DOT:
-			case IDENT:
-			case INDEX_OP:
-			case WEIRD_IDENT:
-				{
-				alt53 = 1;
-				}
-				break;
-			case VECTOR_EXPR:
-				{
-				alt53 = 2;
-				}
-				break;
-			case FALSE:
-			case JAVA_CONSTANT:
-			case NULL:
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case QUOTED_String:
-			case TRUE:
-				{
-				alt53 = 3;
-				}
-				break;
-			case BAND:
-			case BNOT:
-			case BOR:
-			case BXOR:
-			case CASE:
-			case CASE2:
-			case DIV:
-			case MINUS:
-			case PLUS:
-			case STAR:
-			case UNARY_MINUS:
-				{
-				alt53 = 4;
-				}
-				break;
-			case AGGREGATE:
-			case METHOD_CALL:
-				{
-				alt53 = 5;
-				}
-				break;
-			case COLON:
-			case PARAM:
-				{
-				alt53 = 6;
-				}
-				break;
-			case COUNT:
-				{
-				alt53 = 7;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 53, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(53); }
-			switch (alt53)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:388:4: ae= addrExpr[ true ]
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(388, 6);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._addrExpr_in_expr1964);
-				ae=addrExpr(true);
-				PopFollow();
-
-				adaptor.AddChild(root_0, ae.Tree);
-
-				DebugLocation(388, 25);
-				 Resolve((ae!=null?((IASTNode)ae.Tree):default(IASTNode))); 
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:389:4: ^( VECTOR_EXPR ( expr )* )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(389, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(389, 7);
-
-				_last = (IASTNode)input.LT(1);
-				VECTOR_EXPR150=(IASTNode)Match(input,VECTOR_EXPR,Follow._VECTOR_EXPR_in_expr1976); 
-				VECTOR_EXPR150_tree = (IASTNode)adaptor.DupNode(VECTOR_EXPR150);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(VECTOR_EXPR150_tree, root_1);
-
-
-				if (input.LA(1) == TokenTypes.Down) {
-					Match(input, TokenTypes.Down, null); 
-					DebugLocation(389, 19);
-					// HqlSqlWalker.g:389:19: ( expr )*
-					try { DebugEnterSubRule(52);
-					while (true)
-					{
-						int alt52=2;
-						try { DebugEnterDecision(52, false);
-						int LA52_1 = input.LA(1);
-
-						if ((LA52_1==AGGREGATE||LA52_1==BAND||(LA52_1>=BNOT && LA52_1<=BOR)||(LA52_1>=BXOR && LA52_1<=CASE2)||LA52_1==COLON||LA52_1==COUNT||(LA52_1>=DIV && LA52_1<=DOT)||LA52_1==FALSE||LA52_1==IDENT||LA52_1==INDEX_OP||LA52_1==JAVA_CONSTANT||LA52_1==METHOD_CALL||LA52_1==MINUS||(LA52_1>=NULL && LA52_1<=NUM_LONG)||(LA52_1>=PARAM && LA52_1<=PLUS)||LA52_1==QUOTED_String||LA52_1==STAR||(LA52_1>=TRUE && LA52_1<=UNARY_MINUS)||LA52_1==VECTOR_EXPR||LA52_1==WEIRD_IDENT))
-						{
-							alt52 = 1;
-						}
-
-
-						} finally { DebugExitDecision(52); }
-						switch ( alt52 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// HqlSqlWalker.g:389:20: expr
-							{
-							DebugLocation(389, 20);
-
-							_last = (IASTNode)input.LT(1);
-							PushFollow(Follow._expr_in_expr1979);
-							expr151=expr();
-							PopFollow();
-
-							adaptor.AddChild(root_1, expr151.Tree);
-
-
-							}
-							break;
-
-						default:
-							goto loop52;
-						}
-					}
-
-					loop52:
-						;
-
-					} finally { DebugExitSubRule(52); }
-
-
-					Match(input, TokenTypes.Up, null); 
-				}
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:390:4: constant
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(390, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._constant_in_expr1988);
-				constant152=constant();
-				PopFollow();
-
-				adaptor.AddChild(root_0, constant152.Tree);
-
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// HqlSqlWalker.g:391:4: arithmeticExpr
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(391, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._arithmeticExpr_in_expr1993);
-				arithmeticExpr153=arithmeticExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_0, arithmeticExpr153.Tree);
-
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// HqlSqlWalker.g:392:4: functionCall
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(392, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._functionCall_in_expr1998);
-				functionCall154=functionCall();
-				PopFollow();
-
-				adaptor.AddChild(root_0, functionCall154.Tree);
-
-
-				}
-				break;
-			case 6:
-				DebugEnterAlt(6);
-				// HqlSqlWalker.g:393:4: parameter
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(393, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._parameter_in_expr2010);
-				parameter155=parameter();
-				PopFollow();
-
-				adaptor.AddChild(root_0, parameter155.Tree);
-
-
-				}
-				break;
-			case 7:
-				DebugEnterAlt(7);
-				// HqlSqlWalker.g:394:4: count
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(394, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._count_in_expr2015);
-				count156=count();
-				PopFollow();
-
-				adaptor.AddChild(root_0, count156.Tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("expr", 43);
-			LeaveRule("expr", 43);
-			LeaveRule_expr();
-		}
-		DebugLocation(395, 1);
-		} finally { DebugExitRule(GrammarFileName, "expr"); }
-		return retval;
-
-	}
-	// $ANTLR end "expr"
-
-	partial void EnterRule_arithmeticExpr();
-	partial void LeaveRule_arithmeticExpr();
-	// $ANTLR start "arithmeticExpr"
-	// HqlSqlWalker.g:397:1: arithmeticExpr : ( ^( PLUS exprOrSubquery exprOrSubquery ) | ^( MINUS exprOrSubquery exprOrSubquery ) | ^( DIV exprOrSubquery exprOrSubquery ) | ^( STAR exprOrSubquery exprOrSubquery ) | ^( BNOT exprOrSubquery ) | ^( BAND exprOrSubquery exprOrSubquery ) | ^( BOR exprOrSubquery exprOrSubquery ) | ^( BXOR exprOrSubquery exprOrSubquery ) | ^( UNARY_MINUS exprOrSubquery ) |c= caseExpr );
-	[GrammarRule("arithmeticExpr")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> arithmeticExpr()
-	{
-		EnterRule_arithmeticExpr();
-		EnterRule("arithmeticExpr", 44);
-		TraceIn("arithmeticExpr", 44);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode PLUS157 = default(IASTNode);
-		IASTNode MINUS160 = default(IASTNode);
-		IASTNode DIV163 = default(IASTNode);
-		IASTNode STAR166 = default(IASTNode);
-		IASTNode BNOT169 = default(IASTNode);
-		IASTNode BAND171 = default(IASTNode);
-		IASTNode BOR174 = default(IASTNode);
-		IASTNode BXOR177 = default(IASTNode);
-		IASTNode UNARY_MINUS180 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> c = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery158 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery159 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery161 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery162 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery164 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery165 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery167 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery168 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery170 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery172 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery173 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery175 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery176 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery178 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery179 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> exprOrSubquery181 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode PLUS157_tree = default(IASTNode);
-		IASTNode MINUS160_tree = default(IASTNode);
-		IASTNode DIV163_tree = default(IASTNode);
-		IASTNode STAR166_tree = default(IASTNode);
-		IASTNode BNOT169_tree = default(IASTNode);
-		IASTNode BAND171_tree = default(IASTNode);
-		IASTNode BOR174_tree = default(IASTNode);
-		IASTNode BXOR177_tree = default(IASTNode);
-		IASTNode UNARY_MINUS180_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "arithmeticExpr");
-		DebugLocation(397, 1);
-		try
-		{
-			// HqlSqlWalker.g:404:2: ( ^( PLUS exprOrSubquery exprOrSubquery ) | ^( MINUS exprOrSubquery exprOrSubquery ) | ^( DIV exprOrSubquery exprOrSubquery ) | ^( STAR exprOrSubquery exprOrSubquery ) | ^( BNOT exprOrSubquery ) | ^( BAND exprOrSubquery exprOrSubquery ) | ^( BOR exprOrSubquery exprOrSubquery ) | ^( BXOR exprOrSubquery exprOrSubquery ) | ^( UNARY_MINUS exprOrSubquery ) |c= caseExpr )
-			int alt54=10;
-			try { DebugEnterDecision(54, false);
-			switch (input.LA(1))
-			{
-			case PLUS:
-				{
-				alt54 = 1;
-				}
-				break;
-			case MINUS:
-				{
-				alt54 = 2;
-				}
-				break;
-			case DIV:
-				{
-				alt54 = 3;
-				}
-				break;
-			case STAR:
-				{
-				alt54 = 4;
-				}
-				break;
-			case BNOT:
-				{
-				alt54 = 5;
-				}
-				break;
-			case BAND:
-				{
-				alt54 = 6;
-				}
-				break;
-			case BOR:
-				{
-				alt54 = 7;
-				}
-				break;
-			case BXOR:
-				{
-				alt54 = 8;
-				}
-				break;
-			case UNARY_MINUS:
-				{
-				alt54 = 9;
-				}
-				break;
-			case CASE:
-			case CASE2:
-				{
-				alt54 = 10;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 54, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(54); }
-			switch (alt54)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:404:4: ^( PLUS exprOrSubquery exprOrSubquery )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(404, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(404, 6);
-
-				_last = (IASTNode)input.LT(1);
-				PLUS157=(IASTNode)Match(input,PLUS,Follow._PLUS_in_arithmeticExpr2043); 
-				PLUS157_tree = (IASTNode)adaptor.DupNode(PLUS157);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(PLUS157_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(404, 11);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2045);
-				exprOrSubquery158=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery158.Tree);
-
-				DebugLocation(404, 26);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2047);
-				exprOrSubquery159=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery159.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:405:4: ^( MINUS exprOrSubquery exprOrSubquery )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(405, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(405, 6);
-
-				_last = (IASTNode)input.LT(1);
-				MINUS160=(IASTNode)Match(input,MINUS,Follow._MINUS_in_arithmeticExpr2054); 
-				MINUS160_tree = (IASTNode)adaptor.DupNode(MINUS160);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(MINUS160_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(405, 12);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2056);
-				exprOrSubquery161=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery161.Tree);
-
-				DebugLocation(405, 27);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2058);
-				exprOrSubquery162=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery162.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:406:4: ^( DIV exprOrSubquery exprOrSubquery )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(406, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(406, 6);
-
-				_last = (IASTNode)input.LT(1);
-				DIV163=(IASTNode)Match(input,DIV,Follow._DIV_in_arithmeticExpr2065); 
-				DIV163_tree = (IASTNode)adaptor.DupNode(DIV163);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(DIV163_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(406, 10);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2067);
-				exprOrSubquery164=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery164.Tree);
-
-				DebugLocation(406, 25);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2069);
-				exprOrSubquery165=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery165.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// HqlSqlWalker.g:407:4: ^( STAR exprOrSubquery exprOrSubquery )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(407, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(407, 6);
-
-				_last = (IASTNode)input.LT(1);
-				STAR166=(IASTNode)Match(input,STAR,Follow._STAR_in_arithmeticExpr2076); 
-				STAR166_tree = (IASTNode)adaptor.DupNode(STAR166);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(STAR166_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(407, 11);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2078);
-				exprOrSubquery167=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery167.Tree);
-
-				DebugLocation(407, 26);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2080);
-				exprOrSubquery168=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery168.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// HqlSqlWalker.g:408:4: ^( BNOT exprOrSubquery )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(408, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(408, 6);
-
-				_last = (IASTNode)input.LT(1);
-				BNOT169=(IASTNode)Match(input,BNOT,Follow._BNOT_in_arithmeticExpr2087); 
-				BNOT169_tree = (IASTNode)adaptor.DupNode(BNOT169);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(BNOT169_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(408, 11);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2089);
-				exprOrSubquery170=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery170.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 6:
-				DebugEnterAlt(6);
-				// HqlSqlWalker.g:409:4: ^( BAND exprOrSubquery exprOrSubquery )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(409, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(409, 6);
-
-				_last = (IASTNode)input.LT(1);
-				BAND171=(IASTNode)Match(input,BAND,Follow._BAND_in_arithmeticExpr2096); 
-				BAND171_tree = (IASTNode)adaptor.DupNode(BAND171);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(BAND171_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(409, 11);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2098);
-				exprOrSubquery172=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery172.Tree);
-
-				DebugLocation(409, 26);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2100);
-				exprOrSubquery173=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery173.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 7:
-				DebugEnterAlt(7);
-				// HqlSqlWalker.g:410:4: ^( BOR exprOrSubquery exprOrSubquery )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(410, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(410, 6);
-
-				_last = (IASTNode)input.LT(1);
-				BOR174=(IASTNode)Match(input,BOR,Follow._BOR_in_arithmeticExpr2107); 
-				BOR174_tree = (IASTNode)adaptor.DupNode(BOR174);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(BOR174_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(410, 10);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2109);
-				exprOrSubquery175=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery175.Tree);
-
-				DebugLocation(410, 25);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2111);
-				exprOrSubquery176=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery176.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 8:
-				DebugEnterAlt(8);
-				// HqlSqlWalker.g:411:4: ^( BXOR exprOrSubquery exprOrSubquery )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(411, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(411, 6);
-
-				_last = (IASTNode)input.LT(1);
-				BXOR177=(IASTNode)Match(input,BXOR,Follow._BXOR_in_arithmeticExpr2118); 
-				BXOR177_tree = (IASTNode)adaptor.DupNode(BXOR177);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(BXOR177_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(411, 11);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2120);
-				exprOrSubquery178=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery178.Tree);
-
-				DebugLocation(411, 26);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2122);
-				exprOrSubquery179=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery179.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 9:
-				DebugEnterAlt(9);
-				// HqlSqlWalker.g:413:4: ^( UNARY_MINUS exprOrSubquery )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(413, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(413, 6);
-
-				_last = (IASTNode)input.LT(1);
-				UNARY_MINUS180=(IASTNode)Match(input,UNARY_MINUS,Follow._UNARY_MINUS_in_arithmeticExpr2130); 
-				UNARY_MINUS180_tree = (IASTNode)adaptor.DupNode(UNARY_MINUS180);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(UNARY_MINUS180_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(413, 18);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._exprOrSubquery_in_arithmeticExpr2132);
-				exprOrSubquery181=exprOrSubquery();
-				PopFollow();
-
-				adaptor.AddChild(root_1, exprOrSubquery181.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-			case 10:
-				DebugEnterAlt(10);
-				// HqlSqlWalker.g:414:4: c= caseExpr
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(414, 5);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._caseExpr_in_arithmeticExpr2140);
-				c=caseExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_0, c.Tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-					if ((c!=null?((IASTNode)c.Tree):default(IASTNode)) == null)
-					{
-						PrepareArithmeticOperator( retval.Tree );
-					}
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("arithmeticExpr", 44);
-			LeaveRule("arithmeticExpr", 44);
-			LeaveRule_arithmeticExpr();
-		}
-		DebugLocation(415, 1);
-		} finally { DebugExitRule(GrammarFileName, "arithmeticExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "arithmeticExpr"
-
-	partial void EnterRule_caseExpr();
-	partial void LeaveRule_caseExpr();
-	// $ANTLR start "caseExpr"
-	// HqlSqlWalker.g:417:1: caseExpr : ( ^( CASE ( ^( WHEN logicalExpr expr ) )+ ( ^( ELSE expr ) )? ) | ^( CASE2 expr ( ^( WHEN expr expr ) )+ ( ^( ELSE expr ) )? ) );
-	[GrammarRule("caseExpr")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> caseExpr()
-	{
-		EnterRule_caseExpr();
-		EnterRule("caseExpr", 45);
-		TraceIn("caseExpr", 45);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode CASE182 = default(IASTNode);
-		IASTNode WHEN183 = default(IASTNode);
-		IASTNode ELSE186 = default(IASTNode);
-		IASTNode CASE2188 = default(IASTNode);
-		IASTNode WHEN190 = default(IASTNode);
-		IASTNode ELSE193 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> logicalExpr184 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr185 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr187 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr189 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr191 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr192 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr194 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode CASE182_tree = default(IASTNode);
-		IASTNode WHEN183_tree = default(IASTNode);
-		IASTNode ELSE186_tree = default(IASTNode);
-		IASTNode CASE2188_tree = default(IASTNode);
-		IASTNode WHEN190_tree = default(IASTNode);
-		IASTNode ELSE193_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "caseExpr");
-		DebugLocation(417, 1);
-		try
-		{
-			// HqlSqlWalker.g:418:2: ( ^( CASE ( ^( WHEN logicalExpr expr ) )+ ( ^( ELSE expr ) )? ) | ^( CASE2 expr ( ^( WHEN expr expr ) )+ ( ^( ELSE expr ) )? ) )
-			int alt59=2;
-			try { DebugEnterDecision(59, false);
-			int LA59_1 = input.LA(1);
-
-			if ((LA59_1==CASE))
-			{
-				alt59 = 1;
-			}
-			else if ((LA59_1==CASE2))
-			{
-				alt59 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 59, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(59); }
-			switch (alt59)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:418:4: ^( CASE ( ^( WHEN logicalExpr expr ) )+ ( ^( ELSE expr ) )? )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(418, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(418, 6);
-
-				_last = (IASTNode)input.LT(1);
-				CASE182=(IASTNode)Match(input,CASE,Follow._CASE_in_caseExpr2152); 
-				CASE182_tree = (IASTNode)adaptor.DupNode(CASE182);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(CASE182_tree, root_1);
-
-
-				DebugLocation(418, 11);
-				 _inCase = true; 
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(418, 31);
-				// HqlSqlWalker.g:418:31: ( ^( WHEN logicalExpr expr ) )+
-				int cnt55=0;
-				try { DebugEnterSubRule(55);
-				while (true)
-				{
-					int alt55=2;
-					try { DebugEnterDecision(55, false);
-					int LA55_1 = input.LA(1);
-
-					if ((LA55_1==WHEN))
-					{
-						alt55 = 1;
-					}
-
-
-					} finally { DebugExitDecision(55); }
-					switch (alt55)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// HqlSqlWalker.g:418:32: ^( WHEN logicalExpr expr )
-						{
-						DebugLocation(418, 32);
-
-						_last = (IASTNode)input.LT(1);
-						{
-						IASTNode _save_last_2 = _last;
-						IASTNode _first_2 = default(IASTNode);
-						IASTNode root_2 = (IASTNode)adaptor.Nil();
-						DebugLocation(418, 34);
-
-						_last = (IASTNode)input.LT(1);
-						WHEN183=(IASTNode)Match(input,WHEN,Follow._WHEN_in_caseExpr2158); 
-						WHEN183_tree = (IASTNode)adaptor.DupNode(WHEN183);
-
-
-						root_2 = (IASTNode)adaptor.BecomeRoot(WHEN183_tree, root_2);
-
-
-						Match(input, TokenTypes.Down, null); 
-						DebugLocation(418, 39);
-
-						_last = (IASTNode)input.LT(1);
-						PushFollow(Follow._logicalExpr_in_caseExpr2160);
-						logicalExpr184=logicalExpr();
-						PopFollow();
-
-						adaptor.AddChild(root_2, logicalExpr184.Tree);
-
-						DebugLocation(418, 51);
-
-						_last = (IASTNode)input.LT(1);
-						PushFollow(Follow._expr_in_caseExpr2162);
-						expr185=expr();
-						PopFollow();
-
-						adaptor.AddChild(root_2, expr185.Tree);
-
-
-						Match(input, TokenTypes.Up, null); 
-						adaptor.AddChild(root_1, root_2);
-						_last = _save_last_2;
-						}
-
-
-						}
-						break;
-
-					default:
-						if (cnt55 >= 1)
-							goto loop55;
-
-						EarlyExitException eee55 = new EarlyExitException( 55, input );
-						DebugRecognitionException(eee55);
-						throw eee55;
-					}
-					cnt55++;
-				}
-				loop55:
-					;
-
-				} finally { DebugExitSubRule(55); }
-
-				DebugLocation(418, 59);
-				// HqlSqlWalker.g:418:59: ( ^( ELSE expr ) )?
-				int alt56=2;
-				try { DebugEnterSubRule(56);
-				try { DebugEnterDecision(56, false);
-				int LA56_1 = input.LA(1);
-
-				if ((LA56_1==ELSE))
-				{
-					alt56 = 1;
-				}
-				} finally { DebugExitDecision(56); }
-				switch (alt56)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:418:60: ^( ELSE expr )
-					{
-					DebugLocation(418, 60);
-
-					_last = (IASTNode)input.LT(1);
-					{
-					IASTNode _save_last_2 = _last;
-					IASTNode _first_2 = default(IASTNode);
-					IASTNode root_2 = (IASTNode)adaptor.Nil();
-					DebugLocation(418, 62);
-
-					_last = (IASTNode)input.LT(1);
-					ELSE186=(IASTNode)Match(input,ELSE,Follow._ELSE_in_caseExpr2169); 
-					ELSE186_tree = (IASTNode)adaptor.DupNode(ELSE186);
-
-
-					root_2 = (IASTNode)adaptor.BecomeRoot(ELSE186_tree, root_2);
-
-
-					Match(input, TokenTypes.Down, null); 
-					DebugLocation(418, 67);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._expr_in_caseExpr2171);
-					expr187=expr();
-					PopFollow();
-
-					adaptor.AddChild(root_2, expr187.Tree);
-
-
-					Match(input, TokenTypes.Up, null); 
-					adaptor.AddChild(root_1, root_2);
-					_last = _save_last_2;
-					}
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(56); }
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-				DebugLocation(418, 76);
-				 _inCase = false; 
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:419:4: ^( CASE2 expr ( ^( WHEN expr expr ) )+ ( ^( ELSE expr ) )? )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(419, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(419, 6);
-
-				_last = (IASTNode)input.LT(1);
-				CASE2188=(IASTNode)Match(input,CASE2,Follow._CASE2_in_caseExpr2183); 
-				CASE2188_tree = (IASTNode)adaptor.DupNode(CASE2188);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(CASE2188_tree, root_1);
-
-
-				DebugLocation(419, 12);
-				 _inCase = true; 
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(419, 32);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._expr_in_caseExpr2187);
-				expr189=expr();
-				PopFollow();
-
-				adaptor.AddChild(root_1, expr189.Tree);
-
-				DebugLocation(419, 37);
-				// HqlSqlWalker.g:419:37: ( ^( WHEN expr expr ) )+
-				int cnt57=0;
-				try { DebugEnterSubRule(57);
-				while (true)
-				{
-					int alt57=2;
-					try { DebugEnterDecision(57, false);
-					int LA57_1 = input.LA(1);
-
-					if ((LA57_1==WHEN))
-					{
-						alt57 = 1;
-					}
-
-
-					} finally { DebugExitDecision(57); }
-					switch (alt57)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// HqlSqlWalker.g:419:38: ^( WHEN expr expr )
-						{
-						DebugLocation(419, 38);
-
-						_last = (IASTNode)input.LT(1);
-						{
-						IASTNode _save_last_2 = _last;
-						IASTNode _first_2 = default(IASTNode);
-						IASTNode root_2 = (IASTNode)adaptor.Nil();
-						DebugLocation(419, 40);
-
-						_last = (IASTNode)input.LT(1);
-						WHEN190=(IASTNode)Match(input,WHEN,Follow._WHEN_in_caseExpr2191); 
-						WHEN190_tree = (IASTNode)adaptor.DupNode(WHEN190);
-
-
-						root_2 = (IASTNode)adaptor.BecomeRoot(WHEN190_tree, root_2);
-
-
-						Match(input, TokenTypes.Down, null); 
-						DebugLocation(419, 45);
-
-						_last = (IASTNode)input.LT(1);
-						PushFollow(Follow._expr_in_caseExpr2193);
-						expr191=expr();
-						PopFollow();
-
-						adaptor.AddChild(root_2, expr191.Tree);
-
-						DebugLocation(419, 50);
-
-						_last = (IASTNode)input.LT(1);
-						PushFollow(Follow._expr_in_caseExpr2195);
-						expr192=expr();
-						PopFollow();
-
-						adaptor.AddChild(root_2, expr192.Tree);
-
-
-						Match(input, TokenTypes.Up, null); 
-						adaptor.AddChild(root_1, root_2);
-						_last = _save_last_2;
-						}
-
-
-						}
-						break;
-
-					default:
-						if (cnt57 >= 1)
-							goto loop57;
-
-						EarlyExitException eee57 = new EarlyExitException( 57, input );
-						DebugRecognitionException(eee57);
-						throw eee57;
-					}
-					cnt57++;
-				}
-				loop57:
-					;
-
-				} finally { DebugExitSubRule(57); }
-
-				DebugLocation(419, 58);
-				// HqlSqlWalker.g:419:58: ( ^( ELSE expr ) )?
-				int alt58=2;
-				try { DebugEnterSubRule(58);
-				try { DebugEnterDecision(58, false);
-				int LA58_1 = input.LA(1);
-
-				if ((LA58_1==ELSE))
-				{
-					alt58 = 1;
-				}
-				} finally { DebugExitDecision(58); }
-				switch (alt58)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:419:59: ^( ELSE expr )
-					{
-					DebugLocation(419, 59);
-
-					_last = (IASTNode)input.LT(1);
-					{
-					IASTNode _save_last_2 = _last;
-					IASTNode _first_2 = default(IASTNode);
-					IASTNode root_2 = (IASTNode)adaptor.Nil();
-					DebugLocation(419, 61);
-
-					_last = (IASTNode)input.LT(1);
-					ELSE193=(IASTNode)Match(input,ELSE,Follow._ELSE_in_caseExpr2202); 
-					ELSE193_tree = (IASTNode)adaptor.DupNode(ELSE193);
-
-
-					root_2 = (IASTNode)adaptor.BecomeRoot(ELSE193_tree, root_2);
-
-
-					Match(input, TokenTypes.Down, null); 
-					DebugLocation(419, 66);
-
-					_last = (IASTNode)input.LT(1);
-					PushFollow(Follow._expr_in_caseExpr2204);
-					expr194=expr();
-					PopFollow();
-
-					adaptor.AddChild(root_2, expr194.Tree);
-
-
-					Match(input, TokenTypes.Up, null); 
-					adaptor.AddChild(root_1, root_2);
-					_last = _save_last_2;
-					}
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(58); }
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-				DebugLocation(419, 75);
-				 _inCase = false; 
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("caseExpr", 45);
-			LeaveRule("caseExpr", 45);
-			LeaveRule_caseExpr();
-		}
-		DebugLocation(420, 1);
-		} finally { DebugExitRule(GrammarFileName, "caseExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "caseExpr"
-
-	partial void EnterRule_collectionFunction();
-	partial void LeaveRule_collectionFunction();
-	// $ANTLR start "collectionFunction"
-	// HqlSqlWalker.g:424:1: collectionFunction : ( ^(e= ELEMENTS p1= propertyRef ) | ^(i= INDICES p2= propertyRef ) );
-	[GrammarRule("collectionFunction")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> collectionFunction()
-	{
-		EnterRule_collectionFunction();
-		EnterRule("collectionFunction", 46);
-		TraceIn("collectionFunction", 46);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode e = default(IASTNode);
-		IASTNode i = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> p1 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> p2 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode e_tree = default(IASTNode);
-		IASTNode i_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "collectionFunction");
-		DebugLocation(424, 1);
-		try
-		{
-			// HqlSqlWalker.g:425:2: ( ^(e= ELEMENTS p1= propertyRef ) | ^(i= INDICES p2= propertyRef ) )
-			int alt60=2;
-			try { DebugEnterDecision(60, false);
-			int LA60_1 = input.LA(1);
-
-			if ((LA60_1==ELEMENTS))
-			{
-				alt60 = 1;
-			}
-			else if ((LA60_1==INDICES))
-			{
-				alt60 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 60, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(60); }
-			switch (alt60)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:425:4: ^(e= ELEMENTS p1= propertyRef )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(425, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(425, 7);
-
-				_last = (IASTNode)input.LT(1);
-				e=(IASTNode)Match(input,ELEMENTS,Follow._ELEMENTS_in_collectionFunction2226); 
-				e_tree = (IASTNode)adaptor.DupNode(e);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(e_tree, root_1);
-
-
-				DebugLocation(425, 17);
-				_inFunctionCall=true;
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(425, 43);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._propertyRef_in_collectionFunction2232);
-				p1=propertyRef();
-				PopFollow();
-
-				adaptor.AddChild(root_1, p1.Tree);
-
-				DebugLocation(425, 56);
-				 Resolve((p1!=null?((IASTNode)p1.Tree):default(IASTNode))); 
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-				DebugLocation(426, 3);
-				 ProcessFunction(e_tree,_inSelect); 
-				DebugLocation(426, 43);
-				_inFunctionCall=false;
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:427:4: ^(i= INDICES p2= propertyRef )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(427, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(427, 7);
-
-				_last = (IASTNode)input.LT(1);
-				i=(IASTNode)Match(input,INDICES,Follow._INDICES_in_collectionFunction2251); 
-				i_tree = (IASTNode)adaptor.DupNode(i);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(i_tree, root_1);
-
-
-				DebugLocation(427, 16);
-				_inFunctionCall=true;
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(427, 42);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._propertyRef_in_collectionFunction2257);
-				p2=propertyRef();
-				PopFollow();
-
-				adaptor.AddChild(root_1, p2.Tree);
-
-				DebugLocation(427, 55);
-				 Resolve((p2!=null?((IASTNode)p2.Tree):default(IASTNode))); 
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-				DebugLocation(428, 3);
-				 ProcessFunction(i_tree,_inSelect); 
-				DebugLocation(428, 43);
-				_inFunctionCall=false;
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("collectionFunction", 46);
-			LeaveRule("collectionFunction", 46);
-			LeaveRule_collectionFunction();
-		}
-		DebugLocation(429, 1);
-		} finally { DebugExitRule(GrammarFileName, "collectionFunction"); }
-		return retval;
-
-	}
-	// $ANTLR end "collectionFunction"
-
-	partial void EnterRule_functionCall();
-	partial void LeaveRule_functionCall();
-	// $ANTLR start "functionCall"
-	// HqlSqlWalker.g:431:1: functionCall : ( ^(m= METHOD_CALL pathAsIdent ( ^( EXPR_LIST ( expr | query | comparisonExpr )* ) )? ) | ^( AGGREGATE aggregateExpr ) );
-	[GrammarRule("functionCall")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> functionCall()
-	{
-		EnterRule_functionCall();
-		EnterRule("functionCall", 47);
-		TraceIn("functionCall", 47);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode m = default(IASTNode);
-		IASTNode EXPR_LIST196 = default(IASTNode);
-		IASTNode AGGREGATE200 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> pathAsIdent195 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> expr197 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> query198 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> comparisonExpr199 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> aggregateExpr201 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode m_tree = default(IASTNode);
-		IASTNode EXPR_LIST196_tree = default(IASTNode);
-		IASTNode AGGREGATE200_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "functionCall");
-		DebugLocation(431, 1);
-		try
-		{
-			// HqlSqlWalker.g:432:2: ( ^(m= METHOD_CALL pathAsIdent ( ^( EXPR_LIST ( expr | query | comparisonExpr )* ) )? ) | ^( AGGREGATE aggregateExpr ) )
-			int alt63=2;
-			try { DebugEnterDecision(63, false);
-			int LA63_1 = input.LA(1);
-
-			if ((LA63_1==METHOD_CALL))
-			{
-				alt63 = 1;
-			}
-			else if ((LA63_1==AGGREGATE))
-			{
-				alt63 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 63, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(63); }
-			switch (alt63)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:432:4: ^(m= METHOD_CALL pathAsIdent ( ^( EXPR_LIST ( expr | query | comparisonExpr )* ) )? )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(432, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(432, 7);
-
-				_last = (IASTNode)input.LT(1);
-				m=(IASTNode)Match(input,METHOD_CALL,Follow._METHOD_CALL_in_functionCall2282); 
-				m_tree = (IASTNode)adaptor.DupNode(m);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(m_tree, root_1);
-
-
-				DebugLocation(432, 21);
-				_inFunctionCall=true;
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(432, 45);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._pathAsIdent_in_functionCall2287);
-				pathAsIdent195=pathAsIdent();
-				PopFollow();
-
-				adaptor.AddChild(root_1, pathAsIdent195.Tree);
-
-				DebugLocation(432, 57);
-				// HqlSqlWalker.g:432:57: ( ^( EXPR_LIST ( expr | query | comparisonExpr )* ) )?
-				int alt62=2;
-				try { DebugEnterSubRule(62);
-				try { DebugEnterDecision(62, false);
-				int LA62_1 = input.LA(1);
-
-				if ((LA62_1==EXPR_LIST))
-				{
-					alt62 = 1;
-				}
-				} finally { DebugExitDecision(62); }
-				switch (alt62)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// HqlSqlWalker.g:432:59: ^( EXPR_LIST ( expr | query | comparisonExpr )* )
-					{
-					DebugLocation(432, 59);
-
-					_last = (IASTNode)input.LT(1);
-					{
-					IASTNode _save_last_2 = _last;
-					IASTNode _first_2 = default(IASTNode);
-					IASTNode root_2 = (IASTNode)adaptor.Nil();
-					DebugLocation(432, 61);
-
-					_last = (IASTNode)input.LT(1);
-					EXPR_LIST196=(IASTNode)Match(input,EXPR_LIST,Follow._EXPR_LIST_in_functionCall2292); 
-					EXPR_LIST196_tree = (IASTNode)adaptor.DupNode(EXPR_LIST196);
-
-
-					root_2 = (IASTNode)adaptor.BecomeRoot(EXPR_LIST196_tree, root_2);
-
-
-					if (input.LA(1) == TokenTypes.Down) {
-						Match(input, TokenTypes.Down, null); 
-						DebugLocation(432, 71);
-						// HqlSqlWalker.g:432:71: ( expr | query | comparisonExpr )*
-						try { DebugEnterSubRule(61);
-						while (true)
-						{
-							int alt61=4;
-							try { DebugEnterDecision(61, false);
-							switch (input.LA(1))
-							{
-							case AGGREGATE:
-							case BAND:
-							case BNOT:
-							case BOR:
-							case BXOR:
-							case CASE:
-							case CASE2:
-							case COLON:
-							case COUNT:
-							case DIV:
-							case DOT:
-							case FALSE:
-							case IDENT:
-							case INDEX_OP:
-							case JAVA_CONSTANT:
-							case METHOD_CALL:
-							case MINUS:
-							case NULL:
-							case NUM_DECIMAL:
-							case NUM_DOUBLE:
-							case NUM_FLOAT:
-							case NUM_INT:
-							case NUM_LONG:
-							case PARAM:
-							case PLUS:
-							case QUOTED_String:
-							case STAR:
-							case TRUE:
-							case UNARY_MINUS:
-							case VECTOR_EXPR:
-							case WEIRD_IDENT:
-								{
-								alt61 = 1;
-								}
-								break;
-							case QUERY:
-							case UNION:
-								{
-								alt61 = 2;
-								}
-								break;
-							case BETWEEN:
-							case EQ:
-							case EXISTS:
-							case GE:
-							case GT:
-							case IN:
-							case IS_NOT_NULL:
-							case IS_NULL:
-							case LE:
-							case LIKE:
-							case LT:
-							case NE:
-							case NOT_BETWEEN:
-							case NOT_IN:
-							case NOT_LIKE:
-								{
-								alt61 = 3;
-								}
-								break;
-							}
-
-							} finally { DebugExitDecision(61); }
-							switch ( alt61 )
-							{
-							case 1:
-								DebugEnterAlt(1);
-								// HqlSqlWalker.g:432:72: expr
-								{
-								DebugLocation(432, 72);
-
-								_last = (IASTNode)input.LT(1);
-								PushFollow(Follow._expr_in_functionCall2295);
-								expr197=expr();
-								PopFollow();
-
-								adaptor.AddChild(root_2, expr197.Tree);
-
-
-								}
-								break;
-							case 2:
-								DebugEnterAlt(2);
-								// HqlSqlWalker.g:432:79: query
-								{
-								DebugLocation(432, 79);
-
-								_last = (IASTNode)input.LT(1);
-								PushFollow(Follow._query_in_functionCall2299);
-								query198=query();
-								PopFollow();
-
-								adaptor.AddChild(root_2, query198.Tree);
-
-
-								}
-								break;
-							case 3:
-								DebugEnterAlt(3);
-								// HqlSqlWalker.g:432:87: comparisonExpr
-								{
-								DebugLocation(432, 87);
-
-								_last = (IASTNode)input.LT(1);
-								PushFollow(Follow._comparisonExpr_in_functionCall2303);
-								comparisonExpr199=comparisonExpr();
-								PopFollow();
-
-								adaptor.AddChild(root_2, comparisonExpr199.Tree);
-
-
-								}
-								break;
-
-							default:
-								goto loop61;
-							}
-						}
-
-						loop61:
-							;
-
-						} finally { DebugExitSubRule(61); }
-
-
-						Match(input, TokenTypes.Up, null); 
-					}
-					adaptor.AddChild(root_1, root_2);
-					_last = _save_last_2;
-					}
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(62); }
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-				DebugLocation(433, 3);
-				 ProcessFunction(m_tree,_inSelect); _inFunctionCall=false; 
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:434:4: ^( AGGREGATE aggregateExpr )
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(434, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(434, 6);
-
-				_last = (IASTNode)input.LT(1);
-				AGGREGATE200=(IASTNode)Match(input,AGGREGATE,Follow._AGGREGATE_in_functionCall2322); 
-				AGGREGATE200_tree = (IASTNode)adaptor.DupNode(AGGREGATE200);
-
-
-				root_1 = (IASTNode)adaptor.BecomeRoot(AGGREGATE200_tree, root_1);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(434, 16);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._aggregateExpr_in_functionCall2324);
-				aggregateExpr201=aggregateExpr();
-				PopFollow();
-
-				adaptor.AddChild(root_1, aggregateExpr201.Tree);
-
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("functionCall", 47);
-			LeaveRule("functionCall", 47);
-			LeaveRule_functionCall();
-		}
-		DebugLocation(435, 1);
-		} finally { DebugExitRule(GrammarFileName, "functionCall"); }
-		return retval;
-
-	}
-	// $ANTLR end "functionCall"
-
-	partial void EnterRule_constant();
-	partial void LeaveRule_constant();
-	// $ANTLR start "constant"
-	// HqlSqlWalker.g:437:1: constant : ( literal | NULL |t= TRUE |f= FALSE | JAVA_CONSTANT );
-	[GrammarRule("constant")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> constant()
-	{
-		EnterRule_constant();
-		EnterRule("constant", 48);
-		TraceIn("constant", 48);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode t = default(IASTNode);
-		IASTNode f = default(IASTNode);
-		IASTNode NULL203 = default(IASTNode);
-		IASTNode JAVA_CONSTANT204 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> literal202 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode t_tree = default(IASTNode);
-		IASTNode f_tree = default(IASTNode);
-		IASTNode NULL203_tree = default(IASTNode);
-		IASTNode JAVA_CONSTANT204_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "constant");
-		DebugLocation(437, 1);
-		try
-		{
-			// HqlSqlWalker.g:438:2: ( literal | NULL |t= TRUE |f= FALSE | JAVA_CONSTANT )
-			int alt64=5;
-			try { DebugEnterDecision(64, false);
-			switch (input.LA(1))
-			{
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case QUOTED_String:
-				{
-				alt64 = 1;
-				}
-				break;
-			case NULL:
-				{
-				alt64 = 2;
-				}
-				break;
-			case TRUE:
-				{
-				alt64 = 3;
-				}
-				break;
-			case FALSE:
-				{
-				alt64 = 4;
-				}
-				break;
-			case JAVA_CONSTANT:
-				{
-				alt64 = 5;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 64, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(64); }
-			switch (alt64)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:438:4: literal
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(438, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._literal_in_constant2337);
-				literal202=literal();
-				PopFollow();
-
-				adaptor.AddChild(root_0, literal202.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:439:4: NULL
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(439, 4);
-
-				_last = (IASTNode)input.LT(1);
-				NULL203=(IASTNode)Match(input,NULL,Follow._NULL_in_constant2342); 
-				NULL203_tree = (IASTNode)adaptor.DupNode(NULL203);
-
-
-				adaptor.AddChild(root_0, NULL203_tree);
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:440:4: t= TRUE
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(440, 5);
-
-				_last = (IASTNode)input.LT(1);
-				t=(IASTNode)Match(input,TRUE,Follow._TRUE_in_constant2349); 
-				t_tree = (IASTNode)adaptor.DupNode(t);
-
-
-				adaptor.AddChild(root_0, t_tree);
-
-				DebugLocation(440, 11);
-				 ProcessBool(t); 
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// HqlSqlWalker.g:441:4: f= FALSE
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(441, 5);
-
-				_last = (IASTNode)input.LT(1);
-				f=(IASTNode)Match(input,FALSE,Follow._FALSE_in_constant2359); 
-				f_tree = (IASTNode)adaptor.DupNode(f);
-
-
-				adaptor.AddChild(root_0, f_tree);
-
-				DebugLocation(441, 12);
-				 ProcessBool(f); 
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// HqlSqlWalker.g:442:4: JAVA_CONSTANT
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(442, 4);
-
-				_last = (IASTNode)input.LT(1);
-				JAVA_CONSTANT204=(IASTNode)Match(input,JAVA_CONSTANT,Follow._JAVA_CONSTANT_in_constant2366); 
-				JAVA_CONSTANT204_tree = (IASTNode)adaptor.DupNode(JAVA_CONSTANT204);
-
-
-				adaptor.AddChild(root_0, JAVA_CONSTANT204_tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("constant", 48);
-			LeaveRule("constant", 48);
-			LeaveRule_constant();
-		}
-		DebugLocation(443, 1);
-		} finally { DebugExitRule(GrammarFileName, "constant"); }
-		return retval;
-
-	}
-	// $ANTLR end "constant"
-
-	partial void EnterRule_literal();
-	partial void LeaveRule_literal();
-	// $ANTLR start "literal"
-	// HqlSqlWalker.g:445:1: literal : ( numericLiteral | stringLiteral );
-	[GrammarRule("literal")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> literal()
-	{
-		EnterRule_literal();
-		EnterRule("literal", 49);
-		TraceIn("literal", 49);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> numericLiteral205 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> stringLiteral206 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "literal");
-		DebugLocation(445, 1);
-		try
-		{
-			// HqlSqlWalker.g:446:2: ( numericLiteral | stringLiteral )
-			int alt65=2;
-			try { DebugEnterDecision(65, false);
-			int LA65_1 = input.LA(1);
-
-			if (((LA65_1>=NUM_DECIMAL && LA65_1<=NUM_LONG)))
-			{
-				alt65 = 1;
-			}
-			else if ((LA65_1==QUOTED_String))
-			{
-				alt65 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 65, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(65); }
-			switch (alt65)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:446:4: numericLiteral
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(446, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._numericLiteral_in_literal2377);
-				numericLiteral205=numericLiteral();
-				PopFollow();
-
-				adaptor.AddChild(root_0, numericLiteral205.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:447:4: stringLiteral
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(447, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._stringLiteral_in_literal2382);
-				stringLiteral206=stringLiteral();
-				PopFollow();
-
-				adaptor.AddChild(root_0, stringLiteral206.Tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("literal", 49);
-			LeaveRule("literal", 49);
-			LeaveRule_literal();
-		}
-		DebugLocation(448, 1);
-		} finally { DebugExitRule(GrammarFileName, "literal"); }
-		return retval;
-
-	}
-	// $ANTLR end "literal"
-
-	partial void EnterRule_numericLiteral();
-	partial void LeaveRule_numericLiteral();
-	// $ANTLR start "numericLiteral"
-	// HqlSqlWalker.g:450:1: numericLiteral : ( NUM_INT | NUM_LONG | NUM_FLOAT | NUM_DOUBLE | NUM_DECIMAL );
-	[GrammarRule("numericLiteral")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> numericLiteral()
-	{
-		EnterRule_numericLiteral();
-		EnterRule("numericLiteral", 50);
-		TraceIn("numericLiteral", 50);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode set207 = default(IASTNode);
-
-		IASTNode set207_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "numericLiteral");
-		DebugLocation(450, 1);
-		try
-		{
-			// HqlSqlWalker.g:455:2: ( NUM_INT | NUM_LONG | NUM_FLOAT | NUM_DOUBLE | NUM_DECIMAL )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(455, 2);
-
-			_last = (IASTNode)input.LT(1);
-			set207=(IASTNode)input.LT(1);
-			if ((input.LA(1)>=NUM_DECIMAL && input.LA(1)<=NUM_LONG))
-			{
-				input.Consume();
-				set207_tree = (IASTNode)adaptor.DupNode(set207);
-
-
-				adaptor.AddChild(root_0, set207_tree);
-
-				state.errorRecovery=false;
-			}
-			else
-			{
-				MismatchedSetException mse = new MismatchedSetException(null,input);
-				DebugRecognitionException(mse);
-				throw mse;
-			}
-
-
-			 
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-				ProcessNumericLiteral( retval.Tree );
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("numericLiteral", 50);
-			LeaveRule("numericLiteral", 50);
-			LeaveRule_numericLiteral();
-		}
-		DebugLocation(460, 1);
-		} finally { DebugExitRule(GrammarFileName, "numericLiteral"); }
-		return retval;
-
-	}
-	// $ANTLR end "numericLiteral"
-
-	partial void EnterRule_stringLiteral();
-	partial void LeaveRule_stringLiteral();
-	// $ANTLR start "stringLiteral"
-	// HqlSqlWalker.g:462:1: stringLiteral : QUOTED_String ;
-	[GrammarRule("stringLiteral")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> stringLiteral()
-	{
-		EnterRule_stringLiteral();
-		EnterRule("stringLiteral", 51);
-		TraceIn("stringLiteral", 51);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode QUOTED_String208 = default(IASTNode);
-
-		IASTNode QUOTED_String208_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "stringLiteral");
-		DebugLocation(462, 1);
-		try
-		{
-			// HqlSqlWalker.g:463:2: ( QUOTED_String )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:463:4: QUOTED_String
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(463, 4);
-
-			_last = (IASTNode)input.LT(1);
-			QUOTED_String208=(IASTNode)Match(input,QUOTED_String,Follow._QUOTED_String_in_stringLiteral2429); 
-			QUOTED_String208_tree = (IASTNode)adaptor.DupNode(QUOTED_String208);
-
-
-			adaptor.AddChild(root_0, QUOTED_String208_tree);
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("stringLiteral", 51);
-			LeaveRule("stringLiteral", 51);
-			LeaveRule_stringLiteral();
-		}
-		DebugLocation(464, 1);
-		} finally { DebugExitRule(GrammarFileName, "stringLiteral"); }
-		return retval;
-
-	}
-	// $ANTLR end "stringLiteral"
-
-	partial void EnterRule_identifier();
-	partial void LeaveRule_identifier();
-	// $ANTLR start "identifier"
-	// HqlSqlWalker.g:466:1: identifier : ( IDENT | WEIRD_IDENT ) ;
-	[GrammarRule("identifier")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> identifier()
-	{
-		EnterRule_identifier();
-		EnterRule("identifier", 52);
-		TraceIn("identifier", 52);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode set209 = default(IASTNode);
-
-		IASTNode set209_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "identifier");
-		DebugLocation(466, 1);
-		try
-		{
-			// HqlSqlWalker.g:467:2: ( ( IDENT | WEIRD_IDENT ) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(467, 2);
-
-			_last = (IASTNode)input.LT(1);
-			set209=(IASTNode)input.LT(1);
-			if (input.LA(1)==IDENT||input.LA(1)==WEIRD_IDENT)
-			{
-				input.Consume();
-				set209_tree = (IASTNode)adaptor.DupNode(set209);
-
-
-				adaptor.AddChild(root_0, set209_tree);
-
-				state.errorRecovery=false;
-			}
-			else
-			{
-				MismatchedSetException mse = new MismatchedSetException(null,input);
-				DebugRecognitionException(mse);
-				throw mse;
-			}
-
-
-			 
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("identifier", 52);
-			LeaveRule("identifier", 52);
-			LeaveRule_identifier();
-		}
-		DebugLocation(468, 1);
-		} finally { DebugExitRule(GrammarFileName, "identifier"); }
-		return retval;
-
-	}
-	// $ANTLR end "identifier"
-
-	partial void EnterRule_addrExpr();
-	partial void LeaveRule_addrExpr();
-	// $ANTLR start "addrExpr"
-	// HqlSqlWalker.g:470:1: addrExpr[ bool root ] : ( addrExprDot[root] | addrExprIndex[root] | addrExprIdent[root] );
-	[GrammarRule("addrExpr")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> addrExpr(bool root)
-	{
-		EnterRule_addrExpr();
-		EnterRule("addrExpr", 53);
-		TraceIn("addrExpr", 53);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> addrExprDot210 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> addrExprIndex211 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> addrExprIdent212 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "addrExpr");
-		DebugLocation(470, 2);
-		try
-		{
-			// HqlSqlWalker.g:471:2: ( addrExprDot[root] | addrExprIndex[root] | addrExprIdent[root] )
-			int alt66=3;
-			try { DebugEnterDecision(66, false);
-			switch (input.LA(1))
-			{
-			case DOT:
-				{
-				alt66 = 1;
-				}
-				break;
-			case INDEX_OP:
-				{
-				alt66 = 2;
-				}
-				break;
-			case IDENT:
-			case WEIRD_IDENT:
-				{
-				alt66 = 3;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 66, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(66); }
-			switch (alt66)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:471:4: addrExprDot[root]
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(471, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._addrExprDot_in_addrExpr2459);
-				addrExprDot210=addrExprDot(root);
-				PopFollow();
-
-				adaptor.AddChild(root_0, addrExprDot210.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:472:4: addrExprIndex[root]
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(472, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._addrExprIndex_in_addrExpr2466);
-				addrExprIndex211=addrExprIndex(root);
-				PopFollow();
-
-				adaptor.AddChild(root_0, addrExprIndex211.Tree);
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:473:4: addrExprIdent[root]
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(473, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._addrExprIdent_in_addrExpr2473);
-				addrExprIdent212=addrExprIdent(root);
-				PopFollow();
-
-				adaptor.AddChild(root_0, addrExprIdent212.Tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("addrExpr", 53);
-			LeaveRule("addrExpr", 53);
-			LeaveRule_addrExpr();
-		}
-		DebugLocation(474, 2);
-		} finally { DebugExitRule(GrammarFileName, "addrExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "addrExpr"
-
-	partial void EnterRule_addrExprDot();
-	partial void LeaveRule_addrExprDot();
-	// $ANTLR start "addrExprDot"
-	// HqlSqlWalker.g:476:1: addrExprDot[ bool root ] : ^(d= DOT lhs= addrExprLhs rhs= propertyName ) -> ^( $d $lhs $rhs) ;
-	[GrammarRule("addrExprDot")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> addrExprDot(bool root)
-	{
-		EnterRule_addrExprDot();
-		EnterRule("addrExprDot", 54);
-		TraceIn("addrExprDot", 54);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode d = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> lhs = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> rhs = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode d_tree = default(IASTNode);
-		RewriteRuleNodeStream stream_DOT=new RewriteRuleNodeStream(adaptor,"token DOT");
-		RewriteRuleSubtreeStream stream_addrExprLhs=new RewriteRuleSubtreeStream(adaptor,"rule addrExprLhs");
-		RewriteRuleSubtreeStream stream_propertyName=new RewriteRuleSubtreeStream(adaptor,"rule propertyName");
-		try { DebugEnterRule(GrammarFileName, "addrExprDot");
-		DebugLocation(476, 1);
-		try
-		{
-			// HqlSqlWalker.g:481:2: ( ^(d= DOT lhs= addrExprLhs rhs= propertyName ) -> ^( $d $lhs $rhs) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:481:4: ^(d= DOT lhs= addrExprLhs rhs= propertyName )
-			{
-			DebugLocation(481, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(481, 7);
-
-			_last = (IASTNode)input.LT(1);
-			d=(IASTNode)Match(input,DOT,Follow._DOT_in_addrExprDot2497); 
-			 
-			stream_DOT.Add(d);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(481, 15);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._addrExprLhs_in_addrExprDot2501);
-			lhs=addrExprLhs();
-			PopFollow();
-
-			stream_addrExprLhs.Add(lhs.Tree);
-			DebugLocation(481, 31);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._propertyName_in_addrExprDot2505);
-			rhs=propertyName();
-			PopFollow();
-
-			stream_propertyName.Add(rhs.Tree);
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-
-			{
-			// AST REWRITE
-			// elements: d, lhs, rhs
-			// token labels: d
-			// rule labels: lhs, rhs, retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleNodeStream stream_d=new RewriteRuleNodeStream(adaptor,"token d",d);
-			RewriteRuleSubtreeStream stream_lhs=new RewriteRuleSubtreeStream(adaptor,"rule lhs",lhs!=null?lhs.Tree:null);
-			RewriteRuleSubtreeStream stream_rhs=new RewriteRuleSubtreeStream(adaptor,"rule rhs",rhs!=null?rhs.Tree:null);
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 482:3: -> ^( $d $lhs $rhs)
-			{
-				DebugLocation(482, 6);
-				// HqlSqlWalker.g:482:6: ^( $d $lhs $rhs)
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(482, 9);
-				root_1 = (IASTNode)adaptor.BecomeRoot(stream_d.NextNode(), root_1);
-
-				DebugLocation(482, 12);
-				adaptor.AddChild(root_1, stream_lhs.NextTree());
-				DebugLocation(482, 17);
-				adaptor.AddChild(root_1, stream_rhs.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-				LookupProperty(retval.Tree,root,false);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("addrExprDot", 54);
-			LeaveRule("addrExprDot", 54);
-			LeaveRule_addrExprDot();
-		}
-		DebugLocation(483, 1);
-		} finally { DebugExitRule(GrammarFileName, "addrExprDot"); }
-		return retval;
-
-	}
-	// $ANTLR end "addrExprDot"
-
-	partial void EnterRule_addrExprIndex();
-	partial void LeaveRule_addrExprIndex();
-	// $ANTLR start "addrExprIndex"
-	// HqlSqlWalker.g:485:1: addrExprIndex[ bool root ] : ^(i= INDEX_OP lhs2= addrExprLhs rhs2= expr ) -> ^( $i $lhs2 $rhs2) ;
-	[GrammarRule("addrExprIndex")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> addrExprIndex(bool root)
-	{
-		EnterRule_addrExprIndex();
-		EnterRule("addrExprIndex", 55);
-		TraceIn("addrExprIndex", 55);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode i = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> lhs2 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> rhs2 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode i_tree = default(IASTNode);
-		RewriteRuleNodeStream stream_INDEX_OP=new RewriteRuleNodeStream(adaptor,"token INDEX_OP");
-		RewriteRuleSubtreeStream stream_addrExprLhs=new RewriteRuleSubtreeStream(adaptor,"rule addrExprLhs");
-		RewriteRuleSubtreeStream stream_expr=new RewriteRuleSubtreeStream(adaptor,"rule expr");
-		try { DebugEnterRule(GrammarFileName, "addrExprIndex");
-		DebugLocation(485, 1);
-		try
-		{
-			// HqlSqlWalker.g:491:2: ( ^(i= INDEX_OP lhs2= addrExprLhs rhs2= expr ) -> ^( $i $lhs2 $rhs2) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:491:4: ^(i= INDEX_OP lhs2= addrExprLhs rhs2= expr )
-			{
-			DebugLocation(491, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(491, 7);
-
-			_last = (IASTNode)input.LT(1);
-			i=(IASTNode)Match(input,INDEX_OP,Follow._INDEX_OP_in_addrExprIndex2544); 
-			 
-			stream_INDEX_OP.Add(i);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(491, 21);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._addrExprLhs_in_addrExprIndex2548);
-			lhs2=addrExprLhs();
-			PopFollow();
-
-			stream_addrExprLhs.Add(lhs2.Tree);
-			DebugLocation(491, 38);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._expr_in_addrExprIndex2552);
-			rhs2=expr();
-			PopFollow();
-
-			stream_expr.Add(rhs2.Tree);
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-
-			{
-			// AST REWRITE
-			// elements: i, lhs2, rhs2
-			// token labels: i
-			// rule labels: lhs2, rhs2, retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleNodeStream stream_i=new RewriteRuleNodeStream(adaptor,"token i",i);
-			RewriteRuleSubtreeStream stream_lhs2=new RewriteRuleSubtreeStream(adaptor,"rule lhs2",lhs2!=null?lhs2.Tree:null);
-			RewriteRuleSubtreeStream stream_rhs2=new RewriteRuleSubtreeStream(adaptor,"rule rhs2",rhs2!=null?rhs2.Tree:null);
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 492:3: -> ^( $i $lhs2 $rhs2)
-			{
-				DebugLocation(492, 6);
-				// HqlSqlWalker.g:492:6: ^( $i $lhs2 $rhs2)
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(492, 9);
-				root_1 = (IASTNode)adaptor.BecomeRoot(stream_i.NextNode(), root_1);
-
-				DebugLocation(492, 12);
-				adaptor.AddChild(root_1, stream_lhs2.NextTree());
-				DebugLocation(492, 18);
-				adaptor.AddChild(root_1, stream_rhs2.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-				ProcessIndex(retval.Tree);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("addrExprIndex", 55);
-			LeaveRule("addrExprIndex", 55);
-			LeaveRule_addrExprIndex();
-		}
-		DebugLocation(493, 1);
-		} finally { DebugExitRule(GrammarFileName, "addrExprIndex"); }
-		return retval;
-
-	}
-	// $ANTLR end "addrExprIndex"
-
-	partial void EnterRule_addrExprIdent();
-	partial void LeaveRule_addrExprIdent();
-	// $ANTLR start "addrExprIdent"
-	// HqlSqlWalker.g:495:1: addrExprIdent[ bool root ] : p= identifier -> {IsNonQualifiedPropertyRef($p.tree)}? ^() -> ^() ;
-	[GrammarRule("addrExprIdent")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> addrExprIdent(bool root)
-	{
-		EnterRule_addrExprIdent();
-		EnterRule("addrExprIdent", 56);
-		TraceIn("addrExprIdent", 56);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> p = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		RewriteRuleSubtreeStream stream_identifier=new RewriteRuleSubtreeStream(adaptor,"rule identifier");
-		try { DebugEnterRule(GrammarFileName, "addrExprIdent");
-		DebugLocation(495, 1);
-		try
-		{
-			// HqlSqlWalker.g:496:2: (p= identifier -> {IsNonQualifiedPropertyRef($p.tree)}? ^() -> ^() )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:496:4: p= identifier
-			{
-			DebugLocation(496, 5);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._identifier_in_addrExprIdent2584);
-			p=identifier();
-			PopFollow();
-
-			stream_identifier.Add(p.Tree);
-
-
-			{
-			// AST REWRITE
-			// elements: 
-			// token labels: 
-			// rule labels: retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 497:2: -> {IsNonQualifiedPropertyRef($p.tree)}? ^()
-			if (IsNonQualifiedPropertyRef((p!=null?((IASTNode)p.Tree):default(IASTNode))))
-			{
-				DebugLocation(497, 43);
-				// HqlSqlWalker.g:497:43: ^()
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(497, 45);
-				root_1 = (IASTNode)adaptor.BecomeRoot(LookupNonQualifiedProperty((p!=null?((IASTNode)p.Tree):default(IASTNode))), root_1);
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-			else // 498:2: -> ^()
-			{
-				DebugLocation(498, 5);
-				// HqlSqlWalker.g:498:5: ^()
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(498, 7);
-				root_1 = (IASTNode)adaptor.BecomeRoot(Resolve((p!=null?((IASTNode)p.Tree):default(IASTNode))), root_1);
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("addrExprIdent", 56);
-			LeaveRule("addrExprIdent", 56);
-			LeaveRule_addrExprIdent();
-		}
-		DebugLocation(499, 1);
-		} finally { DebugExitRule(GrammarFileName, "addrExprIdent"); }
-		return retval;
-
-	}
-	// $ANTLR end "addrExprIdent"
-
-	partial void EnterRule_addrExprLhs();
-	partial void LeaveRule_addrExprLhs();
-	// $ANTLR start "addrExprLhs"
-	// HqlSqlWalker.g:501:1: addrExprLhs : addrExpr[ false ] ;
-	[GrammarRule("addrExprLhs")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> addrExprLhs()
-	{
-		EnterRule_addrExprLhs();
-		EnterRule("addrExprLhs", 57);
-		TraceIn("addrExprLhs", 57);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> addrExpr213 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "addrExprLhs");
-		DebugLocation(501, 1);
-		try
-		{
-			// HqlSqlWalker.g:502:2: ( addrExpr[ false ] )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:502:4: addrExpr[ false ]
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(502, 4);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._addrExpr_in_addrExprLhs2612);
-			addrExpr213=addrExpr(false);
-			PopFollow();
-
-			adaptor.AddChild(root_0, addrExpr213.Tree);
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("addrExprLhs", 57);
-			LeaveRule("addrExprLhs", 57);
-			LeaveRule_addrExprLhs();
-		}
-		DebugLocation(503, 1);
-		} finally { DebugExitRule(GrammarFileName, "addrExprLhs"); }
-		return retval;
-
-	}
-	// $ANTLR end "addrExprLhs"
-
-	partial void EnterRule_propertyName();
-	partial void LeaveRule_propertyName();
-	// $ANTLR start "propertyName"
-	// HqlSqlWalker.g:505:1: propertyName : ( identifier | CLASS | ELEMENTS | INDICES );
-	[GrammarRule("propertyName")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> propertyName()
-	{
-		EnterRule_propertyName();
-		EnterRule("propertyName", 58);
-		TraceIn("propertyName", 58);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode CLASS215 = default(IASTNode);
-		IASTNode ELEMENTS216 = default(IASTNode);
-		IASTNode INDICES217 = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> identifier214 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode CLASS215_tree = default(IASTNode);
-		IASTNode ELEMENTS216_tree = default(IASTNode);
-		IASTNode INDICES217_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "propertyName");
-		DebugLocation(505, 1);
-		try
-		{
-			// HqlSqlWalker.g:506:2: ( identifier | CLASS | ELEMENTS | INDICES )
-			int alt67=4;
-			try { DebugEnterDecision(67, false);
-			switch (input.LA(1))
-			{
-			case IDENT:
-			case WEIRD_IDENT:
-				{
-				alt67 = 1;
-				}
-				break;
-			case CLASS:
-				{
-				alt67 = 2;
-				}
-				break;
-			case ELEMENTS:
-				{
-				alt67 = 3;
-				}
-				break;
-			case INDICES:
-				{
-				alt67 = 4;
-				}
-				break;
-			default:
-				{
-					NoViableAltException nvae = new NoViableAltException("", 67, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(67); }
-			switch (alt67)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:506:4: identifier
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(506, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._identifier_in_propertyName2625);
-				identifier214=identifier();
-				PopFollow();
-
-				adaptor.AddChild(root_0, identifier214.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:507:4: CLASS
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(507, 4);
-
-				_last = (IASTNode)input.LT(1);
-				CLASS215=(IASTNode)Match(input,CLASS,Follow._CLASS_in_propertyName2630); 
-				CLASS215_tree = (IASTNode)adaptor.DupNode(CLASS215);
-
-
-				adaptor.AddChild(root_0, CLASS215_tree);
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// HqlSqlWalker.g:508:4: ELEMENTS
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(508, 4);
-
-				_last = (IASTNode)input.LT(1);
-				ELEMENTS216=(IASTNode)Match(input,ELEMENTS,Follow._ELEMENTS_in_propertyName2635); 
-				ELEMENTS216_tree = (IASTNode)adaptor.DupNode(ELEMENTS216);
-
-
-				adaptor.AddChild(root_0, ELEMENTS216_tree);
-
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// HqlSqlWalker.g:509:4: INDICES
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(509, 4);
-
-				_last = (IASTNode)input.LT(1);
-				INDICES217=(IASTNode)Match(input,INDICES,Follow._INDICES_in_propertyName2640); 
-				INDICES217_tree = (IASTNode)adaptor.DupNode(INDICES217);
-
-
-				adaptor.AddChild(root_0, INDICES217_tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("propertyName", 58);
-			LeaveRule("propertyName", 58);
-			LeaveRule_propertyName();
-		}
-		DebugLocation(510, 1);
-		} finally { DebugExitRule(GrammarFileName, "propertyName"); }
-		return retval;
-
-	}
-	// $ANTLR end "propertyName"
-
-	partial void EnterRule_propertyRef();
-	partial void LeaveRule_propertyRef();
-	// $ANTLR start "propertyRef"
-	// HqlSqlWalker.g:512:1: propertyRef : ( propertyRefPath | propertyRefIdent );
-	[GrammarRule("propertyRef")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> propertyRef()
-	{
-		EnterRule_propertyRef();
-		EnterRule("propertyRef", 59);
-		TraceIn("propertyRef", 59);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> propertyRefPath218 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> propertyRefIdent219 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "propertyRef");
-		DebugLocation(512, 1);
-		try
-		{
-			// HqlSqlWalker.g:513:2: ( propertyRefPath | propertyRefIdent )
-			int alt68=2;
-			try { DebugEnterDecision(68, false);
-			int LA68_1 = input.LA(1);
-
-			if ((LA68_1==DOT))
-			{
-				alt68 = 1;
-			}
-			else if ((LA68_1==IDENT||LA68_1==WEIRD_IDENT))
-			{
-				alt68 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 68, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(68); }
-			switch (alt68)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:513:4: propertyRefPath
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(513, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._propertyRefPath_in_propertyRef2652);
-				propertyRefPath218=propertyRefPath();
-				PopFollow();
-
-				adaptor.AddChild(root_0, propertyRefPath218.Tree);
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:514:4: propertyRefIdent
-				{
-				root_0 = (IASTNode)adaptor.Nil();
-
-				DebugLocation(514, 4);
-
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._propertyRefIdent_in_propertyRef2657);
-				propertyRefIdent219=propertyRefIdent();
-				PopFollow();
-
-				adaptor.AddChild(root_0, propertyRefIdent219.Tree);
-
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("propertyRef", 59);
-			LeaveRule("propertyRef", 59);
-			LeaveRule_propertyRef();
-		}
-		DebugLocation(515, 1);
-		} finally { DebugExitRule(GrammarFileName, "propertyRef"); }
-		return retval;
-
-	}
-	// $ANTLR end "propertyRef"
-
-	partial void EnterRule_propertyRefPath();
-	partial void LeaveRule_propertyRefPath();
-	// $ANTLR start "propertyRefPath"
-	// HqlSqlWalker.g:517:1: propertyRefPath : ^(d= DOT lhs= propertyRefLhs rhs= propertyName ) -> ^( $d $lhs $rhs) ;
-	[GrammarRule("propertyRefPath")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> propertyRefPath()
-	{
-		EnterRule_propertyRefPath();
-		EnterRule("propertyRefPath", 60);
-		TraceIn("propertyRefPath", 60);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode d = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> lhs = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> rhs = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode d_tree = default(IASTNode);
-		RewriteRuleNodeStream stream_DOT=new RewriteRuleNodeStream(adaptor,"token DOT");
-		RewriteRuleSubtreeStream stream_propertyRefLhs=new RewriteRuleSubtreeStream(adaptor,"rule propertyRefLhs");
-		RewriteRuleSubtreeStream stream_propertyName=new RewriteRuleSubtreeStream(adaptor,"rule propertyName");
-		try { DebugEnterRule(GrammarFileName, "propertyRefPath");
-		DebugLocation(517, 1);
-		try
-		{
-			// HqlSqlWalker.g:522:2: ( ^(d= DOT lhs= propertyRefLhs rhs= propertyName ) -> ^( $d $lhs $rhs) )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:522:4: ^(d= DOT lhs= propertyRefLhs rhs= propertyName )
-			{
-			DebugLocation(522, 4);
-
-			_last = (IASTNode)input.LT(1);
-			{
-			IASTNode _save_last_1 = _last;
-			IASTNode _first_1 = default(IASTNode);
-			IASTNode root_1 = (IASTNode)adaptor.Nil();
-			DebugLocation(522, 7);
-
-			_last = (IASTNode)input.LT(1);
-			d=(IASTNode)Match(input,DOT,Follow._DOT_in_propertyRefPath2677); 
-			 
-			stream_DOT.Add(d);
-
-
-			Match(input, TokenTypes.Down, null); 
-			DebugLocation(522, 15);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._propertyRefLhs_in_propertyRefPath2681);
-			lhs=propertyRefLhs();
-			PopFollow();
-
-			stream_propertyRefLhs.Add(lhs.Tree);
-			DebugLocation(522, 34);
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._propertyName_in_propertyRefPath2685);
-			rhs=propertyName();
-			PopFollow();
-
-			stream_propertyName.Add(rhs.Tree);
-
-			Match(input, TokenTypes.Up, null); 
-			adaptor.AddChild(root_0, root_1);
-			_last = _save_last_1;
-			}
-
-
-
-			{
-			// AST REWRITE
-			// elements: d, lhs, rhs
-			// token labels: d
-			// rule labels: lhs, rhs, retval
-			// token list labels: 
-			// rule list labels: 
-			// wildcard labels: 
-			retval.Tree = root_0;
-			RewriteRuleNodeStream stream_d=new RewriteRuleNodeStream(adaptor,"token d",d);
-			RewriteRuleSubtreeStream stream_lhs=new RewriteRuleSubtreeStream(adaptor,"rule lhs",lhs!=null?lhs.Tree:null);
-			RewriteRuleSubtreeStream stream_rhs=new RewriteRuleSubtreeStream(adaptor,"rule rhs",rhs!=null?rhs.Tree:null);
-			RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-			root_0 = (IASTNode)adaptor.Nil();
-			// 523:3: -> ^( $d $lhs $rhs)
-			{
-				DebugLocation(523, 6);
-				// HqlSqlWalker.g:523:6: ^( $d $lhs $rhs)
-				{
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(523, 9);
-				root_1 = (IASTNode)adaptor.BecomeRoot(stream_d.NextNode(), root_1);
-
-				DebugLocation(523, 12);
-				adaptor.AddChild(root_1, stream_lhs.NextTree());
-				DebugLocation(523, 17);
-				adaptor.AddChild(root_1, stream_rhs.NextTree());
-
-				adaptor.AddChild(root_0, root_1);
-				}
-
-			}
-
-			retval.Tree = root_0;
-			}
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-				// This gives lookupProperty() a chance to transform the tree to process collection properties (.elements, etc).
-				retval.Tree = LookupProperty((IASTNode) retval.Tree,false,true);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("propertyRefPath", 60);
-			LeaveRule("propertyRefPath", 60);
-			LeaveRule_propertyRefPath();
-		}
-		DebugLocation(524, 1);
-		} finally { DebugExitRule(GrammarFileName, "propertyRefPath"); }
-		return retval;
-
-	}
-	// $ANTLR end "propertyRefPath"
-
-	partial void EnterRule_propertyRefIdent();
-	partial void LeaveRule_propertyRefIdent();
-	// $ANTLR start "propertyRefIdent"
-	// HqlSqlWalker.g:526:1: propertyRefIdent : p= identifier ;
-	[GrammarRule("propertyRefIdent")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> propertyRefIdent()
-	{
-		EnterRule_propertyRefIdent();
-		EnterRule("propertyRefIdent", 61);
-		TraceIn("propertyRefIdent", 61);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> p = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "propertyRefIdent");
-		DebugLocation(526, 1);
-		try
-		{
-			// HqlSqlWalker.g:540:2: (p= identifier )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:540:4: p= identifier
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(540, 5);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._identifier_in_propertyRefIdent2722);
-			p=identifier();
-			PopFollow();
-
-			adaptor.AddChild(root_0, p.Tree);
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-				// In many cases, things other than property-refs are recognized
-				// by this propertyRef rule.  Some of those I have seen:
-				//  1) select-clause from-aliases
-				//  2) sql-functions
-				if ( IsNonQualifiedPropertyRef((p!=null?((IASTNode)p.Tree):default(IASTNode))) ) {
-					retval.Tree = LookupNonQualifiedProperty((p!=null?((IASTNode)p.Tree):default(IASTNode)));
-				}
-				else {
-					Resolve((p!=null?((IASTNode)p.Tree):default(IASTNode)));
-					retval.Tree = (p!=null?((IASTNode)p.Tree):default(IASTNode));
-				}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("propertyRefIdent", 61);
-			LeaveRule("propertyRefIdent", 61);
-			LeaveRule_propertyRefIdent();
-		}
-		DebugLocation(541, 1);
-		} finally { DebugExitRule(GrammarFileName, "propertyRefIdent"); }
-		return retval;
-
-	}
-	// $ANTLR end "propertyRefIdent"
-
-	partial void EnterRule_propertyRefLhs();
-	partial void LeaveRule_propertyRefLhs();
-	// $ANTLR start "propertyRefLhs"
-	// HqlSqlWalker.g:543:1: propertyRefLhs : propertyRef ;
-	[GrammarRule("propertyRefLhs")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> propertyRefLhs()
-	{
-		EnterRule_propertyRefLhs();
-		EnterRule("propertyRefLhs", 62);
-		TraceIn("propertyRefLhs", 62);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> propertyRef220 = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "propertyRefLhs");
-		DebugLocation(543, 1);
-		try
-		{
-			// HqlSqlWalker.g:544:2: ( propertyRef )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:544:4: propertyRef
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(544, 4);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._propertyRef_in_propertyRefLhs2734);
-			propertyRef220=propertyRef();
-			PopFollow();
-
-			adaptor.AddChild(root_0, propertyRef220.Tree);
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("propertyRefLhs", 62);
-			LeaveRule("propertyRefLhs", 62);
-			LeaveRule_propertyRefLhs();
-		}
-		DebugLocation(545, 1);
-		} finally { DebugExitRule(GrammarFileName, "propertyRefLhs"); }
-		return retval;
-
-	}
-	// $ANTLR end "propertyRefLhs"
-
-	partial void EnterRule_aliasRef();
-	partial void LeaveRule_aliasRef();
-	// $ANTLR start "aliasRef"
-	// HqlSqlWalker.g:547:1: aliasRef : i= identifier ;
-	[GrammarRule("aliasRef")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> aliasRef()
-	{
-		EnterRule_aliasRef();
-		EnterRule("aliasRef", 63);
-		TraceIn("aliasRef", 63);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		AstTreeRuleReturnScope<IASTNode, IASTNode> i = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "aliasRef");
-		DebugLocation(547, 1);
-		try
-		{
-			// HqlSqlWalker.g:552:2: (i= identifier )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:552:4: i= identifier
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(552, 5);
-
-			_last = (IASTNode)input.LT(1);
-			PushFollow(Follow._identifier_in_aliasRef2755);
-			i=identifier();
-			PopFollow();
-
-			adaptor.AddChild(root_0, i.Tree);
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-
-					LookupAlias(retval.Tree);
-				
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("aliasRef", 63);
-			LeaveRule("aliasRef", 63);
-			LeaveRule_aliasRef();
-		}
-		DebugLocation(554, 1);
-		} finally { DebugExitRule(GrammarFileName, "aliasRef"); }
-		return retval;
-
-	}
-	// $ANTLR end "aliasRef"
-
-	partial void EnterRule_parameter();
-	partial void LeaveRule_parameter();
-	// $ANTLR start "parameter"
-	// HqlSqlWalker.g:556:1: parameter : ( ^(c= COLON a= identifier ) -> ^() | ^(p= PARAM (n= NUM_INT )? ) -> {n != null}? ^() -> ^() );
-	[GrammarRule("parameter")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> parameter()
-	{
-		EnterRule_parameter();
-		EnterRule("parameter", 64);
-		TraceIn("parameter", 64);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode c = default(IASTNode);
-		IASTNode p = default(IASTNode);
-		IASTNode n = default(IASTNode);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> a = default(AstTreeRuleReturnScope<IASTNode, IASTNode>);
-
-		IASTNode c_tree = default(IASTNode);
-		IASTNode p_tree = default(IASTNode);
-		IASTNode n_tree = default(IASTNode);
-		RewriteRuleNodeStream stream_COLON=new RewriteRuleNodeStream(adaptor,"token COLON");
-		RewriteRuleNodeStream stream_PARAM=new RewriteRuleNodeStream(adaptor,"token PARAM");
-		RewriteRuleNodeStream stream_NUM_INT=new RewriteRuleNodeStream(adaptor,"token NUM_INT");
-		RewriteRuleSubtreeStream stream_identifier=new RewriteRuleSubtreeStream(adaptor,"rule identifier");
-		try { DebugEnterRule(GrammarFileName, "parameter");
-		DebugLocation(556, 1);
-		try
-		{
-			// HqlSqlWalker.g:557:2: ( ^(c= COLON a= identifier ) -> ^() | ^(p= PARAM (n= NUM_INT )? ) -> {n != null}? ^() -> ^() )
-			int alt70=2;
-			try { DebugEnterDecision(70, false);
-			int LA70_1 = input.LA(1);
-
-			if ((LA70_1==COLON))
-			{
-				alt70 = 1;
-			}
-			else if ((LA70_1==PARAM))
-			{
-				alt70 = 2;
-			}
-			else
-			{
-				NoViableAltException nvae = new NoViableAltException("", 70, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(70); }
-			switch (alt70)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// HqlSqlWalker.g:557:4: ^(c= COLON a= identifier )
-				{
-				DebugLocation(557, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(557, 7);
-
-				_last = (IASTNode)input.LT(1);
-				c=(IASTNode)Match(input,COLON,Follow._COLON_in_parameter2773); 
-				 
-				stream_COLON.Add(c);
-
-
-				Match(input, TokenTypes.Down, null); 
-				DebugLocation(557, 15);
-				_last = (IASTNode)input.LT(1);
-				PushFollow(Follow._identifier_in_parameter2777);
-				a=identifier();
-				PopFollow();
-
-				stream_identifier.Add(a.Tree);
-
-				Match(input, TokenTypes.Up, null); 
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-
-				{
-				// AST REWRITE
-				// elements: 
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 559:3: -> ^()
-				{
-					DebugLocation(559, 6);
-					// HqlSqlWalker.g:559:6: ^()
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(559, 8);
-					root_1 = (IASTNode)adaptor.BecomeRoot(GenerateNamedParameter( c, (a!=null?((IASTNode)a.Tree):default(IASTNode)) ), root_1);
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// HqlSqlWalker.g:560:4: ^(p= PARAM (n= NUM_INT )? )
-				{
-				DebugLocation(560, 4);
-
-				_last = (IASTNode)input.LT(1);
-				{
-				IASTNode _save_last_1 = _last;
-				IASTNode _first_1 = default(IASTNode);
-				IASTNode root_1 = (IASTNode)adaptor.Nil();
-				DebugLocation(560, 7);
-
-				_last = (IASTNode)input.LT(1);
-				p=(IASTNode)Match(input,PARAM,Follow._PARAM_in_parameter2798); 
-				 
-				stream_PARAM.Add(p);
-
-
-				if (input.LA(1) == TokenTypes.Down) {
-					Match(input, TokenTypes.Down, null); 
-					DebugLocation(560, 14);
-					// HqlSqlWalker.g:560:14: (n= NUM_INT )?
-					int alt69=2;
-					try { DebugEnterSubRule(69);
-					try { DebugEnterDecision(69, false);
-					int LA69_1 = input.LA(1);
-
-					if ((LA69_1==NUM_INT))
-					{
-						alt69 = 1;
-					}
-					} finally { DebugExitDecision(69); }
-					switch (alt69)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// HqlSqlWalker.g:560:15: n= NUM_INT
-						{
-						DebugLocation(560, 16);
-
-						_last = (IASTNode)input.LT(1);
-						n=(IASTNode)Match(input,NUM_INT,Follow._NUM_INT_in_parameter2803); 
-						 
-						stream_NUM_INT.Add(n);
-
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(69); }
-
-
-					Match(input, TokenTypes.Up, null); 
-				}
-				adaptor.AddChild(root_0, root_1);
-				_last = _save_last_1;
-				}
-
-
-
-				{
-				// AST REWRITE
-				// elements: 
-				// token labels: 
-				// rule labels: retval
-				// token list labels: 
-				// rule list labels: 
-				// wildcard labels: 
-				retval.Tree = root_0;
-				RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.Tree:null);
-
-				root_0 = (IASTNode)adaptor.Nil();
-				// 561:3: -> {n != null}? ^()
-				if (n != null)
-				{
-					DebugLocation(561, 19);
-					// HqlSqlWalker.g:561:19: ^()
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(561, 21);
-					root_1 = (IASTNode)adaptor.BecomeRoot(GenerateNamedParameter( p, n ), root_1);
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-				else // 562:3: -> ^()
-				{
-					DebugLocation(562, 6);
-					// HqlSqlWalker.g:562:6: ^()
-					{
-					IASTNode root_1 = (IASTNode)adaptor.Nil();
-					DebugLocation(562, 8);
-					root_1 = (IASTNode)adaptor.BecomeRoot(GeneratePositionalParameter( p ), root_1);
-
-					adaptor.AddChild(root_0, root_1);
-					}
-
-				}
-
-				retval.Tree = root_0;
-				}
-
-				}
-				break;
-
-			}
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("parameter", 64);
-			LeaveRule("parameter", 64);
-			LeaveRule_parameter();
-		}
-		DebugLocation(563, 1);
-		} finally { DebugExitRule(GrammarFileName, "parameter"); }
-		return retval;
-
-	}
-	// $ANTLR end "parameter"
-
-	partial void EnterRule_numericInteger();
-	partial void LeaveRule_numericInteger();
-	// $ANTLR start "numericInteger"
-	// HqlSqlWalker.g:565:1: numericInteger : NUM_INT ;
-	[GrammarRule("numericInteger")]
-	private AstTreeRuleReturnScope<IASTNode, IASTNode> numericInteger()
-	{
-		EnterRule_numericInteger();
-		EnterRule("numericInteger", 65);
-		TraceIn("numericInteger", 65);
-		AstTreeRuleReturnScope<IASTNode, IASTNode> retval = new AstTreeRuleReturnScope<IASTNode, IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		IASTNode root_0 = default(IASTNode);
-
-		IASTNode _first_0 = default(IASTNode);
-		IASTNode _last = default(IASTNode);
-
-		IASTNode NUM_INT221 = default(IASTNode);
-
-		IASTNode NUM_INT221_tree = default(IASTNode);
-		try { DebugEnterRule(GrammarFileName, "numericInteger");
-		DebugLocation(565, 1);
-		try
-		{
-			// HqlSqlWalker.g:566:2: ( NUM_INT )
-			DebugEnterAlt(1);
-			// HqlSqlWalker.g:566:4: NUM_INT
-			{
-			root_0 = (IASTNode)adaptor.Nil();
-
-			DebugLocation(566, 4);
-
-			_last = (IASTNode)input.LT(1);
-			NUM_INT221=(IASTNode)Match(input,NUM_INT,Follow._NUM_INT_in_numericInteger2836); 
-			NUM_INT221_tree = (IASTNode)adaptor.DupNode(NUM_INT221);
-
-
-			adaptor.AddChild(root_0, NUM_INT221_tree);
-
-
-			}
-
-			retval.Tree = (IASTNode)adaptor.RulePostProcessing(root_0);
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("numericInteger", 65);
-			LeaveRule("numericInteger", 65);
-			LeaveRule_numericInteger();
-		}
-		DebugLocation(567, 1);
-		} finally { DebugExitRule(GrammarFileName, "numericInteger"); }
-		return retval;
-
-	}
-	// $ANTLR end "numericInteger"
-	#endregion Rules
-
-
-	#region Follow sets
-	private static class Follow
-	{
-		public static readonly BitSet _selectStatement_in_statement202 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _updateStatement_in_statement206 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _deleteStatement_in_statement210 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _insertStatement_in_statement214 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _query_in_selectStatement231 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _UPDATE_in_updateStatement255 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _VERSIONED_in_updateStatement262 = new BitSet(new ulong[]{0x1000000000000UL});
-		public static readonly BitSet _fromClause_in_updateStatement268 = new BitSet(new ulong[]{0x0UL,0x1000000000000UL});
-		public static readonly BitSet _setClause_in_updateStatement272 = new BitSet(new ulong[]{0x8UL,0x0UL,0x4UL});
-		public static readonly BitSet _whereClause_in_updateStatement277 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _DELETE_in_deleteStatement320 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _fromClause_in_deleteStatement324 = new BitSet(new ulong[]{0x8UL,0x0UL,0x4UL});
-		public static readonly BitSet _whereClause_in_deleteStatement327 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _INSERT_in_insertStatement357 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _intoClause_in_insertStatement361 = new BitSet(new ulong[]{0x0UL,0x1000020000000000UL});
-		public static readonly BitSet _query_in_insertStatement363 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _INTO_in_intoClause387 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _path_in_intoClause394 = new BitSet(new ulong[]{0x0UL,0x80000000000UL});
-		public static readonly BitSet _insertablePropertySpec_in_intoClause399 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _RANGE_in_insertablePropertySpec415 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _IDENT_in_insertablePropertySpec418 = new BitSet(new ulong[]{0x80000000000008UL});
-		public static readonly BitSet _SET_in_setClause435 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _assignment_in_setClause440 = new BitSet(new ulong[]{0x4000000008UL});
-		public static readonly BitSet _EQ_in_assignment467 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _propertyRef_in_assignment472 = new BitSet(new ulong[]{0x8801003108ED010UL,0x561006C01F814010UL,0x1UL});
-		public static readonly BitSet _newValue_in_assignment478 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _expr_in_newValue494 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _query_in_newValue498 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _unionedQuery_in_query509 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _UNION_in_query516 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _unionedQuery_in_query518 = new BitSet(new ulong[]{0x0UL,0x1000020000000000UL});
-		public static readonly BitSet _query_in_query520 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _QUERY_in_unionedQuery543 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _SELECT_FROM_in_unionedQuery555 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _fromClause_in_unionedQuery563 = new BitSet(new ulong[]{0x8UL,0x400000000000UL});
-		public static readonly BitSet _selectClause_in_unionedQuery572 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _whereClause_in_unionedQuery587 = new BitSet(new ulong[]{0x28000000000008UL,0x42000800000000UL});
-		public static readonly BitSet _groupClause_in_unionedQuery597 = new BitSet(new ulong[]{0x20000000000008UL,0x42000800000000UL});
-		public static readonly BitSet _havingClause_in_unionedQuery607 = new BitSet(new ulong[]{0x8UL,0x42000800000000UL});
-		public static readonly BitSet _orderClause_in_unionedQuery617 = new BitSet(new ulong[]{0x8UL,0x42000000000000UL});
-		public static readonly BitSet _skipClause_in_unionedQuery627 = new BitSet(new ulong[]{0x8UL,0x40000000000000UL});
-		public static readonly BitSet _takeClause_in_unionedQuery637 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _ORDER_in_orderClause694 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _orderExprs_in_orderClause699 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _orderExpr_in_orderExprs712 = new BitSet(new ulong[]{0x8801003508ED412UL,0x561006C01F814010UL,0x1UL});
-		public static readonly BitSet _orderExprs_in_orderExprs726 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _resultVariableRef_in_orderExpr741 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _expr_in_orderExpr746 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _query_in_orderExpr751 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _identifier_in_resultVariableRef771 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _SKIP_in_skipClause793 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _NUM_INT_in_skipClause796 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _parameter_in_skipClause800 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _TAKE_in_takeClause814 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _NUM_INT_in_takeClause817 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _parameter_in_takeClause821 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _GROUP_in_groupClause835 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_groupClause840 = new BitSet(new ulong[]{0x8801003108ED018UL,0x461004C01F814010UL,0x1UL});
-		public static readonly BitSet _HAVING_in_havingClause856 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _logicalExpr_in_havingClause858 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _SELECT_in_selectClause872 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _DISTINCT_in_selectClause879 = new BitSet(new ulong[]{0x10800007188ED250UL,0x141006C03F014000UL,0x1UL});
-		public static readonly BitSet _selectExprList_in_selectClause885 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _selectExpr_in_selectExprList920 = new BitSet(new ulong[]{0x10800007188ED252UL,0x141006C03F014000UL,0x1UL});
-		public static readonly BitSet _aliasedSelectExpr_in_selectExprList924 = new BitSet(new ulong[]{0x10800007188ED252UL,0x141006C03F014000UL,0x1UL});
-		public static readonly BitSet _AS_in_aliasedSelectExpr948 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _selectExpr_in_aliasedSelectExpr952 = new BitSet(new ulong[]{0x80000000000000UL,0x0UL,0x1UL});
-		public static readonly BitSet _identifier_in_aliasedSelectExpr956 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _propertyRef_in_selectExpr971 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _ALL_in_selectExpr983 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _aliasRef_in_selectExpr987 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _OBJECT_in_selectExpr999 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _aliasRef_in_selectExpr1003 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _constructor_in_selectExpr1014 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _functionCall_in_selectExpr1025 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _parameter_in_selectExpr1030 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _count_in_selectExpr1035 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _collectionFunction_in_selectExpr1040 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _literal_in_selectExpr1048 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _arithmeticExpr_in_selectExpr1053 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _query_in_selectExpr1058 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _COUNT_in_count1070 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _aggregateExpr_in_count1085 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _ROW_STAR_in_count1089 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _CONSTRUCTOR_in_constructor1105 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _path_in_constructor1107 = new BitSet(new ulong[]{0x10800007188ED258UL,0x141006C03F014000UL,0x1UL});
-		public static readonly BitSet _selectExpr_in_constructor1111 = new BitSet(new ulong[]{0x10800007188ED258UL,0x141006C03F014000UL,0x1UL});
-		public static readonly BitSet _aliasedSelectExpr_in_constructor1115 = new BitSet(new ulong[]{0x10800007188ED258UL,0x141006C03F014000UL,0x1UL});
-		public static readonly BitSet _expr_in_aggregateExpr1131 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _collectionFunction_in_aggregateExpr1137 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _FROM_in_fromClause1153 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _fromElementList_in_fromClause1157 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _fromElement_in_fromElementList1175 = new BitSet(new ulong[]{0x400000000002UL,0x80000000020UL});
-		public static readonly BitSet _RANGE_in_fromElement1200 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _path_in_fromElement1204 = new BitSet(new ulong[]{0x200000000028UL});
-		public static readonly BitSet _ALIAS_in_fromElement1209 = new BitSet(new ulong[]{0x200000000008UL});
-		public static readonly BitSet _FETCH_in_fromElement1216 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _joinElement_in_fromElement1243 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _FILTER_ENTITY_in_fromElement1258 = new BitSet(new ulong[]{0x20UL});
-		public static readonly BitSet _ALIAS_in_fromElement1262 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _JOIN_in_joinElement1291 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _joinType_in_joinElement1296 = new BitSet(new ulong[]{0x80200200000000UL,0x0UL,0x1UL});
-		public static readonly BitSet _FETCH_in_joinElement1306 = new BitSet(new ulong[]{0x80000200000000UL,0x0UL,0x1UL});
-		public static readonly BitSet _propertyRef_in_joinElement1312 = new BitSet(new ulong[]{0x200000000028UL,0x0UL,0x8UL});
-		public static readonly BitSet _ALIAS_in_joinElement1317 = new BitSet(new ulong[]{0x200000000008UL,0x0UL,0x8UL});
-		public static readonly BitSet _FETCH_in_joinElement1324 = new BitSet(new ulong[]{0x8UL,0x0UL,0x8UL});
-		public static readonly BitSet _WITH_in_joinElement1333 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _LEFT_in_joinType1374 = new BitSet(new ulong[]{0x2UL,0x2000000000UL});
-		public static readonly BitSet _RIGHT_in_joinType1380 = new BitSet(new ulong[]{0x2UL,0x2000000000UL});
-		public static readonly BitSet _OUTER_in_joinType1386 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _FULL_in_joinType1400 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _INNER_in_joinType1407 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _identifier_in_path1429 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _DOT_in_path1437 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _path_in_path1441 = new BitSet(new ulong[]{0x80000000000000UL,0x0UL,0x1UL});
-		public static readonly BitSet _identifier_in_path1445 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _path_in_pathAsIdent1464 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _WITH_in_withClause1505 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _logicalExpr_in_withClause1511 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _WHERE_in_whereClause1539 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _logicalExpr_in_whereClause1545 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _AND_in_logicalExpr1571 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _logicalExpr_in_logicalExpr1573 = new BitSet(new ulong[]{0xC94024200002090UL,0x4007A4A4CUL,0x1UL});
-		public static readonly BitSet _logicalExpr_in_logicalExpr1575 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _OR_in_logicalExpr1582 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _logicalExpr_in_logicalExpr1584 = new BitSet(new ulong[]{0xC94024200002090UL,0x4007A4A4CUL,0x1UL});
-		public static readonly BitSet _logicalExpr_in_logicalExpr1586 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _NOT_in_logicalExpr1593 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _logicalExpr_in_logicalExpr1595 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _comparisonExpr_in_logicalExpr1601 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _functionCall_in_logicalExpr1606 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _logicalPath_in_logicalExpr1611 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _addrExpr_in_logicalPath1630 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _EQ_in_comparisonExpr1668 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1670 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1672 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _NE_in_comparisonExpr1679 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1681 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1683 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _LT_in_comparisonExpr1690 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1692 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1694 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _GT_in_comparisonExpr1701 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1703 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1705 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _LE_in_comparisonExpr1712 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1714 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1716 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _GE_in_comparisonExpr1723 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1725 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1727 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _LIKE_in_comparisonExpr1734 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1736 = new BitSet(new ulong[]{0x8801003108ED010UL,0x461004C01F814010UL,0x1UL});
-		public static readonly BitSet _expr_in_comparisonExpr1738 = new BitSet(new ulong[]{0x8000000008UL});
-		public static readonly BitSet _ESCAPE_in_comparisonExpr1743 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_comparisonExpr1745 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _NOT_LIKE_in_comparisonExpr1757 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1759 = new BitSet(new ulong[]{0x8801003108ED010UL,0x461004C01F814010UL,0x1UL});
-		public static readonly BitSet _expr_in_comparisonExpr1761 = new BitSet(new ulong[]{0x8000000008UL});
-		public static readonly BitSet _ESCAPE_in_comparisonExpr1766 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_comparisonExpr1768 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _BETWEEN_in_comparisonExpr1780 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1782 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1784 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1786 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _NOT_BETWEEN_in_comparisonExpr1793 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1795 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1797 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1799 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _IN_in_comparisonExpr1806 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1808 = new BitSet(new ulong[]{0x0UL,0x1UL});
-		public static readonly BitSet _inRhs_in_comparisonExpr1810 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _NOT_IN_in_comparisonExpr1818 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1820 = new BitSet(new ulong[]{0x0UL,0x1UL});
-		public static readonly BitSet _inRhs_in_comparisonExpr1822 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _IS_NULL_in_comparisonExpr1830 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1832 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _IS_NOT_NULL_in_comparisonExpr1839 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_comparisonExpr1841 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _EXISTS_in_comparisonExpr1850 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_comparisonExpr1854 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _collectionFunctionOrSubselect_in_comparisonExpr1858 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _IN_LIST_in_inRhs1877 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _collectionFunctionOrSubselect_in_inRhs1881 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _expr_in_inRhs1885 = new BitSet(new ulong[]{0x8801003108ED018UL,0x461004C01F814010UL,0x1UL});
-		public static readonly BitSet _expr_in_exprOrSubquery1901 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _query_in_exprOrSubquery1906 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _ANY_in_exprOrSubquery1912 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _collectionFunctionOrSubselect_in_exprOrSubquery1914 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _ALL_in_exprOrSubquery1921 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _collectionFunctionOrSubselect_in_exprOrSubquery1923 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _SOME_in_exprOrSubquery1930 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _collectionFunctionOrSubselect_in_exprOrSubquery1932 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _collectionFunction_in_collectionFunctionOrSubselect1945 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _query_in_collectionFunctionOrSubselect1950 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _addrExpr_in_expr1964 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _VECTOR_EXPR_in_expr1976 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_expr1979 = new BitSet(new ulong[]{0x8801003108ED018UL,0x461004C01F814010UL,0x1UL});
-		public static readonly BitSet _constant_in_expr1988 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _arithmeticExpr_in_expr1993 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _functionCall_in_expr1998 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _parameter_in_expr2010 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _count_in_expr2015 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _PLUS_in_arithmeticExpr2043 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2045 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2047 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _MINUS_in_arithmeticExpr2054 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2056 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2058 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _DIV_in_arithmeticExpr2065 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2067 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2069 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _STAR_in_arithmeticExpr2076 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2078 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2080 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _BNOT_in_arithmeticExpr2087 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2089 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _BAND_in_arithmeticExpr2096 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2098 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2100 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _BOR_in_arithmeticExpr2107 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2109 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2111 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _BXOR_in_arithmeticExpr2118 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2120 = new BitSet(new ulong[]{0x8801003108ED150UL,0x561406C01F814010UL,0x1UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2122 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _UNARY_MINUS_in_arithmeticExpr2130 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _exprOrSubquery_in_arithmeticExpr2132 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _caseExpr_in_arithmeticExpr2140 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _CASE_in_caseExpr2152 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _WHEN_in_caseExpr2158 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _logicalExpr_in_caseExpr2160 = new BitSet(new ulong[]{0x8801003108ED010UL,0x461004C01F814010UL,0x1UL});
-		public static readonly BitSet _expr_in_caseExpr2162 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _ELSE_in_caseExpr2169 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_caseExpr2171 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _CASE2_in_caseExpr2183 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_caseExpr2187 = new BitSet(new ulong[]{0x0UL,0x0UL,0x2UL});
-		public static readonly BitSet _WHEN_in_caseExpr2191 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_caseExpr2193 = new BitSet(new ulong[]{0x8801003108ED010UL,0x461004C01F814010UL,0x1UL});
-		public static readonly BitSet _expr_in_caseExpr2195 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _ELSE_in_caseExpr2202 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_caseExpr2204 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _ELEMENTS_in_collectionFunction2226 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _propertyRef_in_collectionFunction2232 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _INDICES_in_collectionFunction2251 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _propertyRef_in_collectionFunction2257 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _METHOD_CALL_in_functionCall2282 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _pathAsIdent_in_functionCall2287 = new BitSet(new ulong[]{0x80000000008UL});
-		public static readonly BitSet _EXPR_LIST_in_functionCall2292 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_functionCall2295 = new BitSet(new ulong[]{0xC941243108EF018UL,0x561006C01FF34A5CUL,0x1UL});
-		public static readonly BitSet _query_in_functionCall2299 = new BitSet(new ulong[]{0xC941243108EF018UL,0x561006C01FF34A5CUL,0x1UL});
-		public static readonly BitSet _comparisonExpr_in_functionCall2303 = new BitSet(new ulong[]{0xC941243108EF018UL,0x561006C01FF34A5CUL,0x1UL});
-		public static readonly BitSet _AGGREGATE_in_functionCall2322 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _aggregateExpr_in_functionCall2324 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _literal_in_constant2337 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _NULL_in_constant2342 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _TRUE_in_constant2349 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _FALSE_in_constant2359 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _JAVA_CONSTANT_in_constant2366 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _numericLiteral_in_literal2377 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _stringLiteral_in_literal2382 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _QUOTED_String_in_stringLiteral2429 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _addrExprDot_in_addrExpr2459 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _addrExprIndex_in_addrExpr2466 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _addrExprIdent_in_addrExpr2473 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _DOT_in_addrExprDot2497 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _addrExprLhs_in_addrExprDot2501 = new BitSet(new ulong[]{0x1080000400100000UL,0x0UL,0x1UL});
-		public static readonly BitSet _propertyName_in_addrExprDot2505 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _INDEX_OP_in_addrExprIndex2544 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _addrExprLhs_in_addrExprIndex2548 = new BitSet(new ulong[]{0x8801003108ED010UL,0x461004C01F814010UL,0x1UL});
-		public static readonly BitSet _expr_in_addrExprIndex2552 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _identifier_in_addrExprIdent2584 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _addrExpr_in_addrExprLhs2612 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _identifier_in_propertyName2625 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _CLASS_in_propertyName2630 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _ELEMENTS_in_propertyName2635 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _INDICES_in_propertyName2640 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _propertyRefPath_in_propertyRef2652 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _propertyRefIdent_in_propertyRef2657 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _DOT_in_propertyRefPath2677 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _propertyRefLhs_in_propertyRefPath2681 = new BitSet(new ulong[]{0x1080000400100000UL,0x0UL,0x1UL});
-		public static readonly BitSet _propertyName_in_propertyRefPath2685 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _identifier_in_propertyRefIdent2722 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _propertyRef_in_propertyRefLhs2734 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _identifier_in_aliasRef2755 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _COLON_in_parameter2773 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _identifier_in_parameter2777 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _PARAM_in_parameter2798 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _NUM_INT_in_parameter2803 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _NUM_INT_in_numericInteger2836 = new BitSet(new ulong[]{0x2UL});
-	}
-	#endregion Follow sets
-}
-
-} // namespace  NHibernate.Hql.Ast.ANTLR 
diff --git a/src/NHibernate/Hql/Ast/ANTLR/Generated/SqlGenerator.cs b/src/NHibernate/Hql/Ast/ANTLR/Generated/SqlGenerator.cs
deleted file mode 100644
index a802a9f78ca..00000000000
--- a/src/NHibernate/Hql/Ast/ANTLR/Generated/SqlGenerator.cs
+++ /dev/null
@@ -1,8526 +0,0 @@
-//------------------------------------------------------------------------------
-// <auto-generated>
-//     This code was generated by a tool.
-//     ANTLR Version: 3.5.0.2
-//
-//     Changes to this file may cause incorrect behavior and will be lost if
-//     the code is regenerated.
-// </auto-generated>
-//------------------------------------------------------------------------------
-
-// $ANTLR 3.5.0.2 SqlGenerator.g 2015-05-03 23:15:29
-
-// The variable 'variable' is assigned but its value is never used.
-#pragma warning disable 219
-// Unreachable code detected.
-#pragma warning disable 162
-// Missing XML comment for publicly visible type or member 'Type_or_Member'
-#pragma warning disable 1591
-// CLS compliance checking will not be performed on 'type' because it is not visible from outside this assembly.
-#pragma warning disable 3019
-
-
-using NHibernate.Hql.Ast.ANTLR.Tree;
-
-
-using System.Collections.Generic;
-using Antlr.Runtime;
-using Antlr.Runtime.Misc;
-using Antlr.Runtime.Tree;
-using RewriteRuleITokenStream = Antlr.Runtime.Tree.RewriteRuleTokenStream;
-
-namespace  NHibernate.Hql.Ast.ANTLR 
-{
-/**
- * SQL Generator Tree Parser, providing SQL rendering of SQL ASTs produced by the previous phase, HqlSqlWalker.  All
- * syntax decoration such as extra spaces, lack of spaces, extra parens, etc. should be added by this class.
- * <br/>
- * This grammar processes the HQL/SQL AST and produces an SQL string.  The intent is to move dialect-specific
- * code into a sub-class that will override some of the methods, just like the other two grammars in this system.
- * @author Joshua Davis (joshua@hibernate.org)
- */
-[System.CodeDom.Compiler.GeneratedCode("ANTLR", "3.5.0.2")]
-[System.CLSCompliant(false)]
-public partial class SqlGenerator : Antlr.Runtime.Tree.TreeParser
-{
-	internal static readonly string[] tokenNames = new string[] {
-		"<invalid>", "<EOR>", "<DOWN>", "<UP>", "AGGREGATE", "ALIAS", "ALL", "AND", "ANY", "AS", "ASCENDING", "AVG", "BAND", "BETWEEN", "BNOT", "BOR", "BOTH", "BXOR", "CASE", "CASE2", "CLASS", "CLOSE", "CLOSE_BRACKET", "COLON", "COMMA", "CONCAT", "CONSTANT", "CONSTRUCTOR", "COUNT", "DELETE", "DESCENDING", "DISTINCT", "DIV", "DOT", "ELEMENTS", "ELSE", "EMPTY", "END", "EQ", "ESCAPE", "ESCqs", "EXISTS", "EXPONENT", "EXPR_LIST", "FALSE", "FETCH", "FILTER_ENTITY", "FLOAT_SUFFIX", "FROM", "FULL", "GE", "GROUP", "GT", "HAVING", "HEX_DIGIT", "IDENT", "ID_LETTER", "ID_START_LETTER", "IN", "INDEX_OP", "INDICES", "INNER", "INSERT", "INTO", "IN_LIST", "IS", "IS_NOT_NULL", "IS_NULL", "JAVA_CONSTANT", "JOIN", "LE", "LEADING", "LEFT", "LIKE", "LITERAL_by", "LT", "MAX", "MEMBER", "METHOD_CALL", "MIN", "MINUS", "NE", "NEW", "NOT", "NOT_BETWEEN", "NOT_IN", "NOT_LIKE", "NULL", "NUM_DECIMAL", "NUM_DOUBLE", "NUM_FLOAT", "NUM_INT", "NUM_LONG", "OBJECT", "OF", "ON", "OPEN", "OPEN_BRACKET", "OR", "ORDER", "ORDER_ELEMENT", "OUTER", "PARAM", "PLUS", "PROPERTIES", "QUERY", "QUOTED_String", "RANGE", "RIGHT", "ROW_STAR", "SELECT", "SELECT_FROM", "SET", "SKIP", "SOME", "SQL_NE", "STAR", "SUM", "TAKE", "THEN", "TRAILING", "TRUE", "UNARY_MINUS", "UNARY_PLUS", "UNION", "UPDATE", "VECTOR_EXPR", "VERSIONED", "WEIRD_IDENT", "WHEN", "WHERE", "WITH", "WS", "'ascending'", "'descending'", "ALIAS_REF", "BOGUS", "FILTERS", "FROM_FRAGMENT", "IMPLIED_FROM", "JOIN_FRAGMENT", "LEFT_OUTER", "METHOD_NAME", "NAMED_PARAM", "PROPERTY_REF", "RESULT_VARIABLE_REF", "RIGHT_OUTER", "SELECT_CLAUSE", "SELECT_COLUMNS", "SELECT_EXPR", "SQL_TOKEN", "THETA_JOINS"
-	};
-	public const int EOF=-1;
-	public const int AGGREGATE=4;
-	public const int ALIAS=5;
-	public const int ALL=6;
-	public const int AND=7;
-	public const int ANY=8;
-	public const int AS=9;
-	public const int ASCENDING=10;
-	public const int AVG=11;
-	public const int BAND=12;
-	public const int BETWEEN=13;
-	public const int BNOT=14;
-	public const int BOR=15;
-	public const int BOTH=16;
-	public const int BXOR=17;
-	public const int CASE=18;
-	public const int CASE2=19;
-	public const int CLASS=20;
-	public const int CLOSE=21;
-	public const int CLOSE_BRACKET=22;
-	public const int COLON=23;
-	public const int COMMA=24;
-	public const int CONCAT=25;
-	public const int CONSTANT=26;
-	public const int CONSTRUCTOR=27;
-	public const int COUNT=28;
-	public const int DELETE=29;
-	public const int DESCENDING=30;
-	public const int DISTINCT=31;
-	public const int DIV=32;
-	public const int DOT=33;
-	public const int ELEMENTS=34;
-	public const int ELSE=35;
-	public const int EMPTY=36;
-	public const int END=37;
-	public const int EQ=38;
-	public const int ESCAPE=39;
-	public const int ESCqs=40;
-	public const int EXISTS=41;
-	public const int EXPONENT=42;
-	public const int EXPR_LIST=43;
-	public const int FALSE=44;
-	public const int FETCH=45;
-	public const int FILTER_ENTITY=46;
-	public const int FLOAT_SUFFIX=47;
-	public const int FROM=48;
-	public const int FULL=49;
-	public const int GE=50;
-	public const int GROUP=51;
-	public const int GT=52;
-	public const int HAVING=53;
-	public const int HEX_DIGIT=54;
-	public const int IDENT=55;
-	public const int ID_LETTER=56;
-	public const int ID_START_LETTER=57;
-	public const int IN=58;
-	public const int INDEX_OP=59;
-	public const int INDICES=60;
-	public const int INNER=61;
-	public const int INSERT=62;
-	public const int INTO=63;
-	public const int IN_LIST=64;
-	public const int IS=65;
-	public const int IS_NOT_NULL=66;
-	public const int IS_NULL=67;
-	public const int JAVA_CONSTANT=68;
-	public const int JOIN=69;
-	public const int LE=70;
-	public const int LEADING=71;
-	public const int LEFT=72;
-	public const int LIKE=73;
-	public const int LITERAL_by=74;
-	public const int LT=75;
-	public const int MAX=76;
-	public const int MEMBER=77;
-	public const int METHOD_CALL=78;
-	public const int MIN=79;
-	public const int MINUS=80;
-	public const int NE=81;
-	public const int NEW=82;
-	public const int NOT=83;
-	public const int NOT_BETWEEN=84;
-	public const int NOT_IN=85;
-	public const int NOT_LIKE=86;
-	public const int NULL=87;
-	public const int NUM_DECIMAL=88;
-	public const int NUM_DOUBLE=89;
-	public const int NUM_FLOAT=90;
-	public const int NUM_INT=91;
-	public const int NUM_LONG=92;
-	public const int OBJECT=93;
-	public const int OF=94;
-	public const int ON=95;
-	public const int OPEN=96;
-	public const int OPEN_BRACKET=97;
-	public const int OR=98;
-	public const int ORDER=99;
-	public const int ORDER_ELEMENT=100;
-	public const int OUTER=101;
-	public const int PARAM=102;
-	public const int PLUS=103;
-	public const int PROPERTIES=104;
-	public const int QUERY=105;
-	public const int QUOTED_String=106;
-	public const int RANGE=107;
-	public const int RIGHT=108;
-	public const int ROW_STAR=109;
-	public const int SELECT=110;
-	public const int SELECT_FROM=111;
-	public const int SET=112;
-	public const int SKIP=113;
-	public const int SOME=114;
-	public const int SQL_NE=115;
-	public const int STAR=116;
-	public const int SUM=117;
-	public const int TAKE=118;
-	public const int THEN=119;
-	public const int TRAILING=120;
-	public const int TRUE=121;
-	public const int UNARY_MINUS=122;
-	public const int UNARY_PLUS=123;
-	public const int UNION=124;
-	public const int UPDATE=125;
-	public const int VECTOR_EXPR=126;
-	public const int VERSIONED=127;
-	public const int WEIRD_IDENT=128;
-	public const int WHEN=129;
-	public const int WHERE=130;
-	public const int WITH=131;
-	public const int WS=132;
-	public const int T__133=133;
-	public const int T__134=134;
-	public const int ALIAS_REF=135;
-	public const int BOGUS=136;
-	public const int FILTERS=137;
-	public const int FROM_FRAGMENT=138;
-	public const int IMPLIED_FROM=139;
-	public const int JOIN_FRAGMENT=140;
-	public const int LEFT_OUTER=141;
-	public const int METHOD_NAME=142;
-	public const int NAMED_PARAM=143;
-	public const int PROPERTY_REF=144;
-	public const int RESULT_VARIABLE_REF=145;
-	public const int RIGHT_OUTER=146;
-	public const int SELECT_CLAUSE=147;
-	public const int SELECT_COLUMNS=148;
-	public const int SELECT_EXPR=149;
-	public const int SQL_TOKEN=150;
-	public const int THETA_JOINS=151;
-
-	public SqlGenerator(ITreeNodeStream input)
-		: this(input, new RecognizerSharedState())
-	{
-	}
-	public SqlGenerator(ITreeNodeStream input, RecognizerSharedState state)
-		: base(input, state)
-	{
-		OnCreated();
-	}
-
-	public override string[] TokenNames { get { return SqlGenerator.tokenNames; } }
-	public override string GrammarFileName { get { return "SqlGenerator.g"; } }
-
-
-	partial void OnCreated();
-	partial void EnterRule(string ruleName, int ruleIndex);
-	partial void LeaveRule(string ruleName, int ruleIndex);
-
-	#region Rules
-	partial void EnterRule_statement();
-	partial void LeaveRule_statement();
-	// $ANTLR start "statement"
-	// SqlGenerator.g:27:8: public statement : ( selectStatement | updateStatement | deleteStatement | insertStatement );
-	[GrammarRule("statement")]
-	public void statement()
-	{
-		EnterRule_statement();
-		EnterRule("statement", 1);
-		TraceIn("statement", 1);
-		try { DebugEnterRule(GrammarFileName, "statement");
-		DebugLocation(27, 1);
-		try
-		{
-			// SqlGenerator.g:28:2: ( selectStatement | updateStatement | deleteStatement | insertStatement )
-			int alt1=4;
-			try { DebugEnterDecision(1, false);
-			switch (input.LA(1))
-			{
-			case SELECT:
-				{
-				alt1 = 1;
-				}
-				break;
-			case UPDATE:
-				{
-				alt1 = 2;
-				}
-				break;
-			case DELETE:
-				{
-				alt1 = 3;
-				}
-				break;
-			case INSERT:
-				{
-				alt1 = 4;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 1, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(1); }
-			switch (alt1)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:28:4: selectStatement
-				{
-				DebugLocation(28, 4);
-				PushFollow(Follow._selectStatement_in_statement59);
-				selectStatement();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:29:4: updateStatement
-				{
-				DebugLocation(29, 4);
-				PushFollow(Follow._updateStatement_in_statement64);
-				updateStatement();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:30:4: deleteStatement
-				{
-				DebugLocation(30, 4);
-				PushFollow(Follow._deleteStatement_in_statement69);
-				deleteStatement();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// SqlGenerator.g:31:4: insertStatement
-				{
-				DebugLocation(31, 4);
-				PushFollow(Follow._insertStatement_in_statement74);
-				insertStatement();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("statement", 1);
-			LeaveRule("statement", 1);
-			LeaveRule_statement();
-		}
-		DebugLocation(32, 1);
-		} finally { DebugExitRule(GrammarFileName, "statement"); }
-		return;
-
-	}
-	// $ANTLR end "statement"
-
-	partial void EnterRule_selectStatement();
-	partial void LeaveRule_selectStatement();
-	// $ANTLR start "selectStatement"
-	// SqlGenerator.g:34:1: selectStatement : ^( SELECT selectClause from ( ^( WHERE whereExpr ) )? ( ^( GROUP groupExprs ) )? ( ^( HAVING booleanExpr[false] ) )? ( ^( ORDER orderExprs ) )? ( ^( SKIP si= limitValue ) )? ( ^( TAKE ti= limitValue ) )? ) ;
-	[GrammarRule("selectStatement")]
-	private void selectStatement()
-	{
-		EnterRule_selectStatement();
-		EnterRule("selectStatement", 2);
-		TraceIn("selectStatement", 2);
-		TreeRuleReturnScope<IASTNode> si = default(TreeRuleReturnScope<IASTNode>);
-		TreeRuleReturnScope<IASTNode> ti = default(TreeRuleReturnScope<IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "selectStatement");
-		DebugLocation(34, 1);
-		try
-		{
-			// SqlGenerator.g:35:2: ( ^( SELECT selectClause from ( ^( WHERE whereExpr ) )? ( ^( GROUP groupExprs ) )? ( ^( HAVING booleanExpr[false] ) )? ( ^( ORDER orderExprs ) )? ( ^( SKIP si= limitValue ) )? ( ^( TAKE ti= limitValue ) )? ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:35:4: ^( SELECT selectClause from ( ^( WHERE whereExpr ) )? ( ^( GROUP groupExprs ) )? ( ^( HAVING booleanExpr[false] ) )? ( ^( ORDER orderExprs ) )? ( ^( SKIP si= limitValue ) )? ( ^( TAKE ti= limitValue ) )? )
-			{
-			DebugLocation(35, 4);
-			DebugLocation(35, 6);
-			Match(input,SELECT,Follow._SELECT_in_selectStatement86); if (state.failed) return;
-
-			DebugLocation(35, 13);
-			if (state.backtracking == 0)
-			{
-				 StartQuery(); Out("select "); 
-			}
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(36, 3);
-			PushFollow(Follow._selectClause_in_selectStatement92);
-			selectClause();
-			PopFollow();
-			if (state.failed) return;
-			DebugLocation(37, 3);
-			PushFollow(Follow._from_in_selectStatement96);
-			from();
-			PopFollow();
-			if (state.failed) return;
-			DebugLocation(38, 3);
-			// SqlGenerator.g:38:3: ( ^( WHERE whereExpr ) )?
-			int alt2=2;
-			try { DebugEnterSubRule(2);
-			try { DebugEnterDecision(2, false);
-			int LA2_1 = input.LA(1);
-
-			if ((LA2_1==WHERE))
-			{
-				alt2 = 1;
-			}
-			} finally { DebugExitDecision(2); }
-			switch (alt2)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:38:5: ^( WHERE whereExpr )
-				{
-				DebugLocation(38, 5);
-				DebugLocation(38, 7);
-				Match(input,WHERE,Follow._WHERE_in_selectStatement103); if (state.failed) return;
-
-				DebugLocation(38, 13);
-				if (state.backtracking == 0)
-				{
-					 Out(" where "); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(38, 33);
-				PushFollow(Follow._whereExpr_in_selectStatement107);
-				whereExpr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(2); }
-
-			DebugLocation(39, 3);
-			// SqlGenerator.g:39:3: ( ^( GROUP groupExprs ) )?
-			int alt3=2;
-			try { DebugEnterSubRule(3);
-			try { DebugEnterDecision(3, false);
-			int LA3_1 = input.LA(1);
-
-			if ((LA3_1==GROUP))
-			{
-				alt3 = 1;
-			}
-			} finally { DebugExitDecision(3); }
-			switch (alt3)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:39:5: ^( GROUP groupExprs )
-				{
-				DebugLocation(39, 5);
-				DebugLocation(39, 7);
-				Match(input,GROUP,Follow._GROUP_in_selectStatement119); if (state.failed) return;
-
-				DebugLocation(39, 13);
-				if (state.backtracking == 0)
-				{
-					 Out(" group by "); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(39, 36);
-				PushFollow(Follow._groupExprs_in_selectStatement123);
-				groupExprs();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(3); }
-
-			DebugLocation(40, 3);
-			// SqlGenerator.g:40:3: ( ^( HAVING booleanExpr[false] ) )?
-			int alt4=2;
-			try { DebugEnterSubRule(4);
-			try { DebugEnterDecision(4, false);
-			int LA4_1 = input.LA(1);
-
-			if ((LA4_1==HAVING))
-			{
-				alt4 = 1;
-			}
-			} finally { DebugExitDecision(4); }
-			switch (alt4)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:40:5: ^( HAVING booleanExpr[false] )
-				{
-				DebugLocation(40, 5);
-				DebugLocation(40, 7);
-				Match(input,HAVING,Follow._HAVING_in_selectStatement135); if (state.failed) return;
-
-				DebugLocation(40, 14);
-				if (state.backtracking == 0)
-				{
-					 Out(" having "); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(40, 35);
-				PushFollow(Follow._booleanExpr_in_selectStatement139);
-				booleanExpr(false);
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(4); }
-
-			DebugLocation(41, 3);
-			// SqlGenerator.g:41:3: ( ^( ORDER orderExprs ) )?
-			int alt5=2;
-			try { DebugEnterSubRule(5);
-			try { DebugEnterDecision(5, false);
-			int LA5_1 = input.LA(1);
-
-			if ((LA5_1==ORDER))
-			{
-				alt5 = 1;
-			}
-			} finally { DebugExitDecision(5); }
-			switch (alt5)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:41:5: ^( ORDER orderExprs )
-				{
-				DebugLocation(41, 5);
-				DebugLocation(41, 7);
-				Match(input,ORDER,Follow._ORDER_in_selectStatement151); if (state.failed) return;
-
-				DebugLocation(41, 13);
-				if (state.backtracking == 0)
-				{
-					 Out(" order by "); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(41, 36);
-				PushFollow(Follow._orderExprs_in_selectStatement155);
-				orderExprs();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(5); }
-
-			DebugLocation(42, 3);
-			// SqlGenerator.g:42:3: ( ^( SKIP si= limitValue ) )?
-			int alt6=2;
-			try { DebugEnterSubRule(6);
-			try { DebugEnterDecision(6, false);
-			int LA6_1 = input.LA(1);
-
-			if ((LA6_1==SKIP))
-			{
-				alt6 = 1;
-			}
-			} finally { DebugExitDecision(6); }
-			switch (alt6)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:42:5: ^( SKIP si= limitValue )
-				{
-				DebugLocation(42, 5);
-				DebugLocation(42, 7);
-				Match(input,SKIP,Follow._SKIP_in_selectStatement167); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(42, 14);
-				PushFollow(Follow._limitValue_in_selectStatement171);
-				si=limitValue();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-				DebugLocation(42, 27);
-				if (state.backtracking == 0)
-				{
-					 Skip((si!=null?((IASTNode)si.Start):default(IASTNode))); 
-				}
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(6); }
-
-			DebugLocation(43, 3);
-			// SqlGenerator.g:43:3: ( ^( TAKE ti= limitValue ) )?
-			int alt7=2;
-			try { DebugEnterSubRule(7);
-			try { DebugEnterDecision(7, false);
-			int LA7_1 = input.LA(1);
-
-			if ((LA7_1==TAKE))
-			{
-				alt7 = 1;
-			}
-			} finally { DebugExitDecision(7); }
-			switch (alt7)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:43:5: ^( TAKE ti= limitValue )
-				{
-				DebugLocation(43, 5);
-				DebugLocation(43, 7);
-				Match(input,TAKE,Follow._TAKE_in_selectStatement183); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(43, 14);
-				PushFollow(Follow._limitValue_in_selectStatement187);
-				ti=limitValue();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-				DebugLocation(43, 27);
-				if (state.backtracking == 0)
-				{
-					 Take((ti!=null?((IASTNode)ti.Start):default(IASTNode))); 
-				}
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(7); }
-
-			DebugLocation(44, 3);
-			if (state.backtracking == 0)
-			{
-				 EndQuery(); 
-			}
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("selectStatement", 2);
-			LeaveRule("selectStatement", 2);
-			LeaveRule_selectStatement();
-		}
-		DebugLocation(46, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectStatement"); }
-		return;
-
-	}
-	// $ANTLR end "selectStatement"
-
-	partial void EnterRule_updateStatement();
-	partial void LeaveRule_updateStatement();
-	// $ANTLR start "updateStatement"
-	// SqlGenerator.g:51:1: updateStatement : ^( UPDATE ^( FROM fromTable ) setClause ( whereClause )? ) ;
-	[GrammarRule("updateStatement")]
-	private void updateStatement()
-	{
-		EnterRule_updateStatement();
-		EnterRule("updateStatement", 3);
-		TraceIn("updateStatement", 3);
-		try { DebugEnterRule(GrammarFileName, "updateStatement");
-		DebugLocation(51, 1);
-		try
-		{
-			// SqlGenerator.g:52:2: ( ^( UPDATE ^( FROM fromTable ) setClause ( whereClause )? ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:52:4: ^( UPDATE ^( FROM fromTable ) setClause ( whereClause )? )
-			{
-			DebugLocation(52, 4);
-			DebugLocation(52, 6);
-			Match(input,UPDATE,Follow._UPDATE_in_updateStatement214); if (state.failed) return;
-
-			DebugLocation(52, 13);
-			if (state.backtracking == 0)
-			{
-				 Out("update "); 
-			}
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(53, 3);
-			DebugLocation(53, 6);
-			Match(input,FROM,Follow._FROM_in_updateStatement222); if (state.failed) return;
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(53, 11);
-			PushFollow(Follow._fromTable_in_updateStatement224);
-			fromTable();
-			PopFollow();
-			if (state.failed) return;
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-			DebugLocation(54, 3);
-			PushFollow(Follow._setClause_in_updateStatement230);
-			setClause();
-			PopFollow();
-			if (state.failed) return;
-			DebugLocation(55, 3);
-			// SqlGenerator.g:55:3: ( whereClause )?
-			int alt8=2;
-			try { DebugEnterSubRule(8);
-			try { DebugEnterDecision(8, false);
-			int LA8_1 = input.LA(1);
-
-			if ((LA8_1==WHERE))
-			{
-				alt8 = 1;
-			}
-			} finally { DebugExitDecision(8); }
-			switch (alt8)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:55:4: whereClause
-				{
-				DebugLocation(55, 4);
-				PushFollow(Follow._whereClause_in_updateStatement235);
-				whereClause();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(8); }
-
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("updateStatement", 3);
-			LeaveRule("updateStatement", 3);
-			LeaveRule_updateStatement();
-		}
-		DebugLocation(57, 1);
-		} finally { DebugExitRule(GrammarFileName, "updateStatement"); }
-		return;
-
-	}
-	// $ANTLR end "updateStatement"
-
-	partial void EnterRule_deleteStatement();
-	partial void LeaveRule_deleteStatement();
-	// $ANTLR start "deleteStatement"
-	// SqlGenerator.g:59:1: deleteStatement : ^( DELETE from ( whereClause )? ) ;
-	[GrammarRule("deleteStatement")]
-	private void deleteStatement()
-	{
-		EnterRule_deleteStatement();
-		EnterRule("deleteStatement", 4);
-		TraceIn("deleteStatement", 4);
-		try { DebugEnterRule(GrammarFileName, "deleteStatement");
-		DebugLocation(59, 1);
-		try
-		{
-			// SqlGenerator.g:61:2: ( ^( DELETE from ( whereClause )? ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:61:4: ^( DELETE from ( whereClause )? )
-			{
-			DebugLocation(61, 4);
-			DebugLocation(61, 6);
-			Match(input,DELETE,Follow._DELETE_in_deleteStatement254); if (state.failed) return;
-
-			DebugLocation(61, 13);
-			if (state.backtracking == 0)
-			{
-				 Out("delete"); 
-			}
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(62, 3);
-			PushFollow(Follow._from_in_deleteStatement260);
-			from();
-			PopFollow();
-			if (state.failed) return;
-			DebugLocation(63, 3);
-			// SqlGenerator.g:63:3: ( whereClause )?
-			int alt9=2;
-			try { DebugEnterSubRule(9);
-			try { DebugEnterDecision(9, false);
-			int LA9_1 = input.LA(1);
-
-			if ((LA9_1==WHERE))
-			{
-				alt9 = 1;
-			}
-			} finally { DebugExitDecision(9); }
-			switch (alt9)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:63:4: whereClause
-				{
-				DebugLocation(63, 4);
-				PushFollow(Follow._whereClause_in_deleteStatement265);
-				whereClause();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(9); }
-
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("deleteStatement", 4);
-			LeaveRule("deleteStatement", 4);
-			LeaveRule_deleteStatement();
-		}
-		DebugLocation(65, 1);
-		} finally { DebugExitRule(GrammarFileName, "deleteStatement"); }
-		return;
-
-	}
-	// $ANTLR end "deleteStatement"
-
-	partial void EnterRule_insertStatement();
-	partial void LeaveRule_insertStatement();
-	// $ANTLR start "insertStatement"
-	// SqlGenerator.g:67:1: insertStatement : ^( INSERT ^(i= INTO ( . )* ) selectStatement ) ;
-	[GrammarRule("insertStatement")]
-	private void insertStatement()
-	{
-		EnterRule_insertStatement();
-		EnterRule("insertStatement", 5);
-		TraceIn("insertStatement", 5);
-		IASTNode i = default(IASTNode);
-
-		try { DebugEnterRule(GrammarFileName, "insertStatement");
-		DebugLocation(67, 1);
-		try
-		{
-			// SqlGenerator.g:68:2: ( ^( INSERT ^(i= INTO ( . )* ) selectStatement ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:68:4: ^( INSERT ^(i= INTO ( . )* ) selectStatement )
-			{
-			DebugLocation(68, 4);
-			DebugLocation(68, 6);
-			Match(input,INSERT,Follow._INSERT_in_insertStatement282); if (state.failed) return;
-
-			DebugLocation(68, 13);
-			if (state.backtracking == 0)
-			{
-				 Out( "insert " ); 
-			}
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(69, 3);
-			DebugLocation(69, 6);
-			i=(IASTNode)Match(input,INTO,Follow._INTO_in_insertStatement291); if (state.failed) return;
-
-			DebugLocation(69, 12);
-			if (state.backtracking == 0)
-			{
-				 Out( i ); Out( " " ); 
-			}
-
-			if (input.LA(1) == TokenTypes.Down)
-			{
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(69, 38);
-				// SqlGenerator.g:69:38: ( . )*
-				try { DebugEnterSubRule(10);
-				while (true)
-				{
-					int alt10=2;
-					try { DebugEnterDecision(10, false);
-					int LA10_1 = input.LA(1);
-
-					if (((LA10_1>=AGGREGATE && LA10_1<=THETA_JOINS)))
-					{
-						alt10 = 1;
-					}
-					else if ((LA10_1==UP))
-					{
-						alt10 = 2;
-					}
-
-
-					} finally { DebugExitDecision(10); }
-					switch ( alt10 )
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// SqlGenerator.g:69:38: .
-						{
-						DebugLocation(69, 38);
-						MatchAny(input); if (state.failed) return;
-
-						}
-						break;
-
-					default:
-						goto loop10;
-					}
-				}
-
-				loop10:
-					;
-
-				} finally { DebugExitSubRule(10); }
-
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-			}
-
-			DebugLocation(70, 3);
-			PushFollow(Follow._selectStatement_in_insertStatement301);
-			selectStatement();
-			PopFollow();
-			if (state.failed) return;
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("insertStatement", 5);
-			LeaveRule("insertStatement", 5);
-			LeaveRule_insertStatement();
-		}
-		DebugLocation(72, 1);
-		} finally { DebugExitRule(GrammarFileName, "insertStatement"); }
-		return;
-
-	}
-	// $ANTLR end "insertStatement"
-
-	partial void EnterRule_setClause();
-	partial void LeaveRule_setClause();
-	// $ANTLR start "setClause"
-	// SqlGenerator.g:74:1: setClause : ^( SET comparisonExpr[false] ( comparisonExpr[false] )* ) ;
-	[GrammarRule("setClause")]
-	private void setClause()
-	{
-		EnterRule_setClause();
-		EnterRule("setClause", 6);
-		TraceIn("setClause", 6);
-		try { DebugEnterRule(GrammarFileName, "setClause");
-		DebugLocation(74, 1);
-		try
-		{
-			// SqlGenerator.g:77:2: ( ^( SET comparisonExpr[false] ( comparisonExpr[false] )* ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:77:4: ^( SET comparisonExpr[false] ( comparisonExpr[false] )* )
-			{
-			DebugLocation(77, 4);
-			DebugLocation(77, 7);
-			Match(input,SET,Follow._SET_in_setClause321); if (state.failed) return;
-
-			DebugLocation(77, 11);
-			if (state.backtracking == 0)
-			{
-				 Out(" set "); 
-			}
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(77, 29);
-			PushFollow(Follow._comparisonExpr_in_setClause325);
-			comparisonExpr(false);
-			PopFollow();
-			if (state.failed) return;
-			DebugLocation(77, 51);
-			// SqlGenerator.g:77:51: ( comparisonExpr[false] )*
-			try { DebugEnterSubRule(11);
-			while (true)
-			{
-				int alt11=2;
-				try { DebugEnterDecision(11, false);
-				int LA11_1 = input.LA(1);
-
-				if ((LA11_1==BETWEEN||LA11_1==EQ||LA11_1==EXISTS||LA11_1==GE||LA11_1==GT||LA11_1==IN||(LA11_1>=IS_NOT_NULL && LA11_1<=IS_NULL)||LA11_1==LE||LA11_1==LIKE||LA11_1==LT||LA11_1==NE||(LA11_1>=NOT_BETWEEN && LA11_1<=NOT_LIKE)))
-				{
-					alt11 = 1;
-				}
-
-
-				} finally { DebugExitDecision(11); }
-				switch ( alt11 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// SqlGenerator.g:77:53: comparisonExpr[false]
-					{
-					DebugLocation(77, 53);
-					if (state.backtracking == 0)
-					{
-						 Out(", "); 
-					}
-					DebugLocation(77, 68);
-					PushFollow(Follow._comparisonExpr_in_setClause332);
-					comparisonExpr(false);
-					PopFollow();
-					if (state.failed) return;
-
-					}
-					break;
-
-				default:
-					goto loop11;
-				}
-			}
-
-			loop11:
-				;
-
-			} finally { DebugExitSubRule(11); }
-
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("setClause", 6);
-			LeaveRule("setClause", 6);
-			LeaveRule_setClause();
-		}
-		DebugLocation(78, 1);
-		} finally { DebugExitRule(GrammarFileName, "setClause"); }
-		return;
-
-	}
-	// $ANTLR end "setClause"
-
-	partial void EnterRule_whereClause();
-	partial void LeaveRule_whereClause();
-	// $ANTLR start "whereClause"
-	// SqlGenerator.g:80:8: public whereClause : ^( WHERE whereClauseExpr ) ;
-	[GrammarRule("whereClause")]
-	public void whereClause()
-	{
-		EnterRule_whereClause();
-		EnterRule("whereClause", 7);
-		TraceIn("whereClause", 7);
-		try { DebugEnterRule(GrammarFileName, "whereClause");
-		DebugLocation(80, 1);
-		try
-		{
-			// SqlGenerator.g:81:2: ( ^( WHERE whereClauseExpr ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:81:4: ^( WHERE whereClauseExpr )
-			{
-			DebugLocation(81, 4);
-			DebugLocation(81, 6);
-			Match(input,WHERE,Follow._WHERE_in_whereClause352); if (state.failed) return;
-
-			DebugLocation(81, 12);
-			if (state.backtracking == 0)
-			{
-				 Out(" where "); 
-			}
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(81, 32);
-			PushFollow(Follow._whereClauseExpr_in_whereClause356);
-			whereClauseExpr();
-			PopFollow();
-			if (state.failed) return;
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("whereClause", 7);
-			LeaveRule("whereClause", 7);
-			LeaveRule_whereClause();
-		}
-		DebugLocation(82, 1);
-		} finally { DebugExitRule(GrammarFileName, "whereClause"); }
-		return;
-
-	}
-	// $ANTLR end "whereClause"
-
-	partial void EnterRule_whereClauseExpr();
-	partial void LeaveRule_whereClauseExpr();
-	// $ANTLR start "whereClauseExpr"
-	// SqlGenerator.g:84:1: whereClauseExpr : ( ( SQL_TOKEN )=> conditionList | booleanExpr[ false ] );
-	[GrammarRule("whereClauseExpr")]
-	private void whereClauseExpr()
-	{
-		EnterRule_whereClauseExpr();
-		EnterRule("whereClauseExpr", 8);
-		TraceIn("whereClauseExpr", 8);
-		try { DebugEnterRule(GrammarFileName, "whereClauseExpr");
-		DebugLocation(84, 1);
-		try
-		{
-			// SqlGenerator.g:85:2: ( ( SQL_TOKEN )=> conditionList | booleanExpr[ false ] )
-			int alt12=2;
-			try { DebugEnterDecision(12, false);
-			int LA12_1 = input.LA(1);
-
-			if ((LA12_1==SQL_TOKEN))
-			{
-				int LA12_2 = input.LA(2);
-
-				if ((LA12_2==DOWN) && (EvaluatePredicate(synpred1_SqlGenerator_fragment)))
-				{
-					alt12 = 1;
-				}
-				else if ((LA12_2==UP))
-				{
-					alt12 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 12, 1, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-			else if ((LA12_1==AND||LA12_1==BETWEEN||LA12_1==EQ||LA12_1==EXISTS||LA12_1==GE||LA12_1==GT||LA12_1==IN||(LA12_1>=IS_NOT_NULL && LA12_1<=IS_NULL)||LA12_1==LE||LA12_1==LIKE||LA12_1==LT||LA12_1==METHOD_CALL||LA12_1==NE||(LA12_1>=NOT && LA12_1<=NOT_LIKE)||LA12_1==OR))
-			{
-				alt12 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 12, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(12); }
-			switch (alt12)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:85:4: ( SQL_TOKEN )=> conditionList
-				{
-				DebugLocation(85, 19);
-				PushFollow(Follow._conditionList_in_whereClauseExpr375);
-				conditionList();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:86:4: booleanExpr[ false ]
-				{
-				DebugLocation(86, 4);
-				PushFollow(Follow._booleanExpr_in_whereClauseExpr380);
-				booleanExpr(false);
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("whereClauseExpr", 8);
-			LeaveRule("whereClauseExpr", 8);
-			LeaveRule_whereClauseExpr();
-		}
-		DebugLocation(87, 1);
-		} finally { DebugExitRule(GrammarFileName, "whereClauseExpr"); }
-		return;
-
-	}
-	// $ANTLR end "whereClauseExpr"
-
-	partial void EnterRule_orderExprs();
-	partial void LeaveRule_orderExprs();
-	// $ANTLR start "orderExprs"
-	// SqlGenerator.g:89:1: orderExprs : ( expr ) (dir= orderDirection )? ( orderExprs )? ;
-	[GrammarRule("orderExprs")]
-	private void orderExprs()
-	{
-		EnterRule_orderExprs();
-		EnterRule("orderExprs", 9);
-		TraceIn("orderExprs", 9);
-		TreeRuleReturnScope<IASTNode> dir = default(TreeRuleReturnScope<IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "orderExprs");
-		DebugLocation(89, 1);
-		try
-		{
-			// SqlGenerator.g:91:2: ( ( expr ) (dir= orderDirection )? ( orderExprs )? )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:91:4: ( expr ) (dir= orderDirection )? ( orderExprs )?
-			{
-			DebugLocation(91, 4);
-			// SqlGenerator.g:91:4: ( expr )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:91:6: expr
-			{
-			DebugLocation(91, 6);
-			PushFollow(Follow._expr_in_orderExprs396);
-			expr();
-			PopFollow();
-			if (state.failed) return;
-
-			}
-
-			DebugLocation(91, 13);
-			// SqlGenerator.g:91:13: (dir= orderDirection )?
-			int alt13=2;
-			try { DebugEnterSubRule(13);
-			try { DebugEnterDecision(13, false);
-			int LA13_1 = input.LA(1);
-
-			if ((LA13_1==ASCENDING||LA13_1==DESCENDING))
-			{
-				alt13 = 1;
-			}
-			} finally { DebugExitDecision(13); }
-			switch (alt13)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:91:14: dir= orderDirection
-				{
-				DebugLocation(91, 17);
-				PushFollow(Follow._orderDirection_in_orderExprs403);
-				dir=orderDirection();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(91, 33);
-				if (state.backtracking == 0)
-				{
-					 Out(" "); Out((dir!=null?((IASTNode)dir.Start):default(IASTNode))); 
-				}
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(13); }
-
-			DebugLocation(91, 66);
-			// SqlGenerator.g:91:66: ( orderExprs )?
-			int alt14=2;
-			try { DebugEnterSubRule(14);
-			try { DebugEnterDecision(14, false);
-			int LA14_1 = input.LA(1);
-
-			if ((LA14_1==AGGREGATE||LA14_1==ALL||LA14_1==ANY||LA14_1==BAND||(LA14_1>=BNOT && LA14_1<=BOR)||(LA14_1>=BXOR && LA14_1<=CASE2)||LA14_1==CONSTANT||LA14_1==COUNT||(LA14_1>=DIV && LA14_1<=DOT)||LA14_1==FALSE||LA14_1==IDENT||LA14_1==INDEX_OP||LA14_1==JAVA_CONSTANT||LA14_1==METHOD_CALL||LA14_1==MINUS||(LA14_1>=NULL && LA14_1<=NUM_LONG)||(LA14_1>=PARAM && LA14_1<=PLUS)||LA14_1==QUOTED_String||LA14_1==SELECT||LA14_1==SOME||LA14_1==STAR||(LA14_1>=TRUE && LA14_1<=UNARY_MINUS)||LA14_1==UNION||LA14_1==VECTOR_EXPR||LA14_1==ALIAS_REF||LA14_1==NAMED_PARAM||LA14_1==RESULT_VARIABLE_REF||LA14_1==SQL_TOKEN))
-			{
-				alt14 = 1;
-			}
-			} finally { DebugExitDecision(14); }
-			switch (alt14)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:91:68: orderExprs
-				{
-				DebugLocation(91, 68);
-				if (state.backtracking == 0)
-				{
-					Out(", "); 
-				}
-				DebugLocation(91, 82);
-				PushFollow(Follow._orderExprs_in_orderExprs413);
-				orderExprs();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(14); }
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("orderExprs", 9);
-			LeaveRule("orderExprs", 9);
-			LeaveRule_orderExprs();
-		}
-		DebugLocation(92, 1);
-		} finally { DebugExitRule(GrammarFileName, "orderExprs"); }
-		return;
-
-	}
-	// $ANTLR end "orderExprs"
-
-	partial void EnterRule_groupExprs();
-	partial void LeaveRule_groupExprs();
-	// $ANTLR start "groupExprs"
-	// SqlGenerator.g:94:1: groupExprs : expr ( groupExprs )? ;
-	[GrammarRule("groupExprs")]
-	private void groupExprs()
-	{
-		EnterRule_groupExprs();
-		EnterRule("groupExprs", 10);
-		TraceIn("groupExprs", 10);
-		try { DebugEnterRule(GrammarFileName, "groupExprs");
-		DebugLocation(94, 1);
-		try
-		{
-			// SqlGenerator.g:96:2: ( expr ( groupExprs )? )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:96:4: expr ( groupExprs )?
-			{
-			DebugLocation(96, 4);
-			PushFollow(Follow._expr_in_groupExprs428);
-			expr();
-			PopFollow();
-			if (state.failed) return;
-			DebugLocation(96, 9);
-			// SqlGenerator.g:96:9: ( groupExprs )?
-			int alt15=2;
-			try { DebugEnterSubRule(15);
-			try { DebugEnterDecision(15, false);
-			int LA15_1 = input.LA(1);
-
-			if ((LA15_1==AGGREGATE||LA15_1==ALL||LA15_1==ANY||LA15_1==BAND||(LA15_1>=BNOT && LA15_1<=BOR)||(LA15_1>=BXOR && LA15_1<=CASE2)||LA15_1==CONSTANT||LA15_1==COUNT||(LA15_1>=DIV && LA15_1<=DOT)||LA15_1==FALSE||LA15_1==IDENT||LA15_1==INDEX_OP||LA15_1==JAVA_CONSTANT||LA15_1==METHOD_CALL||LA15_1==MINUS||(LA15_1>=NULL && LA15_1<=NUM_LONG)||(LA15_1>=PARAM && LA15_1<=PLUS)||LA15_1==QUOTED_String||LA15_1==SELECT||LA15_1==SOME||LA15_1==STAR||(LA15_1>=TRUE && LA15_1<=UNARY_MINUS)||LA15_1==UNION||LA15_1==VECTOR_EXPR||LA15_1==ALIAS_REF||LA15_1==NAMED_PARAM||LA15_1==RESULT_VARIABLE_REF||LA15_1==SQL_TOKEN))
-			{
-				alt15 = 1;
-			}
-			} finally { DebugExitDecision(15); }
-			switch (alt15)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:96:11: groupExprs
-				{
-				DebugLocation(96, 11);
-				if (state.backtracking == 0)
-				{
-					Out(" , "); 
-				}
-				DebugLocation(96, 26);
-				PushFollow(Follow._groupExprs_in_groupExprs434);
-				groupExprs();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(15); }
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("groupExprs", 10);
-			LeaveRule("groupExprs", 10);
-			LeaveRule_groupExprs();
-		}
-		DebugLocation(97, 1);
-		} finally { DebugExitRule(GrammarFileName, "groupExprs"); }
-		return;
-
-	}
-	// $ANTLR end "groupExprs"
-
-	partial void EnterRule_orderDirection();
-	partial void LeaveRule_orderDirection();
-	// $ANTLR start "orderDirection"
-	// SqlGenerator.g:99:1: orderDirection : ( ASCENDING | DESCENDING );
-	[GrammarRule("orderDirection")]
-	private TreeRuleReturnScope<IASTNode> orderDirection()
-	{
-		EnterRule_orderDirection();
-		EnterRule("orderDirection", 11);
-		TraceIn("orderDirection", 11);
-		TreeRuleReturnScope<IASTNode> retval = new TreeRuleReturnScope<IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		try { DebugEnterRule(GrammarFileName, "orderDirection");
-		DebugLocation(99, 1);
-		try
-		{
-			// SqlGenerator.g:100:2: ( ASCENDING | DESCENDING )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:
-			{
-			DebugLocation(100, 2);
-			if (input.LA(1)==ASCENDING||input.LA(1)==DESCENDING)
-			{
-				input.Consume();
-				state.errorRecovery=false;state.failed=false;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return retval;}
-				MismatchedSetException mse = new MismatchedSetException(null,input);
-				DebugRecognitionException(mse);
-				throw mse;
-			}
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("orderDirection", 11);
-			LeaveRule("orderDirection", 11);
-			LeaveRule_orderDirection();
-		}
-		DebugLocation(102, 1);
-		} finally { DebugExitRule(GrammarFileName, "orderDirection"); }
-		return retval;
-
-	}
-	// $ANTLR end "orderDirection"
-
-	partial void EnterRule_whereExpr();
-	partial void LeaveRule_whereExpr();
-	// $ANTLR start "whereExpr"
-	// SqlGenerator.g:104:8: public whereExpr : ( filters ( thetaJoins )? ( booleanExpr[ true ] )? | thetaJoins ( booleanExpr[ true ] )? | booleanExpr[false] );
-	[GrammarRule("whereExpr")]
-	public void whereExpr()
-	{
-		EnterRule_whereExpr();
-		EnterRule("whereExpr", 12);
-		TraceIn("whereExpr", 12);
-		try { DebugEnterRule(GrammarFileName, "whereExpr");
-		DebugLocation(104, 1);
-		try
-		{
-			// SqlGenerator.g:108:2: ( filters ( thetaJoins )? ( booleanExpr[ true ] )? | thetaJoins ( booleanExpr[ true ] )? | booleanExpr[false] )
-			int alt19=3;
-			try { DebugEnterDecision(19, false);
-			switch (input.LA(1))
-			{
-			case FILTERS:
-				{
-				alt19 = 1;
-				}
-				break;
-			case THETA_JOINS:
-				{
-				alt19 = 2;
-				}
-				break;
-			case AND:
-			case BETWEEN:
-			case EQ:
-			case EXISTS:
-			case GE:
-			case GT:
-			case IN:
-			case IS_NOT_NULL:
-			case IS_NULL:
-			case LE:
-			case LIKE:
-			case LT:
-			case METHOD_CALL:
-			case NE:
-			case NOT:
-			case NOT_BETWEEN:
-			case NOT_IN:
-			case NOT_LIKE:
-			case OR:
-			case SQL_TOKEN:
-				{
-				alt19 = 3;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 19, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(19); }
-			switch (alt19)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:108:4: filters ( thetaJoins )? ( booleanExpr[ true ] )?
-				{
-				DebugLocation(108, 4);
-				PushFollow(Follow._filters_in_whereExpr471);
-				filters();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(109, 3);
-				// SqlGenerator.g:109:3: ( thetaJoins )?
-				int alt16=2;
-				try { DebugEnterSubRule(16);
-				try { DebugEnterDecision(16, false);
-				int LA16_1 = input.LA(1);
-
-				if ((LA16_1==THETA_JOINS))
-				{
-					alt16 = 1;
-				}
-				} finally { DebugExitDecision(16); }
-				switch (alt16)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// SqlGenerator.g:109:5: thetaJoins
-					{
-					DebugLocation(109, 5);
-					if (state.backtracking == 0)
-					{
-						 Out(" and "); 
-					}
-					DebugLocation(109, 23);
-					PushFollow(Follow._thetaJoins_in_whereExpr479);
-					thetaJoins();
-					PopFollow();
-					if (state.failed) return;
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(16); }
-
-				DebugLocation(110, 3);
-				// SqlGenerator.g:110:3: ( booleanExpr[ true ] )?
-				int alt17=2;
-				try { DebugEnterSubRule(17);
-				try { DebugEnterDecision(17, false);
-				int LA17_1 = input.LA(1);
-
-				if ((LA17_1==AND||LA17_1==BETWEEN||LA17_1==EQ||LA17_1==EXISTS||LA17_1==GE||LA17_1==GT||LA17_1==IN||(LA17_1>=IS_NOT_NULL && LA17_1<=IS_NULL)||LA17_1==LE||LA17_1==LIKE||LA17_1==LT||LA17_1==METHOD_CALL||LA17_1==NE||(LA17_1>=NOT && LA17_1<=NOT_LIKE)||LA17_1==OR||LA17_1==SQL_TOKEN))
-				{
-					alt17 = 1;
-				}
-				} finally { DebugExitDecision(17); }
-				switch (alt17)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// SqlGenerator.g:110:5: booleanExpr[ true ]
-					{
-					DebugLocation(110, 5);
-					if (state.backtracking == 0)
-					{
-						 Out(" and "); 
-					}
-					DebugLocation(110, 23);
-					PushFollow(Follow._booleanExpr_in_whereExpr490);
-					booleanExpr(true);
-					PopFollow();
-					if (state.failed) return;
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(17); }
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:111:4: thetaJoins ( booleanExpr[ true ] )?
-				{
-				DebugLocation(111, 4);
-				PushFollow(Follow._thetaJoins_in_whereExpr500);
-				thetaJoins();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(112, 3);
-				// SqlGenerator.g:112:3: ( booleanExpr[ true ] )?
-				int alt18=2;
-				try { DebugEnterSubRule(18);
-				try { DebugEnterDecision(18, false);
-				int LA18_1 = input.LA(1);
-
-				if ((LA18_1==AND||LA18_1==BETWEEN||LA18_1==EQ||LA18_1==EXISTS||LA18_1==GE||LA18_1==GT||LA18_1==IN||(LA18_1>=IS_NOT_NULL && LA18_1<=IS_NULL)||LA18_1==LE||LA18_1==LIKE||LA18_1==LT||LA18_1==METHOD_CALL||LA18_1==NE||(LA18_1>=NOT && LA18_1<=NOT_LIKE)||LA18_1==OR||LA18_1==SQL_TOKEN))
-				{
-					alt18 = 1;
-				}
-				} finally { DebugExitDecision(18); }
-				switch (alt18)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// SqlGenerator.g:112:5: booleanExpr[ true ]
-					{
-					DebugLocation(112, 5);
-					if (state.backtracking == 0)
-					{
-						 Out(" and "); 
-					}
-					DebugLocation(112, 23);
-					PushFollow(Follow._booleanExpr_in_whereExpr508);
-					booleanExpr(true);
-					PopFollow();
-					if (state.failed) return;
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(18); }
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:113:4: booleanExpr[false]
-				{
-				DebugLocation(113, 4);
-				PushFollow(Follow._booleanExpr_in_whereExpr519);
-				booleanExpr(false);
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("whereExpr", 12);
-			LeaveRule("whereExpr", 12);
-			LeaveRule_whereExpr();
-		}
-		DebugLocation(114, 1);
-		} finally { DebugExitRule(GrammarFileName, "whereExpr"); }
-		return;
-
-	}
-	// $ANTLR end "whereExpr"
-
-	partial void EnterRule_filters();
-	partial void LeaveRule_filters();
-	// $ANTLR start "filters"
-	// SqlGenerator.g:116:1: filters : ^( FILTERS conditionList ) ;
-	[GrammarRule("filters")]
-	private void filters()
-	{
-		EnterRule_filters();
-		EnterRule("filters", 13);
-		TraceIn("filters", 13);
-		try { DebugEnterRule(GrammarFileName, "filters");
-		DebugLocation(116, 1);
-		try
-		{
-			// SqlGenerator.g:117:2: ( ^( FILTERS conditionList ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:117:4: ^( FILTERS conditionList )
-			{
-			DebugLocation(117, 4);
-			DebugLocation(117, 6);
-			Match(input,FILTERS,Follow._FILTERS_in_filters532); if (state.failed) return;
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(117, 14);
-			PushFollow(Follow._conditionList_in_filters534);
-			conditionList();
-			PopFollow();
-			if (state.failed) return;
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("filters", 13);
-			LeaveRule("filters", 13);
-			LeaveRule_filters();
-		}
-		DebugLocation(118, 1);
-		} finally { DebugExitRule(GrammarFileName, "filters"); }
-		return;
-
-	}
-	// $ANTLR end "filters"
-
-	partial void EnterRule_thetaJoins();
-	partial void LeaveRule_thetaJoins();
-	// $ANTLR start "thetaJoins"
-	// SqlGenerator.g:120:1: thetaJoins : ^( THETA_JOINS conditionList ) ;
-	[GrammarRule("thetaJoins")]
-	private void thetaJoins()
-	{
-		EnterRule_thetaJoins();
-		EnterRule("thetaJoins", 14);
-		TraceIn("thetaJoins", 14);
-		try { DebugEnterRule(GrammarFileName, "thetaJoins");
-		DebugLocation(120, 1);
-		try
-		{
-			// SqlGenerator.g:121:2: ( ^( THETA_JOINS conditionList ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:121:4: ^( THETA_JOINS conditionList )
-			{
-			DebugLocation(121, 4);
-			DebugLocation(121, 6);
-			Match(input,THETA_JOINS,Follow._THETA_JOINS_in_thetaJoins548); if (state.failed) return;
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(121, 18);
-			PushFollow(Follow._conditionList_in_thetaJoins550);
-			conditionList();
-			PopFollow();
-			if (state.failed) return;
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("thetaJoins", 14);
-			LeaveRule("thetaJoins", 14);
-			LeaveRule_thetaJoins();
-		}
-		DebugLocation(122, 1);
-		} finally { DebugExitRule(GrammarFileName, "thetaJoins"); }
-		return;
-
-	}
-	// $ANTLR end "thetaJoins"
-
-	partial void EnterRule_conditionList();
-	partial void LeaveRule_conditionList();
-	// $ANTLR start "conditionList"
-	// SqlGenerator.g:124:1: conditionList : sqlToken ( conditionList )? ;
-	[GrammarRule("conditionList")]
-	private void conditionList()
-	{
-		EnterRule_conditionList();
-		EnterRule("conditionList", 15);
-		TraceIn("conditionList", 15);
-		try { DebugEnterRule(GrammarFileName, "conditionList");
-		DebugLocation(124, 1);
-		try
-		{
-			// SqlGenerator.g:125:2: ( sqlToken ( conditionList )? )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:125:4: sqlToken ( conditionList )?
-			{
-			DebugLocation(125, 4);
-			PushFollow(Follow._sqlToken_in_conditionList563);
-			sqlToken();
-			PopFollow();
-			if (state.failed) return;
-			DebugLocation(125, 13);
-			// SqlGenerator.g:125:13: ( conditionList )?
-			int alt20=2;
-			try { DebugEnterSubRule(20);
-			try { DebugEnterDecision(20, false);
-			int LA20_1 = input.LA(1);
-
-			if ((LA20_1==SQL_TOKEN))
-			{
-				alt20 = 1;
-			}
-			} finally { DebugExitDecision(20); }
-			switch (alt20)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:125:15: conditionList
-				{
-				DebugLocation(125, 15);
-				if (state.backtracking == 0)
-				{
-					 Out(" and "); 
-				}
-				DebugLocation(125, 33);
-				PushFollow(Follow._conditionList_in_conditionList569);
-				conditionList();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(20); }
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("conditionList", 15);
-			LeaveRule("conditionList", 15);
-			LeaveRule_conditionList();
-		}
-		DebugLocation(126, 1);
-		} finally { DebugExitRule(GrammarFileName, "conditionList"); }
-		return;
-
-	}
-	// $ANTLR end "conditionList"
-
-	partial void EnterRule_selectClause();
-	partial void LeaveRule_selectClause();
-	// $ANTLR start "selectClause"
-	// SqlGenerator.g:128:1: selectClause : ^( SELECT_CLAUSE ( distinctOrAll )? ( selectColumn )+ ) ;
-	[GrammarRule("selectClause")]
-	private void selectClause()
-	{
-		EnterRule_selectClause();
-		EnterRule("selectClause", 16);
-		TraceIn("selectClause", 16);
-		try { DebugEnterRule(GrammarFileName, "selectClause");
-		DebugLocation(128, 1);
-		try
-		{
-			// SqlGenerator.g:129:2: ( ^( SELECT_CLAUSE ( distinctOrAll )? ( selectColumn )+ ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:129:4: ^( SELECT_CLAUSE ( distinctOrAll )? ( selectColumn )+ )
-			{
-			DebugLocation(129, 4);
-			DebugLocation(129, 6);
-			Match(input,SELECT_CLAUSE,Follow._SELECT_CLAUSE_in_selectClause584); if (state.failed) return;
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(129, 20);
-			// SqlGenerator.g:129:20: ( distinctOrAll )?
-			int alt21=2;
-			try { DebugEnterSubRule(21);
-			try { DebugEnterDecision(21, false);
-			int LA21_1 = input.LA(1);
-
-			if ((LA21_1==ALL||LA21_1==DISTINCT))
-			{
-				alt21 = 1;
-			}
-			} finally { DebugExitDecision(21); }
-			switch (alt21)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:129:21: distinctOrAll
-				{
-				DebugLocation(129, 21);
-				PushFollow(Follow._distinctOrAll_in_selectClause587);
-				distinctOrAll();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(21); }
-
-			DebugLocation(129, 37);
-			// SqlGenerator.g:129:37: ( selectColumn )+
-			int cnt22=0;
-			try { DebugEnterSubRule(22);
-			while (true)
-			{
-				int alt22=2;
-				try { DebugEnterDecision(22, false);
-				int LA22_1 = input.LA(1);
-
-				if ((LA22_1==AGGREGATE||LA22_1==BAND||(LA22_1>=BNOT && LA22_1<=BOR)||(LA22_1>=BXOR && LA22_1<=CASE2)||(LA22_1>=CONSTANT && LA22_1<=COUNT)||(LA22_1>=DIV && LA22_1<=DOT)||LA22_1==FALSE||LA22_1==IDENT||LA22_1==JAVA_CONSTANT||LA22_1==METHOD_CALL||LA22_1==MINUS||(LA22_1>=NUM_DECIMAL && LA22_1<=NUM_LONG)||(LA22_1>=PARAM && LA22_1<=PLUS)||LA22_1==QUOTED_String||LA22_1==SELECT||LA22_1==STAR||(LA22_1>=TRUE && LA22_1<=UNARY_MINUS)||LA22_1==ALIAS_REF||LA22_1==NAMED_PARAM||(LA22_1>=SELECT_EXPR && LA22_1<=SQL_TOKEN)))
-				{
-					alt22 = 1;
-				}
-
-
-				} finally { DebugExitDecision(22); }
-				switch (alt22)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// SqlGenerator.g:129:39: selectColumn
-					{
-					DebugLocation(129, 39);
-					PushFollow(Follow._selectColumn_in_selectClause593);
-					selectColumn();
-					PopFollow();
-					if (state.failed) return;
-
-					}
-					break;
-
-				default:
-					if (cnt22 >= 1)
-						goto loop22;
-
-					if (state.backtracking>0) {state.failed=true; return;}
-					EarlyExitException eee22 = new EarlyExitException( 22, input );
-					DebugRecognitionException(eee22);
-					throw eee22;
-				}
-				cnt22++;
-			}
-			loop22:
-				;
-
-			} finally { DebugExitSubRule(22); }
-
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("selectClause", 16);
-			LeaveRule("selectClause", 16);
-			LeaveRule_selectClause();
-		}
-		DebugLocation(130, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectClause"); }
-		return;
-
-	}
-	// $ANTLR end "selectClause"
-
-	partial void EnterRule_selectColumn();
-	partial void LeaveRule_selectColumn();
-	// $ANTLR start "selectColumn"
-	// SqlGenerator.g:132:1: selectColumn : p= selectExpr (sc= SELECT_COLUMNS )? ;
-	[GrammarRule("selectColumn")]
-	private void selectColumn()
-	{
-		EnterRule_selectColumn();
-		EnterRule("selectColumn", 17);
-		TraceIn("selectColumn", 17);
-		IASTNode sc = default(IASTNode);
-		TreeRuleReturnScope<IASTNode> p = default(TreeRuleReturnScope<IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "selectColumn");
-		DebugLocation(132, 1);
-		try
-		{
-			// SqlGenerator.g:133:2: (p= selectExpr (sc= SELECT_COLUMNS )? )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:133:4: p= selectExpr (sc= SELECT_COLUMNS )?
-			{
-			DebugLocation(133, 5);
-			PushFollow(Follow._selectExpr_in_selectColumn611);
-			p=selectExpr();
-			PopFollow();
-			if (state.failed) return;
-			DebugLocation(133, 17);
-			// SqlGenerator.g:133:17: (sc= SELECT_COLUMNS )?
-			int alt23=2;
-			try { DebugEnterSubRule(23);
-			try { DebugEnterDecision(23, false);
-			int LA23_1 = input.LA(1);
-
-			if ((LA23_1==SELECT_COLUMNS))
-			{
-				alt23 = 1;
-			}
-			} finally { DebugExitDecision(23); }
-			switch (alt23)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:133:18: sc= SELECT_COLUMNS
-				{
-				DebugLocation(133, 20);
-				sc=(IASTNode)Match(input,SELECT_COLUMNS,Follow._SELECT_COLUMNS_in_selectColumn616); if (state.failed) return;
-				DebugLocation(133, 36);
-				if (state.backtracking == 0)
-				{
-					 Out(sc); 
-				}
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(23); }
-
-			DebugLocation(133, 53);
-			if (state.backtracking == 0)
-			{
-				 Separator( (sc != null) ? sc : (p!=null?((IASTNode)p.Start):default(IASTNode)) ,", "); 
-			}
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("selectColumn", 17);
-			LeaveRule("selectColumn", 17);
-			LeaveRule_selectColumn();
-		}
-		DebugLocation(134, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectColumn"); }
-		return;
-
-	}
-	// $ANTLR end "selectColumn"
-
-	partial void EnterRule_selectExpr();
-	partial void LeaveRule_selectExpr();
-	// $ANTLR start "selectExpr"
-	// SqlGenerator.g:136:1: selectExpr : (e= selectAtom | count | ^( CONSTRUCTOR ( DOT | IDENT ) ( selectColumn )+ ) | methodCall | aggregate |c= constant | arithmeticExpr | parameter | selectStatement );
-	[GrammarRule("selectExpr")]
-	private TreeRuleReturnScope<IASTNode> selectExpr()
-	{
-		EnterRule_selectExpr();
-		EnterRule("selectExpr", 18);
-		TraceIn("selectExpr", 18);
-		TreeRuleReturnScope<IASTNode> retval = new TreeRuleReturnScope<IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		TreeRuleReturnScope<IASTNode> e = default(TreeRuleReturnScope<IASTNode>);
-		TreeRuleReturnScope<IASTNode> c = default(TreeRuleReturnScope<IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "selectExpr");
-		DebugLocation(136, 1);
-		try
-		{
-			// SqlGenerator.g:137:2: (e= selectAtom | count | ^( CONSTRUCTOR ( DOT | IDENT ) ( selectColumn )+ ) | methodCall | aggregate |c= constant | arithmeticExpr | parameter | selectStatement )
-			int alt25=9;
-			try { DebugEnterDecision(25, false);
-			switch (input.LA(1))
-			{
-			case DOT:
-			case ALIAS_REF:
-			case SELECT_EXPR:
-			case SQL_TOKEN:
-				{
-				alt25 = 1;
-				}
-				break;
-			case COUNT:
-				{
-				alt25 = 2;
-				}
-				break;
-			case CONSTRUCTOR:
-				{
-				alt25 = 3;
-				}
-				break;
-			case METHOD_CALL:
-				{
-				alt25 = 4;
-				}
-				break;
-			case AGGREGATE:
-				{
-				alt25 = 5;
-				}
-				break;
-			case CONSTANT:
-			case FALSE:
-			case IDENT:
-			case JAVA_CONSTANT:
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case QUOTED_String:
-			case TRUE:
-				{
-				alt25 = 6;
-				}
-				break;
-			case BAND:
-			case BNOT:
-			case BOR:
-			case BXOR:
-			case CASE:
-			case CASE2:
-			case DIV:
-			case MINUS:
-			case PLUS:
-			case STAR:
-			case UNARY_MINUS:
-				{
-				alt25 = 7;
-				}
-				break;
-			case PARAM:
-			case NAMED_PARAM:
-				{
-				alt25 = 8;
-				}
-				break;
-			case SELECT:
-				{
-				alt25 = 9;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return retval;}
-					NoViableAltException nvae = new NoViableAltException("", 25, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(25); }
-			switch (alt25)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:137:4: e= selectAtom
-				{
-				DebugLocation(137, 5);
-				PushFollow(Follow._selectAtom_in_selectExpr636);
-				e=selectAtom();
-				PopFollow();
-				if (state.failed) return retval;
-				DebugLocation(137, 17);
-				if (state.backtracking == 0)
-				{
-					 Out((e!=null?((IASTNode)e.Start):default(IASTNode))); 
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:138:4: count
-				{
-				DebugLocation(138, 4);
-				PushFollow(Follow._count_in_selectExpr643);
-				count();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:139:4: ^( CONSTRUCTOR ( DOT | IDENT ) ( selectColumn )+ )
-				{
-				DebugLocation(139, 4);
-				DebugLocation(139, 6);
-				Match(input,CONSTRUCTOR,Follow._CONSTRUCTOR_in_selectExpr649); if (state.failed) return retval;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return retval;
-				DebugLocation(139, 18);
-				if (input.LA(1)==DOT||input.LA(1)==IDENT)
-				{
-					input.Consume();
-					state.errorRecovery=false;state.failed=false;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return retval;}
-					MismatchedSetException mse = new MismatchedSetException(null,input);
-					DebugRecognitionException(mse);
-					throw mse;
-				}
-
-				DebugLocation(139, 32);
-				// SqlGenerator.g:139:32: ( selectColumn )+
-				int cnt24=0;
-				try { DebugEnterSubRule(24);
-				while (true)
-				{
-					int alt24=2;
-					try { DebugEnterDecision(24, false);
-					int LA24_1 = input.LA(1);
-
-					if ((LA24_1==AGGREGATE||LA24_1==BAND||(LA24_1>=BNOT && LA24_1<=BOR)||(LA24_1>=BXOR && LA24_1<=CASE2)||(LA24_1>=CONSTANT && LA24_1<=COUNT)||(LA24_1>=DIV && LA24_1<=DOT)||LA24_1==FALSE||LA24_1==IDENT||LA24_1==JAVA_CONSTANT||LA24_1==METHOD_CALL||LA24_1==MINUS||(LA24_1>=NUM_DECIMAL && LA24_1<=NUM_LONG)||(LA24_1>=PARAM && LA24_1<=PLUS)||LA24_1==QUOTED_String||LA24_1==SELECT||LA24_1==STAR||(LA24_1>=TRUE && LA24_1<=UNARY_MINUS)||LA24_1==ALIAS_REF||LA24_1==NAMED_PARAM||(LA24_1>=SELECT_EXPR && LA24_1<=SQL_TOKEN)))
-					{
-						alt24 = 1;
-					}
-
-
-					} finally { DebugExitDecision(24); }
-					switch (alt24)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// SqlGenerator.g:139:34: selectColumn
-						{
-						DebugLocation(139, 34);
-						PushFollow(Follow._selectColumn_in_selectExpr661);
-						selectColumn();
-						PopFollow();
-						if (state.failed) return retval;
-
-						}
-						break;
-
-					default:
-						if (cnt24 >= 1)
-							goto loop24;
-
-						if (state.backtracking>0) {state.failed=true; return retval;}
-						EarlyExitException eee24 = new EarlyExitException( 24, input );
-						DebugRecognitionException(eee24);
-						throw eee24;
-					}
-					cnt24++;
-				}
-				loop24:
-					;
-
-				} finally { DebugExitSubRule(24); }
-
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return retval;
-
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// SqlGenerator.g:140:4: methodCall
-				{
-				DebugLocation(140, 4);
-				PushFollow(Follow._methodCall_in_selectExpr671);
-				methodCall();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// SqlGenerator.g:141:4: aggregate
-				{
-				DebugLocation(141, 4);
-				PushFollow(Follow._aggregate_in_selectExpr676);
-				aggregate();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 6:
-				DebugEnterAlt(6);
-				// SqlGenerator.g:142:4: c= constant
-				{
-				DebugLocation(142, 5);
-				PushFollow(Follow._constant_in_selectExpr683);
-				c=constant();
-				PopFollow();
-				if (state.failed) return retval;
-				DebugLocation(142, 15);
-				if (state.backtracking == 0)
-				{
-					 Out((c!=null?((IASTNode)c.Start):default(IASTNode))); 
-				}
-
-				}
-				break;
-			case 7:
-				DebugEnterAlt(7);
-				// SqlGenerator.g:143:4: arithmeticExpr
-				{
-				DebugLocation(143, 4);
-				PushFollow(Follow._arithmeticExpr_in_selectExpr690);
-				arithmeticExpr();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 8:
-				DebugEnterAlt(8);
-				// SqlGenerator.g:144:4: parameter
-				{
-				DebugLocation(144, 4);
-				PushFollow(Follow._parameter_in_selectExpr695);
-				parameter();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 9:
-				DebugEnterAlt(9);
-				// SqlGenerator.g:147:4: selectStatement
-				{
-				DebugLocation(147, 4);
-				if (state.backtracking == 0)
-				{
-					 Out("("); 
-				}
-				DebugLocation(147, 18);
-				PushFollow(Follow._selectStatement_in_selectExpr704);
-				selectStatement();
-				PopFollow();
-				if (state.failed) return retval;
-				DebugLocation(147, 34);
-				if (state.backtracking == 0)
-				{
-					 Out(")"); 
-				}
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("selectExpr", 18);
-			LeaveRule("selectExpr", 18);
-			LeaveRule_selectExpr();
-		}
-		DebugLocation(148, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "selectExpr"
-
-	partial void EnterRule_count();
-	partial void LeaveRule_count();
-	// $ANTLR start "count"
-	// SqlGenerator.g:150:1: count : ^( COUNT ( distinctOrAll )? countExpr ) ;
-	[GrammarRule("count")]
-	private void count()
-	{
-		EnterRule_count();
-		EnterRule("count", 19);
-		TraceIn("count", 19);
-		try { DebugEnterRule(GrammarFileName, "count");
-		DebugLocation(150, 1);
-		try
-		{
-			// SqlGenerator.g:151:2: ( ^( COUNT ( distinctOrAll )? countExpr ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:151:4: ^( COUNT ( distinctOrAll )? countExpr )
-			{
-			DebugLocation(151, 4);
-			DebugLocation(151, 6);
-			Match(input,COUNT,Follow._COUNT_in_count718); if (state.failed) return;
-
-			DebugLocation(151, 12);
-			if (state.backtracking == 0)
-			{
-				 Out("count("); 
-			}
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(151, 32);
-			// SqlGenerator.g:151:32: ( distinctOrAll )?
-			int alt26=2;
-			try { DebugEnterSubRule(26);
-			try { DebugEnterDecision(26, false);
-			int LA26_1 = input.LA(1);
-
-			if ((LA26_1==ALL||LA26_1==DISTINCT))
-			{
-				alt26 = 1;
-			}
-			} finally { DebugExitDecision(26); }
-			switch (alt26)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:151:34: distinctOrAll
-				{
-				DebugLocation(151, 34);
-				PushFollow(Follow._distinctOrAll_in_count725);
-				distinctOrAll();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(26); }
-
-			DebugLocation(151, 52);
-			PushFollow(Follow._countExpr_in_count731);
-			countExpr();
-			PopFollow();
-			if (state.failed) return;
-			DebugLocation(151, 62);
-			if (state.backtracking == 0)
-			{
-				 Out(")"); 
-			}
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("count", 19);
-			LeaveRule("count", 19);
-			LeaveRule_count();
-		}
-		DebugLocation(152, 1);
-		} finally { DebugExitRule(GrammarFileName, "count"); }
-		return;
-
-	}
-	// $ANTLR end "count"
-
-	partial void EnterRule_distinctOrAll();
-	partial void LeaveRule_distinctOrAll();
-	// $ANTLR start "distinctOrAll"
-	// SqlGenerator.g:154:1: distinctOrAll : ( DISTINCT | ^( ALL ( . )* ) );
-	[GrammarRule("distinctOrAll")]
-	private void distinctOrAll()
-	{
-		EnterRule_distinctOrAll();
-		EnterRule("distinctOrAll", 20);
-		TraceIn("distinctOrAll", 20);
-		try { DebugEnterRule(GrammarFileName, "distinctOrAll");
-		DebugLocation(154, 1);
-		try
-		{
-			// SqlGenerator.g:155:2: ( DISTINCT | ^( ALL ( . )* ) )
-			int alt28=2;
-			try { DebugEnterDecision(28, false);
-			int LA28_1 = input.LA(1);
-
-			if ((LA28_1==DISTINCT))
-			{
-				alt28 = 1;
-			}
-			else if ((LA28_1==ALL))
-			{
-				alt28 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 28, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(28); }
-			switch (alt28)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:155:4: DISTINCT
-				{
-				DebugLocation(155, 4);
-				Match(input,DISTINCT,Follow._DISTINCT_in_distinctOrAll746); if (state.failed) return;
-				DebugLocation(155, 13);
-				if (state.backtracking == 0)
-				{
-					 Out("distinct "); 
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:156:4: ^( ALL ( . )* )
-				{
-				DebugLocation(156, 4);
-				DebugLocation(156, 6);
-				Match(input,ALL,Follow._ALL_in_distinctOrAll754); if (state.failed) return;
-
-				if (input.LA(1) == TokenTypes.Down)
-				{
-					Match(input, TokenTypes.Down, null); if (state.failed) return;
-					DebugLocation(156, 10);
-					// SqlGenerator.g:156:10: ( . )*
-					try { DebugEnterSubRule(27);
-					while (true)
-					{
-						int alt27=2;
-						try { DebugEnterDecision(27, false);
-						int LA27_1 = input.LA(1);
-
-						if (((LA27_1>=AGGREGATE && LA27_1<=THETA_JOINS)))
-						{
-							alt27 = 1;
-						}
-						else if ((LA27_1==UP))
-						{
-							alt27 = 2;
-						}
-
-
-						} finally { DebugExitDecision(27); }
-						switch ( alt27 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// SqlGenerator.g:156:10: .
-							{
-							DebugLocation(156, 10);
-							MatchAny(input); if (state.failed) return;
-
-							}
-							break;
-
-						default:
-							goto loop27;
-						}
-					}
-
-					loop27:
-						;
-
-					} finally { DebugExitSubRule(27); }
-
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return;
-				}
-
-				DebugLocation(156, 14);
-				if (state.backtracking == 0)
-				{
-					 Out("all "); 
-				}
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("distinctOrAll", 20);
-			LeaveRule("distinctOrAll", 20);
-			LeaveRule_distinctOrAll();
-		}
-		DebugLocation(157, 1);
-		} finally { DebugExitRule(GrammarFileName, "distinctOrAll"); }
-		return;
-
-	}
-	// $ANTLR end "distinctOrAll"
-
-	partial void EnterRule_countExpr();
-	partial void LeaveRule_countExpr();
-	// $ANTLR start "countExpr"
-	// SqlGenerator.g:159:1: countExpr : ( ROW_STAR | simpleExpr );
-	[GrammarRule("countExpr")]
-	private void countExpr()
-	{
-		EnterRule_countExpr();
-		EnterRule("countExpr", 21);
-		TraceIn("countExpr", 21);
-		try { DebugEnterRule(GrammarFileName, "countExpr");
-		DebugLocation(159, 1);
-		try
-		{
-			// SqlGenerator.g:161:2: ( ROW_STAR | simpleExpr )
-			int alt29=2;
-			try { DebugEnterDecision(29, false);
-			int LA29_1 = input.LA(1);
-
-			if ((LA29_1==ROW_STAR))
-			{
-				alt29 = 1;
-			}
-			else if ((LA29_1==AGGREGATE||LA29_1==BAND||(LA29_1>=BNOT && LA29_1<=BOR)||(LA29_1>=BXOR && LA29_1<=CASE2)||LA29_1==CONSTANT||LA29_1==COUNT||(LA29_1>=DIV && LA29_1<=DOT)||LA29_1==FALSE||LA29_1==IDENT||LA29_1==INDEX_OP||LA29_1==JAVA_CONSTANT||LA29_1==METHOD_CALL||LA29_1==MINUS||(LA29_1>=NULL && LA29_1<=NUM_LONG)||(LA29_1>=PARAM && LA29_1<=PLUS)||LA29_1==QUOTED_String||LA29_1==STAR||(LA29_1>=TRUE && LA29_1<=UNARY_MINUS)||LA29_1==ALIAS_REF||LA29_1==NAMED_PARAM||LA29_1==RESULT_VARIABLE_REF||LA29_1==SQL_TOKEN))
-			{
-				alt29 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 29, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(29); }
-			switch (alt29)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:161:4: ROW_STAR
-				{
-				DebugLocation(161, 4);
-				Match(input,ROW_STAR,Follow._ROW_STAR_in_countExpr773); if (state.failed) return;
-				DebugLocation(161, 13);
-				if (state.backtracking == 0)
-				{
-					 Out("*"); 
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:162:4: simpleExpr
-				{
-				DebugLocation(162, 4);
-				PushFollow(Follow._simpleExpr_in_countExpr780);
-				simpleExpr();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("countExpr", 21);
-			LeaveRule("countExpr", 21);
-			LeaveRule_countExpr();
-		}
-		DebugLocation(163, 1);
-		} finally { DebugExitRule(GrammarFileName, "countExpr"); }
-		return;
-
-	}
-	// $ANTLR end "countExpr"
-
-	partial void EnterRule_selectAtom();
-	partial void LeaveRule_selectAtom();
-	// $ANTLR start "selectAtom"
-	// SqlGenerator.g:165:1: selectAtom : ( ^( DOT ( . )* ) | ^( SQL_TOKEN ( . )* ) | ^( ALIAS_REF ( . )* ) | ^( SELECT_EXPR ( . )* ) );
-	[GrammarRule("selectAtom")]
-	private TreeRuleReturnScope<IASTNode> selectAtom()
-	{
-		EnterRule_selectAtom();
-		EnterRule("selectAtom", 22);
-		TraceIn("selectAtom", 22);
-		TreeRuleReturnScope<IASTNode> retval = new TreeRuleReturnScope<IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		try { DebugEnterRule(GrammarFileName, "selectAtom");
-		DebugLocation(165, 1);
-		try
-		{
-			// SqlGenerator.g:166:2: ( ^( DOT ( . )* ) | ^( SQL_TOKEN ( . )* ) | ^( ALIAS_REF ( . )* ) | ^( SELECT_EXPR ( . )* ) )
-			int alt34=4;
-			try { DebugEnterDecision(34, false);
-			switch (input.LA(1))
-			{
-			case DOT:
-				{
-				alt34 = 1;
-				}
-				break;
-			case SQL_TOKEN:
-				{
-				alt34 = 2;
-				}
-				break;
-			case ALIAS_REF:
-				{
-				alt34 = 3;
-				}
-				break;
-			case SELECT_EXPR:
-				{
-				alt34 = 4;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return retval;}
-					NoViableAltException nvae = new NoViableAltException("", 34, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(34); }
-			switch (alt34)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:166:4: ^( DOT ( . )* )
-				{
-				DebugLocation(166, 4);
-				DebugLocation(166, 6);
-				Match(input,DOT,Follow._DOT_in_selectAtom792); if (state.failed) return retval;
-
-				if (input.LA(1) == TokenTypes.Down)
-				{
-					Match(input, TokenTypes.Down, null); if (state.failed) return retval;
-					DebugLocation(166, 10);
-					// SqlGenerator.g:166:10: ( . )*
-					try { DebugEnterSubRule(30);
-					while (true)
-					{
-						int alt30=2;
-						try { DebugEnterDecision(30, false);
-						int LA30_1 = input.LA(1);
-
-						if (((LA30_1>=AGGREGATE && LA30_1<=THETA_JOINS)))
-						{
-							alt30 = 1;
-						}
-						else if ((LA30_1==UP))
-						{
-							alt30 = 2;
-						}
-
-
-						} finally { DebugExitDecision(30); }
-						switch ( alt30 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// SqlGenerator.g:166:10: .
-							{
-							DebugLocation(166, 10);
-							MatchAny(input); if (state.failed) return retval;
-
-							}
-							break;
-
-						default:
-							goto loop30;
-						}
-					}
-
-					loop30:
-						;
-
-					} finally { DebugExitSubRule(30); }
-
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return retval;
-				}
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:167:4: ^( SQL_TOKEN ( . )* )
-				{
-				DebugLocation(167, 4);
-				DebugLocation(167, 6);
-				Match(input,SQL_TOKEN,Follow._SQL_TOKEN_in_selectAtom802); if (state.failed) return retval;
-
-				if (input.LA(1) == TokenTypes.Down)
-				{
-					Match(input, TokenTypes.Down, null); if (state.failed) return retval;
-					DebugLocation(167, 16);
-					// SqlGenerator.g:167:16: ( . )*
-					try { DebugEnterSubRule(31);
-					while (true)
-					{
-						int alt31=2;
-						try { DebugEnterDecision(31, false);
-						int LA31_1 = input.LA(1);
-
-						if (((LA31_1>=AGGREGATE && LA31_1<=THETA_JOINS)))
-						{
-							alt31 = 1;
-						}
-						else if ((LA31_1==UP))
-						{
-							alt31 = 2;
-						}
-
-
-						} finally { DebugExitDecision(31); }
-						switch ( alt31 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// SqlGenerator.g:167:16: .
-							{
-							DebugLocation(167, 16);
-							MatchAny(input); if (state.failed) return retval;
-
-							}
-							break;
-
-						default:
-							goto loop31;
-						}
-					}
-
-					loop31:
-						;
-
-					} finally { DebugExitSubRule(31); }
-
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return retval;
-				}
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:168:4: ^( ALIAS_REF ( . )* )
-				{
-				DebugLocation(168, 4);
-				DebugLocation(168, 6);
-				Match(input,ALIAS_REF,Follow._ALIAS_REF_in_selectAtom812); if (state.failed) return retval;
-
-				if (input.LA(1) == TokenTypes.Down)
-				{
-					Match(input, TokenTypes.Down, null); if (state.failed) return retval;
-					DebugLocation(168, 16);
-					// SqlGenerator.g:168:16: ( . )*
-					try { DebugEnterSubRule(32);
-					while (true)
-					{
-						int alt32=2;
-						try { DebugEnterDecision(32, false);
-						int LA32_1 = input.LA(1);
-
-						if (((LA32_1>=AGGREGATE && LA32_1<=THETA_JOINS)))
-						{
-							alt32 = 1;
-						}
-						else if ((LA32_1==UP))
-						{
-							alt32 = 2;
-						}
-
-
-						} finally { DebugExitDecision(32); }
-						switch ( alt32 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// SqlGenerator.g:168:16: .
-							{
-							DebugLocation(168, 16);
-							MatchAny(input); if (state.failed) return retval;
-
-							}
-							break;
-
-						default:
-							goto loop32;
-						}
-					}
-
-					loop32:
-						;
-
-					} finally { DebugExitSubRule(32); }
-
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return retval;
-				}
-
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// SqlGenerator.g:169:4: ^( SELECT_EXPR ( . )* )
-				{
-				DebugLocation(169, 4);
-				DebugLocation(169, 6);
-				Match(input,SELECT_EXPR,Follow._SELECT_EXPR_in_selectAtom822); if (state.failed) return retval;
-
-				if (input.LA(1) == TokenTypes.Down)
-				{
-					Match(input, TokenTypes.Down, null); if (state.failed) return retval;
-					DebugLocation(169, 18);
-					// SqlGenerator.g:169:18: ( . )*
-					try { DebugEnterSubRule(33);
-					while (true)
-					{
-						int alt33=2;
-						try { DebugEnterDecision(33, false);
-						int LA33_1 = input.LA(1);
-
-						if (((LA33_1>=AGGREGATE && LA33_1<=THETA_JOINS)))
-						{
-							alt33 = 1;
-						}
-						else if ((LA33_1==UP))
-						{
-							alt33 = 2;
-						}
-
-
-						} finally { DebugExitDecision(33); }
-						switch ( alt33 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// SqlGenerator.g:169:18: .
-							{
-							DebugLocation(169, 18);
-							MatchAny(input); if (state.failed) return retval;
-
-							}
-							break;
-
-						default:
-							goto loop33;
-						}
-					}
-
-					loop33:
-						;
-
-					} finally { DebugExitSubRule(33); }
-
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return retval;
-				}
-
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("selectAtom", 22);
-			LeaveRule("selectAtom", 22);
-			LeaveRule_selectAtom();
-		}
-		DebugLocation(170, 1);
-		} finally { DebugExitRule(GrammarFileName, "selectAtom"); }
-		return retval;
-
-	}
-	// $ANTLR end "selectAtom"
-
-	partial void EnterRule_from();
-	partial void LeaveRule_from();
-	// $ANTLR start "from"
-	// SqlGenerator.g:177:1: from : ^(f= FROM ( fromTable )* ) ;
-	[GrammarRule("from")]
-	private void from()
-	{
-		EnterRule_from();
-		EnterRule("from", 23);
-		TraceIn("from", 23);
-		IASTNode f = default(IASTNode);
-
-		try { DebugEnterRule(GrammarFileName, "from");
-		DebugLocation(177, 1);
-		try
-		{
-			// SqlGenerator.g:178:2: ( ^(f= FROM ( fromTable )* ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:178:4: ^(f= FROM ( fromTable )* )
-			{
-			DebugLocation(178, 4);
-			DebugLocation(178, 7);
-			f=(IASTNode)Match(input,FROM,Follow._FROM_in_from845); if (state.failed) return;
-
-			DebugLocation(178, 13);
-			if (state.backtracking == 0)
-			{
-				 Out(" from "); 
-			}
-
-			if (input.LA(1) == TokenTypes.Down)
-			{
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(179, 3);
-				// SqlGenerator.g:179:3: ( fromTable )*
-				try { DebugEnterSubRule(35);
-				while (true)
-				{
-					int alt35=2;
-					try { DebugEnterDecision(35, false);
-					int LA35_1 = input.LA(1);
-
-					if ((LA35_1==FROM_FRAGMENT||LA35_1==JOIN_FRAGMENT))
-					{
-						alt35 = 1;
-					}
-
-
-					} finally { DebugExitDecision(35); }
-					switch ( alt35 )
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// SqlGenerator.g:179:4: fromTable
-						{
-						DebugLocation(179, 4);
-						PushFollow(Follow._fromTable_in_from852);
-						fromTable();
-						PopFollow();
-						if (state.failed) return;
-
-						}
-						break;
-
-					default:
-						goto loop35;
-					}
-				}
-
-				loop35:
-					;
-
-				} finally { DebugExitSubRule(35); }
-
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-			}
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("from", 23);
-			LeaveRule("from", 23);
-			LeaveRule_from();
-		}
-		DebugLocation(180, 1);
-		} finally { DebugExitRule(GrammarFileName, "from"); }
-		return;
-
-	}
-	// $ANTLR end "from"
-
-	partial void EnterRule_fromTable();
-	partial void LeaveRule_fromTable();
-	// $ANTLR start "fromTable"
-	// SqlGenerator.g:182:1: fromTable : ( ^(a= FROM_FRAGMENT ( tableJoin[ a ] )* ) | ^(a= JOIN_FRAGMENT ( tableJoin[ a ] )* ) );
-	[GrammarRule("fromTable")]
-	private void fromTable()
-	{
-		EnterRule_fromTable();
-		EnterRule("fromTable", 24);
-		TraceIn("fromTable", 24);
-		IASTNode a = default(IASTNode);
-
-		try { DebugEnterRule(GrammarFileName, "fromTable");
-		DebugLocation(182, 1);
-		try
-		{
-			// SqlGenerator.g:187:2: ( ^(a= FROM_FRAGMENT ( tableJoin[ a ] )* ) | ^(a= JOIN_FRAGMENT ( tableJoin[ a ] )* ) )
-			int alt38=2;
-			try { DebugEnterDecision(38, false);
-			int LA38_1 = input.LA(1);
-
-			if ((LA38_1==FROM_FRAGMENT))
-			{
-				alt38 = 1;
-			}
-			else if ((LA38_1==JOIN_FRAGMENT))
-			{
-				alt38 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 38, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(38); }
-			switch (alt38)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:187:4: ^(a= FROM_FRAGMENT ( tableJoin[ a ] )* )
-				{
-				DebugLocation(187, 4);
-				DebugLocation(187, 8);
-				a=(IASTNode)Match(input,FROM_FRAGMENT,Follow._FROM_FRAGMENT_in_fromTable878); if (state.failed) return;
-
-				DebugLocation(187, 24);
-				if (state.backtracking == 0)
-				{
-					 Out(a); 
-				}
-
-				if (input.LA(1) == TokenTypes.Down)
-				{
-					Match(input, TokenTypes.Down, null); if (state.failed) return;
-					DebugLocation(187, 36);
-					// SqlGenerator.g:187:36: ( tableJoin[ a ] )*
-					try { DebugEnterSubRule(36);
-					while (true)
-					{
-						int alt36=2;
-						try { DebugEnterDecision(36, false);
-						int LA36_1 = input.LA(1);
-
-						if ((LA36_1==FROM_FRAGMENT||LA36_1==JOIN_FRAGMENT))
-						{
-							alt36 = 1;
-						}
-
-
-						} finally { DebugExitDecision(36); }
-						switch ( alt36 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// SqlGenerator.g:187:37: tableJoin[ a ]
-							{
-							DebugLocation(187, 37);
-							PushFollow(Follow._tableJoin_in_fromTable884);
-							tableJoin(a);
-							PopFollow();
-							if (state.failed) return;
-
-							}
-							break;
-
-						default:
-							goto loop36;
-						}
-					}
-
-					loop36:
-						;
-
-					} finally { DebugExitSubRule(36); }
-
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return;
-				}
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:188:4: ^(a= JOIN_FRAGMENT ( tableJoin[ a ] )* )
-				{
-				DebugLocation(188, 4);
-				DebugLocation(188, 8);
-				a=(IASTNode)Match(input,JOIN_FRAGMENT,Follow._JOIN_FRAGMENT_in_fromTable899); if (state.failed) return;
-
-				DebugLocation(188, 24);
-				if (state.backtracking == 0)
-				{
-					 Out(a); 
-				}
-
-				if (input.LA(1) == TokenTypes.Down)
-				{
-					Match(input, TokenTypes.Down, null); if (state.failed) return;
-					DebugLocation(188, 36);
-					// SqlGenerator.g:188:36: ( tableJoin[ a ] )*
-					try { DebugEnterSubRule(37);
-					while (true)
-					{
-						int alt37=2;
-						try { DebugEnterDecision(37, false);
-						int LA37_1 = input.LA(1);
-
-						if ((LA37_1==FROM_FRAGMENT||LA37_1==JOIN_FRAGMENT))
-						{
-							alt37 = 1;
-						}
-
-
-						} finally { DebugExitDecision(37); }
-						switch ( alt37 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// SqlGenerator.g:188:37: tableJoin[ a ]
-							{
-							DebugLocation(188, 37);
-							PushFollow(Follow._tableJoin_in_fromTable905);
-							tableJoin(a);
-							PopFollow();
-							if (state.failed) return;
-
-							}
-							break;
-
-						default:
-							goto loop37;
-						}
-					}
-
-					loop37:
-						;
-
-					} finally { DebugExitSubRule(37); }
-
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return;
-				}
-
-
-				}
-				break;
-
-			}
-			if (state.backtracking == 0)
-			{
-
-				   FromFragmentSeparator(a);
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("fromTable", 24);
-			LeaveRule("fromTable", 24);
-			LeaveRule_fromTable();
-		}
-		DebugLocation(189, 1);
-		} finally { DebugExitRule(GrammarFileName, "fromTable"); }
-		return;
-
-	}
-	// $ANTLR end "fromTable"
-
-	partial void EnterRule_tableJoin();
-	partial void LeaveRule_tableJoin();
-	// $ANTLR start "tableJoin"
-	// SqlGenerator.g:191:1: tableJoin[ IASTNode parent ] : ( ^(c= JOIN_FRAGMENT ( tableJoin[ c ] )* ) | ^(d= FROM_FRAGMENT ( tableJoin[ d ] )* ) );
-	[GrammarRule("tableJoin")]
-	private void tableJoin(IASTNode parent)
-	{
-		EnterRule_tableJoin();
-		EnterRule("tableJoin", 25);
-		TraceIn("tableJoin", 25);
-		IASTNode c = default(IASTNode);
-		IASTNode d = default(IASTNode);
-
-		try { DebugEnterRule(GrammarFileName, "tableJoin");
-		DebugLocation(191, 1);
-		try
-		{
-			// SqlGenerator.g:192:2: ( ^(c= JOIN_FRAGMENT ( tableJoin[ c ] )* ) | ^(d= FROM_FRAGMENT ( tableJoin[ d ] )* ) )
-			int alt41=2;
-			try { DebugEnterDecision(41, false);
-			int LA41_1 = input.LA(1);
-
-			if ((LA41_1==JOIN_FRAGMENT))
-			{
-				alt41 = 1;
-			}
-			else if ((LA41_1==FROM_FRAGMENT))
-			{
-				alt41 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 41, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(41); }
-			switch (alt41)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:192:4: ^(c= JOIN_FRAGMENT ( tableJoin[ c ] )* )
-				{
-				DebugLocation(192, 4);
-				DebugLocation(192, 8);
-				c=(IASTNode)Match(input,JOIN_FRAGMENT,Follow._JOIN_FRAGMENT_in_tableJoin928); if (state.failed) return;
-
-				DebugLocation(192, 23);
-				if (state.backtracking == 0)
-				{
-					 Out(" "); Out(c); 
-				}
-
-				if (input.LA(1) == TokenTypes.Down)
-				{
-					Match(input, TokenTypes.Down, null); if (state.failed) return;
-					DebugLocation(192, 46);
-					// SqlGenerator.g:192:46: ( tableJoin[ c ] )*
-					try { DebugEnterSubRule(39);
-					while (true)
-					{
-						int alt39=2;
-						try { DebugEnterDecision(39, false);
-						int LA39_1 = input.LA(1);
-
-						if ((LA39_1==FROM_FRAGMENT||LA39_1==JOIN_FRAGMENT))
-						{
-							alt39 = 1;
-						}
-
-
-						} finally { DebugExitDecision(39); }
-						switch ( alt39 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// SqlGenerator.g:192:47: tableJoin[ c ]
-							{
-							DebugLocation(192, 47);
-							PushFollow(Follow._tableJoin_in_tableJoin933);
-							tableJoin(c);
-							PopFollow();
-							if (state.failed) return;
-
-							}
-							break;
-
-						default:
-							goto loop39;
-						}
-					}
-
-					loop39:
-						;
-
-					} finally { DebugExitSubRule(39); }
-
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return;
-				}
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:193:4: ^(d= FROM_FRAGMENT ( tableJoin[ d ] )* )
-				{
-				DebugLocation(193, 4);
-				DebugLocation(193, 8);
-				d=(IASTNode)Match(input,FROM_FRAGMENT,Follow._FROM_FRAGMENT_in_tableJoin949); if (state.failed) return;
-
-				DebugLocation(193, 23);
-				if (state.backtracking == 0)
-				{
-					 NestedFromFragment(d,parent); 
-				}
-
-				if (input.LA(1) == TokenTypes.Down)
-				{
-					Match(input, TokenTypes.Down, null); if (state.failed) return;
-					DebugLocation(193, 58);
-					// SqlGenerator.g:193:58: ( tableJoin[ d ] )*
-					try { DebugEnterSubRule(40);
-					while (true)
-					{
-						int alt40=2;
-						try { DebugEnterDecision(40, false);
-						int LA40_1 = input.LA(1);
-
-						if ((LA40_1==FROM_FRAGMENT||LA40_1==JOIN_FRAGMENT))
-						{
-							alt40 = 1;
-						}
-
-
-						} finally { DebugExitDecision(40); }
-						switch ( alt40 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// SqlGenerator.g:193:59: tableJoin[ d ]
-							{
-							DebugLocation(193, 59);
-							PushFollow(Follow._tableJoin_in_tableJoin954);
-							tableJoin(d);
-							PopFollow();
-							if (state.failed) return;
-
-							}
-							break;
-
-						default:
-							goto loop40;
-						}
-					}
-
-					loop40:
-						;
-
-					} finally { DebugExitSubRule(40); }
-
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return;
-				}
-
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("tableJoin", 25);
-			LeaveRule("tableJoin", 25);
-			LeaveRule_tableJoin();
-		}
-		DebugLocation(194, 1);
-		} finally { DebugExitRule(GrammarFileName, "tableJoin"); }
-		return;
-
-	}
-	// $ANTLR end "tableJoin"
-
-	partial void EnterRule_booleanOp();
-	partial void LeaveRule_booleanOp();
-	// $ANTLR start "booleanOp"
-	// SqlGenerator.g:196:1: booleanOp[ bool parens ] : ( ^( AND booleanExpr[true] booleanExpr[true] ) | ^( OR booleanExpr[false] booleanExpr[false] ) | ^( NOT booleanExpr[false] ) );
-	[GrammarRule("booleanOp")]
-	private void booleanOp(bool parens)
-	{
-		EnterRule_booleanOp();
-		EnterRule("booleanOp", 26);
-		TraceIn("booleanOp", 26);
-		try { DebugEnterRule(GrammarFileName, "booleanOp");
-		DebugLocation(196, 1);
-		try
-		{
-			// SqlGenerator.g:197:2: ( ^( AND booleanExpr[true] booleanExpr[true] ) | ^( OR booleanExpr[false] booleanExpr[false] ) | ^( NOT booleanExpr[false] ) )
-			int alt42=3;
-			try { DebugEnterDecision(42, false);
-			switch (input.LA(1))
-			{
-			case AND:
-				{
-				alt42 = 1;
-				}
-				break;
-			case OR:
-				{
-				alt42 = 2;
-				}
-				break;
-			case NOT:
-				{
-				alt42 = 3;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 42, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(42); }
-			switch (alt42)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:197:4: ^( AND booleanExpr[true] booleanExpr[true] )
-				{
-				DebugLocation(197, 4);
-				DebugLocation(197, 6);
-				Match(input,AND,Follow._AND_in_booleanOp974); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(197, 10);
-				PushFollow(Follow._booleanExpr_in_booleanOp976);
-				booleanExpr(true);
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(197, 28);
-				if (state.backtracking == 0)
-				{
-					 Out(" and "); 
-				}
-				DebugLocation(197, 46);
-				PushFollow(Follow._booleanExpr_in_booleanOp981);
-				booleanExpr(true);
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:198:4: ^( OR booleanExpr[false] booleanExpr[false] )
-				{
-				DebugLocation(198, 4);
-				DebugLocation(198, 6);
-				Match(input,OR,Follow._OR_in_booleanOp989); if (state.failed) return;
-
-				DebugLocation(198, 9);
-				if (state.backtracking == 0)
-				{
-					 if (parens) Out("("); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(198, 35);
-				PushFollow(Follow._booleanExpr_in_booleanOp993);
-				booleanExpr(false);
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(198, 54);
-				if (state.backtracking == 0)
-				{
-					 Out(" or "); 
-				}
-				DebugLocation(198, 71);
-				PushFollow(Follow._booleanExpr_in_booleanOp998);
-				booleanExpr(false);
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(198, 90);
-				if (state.backtracking == 0)
-				{
-					 if (parens) Out(")"); 
-				}
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:199:4: ^( NOT booleanExpr[false] )
-				{
-				DebugLocation(199, 4);
-				DebugLocation(199, 6);
-				Match(input,NOT,Follow._NOT_in_booleanOp1008); if (state.failed) return;
-
-				DebugLocation(199, 10);
-				if (state.backtracking == 0)
-				{
-					 Out(" not ("); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(199, 29);
-				PushFollow(Follow._booleanExpr_in_booleanOp1012);
-				booleanExpr(false);
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(199, 48);
-				if (state.backtracking == 0)
-				{
-					 Out(")"); 
-				}
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("booleanOp", 26);
-			LeaveRule("booleanOp", 26);
-			LeaveRule_booleanOp();
-		}
-		DebugLocation(200, 1);
-		} finally { DebugExitRule(GrammarFileName, "booleanOp"); }
-		return;
-
-	}
-	// $ANTLR end "booleanOp"
-
-	partial void EnterRule_booleanExpr();
-	partial void LeaveRule_booleanExpr();
-	// $ANTLR start "booleanExpr"
-	// SqlGenerator.g:202:1: booleanExpr[ bool parens ] : ( booleanOp[ parens ] | comparisonExpr[ parens ] | methodCall |st= SQL_TOKEN );
-	[GrammarRule("booleanExpr")]
-	private void booleanExpr(bool parens)
-	{
-		EnterRule_booleanExpr();
-		EnterRule("booleanExpr", 27);
-		TraceIn("booleanExpr", 27);
-		IASTNode st = default(IASTNode);
-
-		try { DebugEnterRule(GrammarFileName, "booleanExpr");
-		DebugLocation(202, 1);
-		try
-		{
-			// SqlGenerator.g:203:2: ( booleanOp[ parens ] | comparisonExpr[ parens ] | methodCall |st= SQL_TOKEN )
-			int alt43=4;
-			try { DebugEnterDecision(43, false);
-			switch (input.LA(1))
-			{
-			case AND:
-			case NOT:
-			case OR:
-				{
-				alt43 = 1;
-				}
-				break;
-			case BETWEEN:
-			case EQ:
-			case EXISTS:
-			case GE:
-			case GT:
-			case IN:
-			case IS_NOT_NULL:
-			case IS_NULL:
-			case LE:
-			case LIKE:
-			case LT:
-			case NE:
-			case NOT_BETWEEN:
-			case NOT_IN:
-			case NOT_LIKE:
-				{
-				alt43 = 2;
-				}
-				break;
-			case METHOD_CALL:
-				{
-				alt43 = 3;
-				}
-				break;
-			case SQL_TOKEN:
-				{
-				alt43 = 4;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 43, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(43); }
-			switch (alt43)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:203:4: booleanOp[ parens ]
-				{
-				DebugLocation(203, 4);
-				PushFollow(Follow._booleanOp_in_booleanExpr1029);
-				booleanOp(parens);
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:204:4: comparisonExpr[ parens ]
-				{
-				DebugLocation(204, 4);
-				PushFollow(Follow._comparisonExpr_in_booleanExpr1036);
-				comparisonExpr(parens);
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:205:4: methodCall
-				{
-				DebugLocation(205, 4);
-				PushFollow(Follow._methodCall_in_booleanExpr1043);
-				methodCall();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// SqlGenerator.g:206:4: st= SQL_TOKEN
-				{
-				DebugLocation(206, 6);
-				st=(IASTNode)Match(input,SQL_TOKEN,Follow._SQL_TOKEN_in_booleanExpr1050); if (state.failed) return;
-				DebugLocation(206, 17);
-				if (state.backtracking == 0)
-				{
-					 Out(st); 
-				}
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("booleanExpr", 27);
-			LeaveRule("booleanExpr", 27);
-			LeaveRule_booleanExpr();
-		}
-		DebugLocation(207, 1);
-		} finally { DebugExitRule(GrammarFileName, "booleanExpr"); }
-		return;
-
-	}
-	// $ANTLR end "booleanExpr"
-
-	partial void EnterRule_comparisonExpr();
-	partial void LeaveRule_comparisonExpr();
-	// $ANTLR start "comparisonExpr"
-	// SqlGenerator.g:209:8: public comparisonExpr[ bool parens ] : ( binaryComparisonExpression | exoticComparisonExpression );
-	[GrammarRule("comparisonExpr")]
-	public void comparisonExpr(bool parens)
-	{
-		EnterRule_comparisonExpr();
-		EnterRule("comparisonExpr", 28);
-		TraceIn("comparisonExpr", 28);
-		try { DebugEnterRule(GrammarFileName, "comparisonExpr");
-		DebugLocation(209, 1);
-		try
-		{
-			// SqlGenerator.g:210:2: ( binaryComparisonExpression | exoticComparisonExpression )
-			int alt44=2;
-			try { DebugEnterDecision(44, false);
-			int LA44_1 = input.LA(1);
-
-			if ((LA44_1==EQ||LA44_1==GE||LA44_1==GT||LA44_1==LE||LA44_1==LT||LA44_1==NE))
-			{
-				alt44 = 1;
-			}
-			else if ((LA44_1==BETWEEN||LA44_1==EXISTS||LA44_1==IN||(LA44_1>=IS_NOT_NULL && LA44_1<=IS_NULL)||LA44_1==LIKE||(LA44_1>=NOT_BETWEEN && LA44_1<=NOT_LIKE)))
-			{
-				alt44 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 44, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(44); }
-			switch (alt44)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:210:4: binaryComparisonExpression
-				{
-				DebugLocation(210, 4);
-				PushFollow(Follow._binaryComparisonExpression_in_comparisonExpr1068);
-				binaryComparisonExpression();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:211:4: exoticComparisonExpression
-				{
-				DebugLocation(211, 4);
-				if (state.backtracking == 0)
-				{
-					 if (parens) Out("("); 
-				}
-				DebugLocation(211, 30);
-				PushFollow(Follow._exoticComparisonExpression_in_comparisonExpr1075);
-				exoticComparisonExpression();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(211, 57);
-				if (state.backtracking == 0)
-				{
-					 if (parens) Out(")"); 
-				}
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("comparisonExpr", 28);
-			LeaveRule("comparisonExpr", 28);
-			LeaveRule_comparisonExpr();
-		}
-		DebugLocation(212, 1);
-		} finally { DebugExitRule(GrammarFileName, "comparisonExpr"); }
-		return;
-
-	}
-	// $ANTLR end "comparisonExpr"
-
-	partial void EnterRule_binaryComparisonExpression();
-	partial void LeaveRule_binaryComparisonExpression();
-	// $ANTLR start "binaryComparisonExpression"
-	// SqlGenerator.g:214:1: binaryComparisonExpression : ( ^( EQ expr expr ) | ^( NE expr expr ) | ^( GT expr expr ) | ^( GE expr expr ) | ^( LT expr expr ) | ^( LE expr expr ) );
-	[GrammarRule("binaryComparisonExpression")]
-	private void binaryComparisonExpression()
-	{
-		EnterRule_binaryComparisonExpression();
-		EnterRule("binaryComparisonExpression", 29);
-		TraceIn("binaryComparisonExpression", 29);
-		try { DebugEnterRule(GrammarFileName, "binaryComparisonExpression");
-		DebugLocation(214, 1);
-		try
-		{
-			// SqlGenerator.g:215:2: ( ^( EQ expr expr ) | ^( NE expr expr ) | ^( GT expr expr ) | ^( GE expr expr ) | ^( LT expr expr ) | ^( LE expr expr ) )
-			int alt45=6;
-			try { DebugEnterDecision(45, false);
-			switch (input.LA(1))
-			{
-			case EQ:
-				{
-				alt45 = 1;
-				}
-				break;
-			case NE:
-				{
-				alt45 = 2;
-				}
-				break;
-			case GT:
-				{
-				alt45 = 3;
-				}
-				break;
-			case GE:
-				{
-				alt45 = 4;
-				}
-				break;
-			case LT:
-				{
-				alt45 = 5;
-				}
-				break;
-			case LE:
-				{
-				alt45 = 6;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 45, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(45); }
-			switch (alt45)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:215:4: ^( EQ expr expr )
-				{
-				DebugLocation(215, 4);
-				DebugLocation(215, 6);
-				Match(input,EQ,Follow._EQ_in_binaryComparisonExpression1090); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(215, 9);
-				PushFollow(Follow._expr_in_binaryComparisonExpression1092);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(215, 14);
-				if (state.backtracking == 0)
-				{
-					 Out("="); 
-				}
-				DebugLocation(215, 28);
-				PushFollow(Follow._expr_in_binaryComparisonExpression1096);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:216:4: ^( NE expr expr )
-				{
-				DebugLocation(216, 4);
-				DebugLocation(216, 6);
-				Match(input,NE,Follow._NE_in_binaryComparisonExpression1103); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(216, 9);
-				PushFollow(Follow._expr_in_binaryComparisonExpression1105);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(216, 14);
-				if (state.backtracking == 0)
-				{
-					 Out("<>"); 
-				}
-				DebugLocation(216, 29);
-				PushFollow(Follow._expr_in_binaryComparisonExpression1109);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:217:4: ^( GT expr expr )
-				{
-				DebugLocation(217, 4);
-				DebugLocation(217, 6);
-				Match(input,GT,Follow._GT_in_binaryComparisonExpression1116); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(217, 9);
-				PushFollow(Follow._expr_in_binaryComparisonExpression1118);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(217, 14);
-				if (state.backtracking == 0)
-				{
-					 Out(">"); 
-				}
-				DebugLocation(217, 28);
-				PushFollow(Follow._expr_in_binaryComparisonExpression1122);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// SqlGenerator.g:218:4: ^( GE expr expr )
-				{
-				DebugLocation(218, 4);
-				DebugLocation(218, 6);
-				Match(input,GE,Follow._GE_in_binaryComparisonExpression1129); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(218, 9);
-				PushFollow(Follow._expr_in_binaryComparisonExpression1131);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(218, 14);
-				if (state.backtracking == 0)
-				{
-					 Out(">="); 
-				}
-				DebugLocation(218, 29);
-				PushFollow(Follow._expr_in_binaryComparisonExpression1135);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// SqlGenerator.g:219:4: ^( LT expr expr )
-				{
-				DebugLocation(219, 4);
-				DebugLocation(219, 6);
-				Match(input,LT,Follow._LT_in_binaryComparisonExpression1142); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(219, 9);
-				PushFollow(Follow._expr_in_binaryComparisonExpression1144);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(219, 14);
-				if (state.backtracking == 0)
-				{
-					 Out("<"); 
-				}
-				DebugLocation(219, 28);
-				PushFollow(Follow._expr_in_binaryComparisonExpression1148);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 6:
-				DebugEnterAlt(6);
-				// SqlGenerator.g:220:4: ^( LE expr expr )
-				{
-				DebugLocation(220, 4);
-				DebugLocation(220, 6);
-				Match(input,LE,Follow._LE_in_binaryComparisonExpression1155); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(220, 9);
-				PushFollow(Follow._expr_in_binaryComparisonExpression1157);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(220, 14);
-				if (state.backtracking == 0)
-				{
-					 Out("<="); 
-				}
-				DebugLocation(220, 29);
-				PushFollow(Follow._expr_in_binaryComparisonExpression1161);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("binaryComparisonExpression", 29);
-			LeaveRule("binaryComparisonExpression", 29);
-			LeaveRule_binaryComparisonExpression();
-		}
-		DebugLocation(221, 1);
-		} finally { DebugExitRule(GrammarFileName, "binaryComparisonExpression"); }
-		return;
-
-	}
-	// $ANTLR end "binaryComparisonExpression"
-
-	partial void EnterRule_exoticComparisonExpression();
-	partial void LeaveRule_exoticComparisonExpression();
-	// $ANTLR start "exoticComparisonExpression"
-	// SqlGenerator.g:223:1: exoticComparisonExpression : ( ^( LIKE expr expr likeEscape ) | ^( NOT_LIKE expr expr likeEscape ) | ^( BETWEEN expr expr expr ) | ^( NOT_BETWEEN expr expr expr ) | ^( IN expr inList ) | ^( NOT_IN expr inList ) | ^( EXISTS quantified ) | ^( IS_NULL expr ) | ^( IS_NOT_NULL expr ) );
-	[GrammarRule("exoticComparisonExpression")]
-	private void exoticComparisonExpression()
-	{
-		EnterRule_exoticComparisonExpression();
-		EnterRule("exoticComparisonExpression", 30);
-		TraceIn("exoticComparisonExpression", 30);
-		try { DebugEnterRule(GrammarFileName, "exoticComparisonExpression");
-		DebugLocation(223, 1);
-		try
-		{
-			// SqlGenerator.g:224:2: ( ^( LIKE expr expr likeEscape ) | ^( NOT_LIKE expr expr likeEscape ) | ^( BETWEEN expr expr expr ) | ^( NOT_BETWEEN expr expr expr ) | ^( IN expr inList ) | ^( NOT_IN expr inList ) | ^( EXISTS quantified ) | ^( IS_NULL expr ) | ^( IS_NOT_NULL expr ) )
-			int alt46=9;
-			try { DebugEnterDecision(46, false);
-			switch (input.LA(1))
-			{
-			case LIKE:
-				{
-				alt46 = 1;
-				}
-				break;
-			case NOT_LIKE:
-				{
-				alt46 = 2;
-				}
-				break;
-			case BETWEEN:
-				{
-				alt46 = 3;
-				}
-				break;
-			case NOT_BETWEEN:
-				{
-				alt46 = 4;
-				}
-				break;
-			case IN:
-				{
-				alt46 = 5;
-				}
-				break;
-			case NOT_IN:
-				{
-				alt46 = 6;
-				}
-				break;
-			case EXISTS:
-				{
-				alt46 = 7;
-				}
-				break;
-			case IS_NULL:
-				{
-				alt46 = 8;
-				}
-				break;
-			case IS_NOT_NULL:
-				{
-				alt46 = 9;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 46, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(46); }
-			switch (alt46)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:224:4: ^( LIKE expr expr likeEscape )
-				{
-				DebugLocation(224, 4);
-				DebugLocation(224, 6);
-				Match(input,LIKE,Follow._LIKE_in_exoticComparisonExpression1175); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(224, 11);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1177);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(224, 16);
-				if (state.backtracking == 0)
-				{
-					 Out(" like "); 
-				}
-				DebugLocation(224, 35);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1181);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(224, 40);
-				PushFollow(Follow._likeEscape_in_exoticComparisonExpression1183);
-				likeEscape();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:225:4: ^( NOT_LIKE expr expr likeEscape )
-				{
-				DebugLocation(225, 4);
-				DebugLocation(225, 6);
-				Match(input,NOT_LIKE,Follow._NOT_LIKE_in_exoticComparisonExpression1191); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(225, 15);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1193);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(225, 20);
-				if (state.backtracking == 0)
-				{
-					 Out(" not like "); 
-				}
-				DebugLocation(225, 43);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1197);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(225, 48);
-				PushFollow(Follow._likeEscape_in_exoticComparisonExpression1199);
-				likeEscape();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:226:4: ^( BETWEEN expr expr expr )
-				{
-				DebugLocation(226, 4);
-				DebugLocation(226, 6);
-				Match(input,BETWEEN,Follow._BETWEEN_in_exoticComparisonExpression1206); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(226, 14);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1208);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(226, 19);
-				if (state.backtracking == 0)
-				{
-					 Out(" between "); 
-				}
-				DebugLocation(226, 41);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1212);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(226, 46);
-				if (state.backtracking == 0)
-				{
-					 Out(" and "); 
-				}
-				DebugLocation(226, 64);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1216);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// SqlGenerator.g:227:4: ^( NOT_BETWEEN expr expr expr )
-				{
-				DebugLocation(227, 4);
-				DebugLocation(227, 6);
-				Match(input,NOT_BETWEEN,Follow._NOT_BETWEEN_in_exoticComparisonExpression1223); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(227, 18);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1225);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(227, 23);
-				if (state.backtracking == 0)
-				{
-					 Out(" not between "); 
-				}
-				DebugLocation(227, 49);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1229);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(227, 54);
-				if (state.backtracking == 0)
-				{
-					 Out(" and "); 
-				}
-				DebugLocation(227, 72);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1233);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// SqlGenerator.g:228:4: ^( IN expr inList )
-				{
-				DebugLocation(228, 4);
-				DebugLocation(228, 6);
-				Match(input,IN,Follow._IN_in_exoticComparisonExpression1240); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(228, 9);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1242);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(228, 14);
-				if (state.backtracking == 0)
-				{
-					 Out(" in"); 
-				}
-				DebugLocation(228, 30);
-				PushFollow(Follow._inList_in_exoticComparisonExpression1246);
-				inList();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 6:
-				DebugEnterAlt(6);
-				// SqlGenerator.g:229:4: ^( NOT_IN expr inList )
-				{
-				DebugLocation(229, 4);
-				DebugLocation(229, 6);
-				Match(input,NOT_IN,Follow._NOT_IN_in_exoticComparisonExpression1254); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(229, 13);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1256);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(229, 18);
-				if (state.backtracking == 0)
-				{
-					 Out(" not in "); 
-				}
-				DebugLocation(229, 39);
-				PushFollow(Follow._inList_in_exoticComparisonExpression1260);
-				inList();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 7:
-				DebugEnterAlt(7);
-				// SqlGenerator.g:230:4: ^( EXISTS quantified )
-				{
-				DebugLocation(230, 4);
-				DebugLocation(230, 6);
-				Match(input,EXISTS,Follow._EXISTS_in_exoticComparisonExpression1268); if (state.failed) return;
-
-				DebugLocation(230, 13);
-				if (state.backtracking == 0)
-				{
-					 OptionalSpace(); Out("exists "); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(230, 50);
-				PushFollow(Follow._quantified_in_exoticComparisonExpression1272);
-				quantified();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 8:
-				DebugEnterAlt(8);
-				// SqlGenerator.g:231:4: ^( IS_NULL expr )
-				{
-				DebugLocation(231, 4);
-				DebugLocation(231, 6);
-				Match(input,IS_NULL,Follow._IS_NULL_in_exoticComparisonExpression1280); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(231, 14);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1282);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-				DebugLocation(231, 20);
-				if (state.backtracking == 0)
-				{
-					 Out(" is null"); 
-				}
-
-				}
-				break;
-			case 9:
-				DebugEnterAlt(9);
-				// SqlGenerator.g:232:4: ^( IS_NOT_NULL expr )
-				{
-				DebugLocation(232, 4);
-				DebugLocation(232, 6);
-				Match(input,IS_NOT_NULL,Follow._IS_NOT_NULL_in_exoticComparisonExpression1291); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(232, 18);
-				PushFollow(Follow._expr_in_exoticComparisonExpression1293);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-				DebugLocation(232, 24);
-				if (state.backtracking == 0)
-				{
-					 Out(" is not null"); 
-				}
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("exoticComparisonExpression", 30);
-			LeaveRule("exoticComparisonExpression", 30);
-			LeaveRule_exoticComparisonExpression();
-		}
-		DebugLocation(233, 1);
-		} finally { DebugExitRule(GrammarFileName, "exoticComparisonExpression"); }
-		return;
-
-	}
-	// $ANTLR end "exoticComparisonExpression"
-
-	partial void EnterRule_likeEscape();
-	partial void LeaveRule_likeEscape();
-	// $ANTLR start "likeEscape"
-	// SqlGenerator.g:235:1: likeEscape : ( ^( ESCAPE expr ) )? ;
-	[GrammarRule("likeEscape")]
-	private void likeEscape()
-	{
-		EnterRule_likeEscape();
-		EnterRule("likeEscape", 31);
-		TraceIn("likeEscape", 31);
-		try { DebugEnterRule(GrammarFileName, "likeEscape");
-		DebugLocation(235, 1);
-		try
-		{
-			// SqlGenerator.g:236:2: ( ( ^( ESCAPE expr ) )? )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:236:4: ( ^( ESCAPE expr ) )?
-			{
-			DebugLocation(236, 4);
-			// SqlGenerator.g:236:4: ( ^( ESCAPE expr ) )?
-			int alt47=2;
-			try { DebugEnterSubRule(47);
-			try { DebugEnterDecision(47, false);
-			int LA47_1 = input.LA(1);
-
-			if ((LA47_1==ESCAPE))
-			{
-				alt47 = 1;
-			}
-			} finally { DebugExitDecision(47); }
-			switch (alt47)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:236:6: ^( ESCAPE expr )
-				{
-				DebugLocation(236, 6);
-				DebugLocation(236, 8);
-				Match(input,ESCAPE,Follow._ESCAPE_in_likeEscape1310); if (state.failed) return;
-
-				DebugLocation(236, 15);
-				if (state.backtracking == 0)
-				{
-					 Out(" escape "); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(236, 36);
-				PushFollow(Follow._expr_in_likeEscape1314);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(47); }
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("likeEscape", 31);
-			LeaveRule("likeEscape", 31);
-			LeaveRule_likeEscape();
-		}
-		DebugLocation(237, 1);
-		} finally { DebugExitRule(GrammarFileName, "likeEscape"); }
-		return;
-
-	}
-	// $ANTLR end "likeEscape"
-
-	partial void EnterRule_inList();
-	partial void LeaveRule_inList();
-	// $ANTLR start "inList"
-	// SqlGenerator.g:239:1: inList : ^( IN_LIST ( parenSelect | simpleExprList ) ) ;
-	[GrammarRule("inList")]
-	private void inList()
-	{
-		EnterRule_inList();
-		EnterRule("inList", 32);
-		TraceIn("inList", 32);
-		try { DebugEnterRule(GrammarFileName, "inList");
-		DebugLocation(239, 1);
-		try
-		{
-			// SqlGenerator.g:240:2: ( ^( IN_LIST ( parenSelect | simpleExprList ) ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:240:4: ^( IN_LIST ( parenSelect | simpleExprList ) )
-			{
-			DebugLocation(240, 4);
-			DebugLocation(240, 6);
-			Match(input,IN_LIST,Follow._IN_LIST_in_inList1330); if (state.failed) return;
-
-			DebugLocation(240, 14);
-			if (state.backtracking == 0)
-			{
-				 Out(" "); 
-			}
-
-			if (input.LA(1) == TokenTypes.Down)
-			{
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(240, 28);
-				// SqlGenerator.g:240:28: ( parenSelect | simpleExprList )
-				int alt48=2;
-				try { DebugEnterSubRule(48);
-				try { DebugEnterDecision(48, false);
-				int LA48_1 = input.LA(1);
-
-				if ((LA48_1==SELECT||LA48_1==UNION))
-				{
-					alt48 = 1;
-				}
-				else if (((LA48_1>=UP && LA48_1<=AGGREGATE)||LA48_1==BAND||(LA48_1>=BNOT && LA48_1<=BOR)||(LA48_1>=BXOR && LA48_1<=CASE2)||LA48_1==CONSTANT||LA48_1==COUNT||(LA48_1>=DIV && LA48_1<=DOT)||LA48_1==FALSE||LA48_1==IDENT||LA48_1==INDEX_OP||LA48_1==JAVA_CONSTANT||LA48_1==METHOD_CALL||LA48_1==MINUS||(LA48_1>=NULL && LA48_1<=NUM_LONG)||(LA48_1>=PARAM && LA48_1<=PLUS)||LA48_1==QUOTED_String||LA48_1==STAR||(LA48_1>=TRUE && LA48_1<=UNARY_MINUS)||LA48_1==ALIAS_REF||LA48_1==NAMED_PARAM||LA48_1==RESULT_VARIABLE_REF||LA48_1==SQL_TOKEN))
-				{
-					alt48 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 48, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				} finally { DebugExitDecision(48); }
-				switch (alt48)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// SqlGenerator.g:240:30: parenSelect
-					{
-					DebugLocation(240, 30);
-					PushFollow(Follow._parenSelect_in_inList1336);
-					parenSelect();
-					PopFollow();
-					if (state.failed) return;
-
-					}
-					break;
-				case 2:
-					DebugEnterAlt(2);
-					// SqlGenerator.g:240:44: simpleExprList
-					{
-					DebugLocation(240, 44);
-					PushFollow(Follow._simpleExprList_in_inList1340);
-					simpleExprList();
-					PopFollow();
-					if (state.failed) return;
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(48); }
-
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-			}
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("inList", 32);
-			LeaveRule("inList", 32);
-			LeaveRule_inList();
-		}
-		DebugLocation(241, 1);
-		} finally { DebugExitRule(GrammarFileName, "inList"); }
-		return;
-
-	}
-	// $ANTLR end "inList"
-
-	partial void EnterRule_simpleExprList();
-	partial void LeaveRule_simpleExprList();
-	// $ANTLR start "simpleExprList"
-	// SqlGenerator.g:243:1: simpleExprList : (e= simpleExpr )* ;
-	[GrammarRule("simpleExprList")]
-	private void simpleExprList()
-	{
-		EnterRule_simpleExprList();
-		EnterRule("simpleExprList", 33);
-		TraceIn("simpleExprList", 33);
-		TreeRuleReturnScope<IASTNode> e = default(TreeRuleReturnScope<IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "simpleExprList");
-		DebugLocation(243, 1);
-		try
-		{
-			// SqlGenerator.g:244:2: ( (e= simpleExpr )* )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:244:4: (e= simpleExpr )*
-			{
-			DebugLocation(244, 4);
-			if (state.backtracking == 0)
-			{
-				 Out("("); 
-			}
-			DebugLocation(244, 18);
-			// SqlGenerator.g:244:18: (e= simpleExpr )*
-			try { DebugEnterSubRule(49);
-			while (true)
-			{
-				int alt49=2;
-				try { DebugEnterDecision(49, false);
-				int LA49_1 = input.LA(1);
-
-				if ((LA49_1==AGGREGATE||LA49_1==BAND||(LA49_1>=BNOT && LA49_1<=BOR)||(LA49_1>=BXOR && LA49_1<=CASE2)||LA49_1==CONSTANT||LA49_1==COUNT||(LA49_1>=DIV && LA49_1<=DOT)||LA49_1==FALSE||LA49_1==IDENT||LA49_1==INDEX_OP||LA49_1==JAVA_CONSTANT||LA49_1==METHOD_CALL||LA49_1==MINUS||(LA49_1>=NULL && LA49_1<=NUM_LONG)||(LA49_1>=PARAM && LA49_1<=PLUS)||LA49_1==QUOTED_String||LA49_1==STAR||(LA49_1>=TRUE && LA49_1<=UNARY_MINUS)||LA49_1==ALIAS_REF||LA49_1==NAMED_PARAM||LA49_1==RESULT_VARIABLE_REF||LA49_1==SQL_TOKEN))
-				{
-					alt49 = 1;
-				}
-
-
-				} finally { DebugExitDecision(49); }
-				switch ( alt49 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// SqlGenerator.g:244:19: e= simpleExpr
-					{
-					DebugLocation(244, 20);
-					PushFollow(Follow._simpleExpr_in_simpleExprList1361);
-					e=simpleExpr();
-					PopFollow();
-					if (state.failed) return;
-					DebugLocation(244, 32);
-					if (state.backtracking == 0)
-					{
-						 Separator((e!=null?((IASTNode)e.Start):default(IASTNode))," , "); 
-					}
-
-					}
-					break;
-
-				default:
-					goto loop49;
-				}
-			}
-
-			loop49:
-				;
-
-			} finally { DebugExitSubRule(49); }
-
-			DebugLocation(244, 66);
-			if (state.backtracking == 0)
-			{
-				 Out(")"); 
-			}
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("simpleExprList", 33);
-			LeaveRule("simpleExprList", 33);
-			LeaveRule_simpleExprList();
-		}
-		DebugLocation(245, 1);
-		} finally { DebugExitRule(GrammarFileName, "simpleExprList"); }
-		return;
-
-	}
-	// $ANTLR end "simpleExprList"
-
-	partial void EnterRule_expr();
-	partial void LeaveRule_expr();
-	// $ANTLR start "expr"
-	// SqlGenerator.g:248:1: expr : ( simpleExpr | ^( VECTOR_EXPR (e= expr )* ) | parenSelect | ^( ANY quantified ) | ^( ALL quantified ) | ^( SOME quantified ) );
-	[GrammarRule("expr")]
-	private TreeRuleReturnScope<IASTNode> expr()
-	{
-		EnterRule_expr();
-		EnterRule("expr", 34);
-		TraceIn("expr", 34);
-		TreeRuleReturnScope<IASTNode> retval = new TreeRuleReturnScope<IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		TreeRuleReturnScope<IASTNode> e = default(TreeRuleReturnScope<IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "expr");
-		DebugLocation(248, 1);
-		try
-		{
-			// SqlGenerator.g:249:2: ( simpleExpr | ^( VECTOR_EXPR (e= expr )* ) | parenSelect | ^( ANY quantified ) | ^( ALL quantified ) | ^( SOME quantified ) )
-			int alt51=6;
-			try { DebugEnterDecision(51, false);
-			switch (input.LA(1))
-			{
-			case AGGREGATE:
-			case BAND:
-			case BNOT:
-			case BOR:
-			case BXOR:
-			case CASE:
-			case CASE2:
-			case CONSTANT:
-			case COUNT:
-			case DIV:
-			case DOT:
-			case FALSE:
-			case IDENT:
-			case INDEX_OP:
-			case JAVA_CONSTANT:
-			case METHOD_CALL:
-			case MINUS:
-			case NULL:
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case PARAM:
-			case PLUS:
-			case QUOTED_String:
-			case STAR:
-			case TRUE:
-			case UNARY_MINUS:
-			case ALIAS_REF:
-			case NAMED_PARAM:
-			case RESULT_VARIABLE_REF:
-			case SQL_TOKEN:
-				{
-				alt51 = 1;
-				}
-				break;
-			case VECTOR_EXPR:
-				{
-				alt51 = 2;
-				}
-				break;
-			case SELECT:
-			case UNION:
-				{
-				alt51 = 3;
-				}
-				break;
-			case ANY:
-				{
-				alt51 = 4;
-				}
-				break;
-			case ALL:
-				{
-				alt51 = 5;
-				}
-				break;
-			case SOME:
-				{
-				alt51 = 6;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return retval;}
-					NoViableAltException nvae = new NoViableAltException("", 51, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(51); }
-			switch (alt51)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:249:4: simpleExpr
-				{
-				DebugLocation(249, 4);
-				PushFollow(Follow._simpleExpr_in_expr1380);
-				simpleExpr();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:250:4: ^( VECTOR_EXPR (e= expr )* )
-				{
-				DebugLocation(250, 4);
-				DebugLocation(250, 7);
-				Match(input,VECTOR_EXPR,Follow._VECTOR_EXPR_in_expr1387); if (state.failed) return retval;
-
-				DebugLocation(250, 19);
-				if (state.backtracking == 0)
-				{
-					 Out("("); 
-				}
-
-				if (input.LA(1) == TokenTypes.Down)
-				{
-					Match(input, TokenTypes.Down, null); if (state.failed) return retval;
-					DebugLocation(250, 33);
-					// SqlGenerator.g:250:33: (e= expr )*
-					try { DebugEnterSubRule(50);
-					while (true)
-					{
-						int alt50=2;
-						try { DebugEnterDecision(50, false);
-						int LA50_1 = input.LA(1);
-
-						if ((LA50_1==AGGREGATE||LA50_1==ALL||LA50_1==ANY||LA50_1==BAND||(LA50_1>=BNOT && LA50_1<=BOR)||(LA50_1>=BXOR && LA50_1<=CASE2)||LA50_1==CONSTANT||LA50_1==COUNT||(LA50_1>=DIV && LA50_1<=DOT)||LA50_1==FALSE||LA50_1==IDENT||LA50_1==INDEX_OP||LA50_1==JAVA_CONSTANT||LA50_1==METHOD_CALL||LA50_1==MINUS||(LA50_1>=NULL && LA50_1<=NUM_LONG)||(LA50_1>=PARAM && LA50_1<=PLUS)||LA50_1==QUOTED_String||LA50_1==SELECT||LA50_1==SOME||LA50_1==STAR||(LA50_1>=TRUE && LA50_1<=UNARY_MINUS)||LA50_1==UNION||LA50_1==VECTOR_EXPR||LA50_1==ALIAS_REF||LA50_1==NAMED_PARAM||LA50_1==RESULT_VARIABLE_REF||LA50_1==SQL_TOKEN))
-						{
-							alt50 = 1;
-						}
-
-
-						} finally { DebugExitDecision(50); }
-						switch ( alt50 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// SqlGenerator.g:250:34: e= expr
-							{
-							DebugLocation(250, 35);
-							PushFollow(Follow._expr_in_expr1394);
-							e=expr();
-							PopFollow();
-							if (state.failed) return retval;
-							DebugLocation(250, 41);
-							if (state.backtracking == 0)
-							{
-								 Separator((e!=null?((IASTNode)e.Start):default(IASTNode))," , "); 
-							}
-
-							}
-							break;
-
-						default:
-							goto loop50;
-						}
-					}
-
-					loop50:
-						;
-
-					} finally { DebugExitSubRule(50); }
-
-					DebugLocation(250, 76);
-					if (state.backtracking == 0)
-					{
-						 Out(")"); 
-					}
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return retval;
-				}
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:251:4: parenSelect
-				{
-				DebugLocation(251, 4);
-				PushFollow(Follow._parenSelect_in_expr1409);
-				parenSelect();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// SqlGenerator.g:252:4: ^( ANY quantified )
-				{
-				DebugLocation(252, 4);
-				DebugLocation(252, 6);
-				Match(input,ANY,Follow._ANY_in_expr1415); if (state.failed) return retval;
-
-				DebugLocation(252, 10);
-				if (state.backtracking == 0)
-				{
-					 Out("any "); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return retval;
-				DebugLocation(252, 27);
-				PushFollow(Follow._quantified_in_expr1419);
-				quantified();
-				PopFollow();
-				if (state.failed) return retval;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return retval;
-
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// SqlGenerator.g:253:4: ^( ALL quantified )
-				{
-				DebugLocation(253, 4);
-				DebugLocation(253, 6);
-				Match(input,ALL,Follow._ALL_in_expr1427); if (state.failed) return retval;
-
-				DebugLocation(253, 10);
-				if (state.backtracking == 0)
-				{
-					 Out("all "); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return retval;
-				DebugLocation(253, 27);
-				PushFollow(Follow._quantified_in_expr1431);
-				quantified();
-				PopFollow();
-				if (state.failed) return retval;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return retval;
-
-
-				}
-				break;
-			case 6:
-				DebugEnterAlt(6);
-				// SqlGenerator.g:254:4: ^( SOME quantified )
-				{
-				DebugLocation(254, 4);
-				DebugLocation(254, 6);
-				Match(input,SOME,Follow._SOME_in_expr1439); if (state.failed) return retval;
-
-				DebugLocation(254, 11);
-				if (state.backtracking == 0)
-				{
-					 Out("some "); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return retval;
-				DebugLocation(254, 29);
-				PushFollow(Follow._quantified_in_expr1443);
-				quantified();
-				PopFollow();
-				if (state.failed) return retval;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return retval;
-
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("expr", 34);
-			LeaveRule("expr", 34);
-			LeaveRule_expr();
-		}
-		DebugLocation(255, 1);
-		} finally { DebugExitRule(GrammarFileName, "expr"); }
-		return retval;
-
-	}
-	// $ANTLR end "expr"
-
-	partial void EnterRule_quantified();
-	partial void LeaveRule_quantified();
-	// $ANTLR start "quantified"
-	// SqlGenerator.g:257:1: quantified : ( sqlToken | selectStatement ) ;
-	[GrammarRule("quantified")]
-	private void quantified()
-	{
-		EnterRule_quantified();
-		EnterRule("quantified", 35);
-		TraceIn("quantified", 35);
-		try { DebugEnterRule(GrammarFileName, "quantified");
-		DebugLocation(257, 1);
-		try
-		{
-			// SqlGenerator.g:258:2: ( ( sqlToken | selectStatement ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:258:4: ( sqlToken | selectStatement )
-			{
-			DebugLocation(258, 4);
-			if (state.backtracking == 0)
-			{
-				 Out("("); 
-			}
-			DebugLocation(258, 18);
-			// SqlGenerator.g:258:18: ( sqlToken | selectStatement )
-			int alt52=2;
-			try { DebugEnterSubRule(52);
-			try { DebugEnterDecision(52, false);
-			int LA52_1 = input.LA(1);
-
-			if ((LA52_1==SQL_TOKEN))
-			{
-				alt52 = 1;
-			}
-			else if ((LA52_1==SELECT))
-			{
-				alt52 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 52, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(52); }
-			switch (alt52)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:258:20: sqlToken
-				{
-				DebugLocation(258, 20);
-				PushFollow(Follow._sqlToken_in_quantified1461);
-				sqlToken();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:258:31: selectStatement
-				{
-				DebugLocation(258, 31);
-				PushFollow(Follow._selectStatement_in_quantified1465);
-				selectStatement();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(52); }
-
-			DebugLocation(258, 49);
-			if (state.backtracking == 0)
-			{
-				 Out(")"); 
-			}
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("quantified", 35);
-			LeaveRule("quantified", 35);
-			LeaveRule_quantified();
-		}
-		DebugLocation(259, 1);
-		} finally { DebugExitRule(GrammarFileName, "quantified"); }
-		return;
-
-	}
-	// $ANTLR end "quantified"
-
-	partial void EnterRule_parenSelect();
-	partial void LeaveRule_parenSelect();
-	// $ANTLR start "parenSelect"
-	// SqlGenerator.g:261:1: parenSelect : ( selectStatement | ^( UNION selectStatement parenSelect ) );
-	[GrammarRule("parenSelect")]
-	private void parenSelect()
-	{
-		EnterRule_parenSelect();
-		EnterRule("parenSelect", 36);
-		TraceIn("parenSelect", 36);
-		try { DebugEnterRule(GrammarFileName, "parenSelect");
-		DebugLocation(261, 1);
-		try
-		{
-			// SqlGenerator.g:262:2: ( selectStatement | ^( UNION selectStatement parenSelect ) )
-			int alt53=2;
-			try { DebugEnterDecision(53, false);
-			int LA53_1 = input.LA(1);
-
-			if ((LA53_1==SELECT))
-			{
-				alt53 = 1;
-			}
-			else if ((LA53_1==UNION))
-			{
-				alt53 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 53, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(53); }
-			switch (alt53)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:262:4: selectStatement
-				{
-				DebugLocation(262, 4);
-				if (state.backtracking == 0)
-				{
-					 Out("("); 
-				}
-				DebugLocation(262, 18);
-				PushFollow(Follow._selectStatement_in_parenSelect1484);
-				selectStatement();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(262, 34);
-				if (state.backtracking == 0)
-				{
-					 Out(")"); 
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:263:4: ^( UNION selectStatement parenSelect )
-				{
-				DebugLocation(263, 4);
-				DebugLocation(263, 6);
-				Match(input,UNION,Follow._UNION_in_parenSelect1493); if (state.failed) return;
-
-				DebugLocation(263, 12);
-				if (state.backtracking == 0)
-				{
-					 Out("("); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(263, 26);
-				PushFollow(Follow._selectStatement_in_parenSelect1497);
-				selectStatement();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(263, 42);
-				if (state.backtracking == 0)
-				{
-					 Out(") union "); 
-				}
-				DebugLocation(263, 63);
-				PushFollow(Follow._parenSelect_in_parenSelect1501);
-				parenSelect();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("parenSelect", 36);
-			LeaveRule("parenSelect", 36);
-			LeaveRule_parenSelect();
-		}
-		DebugLocation(264, 1);
-		} finally { DebugExitRule(GrammarFileName, "parenSelect"); }
-		return;
-
-	}
-	// $ANTLR end "parenSelect"
-
-	partial void EnterRule_simpleExpr();
-	partial void LeaveRule_simpleExpr();
-	// $ANTLR start "simpleExpr"
-	// SqlGenerator.g:267:8: public simpleExpr : (c= constant | NULL | addrExpr | sqlToken | aggregate | methodCall | count | parameter | arithmeticExpr );
-	[GrammarRule("simpleExpr")]
-	public TreeRuleReturnScope<IASTNode> simpleExpr()
-	{
-		EnterRule_simpleExpr();
-		EnterRule("simpleExpr", 37);
-		TraceIn("simpleExpr", 37);
-		TreeRuleReturnScope<IASTNode> retval = new TreeRuleReturnScope<IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		TreeRuleReturnScope<IASTNode> c = default(TreeRuleReturnScope<IASTNode>);
-
-		try { DebugEnterRule(GrammarFileName, "simpleExpr");
-		DebugLocation(267, 1);
-		try
-		{
-			// SqlGenerator.g:268:2: (c= constant | NULL | addrExpr | sqlToken | aggregate | methodCall | count | parameter | arithmeticExpr )
-			int alt54=9;
-			try { DebugEnterDecision(54, false);
-			switch (input.LA(1))
-			{
-			case CONSTANT:
-			case FALSE:
-			case IDENT:
-			case JAVA_CONSTANT:
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case QUOTED_String:
-			case TRUE:
-				{
-				alt54 = 1;
-				}
-				break;
-			case NULL:
-				{
-				alt54 = 2;
-				}
-				break;
-			case DOT:
-			case INDEX_OP:
-			case ALIAS_REF:
-			case RESULT_VARIABLE_REF:
-				{
-				alt54 = 3;
-				}
-				break;
-			case SQL_TOKEN:
-				{
-				alt54 = 4;
-				}
-				break;
-			case AGGREGATE:
-				{
-				alt54 = 5;
-				}
-				break;
-			case METHOD_CALL:
-				{
-				alt54 = 6;
-				}
-				break;
-			case COUNT:
-				{
-				alt54 = 7;
-				}
-				break;
-			case PARAM:
-			case NAMED_PARAM:
-				{
-				alt54 = 8;
-				}
-				break;
-			case BAND:
-			case BNOT:
-			case BOR:
-			case BXOR:
-			case CASE:
-			case CASE2:
-			case DIV:
-			case MINUS:
-			case PLUS:
-			case STAR:
-			case UNARY_MINUS:
-				{
-				alt54 = 9;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return retval;}
-					NoViableAltException nvae = new NoViableAltException("", 54, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(54); }
-			switch (alt54)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:268:4: c= constant
-				{
-				DebugLocation(268, 5);
-				PushFollow(Follow._constant_in_simpleExpr1520);
-				c=constant();
-				PopFollow();
-				if (state.failed) return retval;
-				DebugLocation(268, 15);
-				if (state.backtracking == 0)
-				{
-					 Out((c!=null?((IASTNode)c.Start):default(IASTNode))); 
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:269:4: NULL
-				{
-				DebugLocation(269, 4);
-				Match(input,NULL,Follow._NULL_in_simpleExpr1527); if (state.failed) return retval;
-				DebugLocation(269, 9);
-				if (state.backtracking == 0)
-				{
-					 Out("null"); 
-				}
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:270:4: addrExpr
-				{
-				DebugLocation(270, 4);
-				PushFollow(Follow._addrExpr_in_simpleExpr1534);
-				addrExpr();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// SqlGenerator.g:271:4: sqlToken
-				{
-				DebugLocation(271, 4);
-				PushFollow(Follow._sqlToken_in_simpleExpr1539);
-				sqlToken();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// SqlGenerator.g:272:4: aggregate
-				{
-				DebugLocation(272, 4);
-				PushFollow(Follow._aggregate_in_simpleExpr1544);
-				aggregate();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 6:
-				DebugEnterAlt(6);
-				// SqlGenerator.g:273:4: methodCall
-				{
-				DebugLocation(273, 4);
-				PushFollow(Follow._methodCall_in_simpleExpr1549);
-				methodCall();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 7:
-				DebugEnterAlt(7);
-				// SqlGenerator.g:274:4: count
-				{
-				DebugLocation(274, 4);
-				PushFollow(Follow._count_in_simpleExpr1554);
-				count();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 8:
-				DebugEnterAlt(8);
-				// SqlGenerator.g:275:4: parameter
-				{
-				DebugLocation(275, 4);
-				PushFollow(Follow._parameter_in_simpleExpr1559);
-				parameter();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-			case 9:
-				DebugEnterAlt(9);
-				// SqlGenerator.g:276:4: arithmeticExpr
-				{
-				DebugLocation(276, 4);
-				PushFollow(Follow._arithmeticExpr_in_simpleExpr1564);
-				arithmeticExpr();
-				PopFollow();
-				if (state.failed) return retval;
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("simpleExpr", 37);
-			LeaveRule("simpleExpr", 37);
-			LeaveRule_simpleExpr();
-		}
-		DebugLocation(277, 1);
-		} finally { DebugExitRule(GrammarFileName, "simpleExpr"); }
-		return retval;
-
-	}
-	// $ANTLR end "simpleExpr"
-
-	partial void EnterRule_constant();
-	partial void LeaveRule_constant();
-	// $ANTLR start "constant"
-	// SqlGenerator.g:279:1: constant : ( NUM_DOUBLE | NUM_DECIMAL | NUM_FLOAT | NUM_INT | NUM_LONG | QUOTED_String | CONSTANT | JAVA_CONSTANT | TRUE | FALSE | IDENT );
-	[GrammarRule("constant")]
-	private TreeRuleReturnScope<IASTNode> constant()
-	{
-		EnterRule_constant();
-		EnterRule("constant", 38);
-		TraceIn("constant", 38);
-		TreeRuleReturnScope<IASTNode> retval = new TreeRuleReturnScope<IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		try { DebugEnterRule(GrammarFileName, "constant");
-		DebugLocation(279, 1);
-		try
-		{
-			// SqlGenerator.g:280:2: ( NUM_DOUBLE | NUM_DECIMAL | NUM_FLOAT | NUM_INT | NUM_LONG | QUOTED_String | CONSTANT | JAVA_CONSTANT | TRUE | FALSE | IDENT )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:
-			{
-			DebugLocation(280, 2);
-			if (input.LA(1)==CONSTANT||input.LA(1)==FALSE||input.LA(1)==IDENT||input.LA(1)==JAVA_CONSTANT||(input.LA(1)>=NUM_DECIMAL && input.LA(1)<=NUM_LONG)||input.LA(1)==QUOTED_String||input.LA(1)==TRUE)
-			{
-				input.Consume();
-				state.errorRecovery=false;state.failed=false;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return retval;}
-				MismatchedSetException mse = new MismatchedSetException(null,input);
-				DebugRecognitionException(mse);
-				throw mse;
-			}
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("constant", 38);
-			LeaveRule("constant", 38);
-			LeaveRule_constant();
-		}
-		DebugLocation(291, 1);
-		} finally { DebugExitRule(GrammarFileName, "constant"); }
-		return retval;
-
-	}
-	// $ANTLR end "constant"
-
-	partial void EnterRule_arithmeticExpr();
-	partial void LeaveRule_arithmeticExpr();
-	// $ANTLR start "arithmeticExpr"
-	// SqlGenerator.g:293:1: arithmeticExpr : ( additiveExpr | bitwiseExpr | multiplicativeExpr | ^( UNARY_MINUS nestedExprAfterMinusDiv ) | caseExpr );
-	[GrammarRule("arithmeticExpr")]
-	private void arithmeticExpr()
-	{
-		EnterRule_arithmeticExpr();
-		EnterRule("arithmeticExpr", 39);
-		TraceIn("arithmeticExpr", 39);
-		try { DebugEnterRule(GrammarFileName, "arithmeticExpr");
-		DebugLocation(293, 1);
-		try
-		{
-			// SqlGenerator.g:294:2: ( additiveExpr | bitwiseExpr | multiplicativeExpr | ^( UNARY_MINUS nestedExprAfterMinusDiv ) | caseExpr )
-			int alt55=5;
-			try { DebugEnterDecision(55, false);
-			switch (input.LA(1))
-			{
-			case MINUS:
-			case PLUS:
-				{
-				alt55 = 1;
-				}
-				break;
-			case BAND:
-			case BNOT:
-			case BOR:
-			case BXOR:
-				{
-				alt55 = 2;
-				}
-				break;
-			case DIV:
-			case STAR:
-				{
-				alt55 = 3;
-				}
-				break;
-			case UNARY_MINUS:
-				{
-				alt55 = 4;
-				}
-				break;
-			case CASE:
-			case CASE2:
-				{
-				alt55 = 5;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 55, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(55); }
-			switch (alt55)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:294:4: additiveExpr
-				{
-				DebugLocation(294, 4);
-				PushFollow(Follow._additiveExpr_in_arithmeticExpr1638);
-				additiveExpr();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:295:4: bitwiseExpr
-				{
-				DebugLocation(295, 4);
-				PushFollow(Follow._bitwiseExpr_in_arithmeticExpr1643);
-				bitwiseExpr();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:296:4: multiplicativeExpr
-				{
-				DebugLocation(296, 4);
-				PushFollow(Follow._multiplicativeExpr_in_arithmeticExpr1648);
-				multiplicativeExpr();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// SqlGenerator.g:298:4: ^( UNARY_MINUS nestedExprAfterMinusDiv )
-				{
-				DebugLocation(298, 4);
-				DebugLocation(298, 6);
-				Match(input,UNARY_MINUS,Follow._UNARY_MINUS_in_arithmeticExpr1655); if (state.failed) return;
-
-				DebugLocation(298, 18);
-				if (state.backtracking == 0)
-				{
-					 Out("-"); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(298, 32);
-				PushFollow(Follow._nestedExprAfterMinusDiv_in_arithmeticExpr1659);
-				nestedExprAfterMinusDiv();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 5:
-				DebugEnterAlt(5);
-				// SqlGenerator.g:299:4: caseExpr
-				{
-				DebugLocation(299, 4);
-				PushFollow(Follow._caseExpr_in_arithmeticExpr1665);
-				caseExpr();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("arithmeticExpr", 39);
-			LeaveRule("arithmeticExpr", 39);
-			LeaveRule_arithmeticExpr();
-		}
-		DebugLocation(300, 1);
-		} finally { DebugExitRule(GrammarFileName, "arithmeticExpr"); }
-		return;
-
-	}
-	// $ANTLR end "arithmeticExpr"
-
-	partial void EnterRule_additiveExpr();
-	partial void LeaveRule_additiveExpr();
-	// $ANTLR start "additiveExpr"
-	// SqlGenerator.g:302:1: additiveExpr : ( ^( PLUS expr expr ) | ^( MINUS expr nestedExprAfterMinusDiv ) );
-	[GrammarRule("additiveExpr")]
-	private void additiveExpr()
-	{
-		EnterRule_additiveExpr();
-		EnterRule("additiveExpr", 40);
-		TraceIn("additiveExpr", 40);
-		try { DebugEnterRule(GrammarFileName, "additiveExpr");
-		DebugLocation(302, 1);
-		try
-		{
-			// SqlGenerator.g:303:2: ( ^( PLUS expr expr ) | ^( MINUS expr nestedExprAfterMinusDiv ) )
-			int alt56=2;
-			try { DebugEnterDecision(56, false);
-			int LA56_1 = input.LA(1);
-
-			if ((LA56_1==PLUS))
-			{
-				alt56 = 1;
-			}
-			else if ((LA56_1==MINUS))
-			{
-				alt56 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 56, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(56); }
-			switch (alt56)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:303:4: ^( PLUS expr expr )
-				{
-				DebugLocation(303, 4);
-				DebugLocation(303, 6);
-				Match(input,PLUS,Follow._PLUS_in_additiveExpr1677); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(303, 11);
-				PushFollow(Follow._expr_in_additiveExpr1679);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(303, 16);
-				if (state.backtracking == 0)
-				{
-					 Out("+"); 
-				}
-				DebugLocation(303, 30);
-				PushFollow(Follow._expr_in_additiveExpr1683);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:304:4: ^( MINUS expr nestedExprAfterMinusDiv )
-				{
-				DebugLocation(304, 4);
-				DebugLocation(304, 6);
-				Match(input,MINUS,Follow._MINUS_in_additiveExpr1690); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(304, 12);
-				PushFollow(Follow._expr_in_additiveExpr1692);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(304, 17);
-				if (state.backtracking == 0)
-				{
-					 Out("-"); 
-				}
-				DebugLocation(304, 31);
-				PushFollow(Follow._nestedExprAfterMinusDiv_in_additiveExpr1696);
-				nestedExprAfterMinusDiv();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("additiveExpr", 40);
-			LeaveRule("additiveExpr", 40);
-			LeaveRule_additiveExpr();
-		}
-		DebugLocation(305, 1);
-		} finally { DebugExitRule(GrammarFileName, "additiveExpr"); }
-		return;
-
-	}
-	// $ANTLR end "additiveExpr"
-
-	partial void EnterRule_bitwiseExpr();
-	partial void LeaveRule_bitwiseExpr();
-	// $ANTLR start "bitwiseExpr"
-	// SqlGenerator.g:307:1: bitwiseExpr : ( ^( BAND expr nestedExpr ) | ^( BOR expr nestedExpr ) | ^( BXOR expr nestedExpr ) | ^( BNOT nestedExpr ) );
-	[GrammarRule("bitwiseExpr")]
-	private void bitwiseExpr()
-	{
-		EnterRule_bitwiseExpr();
-		EnterRule("bitwiseExpr", 41);
-		TraceIn("bitwiseExpr", 41);
-		try { DebugEnterRule(GrammarFileName, "bitwiseExpr");
-		DebugLocation(307, 1);
-		try
-		{
-			// SqlGenerator.g:308:2: ( ^( BAND expr nestedExpr ) | ^( BOR expr nestedExpr ) | ^( BXOR expr nestedExpr ) | ^( BNOT nestedExpr ) )
-			int alt57=4;
-			try { DebugEnterDecision(57, false);
-			switch (input.LA(1))
-			{
-			case BAND:
-				{
-				alt57 = 1;
-				}
-				break;
-			case BOR:
-				{
-				alt57 = 2;
-				}
-				break;
-			case BXOR:
-				{
-				alt57 = 3;
-				}
-				break;
-			case BNOT:
-				{
-				alt57 = 4;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 57, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(57); }
-			switch (alt57)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:308:4: ^( BAND expr nestedExpr )
-				{
-				DebugLocation(308, 4);
-				DebugLocation(308, 6);
-				Match(input,BAND,Follow._BAND_in_bitwiseExpr1709); if (state.failed) return;
-
-				DebugLocation(308, 11);
-				if (state.backtracking == 0)
-				{
-					 BeginBitwiseOp("band"); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(308, 39);
-				PushFollow(Follow._expr_in_bitwiseExpr1713);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(308, 44);
-				PushFollow(Follow._nestedExpr_in_bitwiseExpr1715);
-				nestedExpr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(308, 55);
-				if (state.backtracking == 0)
-				{
-					 EndBitwiseOp("band"); 
-				}
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:309:4: ^( BOR expr nestedExpr )
-				{
-				DebugLocation(309, 4);
-				DebugLocation(309, 6);
-				Match(input,BOR,Follow._BOR_in_bitwiseExpr1724); if (state.failed) return;
-
-				DebugLocation(309, 10);
-				if (state.backtracking == 0)
-				{
-					 BeginBitwiseOp("bor"); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(309, 37);
-				PushFollow(Follow._expr_in_bitwiseExpr1728);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(309, 42);
-				PushFollow(Follow._nestedExpr_in_bitwiseExpr1730);
-				nestedExpr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(309, 53);
-				if (state.backtracking == 0)
-				{
-					 EndBitwiseOp("bor"); 
-				}
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:310:4: ^( BXOR expr nestedExpr )
-				{
-				DebugLocation(310, 4);
-				DebugLocation(310, 6);
-				Match(input,BXOR,Follow._BXOR_in_bitwiseExpr1739); if (state.failed) return;
-
-				DebugLocation(310, 11);
-				if (state.backtracking == 0)
-				{
-					 BeginBitwiseOp("bxor"); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(310, 39);
-				PushFollow(Follow._expr_in_bitwiseExpr1743);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(310, 44);
-				PushFollow(Follow._nestedExpr_in_bitwiseExpr1745);
-				nestedExpr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(310, 55);
-				if (state.backtracking == 0)
-				{
-					 EndBitwiseOp("bxor"); 
-				}
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// SqlGenerator.g:311:4: ^( BNOT nestedExpr )
-				{
-				DebugLocation(311, 4);
-				DebugLocation(311, 6);
-				Match(input,BNOT,Follow._BNOT_in_bitwiseExpr1754); if (state.failed) return;
-
-				DebugLocation(311, 11);
-				if (state.backtracking == 0)
-				{
-					 BeginBitwiseOp("bnot"); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(311, 39);
-				PushFollow(Follow._nestedExpr_in_bitwiseExpr1758);
-				nestedExpr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(311, 50);
-				if (state.backtracking == 0)
-				{
-					 EndBitwiseOp("bnot"); 
-				}
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("bitwiseExpr", 41);
-			LeaveRule("bitwiseExpr", 41);
-			LeaveRule_bitwiseExpr();
-		}
-		DebugLocation(312, 1);
-		} finally { DebugExitRule(GrammarFileName, "bitwiseExpr"); }
-		return;
-
-	}
-	// $ANTLR end "bitwiseExpr"
-
-	partial void EnterRule_multiplicativeExpr();
-	partial void LeaveRule_multiplicativeExpr();
-	// $ANTLR start "multiplicativeExpr"
-	// SqlGenerator.g:314:1: multiplicativeExpr : ( ^( STAR nestedExpr nestedExpr ) | ^( DIV nestedExpr nestedExprAfterMinusDiv ) );
-	[GrammarRule("multiplicativeExpr")]
-	private void multiplicativeExpr()
-	{
-		EnterRule_multiplicativeExpr();
-		EnterRule("multiplicativeExpr", 42);
-		TraceIn("multiplicativeExpr", 42);
-		try { DebugEnterRule(GrammarFileName, "multiplicativeExpr");
-		DebugLocation(314, 1);
-		try
-		{
-			// SqlGenerator.g:315:2: ( ^( STAR nestedExpr nestedExpr ) | ^( DIV nestedExpr nestedExprAfterMinusDiv ) )
-			int alt58=2;
-			try { DebugEnterDecision(58, false);
-			int LA58_1 = input.LA(1);
-
-			if ((LA58_1==STAR))
-			{
-				alt58 = 1;
-			}
-			else if ((LA58_1==DIV))
-			{
-				alt58 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 58, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(58); }
-			switch (alt58)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:315:4: ^( STAR nestedExpr nestedExpr )
-				{
-				DebugLocation(315, 4);
-				DebugLocation(315, 6);
-				Match(input,STAR,Follow._STAR_in_multiplicativeExpr1773); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(315, 11);
-				PushFollow(Follow._nestedExpr_in_multiplicativeExpr1775);
-				nestedExpr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(315, 22);
-				if (state.backtracking == 0)
-				{
-					 Out("*"); 
-				}
-				DebugLocation(315, 36);
-				PushFollow(Follow._nestedExpr_in_multiplicativeExpr1779);
-				nestedExpr();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:316:4: ^( DIV nestedExpr nestedExprAfterMinusDiv )
-				{
-				DebugLocation(316, 4);
-				DebugLocation(316, 6);
-				Match(input,DIV,Follow._DIV_in_multiplicativeExpr1786); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(316, 10);
-				PushFollow(Follow._nestedExpr_in_multiplicativeExpr1788);
-				nestedExpr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(316, 21);
-				if (state.backtracking == 0)
-				{
-					 Out("/"); 
-				}
-				DebugLocation(316, 35);
-				PushFollow(Follow._nestedExprAfterMinusDiv_in_multiplicativeExpr1792);
-				nestedExprAfterMinusDiv();
-				PopFollow();
-				if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("multiplicativeExpr", 42);
-			LeaveRule("multiplicativeExpr", 42);
-			LeaveRule_multiplicativeExpr();
-		}
-		DebugLocation(317, 1);
-		} finally { DebugExitRule(GrammarFileName, "multiplicativeExpr"); }
-		return;
-
-	}
-	// $ANTLR end "multiplicativeExpr"
-
-	partial void EnterRule_nestedExpr();
-	partial void LeaveRule_nestedExpr();
-	// $ANTLR start "nestedExpr"
-	// SqlGenerator.g:319:1: nestedExpr : ( ( additiveExpr )=> additiveExpr | ( bitwiseExpr )=> bitwiseExpr | expr );
-	[GrammarRule("nestedExpr")]
-	private void nestedExpr()
-	{
-		EnterRule_nestedExpr();
-		EnterRule("nestedExpr", 43);
-		TraceIn("nestedExpr", 43);
-		try { DebugEnterRule(GrammarFileName, "nestedExpr");
-		DebugLocation(319, 1);
-		try
-		{
-			// SqlGenerator.g:321:2: ( ( additiveExpr )=> additiveExpr | ( bitwiseExpr )=> bitwiseExpr | expr )
-			int alt59=3;
-			try { DebugEnterDecision(59, false);
-			switch (input.LA(1))
-			{
-			case PLUS:
-				{
-				int LA59_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred2_SqlGenerator_fragment)))
-				{
-					alt59 = 1;
-				}
-				else if ((true))
-				{
-					alt59 = 3;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 59, 1, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case MINUS:
-				{
-				int LA59_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred2_SqlGenerator_fragment)))
-				{
-					alt59 = 1;
-				}
-				else if ((true))
-				{
-					alt59 = 3;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 59, 2, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case BAND:
-				{
-				int LA59_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred3_SqlGenerator_fragment)))
-				{
-					alt59 = 2;
-				}
-				else if ((true))
-				{
-					alt59 = 3;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 59, 3, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case BOR:
-				{
-				int LA59_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred3_SqlGenerator_fragment)))
-				{
-					alt59 = 2;
-				}
-				else if ((true))
-				{
-					alt59 = 3;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 59, 4, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case BXOR:
-				{
-				int LA59_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred3_SqlGenerator_fragment)))
-				{
-					alt59 = 2;
-				}
-				else if ((true))
-				{
-					alt59 = 3;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 59, 5, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case BNOT:
-				{
-				int LA59_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred3_SqlGenerator_fragment)))
-				{
-					alt59 = 2;
-				}
-				else if ((true))
-				{
-					alt59 = 3;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 59, 6, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case AGGREGATE:
-			case ALL:
-			case ANY:
-			case CASE:
-			case CASE2:
-			case CONSTANT:
-			case COUNT:
-			case DIV:
-			case DOT:
-			case FALSE:
-			case IDENT:
-			case INDEX_OP:
-			case JAVA_CONSTANT:
-			case METHOD_CALL:
-			case NULL:
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case PARAM:
-			case QUOTED_String:
-			case SELECT:
-			case SOME:
-			case STAR:
-			case TRUE:
-			case UNARY_MINUS:
-			case UNION:
-			case VECTOR_EXPR:
-			case ALIAS_REF:
-			case NAMED_PARAM:
-			case RESULT_VARIABLE_REF:
-			case SQL_TOKEN:
-				{
-				alt59 = 3;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 59, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(59); }
-			switch (alt59)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:321:4: ( additiveExpr )=> additiveExpr
-				{
-				DebugLocation(321, 22);
-				if (state.backtracking == 0)
-				{
-					 Out("("); 
-				}
-				DebugLocation(321, 36);
-				PushFollow(Follow._additiveExpr_in_nestedExpr1814);
-				additiveExpr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(321, 49);
-				if (state.backtracking == 0)
-				{
-					 Out(")"); 
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:322:4: ( bitwiseExpr )=> bitwiseExpr
-				{
-				DebugLocation(322, 21);
-				if (state.backtracking == 0)
-				{
-					 Out("("); 
-				}
-				DebugLocation(322, 35);
-				PushFollow(Follow._bitwiseExpr_in_nestedExpr1829);
-				bitwiseExpr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(322, 47);
-				if (state.backtracking == 0)
-				{
-					 Out(")"); 
-				}
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:323:4: expr
-				{
-				DebugLocation(323, 4);
-				PushFollow(Follow._expr_in_nestedExpr1836);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("nestedExpr", 43);
-			LeaveRule("nestedExpr", 43);
-			LeaveRule_nestedExpr();
-		}
-		DebugLocation(324, 1);
-		} finally { DebugExitRule(GrammarFileName, "nestedExpr"); }
-		return;
-
-	}
-	// $ANTLR end "nestedExpr"
-
-	partial void EnterRule_nestedExprAfterMinusDiv();
-	partial void LeaveRule_nestedExprAfterMinusDiv();
-	// $ANTLR start "nestedExprAfterMinusDiv"
-	// SqlGenerator.g:326:1: nestedExprAfterMinusDiv : ( ( arithmeticExpr )=> arithmeticExpr | expr );
-	[GrammarRule("nestedExprAfterMinusDiv")]
-	private void nestedExprAfterMinusDiv()
-	{
-		EnterRule_nestedExprAfterMinusDiv();
-		EnterRule("nestedExprAfterMinusDiv", 44);
-		TraceIn("nestedExprAfterMinusDiv", 44);
-		try { DebugEnterRule(GrammarFileName, "nestedExprAfterMinusDiv");
-		DebugLocation(326, 1);
-		try
-		{
-			// SqlGenerator.g:328:2: ( ( arithmeticExpr )=> arithmeticExpr | expr )
-			int alt60=2;
-			try { DebugEnterDecision(60, false);
-			switch (input.LA(1))
-			{
-			case PLUS:
-				{
-				int LA60_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred4_SqlGenerator_fragment)))
-				{
-					alt60 = 1;
-				}
-				else if ((true))
-				{
-					alt60 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 60, 1, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case MINUS:
-				{
-				int LA60_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred4_SqlGenerator_fragment)))
-				{
-					alt60 = 1;
-				}
-				else if ((true))
-				{
-					alt60 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 60, 2, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case BAND:
-				{
-				int LA60_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred4_SqlGenerator_fragment)))
-				{
-					alt60 = 1;
-				}
-				else if ((true))
-				{
-					alt60 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 60, 3, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case BOR:
-				{
-				int LA60_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred4_SqlGenerator_fragment)))
-				{
-					alt60 = 1;
-				}
-				else if ((true))
-				{
-					alt60 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 60, 4, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case BXOR:
-				{
-				int LA60_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred4_SqlGenerator_fragment)))
-				{
-					alt60 = 1;
-				}
-				else if ((true))
-				{
-					alt60 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 60, 5, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case BNOT:
-				{
-				int LA60_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred4_SqlGenerator_fragment)))
-				{
-					alt60 = 1;
-				}
-				else if ((true))
-				{
-					alt60 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 60, 6, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case STAR:
-				{
-				int LA60_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred4_SqlGenerator_fragment)))
-				{
-					alt60 = 1;
-				}
-				else if ((true))
-				{
-					alt60 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 60, 7, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case DIV:
-				{
-				int LA60_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred4_SqlGenerator_fragment)))
-				{
-					alt60 = 1;
-				}
-				else if ((true))
-				{
-					alt60 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 60, 8, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case UNARY_MINUS:
-				{
-				int LA60_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred4_SqlGenerator_fragment)))
-				{
-					alt60 = 1;
-				}
-				else if ((true))
-				{
-					alt60 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 60, 9, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case CASE:
-				{
-				int LA60_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred4_SqlGenerator_fragment)))
-				{
-					alt60 = 1;
-				}
-				else if ((true))
-				{
-					alt60 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 60, 10, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case CASE2:
-				{
-				int LA60_2 = input.LA(2);
-
-				if ((EvaluatePredicate(synpred4_SqlGenerator_fragment)))
-				{
-					alt60 = 1;
-				}
-				else if ((true))
-				{
-					alt60 = 2;
-				}
-				else
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 60, 11, input, 2);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-				}
-				break;
-			case AGGREGATE:
-			case ALL:
-			case ANY:
-			case CONSTANT:
-			case COUNT:
-			case DOT:
-			case FALSE:
-			case IDENT:
-			case INDEX_OP:
-			case JAVA_CONSTANT:
-			case METHOD_CALL:
-			case NULL:
-			case NUM_DECIMAL:
-			case NUM_DOUBLE:
-			case NUM_FLOAT:
-			case NUM_INT:
-			case NUM_LONG:
-			case PARAM:
-			case QUOTED_String:
-			case SELECT:
-			case SOME:
-			case TRUE:
-			case UNION:
-			case VECTOR_EXPR:
-			case ALIAS_REF:
-			case NAMED_PARAM:
-			case RESULT_VARIABLE_REF:
-			case SQL_TOKEN:
-				{
-				alt60 = 2;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 60, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(60); }
-			switch (alt60)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:328:4: ( arithmeticExpr )=> arithmeticExpr
-				{
-				DebugLocation(328, 24);
-				if (state.backtracking == 0)
-				{
-					 Out("("); 
-				}
-				DebugLocation(328, 38);
-				PushFollow(Follow._arithmeticExpr_in_nestedExprAfterMinusDiv1858);
-				arithmeticExpr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(328, 53);
-				if (state.backtracking == 0)
-				{
-					 Out(")"); 
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:329:4: expr
-				{
-				DebugLocation(329, 4);
-				PushFollow(Follow._expr_in_nestedExprAfterMinusDiv1865);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("nestedExprAfterMinusDiv", 44);
-			LeaveRule("nestedExprAfterMinusDiv", 44);
-			LeaveRule_nestedExprAfterMinusDiv();
-		}
-		DebugLocation(330, 1);
-		} finally { DebugExitRule(GrammarFileName, "nestedExprAfterMinusDiv"); }
-		return;
-
-	}
-	// $ANTLR end "nestedExprAfterMinusDiv"
-
-	partial void EnterRule_caseExpr();
-	partial void LeaveRule_caseExpr();
-	// $ANTLR start "caseExpr"
-	// SqlGenerator.g:332:1: caseExpr : ( ^( CASE ( ^( WHEN booleanExpr[false] expr ) )+ ( ^( ELSE expr ) )? ) | ^( CASE2 expr ( ^( WHEN expr expr ) )+ ( ^( ELSE expr ) )? ) );
-	[GrammarRule("caseExpr")]
-	private void caseExpr()
-	{
-		EnterRule_caseExpr();
-		EnterRule("caseExpr", 45);
-		TraceIn("caseExpr", 45);
-		try { DebugEnterRule(GrammarFileName, "caseExpr");
-		DebugLocation(332, 1);
-		try
-		{
-			// SqlGenerator.g:333:2: ( ^( CASE ( ^( WHEN booleanExpr[false] expr ) )+ ( ^( ELSE expr ) )? ) | ^( CASE2 expr ( ^( WHEN expr expr ) )+ ( ^( ELSE expr ) )? ) )
-			int alt65=2;
-			try { DebugEnterDecision(65, false);
-			int LA65_1 = input.LA(1);
-
-			if ((LA65_1==CASE))
-			{
-				alt65 = 1;
-			}
-			else if ((LA65_1==CASE2))
-			{
-				alt65 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 65, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(65); }
-			switch (alt65)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:333:4: ^( CASE ( ^( WHEN booleanExpr[false] expr ) )+ ( ^( ELSE expr ) )? )
-				{
-				DebugLocation(333, 4);
-				DebugLocation(333, 6);
-				Match(input,CASE,Follow._CASE_in_caseExpr1877); if (state.failed) return;
-
-				DebugLocation(333, 11);
-				if (state.backtracking == 0)
-				{
-					 Out("case"); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(334, 3);
-				// SqlGenerator.g:334:3: ( ^( WHEN booleanExpr[false] expr ) )+
-				int cnt61=0;
-				try { DebugEnterSubRule(61);
-				while (true)
-				{
-					int alt61=2;
-					try { DebugEnterDecision(61, false);
-					int LA61_1 = input.LA(1);
-
-					if ((LA61_1==WHEN))
-					{
-						alt61 = 1;
-					}
-
-
-					} finally { DebugExitDecision(61); }
-					switch (alt61)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// SqlGenerator.g:334:5: ^( WHEN booleanExpr[false] expr )
-						{
-						DebugLocation(334, 5);
-						DebugLocation(334, 7);
-						Match(input,WHEN,Follow._WHEN_in_caseExpr1887); if (state.failed) return;
-
-						DebugLocation(334, 12);
-						if (state.backtracking == 0)
-						{
-							 Out( " when "); 
-						}
-
-						Match(input, TokenTypes.Down, null); if (state.failed) return;
-						DebugLocation(334, 32);
-						PushFollow(Follow._booleanExpr_in_caseExpr1891);
-						booleanExpr(false);
-						PopFollow();
-						if (state.failed) return;
-						DebugLocation(334, 51);
-						if (state.backtracking == 0)
-						{
-							 Out(" then "); 
-						}
-						DebugLocation(334, 70);
-						PushFollow(Follow._expr_in_caseExpr1896);
-						expr();
-						PopFollow();
-						if (state.failed) return;
-
-						Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-						}
-						break;
-
-					default:
-						if (cnt61 >= 1)
-							goto loop61;
-
-						if (state.backtracking>0) {state.failed=true; return;}
-						EarlyExitException eee61 = new EarlyExitException( 61, input );
-						DebugRecognitionException(eee61);
-						throw eee61;
-					}
-					cnt61++;
-				}
-				loop61:
-					;
-
-				} finally { DebugExitSubRule(61); }
-
-				DebugLocation(335, 3);
-				// SqlGenerator.g:335:3: ( ^( ELSE expr ) )?
-				int alt62=2;
-				try { DebugEnterSubRule(62);
-				try { DebugEnterDecision(62, false);
-				int LA62_1 = input.LA(1);
-
-				if ((LA62_1==ELSE))
-				{
-					alt62 = 1;
-				}
-				} finally { DebugExitDecision(62); }
-				switch (alt62)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// SqlGenerator.g:335:5: ^( ELSE expr )
-					{
-					DebugLocation(335, 5);
-					DebugLocation(335, 7);
-					Match(input,ELSE,Follow._ELSE_in_caseExpr1908); if (state.failed) return;
-
-					DebugLocation(335, 12);
-					if (state.backtracking == 0)
-					{
-						 Out(" else "); 
-					}
-
-					Match(input, TokenTypes.Down, null); if (state.failed) return;
-					DebugLocation(335, 31);
-					PushFollow(Follow._expr_in_caseExpr1912);
-					expr();
-					PopFollow();
-					if (state.failed) return;
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(62); }
-
-				DebugLocation(336, 3);
-				if (state.backtracking == 0)
-				{
-					 Out(" end"); 
-				}
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:337:4: ^( CASE2 expr ( ^( WHEN expr expr ) )+ ( ^( ELSE expr ) )? )
-				{
-				DebugLocation(337, 4);
-				DebugLocation(337, 6);
-				Match(input,CASE2,Follow._CASE2_in_caseExpr1928); if (state.failed) return;
-
-				DebugLocation(337, 12);
-				if (state.backtracking == 0)
-				{
-					 Out("case "); 
-				}
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(337, 30);
-				PushFollow(Follow._expr_in_caseExpr1932);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-				DebugLocation(338, 3);
-				// SqlGenerator.g:338:3: ( ^( WHEN expr expr ) )+
-				int cnt63=0;
-				try { DebugEnterSubRule(63);
-				while (true)
-				{
-					int alt63=2;
-					try { DebugEnterDecision(63, false);
-					int LA63_1 = input.LA(1);
-
-					if ((LA63_1==WHEN))
-					{
-						alt63 = 1;
-					}
-
-
-					} finally { DebugExitDecision(63); }
-					switch (alt63)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// SqlGenerator.g:338:5: ^( WHEN expr expr )
-						{
-						DebugLocation(338, 5);
-						DebugLocation(338, 7);
-						Match(input,WHEN,Follow._WHEN_in_caseExpr1939); if (state.failed) return;
-
-						DebugLocation(338, 12);
-						if (state.backtracking == 0)
-						{
-							 Out( " when "); 
-						}
-
-						Match(input, TokenTypes.Down, null); if (state.failed) return;
-						DebugLocation(338, 32);
-						PushFollow(Follow._expr_in_caseExpr1943);
-						expr();
-						PopFollow();
-						if (state.failed) return;
-						DebugLocation(338, 37);
-						if (state.backtracking == 0)
-						{
-							 Out(" then "); 
-						}
-						DebugLocation(338, 56);
-						PushFollow(Follow._expr_in_caseExpr1947);
-						expr();
-						PopFollow();
-						if (state.failed) return;
-
-						Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-						}
-						break;
-
-					default:
-						if (cnt63 >= 1)
-							goto loop63;
-
-						if (state.backtracking>0) {state.failed=true; return;}
-						EarlyExitException eee63 = new EarlyExitException( 63, input );
-						DebugRecognitionException(eee63);
-						throw eee63;
-					}
-					cnt63++;
-				}
-				loop63:
-					;
-
-				} finally { DebugExitSubRule(63); }
-
-				DebugLocation(339, 3);
-				// SqlGenerator.g:339:3: ( ^( ELSE expr ) )?
-				int alt64=2;
-				try { DebugEnterSubRule(64);
-				try { DebugEnterDecision(64, false);
-				int LA64_1 = input.LA(1);
-
-				if ((LA64_1==ELSE))
-				{
-					alt64 = 1;
-				}
-				} finally { DebugExitDecision(64); }
-				switch (alt64)
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// SqlGenerator.g:339:5: ^( ELSE expr )
-					{
-					DebugLocation(339, 5);
-					DebugLocation(339, 7);
-					Match(input,ELSE,Follow._ELSE_in_caseExpr1959); if (state.failed) return;
-
-					DebugLocation(339, 12);
-					if (state.backtracking == 0)
-					{
-						 Out(" else "); 
-					}
-
-					Match(input, TokenTypes.Down, null); if (state.failed) return;
-					DebugLocation(339, 31);
-					PushFollow(Follow._expr_in_caseExpr1963);
-					expr();
-					PopFollow();
-					if (state.failed) return;
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-					}
-					break;
-
-				}
-				} finally { DebugExitSubRule(64); }
-
-				DebugLocation(340, 3);
-				if (state.backtracking == 0)
-				{
-					 Out(" end"); 
-				}
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("caseExpr", 45);
-			LeaveRule("caseExpr", 45);
-			LeaveRule_caseExpr();
-		}
-		DebugLocation(341, 1);
-		} finally { DebugExitRule(GrammarFileName, "caseExpr"); }
-		return;
-
-	}
-	// $ANTLR end "caseExpr"
-
-	partial void EnterRule_aggregate();
-	partial void LeaveRule_aggregate();
-	// $ANTLR start "aggregate"
-	// SqlGenerator.g:343:1: aggregate : ^(a= AGGREGATE expr ) ;
-	[GrammarRule("aggregate")]
-	private void aggregate()
-	{
-		EnterRule_aggregate();
-		EnterRule("aggregate", 46);
-		TraceIn("aggregate", 46);
-		IASTNode a = default(IASTNode);
-
-		try { DebugEnterRule(GrammarFileName, "aggregate");
-		DebugLocation(343, 1);
-		try
-		{
-			// SqlGenerator.g:344:2: ( ^(a= AGGREGATE expr ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:344:4: ^(a= AGGREGATE expr )
-			{
-			DebugLocation(344, 4);
-			DebugLocation(344, 7);
-			a=(IASTNode)Match(input,AGGREGATE,Follow._AGGREGATE_in_aggregate1987); if (state.failed) return;
-
-			DebugLocation(344, 18);
-			if (state.backtracking == 0)
-			{
-				 Out(a); Out("("); 
-			}
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(344, 41);
-			PushFollow(Follow._expr_in_aggregate1992);
-			expr();
-			PopFollow();
-			if (state.failed) return;
-			DebugLocation(344, 46);
-			if (state.backtracking == 0)
-			{
-				 Out(")"); 
-			}
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("aggregate", 46);
-			LeaveRule("aggregate", 46);
-			LeaveRule_aggregate();
-		}
-		DebugLocation(345, 1);
-		} finally { DebugExitRule(GrammarFileName, "aggregate"); }
-		return;
-
-	}
-	// $ANTLR end "aggregate"
-
-	partial void EnterRule_methodCall();
-	partial void LeaveRule_methodCall();
-	// $ANTLR start "methodCall"
-	// SqlGenerator.g:348:1: methodCall : ^(m= METHOD_CALL i= METHOD_NAME ( ^( EXPR_LIST ( arguments )? ) )? ) ;
-	[GrammarRule("methodCall")]
-	private void methodCall()
-	{
-		EnterRule_methodCall();
-		EnterRule("methodCall", 47);
-		TraceIn("methodCall", 47);
-		IASTNode m = default(IASTNode);
-		IASTNode i = default(IASTNode);
-
-		try { DebugEnterRule(GrammarFileName, "methodCall");
-		DebugLocation(348, 1);
-		try
-		{
-			// SqlGenerator.g:349:2: ( ^(m= METHOD_CALL i= METHOD_NAME ( ^( EXPR_LIST ( arguments )? ) )? ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:349:4: ^(m= METHOD_CALL i= METHOD_NAME ( ^( EXPR_LIST ( arguments )? ) )? )
-			{
-			DebugLocation(349, 4);
-			DebugLocation(349, 7);
-			m=(IASTNode)Match(input,METHOD_CALL,Follow._METHOD_CALL_in_methodCall2011); if (state.failed) return;
-
-			Match(input, TokenTypes.Down, null); if (state.failed) return;
-			DebugLocation(349, 21);
-			i=(IASTNode)Match(input,METHOD_NAME,Follow._METHOD_NAME_in_methodCall2015); if (state.failed) return;
-			DebugLocation(349, 34);
-			if (state.backtracking == 0)
-			{
-				 BeginFunctionTemplate(m,i); 
-			}
-			DebugLocation(350, 3);
-			// SqlGenerator.g:350:3: ( ^( EXPR_LIST ( arguments )? ) )?
-			int alt67=2;
-			try { DebugEnterSubRule(67);
-			try { DebugEnterDecision(67, false);
-			int LA67_1 = input.LA(1);
-
-			if ((LA67_1==EXPR_LIST))
-			{
-				alt67 = 1;
-			}
-			} finally { DebugExitDecision(67); }
-			switch (alt67)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:350:5: ^( EXPR_LIST ( arguments )? )
-				{
-				DebugLocation(350, 5);
-				DebugLocation(350, 7);
-				Match(input,EXPR_LIST,Follow._EXPR_LIST_in_methodCall2024); if (state.failed) return;
-
-				if (input.LA(1) == TokenTypes.Down)
-				{
-					Match(input, TokenTypes.Down, null); if (state.failed) return;
-					DebugLocation(350, 17);
-					// SqlGenerator.g:350:17: ( arguments )?
-					int alt66=2;
-					try { DebugEnterSubRule(66);
-					try { DebugEnterDecision(66, false);
-					int LA66_1 = input.LA(1);
-
-					if ((LA66_1==AGGREGATE||LA66_1==ALL||LA66_1==ANY||(LA66_1>=BAND && LA66_1<=BOR)||(LA66_1>=BXOR && LA66_1<=CASE2)||LA66_1==CONSTANT||LA66_1==COUNT||(LA66_1>=DIV && LA66_1<=DOT)||LA66_1==EQ||LA66_1==EXISTS||LA66_1==FALSE||LA66_1==GE||LA66_1==GT||LA66_1==IDENT||(LA66_1>=IN && LA66_1<=INDEX_OP)||(LA66_1>=IS_NOT_NULL && LA66_1<=JAVA_CONSTANT)||LA66_1==LE||LA66_1==LIKE||LA66_1==LT||LA66_1==METHOD_CALL||(LA66_1>=MINUS && LA66_1<=NE)||(LA66_1>=NOT_BETWEEN && LA66_1<=NUM_LONG)||(LA66_1>=PARAM && LA66_1<=PLUS)||LA66_1==QUOTED_String||LA66_1==SELECT||LA66_1==SOME||LA66_1==STAR||(LA66_1>=TRUE && LA66_1<=UNARY_MINUS)||LA66_1==UNION||LA66_1==VECTOR_EXPR||LA66_1==ALIAS_REF||LA66_1==NAMED_PARAM||LA66_1==RESULT_VARIABLE_REF||LA66_1==SQL_TOKEN))
-					{
-						alt66 = 1;
-					}
-					} finally { DebugExitDecision(66); }
-					switch (alt66)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// SqlGenerator.g:350:18: arguments
-						{
-						DebugLocation(350, 18);
-						PushFollow(Follow._arguments_in_methodCall2027);
-						arguments();
-						PopFollow();
-						if (state.failed) return;
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(66); }
-
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return;
-				}
-
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(67); }
-
-			DebugLocation(351, 3);
-			if (state.backtracking == 0)
-			{
-				 EndFunctionTemplate(m); 
-			}
-
-			Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("methodCall", 47);
-			LeaveRule("methodCall", 47);
-			LeaveRule_methodCall();
-		}
-		DebugLocation(352, 1);
-		} finally { DebugExitRule(GrammarFileName, "methodCall"); }
-		return;
-
-	}
-	// $ANTLR end "methodCall"
-
-	partial void EnterRule_arguments();
-	partial void LeaveRule_arguments();
-	// $ANTLR start "arguments"
-	// SqlGenerator.g:354:1: arguments : ( expr | comparisonExpr[true] ) ( ( expr | comparisonExpr[true] ) )* ;
-	[GrammarRule("arguments")]
-	private void arguments()
-	{
-		EnterRule_arguments();
-		EnterRule("arguments", 48);
-		TraceIn("arguments", 48);
-		try { DebugEnterRule(GrammarFileName, "arguments");
-		DebugLocation(354, 1);
-		try
-		{
-			// SqlGenerator.g:355:2: ( ( expr | comparisonExpr[true] ) ( ( expr | comparisonExpr[true] ) )* )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:355:4: ( expr | comparisonExpr[true] ) ( ( expr | comparisonExpr[true] ) )*
-			{
-			DebugLocation(355, 4);
-			// SqlGenerator.g:355:4: ( expr | comparisonExpr[true] )
-			int alt68=2;
-			try { DebugEnterSubRule(68);
-			try { DebugEnterDecision(68, false);
-			int LA68_1 = input.LA(1);
-
-			if ((LA68_1==AGGREGATE||LA68_1==ALL||LA68_1==ANY||LA68_1==BAND||(LA68_1>=BNOT && LA68_1<=BOR)||(LA68_1>=BXOR && LA68_1<=CASE2)||LA68_1==CONSTANT||LA68_1==COUNT||(LA68_1>=DIV && LA68_1<=DOT)||LA68_1==FALSE||LA68_1==IDENT||LA68_1==INDEX_OP||LA68_1==JAVA_CONSTANT||LA68_1==METHOD_CALL||LA68_1==MINUS||(LA68_1>=NULL && LA68_1<=NUM_LONG)||(LA68_1>=PARAM && LA68_1<=PLUS)||LA68_1==QUOTED_String||LA68_1==SELECT||LA68_1==SOME||LA68_1==STAR||(LA68_1>=TRUE && LA68_1<=UNARY_MINUS)||LA68_1==UNION||LA68_1==VECTOR_EXPR||LA68_1==ALIAS_REF||LA68_1==NAMED_PARAM||LA68_1==RESULT_VARIABLE_REF||LA68_1==SQL_TOKEN))
-			{
-				alt68 = 1;
-			}
-			else if ((LA68_1==BETWEEN||LA68_1==EQ||LA68_1==EXISTS||LA68_1==GE||LA68_1==GT||LA68_1==IN||(LA68_1>=IS_NOT_NULL && LA68_1<=IS_NULL)||LA68_1==LE||LA68_1==LIKE||LA68_1==LT||LA68_1==NE||(LA68_1>=NOT_BETWEEN && LA68_1<=NOT_LIKE)))
-			{
-				alt68 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 68, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(68); }
-			switch (alt68)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:355:5: expr
-				{
-				DebugLocation(355, 5);
-				PushFollow(Follow._expr_in_arguments2052);
-				expr();
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:355:12: comparisonExpr[true]
-				{
-				DebugLocation(355, 12);
-				PushFollow(Follow._comparisonExpr_in_arguments2056);
-				comparisonExpr(true);
-				PopFollow();
-				if (state.failed) return;
-
-				}
-				break;
-
-			}
-			} finally { DebugExitSubRule(68); }
-
-			DebugLocation(355, 34);
-			// SqlGenerator.g:355:34: ( ( expr | comparisonExpr[true] ) )*
-			try { DebugEnterSubRule(70);
-			while (true)
-			{
-				int alt70=2;
-				try { DebugEnterDecision(70, false);
-				int LA70_1 = input.LA(1);
-
-				if ((LA70_1==AGGREGATE||LA70_1==ALL||LA70_1==ANY||(LA70_1>=BAND && LA70_1<=BOR)||(LA70_1>=BXOR && LA70_1<=CASE2)||LA70_1==CONSTANT||LA70_1==COUNT||(LA70_1>=DIV && LA70_1<=DOT)||LA70_1==EQ||LA70_1==EXISTS||LA70_1==FALSE||LA70_1==GE||LA70_1==GT||LA70_1==IDENT||(LA70_1>=IN && LA70_1<=INDEX_OP)||(LA70_1>=IS_NOT_NULL && LA70_1<=JAVA_CONSTANT)||LA70_1==LE||LA70_1==LIKE||LA70_1==LT||LA70_1==METHOD_CALL||(LA70_1>=MINUS && LA70_1<=NE)||(LA70_1>=NOT_BETWEEN && LA70_1<=NUM_LONG)||(LA70_1>=PARAM && LA70_1<=PLUS)||LA70_1==QUOTED_String||LA70_1==SELECT||LA70_1==SOME||LA70_1==STAR||(LA70_1>=TRUE && LA70_1<=UNARY_MINUS)||LA70_1==UNION||LA70_1==VECTOR_EXPR||LA70_1==ALIAS_REF||LA70_1==NAMED_PARAM||LA70_1==RESULT_VARIABLE_REF||LA70_1==SQL_TOKEN))
-				{
-					alt70 = 1;
-				}
-
-
-				} finally { DebugExitDecision(70); }
-				switch ( alt70 )
-				{
-				case 1:
-					DebugEnterAlt(1);
-					// SqlGenerator.g:355:36: ( expr | comparisonExpr[true] )
-					{
-					DebugLocation(355, 36);
-					if (state.backtracking == 0)
-					{
-						 CommaBetweenParameters(", "); 
-					}
-					DebugLocation(355, 70);
-					// SqlGenerator.g:355:70: ( expr | comparisonExpr[true] )
-					int alt69=2;
-					try { DebugEnterSubRule(69);
-					try { DebugEnterDecision(69, false);
-					int LA69_1 = input.LA(1);
-
-					if ((LA69_1==AGGREGATE||LA69_1==ALL||LA69_1==ANY||LA69_1==BAND||(LA69_1>=BNOT && LA69_1<=BOR)||(LA69_1>=BXOR && LA69_1<=CASE2)||LA69_1==CONSTANT||LA69_1==COUNT||(LA69_1>=DIV && LA69_1<=DOT)||LA69_1==FALSE||LA69_1==IDENT||LA69_1==INDEX_OP||LA69_1==JAVA_CONSTANT||LA69_1==METHOD_CALL||LA69_1==MINUS||(LA69_1>=NULL && LA69_1<=NUM_LONG)||(LA69_1>=PARAM && LA69_1<=PLUS)||LA69_1==QUOTED_String||LA69_1==SELECT||LA69_1==SOME||LA69_1==STAR||(LA69_1>=TRUE && LA69_1<=UNARY_MINUS)||LA69_1==UNION||LA69_1==VECTOR_EXPR||LA69_1==ALIAS_REF||LA69_1==NAMED_PARAM||LA69_1==RESULT_VARIABLE_REF||LA69_1==SQL_TOKEN))
-					{
-						alt69 = 1;
-					}
-					else if ((LA69_1==BETWEEN||LA69_1==EQ||LA69_1==EXISTS||LA69_1==GE||LA69_1==GT||LA69_1==IN||(LA69_1>=IS_NOT_NULL && LA69_1<=IS_NULL)||LA69_1==LE||LA69_1==LIKE||LA69_1==LT||LA69_1==NE||(LA69_1>=NOT_BETWEEN && LA69_1<=NOT_LIKE)))
-					{
-						alt69 = 2;
-					}
-					else
-					{
-						if (state.backtracking>0) {state.failed=true; return;}
-						NoViableAltException nvae = new NoViableAltException("", 69, 0, input, 1);
-						DebugRecognitionException(nvae);
-						throw nvae;
-					}
-					} finally { DebugExitDecision(69); }
-					switch (alt69)
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// SqlGenerator.g:355:71: expr
-						{
-						DebugLocation(355, 71);
-						PushFollow(Follow._expr_in_arguments2065);
-						expr();
-						PopFollow();
-						if (state.failed) return;
-
-						}
-						break;
-					case 2:
-						DebugEnterAlt(2);
-						// SqlGenerator.g:355:78: comparisonExpr[true]
-						{
-						DebugLocation(355, 78);
-						PushFollow(Follow._comparisonExpr_in_arguments2069);
-						comparisonExpr(true);
-						PopFollow();
-						if (state.failed) return;
-
-						}
-						break;
-
-					}
-					} finally { DebugExitSubRule(69); }
-
-
-					}
-					break;
-
-				default:
-					goto loop70;
-				}
-			}
-
-			loop70:
-				;
-
-			} finally { DebugExitSubRule(70); }
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("arguments", 48);
-			LeaveRule("arguments", 48);
-			LeaveRule_arguments();
-		}
-		DebugLocation(356, 1);
-		} finally { DebugExitRule(GrammarFileName, "arguments"); }
-		return;
-
-	}
-	// $ANTLR end "arguments"
-
-	partial void EnterRule_parameter();
-	partial void LeaveRule_parameter();
-	// $ANTLR start "parameter"
-	// SqlGenerator.g:358:1: parameter : (n= NAMED_PARAM |p= PARAM );
-	[GrammarRule("parameter")]
-	private void parameter()
-	{
-		EnterRule_parameter();
-		EnterRule("parameter", 49);
-		TraceIn("parameter", 49);
-		IASTNode n = default(IASTNode);
-		IASTNode p = default(IASTNode);
-
-		try { DebugEnterRule(GrammarFileName, "parameter");
-		DebugLocation(358, 1);
-		try
-		{
-			// SqlGenerator.g:359:2: (n= NAMED_PARAM |p= PARAM )
-			int alt71=2;
-			try { DebugEnterDecision(71, false);
-			int LA71_1 = input.LA(1);
-
-			if ((LA71_1==NAMED_PARAM))
-			{
-				alt71 = 1;
-			}
-			else if ((LA71_1==PARAM))
-			{
-				alt71 = 2;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return;}
-				NoViableAltException nvae = new NoViableAltException("", 71, 0, input, 1);
-				DebugRecognitionException(nvae);
-				throw nvae;
-			}
-			} finally { DebugExitDecision(71); }
-			switch (alt71)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:359:4: n= NAMED_PARAM
-				{
-				DebugLocation(359, 5);
-				n=(IASTNode)Match(input,NAMED_PARAM,Follow._NAMED_PARAM_in_parameter2087); if (state.failed) return;
-				DebugLocation(359, 18);
-				if (state.backtracking == 0)
-				{
-					 Out(n); 
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:360:4: p= PARAM
-				{
-				DebugLocation(360, 5);
-				p=(IASTNode)Match(input,PARAM,Follow._PARAM_in_parameter2096); if (state.failed) return;
-				DebugLocation(360, 12);
-				if (state.backtracking == 0)
-				{
-					 Out(p); 
-				}
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("parameter", 49);
-			LeaveRule("parameter", 49);
-			LeaveRule_parameter();
-		}
-		DebugLocation(361, 1);
-		} finally { DebugExitRule(GrammarFileName, "parameter"); }
-		return;
-
-	}
-	// $ANTLR end "parameter"
-
-	partial void EnterRule_limitValue();
-	partial void LeaveRule_limitValue();
-	// $ANTLR start "limitValue"
-	// SqlGenerator.g:363:1: limitValue : ( NUM_INT | NAMED_PARAM | PARAM );
-	[GrammarRule("limitValue")]
-	private TreeRuleReturnScope<IASTNode> limitValue()
-	{
-		EnterRule_limitValue();
-		EnterRule("limitValue", 50);
-		TraceIn("limitValue", 50);
-		TreeRuleReturnScope<IASTNode> retval = new TreeRuleReturnScope<IASTNode>();
-		retval.Start = (IASTNode)input.LT(1);
-
-		try { DebugEnterRule(GrammarFileName, "limitValue");
-		DebugLocation(363, 1);
-		try
-		{
-			// SqlGenerator.g:364:2: ( NUM_INT | NAMED_PARAM | PARAM )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:
-			{
-			DebugLocation(364, 2);
-			if (input.LA(1)==NUM_INT||input.LA(1)==PARAM||input.LA(1)==NAMED_PARAM)
-			{
-				input.Consume();
-				state.errorRecovery=false;state.failed=false;
-			}
-			else
-			{
-				if (state.backtracking>0) {state.failed=true; return retval;}
-				MismatchedSetException mse = new MismatchedSetException(null,input);
-				DebugRecognitionException(mse);
-				throw mse;
-			}
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("limitValue", 50);
-			LeaveRule("limitValue", 50);
-			LeaveRule_limitValue();
-		}
-		DebugLocation(367, 1);
-		} finally { DebugExitRule(GrammarFileName, "limitValue"); }
-		return retval;
-
-	}
-	// $ANTLR end "limitValue"
-
-	partial void EnterRule_addrExpr();
-	partial void LeaveRule_addrExpr();
-	// $ANTLR start "addrExpr"
-	// SqlGenerator.g:369:1: addrExpr : ( ^(r= DOT . . ) |i= ALIAS_REF | ^(j= INDEX_OP ( . )* ) |v= RESULT_VARIABLE_REF );
-	[GrammarRule("addrExpr")]
-	private void addrExpr()
-	{
-		EnterRule_addrExpr();
-		EnterRule("addrExpr", 51);
-		TraceIn("addrExpr", 51);
-		IASTNode r = default(IASTNode);
-		IASTNode i = default(IASTNode);
-		IASTNode j = default(IASTNode);
-		IASTNode v = default(IASTNode);
-
-		try { DebugEnterRule(GrammarFileName, "addrExpr");
-		DebugLocation(369, 1);
-		try
-		{
-			// SqlGenerator.g:370:2: ( ^(r= DOT . . ) |i= ALIAS_REF | ^(j= INDEX_OP ( . )* ) |v= RESULT_VARIABLE_REF )
-			int alt73=4;
-			try { DebugEnterDecision(73, false);
-			switch (input.LA(1))
-			{
-			case DOT:
-				{
-				alt73 = 1;
-				}
-				break;
-			case ALIAS_REF:
-				{
-				alt73 = 2;
-				}
-				break;
-			case INDEX_OP:
-				{
-				alt73 = 3;
-				}
-				break;
-			case RESULT_VARIABLE_REF:
-				{
-				alt73 = 4;
-				}
-				break;
-			default:
-				{
-					if (state.backtracking>0) {state.failed=true; return;}
-					NoViableAltException nvae = new NoViableAltException("", 73, 0, input, 1);
-					DebugRecognitionException(nvae);
-					throw nvae;
-				}
-			}
-
-			} finally { DebugExitDecision(73); }
-			switch (alt73)
-			{
-			case 1:
-				DebugEnterAlt(1);
-				// SqlGenerator.g:370:4: ^(r= DOT . . )
-				{
-				DebugLocation(370, 4);
-				DebugLocation(370, 7);
-				r=(IASTNode)Match(input,DOT,Follow._DOT_in_addrExpr2133); if (state.failed) return;
-
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(370, 12);
-				MatchAny(input); if (state.failed) return;
-				DebugLocation(370, 14);
-				MatchAny(input); if (state.failed) return;
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-
-				DebugLocation(370, 17);
-				if (state.backtracking == 0)
-				{
-					 Out(r); 
-				}
-
-				}
-				break;
-			case 2:
-				DebugEnterAlt(2);
-				// SqlGenerator.g:371:4: i= ALIAS_REF
-				{
-				DebugLocation(371, 5);
-				i=(IASTNode)Match(input,ALIAS_REF,Follow._ALIAS_REF_in_addrExpr2147); if (state.failed) return;
-				DebugLocation(371, 16);
-				if (state.backtracking == 0)
-				{
-					 Out(i); 
-				}
-
-				}
-				break;
-			case 3:
-				DebugEnterAlt(3);
-				// SqlGenerator.g:372:4: ^(j= INDEX_OP ( . )* )
-				{
-				DebugLocation(372, 4);
-				DebugLocation(372, 7);
-				j=(IASTNode)Match(input,INDEX_OP,Follow._INDEX_OP_in_addrExpr2157); if (state.failed) return;
-
-				if (input.LA(1) == TokenTypes.Down)
-				{
-					Match(input, TokenTypes.Down, null); if (state.failed) return;
-					DebugLocation(372, 17);
-					// SqlGenerator.g:372:17: ( . )*
-					try { DebugEnterSubRule(72);
-					while (true)
-					{
-						int alt72=2;
-						try { DebugEnterDecision(72, false);
-						int LA72_1 = input.LA(1);
-
-						if (((LA72_1>=AGGREGATE && LA72_1<=THETA_JOINS)))
-						{
-							alt72 = 1;
-						}
-						else if ((LA72_1==UP))
-						{
-							alt72 = 2;
-						}
-
-
-						} finally { DebugExitDecision(72); }
-						switch ( alt72 )
-						{
-						case 1:
-							DebugEnterAlt(1);
-							// SqlGenerator.g:372:17: .
-							{
-							DebugLocation(372, 17);
-							MatchAny(input); if (state.failed) return;
-
-							}
-							break;
-
-						default:
-							goto loop72;
-						}
-					}
-
-					loop72:
-						;
-
-					} finally { DebugExitSubRule(72); }
-
-
-					Match(input, TokenTypes.Up, null); if (state.failed) return;
-				}
-
-				DebugLocation(372, 21);
-				if (state.backtracking == 0)
-				{
-					 Out(j); 
-				}
-
-				}
-				break;
-			case 4:
-				DebugEnterAlt(4);
-				// SqlGenerator.g:373:4: v= RESULT_VARIABLE_REF
-				{
-				DebugLocation(373, 5);
-				v=(IASTNode)Match(input,RESULT_VARIABLE_REF,Follow._RESULT_VARIABLE_REF_in_addrExpr2170); if (state.failed) return;
-				DebugLocation(373, 26);
-				if (state.backtracking == 0)
-				{
-					 Out(v); 
-				}
-
-				}
-				break;
-
-			}
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("addrExpr", 51);
-			LeaveRule("addrExpr", 51);
-			LeaveRule_addrExpr();
-		}
-		DebugLocation(374, 1);
-		} finally { DebugExitRule(GrammarFileName, "addrExpr"); }
-		return;
-
-	}
-	// $ANTLR end "addrExpr"
-
-	partial void EnterRule_sqlToken();
-	partial void LeaveRule_sqlToken();
-	// $ANTLR start "sqlToken"
-	// SqlGenerator.g:376:1: sqlToken : ^(t= SQL_TOKEN ( . )* ) ;
-	[GrammarRule("sqlToken")]
-	private void sqlToken()
-	{
-		EnterRule_sqlToken();
-		EnterRule("sqlToken", 52);
-		TraceIn("sqlToken", 52);
-		IASTNode t = default(IASTNode);
-
-		try { DebugEnterRule(GrammarFileName, "sqlToken");
-		DebugLocation(376, 1);
-		try
-		{
-			// SqlGenerator.g:377:2: ( ^(t= SQL_TOKEN ( . )* ) )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:377:4: ^(t= SQL_TOKEN ( . )* )
-			{
-			DebugLocation(377, 4);
-			DebugLocation(377, 7);
-			t=(IASTNode)Match(input,SQL_TOKEN,Follow._SQL_TOKEN_in_sqlToken2186); if (state.failed) return;
-
-			DebugLocation(377, 18);
-			if (state.backtracking == 0)
-			{
-				 Out(t); 
-			}
-
-			if (input.LA(1) == TokenTypes.Down)
-			{
-				Match(input, TokenTypes.Down, null); if (state.failed) return;
-				DebugLocation(377, 30);
-				// SqlGenerator.g:377:30: ( . )*
-				try { DebugEnterSubRule(74);
-				while (true)
-				{
-					int alt74=2;
-					try { DebugEnterDecision(74, false);
-					int LA74_1 = input.LA(1);
-
-					if (((LA74_1>=AGGREGATE && LA74_1<=THETA_JOINS)))
-					{
-						alt74 = 1;
-					}
-					else if ((LA74_1==UP))
-					{
-						alt74 = 2;
-					}
-
-
-					} finally { DebugExitDecision(74); }
-					switch ( alt74 )
-					{
-					case 1:
-						DebugEnterAlt(1);
-						// SqlGenerator.g:377:30: .
-						{
-						DebugLocation(377, 30);
-						MatchAny(input); if (state.failed) return;
-
-						}
-						break;
-
-					default:
-						goto loop74;
-					}
-				}
-
-				loop74:
-					;
-
-				} finally { DebugExitSubRule(74); }
-
-
-				Match(input, TokenTypes.Up, null); if (state.failed) return;
-			}
-
-
-			}
-
-		}
-		catch (RecognitionException re)
-		{
-			ReportError(re);
-			Recover(input,re);
-		}
-		finally
-		{
-			TraceOut("sqlToken", 52);
-			LeaveRule("sqlToken", 52);
-			LeaveRule_sqlToken();
-		}
-		DebugLocation(378, 1);
-		} finally { DebugExitRule(GrammarFileName, "sqlToken"); }
-		return;
-
-	}
-	// $ANTLR end "sqlToken"
-
-	partial void EnterRule_synpred1_SqlGenerator_fragment();
-	partial void LeaveRule_synpred1_SqlGenerator_fragment();
-
-	// $ANTLR start synpred1_SqlGenerator
-	private void synpred1_SqlGenerator_fragment()
-	{
-		EnterRule_synpred1_SqlGenerator_fragment();
-		EnterRule("synpred1_SqlGenerator_fragment", 53);
-		TraceIn("synpred1_SqlGenerator_fragment", 53);
-		try
-		{
-			// SqlGenerator.g:85:4: ( SQL_TOKEN )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:85:5: SQL_TOKEN
-			{
-			DebugLocation(85, 5);
-			Match(input,SQL_TOKEN,Follow._SQL_TOKEN_in_synpred1_SqlGenerator370); if (state.failed) return;
-
-			}
-
-		}
-		finally
-		{
-			TraceOut("synpred1_SqlGenerator_fragment", 53);
-			LeaveRule("synpred1_SqlGenerator_fragment", 53);
-			LeaveRule_synpred1_SqlGenerator_fragment();
-		}
-	}
-	// $ANTLR end synpred1_SqlGenerator
-
-	partial void EnterRule_synpred2_SqlGenerator_fragment();
-	partial void LeaveRule_synpred2_SqlGenerator_fragment();
-
-	// $ANTLR start synpred2_SqlGenerator
-	private void synpred2_SqlGenerator_fragment()
-	{
-		EnterRule_synpred2_SqlGenerator_fragment();
-		EnterRule("synpred2_SqlGenerator_fragment", 54);
-		TraceIn("synpred2_SqlGenerator_fragment", 54);
-		try
-		{
-			// SqlGenerator.g:321:4: ( additiveExpr )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:321:5: additiveExpr
-			{
-			DebugLocation(321, 5);
-			PushFollow(Follow._additiveExpr_in_synpred2_SqlGenerator1807);
-			additiveExpr();
-			PopFollow();
-			if (state.failed) return;
-
-			}
-
-		}
-		finally
-		{
-			TraceOut("synpred2_SqlGenerator_fragment", 54);
-			LeaveRule("synpred2_SqlGenerator_fragment", 54);
-			LeaveRule_synpred2_SqlGenerator_fragment();
-		}
-	}
-	// $ANTLR end synpred2_SqlGenerator
-
-	partial void EnterRule_synpred3_SqlGenerator_fragment();
-	partial void LeaveRule_synpred3_SqlGenerator_fragment();
-
-	// $ANTLR start synpred3_SqlGenerator
-	private void synpred3_SqlGenerator_fragment()
-	{
-		EnterRule_synpred3_SqlGenerator_fragment();
-		EnterRule("synpred3_SqlGenerator_fragment", 55);
-		TraceIn("synpred3_SqlGenerator_fragment", 55);
-		try
-		{
-			// SqlGenerator.g:322:4: ( bitwiseExpr )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:322:5: bitwiseExpr
-			{
-			DebugLocation(322, 5);
-			PushFollow(Follow._bitwiseExpr_in_synpred3_SqlGenerator1822);
-			bitwiseExpr();
-			PopFollow();
-			if (state.failed) return;
-
-			}
-
-		}
-		finally
-		{
-			TraceOut("synpred3_SqlGenerator_fragment", 55);
-			LeaveRule("synpred3_SqlGenerator_fragment", 55);
-			LeaveRule_synpred3_SqlGenerator_fragment();
-		}
-	}
-	// $ANTLR end synpred3_SqlGenerator
-
-	partial void EnterRule_synpred4_SqlGenerator_fragment();
-	partial void LeaveRule_synpred4_SqlGenerator_fragment();
-
-	// $ANTLR start synpred4_SqlGenerator
-	private void synpred4_SqlGenerator_fragment()
-	{
-		EnterRule_synpred4_SqlGenerator_fragment();
-		EnterRule("synpred4_SqlGenerator_fragment", 56);
-		TraceIn("synpred4_SqlGenerator_fragment", 56);
-		try
-		{
-			// SqlGenerator.g:328:4: ( arithmeticExpr )
-			DebugEnterAlt(1);
-			// SqlGenerator.g:328:5: arithmeticExpr
-			{
-			DebugLocation(328, 5);
-			PushFollow(Follow._arithmeticExpr_in_synpred4_SqlGenerator1851);
-			arithmeticExpr();
-			PopFollow();
-			if (state.failed) return;
-
-			}
-
-		}
-		finally
-		{
-			TraceOut("synpred4_SqlGenerator_fragment", 56);
-			LeaveRule("synpred4_SqlGenerator_fragment", 56);
-			LeaveRule_synpred4_SqlGenerator_fragment();
-		}
-	}
-	// $ANTLR end synpred4_SqlGenerator
-	#endregion Rules
-
-	#region Synpreds
-	private bool EvaluatePredicate(System.Action fragment)
-	{
-		bool success = false;
-		state.backtracking++;
-		try { DebugBeginBacktrack(state.backtracking);
-		int start = input.Mark();
-		try
-		{
-			fragment();
-		}
-		catch ( RecognitionException re )
-		{
-			System.Console.Error.WriteLine("impossible: "+re);
-		}
-		success = !state.failed;
-		input.Rewind(start);
-		} finally { DebugEndBacktrack(state.backtracking, success); }
-		state.backtracking--;
-		state.failed=false;
-		return success;
-	}
-	#endregion Synpreds
-
-
-	#region Follow sets
-	private static class Follow
-	{
-		public static readonly BitSet _selectStatement_in_statement59 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _updateStatement_in_statement64 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _deleteStatement_in_statement69 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _insertStatement_in_statement74 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _SELECT_in_selectStatement86 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _selectClause_in_selectStatement92 = new BitSet(new ulong[]{0x1000000000000UL});
-		public static readonly BitSet _from_in_selectStatement96 = new BitSet(new ulong[]{0x28000000000008UL,0x42000800000000UL,0x4UL});
-		public static readonly BitSet _WHERE_in_selectStatement103 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _whereExpr_in_selectStatement107 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _GROUP_in_selectStatement119 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _groupExprs_in_selectStatement123 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _HAVING_in_selectStatement135 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _booleanExpr_in_selectStatement139 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _ORDER_in_selectStatement151 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _orderExprs_in_selectStatement155 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _SKIP_in_selectStatement167 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _limitValue_in_selectStatement171 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _TAKE_in_selectStatement183 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _limitValue_in_selectStatement187 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _UPDATE_in_updateStatement214 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _FROM_in_updateStatement222 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _fromTable_in_updateStatement224 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _setClause_in_updateStatement230 = new BitSet(new ulong[]{0x8UL,0x0UL,0x4UL});
-		public static readonly BitSet _whereClause_in_updateStatement235 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _DELETE_in_deleteStatement254 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _from_in_deleteStatement260 = new BitSet(new ulong[]{0x8UL,0x0UL,0x4UL});
-		public static readonly BitSet _whereClause_in_deleteStatement265 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _INSERT_in_insertStatement282 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _INTO_in_insertStatement291 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _selectStatement_in_insertStatement301 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _SET_in_setClause321 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _comparisonExpr_in_setClause325 = new BitSet(new ulong[]{0x414024000002008UL,0x720A4CUL});
-		public static readonly BitSet _comparisonExpr_in_setClause332 = new BitSet(new ulong[]{0x414024000002008UL,0x720A4CUL});
-		public static readonly BitSet _WHERE_in_whereClause352 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _whereClauseExpr_in_whereClause356 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _conditionList_in_whereClauseExpr375 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _booleanExpr_in_whereClauseExpr380 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _expr_in_orderExprs396 = new BitSet(new ulong[]{0x8801003540ED552UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _orderDirection_in_orderExprs403 = new BitSet(new ulong[]{0x8801003140ED152UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _orderExprs_in_orderExprs413 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _expr_in_groupExprs428 = new BitSet(new ulong[]{0x8801003140ED152UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _groupExprs_in_groupExprs434 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _filters_in_whereExpr471 = new BitSet(new ulong[]{0x414024000002082UL,0x4007A4A4CUL,0xC00000UL});
-		public static readonly BitSet _thetaJoins_in_whereExpr479 = new BitSet(new ulong[]{0x414024000002082UL,0x4007A4A4CUL,0x400000UL});
-		public static readonly BitSet _booleanExpr_in_whereExpr490 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _thetaJoins_in_whereExpr500 = new BitSet(new ulong[]{0x414024000002082UL,0x4007A4A4CUL,0x400000UL});
-		public static readonly BitSet _booleanExpr_in_whereExpr508 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _booleanExpr_in_whereExpr519 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _FILTERS_in_filters532 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _conditionList_in_filters534 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _THETA_JOINS_in_thetaJoins548 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _conditionList_in_thetaJoins550 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _sqlToken_in_conditionList563 = new BitSet(new ulong[]{0x2UL,0x0UL,0x400000UL});
-		public static readonly BitSet _conditionList_in_conditionList569 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _SELECT_CLAUSE_in_selectClause584 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _distinctOrAll_in_selectClause587 = new BitSet(new ulong[]{0x8010031C0ED010UL,0x61044C01F014010UL,0x608080UL});
-		public static readonly BitSet _selectColumn_in_selectClause593 = new BitSet(new ulong[]{0x8010031C0ED018UL,0x61044C01F014010UL,0x608080UL});
-		public static readonly BitSet _selectExpr_in_selectColumn611 = new BitSet(new ulong[]{0x2UL,0x0UL,0x100000UL});
-		public static readonly BitSet _SELECT_COLUMNS_in_selectColumn616 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _selectAtom_in_selectExpr636 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _count_in_selectExpr643 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _CONSTRUCTOR_in_selectExpr649 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _set_in_selectExpr651 = new BitSet(new ulong[]{0x8010031C0ED010UL,0x61044C01F014010UL,0x608080UL});
-		public static readonly BitSet _selectColumn_in_selectExpr661 = new BitSet(new ulong[]{0x8010031C0ED018UL,0x61044C01F014010UL,0x608080UL});
-		public static readonly BitSet _methodCall_in_selectExpr671 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _aggregate_in_selectExpr676 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _constant_in_selectExpr683 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _arithmeticExpr_in_selectExpr690 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _parameter_in_selectExpr695 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _selectStatement_in_selectExpr704 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _COUNT_in_count718 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _distinctOrAll_in_count725 = new BitSet(new ulong[]{0x8801003140ED010UL,0x61024C01F814010UL,0x428080UL});
-		public static readonly BitSet _countExpr_in_count731 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _DISTINCT_in_distinctOrAll746 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _ALL_in_distinctOrAll754 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _ROW_STAR_in_countExpr773 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _simpleExpr_in_countExpr780 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _DOT_in_selectAtom792 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _SQL_TOKEN_in_selectAtom802 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _ALIAS_REF_in_selectAtom812 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _SELECT_EXPR_in_selectAtom822 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _FROM_in_from845 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _fromTable_in_from852 = new BitSet(new ulong[]{0x8UL,0x0UL,0x1400UL});
-		public static readonly BitSet _FROM_FRAGMENT_in_fromTable878 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _tableJoin_in_fromTable884 = new BitSet(new ulong[]{0x8UL,0x0UL,0x1400UL});
-		public static readonly BitSet _JOIN_FRAGMENT_in_fromTable899 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _tableJoin_in_fromTable905 = new BitSet(new ulong[]{0x8UL,0x0UL,0x1400UL});
-		public static readonly BitSet _JOIN_FRAGMENT_in_tableJoin928 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _tableJoin_in_tableJoin933 = new BitSet(new ulong[]{0x8UL,0x0UL,0x1400UL});
-		public static readonly BitSet _FROM_FRAGMENT_in_tableJoin949 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _tableJoin_in_tableJoin954 = new BitSet(new ulong[]{0x8UL,0x0UL,0x1400UL});
-		public static readonly BitSet _AND_in_booleanOp974 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _booleanExpr_in_booleanOp976 = new BitSet(new ulong[]{0x414024000002080UL,0x4007A4A4CUL,0x400000UL});
-		public static readonly BitSet _booleanExpr_in_booleanOp981 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _OR_in_booleanOp989 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _booleanExpr_in_booleanOp993 = new BitSet(new ulong[]{0x414024000002080UL,0x4007A4A4CUL,0x400000UL});
-		public static readonly BitSet _booleanExpr_in_booleanOp998 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _NOT_in_booleanOp1008 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _booleanExpr_in_booleanOp1012 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _booleanOp_in_booleanExpr1029 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _comparisonExpr_in_booleanExpr1036 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _methodCall_in_booleanExpr1043 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _SQL_TOKEN_in_booleanExpr1050 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _binaryComparisonExpression_in_comparisonExpr1068 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _exoticComparisonExpression_in_comparisonExpr1075 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _EQ_in_binaryComparisonExpression1090 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_binaryComparisonExpression1092 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_binaryComparisonExpression1096 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _NE_in_binaryComparisonExpression1103 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_binaryComparisonExpression1105 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_binaryComparisonExpression1109 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _GT_in_binaryComparisonExpression1116 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_binaryComparisonExpression1118 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_binaryComparisonExpression1122 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _GE_in_binaryComparisonExpression1129 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_binaryComparisonExpression1131 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_binaryComparisonExpression1135 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _LT_in_binaryComparisonExpression1142 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_binaryComparisonExpression1144 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_binaryComparisonExpression1148 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _LE_in_binaryComparisonExpression1155 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_binaryComparisonExpression1157 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_binaryComparisonExpression1161 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _LIKE_in_exoticComparisonExpression1175 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1177 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1181 = new BitSet(new ulong[]{0x8000000008UL});
-		public static readonly BitSet _likeEscape_in_exoticComparisonExpression1183 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _NOT_LIKE_in_exoticComparisonExpression1191 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1193 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1197 = new BitSet(new ulong[]{0x8000000008UL});
-		public static readonly BitSet _likeEscape_in_exoticComparisonExpression1199 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _BETWEEN_in_exoticComparisonExpression1206 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1208 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1212 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1216 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _NOT_BETWEEN_in_exoticComparisonExpression1223 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1225 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1229 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1233 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _IN_in_exoticComparisonExpression1240 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1242 = new BitSet(new ulong[]{0x0UL,0x1UL});
-		public static readonly BitSet _inList_in_exoticComparisonExpression1246 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _NOT_IN_in_exoticComparisonExpression1254 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1256 = new BitSet(new ulong[]{0x0UL,0x1UL});
-		public static readonly BitSet _inList_in_exoticComparisonExpression1260 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _EXISTS_in_exoticComparisonExpression1268 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _quantified_in_exoticComparisonExpression1272 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _IS_NULL_in_exoticComparisonExpression1280 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1282 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _IS_NOT_NULL_in_exoticComparisonExpression1291 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_exoticComparisonExpression1293 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _ESCAPE_in_likeEscape1310 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_likeEscape1314 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _IN_LIST_in_inList1330 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _parenSelect_in_inList1336 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _simpleExprList_in_inList1340 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _simpleExpr_in_simpleExprList1361 = new BitSet(new ulong[]{0x8801003140ED012UL,0x61004C01F814010UL,0x428080UL});
-		public static readonly BitSet _simpleExpr_in_expr1380 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _VECTOR_EXPR_in_expr1387 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_expr1394 = new BitSet(new ulong[]{0x8801003140ED158UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _parenSelect_in_expr1409 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _ANY_in_expr1415 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _quantified_in_expr1419 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _ALL_in_expr1427 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _quantified_in_expr1431 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _SOME_in_expr1439 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _quantified_in_expr1443 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _sqlToken_in_quantified1461 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _selectStatement_in_quantified1465 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _selectStatement_in_parenSelect1484 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _UNION_in_parenSelect1493 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _selectStatement_in_parenSelect1497 = new BitSet(new ulong[]{0x0UL,0x1000400000000000UL});
-		public static readonly BitSet _parenSelect_in_parenSelect1501 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _constant_in_simpleExpr1520 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _NULL_in_simpleExpr1527 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _addrExpr_in_simpleExpr1534 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _sqlToken_in_simpleExpr1539 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _aggregate_in_simpleExpr1544 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _methodCall_in_simpleExpr1549 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _count_in_simpleExpr1554 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _parameter_in_simpleExpr1559 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _arithmeticExpr_in_simpleExpr1564 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _additiveExpr_in_arithmeticExpr1638 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _bitwiseExpr_in_arithmeticExpr1643 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _multiplicativeExpr_in_arithmeticExpr1648 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _UNARY_MINUS_in_arithmeticExpr1655 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _nestedExprAfterMinusDiv_in_arithmeticExpr1659 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _caseExpr_in_arithmeticExpr1665 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _PLUS_in_additiveExpr1677 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_additiveExpr1679 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_additiveExpr1683 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _MINUS_in_additiveExpr1690 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_additiveExpr1692 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _nestedExprAfterMinusDiv_in_additiveExpr1696 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _BAND_in_bitwiseExpr1709 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_bitwiseExpr1713 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _nestedExpr_in_bitwiseExpr1715 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _BOR_in_bitwiseExpr1724 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_bitwiseExpr1728 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _nestedExpr_in_bitwiseExpr1730 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _BXOR_in_bitwiseExpr1739 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_bitwiseExpr1743 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _nestedExpr_in_bitwiseExpr1745 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _BNOT_in_bitwiseExpr1754 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _nestedExpr_in_bitwiseExpr1758 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _STAR_in_multiplicativeExpr1773 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _nestedExpr_in_multiplicativeExpr1775 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _nestedExpr_in_multiplicativeExpr1779 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _DIV_in_multiplicativeExpr1786 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _nestedExpr_in_multiplicativeExpr1788 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _nestedExprAfterMinusDiv_in_multiplicativeExpr1792 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _additiveExpr_in_nestedExpr1814 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _bitwiseExpr_in_nestedExpr1829 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _expr_in_nestedExpr1836 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _arithmeticExpr_in_nestedExprAfterMinusDiv1858 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _expr_in_nestedExprAfterMinusDiv1865 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _CASE_in_caseExpr1877 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _WHEN_in_caseExpr1887 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _booleanExpr_in_caseExpr1891 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_caseExpr1896 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _ELSE_in_caseExpr1908 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_caseExpr1912 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _CASE2_in_caseExpr1928 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_caseExpr1932 = new BitSet(new ulong[]{0x0UL,0x0UL,0x2UL});
-		public static readonly BitSet _WHEN_in_caseExpr1939 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_caseExpr1943 = new BitSet(new ulong[]{0x8801003140ED150UL,0x561444C01F814010UL,0x428080UL});
-		public static readonly BitSet _expr_in_caseExpr1947 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _ELSE_in_caseExpr1959 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_caseExpr1963 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _AGGREGATE_in_aggregate1987 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _expr_in_aggregate1992 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _METHOD_CALL_in_methodCall2011 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _METHOD_NAME_in_methodCall2015 = new BitSet(new ulong[]{0x80000000008UL});
-		public static readonly BitSet _EXPR_LIST_in_methodCall2024 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _arguments_in_methodCall2027 = new BitSet(new ulong[]{0x8UL});
-		public static readonly BitSet _expr_in_arguments2052 = new BitSet(new ulong[]{0xC941243140EF152UL,0x561444C01FF34A5CUL,0x428080UL});
-		public static readonly BitSet _comparisonExpr_in_arguments2056 = new BitSet(new ulong[]{0xC941243140EF152UL,0x561444C01FF34A5CUL,0x428080UL});
-		public static readonly BitSet _expr_in_arguments2065 = new BitSet(new ulong[]{0xC941243140EF152UL,0x561444C01FF34A5CUL,0x428080UL});
-		public static readonly BitSet _comparisonExpr_in_arguments2069 = new BitSet(new ulong[]{0xC941243140EF152UL,0x561444C01FF34A5CUL,0x428080UL});
-		public static readonly BitSet _NAMED_PARAM_in_parameter2087 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _PARAM_in_parameter2096 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _DOT_in_addrExpr2133 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _ALIAS_REF_in_addrExpr2147 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _INDEX_OP_in_addrExpr2157 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _RESULT_VARIABLE_REF_in_addrExpr2170 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _SQL_TOKEN_in_sqlToken2186 = new BitSet(new ulong[]{0x4UL});
-		public static readonly BitSet _SQL_TOKEN_in_synpred1_SqlGenerator370 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _additiveExpr_in_synpred2_SqlGenerator1807 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _bitwiseExpr_in_synpred3_SqlGenerator1822 = new BitSet(new ulong[]{0x2UL});
-		public static readonly BitSet _arithmeticExpr_in_synpred4_SqlGenerator1851 = new BitSet(new ulong[]{0x2UL});
-	}
-	#endregion Follow sets
-}
-
-} // namespace  NHibernate.Hql.Ast.ANTLR 
diff --git a/src/NHibernate/NHibernate.csproj b/src/NHibernate/NHibernate.csproj
index 27ac6f28676..851c1a7fc6d 100644
--- a/src/NHibernate/NHibernate.csproj
+++ b/src/NHibernate/NHibernate.csproj
@@ -1,5 +1,6 @@
 <?xml version="1.0" encoding="utf-8"?>
 <Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003" ToolsVersion="12.0">
+  <Import Project="..\packages\Antlr3.3.5.1\build\Antlr3.props" Condition="Exists('..\packages\Antlr3.3.5.1\build\Antlr3.props')" />
   <PropertyGroup>
     <Configuration Condition=" '$(Configuration)' == '' ">Debug</Configuration>
     <Platform Condition=" '$(Platform)' == '' ">AnyCPU</Platform>
@@ -71,7 +72,7 @@
   </PropertyGroup>
   <ItemGroup>
     <Reference Include="Antlr3.Runtime, Version=3.5.0.2, Culture=neutral, PublicKeyToken=eb42632606e9261f, processorArchitecture=MSIL">
-      <HintPath>..\packages\Antlr.3.5.0.2\lib\Antlr3.Runtime.dll</HintPath>
+      <HintPath>..\packages\Antlr3.Runtime.3.5.1\lib\net40-client\Antlr3.Runtime.dll</HintPath>
       <Private>True</Private>
     </Reference>
     <Reference Include="Iesi.Collections, Version=4.0.0.0, Culture=neutral, PublicKeyToken=aa95f207798dfdb4, processorArchitecture=MSIL">
@@ -944,10 +945,6 @@
     <Compile Include="Hql\Ast\ANTLR\Exec\IStatementExecutor.cs" />
     <Compile Include="Hql\Ast\ANTLR\Exec\MultiTableDeleteExecutor.cs" />
     <Compile Include="Hql\Ast\ANTLR\Exec\MultiTableUpdateExecutor.cs" />
-    <Compile Include="Hql\Ast\ANTLR\Generated\HqlLexer.cs" />
-    <Compile Include="Hql\Ast\ANTLR\Generated\HqlParser.cs" />
-    <Compile Include="Hql\Ast\ANTLR\Generated\HqlSqlWalker.cs" />
-    <Compile Include="Hql\Ast\ANTLR\Generated\SqlGenerator.cs" />
     <Compile Include="Hql\Ast\ANTLR\HqlLexer.cs" />
     <Compile Include="Hql\Ast\ANTLR\HqlParser.cs" />
     <Compile Include="Hql\Ast\ANTLR\HqlSqlWalker.cs" />
@@ -1799,9 +1796,9 @@
     <None Include="..\NHibernate.snk">
       <Link>NHibernate.snk</Link>
     </None>
-    <None Include="Hql\Ast\ANTLR\Hql.g" />
-    <None Include="Hql\Ast\ANTLR\HqlSqlWalker.g" />
-    <None Include="Hql\Ast\ANTLR\SqlGenerator.g" />
+    <Antlr3 Include="Hql\Ast\ANTLR\Hql.g" />
+    <Antlr3 Include="Hql\Ast\ANTLR\HqlSqlWalker.g" />
+    <Antlr3 Include="Hql\Ast\ANTLR\SqlGenerator.g" />
     <None Include="NHibernate.build" />
     <None Include="NHibernate.nuspec.template" />
     <None Include="packages.config" />
@@ -1824,4 +1821,12 @@
     </GetReferenceAssemblyPaths>
     <Exec Command="$(SolutionDir)..\Tools\ilrepack\ilrepack.exe /verbose /t:library /targetplatform:v4,&quot;$(_ReferenceAssembliesPath).&quot; /keyfile:$(AssemblyOriginatorKeyFile) /internalize:internalize.exclude /out:$(OutputPath)\NHibernate.dll $(IntermediateOutputPath)\NHibernate.dll $(OutputPath)\Remotion.Linq.dll $(OutputPath)\Antlr3.Runtime.dll" />
   </Target>
+  <Target Name="EnsureNuGetPackageBuildImports" BeforeTargets="PrepareForBuild">
+    <PropertyGroup>
+      <ErrorText>This project references NuGet package(s) that are missing on this computer. Use NuGet Package Restore to download them.  For more information, see http://go.microsoft.com/fwlink/?LinkID=322105. The missing file is {0}.</ErrorText>
+    </PropertyGroup>
+    <Error Condition="!Exists('..\packages\Antlr3.3.5.1\build\Antlr3.props')" Text="$([System.String]::Format('$(ErrorText)', '..\packages\Antlr3.3.5.1\build\Antlr3.props'))" />
+    <Error Condition="!Exists('..\packages\Antlr3.3.5.1\build\Antlr3.targets')" Text="$([System.String]::Format('$(ErrorText)', '..\packages\Antlr3.3.5.1\build\Antlr3.targets'))" />
+  </Target>
+  <Import Project="..\packages\Antlr3.3.5.1\build\Antlr3.targets" Condition="Exists('..\packages\Antlr3.3.5.1\build\Antlr3.targets')" />
 </Project>
\ No newline at end of file
diff --git a/src/NHibernate/packages.config b/src/NHibernate/packages.config
index 05b1621c09a..8412c0a386f 100644
--- a/src/NHibernate/packages.config
+++ b/src/NHibernate/packages.config
@@ -1,6 +1,7 @@
 <?xml version="1.0" encoding="utf-8"?>
 <packages>
-  <package id="Antlr" version="3.5.0.2" targetFramework="net461" />
+  <package id="Antlr3" version="3.5.1" targetFramework="net461" developmentDependency="true" />
+  <package id="Antlr3.Runtime" version="3.5.1" targetFramework="net461" />
   <package id="Iesi.Collections" version="4.0.1.4000" targetFramework="net461" />
   <package id="Remotion.Linq" version="1.13.183.0" targetFramework="net461" />
 </packages>
\ No newline at end of file