package org.stringtemplate.v4.compiler;
import org.stringtemplate.v4.misc.*;
import org.stringtemplate.v4.*;
import org.antlr.runtime.*;
import org.antlr.runtime.tree.*;
import java.util.Stack;
import java.util.List;
import java.util.ArrayList;
@SuppressWarnings("all")
public class CodeGenerator extends TreeParser {
public static final String[] tokenNames = new String[] {
"<invalid>", "<EOR>", "<DOWN>", "<UP>", "IF", "ELSE", "ELSEIF", "ENDIF",
"SUPER", "SEMI", "BANG", "ELLIPSIS", "EQUALS", "COLON", "LPAREN", "RPAREN",
"LBRACK", "RBRACK", "COMMA", "DOT", "LCURLY", "RCURLY", "TEXT", "LDELIM",
"RDELIM", "ID", "STRING", "WS", "PIPE", "OR", "AND", "INDENT", "NEWLINE",
"AT", "END", "TRUE", "FALSE", "COMMENT", "SLASH", "ARGS", "ELEMENTS",
"EXEC_FUNC", "EXPR", "INCLUDE", "INCLUDE_IND", "INCLUDE_REGION", "INCLUDE_SUPER",
"INCLUDE_SUPER_REGION", "INDENTED_EXPR", "LIST", "MAP", "NULL", "OPTIONS",
"PROP", "PROP_IND", "REGION", "SUBTEMPLATE", "TO_STR", "ZIP"
};
public static final int EOF=-1;
public static final int RBRACK=17;
public static final int LBRACK=16;
public static final int ELSE=5;
public static final int ELLIPSIS=11;
public static final int LCURLY=20;
public static final int BANG=10;
public static final int EQUALS=12;
public static final int TEXT=22;
public static final int ID=25;
public static final int SEMI=9;
public static final int LPAREN=14;
public static final int IF=4;
public static final int ELSEIF=6;
public static final int COLON=13;
public static final int RPAREN=15;
public static final int WS=27;
public static final int COMMA=18;
public static final int RCURLY=21;
public static final int ENDIF=7;
public static final int RDELIM=24;
public static final int SUPER=8;
public static final int DOT=19;
public static final int LDELIM=23;
public static final int STRING=26;
public static final int PIPE=28;
public static final int OR=29;
public static final int AND=30;
public static final int INDENT=31;
public static final int NEWLINE=32;
public static final int AT=33;
public static final int END=34;
public static final int TRUE=35;
public static final int FALSE=36;
public static final int =37;
public static final int SLASH=38;
public static final int ARGS=39;
public static final int ELEMENTS=40;
public static final int EXEC_FUNC=41;
public static final int EXPR=42;
public static final int INCLUDE=43;
public static final int INCLUDE_IND=44;
public static final int INCLUDE_REGION=45;
public static final int INCLUDE_SUPER=46;
public static final int INCLUDE_SUPER_REGION=47;
public static final int INDENTED_EXPR=48;
public static final int LIST=49;
public static final int MAP=50;
public static final int NULL=51;
public static final int OPTIONS=52;
public static final int PROP=53;
public static final int PROP_IND=54;
public static final int REGION=55;
public static final int SUBTEMPLATE=56;
public static final int TO_STR=57;
public static final int ZIP=58;
public TreeParser[] getDelegates() {
return new TreeParser[] {};
}
public CodeGenerator(TreeNodeStream input) {
this(input, new RecognizerSharedState());
}
public CodeGenerator(TreeNodeStream input, RecognizerSharedState state) {
super(input, state);
}
@Override public String[] getTokenNames() { return CodeGenerator.tokenNames; }
@Override public String getGrammarFileName() { return "org/stringtemplate/v4/compiler/CodeGenerator.g"; }
String outermostTemplateName;
CompiledST outermostImpl;
Token templateToken;
String template;
ErrorManager errMgr;
public CodeGenerator(TreeNodeStream input, ErrorManager errMgr, String name, String template, Token templateToken) {
this(input, new RecognizerSharedState());
this.errMgr = errMgr;
this.outermostTemplateName = name;
this.template = template;
this.templateToken = templateToken;
}
public void addArgument(List<FormalArgument> args, Token t) {
String name = t.getText();
for (FormalArgument arg : args) {
if (arg.name.equals(name)) {
errMgr.compileTimeError(ErrorType.PARAMETER_REDEFINITION, templateToken, t, name);
return;
}
}
args.add(new FormalArgument(name));
}
public void emit1(CommonTree opAST, short opcode, int arg) {
template_stack.peek().state.emit1(opAST, opcode, arg);
}
public void emit1(CommonTree opAST, short opcode, String arg) {
template_stack.peek().state.emit1(opAST, opcode, arg);
}
public void emit2(CommonTree opAST, short opcode, int arg, int arg2) {
template_stack.peek().state.emit2(opAST, opcode, arg, arg2);
}
public void emit2(CommonTree opAST, short opcode, String s, int arg2) {
template_stack.peek().state.emit2(opAST, opcode, s, arg2);
}
public void emit(CommonTree opAST, short opcode) {
template_stack.peek().state.emit(opAST, opcode);
}
public void insert(int addr, short opcode, String s) {
template_stack.peek().state.insert(addr, opcode, s);
}
public void setOption(CommonTree id) {
template_stack.peek().state.setOption(id);
}
public void write(int addr, short value) {
template_stack.peek().state.write(addr,value);
}
public int address() { return template_stack.peek().state.ip; }
public void func(CommonTree id) { template_stack.peek().state.func(templateToken, id); }
public void refAttr(CommonTree id) { template_stack.peek().state.refAttr(templateToken, id); }
public int defineString(String s) { return template_stack.peek().state.defineString(s); }
@Override
public void displayRecognitionError(String[] tokenNames, RecognitionException e) {
Token tokenWithPosition = e.token;
if (tokenWithPosition.getInputStream() == null) {
tokenWithPosition = input.getTreeAdaptor().getToken(input.LT(-1));
}
String hdr = getErrorHeader(e);
String msg = getErrorMessage(e, tokenNames);
errMgr.compileTimeError(ErrorType.SYNTAX_ERROR, templateToken, tokenWithPosition, hdr + " " + msg);
}
public final void templateAndEOF() throws RecognitionException {
try {
{
pushFollow(FOLLOW_template_in_templateAndEOF50);
template(null, null);
state._fsp--;
match(input,EOF,FOLLOW_EOF_in_templateAndEOF53);
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
}
protected static class template_scope {
CompilationState state;
}
protected Stack<template_scope> template_stack = new Stack<template_scope>();
public final CompiledST template(String name, List<FormalArgument> args) throws RecognitionException {
template_stack.push(new template_scope());
CompiledST impl = null;
template_stack.peek().state = new CompilationState(errMgr, name, input.getTokenStream());
impl = template_stack.peek().state.impl;
if ( template_stack.size() == 1 ) outermostImpl = impl;
impl.defineFormalArgs(args);
if ( name!=null && name.startsWith(Compiler.SUBTEMPLATE_PREFIX) ) {
impl.addArg(new FormalArgument("i"));
impl.addArg(new FormalArgument("i0"));
}
impl.template = template;
try {
{
pushFollow(FOLLOW_chunk_in_template77);
chunk();
state._fsp--;
if ( template_stack.peek().state.stringtable!=null ) impl.strings = template_stack.peek().state.stringtable.toArray();
impl.codeSize = template_stack.peek().state.ip;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
template_stack.pop();
}
return impl;
}
public final void chunk() throws RecognitionException {
try {
{
loop1:
while (true) {
int alt1=2;
int LA1_0 = input.LA(1);
if ( (LA1_0==IF||LA1_0==TEXT||LA1_0==NEWLINE||LA1_0==EXPR||LA1_0==INDENTED_EXPR||LA1_0==REGION) ) {
alt1=1;
}
switch (alt1) {
case 1 :
{
pushFollow(FOLLOW_element_in_chunk92);
element();
state._fsp--;
}
break;
default :
break loop1;
}
}
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
}
public final void element() throws RecognitionException {
CommonTree INDENT1=null;
CommonTree INDENT2=null;
try {
int alt3=4;
switch ( input.LA(1) ) {
case INDENTED_EXPR:
{
int LA3_1 = input.LA(2);
if ( (LA3_1==DOWN) ) {
int LA3_4 = input.LA(3);
if ( (LA3_4==INDENT) ) {
int LA3_5 = input.LA(4);
if ( (LA3_5==IF||LA3_5==REGION) ) {
alt3=1;
}
else if ( (LA3_5==UP||LA3_5==TEXT||LA3_5==NEWLINE||LA3_5==EXPR) ) {
alt3=3;
}
else {
int nvaeMark = input.mark();
try {
for (int nvaeConsume = 0; nvaeConsume < 4 - 1; nvaeConsume++) {
input.consume();
}
NoViableAltException nvae =
new NoViableAltException("", 3, 5, input);
throw nvae;
} finally {
input.rewind(nvaeMark);
}
}
}
else {
int nvaeMark = input.mark();
try {
for (int nvaeConsume = 0; nvaeConsume < 3 - 1; nvaeConsume++) {
input.consume();
}
NoViableAltException nvae =
new NoViableAltException("", 3, 4, input);
throw nvae;
} finally {
input.rewind(nvaeMark);
}
}
}
else {
int nvaeMark = input.mark();
try {
input.consume();
NoViableAltException nvae =
new NoViableAltException("", 3, 1, input);
throw nvae;
} finally {
input.rewind(nvaeMark);
}
}
}
break;
case IF:
case REGION:
{
alt3=2;
}
break;
case TEXT:
case NEWLINE:
case EXPR:
{
alt3=4;
}
break;
default:
NoViableAltException nvae =
new NoViableAltException("", 3, 0, input);
throw nvae;
}
switch (alt3) {
case 1 :
{
match(input,INDENTED_EXPR,FOLLOW_INDENTED_EXPR_in_element105);
match(input, Token.DOWN, null);
INDENT1=(CommonTree)match(input,INDENT,FOLLOW_INDENT_in_element107);
pushFollow(FOLLOW_compoundElement_in_element109);
compoundElement(INDENT1);
state._fsp--;
match(input, Token.UP, null);
}
break;
case 2 :
{
pushFollow(FOLLOW_compoundElement_in_element117);
compoundElement(null);
state._fsp--;
}
break;
case 3 :
{
match(input,INDENTED_EXPR,FOLLOW_INDENTED_EXPR_in_element124);
match(input, Token.DOWN, null);
INDENT2=(CommonTree)match(input,INDENT,FOLLOW_INDENT_in_element126);
template_stack.peek().state.indent(INDENT2);
int alt2=2;
int LA2_0 = input.LA(1);
if ( (LA2_0==TEXT||LA2_0==NEWLINE||LA2_0==EXPR) ) {
alt2=1;
}
switch (alt2) {
case 1 :
{
pushFollow(FOLLOW_singleElement_in_element130);
singleElement();
state._fsp--;
}
break;
}
template_stack.peek().state.emit(Bytecode.INSTR_DEDENT);
match(input, Token.UP, null);
}
break;
case 4 :
{
pushFollow(FOLLOW_singleElement_in_element139);
singleElement();
state._fsp--;
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
}
public final void singleElement() throws RecognitionException {
CommonTree TEXT3=null;
CommonTree NEWLINE4=null;
try {
int alt4=3;
switch ( input.LA(1) ) {
case EXPR:
{
alt4=1;
}
break;
case TEXT:
{
alt4=2;
}
break;
case NEWLINE:
{
alt4=3;
}
break;
default:
NoViableAltException nvae =
new NoViableAltException("", 4, 0, input);
throw nvae;
}
switch (alt4) {
case 1 :
{
pushFollow(FOLLOW_exprElement_in_singleElement150);
exprElement();
state._fsp--;
}
break;
case 2 :
{
TEXT3=(CommonTree)match(input,TEXT,FOLLOW_TEXT_in_singleElement155);
if ( (TEXT3!=null?TEXT3.getText():null).length()>0 ) {
emit1(TEXT3,Bytecode.INSTR_WRITE_STR, (TEXT3!=null?TEXT3.getText():null));
}
}
break;
case 3 :
{
NEWLINE4=(CommonTree)match(input,NEWLINE,FOLLOW_NEWLINE_in_singleElement165);
emit(NEWLINE4, Bytecode.INSTR_NEWLINE);
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
}
public final void compoundElement(CommonTree indent) throws RecognitionException {
try {
int alt5=2;
int LA5_0 = input.LA(1);
if ( (LA5_0==IF) ) {
alt5=1;
}
else if ( (LA5_0==REGION) ) {
alt5=2;
}
else {
NoViableAltException nvae =
new NoViableAltException("", 5, 0, input);
throw nvae;
}
switch (alt5) {
case 1 :
{
pushFollow(FOLLOW_ifstat_in_compoundElement179);
ifstat(indent);
state._fsp--;
}
break;
case 2 :
{
pushFollow(FOLLOW_region_in_compoundElement185);
region(indent);
state._fsp--;
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
}
public final void exprElement() throws RecognitionException {
CommonTree EXPR5=null;
short op = Bytecode.INSTR_WRITE;
try {
{
EXPR5=(CommonTree)match(input,EXPR,FOLLOW_EXPR_in_exprElement204);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_expr_in_exprElement206);
expr();
state._fsp--;
int alt6=2;
int LA6_0 = input.LA(1);
if ( (LA6_0==OPTIONS) ) {
alt6=1;
}
switch (alt6) {
case 1 :
{
pushFollow(FOLLOW_exprOptions_in_exprElement209);
exprOptions();
state._fsp--;
op=Bytecode.INSTR_WRITE_OPT;
}
break;
}
match(input, Token.UP, null);
emit(EXPR5, op);
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
}
public static class region_return extends TreeRuleReturnScope {
public String name;
};
public final CodeGenerator.region_return region(CommonTree indent) throws RecognitionException {
CodeGenerator.region_return retval = new CodeGenerator.region_return();
retval.start = input.LT(1);
CommonTree ID6=null;
CompiledST template7 =null;
if ( indent!=null ) template_stack.peek().state.indent(indent);
try {
{
match(input,REGION,FOLLOW_REGION_in_region247);
match(input, Token.DOWN, null);
ID6=(CommonTree)match(input,ID,FOLLOW_ID_in_region249);
retval.name = STGroup.getMangledRegionName(outermostTemplateName, (ID6!=null?ID6.getText():null));
pushFollow(FOLLOW_template_in_region259);
template7=template(retval.name, null);
state._fsp--;
CompiledST sub = template7;
sub.isRegion = true;
sub.regionDefType = ST.RegionType.EMBEDDED;
sub.templateDefStartToken = ID6.token;
outermostImpl.addImplicitlyDefinedTemplate(sub);
emit2(((CommonTree)retval.start), Bytecode.INSTR_NEW, retval.name, 0);
emit(((CommonTree)retval.start), Bytecode.INSTR_WRITE);
match(input, Token.UP, null);
}
if ( indent!=null ) template_stack.peek().state.emit(Bytecode.INSTR_DEDENT);
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
return retval;
}
public static class subtemplate_return extends TreeRuleReturnScope {
public String name;
public int nargs;
};
public final CodeGenerator.subtemplate_return subtemplate() throws RecognitionException {
CodeGenerator.subtemplate_return retval = new CodeGenerator.subtemplate_return();
retval.start = input.LT(1);
CommonTree ID8=null;
CommonTree SUBTEMPLATE10=null;
CommonTree SUBTEMPLATE11=null;
CompiledST template9 =null;
retval.name = Compiler.getNewSubtemplateName();
List<FormalArgument> args = new ArrayList<FormalArgument>();
try {
int alt9=2;
int LA9_0 = input.LA(1);
if ( (LA9_0==SUBTEMPLATE) ) {
int LA9_1 = input.LA(2);
if ( (LA9_1==DOWN) ) {
alt9=1;
}
else if ( ((LA9_1 >= UP && LA9_1 <= ELSEIF)||(LA9_1 >= BANG && LA9_1 <= EQUALS)||LA9_1==TEXT||(LA9_1 >= ID && LA9_1 <= STRING)||(LA9_1 >= OR && LA9_1 <= AND)||LA9_1==NEWLINE||(LA9_1 >= TRUE && LA9_1 <= FALSE)||(LA9_1 >= EXEC_FUNC && LA9_1 <= ZIP)) ) {
alt9=2;
}
else {
int nvaeMark = input.mark();
try {
input.consume();
NoViableAltException nvae =
new NoViableAltException("", 9, 1, input);
throw nvae;
} finally {
input.rewind(nvaeMark);
}
}
}
else {
NoViableAltException nvae =
new NoViableAltException("", 9, 0, input);
throw nvae;
}
switch (alt9) {
case 1 :
{
SUBTEMPLATE10=(CommonTree)match(input,SUBTEMPLATE,FOLLOW_SUBTEMPLATE_in_subtemplate292);
if ( input.LA(1)==Token.DOWN ) {
match(input, Token.DOWN, null);
loop8:
while (true) {
int alt8=2;
int LA8_0 = input.LA(1);
if ( (LA8_0==ARGS) ) {
alt8=1;
}
switch (alt8) {
case 1 :
{
match(input,ARGS,FOLLOW_ARGS_in_subtemplate299);
match(input, Token.DOWN, null);
int cnt7=0;
loop7:
while (true) {
int alt7=2;
int LA7_0 = input.LA(1);
if ( (LA7_0==ID) ) {
alt7=1;
}
switch (alt7) {
case 1 :
{
ID8=(CommonTree)match(input,ID,FOLLOW_ID_in_subtemplate302);
addArgument(args, ID8.token);
}
break;
default :
if ( cnt7 >= 1 ) break loop7;
EarlyExitException eee = new EarlyExitException(7, input);
throw eee;
}
cnt7++;
}
match(input, Token.UP, null);
}
break;
default :
break loop8;
}
}
retval.nargs = args.size();
pushFollow(FOLLOW_template_in_subtemplate319);
template9=template(retval.name, args);
state._fsp--;
CompiledST sub = template9;
sub.isAnonSubtemplate = true;
sub.templateDefStartToken = SUBTEMPLATE10.token;
sub.ast = SUBTEMPLATE10;
sub.ast.setUnknownTokenBoundaries();
sub.tokens = input.getTokenStream();
outermostImpl.addImplicitlyDefinedTemplate(sub);
match(input, Token.UP, null);
}
}
break;
case 2 :
{
SUBTEMPLATE11=(CommonTree)match(input,SUBTEMPLATE,FOLLOW_SUBTEMPLATE_in_subtemplate335);
CompiledST sub = new CompiledST();
sub.name = retval.name;
sub.template = "";
sub.addArg(new FormalArgument("i"));
sub.addArg(new FormalArgument("i0"));
sub.isAnonSubtemplate = true;
sub.templateDefStartToken = SUBTEMPLATE11.token;
sub.ast = SUBTEMPLATE11;
sub.ast.setUnknownTokenBoundaries();
sub.tokens = input.getTokenStream();
outermostImpl.addImplicitlyDefinedTemplate(sub);
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
return retval;
}
public final void ifstat(CommonTree indent) throws RecognitionException {
CommonTree i=null;
CommonTree eif=null;
CommonTree el=null;
TreeRuleReturnScope ec =null;
int prevBranchOperand = -1;
List<Integer> endRefs = new ArrayList<Integer>();
if ( indent!=null ) template_stack.peek().state.indent(indent);
try {
{
i=(CommonTree)match(input,IF,FOLLOW_IF_in_ifstat367);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_conditional_in_ifstat369);
conditional();
state._fsp--;
prevBranchOperand = address()+1;
emit1(i,Bytecode.INSTR_BRF, -1);
pushFollow(FOLLOW_chunk_in_ifstat379);
chunk();
state._fsp--;
loop10:
while (true) {
int alt10=2;
int LA10_0 = input.LA(1);
if ( (LA10_0==ELSEIF) ) {
alt10=1;
}
switch (alt10) {
case 1 :
{
eif=(CommonTree)match(input,ELSEIF,FOLLOW_ELSEIF_in_ifstat389);
endRefs.add(address()+1);
emit1(eif,Bytecode.INSTR_BR, -1);
write(prevBranchOperand, (short)address());
prevBranchOperand = -1;
match(input, Token.DOWN, null);
pushFollow(FOLLOW_conditional_in_ifstat403);
ec=conditional();
state._fsp--;
prevBranchOperand = address()+1;
emit1((ec!=null?((CommonTree)ec.start):null), Bytecode.INSTR_BRF, -1);
pushFollow(FOLLOW_chunk_in_ifstat415);
chunk();
state._fsp--;
match(input, Token.UP, null);
}
break;
default :
break loop10;
}
}
int alt11=2;
int LA11_0 = input.LA(1);
if ( (LA11_0==ELSE) ) {
alt11=1;
}
switch (alt11) {
case 1 :
{
el=(CommonTree)match(input,ELSE,FOLLOW_ELSE_in_ifstat438);
endRefs.add(address()+1);
emit1(el, Bytecode.INSTR_BR, -1);
write(prevBranchOperand, (short)address());
prevBranchOperand = -1;
if ( input.LA(1)==Token.DOWN ) {
match(input, Token.DOWN, null);
pushFollow(FOLLOW_chunk_in_ifstat452);
chunk();
state._fsp--;
match(input, Token.UP, null);
}
}
break;
}
match(input, Token.UP, null);
if ( prevBranchOperand>=0 ) {
write(prevBranchOperand, (short)address());
}
for (int opnd : endRefs) write(opnd, (short)address());
}
if ( indent!=null ) template_stack.peek().state.emit(Bytecode.INSTR_DEDENT);
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
}
public static class conditional_return extends TreeRuleReturnScope {
};
public final CodeGenerator.conditional_return conditional() throws RecognitionException {
CodeGenerator.conditional_return retval = new CodeGenerator.conditional_return();
retval.start = input.LT(1);
CommonTree OR12=null;
CommonTree AND13=null;
CommonTree BANG14=null;
try {
int alt12=4;
switch ( input.LA(1) ) {
case OR:
{
alt12=1;
}
break;
case AND:
{
alt12=2;
}
break;
case BANG:
{
alt12=3;
}
break;
case ID:
case STRING:
case TRUE:
case FALSE:
case EXEC_FUNC:
case INCLUDE:
case INCLUDE_IND:
case INCLUDE_REGION:
case INCLUDE_SUPER:
case INCLUDE_SUPER_REGION:
case LIST:
case MAP:
case PROP:
case PROP_IND:
case SUBTEMPLATE:
case TO_STR:
case ZIP:
{
alt12=4;
}
break;
default:
NoViableAltException nvae =
new NoViableAltException("", 12, 0, input);
throw nvae;
}
switch (alt12) {
case 1 :
{
OR12=(CommonTree)match(input,OR,FOLLOW_OR_in_conditional486);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_conditional_in_conditional488);
conditional();
state._fsp--;
pushFollow(FOLLOW_conditional_in_conditional490);
conditional();
state._fsp--;
match(input, Token.UP, null);
emit(OR12, Bytecode.INSTR_OR);
}
break;
case 2 :
{
AND13=(CommonTree)match(input,AND,FOLLOW_AND_in_conditional500);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_conditional_in_conditional502);
conditional();
state._fsp--;
pushFollow(FOLLOW_conditional_in_conditional504);
conditional();
state._fsp--;
match(input, Token.UP, null);
emit(AND13, Bytecode.INSTR_AND);
}
break;
case 3 :
{
BANG14=(CommonTree)match(input,BANG,FOLLOW_BANG_in_conditional514);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_conditional_in_conditional516);
conditional();
state._fsp--;
match(input, Token.UP, null);
emit(BANG14, Bytecode.INSTR_NOT);
}
break;
case 4 :
{
pushFollow(FOLLOW_expr_in_conditional528);
expr();
state._fsp--;
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
return retval;
}
public static class exprOptions_return extends TreeRuleReturnScope {
};
public final CodeGenerator.exprOptions_return exprOptions() throws RecognitionException {
CodeGenerator.exprOptions_return retval = new CodeGenerator.exprOptions_return();
retval.start = input.LT(1);
try {
{
emit(((CommonTree)retval.start), Bytecode.INSTR_OPTIONS);
match(input,OPTIONS,FOLLOW_OPTIONS_in_exprOptions542);
if ( input.LA(1)==Token.DOWN ) {
match(input, Token.DOWN, null);
loop13:
while (true) {
int alt13=2;
int LA13_0 = input.LA(1);
if ( (LA13_0==EQUALS) ) {
alt13=1;
}
switch (alt13) {
case 1 :
{
pushFollow(FOLLOW_option_in_exprOptions544);
option();
state._fsp--;
}
break;
default :
break loop13;
}
}
match(input, Token.UP, null);
}
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
return retval;
}
public final void option() throws RecognitionException {
CommonTree ID15=null;
try {
{
match(input,EQUALS,FOLLOW_EQUALS_in_option556);
match(input, Token.DOWN, null);
ID15=(CommonTree)match(input,ID,FOLLOW_ID_in_option558);
pushFollow(FOLLOW_expr_in_option560);
expr();
state._fsp--;
match(input, Token.UP, null);
setOption(ID15);
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
}
public final void expr() throws RecognitionException {
CommonTree ZIP16=null;
CommonTree MAP17=null;
int nt = 0, ne = 0;
try {
int alt16=4;
switch ( input.LA(1) ) {
case ZIP:
{
alt16=1;
}
break;
case MAP:
{
alt16=2;
}
break;
case PROP:
case PROP_IND:
{
alt16=3;
}
break;
case ID:
case STRING:
case TRUE:
case FALSE:
case EXEC_FUNC:
case INCLUDE:
case INCLUDE_IND:
case INCLUDE_REGION:
case INCLUDE_SUPER:
case INCLUDE_SUPER_REGION:
case LIST:
case SUBTEMPLATE:
case TO_STR:
{
alt16=4;
}
break;
default:
NoViableAltException nvae =
new NoViableAltException("", 16, 0, input);
throw nvae;
}
switch (alt16) {
case 1 :
{
ZIP16=(CommonTree)match(input,ZIP,FOLLOW_ZIP_in_expr579);
match(input, Token.DOWN, null);
match(input,ELEMENTS,FOLLOW_ELEMENTS_in_expr582);
match(input, Token.DOWN, null);
int cnt14=0;
loop14:
while (true) {
int alt14=2;
int LA14_0 = input.LA(1);
if ( ((LA14_0 >= ID && LA14_0 <= STRING)||(LA14_0 >= TRUE && LA14_0 <= FALSE)||LA14_0==EXEC_FUNC||(LA14_0 >= INCLUDE && LA14_0 <= INCLUDE_SUPER_REGION)||(LA14_0 >= LIST && LA14_0 <= MAP)||(LA14_0 >= PROP && LA14_0 <= PROP_IND)||(LA14_0 >= SUBTEMPLATE && LA14_0 <= ZIP)) ) {
alt14=1;
}
switch (alt14) {
case 1 :
{
pushFollow(FOLLOW_expr_in_expr585);
expr();
state._fsp--;
ne++;
}
break;
default :
if ( cnt14 >= 1 ) break loop14;
EarlyExitException eee = new EarlyExitException(14, input);
throw eee;
}
cnt14++;
}
match(input, Token.UP, null);
pushFollow(FOLLOW_mapTemplateRef_in_expr592);
mapTemplateRef(ne);
state._fsp--;
match(input, Token.UP, null);
emit1(ZIP16, Bytecode.INSTR_ZIP_MAP, ne);
}
break;
case 2 :
{
MAP17=(CommonTree)match(input,MAP,FOLLOW_MAP_in_expr604);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_expr_in_expr606);
expr();
state._fsp--;
int cnt15=0;
loop15:
while (true) {
int alt15=2;
int LA15_0 = input.LA(1);
if ( ((LA15_0 >= INCLUDE && LA15_0 <= INCLUDE_IND)||LA15_0==SUBTEMPLATE) ) {
alt15=1;
}
switch (alt15) {
case 1 :
{
pushFollow(FOLLOW_mapTemplateRef_in_expr609);
mapTemplateRef(1);
state._fsp--;
nt++;
}
break;
default :
if ( cnt15 >= 1 ) break loop15;
EarlyExitException eee = new EarlyExitException(15, input);
throw eee;
}
cnt15++;
}
match(input, Token.UP, null);
if ( nt>1 ) emit1(MAP17, nt>1?Bytecode.INSTR_ROT_MAP:Bytecode.INSTR_MAP, nt);
else emit(MAP17, Bytecode.INSTR_MAP);
}
break;
case 3 :
{
pushFollow(FOLLOW_prop_in_expr624);
prop();
state._fsp--;
}
break;
case 4 :
{
pushFollow(FOLLOW_includeExpr_in_expr629);
includeExpr();
state._fsp--;
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
}
public final void prop() throws RecognitionException {
CommonTree PROP18=null;
CommonTree ID19=null;
CommonTree PROP_IND20=null;
try {
int alt17=2;
int LA17_0 = input.LA(1);
if ( (LA17_0==PROP) ) {
alt17=1;
}
else if ( (LA17_0==PROP_IND) ) {
alt17=2;
}
else {
NoViableAltException nvae =
new NoViableAltException("", 17, 0, input);
throw nvae;
}
switch (alt17) {
case 1 :
{
PROP18=(CommonTree)match(input,PROP,FOLLOW_PROP_in_prop639);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_expr_in_prop641);
expr();
state._fsp--;
ID19=(CommonTree)match(input,ID,FOLLOW_ID_in_prop643);
match(input, Token.UP, null);
emit1(PROP18, Bytecode.INSTR_LOAD_PROP, (ID19!=null?ID19.getText():null));
}
break;
case 2 :
{
PROP_IND20=(CommonTree)match(input,PROP_IND,FOLLOW_PROP_IND_in_prop657);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_expr_in_prop659);
expr();
state._fsp--;
pushFollow(FOLLOW_expr_in_prop661);
expr();
state._fsp--;
match(input, Token.UP, null);
emit(PROP_IND20, Bytecode.INSTR_LOAD_PROP_IND);
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
}
public static class mapTemplateRef_return extends TreeRuleReturnScope {
};
public final CodeGenerator.mapTemplateRef_return mapTemplateRef(int num_exprs) throws RecognitionException {
CodeGenerator.mapTemplateRef_return retval = new CodeGenerator.mapTemplateRef_return();
retval.start = input.LT(1);
CommonTree INCLUDE21=null;
CommonTree INCLUDE_IND25=null;
TreeRuleReturnScope args22 =null;
TreeRuleReturnScope qualifiedId23 =null;
TreeRuleReturnScope subtemplate24 =null;
TreeRuleReturnScope args26 =null;
try {
int alt18=3;
switch ( input.LA(1) ) {
case INCLUDE:
{
alt18=1;
}
break;
case SUBTEMPLATE:
{
alt18=2;
}
break;
case INCLUDE_IND:
{
alt18=3;
}
break;
default:
NoViableAltException nvae =
new NoViableAltException("", 18, 0, input);
throw nvae;
}
switch (alt18) {
case 1 :
{
INCLUDE21=(CommonTree)match(input,INCLUDE,FOLLOW_INCLUDE_in_mapTemplateRef681);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_qualifiedId_in_mapTemplateRef683);
qualifiedId23=qualifiedId();
state._fsp--;
for (int i=1; i<=num_exprs; i++) emit(INCLUDE21,Bytecode.INSTR_NULL);
pushFollow(FOLLOW_args_in_mapTemplateRef693);
args22=args();
state._fsp--;
match(input, Token.UP, null);
if ( (args22!=null?((CodeGenerator.args_return)args22).passThru:false) ) emit1(((CommonTree)retval.start), Bytecode.INSTR_PASSTHRU, (qualifiedId23!=null?(input.getTokenStream().toString(input.getTreeAdaptor().getTokenStartIndex(qualifiedId23.start),input.getTreeAdaptor().getTokenStopIndex(qualifiedId23.start))):null));
if ( (args22!=null?((CodeGenerator.args_return)args22).namedArgs:false) ) emit1(INCLUDE21, Bytecode.INSTR_NEW_BOX_ARGS, (qualifiedId23!=null?(input.getTokenStream().toString(input.getTreeAdaptor().getTokenStartIndex(qualifiedId23.start),input.getTreeAdaptor().getTokenStopIndex(qualifiedId23.start))):null));
else emit2(INCLUDE21, Bytecode.INSTR_NEW, (qualifiedId23!=null?(input.getTokenStream().toString(input.getTreeAdaptor().getTokenStartIndex(qualifiedId23.start),input.getTreeAdaptor().getTokenStopIndex(qualifiedId23.start))):null), (args22!=null?((CodeGenerator.args_return)args22).n:0)+num_exprs);
}
break;
case 2 :
{
pushFollow(FOLLOW_subtemplate_in_mapTemplateRef706);
subtemplate24=subtemplate();
state._fsp--;
if ( (subtemplate24!=null?((CodeGenerator.subtemplate_return)subtemplate24).nargs:0) != num_exprs ) {
errMgr.compileTimeError(ErrorType.ANON_ARGUMENT_MISMATCH,
templateToken, (subtemplate24!=null?((CommonTree)subtemplate24.start):null).token, (subtemplate24!=null?((CodeGenerator.subtemplate_return)subtemplate24).nargs:0), num_exprs);
}
for (int i=1; i<=num_exprs; i++) emit((subtemplate24!=null?((CommonTree)subtemplate24.start):null),Bytecode.INSTR_NULL);
emit2((subtemplate24!=null?((CommonTree)subtemplate24.start):null), Bytecode.INSTR_NEW,
(subtemplate24!=null?((CodeGenerator.subtemplate_return)subtemplate24).name:null),
num_exprs);
}
break;
case 3 :
{
INCLUDE_IND25=(CommonTree)match(input,INCLUDE_IND,FOLLOW_INCLUDE_IND_in_mapTemplateRef718);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_expr_in_mapTemplateRef720);
expr();
state._fsp--;
emit(INCLUDE_IND25,Bytecode.INSTR_TOSTR);
for (int i=1; i<=num_exprs; i++) emit(INCLUDE_IND25,Bytecode.INSTR_NULL);
pushFollow(FOLLOW_args_in_mapTemplateRef730);
args26=args();
state._fsp--;
emit1(INCLUDE_IND25, Bytecode.INSTR_NEW_IND, (args26!=null?((CodeGenerator.args_return)args26).n:0)+num_exprs);
match(input, Token.UP, null);
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
return retval;
}
public static class includeExpr_return extends TreeRuleReturnScope {
};
public final CodeGenerator.includeExpr_return includeExpr() throws RecognitionException {
CodeGenerator.includeExpr_return retval = new CodeGenerator.includeExpr_return();
retval.start = input.LT(1);
CommonTree ID27=null;
CommonTree INCLUDE30=null;
CommonTree ID32=null;
CommonTree INCLUDE_SUPER33=null;
CommonTree ID34=null;
CommonTree INCLUDE_REGION35=null;
CommonTree ID36=null;
CommonTree INCLUDE_SUPER_REGION37=null;
TreeRuleReturnScope args28 =null;
TreeRuleReturnScope qualifiedId29 =null;
TreeRuleReturnScope args31 =null;
try {
int alt20=6;
switch ( input.LA(1) ) {
case EXEC_FUNC:
{
alt20=1;
}
break;
case INCLUDE:
{
alt20=2;
}
break;
case INCLUDE_SUPER:
{
alt20=3;
}
break;
case INCLUDE_REGION:
{
alt20=4;
}
break;
case INCLUDE_SUPER_REGION:
{
alt20=5;
}
break;
case ID:
case STRING:
case TRUE:
case FALSE:
case INCLUDE_IND:
case LIST:
case SUBTEMPLATE:
case TO_STR:
{
alt20=6;
}
break;
default:
NoViableAltException nvae =
new NoViableAltException("", 20, 0, input);
throw nvae;
}
switch (alt20) {
case 1 :
{
match(input,EXEC_FUNC,FOLLOW_EXEC_FUNC_in_includeExpr752);
match(input, Token.DOWN, null);
ID27=(CommonTree)match(input,ID,FOLLOW_ID_in_includeExpr754);
int alt19=2;
int LA19_0 = input.LA(1);
if ( ((LA19_0 >= ID && LA19_0 <= STRING)||(LA19_0 >= TRUE && LA19_0 <= FALSE)||LA19_0==EXEC_FUNC||(LA19_0 >= INCLUDE && LA19_0 <= INCLUDE_SUPER_REGION)||(LA19_0 >= LIST && LA19_0 <= MAP)||(LA19_0 >= PROP && LA19_0 <= PROP_IND)||(LA19_0 >= SUBTEMPLATE && LA19_0 <= ZIP)) ) {
alt19=1;
}
switch (alt19) {
case 1 :
{
pushFollow(FOLLOW_expr_in_includeExpr756);
expr();
state._fsp--;
}
break;
}
match(input, Token.UP, null);
func(ID27);
}
break;
case 2 :
{
INCLUDE30=(CommonTree)match(input,INCLUDE,FOLLOW_INCLUDE_in_includeExpr767);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_qualifiedId_in_includeExpr769);
qualifiedId29=qualifiedId();
state._fsp--;
pushFollow(FOLLOW_args_in_includeExpr771);
args28=args();
state._fsp--;
match(input, Token.UP, null);
if ( (args28!=null?((CodeGenerator.args_return)args28).passThru:false) ) emit1(((CommonTree)retval.start), Bytecode.INSTR_PASSTHRU, (qualifiedId29!=null?(input.getTokenStream().toString(input.getTreeAdaptor().getTokenStartIndex(qualifiedId29.start),input.getTreeAdaptor().getTokenStopIndex(qualifiedId29.start))):null));
if ( (args28!=null?((CodeGenerator.args_return)args28).namedArgs:false) ) emit1(INCLUDE30, Bytecode.INSTR_NEW_BOX_ARGS, (qualifiedId29!=null?(input.getTokenStream().toString(input.getTreeAdaptor().getTokenStartIndex(qualifiedId29.start),input.getTreeAdaptor().getTokenStopIndex(qualifiedId29.start))):null));
else emit2(INCLUDE30, Bytecode.INSTR_NEW, (qualifiedId29!=null?(input.getTokenStream().toString(input.getTreeAdaptor().getTokenStartIndex(qualifiedId29.start),input.getTreeAdaptor().getTokenStopIndex(qualifiedId29.start))):null), (args28!=null?((CodeGenerator.args_return)args28).n:0));
}
break;
case 3 :
{
INCLUDE_SUPER33=(CommonTree)match(input,INCLUDE_SUPER,FOLLOW_INCLUDE_SUPER_in_includeExpr782);
match(input, Token.DOWN, null);
ID32=(CommonTree)match(input,ID,FOLLOW_ID_in_includeExpr784);
pushFollow(FOLLOW_args_in_includeExpr786);
args31=args();
state._fsp--;
match(input, Token.UP, null);
if ( (args31!=null?((CodeGenerator.args_return)args31).passThru:false) ) emit1(((CommonTree)retval.start), Bytecode.INSTR_PASSTHRU, (ID32!=null?ID32.getText():null));
if ( (args31!=null?((CodeGenerator.args_return)args31).namedArgs:false) ) emit1(INCLUDE_SUPER33, Bytecode.INSTR_SUPER_NEW_BOX_ARGS, (ID32!=null?ID32.getText():null));
else emit2(INCLUDE_SUPER33, Bytecode.INSTR_SUPER_NEW, (ID32!=null?ID32.getText():null), (args31!=null?((CodeGenerator.args_return)args31).n:0));
}
break;
case 4 :
{
INCLUDE_REGION35=(CommonTree)match(input,INCLUDE_REGION,FOLLOW_INCLUDE_REGION_in_includeExpr797);
match(input, Token.DOWN, null);
ID34=(CommonTree)match(input,ID,FOLLOW_ID_in_includeExpr799);
match(input, Token.UP, null);
CompiledST impl =
Compiler.defineBlankRegion(outermostImpl, ID34.token);
emit2(INCLUDE_REGION35,Bytecode.INSTR_NEW,impl.name,0);
}
break;
case 5 :
{
INCLUDE_SUPER_REGION37=(CommonTree)match(input,INCLUDE_SUPER_REGION,FOLLOW_INCLUDE_SUPER_REGION_in_includeExpr809);
match(input, Token.DOWN, null);
ID36=(CommonTree)match(input,ID,FOLLOW_ID_in_includeExpr811);
match(input, Token.UP, null);
String mangled =
STGroup.getMangledRegionName(outermostImpl.name, (ID36!=null?ID36.getText():null));
emit2(INCLUDE_SUPER_REGION37,Bytecode.INSTR_SUPER_NEW,mangled,0);
}
break;
case 6 :
{
pushFollow(FOLLOW_primary_in_includeExpr819);
primary();
state._fsp--;
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
return retval;
}
public static class primary_return extends TreeRuleReturnScope {
};
public final CodeGenerator.primary_return primary() throws RecognitionException {
CodeGenerator.primary_return retval = new CodeGenerator.primary_return();
retval.start = input.LT(1);
CommonTree ID38=null;
CommonTree STRING39=null;
CommonTree TRUE40=null;
CommonTree FALSE41=null;
CommonTree INCLUDE_IND43=null;
CommonTree TO_STR45=null;
TreeRuleReturnScope subtemplate42 =null;
TreeRuleReturnScope args44 =null;
try {
int alt21=8;
switch ( input.LA(1) ) {
case ID:
{
alt21=1;
}
break;
case STRING:
{
alt21=2;
}
break;
case TRUE:
{
alt21=3;
}
break;
case FALSE:
{
alt21=4;
}
break;
case SUBTEMPLATE:
{
alt21=5;
}
break;
case LIST:
{
alt21=6;
}
break;
case INCLUDE_IND:
{
alt21=7;
}
break;
case TO_STR:
{
alt21=8;
}
break;
default:
NoViableAltException nvae =
new NoViableAltException("", 21, 0, input);
throw nvae;
}
switch (alt21) {
case 1 :
{
ID38=(CommonTree)match(input,ID,FOLLOW_ID_in_primary830);
refAttr(ID38);
}
break;
case 2 :
{
STRING39=(CommonTree)match(input,STRING,FOLLOW_STRING_in_primary840);
emit1(STRING39,Bytecode.INSTR_LOAD_STR, Misc.strip((STRING39!=null?STRING39.getText():null),1));
}
break;
case 3 :
{
TRUE40=(CommonTree)match(input,TRUE,FOLLOW_TRUE_in_primary849);
emit(TRUE40, Bytecode.INSTR_TRUE);
}
break;
case 4 :
{
FALSE41=(CommonTree)match(input,FALSE,FOLLOW_FALSE_in_primary858);
emit(FALSE41, Bytecode.INSTR_FALSE);
}
break;
case 5 :
{
pushFollow(FOLLOW_subtemplate_in_primary867);
subtemplate42=subtemplate();
state._fsp--;
emit2(((CommonTree)retval.start),Bytecode.INSTR_NEW, (subtemplate42!=null?((CodeGenerator.subtemplate_return)subtemplate42).name:null), 0);
}
break;
case 6 :
{
pushFollow(FOLLOW_list_in_primary894);
list();
state._fsp--;
}
break;
case 7 :
{
INCLUDE_IND43=(CommonTree)match(input,INCLUDE_IND,FOLLOW_INCLUDE_IND_in_primary901);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_expr_in_primary906);
expr();
state._fsp--;
emit(INCLUDE_IND43, Bytecode.INSTR_TOSTR);
pushFollow(FOLLOW_args_in_primary915);
args44=args();
state._fsp--;
emit1(INCLUDE_IND43, Bytecode.INSTR_NEW_IND, (args44!=null?((CodeGenerator.args_return)args44).n:0));
match(input, Token.UP, null);
}
break;
case 8 :
{
TO_STR45=(CommonTree)match(input,TO_STR,FOLLOW_TO_STR_in_primary935);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_expr_in_primary937);
expr();
state._fsp--;
match(input, Token.UP, null);
emit(TO_STR45, Bytecode.INSTR_TOSTR);
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
return retval;
}
public static class qualifiedId_return extends TreeRuleReturnScope {
};
public final CodeGenerator.qualifiedId_return qualifiedId() throws RecognitionException {
CodeGenerator.qualifiedId_return retval = new CodeGenerator.qualifiedId_return();
retval.start = input.LT(1);
try {
int alt22=3;
int LA22_0 = input.LA(1);
if ( (LA22_0==SLASH) ) {
int LA22_1 = input.LA(2);
if ( (LA22_1==DOWN) ) {
int LA22_3 = input.LA(3);
if ( (LA22_3==ID) ) {
int LA22_4 = input.LA(4);
if ( (LA22_4==UP) ) {
alt22=2;
}
else if ( (LA22_4==ID) ) {
alt22=1;
}
else {
int nvaeMark = input.mark();
try {
for (int nvaeConsume = 0; nvaeConsume < 4 - 1; nvaeConsume++) {
input.consume();
}
NoViableAltException nvae =
new NoViableAltException("", 22, 4, input);
throw nvae;
} finally {
input.rewind(nvaeMark);
}
}
}
else if ( (LA22_3==SLASH) ) {
alt22=1;
}
else {
int nvaeMark = input.mark();
try {
for (int nvaeConsume = 0; nvaeConsume < 3 - 1; nvaeConsume++) {
input.consume();
}
NoViableAltException nvae =
new NoViableAltException("", 22, 3, input);
throw nvae;
} finally {
input.rewind(nvaeMark);
}
}
}
else {
int nvaeMark = input.mark();
try {
input.consume();
NoViableAltException nvae =
new NoViableAltException("", 22, 1, input);
throw nvae;
} finally {
input.rewind(nvaeMark);
}
}
}
else if ( (LA22_0==ID) ) {
alt22=3;
}
else {
NoViableAltException nvae =
new NoViableAltException("", 22, 0, input);
throw nvae;
}
switch (alt22) {
case 1 :
{
match(input,SLASH,FOLLOW_SLASH_in_qualifiedId952);
match(input, Token.DOWN, null);
pushFollow(FOLLOW_qualifiedId_in_qualifiedId954);
qualifiedId();
state._fsp--;
match(input,ID,FOLLOW_ID_in_qualifiedId956);
match(input, Token.UP, null);
}
break;
case 2 :
{
match(input,SLASH,FOLLOW_SLASH_in_qualifiedId963);
match(input, Token.DOWN, null);
match(input,ID,FOLLOW_ID_in_qualifiedId965);
match(input, Token.UP, null);
}
break;
case 3 :
{
match(input,ID,FOLLOW_ID_in_qualifiedId971);
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
return retval;
}
public final void arg() throws RecognitionException {
try {
{
pushFollow(FOLLOW_expr_in_arg981);
expr();
state._fsp--;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
}
public static class args_return extends TreeRuleReturnScope {
public int n=0;
public boolean namedArgs=false;
public boolean passThru;
};
public final CodeGenerator.args_return args() throws RecognitionException {
CodeGenerator.args_return retval = new CodeGenerator.args_return();
retval.start = input.LT(1);
CommonTree eq=null;
CommonTree ID46=null;
try {
int alt26=4;
switch ( input.LA(1) ) {
case ID:
case STRING:
case TRUE:
case FALSE:
case EXEC_FUNC:
case INCLUDE:
case INCLUDE_IND:
case INCLUDE_REGION:
case INCLUDE_SUPER:
case INCLUDE_SUPER_REGION:
case LIST:
case MAP:
case PROP:
case PROP_IND:
case SUBTEMPLATE:
case TO_STR:
case ZIP:
{
alt26=1;
}
break;
case EQUALS:
{
alt26=2;
}
break;
case ELLIPSIS:
{
alt26=3;
}
break;
case UP:
{
alt26=4;
}
break;
default:
NoViableAltException nvae =
new NoViableAltException("", 26, 0, input);
throw nvae;
}
switch (alt26) {
case 1 :
{
int cnt23=0;
loop23:
while (true) {
int alt23=2;
int LA23_0 = input.LA(1);
if ( ((LA23_0 >= ID && LA23_0 <= STRING)||(LA23_0 >= TRUE && LA23_0 <= FALSE)||LA23_0==EXEC_FUNC||(LA23_0 >= INCLUDE && LA23_0 <= INCLUDE_SUPER_REGION)||(LA23_0 >= LIST && LA23_0 <= MAP)||(LA23_0 >= PROP && LA23_0 <= PROP_IND)||(LA23_0 >= SUBTEMPLATE && LA23_0 <= ZIP)) ) {
alt23=1;
}
switch (alt23) {
case 1 :
{
pushFollow(FOLLOW_arg_in_args997);
arg();
state._fsp--;
retval.n++;
}
break;
default :
if ( cnt23 >= 1 ) break loop23;
EarlyExitException eee = new EarlyExitException(23, input);
throw eee;
}
cnt23++;
}
}
break;
case 2 :
{
emit(((CommonTree)retval.start), Bytecode.INSTR_ARGS); retval.namedArgs =true;
int cnt24=0;
loop24:
while (true) {
int alt24=2;
int LA24_0 = input.LA(1);
if ( (LA24_0==EQUALS) ) {
alt24=1;
}
switch (alt24) {
case 1 :
{
eq=(CommonTree)match(input,EQUALS,FOLLOW_EQUALS_in_args1016);
match(input, Token.DOWN, null);
ID46=(CommonTree)match(input,ID,FOLLOW_ID_in_args1018);
pushFollow(FOLLOW_expr_in_args1020);
expr();
state._fsp--;
match(input, Token.UP, null);
retval.n++; emit1(eq, Bytecode.INSTR_STORE_ARG, defineString((ID46!=null?ID46.getText():null)));
}
break;
default :
if ( cnt24 >= 1 ) break loop24;
EarlyExitException eee = new EarlyExitException(24, input);
throw eee;
}
cnt24++;
}
int alt25=2;
int LA25_0 = input.LA(1);
if ( (LA25_0==ELLIPSIS) ) {
alt25=1;
}
switch (alt25) {
case 1 :
{
match(input,ELLIPSIS,FOLLOW_ELLIPSIS_in_args1037);
retval.passThru =true;
}
break;
}
}
break;
case 3 :
{
match(input,ELLIPSIS,FOLLOW_ELLIPSIS_in_args1052);
retval.passThru =true; emit(((CommonTree)retval.start), Bytecode.INSTR_ARGS); retval.namedArgs =true;
}
break;
case 4 :
{
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
return retval;
}
public static class list_return extends TreeRuleReturnScope {
};
public final CodeGenerator.list_return list() throws RecognitionException {
CodeGenerator.list_return retval = new CodeGenerator.list_return();
retval.start = input.LT(1);
TreeRuleReturnScope listElement47 =null;
try {
{
emit(((CommonTree)retval.start), Bytecode.INSTR_LIST);
match(input,LIST,FOLLOW_LIST_in_list1072);
if ( input.LA(1)==Token.DOWN ) {
match(input, Token.DOWN, null);
loop27:
while (true) {
int alt27=2;
int LA27_0 = input.LA(1);
if ( ((LA27_0 >= ID && LA27_0 <= STRING)||(LA27_0 >= TRUE && LA27_0 <= FALSE)||LA27_0==EXEC_FUNC||(LA27_0 >= INCLUDE && LA27_0 <= INCLUDE_SUPER_REGION)||(LA27_0 >= LIST && LA27_0 <= NULL)||(LA27_0 >= PROP && LA27_0 <= PROP_IND)||(LA27_0 >= SUBTEMPLATE && LA27_0 <= ZIP)) ) {
alt27=1;
}
switch (alt27) {
case 1 :
{
pushFollow(FOLLOW_listElement_in_list1075);
listElement47=listElement();
state._fsp--;
emit((listElement47!=null?((CommonTree)listElement47.start):null), Bytecode.INSTR_ADD);
}
break;
default :
break loop27;
}
}
match(input, Token.UP, null);
}
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
return retval;
}
public static class listElement_return extends TreeRuleReturnScope {
};
public final CodeGenerator.listElement_return listElement() throws RecognitionException {
CodeGenerator.listElement_return retval = new CodeGenerator.listElement_return();
retval.start = input.LT(1);
CommonTree NULL48=null;
try {
int alt28=2;
int LA28_0 = input.LA(1);
if ( ((LA28_0 >= ID && LA28_0 <= STRING)||(LA28_0 >= TRUE && LA28_0 <= FALSE)||LA28_0==EXEC_FUNC||(LA28_0 >= INCLUDE && LA28_0 <= INCLUDE_SUPER_REGION)||(LA28_0 >= LIST && LA28_0 <= MAP)||(LA28_0 >= PROP && LA28_0 <= PROP_IND)||(LA28_0 >= SUBTEMPLATE && LA28_0 <= ZIP)) ) {
alt28=1;
}
else if ( (LA28_0==NULL) ) {
alt28=2;
}
else {
NoViableAltException nvae =
new NoViableAltException("", 28, 0, input);
throw nvae;
}
switch (alt28) {
case 1 :
{
pushFollow(FOLLOW_expr_in_listElement1091);
expr();
state._fsp--;
}
break;
case 2 :
{
NULL48=(CommonTree)match(input,NULL,FOLLOW_NULL_in_listElement1095);
emit(NULL48,Bytecode.INSTR_NULL);
}
break;
}
}
catch (RecognitionException re) {
reportError(re);
recover(input,re);
}
finally {
}
return retval;
}
public static final BitSet FOLLOW_template_in_templateAndEOF50 = new BitSet(new long[]{0x0000000000000000L});
public static final BitSet FOLLOW_EOF_in_templateAndEOF53 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_chunk_in_template77 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_element_in_chunk92 = new BitSet(new long[]{0x0081040100400012L});
public static final BitSet FOLLOW_INDENTED_EXPR_in_element105 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_INDENT_in_element107 = new BitSet(new long[]{0x0080000000000010L});
public static final BitSet FOLLOW_compoundElement_in_element109 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_compoundElement_in_element117 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_INDENTED_EXPR_in_element124 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_INDENT_in_element126 = new BitSet(new long[]{0x0000040100400008L});
public static final BitSet FOLLOW_singleElement_in_element130 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_singleElement_in_element139 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_exprElement_in_singleElement150 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_TEXT_in_singleElement155 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_NEWLINE_in_singleElement165 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_ifstat_in_compoundElement179 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_region_in_compoundElement185 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_EXPR_in_exprElement204 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_expr_in_exprElement206 = new BitSet(new long[]{0x0010000000000008L});
public static final BitSet FOLLOW_exprOptions_in_exprElement209 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_REGION_in_region247 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_ID_in_region249 = new BitSet(new long[]{0x0081040100400010L});
public static final BitSet FOLLOW_template_in_region259 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_SUBTEMPLATE_in_subtemplate292 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_ARGS_in_subtemplate299 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_ID_in_subtemplate302 = new BitSet(new long[]{0x0000000002000008L});
public static final BitSet FOLLOW_template_in_subtemplate319 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_SUBTEMPLATE_in_subtemplate335 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_IF_in_ifstat367 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_conditional_in_ifstat369 = new BitSet(new long[]{0x0081040100400078L});
public static final BitSet FOLLOW_chunk_in_ifstat379 = new BitSet(new long[]{0x0000000000000068L});
public static final BitSet FOLLOW_ELSEIF_in_ifstat389 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_conditional_in_ifstat403 = new BitSet(new long[]{0x0081040100400018L});
public static final BitSet FOLLOW_chunk_in_ifstat415 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_ELSE_in_ifstat438 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_chunk_in_ifstat452 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_OR_in_conditional486 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_conditional_in_conditional488 = new BitSet(new long[]{0x0766FA1866000400L});
public static final BitSet FOLLOW_conditional_in_conditional490 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_AND_in_conditional500 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_conditional_in_conditional502 = new BitSet(new long[]{0x0766FA1866000400L});
public static final BitSet FOLLOW_conditional_in_conditional504 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_BANG_in_conditional514 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_conditional_in_conditional516 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_expr_in_conditional528 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_OPTIONS_in_exprOptions542 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_option_in_exprOptions544 = new BitSet(new long[]{0x0000000000001008L});
public static final BitSet FOLLOW_EQUALS_in_option556 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_ID_in_option558 = new BitSet(new long[]{0x0766FA1806000000L});
public static final BitSet FOLLOW_expr_in_option560 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_ZIP_in_expr579 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_ELEMENTS_in_expr582 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_expr_in_expr585 = new BitSet(new long[]{0x0766FA1806000008L});
public static final BitSet FOLLOW_mapTemplateRef_in_expr592 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_MAP_in_expr604 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_expr_in_expr606 = new BitSet(new long[]{0x0100180000000000L});
public static final BitSet FOLLOW_mapTemplateRef_in_expr609 = new BitSet(new long[]{0x0100180000000008L});
public static final BitSet FOLLOW_prop_in_expr624 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_includeExpr_in_expr629 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_PROP_in_prop639 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_expr_in_prop641 = new BitSet(new long[]{0x0000000002000000L});
public static final BitSet FOLLOW_ID_in_prop643 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_PROP_IND_in_prop657 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_expr_in_prop659 = new BitSet(new long[]{0x0766FA1806000000L});
public static final BitSet FOLLOW_expr_in_prop661 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_INCLUDE_in_mapTemplateRef681 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_qualifiedId_in_mapTemplateRef683 = new BitSet(new long[]{0x0766FA1806001808L});
public static final BitSet FOLLOW_args_in_mapTemplateRef693 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_subtemplate_in_mapTemplateRef706 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_INCLUDE_IND_in_mapTemplateRef718 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_expr_in_mapTemplateRef720 = new BitSet(new long[]{0x0766FA1806001808L});
public static final BitSet FOLLOW_args_in_mapTemplateRef730 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_EXEC_FUNC_in_includeExpr752 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_ID_in_includeExpr754 = new BitSet(new long[]{0x0766FA1806000008L});
public static final BitSet FOLLOW_expr_in_includeExpr756 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_INCLUDE_in_includeExpr767 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_qualifiedId_in_includeExpr769 = new BitSet(new long[]{0x0766FA1806001808L});
public static final BitSet FOLLOW_args_in_includeExpr771 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_INCLUDE_SUPER_in_includeExpr782 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_ID_in_includeExpr784 = new BitSet(new long[]{0x0766FA1806001808L});
public static final BitSet FOLLOW_args_in_includeExpr786 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_INCLUDE_REGION_in_includeExpr797 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_ID_in_includeExpr799 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_INCLUDE_SUPER_REGION_in_includeExpr809 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_ID_in_includeExpr811 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_primary_in_includeExpr819 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_ID_in_primary830 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_STRING_in_primary840 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_TRUE_in_primary849 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_FALSE_in_primary858 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_subtemplate_in_primary867 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_list_in_primary894 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_INCLUDE_IND_in_primary901 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_expr_in_primary906 = new BitSet(new long[]{0x0766FA1806001808L});
public static final BitSet FOLLOW_args_in_primary915 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_TO_STR_in_primary935 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_expr_in_primary937 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_SLASH_in_qualifiedId952 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_qualifiedId_in_qualifiedId954 = new BitSet(new long[]{0x0000000002000000L});
public static final BitSet FOLLOW_ID_in_qualifiedId956 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_SLASH_in_qualifiedId963 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_ID_in_qualifiedId965 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_ID_in_qualifiedId971 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_expr_in_arg981 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_arg_in_args997 = new BitSet(new long[]{0x0766FA1806000002L});
public static final BitSet FOLLOW_EQUALS_in_args1016 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_ID_in_args1018 = new BitSet(new long[]{0x0766FA1806000000L});
public static final BitSet FOLLOW_expr_in_args1020 = new BitSet(new long[]{0x0000000000000008L});
public static final BitSet FOLLOW_ELLIPSIS_in_args1037 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_ELLIPSIS_in_args1052 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_LIST_in_list1072 = new BitSet(new long[]{0x0000000000000004L});
public static final BitSet FOLLOW_listElement_in_list1075 = new BitSet(new long[]{0x076EFA1806000008L});
public static final BitSet FOLLOW_expr_in_listElement1091 = new BitSet(new long[]{0x0000000000000002L});
public static final BitSet FOLLOW_NULL_in_listElement1095 = new BitSet(new long[]{0x0000000000000002L});
}
CodeGenerator
outermostTemplateName: String
template_scope
http://nexus.sonatype.org/oss-repository-hosting.html/ST4: StringTemplate is a java template engine for generating source code,
web pages, emails, or any other formatted text output.
StringTemplate is particularly good at multi-targeted code generators,
multiple site skins, and internationalization/localization.
It evolved over years of effort developing jGuru.com.
StringTemplate also powers the ANTLR 3 and 4 code generator. Its distinguishing characteristic
is that unlike other engines, it strictly enforces model-view separation.
Strict separation makes websites and code generators more flexible
and maintainable; it also provides an excellent defense against malicious
template authors.