antlr-2.7.7/0000755000175000017500000000000010522212350012575 5ustar twernertwernerantlr-2.7.7/Makefile.in0000644000175000017500000001305010522211616014645 0ustar twernertwerner## do not change this value subdir=. ## get standard variables from autoconf - autoconf will replace ## this variable with content of "scripts/config.vars". @stdvars@ ## By default, make will jump into any sub directory containing ## a file named "Makefile". This is done in the order implied by ## /bin/ls. You can override this by using variable SUBDIRS. For ## example, if not set, then make behaves as if ## SUBDIRS = antlr doc examples lib ## has been set. SUBDIRS = antlr lib doc ## When using stdmake before any other rule, then the default ## rule is "all" and behaviour of make is first to make all ## subdirectories and then all "local" targets with name all, ## clean, install, test etc. ## Sometimes it's usefull to make the local target first and then ## subdirs. To enforce this, just listen target in question be- ## fore "stdmake". By doing so, your target will become the ## default. This is usually not what you want. Therefore introduce ## a pseude rule (like this) to tell make about the default target. this : all ## get standard make rules from autoconf @stdmake@ test clean distclean install :: @ if test -f examples/Makefile ; then \ @MAKE@ -C examples $@ ; \ fi # Rule to remove all objects, cores, ANTLR generated, # configure generated, etc. This is not a recursive rule # because distclean removes files unconditionally # included by subdirectory Makefiles. # maintainer-clean: distclean -@RMF@ -f configure # # Rule to make a tarball exclusive all kinds of fluff # TIMESTAMP = $(shell date +%Y%m%d) TAR_DIR = $(versioneddir) TAR_FILE = $(versioneddir).tar _tar: -@RMF@ $(TAR_DIR) ln -s $(srcdir) $(TAR_DIR) $(TAR) cfh $(TAR_FILE) \ --exclude CVS \ --exclude *.pyc \ --exclude *.o \ --exclude *.d \ --exclude *.lo \ --exclude *.a \ --exclude *.la \ --exclude *.lai \ --exclude *.so \ --exclude *.class \ --exclude .deps \ --exclude .depend \ --exclude config.cache \ --exclude config.status \ --exclude Config.make \ --exclude antlr-config \ --exclude run-antlr \ --exclude *~ \ --exclude core \ --exclude dmalloc.log \ --exclude .gdb_history \ --exclude ".nfs*" \ --exclude "$(TAR_DIR)/gen_doc/html" \ --exclude "$(TAR_DIR)/gen_doc/html/*" \ --exclude Makefile \ $(TAR_DIR) @CHMOD@ 660 $(TAR_FILE) @RMF@ $(TAR_DIR) tar backup : _tar gzip -f --best $(TAR_FILE) ## When building a release, it's crucial that time stamps are up-to-date and that ## files have proper permission bit set. Since $(srcdir) might be under the ## control of Perforce (or an other versioning system), I'm going to unpack the ## tar file again in a local directory and update time stamps as well as ## permission. release : @ANTLR_JAR@ _tar @TAR@ xpf $(TAR_FILE) @CP@ @ANTLR_JAR@ $(TAR_DIR) find $(TAR_DIR) -type f | xargs @CHMOD@ 644 find $(TAR_DIR) -type d | xargs @CHMOD@ 755 @CHMOD@ 777 $(TAR_DIR)/configure find $(TAR_DIR) | xargs @TOUCH@ find $(TAR_DIR)/antlr -name \*.java | xargs @TOUCH@ @TAR@ cf $(TAR_FILE) $(TAR_DIR) gzip -f --best $(TAR_FILE) gzip -t -v $(TAR_FILE).gz @RMF@ $(TAR_DIR) ## This one for RK: new_version antlr/Version.java: @@ECHO@ "Rebuilding Version.java" @@ECHO@ "package antlr;" > antlr/Version.java @@ECHO@ "public class Version {" >> antlr/Version.java @@ECHO@ " public static final String version = \"$(VERSION)\";" >> antlr/Version.java @@ECHO@ " public static final String subversion = \"$(SUBVERSION)\";" >> antlr/Version.java @@ECHO@ " public static final String patchlevel = \"$(PATCHLEVEL)\";" >> antlr/Version.java @@ECHO@ " public static final String datestamp = \"$(TIMESTAMP)\";" >> antlr/Version.java @@ECHO@ " public static final String project_version = \"$(VERSION).$(SUBVERSION).$(PATCHLEVEL) ($(TIMESTAMP))\";" >> antlr/Version.java @@ECHO@ "}" >> antlr/Version.java ## Installation is delegated to sub directories - as configured. ## Here we just create a bin directory that should contain ## scripts to mess up with ANTLR. Other things to do? docdir = $(datadir)/doc/$(versioneddir) extradir = $(datadir)/$(versioneddir) install :: $(MKDIR) -p "$(bindir)" $(MKDIR) -p "$(extradir)" $(MKDIR) -p "$(docdir)" $(INSTALL) -m 755 scripts/run-antlr "$(bindir)/antlr" $(INSTALL) -m 755 scripts/antlr-config "$(bindir)/antlr-config" $(INSTALL) -m 444 @abs_top_srcdir@/extras/antlr-mode.el "$(extradir)" $(INSTALL) -m 444 @abs_top_srcdir@/extras/antlr-jedit.xml "$(extradir)" $(INSTALL) -m 444 @abs_top_srcdir@/LICENSE.txt "$(docdir)" $(INSTALL) -m 444 @abs_top_srcdir@/README.txt "$(docdir)" $(INSTALL) -m 444 @abs_top_srcdir@/INSTALL.txt "$(docdir)" install :: @ECHO@ "installation done" # Make sure that all generated files are removed distclean_obj = \ config.* \ Makefile \ scripts/antlr-config \ scripts/antlr.sh \ scripts/antlr.spec \ scripts/config.deps \ scripts/config.make \ scripts/config.vars \ scripts/cpp.sh \ scripts/csc.sh \ scripts/c.sh \ scripts/cxx.sh \ scripts/jar.sh \ scripts/javac.sh \ scripts/java.sh \ scripts/lib.sh \ scripts/link.sh \ scripts/pyantlr.sh \ scripts/python.sh \ scripts/run-antlr \ $(eof) distclean :: clean @RMF@ $(distclean_obj) Q=`find . -name Makefile` && test -n "$$Q" && @RMF@ $${Q} ### phony targets - make this targets even if file with same name exists. .PHONY: bootstrap backup maintainer-clean ##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx @stddeps@ ##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx antlr-2.7.7/examples/0000755000175000017500000000000010522211616014417 5ustar twernertwernerantlr-2.7.7/examples/Makefile.in0000644000175000017500000000052510522211616016466 0ustar twernertwerner############################################################################### # $Id:$ ############################################################################### ## do not change this value subdir=examples ## get configured variables @stdvars@ ## get configured (standard) rules @stdmake@ ## get configured dependencies @stddeps@ antlr-2.7.7/examples/python/0000755000175000017500000000000010522211616015740 5ustar twernertwernerantlr-2.7.7/examples/python/ASTsupport/0000755000175000017500000000000010522211616020024 5ustar twernertwernerantlr-2.7.7/examples/python/ASTsupport/Makefile.in0000644000175000017500000000353110522211616022073 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/ASTsupport ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/astsupport.g \ $(eol) g_py_FILES = \ ASTsupportParser.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ && @CP@ $< $@ test :: test1 test1_deps = \ astsupport.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) astsupport.py \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup astsupport clean :: @@ECHO@ cleaning astsupport ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/ASTsupport/astsupport.py0000644000175000017500000000462410522211616022630 0ustar twernertwernerimport sys import antlr version = sys.version.split()[0] if version < '2.2.1': False = 0 if version < '2.3': True = not False class MyAST(antlr.CommonAST): pass class ASTType49(antlr.CommonAST): pass def testDefaultCreate(): t =factory.create() return checkNode(t, antlr.CommonAST, antlr.INVALID_TYPE) def testSpecificHomoCreate() : ### class names as strings not supported factory.setASTNodeClass(MyAST) t = factory.create() factory.setASTNodeClass(antlr.CommonAST) return checkNode(t, MyAST, antlr.INVALID_TYPE) def testDynamicHeteroCreate() : factory.setTokenTypeASTNodeType(49,ASTType49) t = factory.create(49) a = checkNode(t, ASTType49, 49) u = factory.create(55) b = checkNode(u,antlr.CommonAST, 55) v = factory.create(49,"",MyAST) c = checkNode(v, MyAST, 49) factory.setTokenTypeASTNodeType(49,None) return a and b and c def testNodeDup() : t = factory.create() a = t.equals(antlr.dup(t,factory)) b = not t.equals(None) u = factory.create(49,"",ASTType49) c = checkNode(antlr.dup(u,factory),ASTType49, 49) d = u.equals(antlr.dup(u,factory)) return a and b and c and d def testHeteroTreeDup() : x = factory.create(1,"[type 1]",MyAST) ## will be root y = factory.create(2,"[type 2]",MyAST) z = factory.create(3,"[type 3]",MyAST) sub = factory.create(49,"[type 49]",ASTType49) sub.addChild(factory.create(3,"[type 3 #2]",MyAST)) t = antlr.make(x,y,sub,z) dup_t = antlr.dupList(t,factory) ## check structure a = dup_t.equalsList(t) ## check types b = equalsNodeTypesList(t,dup_t) return a and b def checkNode(t,c, tokenType) : if not t: return False if t.__class__ != c: return False if t.getType()!=tokenType: return False return True def equalsNodeTypesList(this, t) : return antlr.cmptree(this,t,partial=False) def error(test) : print "Test "+test+" FAILED" def success(test) : print "Test "+test+" succeeded" if __name__ == "__main__" : factory = antlr.ASTFactory() funcs = [ testDefaultCreate, testSpecificHomoCreate, testDefaultCreate, testSpecificHomoCreate, testNodeDup, testHeteroTreeDup ] for f in funcs: if f(): success(f.__name__) else: error(f.__name__) import ASTsupportParser P = ASTsupportParser.Parser() P.main() antlr-2.7.7/examples/python/ASTsupport/astsupport.g0000644000175000017500000001322010522211616022416 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ options { language=Python; } class ASTsupportParser extends Parser; options { buildAST = true; } /* Test the equals, equalsSubtree, and findAll methods plus AST enumeration. * The output should be: t is ( = a 1 ) u is ( = b ) v is ( = 4 ) w is = t.equalsTree(t) is true t.equalsTree(u) is false t.equalsTree(v) is false t.equalsTree(w) is false t.equalsTree(null) is false t.equalsTreePartial(t) is true t.equalsTreePartial(u) is false t.equalsTreePartial(v) is false t.equalsTreePartial(w) is true t.equalsTreePartial(null) is true a is ( A ( B C ( A B ) ) ( A B ) ( F ( A B ) ) ( A ( A B ) ) ) J A---------------------J | B-----A-----F----A | | | | C--A B A A | | | B B B x is second sibling of upperleftmost A: ( A B ) ( F ( A B ) ) ( A ( A B ) ) y is child B of x: B x.equalsTree(#(A B)) is true x.equalsList(#(A B)) is false x.equalsListPartial(#(A B)) is true a.equalsTree(#(A B)) is false a.equalsTreePartial(#(A B)) is true y.equalsList(#[B]) is true y.equalsListPartial(#[B]) is true a.findAllPartial(#(A B)): ( A ( B C ( A B ) ) ( A B ) ( F ( A B ) ) ( A ( A B ) ) ) J ( A B ) ( A B ) ( F ( A B ) ) ( A ( A B ) ) ( A B ) ( A B ) a.findAllPartial(#[A])): ( A ( B C ( A B ) ) ( A B ) ( F ( A B ) ) ( A ( A B ) ) ) J ( A B ) ( A B ) ( F ( A B ) ) ( A ( A B ) ) ( A B ) ( A ( A B ) ) ( A B ) a.findAll(#(A B)): ( A B ) ( A B ) ( F ( A B ) ) ( A ( A B ) ) ( A B ) ( A B ) Test results: equalsTree is ok equalsTreePartial is ok equalsList is ok equalsListPartial is ok */ { def main(self): astFactory = antlr.ASTFactory() t = #([ASSIGN,"="], [ID,"a"], [INT,"1"]) print("t is " + t.toStringList()) u = #([ASSIGN,"="], [ID,"b"]) print("u is " + u.toStringList()) v = #([ASSIGN,"="], [INT,"4"]) print("v is " + v.toStringList()) w = #[ASSIGN,"="] print("w is " + w.toStringList()) print("") r1=t.equalsTree(t);print "t.equalsTree(t) is ",r1 r2=t.equalsTree(u);print "t.equalsTree(u) is ",r2 r3=t.equalsTree(v);print "t.equalsTree(v) is ",r3 r4=t.equalsTree(w);print "t.equalsTree(w) is ",r4 r5=t.equalsTree(None);print "t.equalsTree(None) is ",r5 print("") r6=t.equalsTreePartial(t);print "t.equalsTreePartial(t) is ",r6 r7=t.equalsTreePartial(u);print "t.equalsTreePartial(u) is ",r7 r8=t.equalsTreePartial(v);print "t.equalsTreePartial(v) is ",r8 r9=t.equalsTreePartial(w);print "t.equalsTreePartial(w) is ",r9 r10=t.equalsTreePartial(None);print "t.equalsTreePartial(None) is ",r10 print("") a = #(None, ([A,"A"], ([B,"B"], [C,"C"], ([A,"A"],[B,"B"])), ([A,"A"],[B,"B"]), ([F,"F"], #([A,"A"], [B,"B"])), ([A,"A"], #([A,"A"], [B,"B"]))), [J,"J"]) print("a is "+a.toStringList()+"\n") print(" A---------------------J") print(" |") print(" B-----A-----F----A") print(" | | | |") print(" C--A B A A") print(" | | |") print(" B B B\n") x = a.getFirstChild().getNextSibling() print("x is second sibling of upperleftmost A: "+x.toStringList()) y = a.getFirstChild().getNextSibling().getFirstChild() print("y is child B of x: "+y.toStringList()) r11=x.equalsTree(#([A,"A"],[B,"B"]));print "x.equalsTree(#(A B)) is ",r11 r12=x.equalsList(#([A,"A"],[B,"B"]));print "x.equalsList(#(A B)) is ",r12 r13=x.equalsListPartial(#([A,"A"],[B,"B"]));print "x.equalsListPartial(#(A B)) is ",r13 r14=a.equalsTree(#([A,"A"],[B,"B"]));print "a.equalsTree(#(A B)) is ",r14 r15=a.equalsTreePartial(#([A,"A"],[B,"B"]));print "a.equalsTreePartial(#(A B)) is ",r15 r16=y.equalsList(#[B,"B"]);print "y.equalsList(#[B]) is ",r16 r17=y.equalsList(#[B,"B"]);print "y.equalsListPartial(#[B]) is ",r17 print("\na.findAllPartial(#(A B)):") enum = a.findAllPartial(#([A,"A"],[B,"B"])) for e in enum: print (e.toStringList()) print("\na.findAllPartial(#[A])):") enum = a.findAllPartial(#[A,"A"]) for e in enum: print (e.toStringList()) print("\na.findAll(#(A B)):") enum = a.findAll(#([A,"A"],[B,"B"])) for e in enum: print (e.toStringList()) print("\nTest results:") if r1 and not r2 and not r3 and not r4 and \ not r5 and r11 and not r14: print("equalsTree is ok") else: print("equalsTree is bad") if r6 and not r7 and not r8 and r9 and r10: print("equalsTreePartial is ok") else: print("equalsTreePartial is bad") if not r12 and r16: print("equalsList is ok") else : print("equalslist is bad") if r13 and r17: print("equalsListPartial is ok") else : print("equalslistPartial is bad") } defTokenTypes : ID INT ASSIGN PLUS A B C D E F G H I J K ; antlr-2.7.7/examples/python/heteroAST/0000755000175000017500000000000010522211616017576 5ustar twernertwernerantlr-2.7.7/examples/python/heteroAST/hetero.in0000644000175000017500000000001310522211616021406 0ustar twernertwerner3+4*5+21; antlr-2.7.7/examples/python/heteroAST/Makefile.in0000644000175000017500000000362510522211616021651 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/heteroAST ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/hetero.g \ $(eol) g_py_FILES = \ hetero_l.py \ hetero_p.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ &&@CP@ $< $@ test :: test1 test1_deps = \ hetero.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) hetero_l.py < $(_srcdir)/hetero.in ; \ $(python) hetero.py < $(_srcdir)/hetero.in ; \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup hetero clean :: @@ECHO@ cleaning hetero ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/heteroAST/hetero.g0000644000175000017500000000203210522211616021231 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ header { import hetero } options { language=Python; } /** This example demonstrates the heterogeneous tree construction * mechanism. Compare this example to examples/calc/calc.g * to see that I use tree node methods not a tree walker to compute * the result. */ class hetero_p extends Parser; options { buildAST = true; // uses CommonAST by default } // define a bunch of specific AST nodes to build. // can override at actual reference of tokens in grammar // below. tokens { PLUS; STAR; } expr : mexpr (PLUS^ mexpr)* SEMI! ; mexpr : atom (STAR^ atom)* ; atom: INT // could have done in tokens{} section ; class hetero_l extends Lexer; WS : (' ' | '\t' | '\n' | '\r') { _ttype = SKIP; } ; LPAREN: '(' ; RPAREN: ')' ; STAR: '*' ; PLUS: '+' ; SEMI: ';' ; protected DIGIT : '0'..'9' ; INT : (DIGIT)+ ; antlr-2.7.7/examples/python/heteroAST/hetero.py0000644000175000017500000000703210522211616021440 0ustar twernertwernerimport sys import antlr class Visitor(antlr.ASTVisitor): def __init__(self,*args): super(Visitor,self).__init__(*args) self.level = 0 if not args: self.cout = sys.stdout return if isinstance(args[0],file): self.cout = args[0] return assert 0 def tabs(self): print " " * self.level def printf(self,fmt,*args): if not args: sys.stdout.write(fmt) return argv = tuple(args) self.cout.write(fmt % argv) def flush(self): self.cout.flush() def visit1(self,node): if not node: self.printf(" nil ") return c = node.getType() t = node.getText() k = node.getFirstChild() s = node.getNextSibling() self.printf("( <%s> ",c) if t: self.printf(" %s ",t) self.visit1(k); self.visit1(s); self.printf(")") def visit(self,node): self.visit1(node); self.printf("\n") class CalcAST(antlr.BaseAST): def __init__(self,*args): antlr.BaseAST.__init__(self) class BinaryOperatorAST(CalcAST): def __init__(self,*args): CalcAST.__init__(self,*args) def left(self): return self.getFirstChild() def right(self): t = self.left(); if not t: return None return t.getNextSibling() def c2(self): t = self.left() if t: t = t.getNextSibling() assert t return t ### A simple node to represent PLUS operation class PLUSNode(BinaryOperatorAST): def __init__(self,*args): BinaryOperatorAST.__init__(self,*args) ### Compute value of subtree; this is heterogeneous part :) def value(self): left = self.left() assert self r = self.c2() assert r return left.value() + r.value() def toString(self): return " +"; def __str__(self): return self.toString() def __repr__(self): return str(self) ### A simple node to represent MULT operation class MULTNode(BinaryOperatorAST): def __init__(self,*args): BinaryOperatorAST.__init__(self,*args) # Compute value of subtree; this is heterogeneous part :) def value(self): return self.left().value() * self.c2().value() def toString(self): return " *"; def __str__(self): return self.toString() def __repr__(self): return str(self) ### A simple node to represent an INT class INTNode(CalcAST): def __init__(self,*args): CalcAST.__init__(self,*args) self.v = 0 if args and isinstance(args[0],antlr.Token): self.v = int(args[0].getText()) # Compute value of subtree; this is heterogeneous part :) def value(self): return self.v def toString(self): return " " + str(self.v) def main(): import hetero_l import hetero_p L = hetero_l.Lexer() P = hetero_p.Parser(L) P.setFilename(L.getFilename()) ### Parse the input expression try: P.expr() except antlr.ANTLRException, ex: print "*** error(s) while parsing." print ">>> exit(1)" import sys sys.exit(1) ast = P.getAST() if not ast: print "stop - no AST generated." import sys sys.exit(1) ###show tree print "Tree: " + ast.toStringTree() print "List: " + ast.toStringList() print "Node: " + ast.toString() print "visit>>" visitor = Visitor() visitor.visit(ast); print "visit<<" ### compute value and return r = ast.value() print "value is", r if __name__ == "__main__": main() antlr-2.7.7/examples/python/tinyc/0000755000175000017500000000000010522211616017066 5ustar twernertwernerantlr-2.7.7/examples/python/tinyc/Makefile.in0000644000175000017500000000354310522211616021140 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/tinyc ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/tinyc_l.g \ $(_srcdir)/tinyc_p.g \ $(eol) g_py_FILES = \ tinyc_l.py tinyc_p.py \ $(eol) compile : $(g_py_FILES) test :: test1 test1_deps = \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) tinyc_l.py < $(_srcdir)/tinyc.in ; \ $(python) tinyc_p.py < $(_srcdir)/tinyc.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup tinyc clean :: @@ECHO@ cleaning tinyc ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/tinyc/tinyc_l.g0000644000175000017500000000276510522211616020711 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ /* * Make sure to run antlr.Tool on the lexer.g file first! */ options { mangleLiteralPrefix = "TK_"; language=Python; } class tinyc_l extends Lexer; options { k=2; exportVocab=TinyC; charVocabulary = '\3'..'\377'; } tokens { "int"; "char"; "if"; "else"; "while"; } WS : (' ' | '\t' | '\n' { $newline;} | '\r') { _ttype = SKIP; } ; SL_COMMENT : "//" (~'\n')* '\n' { _ttype = Token.SKIP; $newline; } ; ML_COMMENT : "/*" ( { self.LA(2) != '/' }? '*' | '\n' { $newline; } | ~('*'|'\n') )* "*/" { $setType(SKIP); } ; LPAREN options { paraphrase="'('"; } : '(' ; RPAREN options { paraphrase="')'"; } : ')' ; LCURLY: '{' ; RCURLY: '}' ; STAR: '*' ; PLUS: '+' ; ASSIGN : '=' ; SEMI: ';' ; COMMA : ',' ; CHAR_LITERAL : '\'' (ESC|~'\'') '\'' ; STRING_LITERAL : '"' (ESC|~'"')* '"' ; protected ESC : '\\' ( 'n' | 'r' | 't' | 'b' | 'f' | '"' | '\'' | '\\' | '0'..'3' ( options { warnWhenFollowAmbig = false; } : DIGIT ( options { warnWhenFollowAmbig = false; } : DIGIT )? )? | '4'..'7' ( options { warnWhenFollowAmbig = false; } : DIGIT )? ) ; protected DIGIT : '0'..'9' ; INT : (DIGIT)+ ; ID options { testLiterals = true; paraphrase = "an identifier"; } : ('a'..'z'|'A'..'Z'|'_') ('a'..'z'|'A'..'Z'|'_'|'0'..'9')* ; antlr-2.7.7/examples/python/tinyc/tinyc_p.g0000644000175000017500000000332710522211616020710 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ /* * Make sure to run antlr.Tool on the lexer.g file first! */ header "tinyc_p.__main__" { import tinyc_l import tinyc_p L = tinyc_l.Lexer() P = tinyc_p.Parser(L) P.setFilename(L.getFilename()) ### Parse the input expression try: P.program() except antlr.ANTLRException, ex: print "*** error(s) while parsing." print ">>> exit(1)" import sys sys.exit(1) ast = P.getAST() if not ast: print "stop - no AST generated." sys.exit(0) ###show tree print "Tree: " + ast.toStringTree() print "List: " + ast.toStringList() print "Node: " + ast.toString() print "visit>>" visitor = Visitor() visitor.visit(ast); print "visit<<" } options { mangleLiteralPrefix = "TK_"; language=Python; } class tinyc_p extends Parser; options { importVocab=TinyC; } program : ( declaration )* EOF ; declaration : (variable) => variable | function ; declarator : id:ID | STAR id2:ID ; variable : type declarator SEMI ; function : type id:ID LPAREN (formalParameter (COMMA formalParameter)*)? RPAREN block ; formalParameter : type declarator ; type: ( TK_int | TK_char | id:ID ) ; block : LCURLY ( statement )* RCURLY ; statement : (declaration) => declaration | expr SEMI | TK_if LPAREN expr RPAREN statement ( TK_else statement )? | TK_while LPAREN expr RPAREN statement | block ; expr: assignExpr ; assignExpr : aexpr (ASSIGN assignExpr)? ; aexpr : mexpr (PLUS mexpr)* ; mexpr : atom (STAR atom)* ; atom: ID | INT | CHAR_LITERAL | STRING_LITERAL ; antlr-2.7.7/examples/python/tinyc/tinyc.in0000644000175000017500000000023610522211616020545 0ustar twernertwernerint i; int *i; int f(char c, char *d) { int f; c = '\033'+'\47'+'\''+'\\'; d = " \" '\\' foo"; i = c+3*f; if ( i ) { f = c; } else { f = 1; } } antlr-2.7.7/examples/python/unicode.IDENTs/0000755000175000017500000000000010522211616020413 5ustar twernertwernerantlr-2.7.7/examples/python/unicode.IDENTs/Makefile.in0000644000175000017500000000361410522211616022464 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/unicode.IDENTs ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/ident.g \ $(eol) g_py_FILES = \ ident_l.py ident_p.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ && @CP@ $< $@ test :: test1 test1_deps = \ ident.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) ident_l.py < $(_srcdir)/ident.in \ $(python) ident.py < $(_srcdir)/ident.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup ident clean :: @@ECHO@ cleaning ident ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/unicode.IDENTs/ident.g0000755000175000017500000000566710522211616021707 0ustar twernertwernerheader { /* common code to all generated files */ def println(*args): if args: import sys enc = sys.getdefaultencoding() for arg in args[0:-1]: print arg.encode(enc,"replace"), print args[-1].encode(enc,"replace") } header "__main__" { // the main header pass } header "ident_l.__main__" { import sys,codecs def warn(msg): print >>sys.stderr,"warning:",msg sys.stderr.flush() def error(msg): print >>sys.stderr,"error:",msg sys.stderr.flush() try: sys.stdin = codecs.lookup("Shift-JIS")[-2](sys.stdin) except: warn("Japanese codecs required - please install.") sys.exit(0) L = Lexer() for token in L: // I'm being conservative here .. print token.__str__().encode("ascii","replace") } header "__init__" { // init - for all classes } header "ident_p.__init__" { // init - for ident_l } header "ident_l.__init__" { // init - for ident_p } options { language=Python; } /* ** Unicode example ** written by Matthew Ford (c)2000 Forward Computing and Control Pty. Ltd. ** email matthew.ford@forward.com.au ** ** The UnicodeLexer is the interesting part */ class ident_p extends Parser; options { buildAST = false; // skip the tree building defaultErrorHandler = false; // Don't generate parser error handlers } program : (statement)* // perhaps none EOF ; protected statement {exprToken=None} : lhs:IDENT ASSIGNS rhs:IDENT SEMI! { println(" Found statement: ",lhs.getText(),":=",rhs.getText() ); } | tt:TOTAL_TIME SEMI! { println(" Found TOTAL_TIME statement: ",tt.getText()); } | SEMI! {println(" Found empty statement"); } ; class ident_l extends Lexer; options { charVocabulary = '\u0000'..'\uFFFE'; // allow all possiable unicodes except -1 == EOF testLiterals = false; // in general do not test literals caseSensitiveLiterals=false; caseSensitive=false; defaultErrorHandler = false; // pass error back to parser k = 2; // two character lookahead for // versus /* } tokens { TOTAL_TIME = "\u5408\u8A08\u6642\u9593"; // total_time } // an identifier. Note that testLiterals is set to true! This means // that after we match the rule, we look in the literals table to see // if it's a literal or really an identifer // NOTE: any char > \u0080 can start an Ident // may need to restrict this more in some cases // \uFFFF is EOF so do not include it here, stop at \uFFFE IDENT options {testLiterals=true; paraphrase = "an identifier";} : ('a'..'z'|'_'|'$'|'\u0080'..'\uFFFE') ('a'..'z'|'_'|'0'..'9'|'$'|'\u0080'..'\uFFFE')* ; ASSIGNS options {paraphrase = ":=";} : ":=" ; SEMI options {paraphrase = ";";} : ';'; // white space is skipped by the parser WS : ( ' ' | '\t' | '\r'('\n')? {self.newline();} | '\n' {self.newline();} ) {$setType(Token.SKIP);} // way to set token type ; antlr-2.7.7/examples/python/unicode.IDENTs/ident.in0000755000175000017500000000013610522211616022051 0ustar twernertwernerEnglish := word; Japanise := 和英辞典【わえいじてん】; テスティング := testing; 合計時間; antlr-2.7.7/examples/python/unicode.IDENTs/ident.py0000755000175000017500000000220610522211616022073 0ustar twernertwernerimport sys import antlr import codecs import ident_l,ident_p def warn(msg): print >>sys.stderr,"warning:",msg sys.stderr.flush() def error(msg): print >>sys.stderr,"error:",msg sys.stderr.flush() sys.exit(1) ### Unicode handling depends very much on whether ### your terminal can handle (print) unicode chars. ### To be sure about it, just create a non ASCII ### letter and try to print it. If that is not going ### to work, we create an alternative method which ### maps non printable chars to '?'. c = u"\N{LATIN SMALL LETTER O WITH ACUTE}" try: print c except: warn("terminal can't display unicode chars.") sys.stderr.flush() ## I'm just going to redefine 'unicode' to return ## a ASCII string. def unicode(x): return x.__str__().encode("ascii","replace") ### Now for the input. This should ideally be done ### in the lexer .. ### replace stdin with a wrapper that spits out ### unicode chars. try: sys.stdin = codecs.lookup('Shift-JIS')[-2](sys.stdin) except: warn("Japanese codecs required - please install.") sys.exit(0) L = ident_l.Lexer() P = ident_p.Parser(L) P.program() antlr-2.7.7/examples/python/preserveWhiteSpace/0000755000175000017500000000000010522211616021550 5ustar twernertwernerantlr-2.7.7/examples/python/preserveWhiteSpace/keepws.py0000644000175000017500000000522310522211616023422 0ustar twernertwernerimport sys import antlr class Visitor(antlr.ASTVisitor): def __init__(self,*args): super(Visitor,self).__init__(*args) self.level = 0 if not args: self.cout = sys.stdout return if isinstance(args[0],file): self.cout = args[0] return assert 0 def tabs(self): print " " * self.level def printf(self,fmt,*args): if not args: sys.stdout.write(fmt) return argv = tuple(args) self.cout.write(fmt % argv) def flush(self): self.cout.flush() def visit1(self,node): if not node: self.printf(" nil ") return c = node.getType() t = node.getText() k = node.getFirstChild() s = node.getNextSibling() self.printf("( <%s> ",c) if t: self.printf(" %s ",t) self.visit1(k); self.visit1(s); self.printf(")") def visit(self,node): self.visit1(node); self.printf("\n") stream = None def setstream(st): import keepws keepws.stream = st def getstream(): assert stream return stream ### referenced by treewalker def write(*args): import sys sys.stdout.write(*args) sys.stdout.flush() ### walk list of hidden tokens in order, printing them out def dumpHidden(t): assert stream while t: write(t.getText()) t = stream.getHiddenAfter(t) def pr(p): write(p.getText()) dumpHidden(p.getHiddenAfter()) def main(): import keepws_l import keepws_p import keepws_w L = keepws_l.Lexer() ### change token class L.setTokenObjectClass(antlr.CommonHiddenStreamToken) ### create new token stream - referenced by parser ### global stream st = antlr.TokenStreamHiddenTokenFilter(L); st.hide(keepws_p.WS); st.hide(keepws_p.SL_COMMENT); setstream(st) ### create parser with my stream P = keepws_p.Parser(st) P.setFilename(L.getFilename()) ### use this kind of AST nodes P.setASTNodeClass(antlr.CommonASTWithHiddenTokens) ### Parse the input expression try: P.slist() except antlr.ANTLRException, ex: print "*** error(s) while parsing." print ">>> exit(1)" import sys sys.exit(1) ast = P.getAST() if not ast: print "stop - no AST generated." import sys sys.exit(1) ###show tree print "Tree: " + ast.toStringTree() print "List: " + ast.toStringList() print "Node: " + ast.toString() print "visit>>" visitor = Visitor() visitor.visit(ast); print "visit<<" W = keepws_w.Walker() W.slist(ast) print "Ast tree walked without problems." if __name__ == "__main__": main() antlr-2.7.7/examples/python/preserveWhiteSpace/keepws.g0000644000175000017500000000477410522211616023232 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ header { import keepws } options { language=Python; } class keepws_p extends Parser; options { buildAST = true; k=2; } tokens { CALL; // define imaginary token CALL } slist : ( stat )+ ; stat: LBRACE^ (stat)+ RBRACE | "if"^ expr "then" stat ("else" stat)? | ID ASSIGN^ expr SEMI | call ; expr : mexpr (PLUS^ mexpr)* ; mexpr : atom (STAR^ atom)* ; atom: INT | ID ; call: ID LPAREN (expr)? RPAREN SEMI {#call = #(#[CALL,"CALL"], #call);} ; class keepws_l extends Lexer; options { charVocabulary = '\3'..'\377'; } WS : (' ' | '\t' | ('\n'|'\r'('\n')?) {$newline;} )+ ; // Single-line comments SL_COMMENT : "//" (~('\n'|'\r'))* ('\n'|'\r'('\n')?) {$newline;} ; LBRACE: '{' ; RBRACE: '}' ; LPAREN: '(' ; RPAREN: ')' ; STAR: '*' ; PLUS: '+' ; SEMI: ';' ; ASSIGN : '=' ; protected DIGIT : '0'..'9' ; INT : (DIGIT)+ ; ID : ('a'..'z')+ ; class keepws_w extends TreeParser; slist : {keepws.dumpHidden(keepws.getstream().getInitialHiddenToken());} (stat)+ ; stat: #(LBRACE {keepws.pr(#LBRACE);} (stat)+ RBRACE {keepws.pr(#RBRACE);}) | #(i:"if" {keepws.pr(i);} expr t:"then" {keepws.pr(t);} stat (e:"else" {keepws.pr(e);} stat)?) | #(ASSIGN ID {keepws.pr(#ID); keepws.pr(#ASSIGN);} expr SEMI {keepws.pr(#SEMI);} ) | call ; expr : #(PLUS expr {keepws.pr(#PLUS);} expr) | #(STAR expr {keepws.pr(#STAR);} expr) | INT {keepws.pr(#INT);} | ID {keepws.pr(#ID);} ; call: { self.callDumpInstrumentation(#call); } #(CALL ID {keepws.pr(#ID);} LPAREN {keepws.pr(#LPAREN);} (expr)? RPAREN {keepws.pr(#RPAREN);} SEMI { keepws.write(#SEMI.getText()) keepws.write("}") keepws.dumpHidden(#SEMI.getHiddenAfter()) } ) ; /** Dump instrumentation for a call statement. * The reference to rule expr prints out the arg * and then at the end of this rule, we close the * generated called to dbg.invoke(). */ callDumpInstrumentation : #(CALL id:ID {keepws.write("{dbg.invoke(\""+id.getText()+"\", \"");} LPAREN (e:expr)? RPAREN SEMI {keepws.write("\"); ");} ) ; antlr-2.7.7/examples/python/preserveWhiteSpace/Makefile.in0000644000175000017500000000365510522211616023626 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/preserveWhiteSpace ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/keepws.g \ $(eol) g_py_FILES = \ keepws_l.py \ keepws_p.py \ keepws_w.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ &&@CP@ $< $@ test :: test1 test1_deps = \ keepws.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) keepws_l.py < $(_srcdir)/keepws.in ;\ $(python) keepws.py < $(_srcdir)/keepws.in ;\ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup keepws clean :: @@ECHO@ cleaning keepws ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/preserveWhiteSpace/keepws.in0000644000175000017500000000020410522211616023372 0ustar twernertwerner// start comment // another comment a = 2; g(); { a=3*4; } if 3 then f(4 + b); else { b =a; // assign } // final antlr-2.7.7/examples/python/Makefile.in0000644000175000017500000000062010522211616020003 0ustar twernertwerner## This file is part of PyANTLR. See LICENSE.txt for license ## details..........Copyright (C) Wolfgang Haefelinger, 2004. ## subdir=examples/python @stdvars@ SUBDIRS_NOT = inherit.tinyc ### Couple of examples to be run and tested. Almost all of ### them are standard ANTLR 2.7.5 examples - just modified ### to have Python code instead Java and some minor changes. @stdmake@ @stddeps@ antlr-2.7.7/examples/python/unicode/0000755000175000017500000000000010522211616017366 5ustar twernertwernerantlr-2.7.7/examples/python/unicode/Makefile.in0000644000175000017500000000352610522211616021441 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/unicode ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/unicode.g \ $(eol) g_py_FILES = \ unicode_l.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ &&@CP@ $< $@ test :: test1 test1_deps = \ unicode.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) unicode.py < $(_srcdir)/unicode.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup unicode clean :: @@ECHO@ cleaning unicode ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/unicode/unicode.py0000644000175000017500000000216210522211616021367 0ustar twernertwernerimport sys import antlr import codecs import unicode_l def warn(msg): print >>sys.stderr,"warning:",msg sys.stderr.flush() def error(msg): print >>sys.stderr,"error:",msg sys.stderr.flush() ### Unicode handling depends very much on whether ### your terminal can handle (print) unicode chars. ### To be sure about it, just create a non ASCII ### letter and try to print it. If that is not going ### to work, we create an alternative method which ### maps non printable chars to '?'. c = u"\N{LATIN SMALL LETTER O WITH ACUTE}" try: print c except UnicodeEncodeError,e: warn("terminal can't display unicode chars.") sys.stderr.flush() ## I'm just going to redefine 'unicode' to return ## a ASCII string. def unicode(x): return x.__str__().encode("ascii","replace") ### Now for the input. This should ideally be done ### in the lexer .. ### replace stdin with a wrapper that spits out ### unicode chars. sys.stdin = codecs.lookup('latin1')[-2](sys.stdin) try: for token in unicode_l.Lexer(): print unicode(token) except antlr.TokenStreamException, e: error(str(e)) antlr-2.7.7/examples/python/unicode/unicode.g0000644000175000017500000000150310522211616021163 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ options { language = Python; } class unicode_l extends Lexer; options { // Allow any char but \uFFFF (16 bit -1) charVocabulary='\u0000'..'\uFFFE'; } { done = False def uponEOF(self): done=True def another(self): pass } ID : ID_START_LETTER ( ID_LETTER )* ; WS : (' '|'\n') {$skip} ; protected ID_START_LETTER : '$' | '_' | 'a'..'z' | '\u0080'..'\ufffe' ; protected ID_LETTER : ID_START_LETTER { // got a LETTER_ID // handle it // whatever } | '0'..'9' ; // ANTLR should actually allow this here. Would enable me to write // something like: //{ // if __name__ == '__main__' : // ## test lexer // //} antlr-2.7.7/examples/python/unicode/unicode.in0000644000175000017500000000005310522211616021342 0ustar twernertwerner some test letters cool鉞ﾆﾔ ﾊ antlr-2.7.7/examples/python/calc/0000755000175000017500000000000010522211616016642 5ustar twernertwernerantlr-2.7.7/examples/python/calc/calc.g0000644000175000017500000001310610522211616017715 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ header { /* import calc module - need to import my AST Nodes */ import calc // comment pass // another comment } /* no javadoc comments on file level except for classes and rules */ options { language="Python"; //language="Java"; //<- should at least generate a warning } /** go ahead with jdoc comments here ..*/ class CalcParser extends Parser("calc.Parser"); options { k=3; buildAST = true; // contrary to original is this going to change the default // node type from CommonAST to calc.Tnode. ASTLabelType = "calc.TNode"; exportVocab=Calc; } tokens { BODY; STMT; EXPR; TOK01; UNARY_MINUS; UNARY_PLUS; } { /* a sample function */ def hello(self): // just print hello .. print "hello, world" // end of sample function } body : "begin"! (expr ";"!)+ "end"! ; id : VALID | TYPID | CLSID ; expr : expr1 { ## = #(#[EXPR,"expr"],##); } ; expr1 : expr2 ((MINUS^|PLUS^) expr2)* ; expr2 : expr3 ((MULT^|DIV^) expr3)* ; expr3 : ( p:PLUS { #p.setType(UNARY_PLUS) } | m:MINUS { #m.setType(UNARY_MINUS) } )* expr4 ; expr4 : NUMBER | LPAREN^ expr1 RPAREN! ; /** My tree parser ..*/ class CalcWalker extends TreeParser("calc.Walker"); options { //ASTLabelType = "TNode"; } { /* sample function */ def hello(self): print "Hello, world" } body returns [s = 0] { r = 0 } : ( #(e:EXPR { // comment // // // s = self.expr(e) r = s + r // comment -> you should see print e.toStringTree() /* comment */ print e.toStringTree(), /* a comment spanning three lines. */ /* some comment that spans more than one line */ print "=>",s // comments work fine but there some limitations when having // C style comments (/* .. */). In Python a comment ends with // the end of line. Therefore I need to force a '\n' on // encountering '*/'. That works fine usually but be aware // something like // // x /* comment /* = /* comment /* 1 // // is legal in C/C++/Java but would end up in Python as // // x // # comment // = // # comment // 1 // // which is of course not valid. } ) )* ; expr returns [r = 0] : #(EXPR r=expr0()) ; expr0 returns [a = 0] { b = 0 } : UNARY_MINUS a=expr0() { a=-a } | UNARY_PLUS a=expr0() | j:NUMBER { a = self.tofloat(j) } | #(PLUS a=expr0() b=expr0()) { a = a + b } | #(MINUS a=expr0() b=expr0()) { a = a - b } | #(MULT a=expr0() b=expr0()) { a = a * b } | #(DIV a=expr0() b=expr0()) { a = a / b } | #(LPAREN a=expr0()) ; /** a javdoc comment */ nullp { i = 1; if #nullp == None : return print(" error in parser tree .. ") print(#nullp.toStringTree()) if i > 0: return } : #(INT INT) { } ; /** standard lexer - not of further interest here */ class CalcLexer extends Lexer; options { // className = "Scanner"; } { /* sample function */ def hello(self): print "Hello, world" } /** ws is supposed to be skipped as usual. * note that you need to write self.newline(). * You could also write $newline instead. Trailing * ';' are not harmful. */ WS : ( ' ' | '\t' | '\n' { $newline } | "\r\n" { $newline } | '\r' { $newline } ) { $skip } ; LPAREN : '(' ; RPAREN : ')' ; MULT : '*' ; DIV : '/' ; PLUS : '+' ; MINUS : '-' ; SEMI : ';' ; AND : '&' ; OR : '|' ; NOT : '!' ; EQ : '=' ; protected DIGIT : '0'..'9' ; protected INT : (DIGIT)+ ; NUMBER : INT ("." INT)? ; protected LOWER : 'a'..'z' ; protected UPPER : 'A'..'Z' ; protected LETTER : UPPER | LOWER ; ID : LOWER (LETTER|DIGIT|'-')* { $setType(VALID) } | (UPPER (UPPER|DIGIT|'-')*) => UPPER (UPPER|DIGIT|'-')* { $setType(CLSID) } | (UPPER (UPPER|LOWER|DIGIT|'-')*) { buffer = $getText $setType(TYPID) } ; antlr-2.7.7/examples/python/calc/calc.py0000644000175000017500000001116510522211616020122 0ustar twernertwerner## This file is part of PyANTLR. See LICENSE.txt for license ## details..........Copyright (C) Wolfgang Haefelinger, 2004. ## ## $Id$ import sys import antlr class Parser(antlr.LLkParser): def __init__(self,*args): super(Parser,self).__init__(*args) self.num_err = 0 self.num_wrn = 0 def reportError(self,err): self.num_err += 1 super(Parser,self).reportError(err) def reportWarning(self,err): self.num_wrn += 1 super(Parser,self).reportWarning(err) class Walker(antlr.TreeParser): def __init__(self,*args): super(Walker,self).__init__(*args) self.depth = 0 def tofloat(self,ast): s = ast.getText() return float(s) def howmanysiblings(self,ast): if ast == None: return -1 r = 0 ast = ast.getNextSibling() while(ast != None) : r += 1 ast = ast.getNextSibling() return r def traceIn(self,s,ast) : self.depth += 1 print ">" * self.depth print " " + s + "( `" if (ast==None): print("()") else: print(ast.toStringList()) print " ') | siblings:",self.howmanysiblings(ast) def traceOut(self,s,ast): self.depth += 1 print(">" * self.depth) print(" " + s + "( `") if (ast==None): print("()") else: print(ast.toStringList()) print(" ')") self.depth -= 1 class TNode(antlr.CommonAST): def __init__(self,token=None): antlr.CommonAST.__init__(self,token) ### change printing style def toStringTree(self): ts = "" kid = self.getFirstChild() if kid: ts += "{" ts += " " + self.toString() if kid: ts += kid.toStringList() ts += "}" return ts class BodyNode(antlr.CommonAST): def __init__(self,token=None): antlr.CommonAST.__init__(self,token) ### change printing style def toStringTree(self): ts = "BODY: " kid = self.getFirstChild() if kid: ts += "{" ts += " " + self.toString() if kid: ts += kid.toStringList() ts += "}" return ts class ExprNode(antlr.CommonAST): def __init__(self,token=None): antlr.CommonAST.__init__(self,token) ### change printing style def toStringTree(self): ts = "EXPR: " kid = self.getFirstChild() if kid: ts += "{" ts += " " + self.toString() if kid: ts += kid.toStringList() ts += "}" return ts class NumberNode(antlr.CommonAST): def __init__(self,token=None): antlr.CommonAST.__init__(self,token) ### change printing style def toStringTree(self): ts = "NUMBER: " kid = self.getFirstChild() if kid: ts += "{" ts += " " + self.toString() if kid: ts += kid.toStringList() ts += "}" return ts class Visitor(antlr.ASTVisitor): def __init__(self,*args): super(Visitor,self).__init__(*args) self.level = 0 if not args: self.cout = sys.stdout return if isinstance(args[0],file): self.cout = args[0] return assert 0 def tabs(self): print " " * self.level def printf(self,fmt,*args): if not args: sys.stdout.write(fmt) return argv = tuple(args) self.cout.write(fmt % argv) def flush(self): self.cout.flush() def visit1(self,node): if not node: self.printf(" nil ") return c = node.getType() t = node.getText() k = node.getFirstChild() s = node.getNextSibling() self.printf("( <%s> ",c) if t: self.printf(" %s ",t) self.visit1(k); self.visit1(s); self.printf(")") def visit(self,node): self.visit1(node); self.printf("\n") def main(): import CalcLexer import CalcParser import CalcWalker L = CalcLexer.Lexer() P = CalcParser.Parser(L) P.setFilename(L.getFilename()) ### Parse the input expression P.body() if(P.num_err>0): print "*** " + P.num_err + " error(s) while parsing." print ">>> exit(1)" import sys sys.exit(1) ast = P.getAST() if not ast: print "stop - no AST generated." import sys sys.exit(1) ###show tree print "Tree: " + ast.toStringTree() print "List: " + ast.toStringList() print "Node: " + ast.toString() print "visit>>" visitor = Visitor() visitor.visit(ast); print "visit<<" W = CalcWalker.Walker() s = W.body(ast) print "*sum =>",s if __name__ == "__main__": main() antlr-2.7.7/examples/python/calc/Makefile.in0000644000175000017500000000403510522211616020711 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/calc ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/calc.g \ $(eol) g_py_FILES = \ CalcLexer.py \ CalcParser.py \ CalcWalker.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ &&@CP@ $< $@ test :: test1 test2 test1_deps = \ calc.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test2_deps = \ $(test1_deps) \ calc.py \ $(eol) test1_cmd = \ $(python) CalcLexer.py < $(_srcdir)/calc.in \ $(eol) test2_cmd = \ $(python) calc.py < $(_srcdir)/calc.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) test2 : $(test2_deps) @ $(test2_cmd) calc : test $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup calc clean :: @@ECHO@ cleaning calc ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/calc/calc.in0000644000175000017500000000015210522211616020072 0ustar twernertwernerbegin 1+2; 4+5; --1; ++1; +-1; -+1; -1; +1; -0; +0; 1+-2; -1+--2; 1+2*3; (1+2)*3; end antlr-2.7.7/examples/python/lexerTester/0000755000175000017500000000000010522211616020246 5ustar twernertwernerantlr-2.7.7/examples/python/lexerTester/LT5test.py0000644000175000017500000000072210522211616022125 0ustar twernertwerner import sys import antlr import SimpleLexer5 import LexerTester if __name__ == '__main__': try: lexer = SimpleLexer5.Lexer(sys.stdin) parser = LexerTester.Parser(lexer) parser.setFilename('') # Parse the input expression parser.source_text() except antlr.TokenStreamException, e: sys.stderr.write('exception: ' + str(e) + '\n') except antlr.RecognitionException, e: sys.stderr.write('exception: ' + str(e) + '\n') antlr-2.7.7/examples/python/lexerTester/test.in0000644000175000017500000000000510522211616021550 0ustar twernertwernerAAA antlr-2.7.7/examples/python/lexerTester/Makefile.in0000644000175000017500000000450410522211616022316 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/lexerTester ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/lexertester.g \ $(_srcdir)/simplelexer1.g \ $(_srcdir)/simplelexer2.g \ $(_srcdir)/simplelexer3.g \ $(_srcdir)/simplelexer4.g \ $(_srcdir)/simplelexer5.g \ $(eol) g_py_FILES = \ LexerTester.py \ SimpleLexer1.py \ SimpleLexer2.py \ SimpleLexer3.py \ SimpleLexer4.py \ SimpleLexer5.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ &&@CP@ $< $@ test :: test1 test1_deps = \ LT1test.py \ LT2test.py \ LT3test.py \ LT4test.py \ LT5test.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) LT1test.py < $(_srcdir)/test.in; \ $(python) LT2test.py < $(_srcdir)/test.in; \ $(python) LT3test.py < $(_srcdir)/test.in; \ $(python) LT4test.py < $(_srcdir)/test.in; \ $(python) LT5test.py < $(_srcdir)/test.in; \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup filter clean :: @@ECHO@ cleaning filter ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/lexerTester/LT3test.py0000644000175000017500000000072210522211616022123 0ustar twernertwerner import sys import antlr import SimpleLexer3 import LexerTester if __name__ == '__main__': try: lexer = SimpleLexer3.Lexer(sys.stdin) parser = LexerTester.Parser(lexer) parser.setFilename('') # Parse the input expression parser.source_text() except antlr.TokenStreamException, e: sys.stderr.write('exception: ' + str(e) + '\n') except antlr.RecognitionException, e: sys.stderr.write('exception: ' + str(e) + '\n') antlr-2.7.7/examples/python/lexerTester/LT2test.py0000644000175000017500000000072210522211616022122 0ustar twernertwerner import sys import antlr import SimpleLexer2 import LexerTester if __name__ == '__main__': try: lexer = SimpleLexer2.Lexer(sys.stdin) parser = LexerTester.Parser(lexer) parser.setFilename('') # Parse the input expression parser.source_text() except antlr.TokenStreamException, e: sys.stderr.write('exception: ' + str(e) + '\n') except antlr.RecognitionException, e: sys.stderr.write('exception: ' + str(e) + '\n') antlr-2.7.7/examples/python/lexerTester/simplelexer2.g0000644000175000017500000000070610522211616023034 0ustar twernertwerner// This is -*- ANTLR -*- code header { import sys } options { language = "Python"; } //---------------------------------------------------------------------------- // The lexer //---------------------------------------------------------------------------- class SimpleLexer2 extends Lexer; options { k = 1; // A lookahead depth of 1 codeGenDebug = true; } A : ( 'A' ) ; //NL : ( '\r' ) { self.newline() } // ; antlr-2.7.7/examples/python/lexerTester/shiplist0000644000175000017500000000023110522211616022024 0ustar twernertwernerlexertester.g simplelexer1.g simplelexer2.g simplelexer3.g simplelexer4.g simplelexer5.g LT1test.py LT2test.py LT3test.py LT4test.py LT5test.py test1.in antlr-2.7.7/examples/python/lexerTester/simplelexer1.g0000644000175000017500000000067610522211616023041 0ustar twernertwerner// This is -*- ANTLR -*- code header { import sys } options { language = "Python"; } //---------------------------------------------------------------------------- // The lexer //---------------------------------------------------------------------------- class SimpleLexer1 extends Lexer; options { k = 1; // A lookahead depth of 1 codeGenDebug = true; } A : 'A' ; //NL : '\r' { self.newline() } // ; antlr-2.7.7/examples/python/lexerTester/LT4test.py0000644000175000017500000000072210522211616022124 0ustar twernertwerner import sys import antlr import SimpleLexer4 import LexerTester if __name__ == '__main__': try: lexer = SimpleLexer4.Lexer(sys.stdin) parser = LexerTester.Parser(lexer) parser.setFilename('') # Parse the input expression parser.source_text() except antlr.TokenStreamException, e: sys.stderr.write('exception: ' + str(e) + '\n') except antlr.RecognitionException, e: sys.stderr.write('exception: ' + str(e) + '\n') antlr-2.7.7/examples/python/lexerTester/simplelexer3.g0000644000175000017500000000065610522211616023041 0ustar twernertwerner// This is -*- ANTLR -*- code header { import sys } options { language = "Python"; } //---------------------------------------------------------------------------- // The lexer //---------------------------------------------------------------------------- class SimpleLexer3 extends Lexer; options { k = 1; // A lookahead depth of 1 codeGenDebug = true; } A : 'A' { print "found an 'A'!" } ; antlr-2.7.7/examples/python/lexerTester/LT1test.py0000644000175000017500000000072210522211616022121 0ustar twernertwerner import sys import antlr import SimpleLexer1 import LexerTester if __name__ == '__main__': try: lexer = SimpleLexer1.Lexer(sys.stdin) parser = LexerTester.Parser(lexer) parser.setFilename('') # Parse the input expression parser.source_text() except antlr.TokenStreamException, e: sys.stderr.write('exception: ' + str(e) + '\n') except antlr.RecognitionException, e: sys.stderr.write('exception: ' + str(e) + '\n') antlr-2.7.7/examples/python/lexerTester/simplelexer4.g0000644000175000017500000000066210522211616023037 0ustar twernertwerner// This is -*- ANTLR -*- code header { import sys } options { language = "Python"; } //---------------------------------------------------------------------------- // The lexer //---------------------------------------------------------------------------- class SimpleLexer4 extends Lexer; options { k = 1; // A lookahead depth of 1 codeGenDebug = true; } A : ( 'A' ) { print "found an 'A'!" } ; antlr-2.7.7/examples/python/lexerTester/simplelexer5.g0000644000175000017500000000066310522211616023041 0ustar twernertwerner// This is -*- ANTLR -*- code header { import sys } options { language = "Python"; } //---------------------------------------------------------------------------- // The lexer //---------------------------------------------------------------------------- class SimpleLexer5 extends Lexer; options { k = 1; // A lookahead depth of 1 codeGenDebug = true; } A : ( 'A' { print "found an 'A'!" } ) ; antlr-2.7.7/examples/python/lexerTester/lexertester.g0000644000175000017500000000144010522211616022763 0ustar twernertwerner// This is -*- ANTLR -*- code header { import sys } options { language = "Python"; } //---------------------------------------------------------------------------- // The lexertester parser //---------------------------------------------------------------------------- class LexerTester extends Parser; options { k = 1; // A lookahead depth of 1 buildAST = false; // no AST required } // This is a simple rule that can be used to test the Lexer. It will output // every token it sees using a complete description (including file, line // and column info). source_text : ( token:. { sys.stdout.write("lexertester: " + \ self.getFilename() + ':' + \ str(token) + '\n') } )* ; antlr-2.7.7/examples/python/filter/0000755000175000017500000000000010522211616017225 5ustar twernertwernerantlr-2.7.7/examples/python/filter/Makefile.in0000644000175000017500000000342310522211616021274 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/filter ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/filter.g \ $(eol) g_py_FILES = \ filter_l.py \ $(eol) compile : $(g_py_FILES) test :: test1 test1_deps = \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) filter_l.py < $(_srcdir)/filter.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup filter clean :: @@ECHO@ cleaning filter ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/filter/filter.g0000644000175000017500000000136010522211616020662 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ header "Lexer.__main__" { // main - create and run lexer from stdin if __name__ == "__main__": import sys import antlr import filter_l // create lexer - shall read from stdin L = filter_l.Lexer() try: token = L.nextToken() while not token.isEOF(): print token token = L.nextToken() except antlr.TokenStreamException, e: print "error: exception caught while lexing:", e // end of main } options { language="Python"; } class filter_l extends Lexer; options { k=2; filter=true; } P : "

" ; BR: "
" ; antlr-2.7.7/examples/python/filter/filter.in0000644000175000017500000000266210522211616021050 0ustar twernertwerner A test file

ANTLR 2.xx Meta-Language

ANTLR 2.0 accepts three types of grammar specifications -- parsers, lexers, and tree-parsers (also called tree-walkers). Because ANTLR 2.0 uses LL(k) analysis for all three grammar variants, the grammar specifications are similar, and the generated lexers and parsers behave similarly.

Note: in this document, the word "parser" usually includes tree-parsers as well as token stream parsers, except where noted.

Meta-Language Vocabulary


Whitespace. Spaces, tabs, and newlines are separators in that they can separate ANTLR vocabulary

Download ANTLR 2.4.0.

ANTLR 2.4.0 release notes

ANTLR Meta-Language

antlr-2.7.7/examples/python/multiParser/0000755000175000017500000000000010522211616020247 5ustar twernertwernerantlr-2.7.7/examples/python/multiParser/multiparser.in0000644000175000017500000000001510522211616023142 0ustar twernertwernerA B C C B A antlr-2.7.7/examples/python/multiParser/parser2.g0000644000175000017500000000051510522211616021776 0ustar twernertwerner/* This grammar demonstrates the use of two parsers sharing a token * vocabulary with a single lexer. */ header { # empty header } options { language="Python"; } class SimpleParser2 extends Parser; options { k=3; importVocab=Simple; } simple : (x)+; x : (a | b); a : C B A; b : D B A; antlr-2.7.7/examples/python/multiParser/Makefile.in0000644000175000017500000000364210522211616022321 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/filter ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ## two abbrevs to make shorten things _srcdir = @abs_top_srcdir@/examples/python/filter thisdir = @abs_this_builddir@/examples/python/filter ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/filter.g \ $(eol) g_py_FILES = \ filter_l.py \ $(eol) compile : $(g_py_FILES) test :: test1 test1_deps = \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) filter_l.py < $(_srcdir)/filter.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup filter clean :: @@ECHO@ cleaning filter ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/multiParser/parser1.g0000644000175000017500000000053210522211616021774 0ustar twernertwerner/* This grammar demonstrates the use of two parsers sharing a token * vocabulary with a single lexer. */ header { # empty header } options { language="Python"; } class SimpleParser extends Parser; options { k=1; importVocab=Simple; } simple: ( x )+ ; x: (a) => a | b ; a : A B C; b : A B D; antlr-2.7.7/examples/python/multiParser/lexer.g0000644000175000017500000000066610522211616021546 0ustar twernertwerner/* This grammar demonstrates the use of two parsers sharing a token * vocabulary with a single lexer. */ header { # empty header } options { language="Python"; } class SimpleLexer extends Lexer; options { exportVocab=Simple; } WS_ : (' ' | '\t' { self.tab() } | '\n' { self.newline() } | '\r') { $setType(Token.SKIP) } ; A : 'a' | 'A' ; B : 'b' | 'B' ; C : 'c' | 'C' ; D : 'd' | 'D' ; antlr-2.7.7/examples/python/multiParser/multiparser.py0000644000175000017500000000236410522211616023175 0ustar twernertwerner import sys import traceback import antlr import SimpleLexer import SimpleParser import SimpleParser2 lexer = None parser = None parser2 = None class Main: global lexer, parser, parser2 def __init__(self): try: lexer = SimpleLexer.Lexer(sys.stdin); # Invoke first parser sys.stdout.write("first parser" + '\n') parser = SimpleParser.Parser(lexer) parser.simple(); # Now we need to get the inputState from the first parser # this includes data about guessing and stuff like it. # If we don't do this and create the second parser # with just the lexer object we might (doh! will!) miss tokens # read for lookahead tests. self.inputstate = parser.getInputState() # When first parser runs out, invoke secnond parser sys.stdout.write("second parser" + '\n') parser2 = SimpleParser2.Parser(self.inputstate) parser2.simple() except antlr.ANTLRException, e: sys.stderr.write("exception: " + str(e) + '\n') #apply(traceback.print_exception, sys.exc_info()) except Exception, e: sys.stderr.write("exception: " + str(e) + '\n') #apply(traceback.print_exception, sys.exc_info()) if __name__ == '__main__': Main() antlr-2.7.7/examples/python/linkChecker/0000755000175000017500000000000010522211616020162 5ustar twernertwernerantlr-2.7.7/examples/python/linkChecker/LinkChecker.py0000644000175000017500000001711710522211616022725 0ustar twernertwerner import sys import os, os.path import string import traceback import antlr version = sys.version.split()[0] if version < '2.2.1': False = 0 if version < '2.3': True = not False import LinkExtractor class LinkListener: def hrefReference(self, target, line): raise NotImplementedError def imageReference(self, imageFileName, line): raise NotImplementedError class LinkChecker(LinkListener): ### Record which files we have seen so that we don't get into an # infinite loop and for efficiency. The absolute path is stored here # to uniquely identify the files. That is, a file can be arrived # at from many different locations such as help.html from . # and ../help.html from a directory below. # # This table is shared by all instances of LinkChecker. # visited = {} ### A table of the images visited by any document; a cache of correctness imgVisited = {} recursionDepth = 0 separator = "/" # not OS sensitive in HTML localSeparator = None def __init__(self, document): self.document = document self.directory = "." LinkChecker.localSeparator = os.sep def checkLinkRules(self, fName, line): # Check case of path (check for UNIX compatibility on a PC)! offensive = LinkChecker.offensivePathMember(self.directory + separator + fName) if offensive: file_ = '' try: f = file(offensive) file_ = os.path.normcase(offensive) self.error("Case mismatch in reference " + fName + ":" + os.sep + "\treal name is " + os.path.basename(file_) + os.sep + "\treal absolute path is " + file_, line); return False except Exception, e: self.error("internal error: cannot get canonical name for " + offensive, line); if LinkChecker.pathIsAbsolute(fName): self.error("Reference to " + fName + " with absolute path", line); return False; return True def doCheck(self): if self.document[-5:] != ".html": return # prevent infinite recursion to this file if LinkChecker.isVisited(self.document): return LinkChecker.visit(self.document) LinkChecker.recursionDepth += 1 f = file(self.document) lexer = LinkExtractor.Lexer(f) lexer.addLinkListener(self) # this will parse whole file since all tokens are skipped lexer.nextToken() LinkChecker.recursionDepth -= 1 def error(self, err, line): d = "" try: # f = file(self.document) d = os.path.normcase(self.document) except Exception, e: sys.stderr.write("internal error: cannot find file that has error\n") sys.exit(0) sys.stderr.write(d + ":" + str(line) + ": error: " + err + '\n') def pathIsAbsolute(path): return path[0] == '/' or path[1] == ':' pathIsAbsolute = staticmethod(pathIsAbsolute) def fileProtocolURL(target): return target.find("://") == -1 and \ not target[:7] == "mailto:" and \ not target[:5] == "news:" fileProtocolURL = staticmethod(fileProtocolURL) def getParent(path): return os.path.join(os.path.split(path)[:-1]) getParent = staticmethod(getParent) def hrefReference(self, target, line): sys.stdout.write(self.document + ":" + str(line) + ": href to " + target + '\n') # recursively check the target document unless non-file ref if LinkChecker.fileProtocolURL(target): # prune off any #name reference on end of file pound = target.find('#') path = target if pound != -1: path = target[:pound] # rip off #name on end, leave file if not len(path): return # ref to name in this file # first check existence on disk f = self.directory + os.sep + path if not os.path.exists(f): self.error("Reference to missing file " + path, line) return # check the case self.checkLinkRules(path, line); try: # Link is ok, now follow the link chk = LinkChecker.Lexer(self.directory + os.sep + path) chk.doCheck() except Exception, e: self.error("Document does not exist: " + target, line) def imageLinkIsOk(file_): # f = file(file_) f = os.path.normcase(file_) b = f in LinkChecker.imgVisited.keys() if b: return True return False imageLinkIsOk = staticmethod(imageLinkIsOk) def imageReference(self, imageFileName, line): # first check if we have seen this exact file try: if LinkChecker.imageLinkIsOk(self.directory + os.sep + imageFileName): return f = self.directory + os.sep + imageFileName if not os.path.exists(f): self.error("Reference to missing file " + imageFileName, line); return; if self.checkLinkRules(imageFileName, line): LinkChecker.visitImage(self.directory + os.sep + imageFileName) except Exception, e: sys.stderr.write("internal error: " + str(e) + '\n') ### # Given a path to a file or dir, is the case of the reference # the same as the actual path on the disk? This is only # meaningful on a PC which is case-insensitive (not a real # file system). # # Returns null if there is nothing offensive and the file exists. # Returns offending file/dir if it does not exist or # it has there is a case mismatch for it. The last file is checked # first followed by the parent directory, recursively, all the way # to the absolute or relative path root in that String; i.e., we parse # from right to left. # # Because the File object won't actually go get the real filename # from the disk so we can compare, we must get a directory listing # of the directory and then look for the referenced file or dir. # For example, for "./images/logo.gif" we would check "./images" dir # listing for "logo.gif" with the appropriate case and then check # directory "." for a dir called images with the right case. When # no parent exists, we can stop looking for case problems. def offensivePathMember(fName): sys.stdout.write("caseMismatch(" + fName + ")\n"); # have we reached the root? (stopping condition) if not fName or not LinkChecker.getParent(fName): return None parent = LinkChecker.getParent(fName) fName = os.path.basename(fName) # f = file(parent) parentFiles = os.path.split(parent) sys.stdout.write("checking dir " + parent + " for " + fName + '\n') # handle weird stuff like "c:/doc/../foo"; skip this parent dir if fName == "..": return LinkChecker.offensivePathMember(LinkChecker.getParent(parent)) for i in range(len(parentFiles)): sys.stdout.write("is it " + parentFiles[i] + "?\n") if string.lower(parentFiles[i]) == fName: if not parentFiles[i] == fName: sys.stdout.write("case mismatch " + fName + " in " + parent + '\n') return parent + LinkChecker.separator + fName # found a match, verify parent is ok return LinkChecker.offensivePathMember(parent) sys.stdout.write("can't find " + fName + " in " + parent + '\n') return parent + LinkChecker.separator + fName offensivePathMember = staticmethod(offensivePathMember) def visit(file_): # f = file(file_) f = os.path.normcase(file_) LinkChecker.visited[f] = True visit = staticmethod(visit) def isVisited(file_): # f = file(file_) f = os.path.normcase(file_) return f in LinkChecker.visited.keys() isVisited = staticmethod(isVisited) def visitImage(file_): # f = file(file_) f = os.path.normcase(file_) sys.stdout.write("caching image " + f + '\n') LinkChecker.imgVisited[f] = True visitImage = staticmethod(visitImage) class Main: def __init__(self): chk = LinkChecker(sys.argv[1]) try: chk.doCheck() except Exception, e: sys.stderr.write("Exception: " + str(e) + '\n'); apply(traceback.print_exception, sys.exc_info()) if __name__ == "__main__": Main() antlr-2.7.7/examples/python/linkChecker/Makefile.in0000644000175000017500000000354010522211616022231 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/linkChecker ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/links.g \ $(eol) g_py_FILES = \ LinkExtractor.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ &&@CP@ $< $@ test :: test1 test1_deps = \ LinkChecker.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) LinkChecker.py $(_srcdir)/test.html \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup filter clean :: @@ECHO@ cleaning filter ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/linkChecker/links.g0000644000175000017500000000540710522211616021460 0ustar twernertwerner header { import sys import string } header "LinkExtractor.__init__" { self.listener = None } options { language = "Python"; } /** Parse an entire html file, firing events to a single listener * for each image and href link encountered. All tokens are * defined to skip so the lexer will continue scarfing until EOF. */ class LinkExtractor extends Lexer; options { caseSensitive=false; k=2; filter=SCARF; charVocabulary='\3'..'\177'; } { def addLinkListener(self, listener): self.listener = listener def removeLinkListener(self, listener): self.listener = None def fireImageLinkEvent(self, target, line): self.listener.imageReference(target, line) def fireHREFLinkEvent(self, target, line): self.listener.hrefReference(target, line) /** strip quotes from "..." or '...' strings */ def stripQuotes(src): h = src.find('"') if h == -1: h = src.index("'") t = src.rfind('"') if t == -1: t = src.rindex("'"); if h == -1 or t == -1: return src return src[h+1:t] stripQuotes = staticmethod(stripQuotes) } AHREF : "' { $skip } ; IMG : "' { $skip } ; protected ATTR options { ignore=WS; } : w:WORD '=' ( s:STRING | v:WORD ) { if s: target = self.stripQuotes(s.getText()) else: target = v.getText() if string.lower(w.getText()) == "href": self.fireHREFLinkEvent(target, self.getLine()) elif string.lower(w.getText()) == "src": self.fireImageLinkEvent(target, self.getLine()) } ; /** Match until next whitespace; can be file, int, etc... */ protected WORD: ( options { generateAmbigWarnings=false; } : 'a'..'z' | '0'..'9' | '/' | '.' | '#' | '_' )+ ; protected STRING : '"' (~'"')* '"' | '\'' (~'\'')* '\'' ; protected WS : ( ' ' | '\t' | '\f' | ( "\r\n" // DOS | '\r' // Macintosh | '\n' // Unix (the right way) ) { $newline } ) { $skip } ; protected SCARF : WS // track line numbers while you scarf | . ; antlr-2.7.7/examples/python/linkChecker/test.html0000644000175000017500000000041510522211616022027 0ustar twernertwerner

Hi. Click here for more info.

missing.

Here is an image Here is an image Here is an image antlr-2.7.7/examples/python/transform/0000755000175000017500000000000010522211616017753 5ustar twernertwernerantlr-2.7.7/examples/python/transform/transform.g0000644000175000017500000000221110522211616022132 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ options { language=Python; } class transform_p extends Parser; options { buildAST = true; // uses CommonAST by default ASTLabelType = "antlr.CommonAST"; } expr : mexpr (PLUS^ mexpr)* SEMI! ; mexpr : atom (STAR^ atom)* ; atom: INT ; class transform_l extends Lexer; WS : (' ' | '\t' | '\n' | '\r') { $skip; } ; LPAREN: '(' ; RPAREN: ')' ; STAR: '*' ; PLUS: '+' ; SEMI: ';' ; protected DIGIT : '0'..'9' ; INT : (DIGIT)+ ; class transform_w extends TreeParser; options { buildAST = true; ASTLabelType = "antlr.CommonAST"; } expr:! #(PLUS left:expr right:expr) { if #right.getType()==INT and int(#right.getText()) == 0: #expr = #left elif #left.getType()==INT and int(#left.getText()) ==0: #expr = #right; else: #expr = #(PLUS, left, right); } | #(STAR expr expr) | i:INT ; antlr-2.7.7/examples/python/transform/Makefile.in0000644000175000017500000000370510522211616022025 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/transform ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/transform.g \ $(eol) g_py_FILES = \ transform_l.py \ transform_p.py \ transform_w.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ &&@CP@ $< $@ test :: test1 test1_deps = \ transform.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) transform_l.py < $(_srcdir)/transform.in ;\ $(python) transform.py < $(_srcdir)/transform.in ;\ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup transform clean :: @@ECHO@ cleaning transform ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/transform/transform.in0000644000175000017500000000001410522211616022311 0ustar twernertwerner0+3+0*5+0; antlr-2.7.7/examples/python/transform/transform.py0000644000175000017500000000356210522211616022346 0ustar twernertwernerimport sys import antlr class Visitor(antlr.ASTVisitor): def __init__(self,*args): super(Visitor,self).__init__(*args) self.level = 0 if not args: self.cout = sys.stdout return if isinstance(args[0],file): self.cout = args[0] return assert 0 def tabs(self): print " " * self.level def printf(self,fmt,*args): if not args: sys.stdout.write(fmt) return argv = tuple(args) self.cout.write(fmt % argv) def flush(self): self.cout.flush() def visit1(self,node): if not node: self.printf(" nil ") return c = node.getType() t = node.getText() k = node.getFirstChild() s = node.getNextSibling() self.printf("( <%s> ",c) if t: self.printf(" %s ",t) self.visit1(k); self.visit1(s); self.printf(")") def visit(self,node): self.visit1(node); self.printf("\n") def main(): import transform_l import transform_p import transform_w L = transform_l.Lexer() P = transform_p.Parser(L) P.setFilename(L.getFilename()) ### Parse the input expression try: P.expr() except antlr.ANTLRException, ex: print "*** error(s) while parsing." print ">>> exit(1)" import sys sys.exit(1) ast = P.getAST() if not ast: print "stop - no AST generated." import sys sys.exit(1) ###show tree print "Tree: " + ast.toStringTree() print "List: " + ast.toStringList() print "Node: " + ast.toString() print "visit>>" visitor = Visitor() visitor.visit(ast); print "visit<<" W = transform_w.Walker(); ### Traverse the tree created by the parser W.expr(ast); ast = W.getAST(); print "List: " + ast.toStringList() if __name__ == "__main__": main() antlr-2.7.7/examples/python/multiLexer/0000755000175000017500000000000010522211616020072 5ustar twernertwernerantlr-2.7.7/examples/python/multiLexer/multilex.tok0000644000175000017500000000005110522211616022450 0ustar twernertwernerCommon JAVADOC_OPEN=4 JAVADOC_CLOSE=5 antlr-2.7.7/examples/python/multiLexer/Makefile.in0000644000175000017500000000412710522211616022143 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/multiLexer ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/multilex_l.g \ $(_srcdir)/multilex_p.g \ $(_srcdir)/javadoc_l.g \ $(_srcdir)/javadoc_p.g \ $(eol) g_py_FILES = \ multilex_l.py \ multilex_p.py \ javadoc_l.py \ javadoc_p.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ && @CP@ $< $@ CommonTokenTypes.txt : $(_srcdir)/multilex.tok @-@RMF@ $@ && @CP@ $< $@ test :: test1 test1_deps = \ multilex.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) multilex.py < $(_srcdir)/multilex.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh $(g_py_FILES) : CommonTokenTypes.txt ### cleanup multilex clean :: @@ECHO@ cleaning multilex ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/multiLexer/multilex.in0000644000175000017500000000014210522211616022262 0ustar twernertwerner/** a javadoc comment * @param foo * @exception IOException * blah blah */ int abc; antlr-2.7.7/examples/python/multiLexer/multilex_p.g0000644000175000017500000000070510522211616022426 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ options { language=Python; } class multilex_p extends Parser; options { importVocab=Java; } input : ( (javadoc)? INT ID SEMI )+ ; javadoc : JAVADOC_OPEN { import javadoc_p jdocparser = javadoc_p.Parser(self.getInputState()) jdocparser.content(); } JAVADOC_CLOSE ; antlr-2.7.7/examples/python/multiLexer/multilex_l.g0000644000175000017500000000113510522211616022420 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ options { language=Python; } class multilex_l extends Lexer; options { k=2; importVocab = Common; exportVocab = Java; } tokens { INT="int"; } JAVADOC_OPEN : "/**" { import multilex ; multilex.selector.push("doclexer");} ; ID : ('a'..'z')+ ; SEMI: ';' ; WS : ( ' ' | '\t' | '\f' // handle newlines | ( "\r\n" // Evil DOS | '\r' // Macintosh | '\n' // Unix (the right way) ) { self.newline(); } ) { $setType(Token.SKIP); } ; antlr-2.7.7/examples/python/multiLexer/javadoc_p.g0000644000175000017500000000074410522211616022175 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ options { language=Python; } class javadoc_p extends Parser; options { importVocab=JavaDoc; } content : ( p:PARAM // includes ID as part of PARAM {print "found: ",p.getText()} | e:EXCEPTION {print "found: ",e.getText()} )* ; antlr-2.7.7/examples/python/multiLexer/multilex.py0000644000175000017500000000440710522211616022314 0ustar twernertwernerimport sys import antlr class Visitor(antlr.ASTVisitor): def __init__(self,*args): super(Visitor,self).__init__(*args) self.level = 0 if not args: self.cout = sys.stdout return if isinstance(args[0],file): self.cout = args[0] return assert 0 def tabs(self): print " " * self.level def printf(self,fmt,*args): if not args: sys.stdout.write(fmt) return argv = tuple(args) self.cout.write(fmt % argv) def flush(self): self.cout.flush() def visit1(self,node): if not node: self.printf(" nil ") return c = node.getType() t = node.getText() k = node.getFirstChild() s = node.getNextSibling() self.printf("( <%s> ",c) if t: self.printf(" %s ",t) self.visit1(k); self.visit1(s); self.printf(")") def visit(self,node): self.visit1(node); self.printf("\n") ### some global vars referenced by lexer and parser selector = None def getselector(): import multilex assert multilex.selector def check(s): import multilex assert multilex.selector assert multilex.selector == s def main(): import multilex_l import multilex_p import javadoc_l ## make a selector S = antlr.TokenStreamSelector() ## and two lexer L = multilex_l.Lexer() D = javadoc_l.Lexer(L.getInputState()) ## setup selector with lexer, and .. S.addInputStream(L,"main") S.addInputStream(D,"doclexer") S.select("main") ## let parser use selector .. P = multilex_p.Parser(S) P.setFilename(L.getFilename()) import multilex multilex.selector = S check(S) ### Parse the input expression try: P.input() except antlr.ANTLRException, ex: print "*** error(s) while parsing." print ">>> exit(1)" import sys sys.exit(1) ast = P.getAST() if not ast: print "stop - no AST generated." import sys sys.exit(0) ###show tree print "Tree: " + ast.toStringTree() print "List: " + ast.toStringList() print "Node: " + ast.toString() print "visit>>" visitor = Visitor() visitor.visit(ast); print "visit<<" if __name__ == "__main__": main() antlr-2.7.7/examples/python/multiLexer/javadoc_l.g0000644000175000017500000000170010522211616022162 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ options { language=Python; } class javadoc_l extends Lexer; options { k=2; importVocab = Common; exportVocab = JavaDoc; filter=true; } PARAM : "@param" ' ' ID ; EXCEPTION : "@exception" ' ' ID ; protected ID : ('a'..'z'|'A'..'Z')+ ; /** This rule simply prevents JAVADOC_CLOSE from being * called for every '*' in a comment. Calling JAVADOC_CLOSE * will fail for simple '*' and cause an exception, which * is slow. In other words, the grammar will work without * this rule, but is slower. */ STAR: '*' {$setType(Token.SKIP);} ; JAVADOC_CLOSE : "*/" { import multilex; multilex.selector.pop();} ; /** Ignore whitespace inside JavaDoc comments */ NEWLINE : ( "\r\n" // Evil DOS | '\r' // Macintosh | '\n' // Unix (the right way) ) { self.newline(); $setType(Token.SKIP); } ; antlr-2.7.7/examples/python/asn1/0000755000175000017500000000000010522211616016602 5ustar twernertwernerantlr-2.7.7/examples/python/asn1/asn1.py0000644000175000017500000000423710522211616020024 0ustar twernertwerner#! /usr/bin/python -t ## --*- python -*-- import sys import antlr version = sys.version.split()[0] if version < '2.2.1': False = 0 if version < '2.3': True = not False class CharScanner(antlr.CharScanner): def __init__(self,*args): super(CharScanner,self).__init__(*args) self.altcomment = True self.state_with_syntax = False ### check whether a string contains a lower case char def haslowerchar(self,s): return (s.upper() != s) def handle_comment(self): la1 = self.LA(1) if not la1: self.throw_no_viable_alt_for_char(la1) elif la1 in '-': self.match("--") elif la1 in '\n': self.match('\n') self.newline() elif la1 in '\r': self.match('\r') if self.LA(2) == '\n': self.match('\n') self.newline() elif la1 in u'\u000b' : self.match(u'\u000b') self.newline() elif la1 in u'\u000c': self.match('\u000c') self.newline() else: self.throw_no_viable_alt_for_char(la1) def throw_no_viable_alt_for_char(self,la1): raise antlr.NoViableAltForCharException( la1, self.getFilename(), self.getLine(), self.getColumn() ) def chr_ws_erase(self,string,*chars): return string if __name__ == '__main__' : ### create my lexer .. ### print "reading from test.in .." Lexer = lexer.Lexer("test.in") token = Lexer.nextToken() while not token.isEOF(): ### Is there a way to simplify this loop?? ### this looks complicated to me. However, we can't simply ### return none to check for EOF as we would like to know ### where EOF appeared (file, line, col etc). This would ### be lost. Or we could return NIL in case of EOF and, if ### we are really want to know more about EOF ask lexer to ### provide this information. But this would extend the ### lexer's interface. Another idea would be to return EOF ### by exception, but EOF is actually not an exception at ### all. ### handle token print token token = Lexer.nextToken() antlr-2.7.7/examples/python/asn1/Makefile.in0000644000175000017500000000363710522211616020660 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/asn1 ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile %.py : $(_srcdir)/%.py @-@RMF@ $@ && @CP@ $< $@ ASN1TokenTypes.txt : $(_srcdir)/asn1tokens.txt @-@RMF@ $@ && @CP@ $< $@ g_FILES = \ $(_srcdir)/asn1.g \ $(eol) g_py_FILES = \ asn1_l.py \ $(eol) compile : $(g_py_FILES) test :: test1 test1_deps = \ asn1.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) asn1_l.py < $(_srcdir)/asn1.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) ASN1TokenTypes.txt @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup asn1 clean :: @@ECHO@ cleaning asn1 ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/asn1/asn1.in0000644000175000017500000007243510522211616020007 0ustar twernertwerner M { -- dub:111 iso member-body(2) f(250) type-org(1) ft(16) asn1-book(9) chapter9(1) module1(0) } DEFINITIONS AUTOMATIC TAGS EXTENSIBILITY IMPLIED ::= BEGIN -- wh: more than one export section is accepted by the parser. EXPORTS; EXPORTS ALL; EXPORTS T{},T,v; -- wh: more than one import section will be syntactially allowed - shall be -- checked during semantic analysis. This will allow to have multiple variants -- within one file to be syntax checked. IMPORTS ; IMPORTS -- dub:111 Type1 FROM Module1 { iso member-body(2) f(250) type-org(1) ft(16) asn1-book(9) chapter9(1) module1(0) } value2 FROM Module2 { iso member-body(2) f(250) type-org(1) ft(16) asn1-book(9) chapter9(1) module2(1) } ; IMPORTS P{} FROM Module3 { iso member-body(2) f(250) type-org(1) ft(16) asn1-book(9) chapter9(1) module2(1) } ; IMPORTS T{} FROM Module3 ; IMPORTS T FROM Module3 ; IMPORTS v FROM Module3 ; IMPORTS T{},T,v FROM Module3 ; IMPORTS T{} FROM Module m T FROM Module m v FROM Module m ; IMPORTS T{} FROM Module T FROM Module v FROM Module ; I ::= INTEGER R ::= REAL v X ::= 5 cr IA5String ::= "\r" S00 ::= SEQUENCE { } S01 ::= SEQUENCE { a INTEGER } S02 ::= SEQUENCE { a INTEGER, b INTEGER OPTIONAL, c INTEGER DEFAULT 0 , COMPONENTS OF X } S03 ::= SEQUENCE { ... } S04 ::= SEQUENCE { ... !INTEGER:4 } S05 ::= SEQUENCE { ... !-5 } S65 ::= SEQUENCE { ... !a } S07 ::= SEQUENCE { ... !SEQUENCE { a INTEGER } : 5 } S08 ::= SEQUENCE { a INTEGER, ... } S09 ::= SEQUENCE { a INTEGER, ... !INTEGER:4 } S10 ::= SEQUENCE { a INTEGER, ... !-5 } S11 ::= SEQUENCE { a INTEGER, ... !a } S12 ::= SEQUENCE { a INTEGER, ... !SEQUENCE { a INTEGER } : 5 } S13 ::= SEQUENCE { ..., a INTEGER, ... } S14 ::= SEQUENCE { ... !INTEGER:4, a INTEGER, ... !INTEGER:4 } S15 ::= SEQUENCE { ... !-5, a INTEGER, ... !-5 } S16 ::= SEQUENCE { ... !a, a INTEGER, ... !a } S17 ::= SEQUENCE { ... !SEQUENCE { a INTEGER } : 5, a INTEGER, ... !SEQUENCE { a INTEGER } : 5 } S18 ::= SEQUENCE { a INTEGER, ..., [[d D, e E]], ..., c C } C ::= CLASS { &T, &T OPTIONAL, &T DEFAULT INTEGER, &c INTEGER, &c INTEGER OPTIONAL, &c INTEGER DEFAULT 5, &c INTEGER UNIQUE, &c INTEGER UNIQUE OPTIONAL, &c INTEGER UNIQUE DEFAULT 5 } OTHER-FUNCTION ::= CLASS { -- fixed-type value field spec -- &code INTEGER -- (0 .. MAX) -- UNIQUE, -- fixed-type value set field spec -- &Alphabet BMPString DEFAULT {Latin1 INTERSECTION Level1} , -- type field spec -- &ArgumentType, -- variable-type value set field spec &SupportedArguments &ArgumentType OPTIONAL, -- variable type value field spec &result-if-error &ResultType DEFAULT NULL, -- object field spec &associated-function OTHER-FUNCTION OPTIONAL, -- object set field spec -- &Errors ERROR DEFAULT { rejected-memory | memory-fault } , -- type field spec &ResultType DEFAULT NULL } v X ::= {} v X ::= { 1 UNION 2 } v X ::= { (2|3) INTERSECTION (3|4) } v X ::= { ALL EXCEPT 1 } v X ::= { ALL EXCEPT 1 } v X ::= { 1|2|3^4|5 } v X ::= { {1|2|3^4|5} } v X ::= { {{1}|2|3^4|5} } v X ::= { (1|2|3) EXCEPT 3 } v X ::= { 1|2|3 EXCEPT 3 } v X ::= { 5 , ... } v X ::= { 5 , ... , 5 } v X ::= { ... } v X ::= { ..., 5 } Person ::= SEQUENCE { age INTEGER , name IA5String } -- pki93 Extension ::= SEQUENCE { extnId EXTENSION.&id ({ExtensionSet}), critical BOOLEAN DEFAULT FALSE, extnValue OCTET STRING } EXTENSION ::= CLASS { &id OBJECT IDENTIFIER UNIQUE, &ExtnType } WITH SYNTAX { SYNTAX &ExtnType IDENTIFIED BY &id } T ::= INTEGER ( {SupportedAttributes} {@type} ) AttributeTypeAndValue ::= SEQUENCE { type ATTRIBUTE.&id ({SupportedAttributes}), value ATTRIBUTE.&Type ({SupportedAttributes}{@type}) } Attribute ::= SEQUENCE { type ATTRIBUTE.&id ({SupportedAttributes}), values SET SIZE (1 .. MAX) OF ATTRIBUTE.&Type ({SupportedAttributes}{@type})} C::= CLASS { &T, &id INTEGER } WITH SYNTAX { TYPE &T MAPPED BY &id [&a] [A [&b] C] } c C ::= { TYPE IA5String MAPPED BY 5 } -- dub: 106 TypeReference ::= CHOICE { integer INTEGER, boolean BOOLEAN } value-reference TypeReference ::= integer : 12 -- dub: 107 Pair ::= SEQUENCE { x INTEGER, y INTEGER } Couple ::= SEQUENCE { x INTEGER, y INTEGER } pair Pair ::= { x 5, y 13 } couple Couple ::= pair Lighter-state ::= ENUMERATED { on(0), off(1), out-of-order(2) } Kettle-state ::= ENUMERATED { on(0), off(1), out-of-order(2) } lighter Lighter-state ::= on kettle Kettle-state ::= lighter PrimeNumbers INTEGER ::= { 2 | 3 | 5 | 7 | 11 | 13 } -- dub: 112 Type2 ::= SET { a Type1 DEFAULT value1, b BOOLEAN } -- dub: 125 T1 ::= [0] SET { name PrintableString, age INTEGER, gender BOOLEAN -- male = TRUE -- } U1 ::= [1] SET { gender Male, name VisibleString, age INTEGER } -- dub: 126 T2 ::= [0] SEQUENCE { name [0] PrintableString, age INTEGER } U2 ::= [2] SEQUENCE { name [1] PrintableString, age INTEGER } -- dub: 128 RoundResult ::= BOOLEAN ok RoundResult ::= TRUE ko RoundResult ::= FALSE Married ::= BOOLEAN kim MALE ::= TRUE -- dub: 129 Ack ::= NULL Clock ::= CHOICE { time UTCTime, out-of-order NULL } battery-down Clock ::= out-of-order:NULL -- dub: 130 LinkedList ::= SEQUENCE { data Data, next CHOICE { linked-list LinkedList, end NULL} } --LinkedList ::= SEQUENCE OF Data -- dub: 131 zero INTEGER ::= 0 french-population INTEGER ::= 60000000000 fridge-temperature INTEGER ::= -18 -- in Centigrade scale -- no constraints yet Interval ::= INTEGER (123456789..1234567890) -- dub: 132 ErrorCode ::= INTEGER { disk-full(1), no-disk(-1), disk-not-formatted(2) } stupid-error ErrorCode ::= disk-full ok ErrorCode ::= 0 stupid-error ErrorCode ::= 1 AbortReason ::= INTEGER { reason-not-specified(0), unrecognized-ppdu(1), unexpected-ppdu(2), unexpected-session-service-primitive(3), unrecognized-ppdu-parameter(4), unexpected-ppdu-parameter(5), invalid-ppdu-parameter-value(6) } -- dub: 133 Temperature ::= INTEGER { freezing(0), boiling(100) } alpha INTEGER ::= 1 Type1 ::= INTEGER { alpha(2) } Type2 ::= INTEGER { alpha(3), beta(alpha) } gamma Type2 ::= beta delta Type2 ::= alpha -- dub: 136 -- [..] -- dub: 137 RadioButton ::= ENUMERATED { button1,button2,button3 } RadioButton ::= ENUMERATED { button1, button2, button3, ...} RadioButton ::= ENUMERATED { button1, button2, button3, ..., button4, button5 } -- dub: 138 -- [..] -- dub: 141 ExtendedReal ::= CHOICE { decimal REAL, particular-real ENUMERATED { one-third,pi,e, ...} } pi REAL ::= { mantissa 314159, base 10, exponent -5 } e REAL ::= { mantissa 271828128459045235360287, base 10, exponent -23 } zero REAL ::= 0 -- dub: 142 -- [..] -- dub: 145 SubjectPublicKeyInfo ::= SEQUENCE { algorithm AlgorithmIdentifier , subjectPublicKey BIT STRING } pi-decimals BIT STRING ::= '001000100'B pi-decimals BIT STRING ::= '243F68885A'H -- dub: 146 -- [..] Rights ::= BIT STRING { user-read(0), user-write(1), group-read(2), group-write(3), other-read(4), other-write(5) } group1 Rights ::= { group-read,group-write} group2 Rights ::= '0011'B group3 Rights ::= '3'H group4 Rights ::= '001100'B weired-rights Rights ::= '000001'B -- dub: 148 -- [..] alpha INTEGER ::= 1 BinaryString ::= BIT STRING { alpha(3), beta(alpha) } -- dub: 151 icon OCTET STRING ::= '00110010100101'B icon OCTET STRING ::= '349aB'H internet-id OBJECT IDENTIFIER ::= { iso(1) identified-organization(4) dod(6) internet(1)} francetelecom-id OBJECT IDENTIFIER ::= { iso member-body f(250) type-org(1) ft(16)} ber-id OBJECT IDENTIFIER ::= { 2 1 1 } -- dub: 260 Two ::= INTEGER (2) Day ::= ENUMERATED { tuesday(2), wednesday(3), thursday(4) } Wednesday ::= Day (wednesday) FourZ ::= IA5String ("ZZZZ") Afters ::= CHOICE { cheese IA5String, dessert ENUMERATED { profiteroles(1), sabayon(2), fraisier(3) } } CompulsoryAfters ::= Afters (desert:sabayon) -- dub: 262 Weekend ::= Day(saturday|sunday) PushButtonDial ::= IA5String ("0"|"1"|"2"|"3"|"4"|"5"|"6"|"7"|"8"|"9"|"*"|"#") FrenchWeekend ::= Day(Weekend) -- dub: 263 LongWeekend ::= Day(Weekend|monday) T1 ::= INTEGER { trois(3), quatre(4) } T2 ::= INTEGER { one(1),two(2),three(3), four(4) } (T1) FrenchWeekend ::= Day(INCLUDES Weekend) -- dub: 264 Number ::= INTEGER From3to15 ::= Number (3 .. 15) From4to14 ::= Number (3<..<15) Positive ::= NUMBER (0<..MAX) Negative ::= NUMBER (MIN..<0) Zero ::= NUMBER (-1<..<1) T ::= REAL (0..<{mantissa 5,base 10, exponent 0}) U ::= T({mantissa 2, base 10, exponent 0} .. MAX) T ::= INTEGER ({ExtensionSet}) --dub: 266 Exactly31BitsString ::= BIT STRING (SIZE (31)) StringOf31BitsAtTheMost ::= BIT STRING (SIZE (0..31)) EvenNumber ::= INTEGER (2|4|6|8|10) EvenLengthString ::= IA5String (SIZE (INCLUDES EvenNumber)) NonEmptyString ::= OCTET STRING (SIZE (1..MAX)) ListOfStringsOf5Characters ::= SEQUENCE OF PrintableString (SIZE (5)) -- dub: 267 ListOfStrings ::= SEQUENCE OF PrintableString ListOf5Strings ::= ListOfStrings (SIZE (5)) ListOf5Strings ::= SEQUENCE (SIZE (5)) OF PrintableString ListOf5StringsOf5Characters ::= SEQUENCE (SIZE (5)) OF PrintableString (SIZE (5)) ListOf5StringsOf5Characters ::= SEQUENCE SIZE (5) OF PrintableString (SIZE (5)) -- dub: 268 Morse ::= PrintableString (FROM ("."|"-"|" ")) IDCardNumber ::= NumericString (FROM ("0".."9")) PushButtonDialSequence ::= IA5String (FROM ("0".."9"|"*"|"#")) --dub: 271 DateAndTime ::= VisibleString(PATTERN "\d#2/\d#2/\d#4-\d#2:\d#2") -- DD/MM/YYYY-HH:MM -- dub: 275 DateAndTime ::= VisibleString (PATTERN "((\d#2)/(\d#2)/(\d#4)-(\d#2:\d#2))") -- \1 is a date in which \2 is the month, \3 the day, -- \4 the year and \5 the time (in hours and minutes) -- dub: 280 ROIV-m-Linked-Reply-Action ::= ROIV-m-Linked-Reply (WITH COMPONENTS { invokedID PRESENT, linked-ID PRESENT, operation-value (m-Linked-Reply), argument (INCLUDES LinkedReplyArgument (WITH COMPONENTS { getResult ABSENT, getListError ABSENT, setResult ABSENT, setListError ABSENT, actionResult PRESENT, processingFailure PRESENT, deleteResult ABSENT, actionError PRESENT, deleteError ABSENT }))}) Choice ::= CHOICE { a A, b B, c C, d D } ChoicesCD ::= Choice ( WITH COMPONENTS {...,a ABSENT, b ABSENT} ) ChoiceCD ::= Choice (WITH COMPONENTS {..., a ABSENT, b ABSENT}) ChoiceA1 ::= Choice (WITH COMPONENTS {..., a PRESENT}) ChoiceA2 ::= Choice (WITH COMPONENTS {a PRESENT}) ChoiceBCD ::= Choice (WITH COMPONENTS {a ABSENT, b, c}) -- dub: 284 MoreCompact ::= OCTET STRING (CONTAINING MyType ENCODED BY {joint-iso-itu-t asn1 packed-encoding(3) basic(0) unaligned(1)}) -- dub: 285 PhoneNumber ::= NumericString (FROM ("0".."9"))(SIZE (10)) Row ::= SEQUENCE OF INTEGER -- dub: 287 Lipogramme ::= IA5String (FROM (ALL EXCEPT ("e"|"E"))) SaudiName ::= BasicArabic (SIZE (1..100) ^ Level2) ISO-10646-String ::= BMPString (FROM (Level2 ^ (BasicLatin | HebrewExtended | Hiragana))) KatakanaAndBasicLatin ::= UniversalString (FROM (Katakana | BasicLatin)) CapitalAndSmall ::= IA5String (FROM ("A".."Z"|"a".."z")) CapitalOrSmall ::= IA5String (FROM ("A".."Z")|FROM ("a".."z")) ExoticString ::= IA5String (SIZE (1..4)|FROM ("abc")) -- dub: 288 InvokeId ::= CHOICE { present INTEGER, absent NULL } DAP-InvokeIdSet ::= InvokeId (ALL EXCEPT absent:NULL) Identifications ::= SEQUENCE { idNumber NumericString (FROM (ALL EXCEPT " ")) (SIZE (6)) OPTIONAL, telephone NumericString (FROM (ALL EXCEPT " ")) (SIZE (13)) OPTIONAL } Person ::= SEQUENCE { name PrintableString (SIZE (1..20)), ident Identifications (WITH COMPONENTS {idNumber} |WITH COMPONENTS {telephone}) } -- dub: 291 A ::= INTEGER (0..10, ...) A ::= INTEGER (0..10, ..., 12) -- dub: 292 S ::= IA5String (SIZE (1..10, ...)) E ::= INTEGER (1..10, ...!Exception:too-large-integer) Exception ::= ENUMERATED {too-large-integer, ...} ImplementedUnivStr{UniversalString:Level} ::= UniversalString (FROM ((Level UNION BasicLatin)) !characterSet-problem) characterSet-problem INTEGER ::= 4 T ::= INTEGER (0..10, ...!10) U ::= T (2..6, ...!6) -- dub: 293 ImplementedUnivStgLevel1{UniversalString:ImplementedSubset} ::= UniversalString (ImplementedUnivStr{{Level1}} INTERSECTION ImplementedSubset, ...!level1-problem) level1-problem INTEGER ::= 5 -- dub: 295 PDV-List ::= SEQUENCE { transfer-syntax-name Transfer-syntax-name OPTIONAL, presentation-context-identifier Presentation-context-identifier, presentation-data-values CHOICE { single-ASN1-type [0] ABSTRACT-SYNTAX.&Type (CONSTRAINED BY {-- Type corresponding -- -- to presentation-context-identifier --}), octet-aligned [1] IMPLICIT OCTET STRING, arbitrary [2] IMPLICIT BIT STRING } } Reject ::= SEQUENCE { invokeId InvokeId, problem CHOICE { general [0] GeneralProblem, invoke [1] InvokeProblem, returnResult [2] ReturnResultProblem, returnError [3] ReturnErrorProblem }} (CONSTRAINED BY {-- must conform to the above -- -- definition --} ! RejectProblem:general-mistypedPDU) Encrypted{TypeToBeEnciphered} ::= BIT STRING (CONSTRAINED BY {-- must be the result of the encipherment -- -- of some BER-encoded value of -- TypeToBeEnciphered} !Error:securityViolation) Error ::= ENUMERATED {securityViolation} -- dub: 299 EXTERNAL ::= [UNIVERSAL 8] IMPLICIT SEQUENCE { direct-reference OBJECT IDENTIFIER OPTIONAL, indirect-reference INTEGER OPTIONAL, data-value-descriptor ObjectDescriptor OPTIONAL, encoding CHOICE { single-ASN1-type [0] ANY, octet-aligned [1] IMPLICIT OCTET STRING, arbitrary [2] IMPLICIT BIT STRING }} CoordinateMatrix ::= SEQUENCE SIZE (6) OF Row ( SIZE (6)) (WITH COMPONENT (-100..100)) TextBlock ::= SEQUENCE OF VisibleString Address ::= TextBlock (SIZE (3..6))(WITH COMPONENT (SIZE (1..32))) Address ::= TextBlock (WITH COMPONENT (SIZE (1..32))) PushButtonDialSequence ::= IA5String (FROM ("0".."9"|"*"|"#")) SIGNED { ToBeSigned } ::= SEQUENCE { toBeSigned ToBeSigned, algorithm AlgorithmIdentifier, signature BIT STRING } DirectoryString { INTEGER:maxSize } ::= CHOICE { teletexString TeletexString (SIZE (1..maxSize)), printableString PrintableString (SIZE (1..maxSize)), universalString UniversalString (SIZE (1..maxSize)), bmpString BMPString (SIZE(1..maxSize)), utf8String UTF8String (SIZE(1..maxSize)) } LinkedList ::= SEQUENCE SIZE (1..MAX) OF T GeneralName ::= CHOICE { otherName [0] INSTANCE OF OTHER-NAME, rfc822Name [1] IA5String, dNSName [2] IA5String, x400Address [3] ORAddress, directoryName [4] Name, ediPartyName [5] EDIPartyName, uniformResourceIdentifier [6] IA5String, iPAddress [7] OCTET STRING, registeredID [8] OBJECT IDENTIFIER } OTHER-NAME ::= TYPE-IDENTIFIER EDIPartyName ::= SEQUENCE { nameAssigner DirectoryString {ub-name} } extendedKeyUsage EXTENSION ::= { SYNTAX SEQUENCE SIZE (1..MAX) OF KeyPurposeId IDENTIFIED BY id-ce-extKeyUsage } -- dub: 313 FUNCTION ::= CLASS { &ArgumentType , &ResultType DEFAULT NULL, &Errors ERROR OPTIONAL, &code INTEGER UNIQUE } addition-of-2-integers FUNCTION ::= { &ArgumentType SEQUENCE { a INTEGER, b INTEGER }, &ResultType INTEGER, -- empty error list by default &code 1 } -- dub: 314 OTHER-FUNCTION ::= CLASS { &code INTEGER (0..MAX) UNIQUE, &Alphabet BMPString DEFAULT {Latin1 INTERSECTION Level1}, &ArgumentType , &SupportedArguments &ArgumentType OPTIONAL, &ResultType DEFAULT NULL, &result-if-error &ResultType DEFAULT NULL, &associated-function OTHER-FUNCTION OPTIONAL, &Errors ERROR DEFAULT {rejected-argument | memory-fault} } rejected-argument ERROR ::= {-- object definition --} memory-fault ERROR ::= {-- object definition --} -- dub: 315 other-addition-of-2-integers OTHER-FUNCTION ::= { &ArgumentType Pair, &SupportedArguments {PosPair | NegPair}, &ResultType INTEGER, &result-if-error 0, &code 1 } Pair ::= SEQUENCE {a INTEGER, b INTEGER} PosPair ::= Pair (WITH COMPONENTS {a(0..MAX), b(0..MAX)}) NegPair ::= Pair (WITH COMPONENTS {a(MIN..0), b(MIN..0)}) -- dub: 323 OTHER-FUNCTION ::= CLASS { &code INTEGER (0..MAX) UNIQUE, &Alphabet BMPString DEFAULT {Latin1 INTERSECTION Level1}, &ArgumentType , &SupportedArguments &ArgumentType OPTIONAL, &ResultType DEFAULT NULL, &result-if-error &ResultType DEFAULT NULL, &associated-function OTHER-FUNCTION OPTIONAL, &Errors ERROR DEFAULT {rejected-argument|memory-fault} } WITH SYNTAX { ARGUMENT TYPE &ArgumentType, [SUPPORTED ARGUMENTS &SupportedArguments,] [RESULT TYPE &ResultType, [RETURNS &result-if-error IN CASE OF ERROR,]] -- syntax error if ']]' (solved) [ERRORS &Errors,] [MESSAGE ALPHABET &Alphabet,] [ASSOCIATED FUNCTION &associated-function,] CODE &code } memory-fault ERROR ::= {-- object definition --} -- dub: 315 other-addition-of-2-integers OTHER-FUNCTION ::= { &ArgumentType Pair, &SupportedArguments {PosPair | NegPair}, &ResultType INTEGER, &result-if-error 0, &code 1 } Pair ::= SEQUENCE {a INTEGER, b INTEGER} PosPair ::= Pair (WITH COMPONENTS {a(0..MAX), b(0..MAX)}) NegPair ::= Pair (WITH COMPONENTS {a(MIN..0), b(MIN..0)}) -- dub: 327 ATTRIBUTE ::= CLASS { &derivation ATTRIBUTE OPTIONAL, &Type OPTIONAL, &equality-match MATCHING-RULE OPTIONAL, &ordering-match MATCHING-RULE OPTIONAL, &substrings-match MATCHING-RULE OPTIONAL, &single-valued BOOLEAN DEFAULT FALSE, &collective BOOLEAN DEFAULT FALSE, &no-user-modification BOOLEAN DEFAULT FALSE, &usage Attribute-Usage DEFAULT userApplications, &id OBJECT IDENTIFIER UNIQUE} WITH SYNTAX { [SUBTYPE OF &derivation] [WITH SYNTAX &Type] [EQUALITY MATCHING RULE &equality-match] [ORDERING MATCHING RULE &ordering-match] [SUBSTRINGS MATCHING RULE &substrings-match] [SINGLE VALUE &single-valued] [COLLECTIVE &collective] [NO USER MODIFICATION &no-user-modification] [USAGE &usage] ID &id } AttributeUsage ::= ENUMERATED { userApplications(0), directoryOperation(1), distributedOperation(2), dSAOperation(3) } MATCHING-RULE ::= CLASS { &AssertionType OPTIONAL, &id OBJECT IDENTIFIER UNIQUE } WITH SYNTAX { [SYNTAX &AssertionType] ID &id } name ATTRIBUTE ::= { WITH SYNTAX DirectoryString EQUALITY MATCHING RULE caseIgnoreMatch ID {joint-iso-itu-t ds(5) attributeType(4) 2} } DirectoryString ::= CHOICE { teletexString TeletexString (SIZE (1..maxSize)), printableString PrintableString (SIZE (1..maxSize)), universalString UniversalString (SIZE (1..maxSize)), bmpString BMPString (SIZE (1..maxSize)), utf8String UTF8String (SIZE (1..maxSize)) } maxSize INTEGER ::= 25 caseIgnoreMatch MATCHING-RULE ::= { SYNTAX DirectoryString ID {id-mr 2} } id-mr OBJECT IDENTIFIER ::= { joint-iso-itu-t ds(5) matchingRule(13) } MatchingRules MATCHING-RULE ::= { caseIgnoreMatch | booleanMatch | integerMatch } --dub: 328 AttributeUsage ::= ENUMERATED { userApplications(0), directoryOperation(1), distributedOperation(2), dSAOperation(3) } MATCHING-RULE ::= CLASS { &AssertionType OPTIONAL, &id OBJECT IDENTIFIER UNIQUE } WITH SYNTAX { [SYNTAX &AssertionType] ID &id } --dub: 329 name ATTRIBUTE ::= { WITH SYNTAX DirectoryString EQUALITY MATCHING RULE caseIgnoreMatch ID {joint-iso-itu-t ds(5) attributeType(4) 2} } DirectoryString ::= CHOICE { teletexString TeletexString (SIZE (1..maxSize)), printableString PrintableString (SIZE (1..maxSize)), universalString UniversalString (SIZE (1..maxSize)), bmpString BMPString (SIZE (1..maxSize)), utf8String UTF8String (SIZE (1..maxSize)) } maxSize INTEGER ::= 25 caseIgnoreMatch MATCHING-RULE ::= { SYNTAX DirectoryString ID {id-mr 2} } id-mr OBJECT IDENTIFIER ::= { joint-iso-itu-t ds(5) matchingRule(13) } --dub: 330 LessMatchingRules MATCHING-RULE ::= { MatchingRules EXCEPT caseIgnoreMatch } ExtensibleMatchingRules MATCHING-RULE ::= { caseIgnoreMatch | booleanMatch | integerMatch, ... } ExtensibleMatchingRules MATCHING-RULE ::= {...} --dub: 331 Values INTEGER ::= { 1 | 2 | 3 } Values ::= INTEGER (1|2|3) --dub: 337 id-mr-caseIgnoreMatch OBJECT IDENTIFIER ::= caseIgnoreMatch.&id CLASS1 ::= CLASS { &obj CLASS2 } CLASS2 ::= CLASS { &val INTEGER } object1 CLASS1 ::= { &obj object2 } object2 CLASS2 ::= { &val 5 } value INTEGER ::= object1.&obj.&val Oids OBJECT IDENTIFIER ::= {MatchingRules.&id} Oids OBJECT IDENTIFIER ::= { {id-mr 2} | {id-mr 12} | {id-mr 13} } SupportedFunctions OTHER-FUNCTION ::= { addition-of-2-integers | substraction-of-2-integers | multiplication-of-2-integers } -- dub: 342 surname ATTRIBUTE ::= { -- family name SUBTYPE OF name WITH SYNTAX DirectoryString ID id-at-surname } givenName ATTRIBUTE ::= { -- first name SUBTYPE OF name WITH SYNTAX DirectoryString ID id-at-givenName } countryName ATTRIBUTE ::= { -- country SUBTYPE OF name WITH SYNTAX PrintableString (SIZE (2)) -- [ISO3166] SINGLE VALUE TRUE ID id-at-countryName} SupportedAttributes ATTRIBUTE ::= {surname | givenName | countryName} AttributeIdAndValue1 ::= SEQUENCE { ident ATTRIBUTE.&id, value ATTRIBUTE.&Type } -- dub: 343 AttributeIdAndValue2 ::= SEQUENCE { ident ATTRIBUTE.&id({SupportedAttributes}), value ATTRIBUTE.&Type({SupportedAttributes}) } -- dub: 344 value AttributeIdAndValue2 ::= { ident id-at-countryName, -- value DirectoryString:universalString:"$$Escher$$" -- -- wh: bug } -- dub: 345 AttributeIdAndValue3 ::= SEQUENCE { ident ATTRIBUTE.&id({SupportedAttributes}), value ATTRIBUTE.&Type({SupportedAttributes}{@ident}) } -- dub: 346 AttributeIdAndValue3 ::= SEQUENCE { ident ATTRIBUTE.&id({SupportedAttributes}), value ATTRIBUTE.&Type({SupportedAttributes}{@ident}) } -- dub: 353 AttributeIdAndValue3 ::= SEQUENCE { ident ATTRIBUTE.&id({SupportedAttributes}), value ATTRIBUTE.&Type({SupportedAttributes}{@.ident})} AttributeIdsAndValues ::= SET OF SEQUENCE { ident ATTRIBUTE.&id({SupportedAttributes}), value ATTRIBUTE.&Type({SupportedAttributes}{@.ident})} AttributeValueAssertion ::= SEQUENCE { type ATTRIBUTE.&Id({SupportedAttributes}), assertion ATTRIBUTE.&equality-match.&AssertionType ({SupportedAttributes}{@type}) } -- dub: 354 FilterItem ::= CHOICE { equality [0] AttributeValueAssertion, substrings [1] SEQUENCE { type Attribute.&id({SupportedAttributes}), strings SEQUENCE OF CHOICE { initial [0] ATTRIBUTE.&Type ({SupportedAttributes}{@substrings.type}), any [1] ATTRIBUTE.&Type ({SupportedAttributes}{@substrings.type}), final [2] ATTRIBUTE.&Type ({SupportedAttributes}{@substrings.type}) }}, greaterOrEqual [2] AttributeValueAssertion, lessOrEqual [3] AttributeValueAssertion, present [4] AttributeType, approximateMatch [5] AttributeValueAssertion, extensibleMatch [6] MatchingRuleAssertion } Attribute-desc ::= SEQUENCE { usage ATTRIBUTE.&usage({SupportedAttributes}), list SEQUENCE OF SEQUENCE { ident ATTRIBUTE.&id({SupportedAttributes}{@usage}), value ATTRIBUTE.&Type ({SupportedAttributes}{@usage,@.ident}) }} -- dub: 355 att-desc Attribute-desc ::= { usage userApplications, list { { ident id-at-objectClass, value oid }, { ident id-at-aliasedEntryName, value distinguishedName }}} -- dub: 356 Authentication-value ::= CHOICE { charstring [0] IMPLICIT GraphicString, bitstring [1] BIT STRING, external [2] EXTERNAL, other [3] IMPLICIT SEQUENCE { other-mechanism-name MECHANISM-NAME.&id({ObjectSet}), other-mechanism-value MECHANISM-NAME.&Type ({ObjectSet}{@.other-mechanism-name}) }} TYPE-IDENTIFIER ::= CLASS { &id OBJECT IDENTIFIER UNIQUE, &Type } WITH SYNTAX {&Type IDENTIFIED BY &id} MECHANISM-NAME ::= TYPE-IDENTIFIER Authentication-value ::= CHOICE { charstring [0] IMPLICIT GraphicString, bitstring [1] BIT STRING, external [2] EXTERNAL, other [3] IMPLICIT SEQUENCE { other-mechanism-name MECHANISM-NAME.&id({ObjectSet}), other-mechanism-value MECHANISM-NAME.&Type ({ObjectSet}{@.other-mechanism-name}) }} T::= SEQUENCE { type-id TYPE-IDENTIFIER.&id, value [0] EXPLICIT TYPE-IDENTIFIER.&Type } -- dub: 358 ExtendedBodyPart ::= SEQUENCE { parameters [0] INSTANCE OF TYPE-IDENTIFIER OPTIONAL, data INSTANCE OF TYPE-IDENTIFIER } (CONSTRAINED BY { -- must correspond to the ¶meters -- -- and &data fields of a member of -- IPMBodyPartTable} ) TYPE-IDENTIFIER ::= CLASS { &id OBJECT IDENTIFIER UNIQUE, &Type } WITH SYNTAX { &Type IDENTIFIED BY &id } -- dub: 360 ABSTRACT-SYNTAX ::= CLASS { &id OBJECT IDENTIFIER, &Type , &property BIT STRING {handles-invalid-encodings(0)} DEFAULT {} } WITH SYNTAX { &Type IDENTIFIED BY &id [HAS PROPERTY &property] } -- dub: 361 PDV-list ::= SEQUENCE { transfer-syntax-name Transfer-syntax-name OPTIONAL, presentation-context-identifier Presentation-context-identifier, presentation-data-values CHOICE { single-ASN1-type [0] ABSTRACT-SYNTAX.&Type (CONSTRAINED BY {-- Type which corresponds to -- -- the presentation context identifier --}), octet-aligned [1] IMPLICIT OCTET STRING, arbitrary [2] IMPLICIT BIT STRING }} -- dub: 379 DirectoryString{INTEGER:maxSize} ::= CHOICE { teletexString TeletexString (SIZE (1..maxSize)), printableString PrintableString (SIZE (1..maxSize)), universalString UniversalString (SIZE (1..maxSize)), bmpString BMPString (SIZE (1..maxSize)), utf8String UTF8String (SIZE (1..maxSize)) } -- dub: 380 SubstringAssertion ::= SEQUENCE OF CHOICE { initial [0] DirectoryString{ub-match}, any [1] DirectoryString{ub-match}, final [2] DirectoryString{ub-match} } ub-match INTEGER ::= 128 SubstringAssertion{INTEGER:ub-match} ::= SEQUENCE OF CHOICE { initial [0] DirectoryString{ub-match}, any [1] DirectoryString{ub-match}, final [2] DirectoryString{ub-match} } -- dub: 381 T ::= INTEGER List{T} ::= SEQUENCE OF T Choice{T} ::= CHOICE { a [0] T, b INTEGER } Structure{T} ::= SEQUENCE { a INTEGER, b [0] T OPTIONAL, c INTEGER } GeneralForm{T, T:val} ::= SEQUENCE { info T DEFAULT val, comments IA5String } -- dub: 382 Form ::= GeneralForm{BOOLEAN, TRUE} Form ::= SEQUENCE { info BOOLEAN DEFAULT TRUE, comments IA5String } pariTierce{INTEGER:first, INTEGER:second, INTEGER:third} SEQUENCE OF INTEGER ::= { first, second, third } -- dub: 382 MESSAGE-PARAMETERS ::= CLASS { &max-priority-level INTEGER, &max-message-buffer-size INTEGER, &max-reference-buffer-size INTEGER } WITH SYNTAX { MAXIMUM PRIORITY &max-priority-level MAXIMUM MESSAGE BUFFER &max-message-buffer-size MAXIMUM REFERENCE BUFFER &max-reference-buffer-size } Message-PDU{MESSAGE-PARAMETERS:param} ::= SEQUENCE { priority INTEGER (0..param.&max-priority-level !Exception:priority), message UTF8String (SIZE (0..param.&max-message-buffer-size) !Exception:message), comments UTF8String (SIZE (0..param.&max-reference-buffer-size) !Exception:comments) } Exception ::= ENUMERATED {priority(0), message(1), comments(2), ...} -- dub: 383 Forward{OPERATION:OperationSet} OPERATION ::= { OperationSet | OperationSet.&Linked.&Linked | OperationSet.&Linked.&Linked.&Linked.&Linked } Reverse{OPERATION:OperationSet} OPERATION ::= { Forward{{OperationSet.&Linked}} } -- dub: 383 ForwardAndReverse OPERATION ::= {Forward{{MyOperationSet}} UNION Reverse{{MyOperationSet}}} --dub: 387 Flag{Color} ::= SEQUENCE { country VisibleString, colors SEQUENCE OF Color DEFAULT {blue} } -- dub: 389 CharacterString{INTEGER:max-length} ::= CHOICE { teletexString TeletexString (SIZE (1..max-length) !exceeds-max-length), printableString PrintableString (SIZE (1..max-length) !exceeds-max-length) } exceeds-max-length INTEGER ::= 999 -- dub: 390 my-abstract-syntax {INTEGER:maxSize} ABSTRACT-SYNTAX ::= { my-PDU{size-max} IDENTIFIED BY {iso member-body(2) f(250) type-org(1) ft(16) asn1-book(9) chapter17(4) my-PDU(0)} } END -- dub: 499,500 MyHTTP DEFINITIONS AUTOMATIC TAGS ::= BEGIN GetRequest ::= SEQUENCE { header-only BOOLEAN, lock BOOLEAN, accept-types AcceptTypes, url Url, ... } AcceptTypes ::= SET { standards BIT STRING {html(0), plain-text(1), gif(2), jpeg(3)} (SIZE (4)) OPTIONAL, others SEQUENCE OF VisibleString (SIZE (4)) OPTIONAL } Url ::= VisibleString (FROM ("a".."z"|"A".."Z"|"0".."9"| "./-_~%#")) value GetRequest ::= { header-only TRUE, lock FALSE, accept-types { standards { html, plain-text } }, url "www.asn1.com" } END -- dub: 360 ProtocolName-Abstract-Syntax-Module {iso member-body(2) f(250) type-org(1) ft(16) asn1-book(9) chapter15(3) protocol-name(0)} DEFINITIONS ::= BEGIN IMPORTS ProtocolName-PDU FROM ProtocolName-Module {iso member-body(2) f(250) type-org(1) ft(16) asn1-book(9) chapter15(3) protocol-name(0) module1(2)}; protocolName-Abstract-Syntax ABSTRACT-SYNTAX ::= {ProtocolName-PDU IDENTIFIED BY protocolName-Abstract-Syntax-id} protocolName-Abstract-Syntax-id OBJECT IDENTIFIER ::= {iso member-body(2) f(250) type-org(1) ft(16) asn1-book(9) chapter15(3) protocol-name(0) abstract-syntax(0)} protocolName-Abstract-Syntax-descriptor ObjectDescriptor ::= "Abstract syntax of ProtocolName" protocolName-Transfer-Syntax-id OBJECT IDENTIFIER ::= {iso member-body(2) f(250) type-org(1) ft(16) asn1-book(9) chapter15(3) protocol-name(0) transfer-syntax(1)} protocolName-Transfer-Syntax-descriptor ObjectDescriptor ::= "Transfer syntax of ProtocolName" END antlr-2.7.7/examples/python/asn1/asn1tokens.txt0000644000175000017500000000375410522211616021442 0ustar twernertwerner// $ANTLR 2.7.4: parser.g -> parserTokenTypes.txt$ parser // output token vocab name VALUE_TOKEN_LIST=4 TYPE_DECL=5 CLASS_DECL=6 VALUE_DECL=7 MODULE_DECL=8 TOKEN_BSTRING=9 TOKEN_CSTRING=10 TOKEN_HSTRING=11 TOKEN_word=12 TOKEN_NUMBER=13 TOKEN_WORD=14 TOKEN_field=15 TOKEN_Field=16 TOKEN_FIELD=17 "-"=18 "+"=19 TOKEN_Word=20 LITERAL_BOOLEAN="BOOLEAN"=21 LITERAL_NULL="NULL"=22 LITERAL_INTEGER="INTEGER"=23 LITERAL_REAL="REAL"=24 TOKEN_BIT_STRING=25 TOKEN_OCTET_STRING=26 TOKEN_OBJECT_IDENTIFIER=27 "RELATIVE-OID"=28 "."=29 LITERAL_DEFINITIONS="DEFINITIONS"=30 "::="=31 LITERAL_BEGIN="BEGIN"=32 LITERAL_END="END"=33 "{"=34 "}"=35 "("=36 ")"=37 LITERAL_EXPLICIT="EXPLICIT"=38 LITERAL_TAGS="TAGS"=39 LITERAL_IMPLICIT="IMPLICIT"=40 LITERAL_AUTOMATIC="AUTOMATIC"=41 LITERAL_EXTENSIBILITY="EXTENSIBILITY"=42 LITERAL_IMPLIED="IMPLIED"=43 LITERAL_EXPORTS="EXPORTS"=44 ";"=45 ","=46 LITERAL_ALL="ALL"=47 LITERAL_IMPORTS="IMPORTS"=48 LITERAL_FROM="FROM"=49 ":"=50 LITERAL_CLASS="CLASS"=51 LITERAL_WITH="WITH"=52 LITERAL_SYNTAX="SYNTAX"=53 "["=54 "]"=55 LITERAL_APPLICATION="APPLICATION"=56 LITERAL_BY="BY"=57 LITERAL_COMPONENTS="COMPONENTS"=58 LITERAL_CONTAINING="CONTAINING"=59 LITERAL_DEFAULT="DEFAULT"=60 LITERAL_EXCEPT="EXCEPT"=61 LITERAL_INCLUDES="INCLUDES"=62 LITERAL_OF="OF"=63 LITERAL_OPTIONAL="OPTIONAL"=64 LITERAL_PATTERN="PATTERN"=65 LITERAL_PRIVATE="PRIVATE"=66 LITERAL_SIZE="SIZE"=67 LITERAL_UNIQUE="UNIQUE"=68 LITERAL_UNIVERSAL="UNIVERSAL"=69 "<"=70 LITERAL_SEQUENCE="SEQUENCE"=71 LITERAL_CHOICE="CHOICE"=72 LITERAL_SET="SET"=73 "[["=74 "]]"=75 "..."=76 "!"=77 LITERAL_ENUMERATED="ENUMERATED"=78 LITERAL_ANY="ANY"=79 TOKEN_DEFINED_BY=80 LITERAL_INSTANCE="INSTANCE"=81 LITERAL_TRUE="TRUE"=82 LITERAL_FALSE="FALSE"=83 "PLUS-INFINITY"=84 "MINUS-INFINITY"=85 "|"=86 LITERAL_UNION="UNION"=87 "^"=88 LITERAL_INTERSECTION="INTERSECTION"=89 LITERAL_MIN="MIN"=90 ".."=91 LITERAL_MAX="MAX"=92 TOKEN_ENCODED_BY=93 LITERAL_COMPONENT="COMPONENT"=94 LITERAL_PRESENT="PRESENT"=95 LITERAL_ABSENT="ABSENT"=96 "@"=97 TOKEN_CONSTRAINED_BY=98 antlr-2.7.7/examples/python/asn1/asn1.g0000644000175000017500000001634310522211616017623 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ header { // import language specific stuff // need to import my local module defining super classes etc. import asn1 } options { language="Python"; } class asn1_l extends Lexer("asn1.CharScanner"); options { k = 3; charVocabulary = '\3'..'\377'; caseSensitive=true; testLiterals = true; codeGenMakeSwitchThreshold = 2; codeGenBitsetTestThreshold = 2; importVocab=ASN1; } tokens { DOTDOT; ELLIPSIS; } ASSIGN_OP : "::=" ; BAR : '|' ; COLON : ':' ; COMMA : ',' ; DOT : '.' ; DOTDOT : ".." ; ELLIPSIS : "..." ; EXCLAMATION : '!' ; INTERSECTION : '^' ; LESS : '<' ; L_BRACE : '{' ; L_BRACKET : '[' ; LL_BRACKET : { self.state_with_syntax==False }? "[[" ; L_PAREN : '(' ; MINUS : '-' ; PLUS : '+' ; R_BRACE : '}' ; R_BRACKET : ']' ; RR_BRACKET : { self.state_with_syntax==False }? "]]" ; R_PAREN : ')' ; SEMI : ';' ; AT : '@' ; /* These are whitespace (without newline) characters according to X.680:2002 */ protected WSchr : '\t' // horizontal tab (HT) '\t' 0x09 9 | ' ' // space (SP) ' ' 0x20 32 ; /* Same as WSign - just ignore consumed character */ protected WSign : WSchr { $setText("") } ; /* the end of line */ protected EOLchr : ( options { generateAmbigWarnings = false; } : '\r''\n' | '\r' | '\n' // | '\v' // vertical tab (VT) 0x0b 11 // | '\f' // form feed (FF) '\f' 0x0c 12 ) { $newline } ; /* like EOL but we ignore the consumed symbol */ protected EOLign : EOLchr { $setText("") } ; /* like EOL but we normalize consumed symbol */ protected EOLnrm : EOLchr { $setText("\n") } ; /* upper (ASCII) case characters */ protected UPCHR : 'A' .. 'Z' ; /* lower (ASCII) case characters */ protected LOCHR : 'a' .. 'z' ; /* what's a (arabic) digit */ protected DIGIT : '0' .. '9' ; /* whats a (roman) letter - yes, the name sucks a bit */ protected CHR : UPCHR | LOCHR ; /* what's allowed in an identifier */ protected IDCHR : CHR | '-' | DIGIT ; /* a binary digit */ protected BINCHR : ('0'|'1') ; /* a hex digit */ protected HEXCHR : ('0'..'9') | ('A'..'F') | ('a'..'f') ; /* a binary string */ protected BINSTR : "'" (BINCHR|WSign|EOLign)+ "'B" ; /* a hex string */ protected HEXSTR : "'" (HEXCHR|WSign|EOLign)+ "'H" ; /* escape character in character strings */ protected CHResc : '"' '"' { $setText("\"") } ; /* define which input symbols we can skip (so called whitespace) */ WS : ( WSchr | EOLchr )+ { $skip } ; /* A number is a sequence of digits - note that deliberatly we allow ** here for tokens like '001' etc. */ TOKEN_NUMBER : (DIGIT)+ ; /* what's an idenifier */ ID { lowchrseen=False} : ("BIT" WS "STRING") => "BIT" WS "STRING" { $setType(TOKEN_BIT_STRING) } | ("OCTET" WS "STRING") => "OCTET" WS "STRING" { $setType(TOKEN_OCTET_STRING) } | ("OBJECT" WS "IDENTIFIER") => "OBJECT" WS "IDENTIFIER" { $setType(TOKEN_OBJECT_IDENTIFIER) } | ("ENCODED" WS "BY") => "ENCODED" WS "BY" { $setType(TOKEN_ENCODED_BY) } | ("CONSTRAINED" WS "BY") => "CONSTRAINED" WS "BY" { $setType(TOKEN_CONSTRAINED_BY) } | ("DEFINED" WS "BY") => "DEFINED" WS "BY" { $setType(TOKEN_DEFINED_BY) } | UPCHR ( LOCHR{lowchrseen=True}|UPCHR|DIGIT|'-')* { $setType(TOKEN_Word) if lowchrseen: pass else: $setType(TOKEN_WORD) } | LOCHR ( IDCHR )* { $setType(TOKEN_word) } ; /* what's a field */ FIELD { lowchrseen=False } : '&' UPCHR ( LOCHR{lowchrseen=True}|UPCHR|DIGIT|'-')* { $setType(TOKEN_Field) if lowchrseen: pass else: $setType(TOKEN_FIELD) } | '&' LOCHR ( IDCHR )* { $setType(TOKEN_field) } ; /* an octet string is either a bit string or a hex string */ OCTSTR : (BINSTR)=>BINSTR { $setType(TOKEN_BSTRING) } | HEXSTR { $setType(TOKEN_HSTRING) } ; /* A character string: this rule is not 1oo% correct as it will not ** ignore ws before and after eol. This needs best to be handled ** via a language specific function. Note that rule EOLnrm will ** replace any eol character by \n to simplify text processing. ** Contrary, ws is not normalized as ws can't be ignored in general. */ TOKEN_CSTRING : '"' (CHResc | EOLnrm | ~('"'|'\r'|'\n'))* '"' { s = self.chr_ws_erase($getText,"\n","\t ") $setText(s) } ; /* ASN.1 has kind of tricky comment rule: A comment starts with "--" ** and ends either with a "--" or with a eol character. Nesting of ** comments is therefore not possible, ie. ** -- not visible -- visible -- not visible ** The real ugly thing about this is that you can't just uncomment ** a line (regardless of it's content) by prefixing the liene with ** "--". For example assume you have this line: ** one INTEGER ::= 1 -- sample integer ** Then have this: ** -- one INTEGER ::= 1 -- sample integer ** This will hide ASN.1 and just makes the comment visible! */ COMMENT : "--" ( ~('-'|'\n'|'\r') | {self.LA(2) != '-'}? '-' )* { if self.LA(1) == '-': self.match("--"); $skip } ; ALTCOMMENT : { altcomment == true }? ( ALTCOMMENT1 | ALTCOMMENT2 | ALTCOMMENT3 ) { $skip } ; /* Due to problematic ASN.1 commentaries we have an alternative - ** "//" starts a comment that eat's up everything till end of line ** (as in C++ and Java). */ protected ALTCOMMENT1 : { altcomment == true }? "//" (~('\n'|'\r'))* { pass } ; /* We also also for typical C comments albeit not nested ones */ protected ALTCOMMENT2 : "/*" ( options { greedy=false; } : '\r' ( options { warnWhenFollowAmbig=false; } : '\n')? { $newline } | '\n' { $newline } | . )* "*/" { pass } ; /* And as homage to the master of style, Niklaus Wirth, we also also ** comments ala PASCAL */ protected ALTCOMMENT3 : "{*" ( options { greedy=false; } : '\r' ( options { warnWhenFollowAmbig=false; } : '\n')? { $nl } | '\n' { $nl; } | . )* "*}" { pass } ; antlr-2.7.7/examples/python/pascal/0000755000175000017500000000000010522211616017203 5ustar twernertwernerantlr-2.7.7/examples/python/pascal/Makefile.in0000644000175000017500000000367110522211616021257 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/pascal ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/pascal.g \ $(_srcdir)/pascalw.g \ $(eol) g_py_FILES = \ pascal_l.py \ pascal_p.py \ pascal_w.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ &&@CP@ $< $@ test :: test1 test1_deps = \ pascal.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) pascal_l.py < $(_srcdir)/pascal.in ;\ $(python) pascal.py < $(_srcdir)/pascal.in ;\ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup pascal clean :: @@ECHO@ cleaning pascal ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/pascal/pascalw.g0000644000175000017500000001611410522211616021010 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ // // Pascal Tree Super Grammar (symtab.g derives from this) // // Adapted from, // Pascal User Manual And Report (Second Edition-1978) // Kathleen Jensen - Niklaus Wirth // // By // // Hakki Dogusan dogusanh@tr-net.net.tr // // Then significantly enhanced by Piet Schoutteten // with some guidance by Terence Parr. Piet added tree // construction, and some tree walkers. // options { language=Python; } class pascal_w extends TreeParser; options { importVocab = Pascal; ASTLabelType = "pascal.PascalAST"; } program : programHeading block ; programHeading : #(PROGRAM IDENT identifierList) | #(UNIT IDENT) ; identifier : IDENT ; block : ( labelDeclarationPart | constantDefinitionPart | typeDefinitionPart | variableDeclarationPart | procedureAndFunctionDeclarationPart | usesUnitsPart | IMPLEMENTATION )* compoundStatement ; usesUnitsPart : #(USES identifierList) ; labelDeclarationPart : #(LABEL ( label )+) ; label : NUM_INT ; constantDefinitionPart : #(CONST ( constantDefinition )+ ) ; constantDefinition : #(EQUAL IDENT constant) ; constant : NUM_INT | NUM_REAL | #( PLUS ( NUM_INT | NUM_REAL | IDENT ) ) | #( MINUS ( NUM_INT | NUM_REAL | IDENT ) ) | IDENT | STRING_LITERAL | #(CHR (NUM_INT|NUM_REAL)) ; string : STRING_LITERAL ; typeDefinitionPart : #(TYPE ( typeDefinition )+) ; typeDefinition : #(TYPEDECL IDENT ( type | #(FUNCTION (formalParameterList)? resultType) | #(PROCEDURE (formalParameterList)?) ) ) ; type : #(SCALARTYPE identifierList) | #(DOTDOT constant constant) | typeIdentifier | structuredType | #(POINTER typeIdentifier) ; typeIdentifier : IDENT | CHAR | BOOLEAN | INTEGER | REAL | #( STRING ( IDENT | NUM_INT | NUM_REAL | ) ) ; structuredType : #(PACKED unpackedStructuredType) | unpackedStructuredType ; unpackedStructuredType : arrayType | recordType | setType | fileType ; /** Note here that the syntactic diff between brackets disappears. * If the brackets mean different things semantically, we need * two different alternatives here. */ arrayType : #(ARRAY typeList type) ; typeList : #( TYPELIST ( type )+ ) ; recordType : #(RECORD fieldList) ; fieldList : #( FIELDLIST ( fixedPart ( variantPart )? | variantPart ) ) ; fixedPart : ( recordSection )+ ; recordSection : #(FIELD identifierList type) ; variantPart : #( CASE tag ( variant )+ ) ; tag : #(VARIANT_TAG identifier typeIdentifier) | #(VARIANT_TAG_NO_ID typeIdentifier) ; variant : #(VARIANT_CASE constList fieldList) ; setType : #(SET type) ; fileType : #(FILE (type)?) ; /** Yields a list of VARDECL-rooted subtrees with VAR at the overall root */ variableDeclarationPart : #( VAR ( variableDeclaration )+ ) ; variableDeclaration : #(VARDECL identifierList type) ; procedureAndFunctionDeclarationPart : procedureOrFunctionDeclaration ; procedureOrFunctionDeclaration : procedureDeclaration | functionDeclaration ; procedureDeclaration : #(PROCEDURE IDENT (formalParameterList)? block ) ; formalParameterList : #(ARGDECLS ( formalParameterSection )+) ; formalParameterSection : parameterGroup | #(VAR parameterGroup) | #(FUNCTION parameterGroup) | #(PROCEDURE parameterGroup) ; parameterGroup : #(ARGDECL identifierList typeIdentifier) ; identifierList : #(IDLIST (IDENT)+) ; constList : #(CONSTLIST ( constant )+) ; functionDeclaration : #(FUNCTION IDENT (formalParameterList)? resultType block) ; resultType : typeIdentifier ; statement : #(COLON label unlabelledStatement) | unlabelledStatement ; unlabelledStatement : simpleStatement | structuredStatement ; simpleStatement : assignmentStatement | procedureStatement | gotoStatement ; assignmentStatement : #(ASSIGN variable expression) ; /** A variable is an id with a suffix and can look like: * id * id[expr,...] * id.id * id.id[expr,...] * id^ * id^.id * id^.id[expr,...] * ... * * LL has a really hard time with this construct as it's naturally * left-recursive. We have to turn into a simple loop rather than * recursive loop, hence, the suffixes. I keep in the same rule * for easy tree construction. */ variable : #(LBRACK variable (expression)+) | #(LBRACK2 variable (expression)+) | #(DOT variable IDENT) | #(POINTER variable) | #(AT IDENT) | IDENT ; expression : #(EQUAL expression expression) | #(NOT_EQUAL expression expression) | #(LT expression expression) | #(LE expression expression) | #(GE expression expression) | #(GT expression expression) | #(IN expression expression) | #(PLUS expression (expression)?) | #(MINUS expression (expression)?) | #(OR expression expression) | #(STAR expression expression) | #(SLASH expression expression) | #(DIV expression expression) | #(MOD expression expression) | #(AND expression expression) | #(NOT expression) | variable | functionDesignator | set | NUM_INT | NUM_REAL | #(CHR (NUM_INT|NUM_REAL)) | string | NIL ; functionDesignator : #(FUNC_CALL IDENT (parameterList)?) ; parameterList : #( ARGLIST (actualParameter)+ ) ; set : #(SET (element)*) ; element : #(DOTDOT expression expression) | expression ; procedureStatement : #(PROC_CALL IDENT ( parameterList )?) ; actualParameter : expression ; gotoStatement : #(GOTO label) ; structuredStatement : compoundStatement | conditionalStatement | repetetiveStatement | withStatement ; compoundStatement : statements ; statements : #(BLOCK (statement)*) ; conditionalStatement : ifStatement | caseStatement ; ifStatement : #(IF expression statement (statement)?) ; caseStatement //pspsps ??? : #(CASE expression ( caseListElement )+ ( statements )? ) ; caseListElement : #(COLON constList statement) ; repetetiveStatement : whileStatement | repeatStatement | forStatement ; whileStatement : #(WHILE expression statement) ; repeatStatement : #(REPEAT statements expression) ; forStatement : #(FOR IDENT forList statement) ; forList : #(TO initialValue finalValue) | #(DOWNTO initialValue finalValue) ; initialValue : expression ; finalValue : expression ; withStatement : #(WITH recordVariableList statement) ; recordVariableList : ( variable )+ ; antlr-2.7.7/examples/python/pascal/pascal.py0000644000175000017500000000362610522211616021027 0ustar twernertwernerimport sys import antlr class Visitor(antlr.ASTVisitor): def __init__(self,*args): super(Visitor,self).__init__(*args) self.level = 0 if not args: self.cout = sys.stdout return if isinstance(args[0],file): self.cout = args[0] return assert 0 def tabs(self): print " " * self.level def printf(self,fmt,*args): if not args: sys.stdout.write(fmt) return argv = tuple(args) self.cout.write(fmt % argv) def flush(self): self.cout.flush() def visit1(self,node): if not node: self.printf(" nil ") return c = node.getType() t = node.getText() k = node.getFirstChild() s = node.getNextSibling() self.printf("( <%s> ",c) if t: self.printf(" %s ",t) self.visit1(k); self.visit1(s); self.printf(")") def visit(self,node): self.visit1(node); self.printf("\n") class PascalAST(antlr.CommonAST): def __init__(self,*args): antlr.CommonAST.__init__(self,*args) def main(): import pascal_l import pascal_p import pascal_w L = pascal_l.Lexer() P = pascal_p.Parser(L) P.setFilename(L.getFilename()) ### Parse the input expression try: P.program() except antlr.ANTLRException, ex: print "*** error(s) while parsing." print ">>> exit(1)" import sys sys.exit(1) ast = P.getAST() if not ast: print "stop - no AST generated." import sys sys.exit(1) ###show tree print "Tree: " + ast.toStringTree() print "List: " + ast.toStringList() print "Node: " + ast.toString() print "visit>>" visitor = Visitor() visitor.visit(ast); print "visit<<" W = pascal_w.Walker() W.program(ast) print "Ast tree walked without problems." if __name__ == "__main__": main() antlr-2.7.7/examples/python/pascal/pascal.g0000644000175000017500000003672610522211616020634 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ header { import pascal } // options { language=Python; } // I just want to import something in generated parser? How would I do // that? { import pascal } class pascal_p extends Parser; options { k = 2; // two token lookahead exportVocab=Pascal; // Call its vocabulary "Pascal" codeGenMakeSwitchThreshold = 2; // Some optimizations codeGenBitsetTestThreshold = 3; defaultErrorHandler = false; // Don't generate parser error handlers buildAST = true; ASTLabelType = "pascal.PascalAST"; } /* Define imaginary tokens used to organize tree * * One of the principles here is that any time you have a list of * stuff, you usually want to treat it like one thing (a list) a some * point in the grammar. You want trees to have a fixed number of children * as much as possible. For example, the definition of a procedure should * be something like #(PROCEDURE ID #(ARGDECLS ARG1 ARG2...)) not * #(PROCEDURE ID ARG1 ARG2 ... ) since this is harder to parse and * harder to manipulate. Same is true for statement lists (BLOCK) etc... */ tokens { BLOCK; // list of statements IDLIST; // list of identifiers; e.g., #(PROGRAM #(IDLIST ID ID...)) ELIST; // expression list for proc args etc... FUNC_CALL; PROC_CALL; SCALARTYPE; // IDLIST that is really a scalar type like (Mon,Tue,Wed) TYPELIST; // list of types such as for array declarations VARIANT_TAG;// for CASEs in a RECORD VARIANT_TAG_NO_ID;// for CASEs in a RECORD (no id, just a type) VARIANT_CASE;// a case of the variant CONSTLIST; // List of constants FIELDLIST; // list of fields in a record ARGDECLS; // overall group of declarations of args for proc/func. VARDECL; // declaration of a variable ARGDECL; // declaration of a parameter ARGLIST; // list of actual arguments (expressions) TYPEDECL; // declaration of a type FIELD; // the root a RECORD field } // Define some methods and variables to use in the generated parser. { pass } program : programHeading (INTERFACE!)? block DOT! ; programHeading : PROGRAM^ identifier LPAREN! identifierList RPAREN! SEMI! | UNIT^ identifier SEMI! ; identifier : IDENT ; block : ( labelDeclarationPart | constantDefinitionPart | typeDefinitionPart | variableDeclarationPart | procedureAndFunctionDeclarationPart | usesUnitsPart | IMPLEMENTATION )* compoundStatement ; usesUnitsPart : USES^ identifierList SEMI! ; labelDeclarationPart : LABEL^ label ( COMMA! label )* SEMI! ; label : unsignedInteger ; constantDefinitionPart : CONST^ constantDefinition ( SEMI! constantDefinition )* SEMI! ; constantDefinition : identifier EQUAL^ constant ; constantChr : CHR^ LPAREN! unsignedInteger RPAREN! ; constant : unsignedNumber |! s:sign n:unsignedNumber { #constant=#(s,n); } | identifier |! s2:sign id:identifier { #constant=#(s2,id); } | string | constantChr ; unsignedNumber : unsignedInteger | unsignedReal ; unsignedInteger : NUM_INT ; unsignedReal : NUM_REAL ; sign : PLUS | MINUS ; string : STRING_LITERAL ; typeDefinitionPart : TYPE^ typeDefinition ( SEMI! typeDefinition )* SEMI! ; //PSPSPS typeDefinition : identifier e:EQUAL^ {#e.setType(TYPEDECL);} ( type | functionType // | FUNCTION^ (formalParameterList)? COLON! resultType | procedureType // | PROCEDURE^ (formalParameterList)? ) ; functionType : FUNCTION^ (formalParameterList)? COLON! resultType ; procedureType : PROCEDURE^ (formalParameterList)? ; type : simpleType | structuredType | pointerType ; simpleType : scalarType | subrangeType | typeIdentifier | stringtype ; scalarType : LPAREN^ identifierList RPAREN! {#scalarType.setType(SCALARTYPE);} ; subrangeType : constant DOTDOT^ constant ; typeIdentifier : identifier | CHAR | BOOLEAN | INTEGER | REAL | STRING // as in return type: FUNCTION ... (...): string; ; structuredType : PACKED^ unpackedStructuredType | unpackedStructuredType ; unpackedStructuredType : arrayType | recordType | setType | fileType ; stringtype : STRING^ LBRACK! (identifier|unsignedNumber) RBRACK! ; arrayType : ARRAY^ LBRACK! typeList RBRACK! OF! componentType | ARRAY^ LBRACK2! typeList RBRACK2! OF! componentType ; typeList : indexType ( COMMA! indexType )* {#typeList = #(#[TYPELIST],#typeList);} ; indexType : simpleType ; componentType : type ; recordType : RECORD^ fieldList END! ; fieldList : ( fixedPart ( SEMI! variantPart | SEMI! )? | variantPart ) {#fieldList=#([FIELDLIST],#fieldList);} ; fixedPart : recordSection ( SEMI! recordSection )* ; recordSection : identifierList COLON! type {#recordSection = #([FIELD],#recordSection);} ; variantPart : CASE^ tag OF! variant ( SEMI! variant | SEMI! )* ; tag! : id:identifier COLON t:typeIdentifier {#tag=#([VARIANT_TAG],id,t);} | t2:typeIdentifier {#tag=#([VARIANT_TAG_NO_ID],t2);} ; variant : constList c:COLON^ {#c.setType(VARIANT_CASE);} LPAREN! fieldList RPAREN! ; setType : SET^ OF! baseType ; baseType : simpleType ; fileType : FILE^ OF! type | FILE ; pointerType : POINTER^ typeIdentifier ; // Yields a list of VARDECL-rooted subtrees with VAR at the overall root */ variableDeclarationPart : VAR^ variableDeclaration ( SEMI! variableDeclaration )* SEMI! ; variableDeclaration : identifierList c:COLON^ {#c.setType(VARDECL);} type ; procedureAndFunctionDeclarationPart : procedureOrFunctionDeclaration SEMI! ; procedureOrFunctionDeclaration : procedureDeclaration | functionDeclaration ; procedureDeclaration : PROCEDURE^ identifier (formalParameterList)? SEMI! block ; formalParameterList : LPAREN^ formalParameterSection ( SEMI! formalParameterSection )* RPAREN! {#formalParameterList.setType(ARGDECLS);} ; formalParameterSection : parameterGroup | VAR^ parameterGroup | FUNCTION^ parameterGroup | PROCEDURE^ parameterGroup ; parameterGroup! : ids:identifierList COLON! t:typeIdentifier {#parameterGroup = #([ARGDECL],ids,t);} ; identifierList : identifier ( COMMA! identifier )* {#identifierList = #(#[IDLIST],#identifierList);} ; constList : constant ( COMMA! constant )* {#constList = #([CONSTLIST],#constList);} ; functionDeclaration : FUNCTION^ identifier (formalParameterList)? COLON! resultType SEMI! block ; resultType : typeIdentifier ; statement : label COLON^ unlabelledStatement | unlabelledStatement ; unlabelledStatement : simpleStatement | structuredStatement ; simpleStatement : assignmentStatement | procedureStatement | gotoStatement | emptyStatement ; assignmentStatement : variable ASSIGN^ expression ; /* A variable is an id with a suffix and can look like: * id * id[expr,...] * id.id * id.id[expr,...] * id^ * id^.id * id^.id[expr,...] * ... * * LL has a really hard time with this construct as it's naturally * left-recursive. We have to turn into a simple loop rather than * recursive loop, hence, the suffixes. I keep in the same rule * for easy tree construction. */ variable : ( AT^ identifier // AT is root of identifier; then other op becomes root | identifier ) ( LBRACK^ expression ( COMMA! expression)* RBRACK! | LBRACK2^ expression ( COMMA! expression)* RBRACK2! | DOT^ identifier | POINTER^ )* ; expression : simpleExpression ( (EQUAL^ | NOT_EQUAL^ | LT^ | LE^ | GE^ | GT^ | IN^) simpleExpression )* ; simpleExpression : term ( (PLUS^ | MINUS^ | OR^) term )* ; term : signedFactor ( (STAR^ | SLASH^ | DIV^ | MOD^ | AND^) signedFactor )* ; signedFactor : (PLUS^|MINUS^)? factor ; factor : variable | LPAREN! expression RPAREN! | functionDesignator | unsignedConstant | set | NOT^ factor ; unsignedConstant : unsignedNumber | constantChr //pspsps added | string | NIL ; functionDesignator! : id:identifier LPAREN! args:parameterList RPAREN! {#functionDesignator = #([FUNC_CALL],id,args);} ; parameterList : actualParameter ( COMMA! actualParameter )* {#parameterList = #([ARGLIST],#parameterList);} ; set : LBRACK^ elementList RBRACK! {#set.setType(SET);} | LBRACK2^ elementList RBRACK2! {#set.setType(SET);} ; elementList : element ( COMMA! element )* | ; element : expression ( DOTDOT^ expression )? ; procedureStatement! : id:identifier ( LPAREN! args:parameterList RPAREN! )? {#procedureStatement = #([PROC_CALL],id,args);} ; actualParameter : expression ; gotoStatement : GOTO^ label ; emptyStatement : ; empty : /* empty */ ; structuredStatement : compoundStatement | conditionalStatement | repetetiveStatement | withStatement ; compoundStatement : BEGIN! statements END! ; statements : statement ( SEMI! statement )* {#statements = #([BLOCK],#statements);} ; conditionalStatement : ifStatement | caseStatement ; ifStatement : IF^ expression THEN! statement ( // CONFLICT: the old "dangling-else" problem... // ANTLR generates proper code matching // as soon as possible. Hush warning. options { generateAmbigWarnings=false; } : ELSE! statement )? ; caseStatement //pspsps ??? : CASE^ expression OF! caseListElement ( SEMI! caseListElement )* ( SEMI! ELSE! statements )? END! ; caseListElement : constList COLON^ statement ; repetetiveStatement : whileStatement | repeatStatement | forStatement ; whileStatement : WHILE^ expression DO! statement ; repeatStatement : REPEAT^ statements UNTIL! expression ; forStatement : FOR^ identifier ASSIGN! forList DO! statement ; forList : initialValue (TO^ | DOWNTO^) finalValue ; initialValue : expression ; finalValue : expression ; withStatement : WITH^ recordVariableList DO! statement ; recordVariableList : variable ( COMMA! variable )* ; class pascal_l extends Lexer; options { charVocabulary = '\0'..'\377'; exportVocab = Pascal; // call the vocabulary "Pascal" testLiterals = false; // don't automatically test for literals k = 4; // four characters of lookahead caseSensitive = false; caseSensitiveLiterals = false; } tokens { AND = "and" ; ARRAY = "array" ; BEGIN = "begin" ; BOOLEAN = "boolean" ; CASE = "case" ; CHAR = "char" ; CHR = "chr" ; CONST = "const" ; DIV = "div" ; DO = "do" ; DOWNTO = "downto" ; ELSE = "else" ; END = "end" ; FILE = "file" ; FOR = "for" ; FUNCTION = "function" ; GOTO = "goto" ; IF = "if" ; IN = "in" ; INTEGER = "integer" ; LABEL = "label" ; MOD = "mod" ; NIL = "nil" ; NOT = "not" ; OF = "of" ; OR = "or" ; PACKED = "packed" ; PROCEDURE = "procedure" ; PROGRAM = "program" ; REAL = "real" ; RECORD = "record" ; REPEAT = "repeat" ; SET = "set" ; THEN = "then" ; TO = "to" ; TYPE = "type" ; UNTIL = "until" ; VAR = "var" ; WHILE = "while" ; WITH = "with" ; METHOD ; ADDSUBOR ; ASSIGNEQUAL ; SIGN ; FUNC ; NODE_NOT_EMIT ; MYASTVAR ; LF ; UNIT = "unit" ; INTERFACE = "interface" ; USES = "uses" ; STRING = "string" ; IMPLEMENTATION = "implementation" ; //pspsps ??? // wh DOTDOT; } //---------------------------------------------------------------------------- // OPERATORS //---------------------------------------------------------------------------- PLUS : '+' ; MINUS : '-' ; STAR : '*' ; SLASH : '/' ; ASSIGN : ":=" ; COMMA : ',' ; SEMI : ';' ; COLON : ':' ; EQUAL : '=' ; NOT_EQUAL : "<>" ; LT : '<' ; LE : "<=" ; GE : ">=" ; GT : '>' ; LPAREN : '(' ; RPAREN : ')' ; LBRACK : '[' ; // line_tab[line] LBRACK2 : "(." ; // line_tab(.line.) RBRACK : ']' ; RBRACK2 : ".)" ; POINTER : '^' ; AT : '@' ; DOT : '.' ('.' { $setType(DOTDOT)} )? ; LCURLY : "{" ; RCURLY : "}" ; // Whitespace -- ignored WS : ( ' ' | '\t' | '\f' // handle newlines | ( "\r\n" // Evil DOS | '\r' // Macintosh | '\n' // Unix (the right way) ) { $newline; } ) { _ttype = SKIP; } ; COMMENT_1 : "(*" ( options { generateAmbigWarnings=false; } : { self.LA(2) != ')' }? '*' | '\r' '\n' {$newline;} | '\r' {$newline;} | '\n' {$newline;} | ~('*' | '\n' | '\r') )* "*)" {$setType(SKIP);} ; COMMENT_2 : '{' ( options {generateAmbigWarnings=false;} : '\r' '\n' {$newline;} | '\r' {$newline;} | '\n' {$newline;} | ~('}' | '\n' | '\r') )* '}' {$setType(SKIP);} ; // an identifier. Note that testLiterals is set to true! This means // that after we match the rule, we look in the literals table to see // if it's a literal or really an identifer IDENT options {testLiterals=true;} : ('a'..'z') ('a'..'z'|'0'..'9'|'_')* //pspsps ; // string literals STRING_LITERAL : '\'' ("\'\'" | ~('\''))* '\'' //pspsps * in stead of + because of e.g. '' ; NUM_INT : ('0'..'9')+ // everything starts with a digit sequence ( ( { (self.LA(2) != '.') and (self. LA(2)!=')')}? // force k=2; avoid ".." //PSPSPS example ARRAY (.1..99.) OF char; // after .. thinks it's a NUM_REAL '.' {$setType(NUM_REAL);} // dot means we are float ('0'..'9')+ (EXPONENT)? )? | EXPONENT {$setType(NUM_REAL);} // 'E' means we are float ) ; // a couple protected methods to assist in matching floating point numbers protected EXPONENT : ('e') ('+'|'-')? ('0'..'9')+ ; antlr-2.7.7/examples/python/pascal/pascal.in0000644000175000017500000000073710522211616021005 0ustar twernertwerner{ program 0.1 assuming annual inflation rates of 7, 8, and 10 per cent, find the factor by which the frank, dollar, pound sterlinh, mark, or guilder will have been devalued in 1, 2, ... n years.} program inflation(output); const n = 10; var i : integer; w1, w2, w3 : real; begin i := 0; w1 := 1.0; w2 := 1.0; w3 := 1.0; repeat i := i + 1; w1 := w1 * 1.07; w2 := w2 * 1.08; w3 := w3 * 1.10; writeln(i, w1, w2, w3); until i=n end. antlr-2.7.7/examples/python/parseBinary/0000755000175000017500000000000010522211616020217 5ustar twernertwernerantlr-2.7.7/examples/python/parseBinary/binary.g0000644000175000017500000000111610522211616021652 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ options { language=Python; } class binary_p extends Parser; file: ( sh:SHORT { print sh.getText() } | st:STRING { print "\"" + st.getText() + "\"" } )+ ; class binary_l extends Lexer; options { charVocabulary = '\u0000'..'\u00FF'; } SHORT : '\0' high:. lo:. { v = (ord(high)<<8) + ord(lo) $setText(str(v)) } ; STRING : '\1'! // begin string (discard) ( ~'\2' )* '\2'! // end string (discard) ; antlr-2.7.7/examples/python/parseBinary/binary.py0000644000175000017500000000320210522211616022052 0ustar twernertwernerimport sys import antlr class Visitor(antlr.ASTVisitor): def __init__(self,*args): super(Visitor,self).__init__(*args) self.level = 0 if not args: self.cout = sys.stdout return if isinstance(args[0],file): self.cout = args[0] return assert 0 def tabs(self): print " " * self.level def printf(self,fmt,*args): if not args: sys.stdout.write(fmt) return argv = tuple(args) self.cout.write(fmt % argv) def flush(self): self.cout.flush() def visit1(self,node): if not node: self.printf(" nil ") return c = node.getType() t = node.getText() k = node.getFirstChild() s = node.getNextSibling() self.printf("( <%s> ",c) if t: self.printf(" %s ",t) self.visit1(k); self.visit1(s); self.printf(")") def visit(self,node): self.visit1(node); self.printf("\n") def main(): import binary_l import binary_p L = binary_l.Lexer() P = binary_p.Parser(L) ### Parse the input expression try: P.file() except antlr.ANTLRException, ex: print "*** error(s) while parsing." print ">>> exit(1)" import sys sys.exit(1) ast = P.getAST() if not ast: print "stop - no AST generated." import sys sys.exit(0) ###show tree print "Tree: " + ast.toStringTree() print "List: " + ast.toStringList() print "Node: " + ast.toString() print "visit>>" visitor = Visitor() visitor.visit(ast); if __name__ == "__main__": main() antlr-2.7.7/examples/python/parseBinary/Makefile.in0000644000175000017500000000354210522211616022270 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/parseBinary ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/binary.g \ $(eol) g_py_FILES = \ binary_p.py binary_l.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ &&@CP@ $< $@ test :: test1 test1_deps = \ binary.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) binary_l.py < $(_srcdir)/binary.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup binary clean :: @@ECHO@ cleaning binary ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/parseBinary/binary.in0000644000175000017500000000001310522211616022025 0ustar twernertwernera testantlr-2.7.7/examples/python/treewalk/0000755000175000017500000000000010522211616017556 5ustar twernertwernerantlr-2.7.7/examples/python/treewalk/Makefile.in0000644000175000017500000000367110522211616021632 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/treewalk ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/treewalk.g \ $(eol) g_py_FILES = \ treewalk_l.py \ treewalk_p.py \ treewalk_w.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ &&@CP@ $< $@ test :: test1 test1_deps = \ treewalk.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) treewalk_l.py < $(_srcdir)/treewalk.in ;\ $(python) treewalk.py < $(_srcdir)/treewalk.in ;\ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup treewalk clean :: @@ECHO@ cleaning treewalk ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/treewalk/treewalk.py0000644000175000017500000000356610522211616021760 0ustar twernertwernerimport sys import antlr class Visitor(antlr.ASTVisitor): def __init__(self,*args): super(Visitor,self).__init__(*args) self.level = 0 if not args: self.cout = sys.stdout return if isinstance(args[0],file): self.cout = args[0] return assert 0 def tabs(self): print " " * self.level def printf(self,fmt,*args): if not args: sys.stdout.write(fmt) return argv = tuple(args) self.cout.write(fmt % argv) def flush(self): self.cout.flush() def visit1(self,node): if not node: self.printf(" nil ") return c = node.getType() t = node.getText() k = node.getFirstChild() s = node.getNextSibling() self.printf("( <%s> ",c) if t: self.printf(" %s ",t) self.visit1(k); self.visit1(s); self.printf(")") def visit(self,node): self.visit1(node); self.printf("\n") def main(): import treewalk_l import treewalk_p import treewalk_w L = treewalk_l.Lexer() P = treewalk_p.Parser(L) P.setFilename(L.getFilename()) ### Parse the input expression try: P.block() except antlr.ANTLRException, ex: print "*** error(s) while parsing." print ">>> exit(1)" import sys sys.exit(1) ast = P.getAST() if not ast: print "stop - no AST generated." import sys sys.exit(1) ###show tree print "Tree: " + ast.toStringTree() print "List: " + ast.toStringList() print "Node: " + ast.toString() print "visit>>" visitor = Visitor() visitor.visit(ast); print "visit<<" W = treewalk_w.Walker(); ### Traverse the tree created by the parser W.block(ast); ast = W.getAST(); if ast: print "List: " + ast.toStringList() if __name__ == "__main__": main() antlr-2.7.7/examples/python/treewalk/treewalk.in0000644000175000017500000000011010522211616021714 0ustar twernertwerner{ i = 3+4*5; if ( 6 ) j = 7; else j = 8; while ( 9 ) { k = 1; } } antlr-2.7.7/examples/python/treewalk/treewalk.g0000644000175000017500000000413510522211616021547 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ options { language=Python; } class treewalk_p extends Parser; options { codeGenMakeSwitchThreshold = 3; codeGenBitsetTestThreshold = 4; buildAST=true; } block : LCURLY^ ( statement )* RCURLY! ; statement : expr SEMI! | "if"^ LPAREN! expr RPAREN! statement ( "else"! statement )? | "while"^ LPAREN! expr RPAREN! statement |! b:block { statement_AST = b_AST; } // do some manual tree returning ; expr: assignExpr ; assignExpr : aexpr (ASSIGN^ assignExpr)? ; aexpr : mexpr (PLUS^ mexpr)* ; mexpr : atom (STAR^ atom)* ; atom: ID | INT ; class treewalk_w extends TreeParser; block : #( LCURLY ( stat )+ ) ; stat: #("if" expr stat (stat)?) | #("while" expr stat) | expr | block ; expr: #(ASSIGN expr expr) {print "found assign" } | #(PLUS expr expr) {print "found +" } | #(STAR expr expr) {print "found *" } | a:ID {print "found ID " ,a.getText() } | b:INT {print "found INT ",b.getText() } ; class treewalk_l extends Lexer; WS : (' ' | '\t' | '\n' | '\r') { _ttype = SKIP; } ; LPAREN: '(' ; RPAREN: ')' ; LCURLY: '{' ; RCURLY: '}' ; STAR: '*' ; PLUS: '+' ; ASSIGN : '=' ; SEMI: ';' ; COMMA : ',' ; protected ESC : '\\' ( 'n' | 'r' | 't' | 'b' | 'f' | '"' | '\'' | '\\' | ('0'..'3') ( DIGIT (DIGIT)? )? | ('4'..'7') (DIGIT)? ) ; protected DIGIT : '0'..'9' ; INT : (DIGIT)+ ; ID : ('a'..'z'|'A'..'Z'|'_') ('a'..'z'|'A'..'Z'|'_'|'0'..'9')* { try: i = literals[self.getText()] _ttype = i; except: pass } ; antlr-2.7.7/examples/python/cpp/0000755000175000017500000000000010522211616016522 5ustar twernertwernerantlr-2.7.7/examples/python/cpp/cpp.g0000644000175000017500000002130310522211616017453 0ustar twernertwerner/* * A C PreProcessor * * Handles #define/#undef, #ifdef/#elsif/#else/#endif, and #include using only * an ANTLR lexer (actually a stack of them). This could be easily integrated * with an existing lexer to do preprocessing and tokenizing all at once. * * Author: Eric Mahurin - eric_mahurin at yahoo dot com * License: just give me credit * * BUG: missing some of the simpler directives * BUG: doesn't follow the cpp spec perfectly - haven't made any effort at * this not well tested * * Be aware that this is my first real attempt at both ANTLR and Java, so * things may not be done the best way. I welcome suggestions and fixes. * * 041124 - cpp.g translated and adapted as Python example by MK. */ header { import sys import StringIO } header "__main__" { import traceback class cpp: def __init__(self, *args): try: // will need a stack of lexers for #include and macro calls self.mainLexer = Lexer(sys.stdin) Lexer.selector.select(self.mainLexer) for token in Lexer.selector: sys.stdout.write(token.getText()) except Exception, e: sys.stderr.write("exception: " + str(e) + '\n') traceback.print_exc() Lexer.selector = antlr.TokenStreamSelector() cpp(sys.argv[1:]) } options { language="Python"; } class cppLexer extends Lexer; options { testLiterals = false; k = 4; } tokens { ENDIF ; } { selector = antlr.TokenStreamSelector() // must be assigned externally ifState = 1 // -1: no-else false, 0: false, 1: true ifStates = [] // holds nested if conditions defines = {} // holds the defines defineArgs = {} // holds the args for a macro call def uponEOF(self): if Lexer.selector.getCurrentStream() != Lexer: try: Lexer.selector.pop() // return to old lexer/stream Lexer.selector.retry() //except antlr.TokenStreamRetryException, tsre: // raise tsre except IndexError: // return a real EOF if nothing in stack pass } DIRECTIVE { args = [] condition = True } : '#' ( "include" (WS)? includeFile:STRING { if Lexer.ifState == 1: name = includeFile.getText() name = name[1:-1] try: sublexer = Lexer(file(name)) // want defines to be persistent sublexer.defines = Lexer.defines sublexer.setFilename(name) Lexer.selector.push(sublexer) Lexer.selector.retry() except IOError, e: sys.stderr.write("cannot find file " + name + '\n') } | "define" WS defineMacro:RAW_IDENTIFIER { // first element will hold the macro text } ( ( '(' // get arguments if you find them (no spaces before left paren) (WS)? defineArg0:RAW_IDENTIFIER (WS)? { args += defineArg0.getText() } ( COMMA (WS)? defineArg1:RAW_IDENTIFIER (WS)? { args += defineArg1.getText() } )* ')' | ' '|'\t'|'\f' ) ( options { greedy=true; } : ' '|'\t'|'\f' )* // store the text verbatim - tokenize when called defineText:MACRO_TEXT { args[0] = defineText.getText() } )? ('\n'|"\r\n"|'\r') { $newline } { if Lexer.ifState == 1: Lexer.defines[defineMacro.getText()] = args $skip } | "undef" WS undefMacro:RAW_IDENTIFIER { if Lexer.ifState == 1: del Lexer.defines[undefMacro.getText()] $skip } | ( "ifdef" | "ifndef" { condition=False } ) WS ifMacro:RAW_IDENTIFIER { Lexer.ifStates.append(ifState) if Lexer.ifState == 1: if Lexer.defines.has_key(ifMacro.getText()) == condition: Lexer.ifState = 1 else: Lexer.ifState = 0 else: Lexer.ifState = -1 if Lexer.ifState == 1: $skip else: // gobble up tokens until ENDIF (could be caused by else) while True: try: if Lexer.selector.nextToken().getType() == ENDIF: break except antlr.TokenStreamRetryException, r: // just continue if someone tried retry pass // retry in case we switched lexers Lexer.selector.retry() } | ( "else" // treat like elsif (true) | "elsif" WS elsifMacro:RAW_IDENTIFIER { condition = Lexer.defines.has_key(elsifMacro.getText()) } ) { if Lexer.ifState == 1: // previous if/elsif was taken - discard rest Lexer.ifState = -1; while True: try: if Lexer.selector.nextToken().getType() == ENDIF: break except antlr.TokenStreamRetryException, r: // just continue if someone tried retry pass // retry in case we switched lexers Lexer.selector.retry() elif Lexer.ifState == 0 and condition: // "elsif" (true) or "else" $setType(ENDIF) Lexer.ifState = 1 } | "endif" { if Lexer.ifState == 1: condition = True else: condition = False try: // return to previous if state del Lexer.ifStates[-1] if condition: $skip else: // tell if/else/elsif to stop discarding tokens $setType(ENDIF) except IndexError, e: // endif with no if pass } ); IDENTIFIER options { testLiterals=true; } { define = [] args = [] } : identifier:RAW_IDENTIFIER { // see if this is a macro argument define = Lexer.defineArgs.has_key(identifier.getText()) if define: define = Lexer.defineArgs[identifier.getText()] elif _begin == 0 and not define: // see if this is a macro call define = Lexer.defines.has_key(identifier.getText()) if define: define = Lexer.defines[identifier.getText()] } ( { define and len(define) }? ( WS | COMMENT )? // take in arguments if macro call requires them '(' callArg0:EXPR { args += callArg0.getText() } ( COMMA callArg1:EXPR { args += callArg1.getText() } )* { len(args) == len(define)-1 }? // better have right amount ')' | { not (define and len(define)) }? ) { if define: defineText = define[0] if _begin: // just substitute text if called from EXPR - no token created $setText(defineText) else: // create a new lexer to handle the macro text sublexer = Lexer(StringIO.StringIO(defineText)) for i in range(len(args)): // treat macro arguments similar to local defines arg = [] arg.append(args[i]) sublexer.defineArgs[define[1+i]] = arg Lexer.selector.push(sublexer) // retry in new lexer Lexer.selector.retry() }; STRING : '"' ( '\\' . | ~('\\'|'"') )* '"' // double quoted string | '\'' ( '\\' . | ~('\\'|'\'') )* '\'' // single quoted string ; protected MACRO_TEXT : ( '\\'! NL { $newline } // escaped newline | ~('\n'|'\r') )* ; protected NL options { generateAmbigWarnings=false; // single '\r' is ambig with '\r' '\n' } : '\r' | '\n' | '\r' '\n' ; WS : ( ' ' | '\t' | '\f' | NL { $newline } ) { /* $skip */ } ; COMMENT : ( "//" (~('\n'|'\r'))* NL { $newline } // single line comment | "/*" ( options{greedy=false;} : NL { $newline } | ~('\n'|'\r') )* "*/" // multi-line comment ) { /* $skip */ } ; protected RAW_IDENTIFIER : ('a'..'z'|'A'..'Z'|'_') ('a'..'z'|'A'..'Z'|'_'|'0'..'9')* ; NUMBER : ('0'..'9') ('0'..'9'|'a'..'z'|'A'..'Z'|'_')* // allow alpha suffixes on numbers (i.e. L:long) ; // group symbols into categories to parse EXPR LEFT : '(' | '[' | '{' ; RIGHT : ')' | ']' | '}' ; COMMA : ',' ; OPERATOR : '!' | '#' | '$' | '%' | '&' | '*' | '+' | '-' | '.' | '/' | ':' | ';' | '<' | '=' | '>' | '?' | '@' | '\\' | '^' | '`' | '|' | '~' ; protected EXPR // allow just about anything without being ambiguous : (WS)? (NUMBER|IDENTIFIER)? ( ( LEFT EXPR ( COMMA EXPR )* RIGHT | STRING | OPERATOR // quotes, COMMA, LEFT, and RIGHT not in here ) EXPR )? ; antlr-2.7.7/examples/python/cpp/Makefile.in0000644000175000017500000000351710522211616020575 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger/Marq Kole, 2004. ## do not change this value subdir=examples/python/cpp ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/cpp.g \ $(eol) g_py_FILES = \ cppLexer.py \ $(eol) compile : $(g_py_FILES) test :: test1 %.h : $(_srcdir)/%.h @ @CP@ $< $@ test1_deps = \ incl.h \ subincl.h \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) cppLexer.py < $(_srcdir)/cpp.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup tinyc clean :: @@ECHO@ cleaning tinyc ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/cpp/cpp.in0000644000175000017500000000004510522211616017633 0ustar twernertwernerint a,b; #include "incl.h" int c; antlr-2.7.7/examples/python/cpp/subincl.h0000644000175000017500000000001210522211616020323 0ustar twernertwernerint z; antlr-2.7.7/examples/python/cpp/incl.h0000644000175000017500000000005010522211616017613 0ustar twernertwerner int x; #include "subincl.h" int y; antlr-2.7.7/examples/python/IDL/0000755000175000017500000000000010522211616016350 5ustar twernertwernerantlr-2.7.7/examples/python/IDL/idl.in0000644000175000017500000000155110522211616017452 0ustar twernertwernermodule A { module B { module C { interface Bar { }; }; }; }; module MainModule { typedef sequence< sequence > myNestedSeq ; typedef long myArray[3][4]; struct MyStruct { long num1, num2; string name; }; const long max = 127; exception MyEx { string msg; }; struct Node { string data; Node next; }; interface Bar { }; exception MyException { string message; }; interface class { }; typedef sequence myLongSeq; interface Foo { attribute string name; long bar(in short a, inout string s, out Foo f); }; enum Color { red, blue, green }; typedef Foo MyFoo; union MyUnion switch(long) { case 1: string name; case 2: long num; case 3: MyStruct str; case 4: MyFoo mf; default: boolean b; }; };antlr-2.7.7/examples/python/IDL/Makefile.in0000644000175000017500000000356210522211616020423 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/IDL ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/idl.g \ $(eol) g_py_FILES = \ idl_l.py \ idl_p.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @-@RMF@ $@ &&@CP@ $< $@ test :: test1 test1_deps = \ idl.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) idl_l.py < $(_srcdir)/idl.in ;\ $(python) idl.py < $(_srcdir)/idl.in ;\ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup idl clean :: @@ECHO@ cleaning idl ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/IDL/idl.py0000644000175000017500000000330410522211616017472 0ustar twernertwernerimport sys import antlr class Visitor(antlr.ASTVisitor): def __init__(self,*args): super(Visitor,self).__init__(*args) self.level = 0 if not args: self.cout = sys.stdout return if isinstance(args[0],file): self.cout = args[0] return assert 0 def tabs(self): print " " * self.level def printf(self,fmt,*args): if not args: sys.stdout.write(fmt) return argv = tuple(args) self.cout.write(fmt % argv) def flush(self): self.cout.flush() def visit1(self,node): if not node: self.printf(" nil ") return c = node.getType() t = node.getText() k = node.getFirstChild() s = node.getNextSibling() self.printf("( <%s> ",c) if t: self.printf(" %s ",t) self.visit1(k); self.visit1(s); self.printf(")") def visit(self,node): self.visit1(node); self.printf("\n") def main(): import idl_l import idl_p L = idl_l.Lexer() P = idl_p.Parser(L) P.setFilename(L.getFilename()) ### Parse the input expression try: P.specification() except antlr.ANTLRException, ex: print "*** error(s) while parsing." print ">>> exit(1)" import sys sys.exit(1) ast = P.getAST() if not ast: print "stop - no AST generated." import sys sys.exit(0) ###show tree print "Tree: " + ast.toStringTree() print "List: " + ast.toStringList() print "Node: " + ast.toString() print "visit>>" visitor = Visitor() visitor.visit(ast); print "visit<<" if __name__ == "__main__": import sys main() antlr-2.7.7/examples/python/IDL/idl.g0000644000175000017500000002331310522211616017272 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ options { language=Python; } class idl_p extends Parser; options { exportVocab=IDL; buildAST=true; } specification : (definition)+ ; definition : ( type_dcl SEMI! | const_dcl SEMI! | except_dcl SEMI! | interf SEMI! | module SEMI! ) ; module : "module" identifier LCURLY d:definition_list RCURLY ; definition_list : (definition)+ ; interf : "interface" identifier inheritance_spec (interface_body)? ; interface_body : LCURLY! (export)* RCURLY! ; export : ( type_dcl SEMI | const_dcl SEMI | except_dcl SEMI | attr_dcl SEMI | op_dcl SEMI ) ; inheritance_spec : COLON scoped_name_list | ; scoped_name_list : scoped_name (COMMA scoped_name)* ; scoped_name : opt_scope_op identifier (SCOPEOP identifier)* ; opt_scope_op : SCOPEOP | ; const_dcl : "const" const_type identifier ASSIGN const_exp ; const_type : integer_type | char_type | boolean_type | floating_pt_type | string_type | scoped_name ; /* EXPRESSIONS */ const_exp : or_expr ; or_expr : xor_expr ( or_op xor_expr )* ; or_op : OR ; xor_expr : and_expr ( xor_op and_expr )* ; xor_op : XOR ; and_expr : shift_expr ( and_op shift_expr )* ; and_op : AND ; shift_expr : add_expr ( shift_op add_expr )* ; shift_op : LSHIFT | RSHIFT ; add_expr : mult_expr ( add_op mult_expr )* ; add_op : PLUS | MINUS ; mult_expr : unary_expr ( mult_op unary_expr )* ; mult_op : STAR | DIV | MOD ; unary_expr : unary_operator primary_expr | primary_expr ; unary_operator : MINUS | PLUS | TILDE ; // Node of type TPrimaryExp serves to avoid inf. recursion on tree parse primary_expr : scoped_name | literal | LPAREN const_exp RPAREN ; literal : integer_literal | string_literal | character_literal | floating_pt_literal | boolean_literal ; boolean_literal : "TRUE" | "FALSE" ; positive_int_const : const_exp ; type_dcl : "typedef" type_declarator | struct_type | union_type | enum_type | | "native" simple_declarator ; type_declarator : type_spec declarators ; type_spec : simple_type_spec | constr_type_spec ; simple_type_spec : base_type_spec | template_type_spec | scoped_name ; base_type_spec : integer_type | char_type | boolean_type | floating_pt_type | "octet" | "any" ; integer_type : ("unsigned")? ("short" | "long") ; char_type : "char" ; floating_pt_type : "float" | "double" ; boolean_type : "boolean" ; template_type_spec : sequence_type | string_type ; constr_type_spec : struct_type | union_type | enum_type ; declarators : declarator (COMMA declarator)* ; declarator : identifier opt_fixed_array_size ; opt_fixed_array_size : (fixed_array_size)* ; simple_declarator : identifier ; struct_type : "struct" identifier LCURLY member_list RCURLY ; member_list : (member)+ ; member : type_spec declarators SEMI ; union_type : "union" identifier "switch" LPAREN switch_type_spec RPAREN LCURLY switch_body RCURLY ; switch_type_spec : integer_type | char_type | boolean_type | enum_type | scoped_name ; switch_body : case_stmt_list ; case_stmt_list : (case_stmt)+ ; case_stmt : case_label_list element_spec SEMI ; case_label_list : (case_label)+ ; case_label : "case" const_exp COLON | "default" COLON ; element_spec : type_spec declarator ; enum_type : "enum" identifier LCURLY enumerator_list RCURLY ; enumerator_list : enumerator (COMMA enumerator)* ; enumerator : identifier ; sequence_type : "sequence" LT simple_type_spec opt_pos_int GT ; opt_pos_int : (COMMA positive_int_const)? ; string_type : "string" opt_pos_int_br ; opt_pos_int_br : (LT positive_int_const GT)? ; fixed_array_size : LBRACK positive_int_const RBRACK ; attr_dcl : ("readonly")? "attribute" param_type_spec simple_declarator_list ; simple_declarator_list : simple_declarator (COMMA simple_declarator)* ; except_dcl : "exception" identifier LCURLY opt_member_list RCURLY ; opt_member_list : (member)* ; op_dcl : op_attribute op_type_spec identifier parameter_dcls opt_raises_expr c:opt_context_expr ; opt_raises_expr : (raises_expr)? ; opt_context_expr : (context_expr)? ; op_attribute : "oneway" | ; op_type_spec : param_type_spec | "void" ; parameter_dcls : LPAREN (param_dcl_list)? RPAREN! ; param_dcl_list : param_dcl (COMMA param_dcl)* ; param_dcl : param_attribute param_type_spec simple_declarator ; param_attribute : "in" | "out" | "inout" ; raises_expr : "raises" LPAREN scoped_name_list RPAREN ; context_expr : "context" LPAREN string_literal_list RPAREN ; string_literal_list : string_literal (COMMA! string_literal)* ; param_type_spec : base_type_spec | string_type | scoped_name ; integer_literal : INT | OCTAL | HEX ; string_literal : (STRING_LITERAL)+ ; character_literal : CHAR_LITERAL ; floating_pt_literal : f:FLOAT ; identifier : IDENT ; /* IDL LEXICAL RULES */ class idl_l extends Lexer; options { exportVocab=IDL; k=4; } SEMI options { paraphrase = ";"; } : ';' ; QUESTION options { paraphrase = "?"; } : '?' ; LPAREN options { paraphrase = "("; } : '(' ; RPAREN options { paraphrase = ")"; } : ')' ; LBRACK options { paraphrase = "["; } : '[' ; RBRACK options { paraphrase = "]"; } : ']' ; LCURLY options { paraphrase = "{"; } : '{' ; RCURLY options { paraphrase = "}"; } : '}' ; OR options { paraphrase = "|"; } : '|' ; XOR options { paraphrase = "^"; } : '^' ; AND options { paraphrase = "&"; } : '&' ; COLON options { paraphrase = ":"; } : ':' ; COMMA options { paraphrase = ","; } : ',' ; DOT options { paraphrase = "."; } : '.' ; ASSIGN options { paraphrase = "="; } : '=' ; NOT options { paraphrase = "!"; } : '!' ; LT options { paraphrase = "<"; } : '<' ; LSHIFT options { paraphrase = "<<"; } : "<<" ; GT options { paraphrase = ">"; } : '>' ; RSHIFT options { paraphrase = ">>"; } : ">>" ; DIV options { paraphrase = "/"; } : '/' ; PLUS options { paraphrase = "+"; } : '+' ; MINUS options { paraphrase = "-"; } : '-' ; TILDE options { paraphrase = "~"; } : '~' ; STAR options { paraphrase = "*"; } : '*' ; MOD options { paraphrase = "%"; } : '%' ; SCOPEOP options { paraphrase = "::"; } : "::" ; WS options { paraphrase = "white space"; } : (' ' | '\t' | '\n' { $newline; } | '\r') { $setType(SKIP); } ; PREPROC_DIRECTIVE options { paraphrase = "a preprocessor directive"; } : '#' (~'\n')* '\n' { $setType(SKIP); } ; SL_COMMENT options { paraphrase = "a comment"; } : "//" (~'\n')* '\n' { $setType(SKIP) $newline() } ; ML_COMMENT options { paraphrase = "a comment"; } : "/*" ( STRING_LITERAL | CHAR_LITERAL | '\n' { $newline; } | '*' ~'/' | ~'*' )* "*/" { $setType(SKIP); } ; CHAR_LITERAL options { paraphrase = "a character literal"; } : '\'' ( ESC | ~'\'' ) '\'' ; STRING_LITERAL options { paraphrase = "a string literal"; } : '"' (ESC|~'"')* '"' ; protected ESC options { paraphrase = "an escape sequence"; } : '\\' ( 'n' | 't' | 'v' | 'b' | 'r' | 'f' | 'a' | '\\' | '?' | '\'' | '"' | ('0' | '1' | '2' | '3') ( /* Since a digit can occur in a string literal, * which can follow an ESC reference, ANTLR * does not know if you want to match the digit * here (greedy) or in string literal. * The same applies for the next two decisions * with the warnWhenFollowAmbig option. */ options { warnWhenFollowAmbig = false; } : OCTDIGIT ( options { warnWhenFollowAmbig = false; } : OCTDIGIT )? )? | 'x' HEXDIGIT ( options { warnWhenFollowAmbig = false; } : HEXDIGIT )? ) ; protected VOCAB options { paraphrase = "an escaped character value"; } : '\3'..'\377' ; protected DIGIT options { paraphrase = "a digit"; } : '0'..'9' ; protected OCTDIGIT options { paraphrase = "an octal digit"; } : '0'..'7' ; protected HEXDIGIT options { paraphrase = "a hexadecimal digit"; } : ('0'..'9' | 'a'..'f' | 'A'..'F') ; /* octal literals are detected by checkOctal */ HEX options { paraphrase = "a hexadecimal value value"; } : ("0x" | "0X") (HEXDIGIT)+ ; INT options { paraphrase = "an integer value"; } : (DIGIT)+ // base-10 ( '.' (DIGIT)* {$setType(FLOAT);} (('e' | 'E') ('+' | '-')? (DIGIT)+)? | ('e' | 'E') ('+' | '-')? (DIGIT)+ {$setType(FLOAT);} )? ; FLOAT options { paraphrase = "an floating point value"; } : '.' (DIGIT)+ (('e' | 'E') ('+' | '-')? (DIGIT)+)? ; IDENT options { testLiterals = true; paraphrase = "an identifer"; } : ('a'..'z'|'A'..'Z'|'_') ('a'..'z'|'A'..'Z'|'_'|'0'..'9')* ; antlr-2.7.7/examples/python/inherit.tinyc/0000755000175000017500000000000010522211616020527 5ustar twernertwernerantlr-2.7.7/examples/python/inherit.tinyc/Makefile.in0000644000175000017500000000560510522211616022602 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/inherit.tinyc ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/inherit.g \ $(eol) g_py_FILES = \ inherit_p.py \ tinyc_p.py \ tinyc_l.py \ expandedinherit.g \ $(eol) compile : $(g_py_FILES) ## we need some local Python modules %.py : $(_srcdir)/%.py @-@RMF@ $@ &&@CP@ $< $@ %.py : @abs_this_builddir@/examples/python/tinyc/%.py @CP@ $< $@ ## We inherit from grammar files in tinyc. Rather than ## using them directly we copy them locally to avoid problems ## due to vocabularies that can't be found. %.g : @abs_top_srcdir@/examples/python/tinyc/%.g @-@RMF@ $@ &&@CP@ $< $@ ## This vocabluary file is imported by the expanded grammar. ## Unfortunaly, there is no way to tell ANTLR where to search ## for it. ANTLR assumes it's always there where the grammar ## file resides. Therefore we are going to "make" the base ## grammar first and then copy required vocabulary over .. TinyCTokenTypes.txt : @MAKE@ -C ../tinyc @CP@ ../tinyc/$@ $@ @abs_this_builddir@/examples/python/tinyc/%.py : @MAKE@ -C ../tinyc test :: test1 test1_deps = \ inherit.py \ tinyc_p.py \ tinyc_l.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) inherit.py < $(_srcdir)/inherit.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) tinyc_p.g tinyc_l.g TinyCTokenTypes.txt @ @RMF@ $(g_py_FILES) @ @RMF@ $(g_src_FILES) @ANTLR_COMPILE_CMD@ tinyc_p.g tinyc_l.g @ANTLRFLAGS="-glib `@CYGPATH_W@ tinyc_p.g`" \ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup tinyc clean :: @@ECHO@ cleaning inherit ... @ -@RMF@ $(g_py_FILES) tinyc_l.g tinyc_p.g TinyCTokenTypes.txt @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/inherit.tinyc/tinyc_l.g0000644000175000017500000000276510522211616022352 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ /* * Make sure to run antlr.Tool on the lexer.g file first! */ options { mangleLiteralPrefix = "TK_"; language=Python; } class tinyc_l extends Lexer; options { k=2; exportVocab=TinyC; charVocabulary = '\3'..'\377'; } tokens { "int"; "char"; "if"; "else"; "while"; } WS : (' ' | '\t' | '\n' { $newline;} | '\r') { _ttype = SKIP; } ; SL_COMMENT : "//" (~'\n')* '\n' { _ttype = Token.SKIP; $newline; } ; ML_COMMENT : "/*" ( { self.LA(2) != '/' }? '*' | '\n' { $newline; } | ~('*'|'\n') )* "*/" { $setType(SKIP); } ; LPAREN options { paraphrase="'('"; } : '(' ; RPAREN options { paraphrase="')'"; } : ')' ; LCURLY: '{' ; RCURLY: '}' ; STAR: '*' ; PLUS: '+' ; ASSIGN : '=' ; SEMI: ';' ; COMMA : ',' ; CHAR_LITERAL : '\'' (ESC|~'\'') '\'' ; STRING_LITERAL : '"' (ESC|~'"')* '"' ; protected ESC : '\\' ( 'n' | 'r' | 't' | 'b' | 'f' | '"' | '\'' | '\\' | '0'..'3' ( options { warnWhenFollowAmbig = false; } : DIGIT ( options { warnWhenFollowAmbig = false; } : DIGIT )? )? | '4'..'7' ( options { warnWhenFollowAmbig = false; } : DIGIT )? ) ; protected DIGIT : '0'..'9' ; INT : (DIGIT)+ ; ID options { testLiterals = true; paraphrase = "an identifier"; } : ('a'..'z'|'A'..'Z'|'_') ('a'..'z'|'A'..'Z'|'_'|'0'..'9')* ; antlr-2.7.7/examples/python/inherit.tinyc/inherit.in0000644000175000017500000000037410522211616022525 0ustar twernertwernerint i = 4; // look: tinyc cannot do this, but we can! int *i; int f(char c, char *d) { int f = 5; // look: tinyc cannot do this, but we can! c = '\033'+'\47'+'\''+'\\'; d = " \" '\\' foo"; i = c+3*f; if ( i ) { f = c; } else { f = 1; } } antlr-2.7.7/examples/python/inherit.tinyc/tinyc_p.g0000644000175000017500000000335110522211616022346 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ /* * Make sure to run antlr.Tool on the lexer.g file first! */ options { mangleLiteralPrefix = "TK_"; language=Python; } { def main(): import tinyc_l import tinyc_p L = tinyc_l.Lexer() P = tinyc_p.Parser(L) P.setFilename(L.getFilename()) ### Parse the input expression try: P.program() except antlr.ANTLRException, ex: print "*** error(s) while parsing." print ">>> exit(1)" import sys sys.exit(1) ast = P.getAST() if not ast: print "stop - no AST generated." return ###show tree print "Tree: " + ast.toStringTree() print "List: " + ast.toStringList() print "Node: " + ast.toString() print "visit>>" visitor = Visitor() visitor.visit(ast); print "visit<<" if __name__ == "__main__": main() } class tinyc_p extends Parser; options { importVocab=TinyC; } program : ( declaration )* EOF ; declaration : (variable) => variable | function ; declarator : id:ID | STAR id2:ID ; variable : type declarator SEMI ; function : type id:ID LPAREN (formalParameter (COMMA formalParameter)*)? RPAREN block ; formalParameter : type declarator ; type: ( TK_int | TK_char | id:ID ) ; block : LCURLY ( statement )* RCURLY ; statement : (declaration) => declaration | expr SEMI | TK_if LPAREN expr RPAREN statement ( TK_else statement )? | TK_while LPAREN expr RPAREN statement | block ; expr: assignExpr ; assignExpr : aexpr (ASSIGN assignExpr)? ; aexpr : mexpr (PLUS mexpr)* ; mexpr : atom (STAR atom)* ; atom: ID | INT | CHAR_LITERAL | STRING_LITERAL ; antlr-2.7.7/examples/python/inherit.tinyc/inherit.g0000644000175000017500000000052010522211616022336 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ options { mangleLiteralPrefix = "TK_"; language="Python"; } class inherit_p extends tinyc_p; // add initializers to variables variable { pass } : type declarator (ASSIGN aexpr)? SEMI ; antlr-2.7.7/examples/python/inherit.tinyc/inherit.py0000644000175000017500000000127510522211616022550 0ustar twernertwerner import sys import antlr import tinyc_l import inherit_p def main(): L = tinyc_l.Lexer() P = inherit_p.Parser(L) P.setFilename(L.getFilename()) ### Parse the input expression try: P.program() except antlr.ANTLRException, ex: print "*** error(s) while parsing." print ">>> exit(1)" sys.exit(1) ast = P.getAST() if not ast: print "stop - no AST generated." return ###show tree print "Tree: " + ast.toStringTree() print "List: " + ast.toStringList() print "Node: " + ast.toString() print "visit>>" visitor = Visitor() visitor.visit(ast); print "visit<<" if __name__ == "__main__": main() antlr-2.7.7/examples/python/xml/0000755000175000017500000000000010522211616016540 5ustar twernertwernerantlr-2.7.7/examples/python/xml/xml.in0000644000175000017500000000055410522211616017674 0ustar twernertwerner ]> Text 蕈ﾟ & < antlr-2.7.7/examples/python/xml/Makefile.in0000644000175000017500000000346710522211616020617 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/xml ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/xml.g \ $(eol) g_py_FILES = \ xml_l.py \ $(eol) compile : $(g_py_FILES) %.py : $(_srcdir)/%.py @@RMF@ $@ && @CP@ $< $@ test :: test1 test1_deps = \ xml.py \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) xml.py < $(_srcdir)/xml.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup xml clean :: @@ECHO@ cleaning xml ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/xml/xml.py0000644000175000017500000000200310522211616017705 0ustar twernertwernerimport sys import antlr import codecs import xml_l def warn(msg): print >>sys.stderr,"warning:",msg sys.stderr.flush() def error(msg): print >>sys.stderr,"got error:",msg sys.stderr.flush() ### Xml handling depends very much on whether ### your terminal can handle (print) xml chars. ### To be sure about it, just create a non ASCII ### letter and try to print it. If that is not going ### to work, we create an alternative method which ### maps non printable chars to '?'. c = u"\N{LATIN SMALL LETTER O WITH ACUTE}" try: print c except: warn("terminal can't display unicode chars.") sys.stderr.flush() ## I'm just going to redefine 'unicode' to return ## a ASCII string. def unicode(x): return x.__str__().encode("ascii","replace") ### Now for the input. This should ideally be done ### in the lexer .. ### replace stdin with a wrapper that spits out ### unicode chars. sys.stdin = codecs.lookup('latin1')[-2](sys.stdin) for token in xml_l.Lexer() : pass antlr-2.7.7/examples/python/xml/xml.g0000644000175000017500000001235610522211616017517 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ /* Rudimentary lexer grammar for a non-validating XML parser. Lexer is not intended to be used by parser, but is standalone. Use something like while ( lexer.nextToken().getType() != Token.EOF_TYPE ); to iterate through tokens. Replace print statements (only there to make something visible) with your own code and have fun. Limitations: - internal DTD is parsed but not processed - only supported encoding is iso-8859-1 aka extended ASCII aka ISO-latin-1 - special entity references (like & <) do not get resolved (to '&', '<') - uses SAX attribute implementation (could easily be dropped) [TJP: commented out so it compiles w/o SAX.] - probably many more The good thing about some of these limitations is, that the parsed XML can be written *literally* unmodified. Author: Olli Z. (oliver@zeigermann.de) Initial date: 07.02.1999 (02/07/99) Complete revision: 16.01.2003 (01/16/03) Developed and testes with ANTLR 2.7.2 */ options { language=Python; } { def println(*args): for arg in args: print arg.encode("iso-8859-1") } class xml_l extends Lexer; options { // needed to tell "" and "" // also on exit branch "]]>", "-->" k=3; charVocabulary = '\3'..'\377'; // extended ASCII (3-255 in octal notation) caseSensitive=true; } DOCTYPE! : "' ; protected INTERNAL_DTD : '['! // reports warning, but is absolutely ok (checked generated code) // besides this warning was not generated with k=1 which is // enough for this rule... ( options {greedy=false;} : NL | STRING // handle string specially to avoid to mistake ']' in string for end dtd | . )* ']'! ; PI! : // { AttributesImpl attributes = new AttributesImpl(); } "" ; ////////////////// COMMENT! : "" { println( "COMMENT: "+c.getText())} ; protected COMMENT_DATA : ( options {greedy=false;} : NL | . )* ; ////////////////// ENDTAG! : "' { println( "ENDTAG: "+g.getText())} ; ////////////////// STARTTAG! : // XXX should org.xml.sax.AttributesImpl be replaced by something else? // { AttributesImpl attributes = new AttributesImpl(); } '<' g:NAME ( WS )? ( ATTR /*[attributes]*/ ( WS )? )* ( "/>" { println( "EMTYTAG: "+g.getText())} | '>' { println( "STARTTAG: "+g.getText())} ) ; PCDATA! : p:PCDATA_DATA { println( "PCDATA: X" + unicode(p.getText()) ) } ; protected PCDATA_DATA : ( options {greedy=true;} : NL | ~( '<' | '\n' | '\r' ) )+ ; CDATABLOCK! : "" { println("CDATABLOCK: "+p.getText()) } ; protected CDATA_DATA : ( options {greedy=false;} : NL | . )* ; protected ATTR // [AttributesImpl attributes] : name:NAME ( WS )? '=' ( WS )? value:STRING_NO_QUOTE /* { attributes.addAttribute("", "", name.getText(), "CDATA", value.getText()); } */ { println( "ATTRIBUTE: "+name.getText()+"="+value.getText()) } ; protected STRING_NO_QUOTE : '"'! (~'"')* '"'! | '\''! (~'\'')* '\''! ; protected STRING : '"' (~'"')* '"' | '\'' (~'\'')* '\'' ; protected NAME : ( LETTER | '_' | ':') ( options {greedy=true;} : NAMECHAR )* ; protected NAMECHAR : LETTER | DIGIT | '.' | '-' | '_' | ':' ; protected DIGIT : '0'..'9' ; protected LETTER : 'a'..'z' | 'A'..'Z' ; protected WS : ( options { greedy = true; } : ' ' | ESC )+ ; protected ESC : ( '\t' | NL ) ; // taken from html.g // Alexander Hinds & Terence Parr // from antlr 2.5.0: example/html // // '\r' '\n' can be matched in one alternative or by matching // '\r' in one iteration and '\n' in another. I am trying to // handle any flavor of newline that comes in, but the language // that allows both "\r\n" and "\r" and "\n" to all be valid // newline is ambiguous. Consequently, the resulting grammar // must be ambiguous. I'm shutting this warning off. protected NL : ( options { generateAmbigWarnings=false; greedy = true; } : '\n' | "\r\n" | '\r' ) { $newline; } ; antlr-2.7.7/examples/python/tinybasic/0000755000175000017500000000000010522211616017725 5ustar twernertwernerantlr-2.7.7/examples/python/tinybasic/basic.g0000755000175000017500000007666110522211616021201 0ustar twernertwernerheader{ import basic } options { language=Python; } class basic_p extends Parser; options { k = 4; // two token lookahead exportVocab=TinyBasic; // Call its vocabulary "TinyBasic" //codeGenMakeSwitchThreshold = 2; // Some optimizations //codeGenBitsetTestThreshold = 3; defaultErrorHandler = false; // Don't generate parser error handlers //analyzerDebug=true; buildAST = true; } tokens { WS; } { } imaginaryTokenDefinitions : SLIST TYPE PROGRAM_DEF SUBROUTINE_DEF FUNCTION_DEF EXIT_MODULE PARAMETERS PARAMETER_DEF LABELED_STAT NUMBERED_STAT UNARY_MINUS UNARY_PLUS CASE_GROUP ARGLIST FOR_LOOP FOR_FROM FOR_TO FOR_BY FOR_BY_ONE FOR_BODY INT_FN_EXECUTE FLT_FN_EXECUTE STR_FN_EXECUTE SUB_EXECUTE EQ_COMP INDEX_OP SUBSTRING_OP DOT ARRAY1D ARRAY2D ARRAY3D ARRAY1D_PROXY ARRAY2D_PROXY ARRAY3D_PROXY VAR_PROXY WHEN_ERROR_CALL WHEN_ERROR_IN PRINT_ASCII PRINT_TAB PRINT_NUMERIC PRINT_STRING PRINT_COMMA PRINT_SEMI IF_THEN_BLOCK IF_BLOCK ELSE_IF_BLOCK ELSE_BLOCK CODE_BLOCK CONDITION ; // Compilation Unit: In TinyBasic, this is a single file. This is the start // rule for this parser compilationUnit[context] returns [r] { if not context: context = basic.Context() self.theContext=context; r = self.theContext } : // A compilation unit starts with an optional program definition ( programDefinition | /* nothing */ ) // Next we have a series of zero or more sub/function blocks ( subroutineDefinition | functionDefinition )* EOF! ; // PROGRAM ( parameter, parameter) programDefinition options {defaultErrorHandler = true;} // let ANTLR handle errors { pVector=None } : "program"! { self.theContext.setProgramScope() } pVector=parameters eol! // now parse the body cb:procedureBlock quit:"end" eol! { #quit.setType(EXIT_MODULE); #programDefinition = #(#[PROGRAM_DEF,"PROGRAM_DEF"],#programDefinition); self.theContext.popScope(); } ; // SUB IDENT ( parameter)* subroutineDefinition options {defaultErrorHandler = true;} // let ANTLR handle errors { pVector=None; } : p:"sub"! n:subName { self.theContext.pushSubroutineScope(); } pVector=params:parameters eol! // now parse the body of the class cb:procedureBlock quit:"end" "sub"! eol! { #quit.setType(EXIT_MODULE); #subroutineDefinition = #(#[SUBROUTINE_DEF,"SUBROUTINE_DEF"],#subroutineDefinition); sub=basic.DTSubroutine(#subroutineDefinition,#cb,self.theContext.getCurrentScope(),pVector,#n.getText()); self.theContext.popScope(); self.theContext.insertSubroutine(#n.getText(),sub); } ; // FUNCTION IDENT ( parameter)* functionDefinition options {defaultErrorHandler = true;} // let ANTLR handle errors { } : p:"function"^ fnType=n:newFunction {#p.setType(FUNCTION_DEF);} { self.theContext.pushScope(basic.FunctionScope(self.theContext.getCurrentScope())); } pVector=params:parameters eol! // now parse the body of the class cb:procedureBlock quit:"end" "function"! eol! { #quit.setType(EXIT_MODULE); fnc=basic.DTFunction(fnType,#params,#cb,self.theContext.getCurrentScope(),pVector,#n.getText()); #functionDefinition = #(#[FUNCTION_DEF,"FUNCTION_DEF"],#functionDefinition); self.theContext.popScope(); self.theContext.insertFunction(#n.getText(),fnc); } ; //funcName // : // INT_FN // | FLT_FN // | STR_FN // ; newFunction returns [r] : INT_FN { r=INT_FN; } | STR_FN { r=STR_FN; } | FLT_FN { r=FLT_FN; } ; // This is the body of a procedure. procedureBlock : codeBlock ; statement : nl ( singleStatement | ifStatements | compoundStatement ) ; parameters returns [r] { r = [] } : ( (LPAREN)=> LPAREN! parameterDeclarationList[r] RPAREN! | ) ; // A list of formal parameters parameterDeclarationList [r] { tbd=None; } : tbd=parameterDeclaration { r.append(tbd); } ( COMMA! tbd=parameterDeclaration { r.append(tbd); } )* {#parameterDeclarationList = #(#[PARAMETERS,"PARAMETERS"], #parameterDeclarationList);} ; parameterDeclaration returns [r] { varType=0 r = None } : varType=v:newVariable ( LPAREN! //d1:integerExpression ( COMMA! //d2:integerExpression ( COMMA! //d3:integerExpression { r = basic.DTDataTypeProxy(varType,self.theContext.getCurrentScope(),3); } | { r = basic.DTDataTypeProxy(varType,self.theContext.getCurrentScope(),2); } ) | { r = basic.DTDataTypeProxy(varType,self.theContext.getCurrentScope(),1); } ) RPAREN! | { r = basic.DTDataTypeProxy(varType,self.theContext.getCurrentScope(),0); } ) { #parameterDeclaration = #([VAR_PROXY], #parameterDeclaration); self.theContext.insertVariable(#v.getText(),r); } ; compoundStatement : forNextBlock | doUntilLoopBlock | doLoopUntilBlock | selectCaseBlock | eventCompoundStatements ; ifThenBlock : ifBlock ( options { warnWhenFollowAmbig = false; } : elseIfBlock )* ( options { warnWhenFollowAmbig = false; } : elseBlock )? endIfBlock { #ifThenBlock = #(#[IF_THEN_BLOCK,"IF_THEN_BLOCK"],#ifThenBlock);} ; ifStatements : (ifStatement)=> ifStatement | ifThenBlock ; ifStatement : "if"! condition "then"! singleStatement eol! ; ifBlock : "if"! condition "then"! eol! codeBlock { #ifBlock = #(#[IF_BLOCK,"IF_BLOCK"],#ifBlock);} ; elseIfBlock : nl ("else"! "if"! | "elseif"! ) condition "then"! eol! codeBlock { #elseIfBlock = #(#[ELSE_IF_BLOCK,"ELSE_IF_BLOCK"],#elseIfBlock);} ; elseBlock : nl "else"! eol! codeBlock { #elseBlock = #(#[ELSE_BLOCK,"ELSE_BLOCK"],#elseBlock);} ; endIfBlock : nl ("end"! "if"! | "endif"! ) eol! ; condition : relationalExpression { #condition = #(#[CONDITION,"CONDITION"],#condition);} ; codeBlock : ( options { warnWhenFollowAmbig = false; } : statement )* {#codeBlock = #(#[CODE_BLOCK,"CODE_BLOCK"],#codeBlock);} ; forNextBlock : "for"! ( // I=1 TO 2 (BY 1)? forFrom forTo forBy eol! forBody ) {#forNextBlock = #(#[FOR_LOOP,"FOR_LOOP"],#forNextBlock);} ; // The initializer for a for loop forFrom : numericStore EQ^ numericExpression {#forFrom = #(#[FOR_FROM,"FOR_FROM"],#forFrom);} ; forTo : "to"! numericExpression {#forTo = #(#[FOR_TO,"FOR_TO"],#forTo);} ; forBy : ( "by"! numericExpression {#forBy = #(#[FOR_BY,"FOR_BY"],#forBy);} | {#forBy = #(#[FOR_BY_ONE,"FOR_BY_ONE"],#forBy);} ) ; forBody : codeBlock nextStatement! {#forBody = #(#[FOR_BODY,"FOR_BODY"],#forBody);} ; nextStatement : nl "next" numericStore eol! ; doUntilLoopBlock : "do"! "until"^ condition eol! codeBlock nl "loop"! eol! ; doLoopUntilBlock : "do"^ eol! codeBlock nl "loop"! "until"! condition eol! ; selectCaseBlock : "select"^ "case"! expression eol (casesGroup)* nl "end" "select" eol! ; singleStatement : ( "library"^ STR_CONST | "dim"^ dimensionedVariables | "global"^ parameterDeclarationList[[]] | "beep" | "chain"^ stringExpression ("with" LPAREN! argList RPAREN!)? | "gosub"^ lineLabel | "goto"^ lineLabel | callSubroutineStatement | "return"^ (expression)? | ex:"exit"^ "sub"! {#ex.setType(EXIT_MODULE);} | ("let"!)? assignmentExpression | ("on" numericExpression)=> "on"^ numericExpression ("goto"^ | "gosub"^ ) lineLabel (COMMA! lineLabel)* | eventSingleStatements | "option"^ "base" INT_CONST | "out"^ integerExpression COMMA! integerExpression | "pause"^ (numericExpression)? | "redim"^ dimensionedVariables | "poke"^ integerExpression COMMA! integerExpression COMMA! integerExpression | "randomize"^ integerExpression | graphicsOutput | inputOutput | line_stuff | set_stuff ) eol! ; callSubroutineStatement : call:"call"^ subName (LPAREN! argList RPAREN!)? { #call.setType(SUB_EXECUTE); } ; dimensionedVariables { av=None; varType=0;} : ( varType=v:newVariable LPAREN! d1:integerExpression ( COMMA! d2:integerExpression ( COMMA! d3:integerExpression { av= basic.DTArray3D(varType,self.theContext.getCurrentScope()); #dimensionedVariables = #([ARRAY3D, "ARRAY3D"], #dimensionedVariables); } | { av= basic.DTArray2D(varType,self.theContext.getCurrentScope()); #dimensionedVariables = #([ARRAY2D, "ARRAY2D"], #dimensionedVariables); } ) | { av= basic.DTArray1D(varType,self.theContext.getCurrentScope()); #dimensionedVariables = #([ARRAY1D, "ARRAY1D"], #dimensionedVariables); } ) RPAREN! { self.theContext.insertVariable(#v.getText(),av);} ) ( COMMA dimensionedVariables )? ; lineLabel : INT_CONST | IDENT ; nl : ( options { warnWhenFollowAmbig = false; } : IDENT^ c:COLON! {#c.setType(LABELED_STAT);} | INT_CONST^ {#c.setType(NUMBERED_STAT);} )? ; constant : stringConstant | floatNumber ; binaryReadVariables : ( numericStore | stringStore "until" integerExpression ) (COMMA binaryReadVariables)? ; printList : ( tabExpression | printString | printNumeric ) ( ( c:COMMA { #c.setType(PRINT_COMMA);} | s:SEMI { #s.setType(PRINT_SEMI);} ) (printList)? )? ; tabExpression : "tab"! LPAREN! numericExpression RPAREN! { #tabExpression = #(#[PRINT_TAB,"PRINT_TAB"],#tabExpression);} ; printString : stringExpression { #printString = #(#[PRINT_STRING,"PRINT_STRING"],#printString);} ; printNumeric : numericExpression { #printNumeric = #(#[PRINT_NUMERIC,"PRINT_NUMERIC"],#printNumeric);} ; inputList : ( numericStore | stringStore ) (COMMA inputList)? ; inputOutput : "close"^ (POUND! integerExpression)? //| "cominfo" | "data"^ constant (COMMA! constant)* | "deletefile" stringExpression //| "fileinfo" | "input" ( "binary" (chanNumber)? binaryReadVariables | chanAndPrompt inputList ) | "open" chanNumber stringExpression ( COMMA ( "access" ( "input" | "output" | "outin" | "append" ) | "organization" ( "sequential" | "random" | "stream" | "append" ) | "recsize" integerExpression ) )+ //| "output" | print_ascii | "print" "binary" (chanNumber)? printList | "read" inputList | "restore" ; set_stuff : "set" ( "timer" numericExpression | "loc" LPAREN integerExpression COMMA integerExpression RPAREN | (chanNumber)? specifier integerExpression ) ; print_ascii : "print"! (chanNumber)? ("using" stringExpression)? printList {#print_ascii = #([PRINT_ASCII, "PRINT_ASCII"], #print_ascii);} ; specifier : "margin" | "zonewidth" | "address" | "record" ; chanNumber : POUND integerExpression COLON ; prompt : "prompt" stringExpression COLON ; chanAndPrompt : (chanNumber)? (prompt)? ; casesGroup : aCase codeBlock {#casesGroup = #([CASE_GROUP, "CASE_GROUP"], #casesGroup);} ; integerArray : argArray ; symbolicAddress : stringExpression ; deviceAddress : (adapterAddress COMMA!)? primaryAddress (COMMA! secondaryAddress)? ; primaryAddress : integerExpression ; secondaryAddress : integerExpression ; adapterAddress : stringExpression | "@" integerExpression ; combinationAddress : (deviceAddress)=> deviceAddress | adapterAddress ; aCase : "case"^ expression (COMMA! expression)* eol! ; integerArrayVariable : integerVariable ; stringArrayVariable : stringVariable ; floatArrayVariable : floatVariable ; arrayVariable : integerArrayVariable | stringArrayVariable | floatArrayVariable ; graphicsOutput : "brush"^ integerExpression | "circle"^ LPAREN! integerExpression COMMA integerExpression RPAREN! COMMA integerExpression ( COMMA integerExpression )? | "clear"^ ("metafileon" | "metafileoff" )? | "ellipse"^ LPAREN! integerExpression COMMA integerExpression RPAREN! MINUS LPAREN! integerExpression COMMA integerExpression RPAREN! ( COMMA integerExpression )? | "font"^ integerExpression ( COMMA integerExpression ( COMMA integerExpression )? )? | "loc"^ integerStore COMMA integerStore | "pen"^ integerExpression COMMA integerExpression COMMA integerExpression | "picture"^ stringExpression COMMA LPAREN! integerExpression COMMA integerExpression RPAREN! ( COMMA integerExpression )? | "polyline"^ integerArrayVariable LPAREN COMMA RPAREN ( COMMA integerExpression )? | "rectangle"^ LPAREN! integerExpression COMMA integerExpression RPAREN! MINUS LPAREN! integerExpression COMMA integerExpression RPAREN! ( COMMA integerExpression )? | "screen"^ ( "normal" | "condensed" | "display" | "zoom" | "unzoom" | "close_basic" ) ; line_stuff // ambiguity forced left factoring : "line" ( "input" (chanNumber)? stringStore | "enter" combinationAddress (prompt)? stringStore ("until" integerExpression)? | (LPAREN! integerExpression COMMA integerExpression RPAREN!)? MINUS LPAREN! integerExpression COMMA integerExpression RPAREN! ( COMMA integerExpression )? ) ; eventSingleStatements : "cause" ("error")? integerExpression | "cause" "event" integerExpression | ("disable" | "enable") ("srq"|"timer"|"gpib") ("discard")? | ("disable" | "enable") "event" integerExpression ("discard")? | "error" ( "abort" integerExpression | "retry" | "continue" | "stop" ) | "on" ( "event" integerExpression | "srq" | "timer" | "gpib" ) "call" subName ; eventCompoundStatements : w:"when"^ "error" ( "call"^ subName (LPAREN! argList RPAREN!)? eol! {#w.setType(WHEN_ERROR_CALL);} | "in"! eol! {#w.setType(WHEN_ERROR_IN);} (singleStatement)+ "use"^ eol! (singleStatement)+ ("end"! "when"! | "endwhen"!) eol ) ; subName : IDENT ; expression : numericExpression | stringExpression ; argList : arg ( COMMA! arg )* {#argList = #(#[ARGLIST,"ARGLIST"], argList);} ; arg : //(variable LPAREN COMMA)=> //variable LPAREN COMMA {dimCount=2;} ( COMMA {dimCount++;} )* RPAREN (argArray)=>argArray //| (variable LPAREN RPAREN)=> //variable LPAREN RPAREN | expression ; argArray : (variable LPAREN COMMA)=> v23:variable LPAREN! COMMA! ( COMMA! { #v23.setType(ARRAY3D); } | { #v23.setType(ARRAY2D); } ) RPAREN! | //(variable LPAREN RPAREN)=> v1:variable LPAREN RPAREN { #v1.setType(ARRAY1D); } ; // assignment expression (level 13) assignmentExpression : stringStore EQ^ stringExpression | integerStore EQ^ integerExpression | floatStore EQ^ numericExpression ; stringStore : (stringVariable LPAREN)=> {self.theContext.isArrayVariable(self.LT(1).getText())}? stringVariable lp:LPAREN^ {#lp.setType(INDEX_OP);} indices RPAREN | (stringVariable LBRACK)=> stringVariable lb:LBRACK^ {#lb.setType(SUBSTRING_OP);} integerExpression COLON! integerExpression RBRACK! | stringVariable ; integerStore : ( integerVariable LPAREN )=> {self.theContext.isArrayVariable(self.LT(1).getText())}? integerVariable lp:LPAREN^ {#lp.setType(INDEX_OP);} indices RPAREN! | integerVariable ; floatStore : ( floatVariable LPAREN )=> {self.theContext.isArrayVariable(self.LT(1).getText())}? floatVariable lp:LPAREN^ {#lp.setType(INDEX_OP);} indices RPAREN! | floatVariable ; numericStore : integerStore | floatStore ; stringVariable : STR_VAR ; integerVariable : INT_VAR ; floatVariable : ( FLT_VAR | IDENT ) ; // boolean relational expressions (level 5) relationalExpression : relationalXORExpression ; relationalXORExpression : relationalORExpression ( "xor"^ relationalORExpression )* ; relationalORExpression : relationalANDExpression ( "or"^ relationalANDExpression )* ; relationalANDExpression : relationalNOTExpression ( "and"^ relationalNOTExpression )* ; relationalNOTExpression : ("not"^)? primaryRelationalExpression ; primaryRelationalExpression : (numericExpression)=> numericExpression ( LT^ | GT^ | LE^ | GE^ | e1:EQ^ {#e1.setType( EQ_COMP );} | NE_COMP^ ) numericExpression | stringExpression ( LT^ | GT^ | LE^ | GE^ | e2:EQ^ {#e2.setType( EQ_COMP );} | NE_COMP^ ) stringExpression | LPAREN! relationalExpression RPAREN! ; numericValuedFunctionExpression : "abs"^ LPAREN! numericExpression RPAREN! | "acos"^ LPAREN! numericExpression RPAREN! | "asc"^ LPAREN! stringExpression RPAREN! | "atn"^ LPAREN! numericExpression RPAREN! | "cos"^ LPAREN! numericExpression RPAREN! | "dround"^ LPAREN! numericExpression COMMA! integerExpression RPAREN! | "errl"^ | "errn"^ | "exp"^ LPAREN! numericExpression RPAREN! | "fract"^ LPAREN! numericExpression RPAREN! | "get_event"^ LPAREN! numericExpression RPAREN! | "in"^ LPAREN! numericExpression RPAREN! | "instr"^ LPAREN! stringExpression COMMA! stringExpression RPAREN! | "int"^ LPAREN! numericExpression RPAREN! | "ival"^ LPAREN! stringExpression RPAREN! | "len"^ LPAREN! stringExpression RPAREN! | "lgt"^ LPAREN! numericExpression RPAREN! | "log"^ LPAREN! numericExpression RPAREN! | "max"^ LPAREN! (numericExpression)+ RPAREN! | "min"^ LPAREN! (numericExpression)+ RPAREN! | "peek"^ LPAREN! numericExpression COMMA! integerExpression RPAREN! | "pi"^ | "rnd"^ | "sgn"^ LPAREN! numericExpression RPAREN! | "signed"^ LPAREN! integerExpression RPAREN! | "sin"^ LPAREN! numericExpression RPAREN! | "sqr"^ LPAREN! numericExpression RPAREN! | "tan"^ LPAREN! numericExpression RPAREN! | "time"^ | "ubound"^ LPAREN! stringExpression COMMA! integerExpression RPAREN! | "val"^ LPAREN! stringExpression RPAREN! | "andb"^ LPAREN! integerExpression COMMA! integerExpression RPAREN! | "orb"^ LPAREN! integerExpression COMMA! integerExpression RPAREN! | "notb"^ LPAREN! integerExpression RPAREN! | "shiftb"^ LPAREN! integerExpression COMMA! integerExpression RPAREN! | "xorb"^ LPAREN! integerExpression COMMA! integerExpression RPAREN! ; integerExpression : numericExpression ; stringValuedFunctionExpression : "chr$"^ LPAREN! integerExpression RPAREN! | "date$"^ | "dround$"^ LPAREN! numericExpression COMMA! integerExpression RPAREN! | "errl$"^ | "errn$"^ LPAREN! integerExpression RPAREN! | "inchr$"^ | "ival$"^ LPAREN! integerExpression COMMA! integerExpression RPAREN! | "lwc$"^ LPAREN! stringExpression RPAREN! | "rpt$"^ LPAREN! stringExpression COMMA! integerExpression RPAREN! | "time$"^ | "upc$"^ LPAREN! stringExpression RPAREN! | "val$"^ LPAREN! numericExpression RPAREN! ; //numericExpression // : numericAdditiveExpression // ; // binary addition/subtraction (level 3) numericExpression : numericMultiplicativeExpression ( options { warnWhenFollowAmbig = false; } : (PLUS^ | MINUS^) numericMultiplicativeExpression )* ; // multiplication/division/modulo (level 2) numericMultiplicativeExpression : numericExponentialExpression ((STAR^ | "div"^ | "mod"^ | SLASH^ ) numericExponentialExpression)* ; numericExponentialExpression : numericUnaryExpression ( EXPO^ numericUnaryExpression)* ; numericUnaryExpression : ( p:PLUS^ {#p.setType(UNARY_PLUS);} | m:MINUS^ {#m.setType(UNARY_MINUS);} )? numericPrimaryExpression ; numericPrimaryExpression : floatNumber | numericStore | //(FLT_FN|INT_FN)=> ( FLT_FN^ {#FLT_FN.setType(FLT_FN_EXECUTE);} | INT_FN^ {#INT_FN.setType(INT_FN_EXECUTE);} ) ( (LPAREN)=> LPAREN argList RPAREN | ) | numericValuedFunctionExpression | e:LPAREN! numericExpression RPAREN! ; floatNumber : integerNumber | FLT_CONST ; stringExpression : stringConcatanateExpression ; // binary addition/subtraction (level 3) stringConcatanateExpression : stringPrimaryExpression ( AMPERSAND^ stringConcatanateExpression)? ; stringPrimaryExpression : stringStore | stringConstant | STR_FN^ ((LPAREN)=>LPAREN! argList RPAREN!)? {#STR_FN.setType(STR_FN_EXECUTE);} | stringValuedFunctionExpression ; indices : numericExpression (COMMA! indices)? ; stringConstant : STR_CONST ; integerNumber : INT_CONST | BINARY_INTEGER | OCTAL_INTEGER | HEXADECIMAL_INTEGER ; newVariable returns [r] { r=0;} : INT_VAR { r=INT_VAR; } | STR_VAR { r=STR_VAR; } | FLT_VAR { r=FLT_VAR; } | IDENT { r=FLT_VAR; } ; variable : numericStore | stringStore ; eol! : ( options { warnWhenFollowAmbig = false; } : EOL! )+ ; //---------------------------------------------------------------------------- //---------------------------------------------------------------------------- // The TinyBasic scanner //---------------------------------------------------------------------------- //---------------------------------------------------------------------------- class basic_l extends Lexer; options { importVocab=TinyBasic; // call the vocabulary "TinyBasic" testLiterals=true; // automatically test for literals k=6; // four characters of lookahead caseSensitive=false; caseSensitiveLiterals = false; } // OPERATORS AMPERSAND : '&' ; LPAREN : '(' ; RPAREN : ')' ; LBRACK : '[' ; RBRACK : ']' ; COLON : ':' ; COMMA : ',' ; //DOT : '.' ; EQ : '=' ; NE_COMP : "<>" ; //BNOT : '~' ; SLASH : '/' ; PLUS : '+' ; MINUS : '-' ; STAR : '*' ; GE : ">=" ; GT : ">" ; LE : "<=" ; LT : '<' ; SEMI : ';' ; POUND : '#' ; BINARY_INTEGER : "&b" ('0' | '1' ) + ; OCTAL_INTEGER : "&o" ('0'..'7' ) + ; HEXADECIMAL_INTEGER : "&h" ('0'..'9' | 'a'..'f' ) + ; // Whitespace -- ignored WS : ( ' ' | '\t' | '\f' ) { _ttype = Token.SKIP; } ; EOL : ( "\r\n" // Evil DOS | '\r' // Macintosh | '\n' // Unix (the right way) ) { self.newline(); } ; // Single-line comments SL_COMMENT : '!' (~('\n'|'\r'))* //('\n'|'\r'('\n')?) { $setType(Token.SKIP); //newline(); } ; // character literals CHAR_LITERAL : '\'' ( (ESCc)=> ESCc | ~'\'' ) '\'' ; // string literals STR_CONST : '"'! ( (ESCs)=> ESCs | (ESCqs)=> ESCqs | ~('"'))* '"'! ; protected ESCc : '<' ('0'..'9')+ '>' ; protected ESCs : "<<" ('0'..'9')+ ">>" ; protected ESCqs : '"' '"'! ; // hexadecimal digit (again, note it's protected!) protected HEX_DIGIT : ('0'..'9'|'a'..'f') ; // a dummy rule to force vocabulary to be all characters (except special // ones that ANTLR uses internally (0 to 2) protected VOCAB : '\3'..'\377' ; // an identifier. Note that testLiterals is set to true! This means // that after we match the rule, we look in the literals table to see // if it's a literal or really an identifer IDENT options {testLiterals=true;} : ('a'..'z') ('a'..'z'|'0'..'9'|'_'|'.')* ( '$' { if $getText[0:2].lower() == "fn" : _ttype=STR_FN; else: _ttype=STR_VAR; } | '%' { if $getText[0:2].lower() == "fn" : _ttype=INT_FN; else: _ttype=INT_VAR; } | '#' { if $getText[0:2].lower() == "fn" : _ttype=FLT_FN; else: _ttype=FLT_VAR; } | { if $getText[0:2].lower() == "fn" : _ttype=FLT_FN; } ) ; // a numeric literal INT_CONST { isDecimal=False } : '.' { $setType(DOT) } (('0'..'9')+ (EXPONENT)? (FLT_SUFFIX)? { $setType(FLT_CONST) })? | ( '0' {isDecimal = True} // special case for just '0' ( ('x') ( // hex // the 'e'|'E' and float suffix stuff look // like hex digits, hence the (...)+ doesn't // know when to stop: ambig. ANTLR resolves // it correctly by matching immediately. It // is therefor ok to hush warning. options { warnWhenFollowAmbig=false; } : HEX_DIGIT )+ | ('0'..'7')+ // octal )? | ('1'..'9') ('0'..'9')* {isDecimal=True} // non-zero decimal ) ( ('l') // only check to see if it's a float if looks like decimal so far | {isDecimal}? ( '.' ('0'..'9')* (EXPONENT)? (FLT_SUFFIX)? | EXPONENT (FLT_SUFFIX)? | FLT_SUFFIX ) { $setType(FLT_CONST); } )? ; // a couple protected methods to assist in matching floating point numbers protected EXPONENT : ('e') ('+'|'-')? ('0'..'9')+ ; protected FLT_SUFFIX : 'f'|'d' ; antlr-2.7.7/examples/python/tinybasic/Makefile.in0000644000175000017500000000265310522211616022000 0ustar twernertwerner## This file is part of PyANTLR. See LICENSE.txt for license ## details..........Copyright (C) Wolfgang Haefelinger, 2004. ## ## do not change this value subdir=examples/python/tinybasic ##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx @stdvars@ ##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## get configured standard deps @stddeps@ srcdir = @abs_top_srcdir@/$(subdir) gen_FILES = basic_l.py basic_p.py basic_w.py g_FILES = $(srcdir)/basic.g $(srcdir)/basic_w.g all :: $(gen_FILES) test :: $(gen_FILES) basic.py $(python) basic_l.py < $(srcdir)/basic.in $(python) basic.py < $(srcdir)/basic.in $(python) basic.py < $(srcdir)/basic1.in $(python) basic.py < $(srcdir)/basic2.in basic : test basic.py : $(srcdir)/basic.py @-@RMF@ $@ && @CP@ $< . $(gen_FILES) : $(g_FILES) @ @RMF@ $(gen_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(gen_FILES) $(gen_FILES) : @ANTLR_JAR@ ### cleanup basic clean :: @@ECHO@ cleaning basic ... @ -@RMF@ $(gen_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes .PHONY: basic .PHONY: test1 antlr-2.7.7/examples/python/tinybasic/basic.in0000755000175000017500000000100410522211616021334 0ustar twernertwerner PROGRAM ( ChainParameterString$ , DebugMode% ) a$="hello" b$="somanchi" print a$,b$ x%=2 do until x%=100 x% = x% + 1 print x% loop print "Tine" do x%=x%+1 print x%,x%,"Hello World" loop until x%>100 if x% = 1 then print 21 else if x% = 2 then print 22 else if x% = 5 then print 23 else print 24 end if for x%=1 to 3 y% = x% print x% , y% + 2 next x% y% = 2 if 1 = 0 then print "1==1" else print "1!=1" end if end antlr-2.7.7/examples/python/tinybasic/basic.py0000755000175000017500000005207310522211616021372 0ustar twernertwernerimport sys import antlr version = sys.version.split()[0] if version < '2.2.1': False = 0 if version < '2.3': True = not False class Stack: def __init__(self): self.data = [] def push(self,item): self.data.append(item) def pop(self): self.data.pop() def peek(self): return self.data[-1] class HashTab: def __init__(self): self.data = {} def put(self,k,v): self.data[k] = v def get(self,k): r = None try: r = self.data[k] except: pass return r class Context(object): def __init__(self): self.theGlobalScope = GlobalScope() self.theScopeStack = Stack() self.theScopeStack.push(self.theGlobalScope) self.subroutineTable = HashTab() self.functionTable = HashTab() self._invar() def _invar(self): s = self.theScopeStack.peek() assert s if not isinstance(s,Scope): print "type(s)=",type(s) x = ProgramScope() print "type(x)=",type(x) assert isinstance(x,Scope) assert 0 def insertSubroutine(self, v, t): self.subroutineTable.put(v.lower(),t) def getSubroutine(self, v): return self.subroutineTable.get(v.lower()) def insertFunction(self, v, t): self.functionTable.put(v.lower(),t) def getFunction(self, v): return self.functionTable.get(v.lower()) def insertGlobalVariable(self, v, t) : self.theGlobalScope.insertVariable(v,t) def insertVariable(self, v, t) : self.getCurrentScope().insertVariable(v,t) def getVariable(self, var): t=self.getCurrentScope().getVariable(var) if(t==None): t=self.theGlobalScope.getVariable(var) return t def getVariableDimension(self, var): dim=self.getCurrentScope().getVariableDimension(var) if(dim==0): dim=self.theGlobalScope.getVariableDimension(var) return dim def getVariableType(self, var): t=self.getCurrentScope().getVariable(var) if(t==None): t=self.theGlobalScope.getVariable(var) if t: return t.getType() else: return 0 def isArrayVariable(self,s): return (self.getVariableDimension(s) > 0) def getPrev(self): return self.getCurrentScope().getPrev() def pushScope(self,scope): assert isinstance(scope,Scope) self.theScopeStack.push(scope) def popScope(self): if self.getCurrentScope() == self.theGlobalScope : return self.theGlobalScope else: return self.theScopeStack.pop() def getCurrentScope(self): self._invar() r = self.theScopeStack.peek() assert r assert isinstance(r,Scope) return r def getGlobalScope(self): return theGlobalScope def setProgramScope(self,scope=None): if not scope: scope = ProgramScope(self.getCurrentScope()) self.theProgramScope = scope assert isinstance(self.theProgramScope,Scope) while self.theScopeStack.peek() != self.theGlobalScope: self.theScopeStack.pop() self.theScopeStack.push(self.theProgramScope) def getProgramScope(self): return self.theProgramScope def pushSubroutineScope(self): self.pushScope(SubroutineScope(self.getCurrentScope())) def initialize(self): self.setProgramScope(self.getProgramScope()) def setDimension(self,s,*args): v = self.getVariable(s) v.setDimension(*args) def getDTDataType(self,s,*args): t = self.getVariable(s) r = t.getDTDataType(*args) return r def ensureVariable(self,s,t): v = self.getVariable(s) if not v: assert isinstance(t,int) v = self.getOne(t,self.getCurrentScope()) self.insertVariable(s,v) return v def getOne(self,t,scope): assert isinstance(t,int) assert isinstance(scope,Scope) t = makeone(t,scope) assert t return t class SaveEnv: def __init__(self,scope,args): self.scope=scope self.args=args def getScope(self): return scope def getArgs(self): return args class CodeContext: def __init__(self,context,scope,args): self.context = context self.scope = scope self.args = args class DTCodeType(object): def __init__(self,entry,cb,scope,args,name): self.entry = entry self.cb = cb self.scope = scope self.args = args self.name = name self.callDepthStack = Stack() def newCall(self,context): codeContext = CodeContext(context,self.scope,self.args) self.callDepthStack.push(codeContext) context.pushScope(self.scope) def attachArg(self,argnum,arg): proxy = self.args[argnum-1] proxy.attach(arg) def getAST(self): return self.entry ### create data instance def makeone(aType,scope): import basic_p assert isinstance(aType,int) if ( aType==basic_p.INT_CONST ): return DTInteger(scope,0) if ( aType==basic_p.INT_VAR ): return DTInteger(scope,0) if ( aType==basic_p.FLT_CONST ): return DTFloat(scope,0.0) if ( aType==basic_p.FLT_VAR ): return DTFloat (scope,0.0) if ( aType==basic_p.STR_CONST ): return DTString (scope,"") if ( aType==basic_p.STR_VAR ): return DTString (scope,"") assert 0 return None class DTDataType(object): def __init__(self,scope,_ttype): if scope: assert isinstance(scope,Scope) self.scope=scope else: self.scope = None assert isinstance(_ttype,int) self.theType=_ttype def getType(self): return self.theType def getInteger(self): return 12345 def getFloat(self): return 12345.0 def getString(self): return None def _set_int(self,tbd): pass def setInteger(self,tbd): if isinstance(tbd,int): self._set_int(tbd) return if isinstance(tbd,str): self._set_int(int(tbd)) return self.setInteger(tbd.getInteger()) def _set_float(self,tbd): pass def setFloat(self,tbd): if isinstance(tbd,float): self._set_float(tbd) return if isinstance(tbd,str): self._set_float(float(tbd)) return self.setFloat(tbd.getFloat()) def _set_string(self,tbd): pass def setString(self,tbd): if isinstance(tbd,str): self._set_string(tbd) return else: self.setString(tbd.getString()) def getDTDataType(self,*args): return None def setDTDataType(self,*args): pass def assign(self,tbd): pass def getDimension(self): return 0 def getDimensioned(self,i): return 0 def multiply(self,other): return None def divide(self,other): return None def add(self,other): return None def subtract(self,other): return None def mod(self,other): return None def round(self,other): return None def truncate(self,other): return None def getOne(self,arg=None): t = makeone(self.theType,self.scope) assert t if arg: t.assign(arg) assert t return t def cloneDTDataType(self): return self.getOne(self) def setDimension(self,*args): pass def compareTo(self,o): pass def attach(self,theBoss):pass ######## class DTDataTypeProxy (DTDataType): def __init__(self,theType,scope,dims): DTDataType.__init__(self,scope,theType) self.dims = dims def getType(self): return self.theBoss.getType() def getInteger(self): return self.theBoss.getInteger() def getFloat(self): return self.theBoss.getFloat() def getString(self): return self.theBoss.getString() def setInteger(self,item): theBoss.setInteger(item) def setFloat(self,item): theBoss.setFloat(item) def setString(self,item): theBoss.setString(item) def getDTDataType(self,*args): return self.theBoss.getDTDataType(*args) def setDTDataType(self,*args): self.theBoss.setDTDataType(*args) def assign(self,tbd): self.theBoss.assign(tbd) def getDimension(self,item=None): if not item: return self.dims return self.theBoss.getDimensioned(item) def multiply(self,other): return self.theBoss.multiply(other) def divide(self,other): return self.theBoss.divide(other) def add(self,other): return self.theBoss.add(other) def subtract(self,other): return self.theBoss.subtract(other) def mod(self,other): return self.theBoss.mod(other) def round(self,other): return self.theBoss.round(other) def truncate(self,other): return self.theBoss.truncate(other) def getOne(self): return self.theBoss.getOne() def compareTo(self, o): return self.theBoss.compareTo(o) def attach(self,theBoss): self.theBoss=theBoss def cloneDTDataType(self): return DTDataTypeProxy(theType,scope,dims) def __str__(self): return str(self.theBoss) toString = __str__ class DTExecException(Exception): def __init__(self,s): Exception.__init__(self,s) class DTExitModuleException(DTExecException): def __init__(self,s): DTExecException.__init__(self,s) class DTFunction(DTCodeType): def __init__(self,_ttype, entry, cb,scope, args,name): DTDataType.__init__(entry,scope,args,name) class DTFloat(DTDataType): def __init__(self,scope,item): import basic_p DTDataType.__init__(self,scope,basic_p.FLT_VAR) self.setFloat(item) def _set_int(self,tbd): self.s = tbd * 1.0 def _set_float(self,tbd): self.s = tbd def getFloat(self): return self.s def assign(self,tbd): self.setFloat(tbd) def multiply(self,other): return DTFloat(None,self.getFloat()*other.getFloat()) def divide(self,other): return DTFloat(None,getFloat()/other.getFloat()) def add(self,other): return DTFloat(None,getFloat()+other.getFloat()) def subtract(self,other): return DTFloat(None,getFloat()-other.getFloat()) def mod(self,other): return DTFloat(None,getFloat() % other.getFloat()) def round(self): return DTInteger(None,DTFloat(None,self.getFloat()+0.5)) def truncate(self): return DTInteger(None,self.getInteger()) def compareTo(self, o): if(getFloat() < (o).getFloat()): return -1 if ( getFloat() > (o).getFloat()): return 1 return 0 def __str__(self): return str(self.s) toString = __str__ class DTInteger (DTDataType): def __init__(self,scope,item): import basic_p DTDataType.__init__(self,scope,basic_p.INT_VAR) self.setInteger(item) def getInteger(self): assert isinstance(self.s,int) return self.s def _set_int(self,tbd): assert isinstance(tbd,int) self.s = tbd def _set_float(self,tbd): self.s = float(tbd) def getFloat(self): return self.s * 1.0 def assign(self,tbd): self.setInteger(tbd) def multiply(self,other): if isinstance(other, DTFloat): t = DTFloat(None,self) return t.multiply(other) return DTInteger(None,self.getInteger()*other.getInteger()) def divide(self,other): if isinstance(other, DTFloat): t = DTFloat(None,self) return t.divide(other) return DTInteger(None,self.getInteger()/other.getInteger()) def add(self,other): if isinstance(other, DTFloat): t = DTFloat(None,self) return t.add(other) return DTInteger(None,self.getInteger()+other.getInteger()) def subtract(self,other): if isinstance(other, DTFloat): t = DTFloat(None,self) return t.subtract(other) return DTInteger(None,self.getInteger()-other.getInteger()) def mod(self,other): if isinstance(other, DTFloat): t = DTFloat(None,self) return t.mod(other) return DTInteger(None,self.getInteger() % other.getInteger()) def round(self): return self def truncate(self): return this def compareTo(self, o): if( self.getInteger() < (o).getInteger()): return -1 if ( self.getInteger() > (o).getInteger()): return 1 return 0 def __str__(self): return str(self.s) toString=__str__ class DTString (DTDataType): def __init__(self,scope,item): import basic_p DTDataType.__init__(self,scope,basic_p.STR_VAR) self.setString(item) def _set_string(self,s): self.s=s def getString(self): return self.s def compareTo(self, o): return s.compareTo(o.getString()) def assign(self,tbd): self.setString(tbd) def __str__(self): return self.s toString=__str__ class DTSubroutine(DTCodeType): def __init__(self,entry,cb,scope,args,name): DTCodeType.__init__(self,entry,cb,scope,args,name) class DTArray1D(DTDataType): def __init__(self,_type,scope): DTDataType.__init__(self,scope,_type) self.data = [] self.dim1 = 1 self.base = 0 def init(self): self.data = [] * self.dim1 def _get(self,idx1): assert isinstance(idx1,int) t = self.data[idx1] return t def _set(self,item,idx1): assert isinstance(idx1,int) self.data[idx1] = item def getDTDataType(self,i1): idx1 = i1.getInteger()-self.base if self.dim1==0 : self.dim1=10 self.init() if idx1>self.dim1: return None t = self._get(idx1) if not t: self._set(self.getOne(),idx1) return t def setDTDataType(self,i1,s): idx1 = i1.getInteger() - self.base if self.dim1==0: self.dim1 = 10 self.init() if(idx1<=self.dim1): t = self._get(idx1) if not t: t = self._set(self.getOne(s),idx1) else: t.assign(s) def getDimension(self): return 1 def getDimensiond(self,i): if i==1: return self.dim1 return 0 def setDimension(self,i1): if isinstance(i1,int): self.dim1 = i1 self.init() return if isinstance(i1,DTInteger): self.setDimension(i1.getInteger()) return assert 0 def compareTo(self,o): return 0 class DTArray2D(DTDataType): def __init__(self,_type,scope): DTDataType.__init__(self,scope,_type) self.data = [] self.dim1 = 0 self.dim2 = 0 self.base = 0 self._checkdim() def _checkdim(self): assert isinstance(self.dim1,int) assert isinstance(self.dim2,int) def init(self): self._checkdim() self.data = [None] * (self.dim2 * self.dim1) def _get(self,idx1,idx2): assert isinstance(idx1,int) assert isinstance(idx2,int) t = self.data[idx1*self.dim1+idx2] return t def _set(self,item,idx1,idx2): assert isinstance(idx1,int) assert isinstance(idx2,int) self.data[idx1*self.dim1+idx2] = item return self._get(idx1,idx2) def getDTDataType(self,i1,i2): idx1=i1.getInteger()-self.base idx2=i2.getInteger()-self.base if(self.dim1==0): self.dim1=10 self.dim2=10 self.init() if(idx1>self.dim1): return None if(idx2>self.dim2): return None t = self._get(idx1,idx2) if not t: t = self._set(self.getOne(),idx1,idx2) assert t return t def setDTDataType(self,i1,i2,s): idx1=i1.getInteger()-self.base idx2=i2.getInteger()-self.base if(self.dim1==0): self.dim1=10 self.dim2=10 self.init() if idx1<=self.dim1 and idx2<=self.dim2: t = self._get(idx1,idx2) if not t: t = self._set(self.getOne(s),idx1,idx2) else: t.assign(s) else: raise Exception("index out of range:") def getDimension(self): return 2 def getDimensioned(self,i): if (i==1): return self.dim1 if (i==2): return self.dim2 return 0 def _toint(self,item): if isinstance(item,int): return item if isinstance(item,DTInteger): return item.getInteger() assert 0 def setDimension(self,i1,i2): self.dim1 = self._toint(i1) self.dim2 = self._toint(i2) self._checkdim() self.init() def compareTo(self,o): return 0 class DTArray3D(DTDataType): def __init__(self,_type,scope): DTDataType.__init__(self,scope,_type) self.data = [] self.dim1 = 0 self.dim2 = 0 self.dim3 = 0 self.base = 0 def init(self): self.data = [None] * (self.dim1 * self.dim2 * self.dim3) def _get(self,idx1,idx2,idx3): assert isinstance(idx1,int) assert isinstance(idx2,int) assert isinstance(idx3,int) t = self.data[idx1 * (self.dim1*self.dim2) + idx2*self.dim2 + idx3] return t def _set(self,item,idx1,idx2,idx3): assert isinstance(idx1,int) assert isinstance(idx2,int) assert isinstance(idx3,int) self.data[idx1 * (self.dim1*self.dim2) + idx2*self.dim2 + idx3] = item def getDTDataType(self,i1,i2,i3): idx1=i1.getInteger()-self.base idx2=i2.getInteger()-self.base idx3=i3.getInteger()-self.base if not dim1: self.dim1 = self.dim2 = self.dim3 =10 self.init() if(idx1>self.dim1): return None if(idx2>self.dim2): return None if(idx3>self.dim3): return None t = self._get(idx1,idx2,idx3) if not t: t = self._set(self.getOne(),idx1,idx2,idx3) return t def setDTDataType(self,i1,i2,i3,s): idx1=i1.getInteger()-self.base idx2=i2.getInteger()-self.base idx3=i3.getInteger()-self.base if(self.dim1==0): self.dim1 = self.dim2 = self.dim3 = 10 self.init() if(idx1<=self.dim1 and idx2<=self.dim2 and idx3<=self.dim3): t= self._get(idx1,idx2,idx3) if not t: t = self._set(self.getOne(s),idx1,idx2,idx3) else: t.assign(s) def getDimension(self): return 3 def getDimensioned(self,i): if(i==1): return self.dim1 if (i==2): return self.dim2 if (i==3): return self.dim3 return 0 def setDimension(self,i1,i2,i3): self.dim1 = i1 self.dim2 = i2 self.dim3 = i3 self.init() def compareTo(self,o): return 0 class Scope(object): def __init__(self,prev=None): self.prev = prev self.symbolTable = HashTab() def cloneScope(self,prev): newScope = Scope(prev) return newScope def insertVariable(self,v,t): self.symbolTable.put(v.lower(),t) def getVariable(self,v): t=self.symbolTable.get(v.lower()) return t def getVariableDimension(self,v): t=self.getVariable(v) if t: return t.getDimension() else: return 0 def getVariableType(self,v): t=self.getVariable(v) if t: return t.getType() else: return 0 def isArrayVariable(self,s): return (self.getVariableDimension(s) > 0) def getPrev(self): return self.prev class FunctionScope(Scope): def __init(self,prev): Scope.__init__(self,prev) class GlobalScope(Scope): def __init(self,prev=None): Scope.__init__(self,prev) class ProgramScope(Scope): def __init(self,prev): Scope.__init__(self,prev) assert isinstance(self,Scope) class SubroutineScope(Scope): def __init(self,prev): Scope.__init__(self,prev) class Visitor(antlr.ASTVisitor): def __init__(self,*args): super(Visitor,self).__init__(*args) self.level = 0 if not args: self.cout = sys.stdout return if isinstance(args[0],file): self.cout = args[0] return assert 0 def tabs(self): print " " * self.level def printf(self,fmt,*args): if not args: sys.stdout.write(fmt) return argv = tuple(args) self.cout.write(fmt % argv) def flush(self): self.cout.flush() def visit1(self,node): if not node: self.printf(" nil ") return c = node.getType() t = node.getText() k = node.getFirstChild() s = node.getNextSibling() self.printf("( <%s> ",c) if t: self.printf(" %s ",t) self.visit1(k) self.visit1(s) self.printf(")") def visit(self,node): self.visit1(node) self.printf("\n") if __name__ == "__main__": import basic_l import basic_p import basic_w L = basic_l.Lexer() P = basic_p.Parser(L) P.setFilename(L.getFilename()) ### Parse the input expression C = P.compilationUnit(None) ast = P.getAST() if not ast: print "stop - no AST generated." import sys sys.exit(1) W = basic_w.Walker() W.compilationUnit(ast,C) antlr-2.7.7/examples/python/tinybasic/basic1.in0000644000175000017500000000050110522211616021413 0ustar twernertwernerPROGRAM ( ChainParameterString$ , DebugMode% ) x%=2 do until x%=5 x% = x% +1 print x% loop do x%=x%+1 print x%,x%,"Hello World" loop until x%=7 if x% = 1 then print 21 else if x% = 2 then print 22 else if x% = 5 then print 23 else print 24 end if for x%=1 to 3 y%=x% print x% , y%+2 next x% y% = 2 end antlr-2.7.7/examples/python/tinybasic/basic_w.g0000755000175000017500000003441210522211616021513 0ustar twernertwernerheader{ import basic } options { language=Python; } { def println(*args): if not args: print "" return // make empty line here to test for E0009 for x in args[0:-1]: print x, print args[-1] def printx(*args): if not args: return for x in args: print x, } class basic_w extends TreeParser; options { importVocab = TinyBasic; } { } compilationUnit[context] returns [self.theContext = context] { self.theContext.initialize(); self.zero = basic.DTInteger(self.theContext.getCurrentScope(),0); self.posOne = basic.DTInteger(self.theContext.getCurrentScope(),1); self.negOne = basic.DTInteger(self.theContext.getCurrentScope(),-1); } : pd:PROGRAM_DEF { try: self.programDefinition(pd) except basic.DTExecException, didit: print "Yes it works!", didit } ; programDefinition : #( PROGRAM_DEF moduleBody ) ; subroutineDefinition : #( SUBROUTINE_DEF IDENT moduleBody ) ; moduleBody : #(PARAMETERS parameters ) #(CODE_BLOCK ( statement )+ ) EXIT_MODULE { raise basic.DTExitModuleException("Done folks") } ; parameters : (parameter)* ; parameter { argNum=0;} : #(VAR_PROXY arg[argNum]{ argNum += 1} ) ; arg[r] : ( s:STR_VAR //{v=theContext.ensureVariable(s.getText(),STR_VAR);} | i:INT_VAR //{v=theContext.ensureVariable(i.getText(),INT_VAR);} | f:FLT_VAR //{v=theContext.ensureVariable(f.getText(),FLT_VAR);} ) ; statement { expr = None } : when_error_call_statement | dim_statement // done | forNextStatement // done | printAsciiStatement // done | ifThenBlock // done | expr=assign_statement // done | doUntilLoop // done | doLoopUntil // done | subExecuteStatement // done | exitModuleStatement // done ; exitModuleStatement : EXIT_MODULE { raise basic.DTExitModuleException("Asynchronous return") } ; subExecuteStatement { sub=None; argNum=0;tbd=None; } : #(SUB_EXECUTE i:IDENT { sub=self.theContext.getSubroutine(i.getText()) } #(ARGLIST ( tbd=argExpr { argNum +=1 sub.attachArg(argNum,tbd) } )* ) { try: sub.newCall(self.theContext); try: self.subroutineDefinition(sub.getAST()) except basic.DTExitModuleException, didit: print "Yes it works!", didit except antlr.ANTLRException, ex: pass } ) ; argExpr returns [exprValue] : a1d:ARRAY1D { exprValue=self.theContext.getVariable(a1d.getText()); } | a2d:ARRAY2D { exprValue=self.theContext.getVariable(a2d.getText()); } | a3d:ARRAY3D { exprValue=self.theContext.getVariable(a3d.getText()); } | exprValue=expr ; printAsciiStatement : #(PRINT_ASCII (printField)* { print } ) ; printField {d=None} : #(PRINT_NUMERIC d=expr { printx(d)}) | #(PRINT_STRING d=expr { printx(d)}) | #(PRINT_TAB d=expr) | PRINT_COMMA { printx("\t")} | PRINT_SEMI ; assign_statement returns [exprValue] { e=None } : #( EQ exprValue=data_store e=expr { exprValue.assign(e); } ) ; expr returns [exprValue] { c=None;d=None;e1=None;e2=None;e3=None } : #( STAR e1=expr e2=expr { exprValue=e1.multiply(e2) } ) | #( PLUS e1=expr e2=expr { exprValue=e1.add(e2) } ) | #( SLASH e1=expr e2=expr { exprValue=e1.multiply(e2) } ) | #( "div" e1=expr e2=expr { exprValue=e1.divide(e2) } ) | #( "mod" e1=expr e2=expr { exprValue=e1.mod(e2) } ) // comparison operators | #( EQ_COMP e1=expr e2=expr { exprValue=basic.DTInteger(None, antlr.ifelse(e1.compareTo(e2)==0,1,0)) } ) | #( NE_COMP e1=expr e2=expr { exprValue=basic.DTInteger(None, antlr.ifelse(e1.compareTo(e2)==0,0,1)) } ) | #( LE e1=expr e2=expr { exprValue=basic.DTInteger(None, antlr.ifelse(e1.compareTo(e2)<=0,1,0)) } ) | #( LT e1=expr e2=expr { exprValue=basic.DTInteger(None, antlr.ifelse(e1.compareTo(e2) <0,1,0)) } ) | #( GE e1=expr e2=expr { exprValue=basic.DTInteger(None, antlr.ifelse(e1.compareTo(e2)>=0,1,0)) } ) | #( GT e1=expr e2=expr { exprValue=basic.DTInteger(None, antlr.ifelse(e1.compareTo(e2) >0,1,0)) } ) // Boolean algebra | #( "xor" e1=expr e2=expr { exprValue=basic.DTInteger(None,antlr.ifelse(e1.getInteger()!=e2.getInteger(),1,0)) } ) | #( "and" e1=expr e2=expr { exprValue=basic.DTInteger(None,antlr.ifelse(e1.getInteger()==1 and e2.getInteger()==1,1,0)) } ) | #( "or" e1=expr e2=expr { exprValue=basic.DTInteger(None,antlr.ifelse(e1.getInteger()==1 or e2.getInteger()==1,1,0)) } ) // unary operators | #( "not" e1=expr { exprValue=basic.DTInteger(None,antlr.ifelse(e1.getInteger()==0,1,0)) } ) | #( UNARY_PLUS e1=expr { exprValue=e1 } ) | #( UNARY_MINUS e1=expr { exprValue=e1.multiply(self.negOne) } ) | #( SUBSTRING_OP e1=expr e2=expr e3=expr { exprValue=e1.getDTDataType(e2,e3) } ) | d=data_store { exprValue=d } | c=con { exprValue=c } ; id returns [value] : ( s:STR_VAR {value=self.theContext.ensureVariable(s.getText(),STR_VAR)} | i:INT_VAR {value=self.theContext.ensureVariable(i.getText(),INT_VAR)} | f:FLT_VAR {value=self.theContext.ensureVariable(f.getText(),FLT_VAR)} ) ; con returns [value] : s:STR_CONST {value=basic.DTString (self.theContext.getCurrentScope(),s.getText())} | i:INT_CONST {value=basic.DTInteger (self.theContext.getCurrentScope(),i.getText())} | f:FLT_CONST {value=basic.DTFloat (self.theContext.getCurrentScope(),f.getText())} ; data_store returns [value] { i1=None;i2=None;i3=None;tbd=None;} : #(INDEX_OP v:dimension_variable i1=expr ( i2=expr ( i3=expr { value=self.theContext.getDTDataType( v.getText(),i1,i2,i3) } | { value=self.theContext.getDTDataType( v.getText(),i1,i2) } ) | { value=self.theContext.getDTDataType( v.getText(),i1) } ) ) | value=id ; // FOR NEXT BLOCK --------------------------------------- forNextStatement { ff=None;ft=None;fb=None; } : #(FOR_LOOP ff=forFrom ft=forTo fb=forBy b:FOR_BODY { while ff.compareTo(ft) != fb.compareTo(self.zero): try: self.forBody(b) ff.assign(ff.add(fb)) except antlr.ANTLRException,ex: pass } ) ; forFrom returns [forValue] : #(FOR_FROM forValue=assign_statement) ; forTo returns [forValue] : #(FOR_TO forValue=expr) ; forBy returns [forValue] : #(FOR_BY forValue=expr) | FOR_BY_ONE {forValue=basic.DTInteger(self.theContext.getCurrentScope(),1)} ; // IF THEN BLOCK --------------------------------------------- ifThenBlock { done=0 } : #( IF_THEN_BLOCK ( {done==0}? done=ifThenBody )+ ) ; ifThenBody returns [ifValue] { r=0 } : #(IF_BLOCK ifValue=conditional[1] ) | #(ELSE_IF_BLOCK ifValue=conditional[1] ) | #(ELSE_BLOCK cb:CODE_BLOCK { self.codeBlock(cb) } ) ; conditional[forWhat] returns [condValue] : c:CONDITION cb:CODE_BLOCK { condValue = self.condition(c).getInteger() if forWhat==condValue: self.codeBlock(cb) } ; doUntilLoop : #("until" c:CONDITION { while 0 == self.conditional(c,0): pass } ) ; doLoopUntil : #("do" cb:CODE_BLOCK c:CONDITION { self.codeBlock(cb); while 0 == self.condition(c).getInteger(): self.codeBlock(cb) } ) ; when_error_call_statement : #( WHEN_ERROR_CALL "call" i:IDENT {println(" Attaching error:",i.getText())} ) ; dim_statement { i1=None;i2=None;i3=None; } : #("dim" ( #( ARRAY1D dv1:dimension_variable i1=expr { self.theContext.setDimension(dv1.getText(),i1)} ) | #( ARRAY2D dv2:dimension_variable i1=expr i2=expr { self.theContext.setDimension(dv2.getText(),i1,i2)} ) | #( ARRAY3D dv3:dimension_variable i1=expr i2=expr i3=expr { self.theContext.setDimension(dv3.getText(),i1,i2,i3)} ) ) ) ; dimension_variable : STR_VAR | FLT_VAR | INT_VAR ; // Numeric functions doubleFunctions returns [funcValue] {n=None;i=None;s=None;} : #("abs" n=expr {funcValue=basic.DTFloat(None,Math.abs(n.getFloat()))} ) /* | #("acos" n=expr {tbd=new DTFloat(None,Math.acos(n.getFloat()));} ) | #("asc" s=expr {tbd=new DTInteger(None,Math.asc(n.getFloat()));} ) | #("atn" n=expr {tbd=new DTFloat(None,Math.atn(n.getFloat()));} ) | #("cos" n=expr {tbd=new DTFloat(None,Math.cos(n.getFloat()));} ) | #("dround" n=expr i=expr {tbd=new DTFloat(None,Math.dround(n.getFloat()));} ) | #("errl" {tbd=new DTFloat(None,Math.errl(n.getFloat()));} ) | #("errn" {tbd=new DTInteger(None,Math.errn(n.getFloat()));} ) | #("exp" n=expr {tbd=new DTFloat(None,Math.exp(n.getFloat()));} ) | #("fract" n=expr {tbd=new DTFloat(None,Math.fract(n.getFloat()));} ) | #("get_event" n=expr {tbd=new DTFloat(None,Math.get_event(n.getFloat()));} ) | #("in" n=expr {tbd=new DTFloat(None,Math.expr(n.getFloat()));} ) | #("instr" s=expr s=expr {tbd=new DTFloat(None,Math.abs(n.getFloat()));} ) | #("int" n=expr {tbd=new DTFloat(None,Math.int(n.getFloat()));} ) | #("ival" s=expr {tbd=new DTFloat(None,Math.ival(n.getFloat()));} ) | #("len" s=expr {tbd=new DTFloat(None,Math.len(n.getString()));} ) | #("lgt" n=expr {tbd=new DTFloat(None,Math.abs(n.getFloat()));} ) | #("log" n=expr {tbd=new DTFloat(None,Math.abs(n.getFloat()));} ) | #("max" ( n=expr { if tbd: tbd=n elif((n.compare(tbd)>0): tbd=n } )+ ) | #("min" ( n=expr { if tbd: tbd=n elif((n.compare(tbd)<0): tbd=n } )+ ) | #("peek" n=expr i=expr {tbd=new DTInteger(None,Math.peek(n.getFloat()));} ) | #("pi" {tbd=new DTFloat(None,Math.pi(n.getFloat()));} ) | #("rnd" {tbd=new DTInteger(None,Math.rnd(n.getFloat()));} ) | #("sgn" n=expr {tbd=new DTInteger(None,n.compare(zero)));} ) | #("signed" i=expr {tbd=new DTFloat(None,Math.abs(n.getFloat()));} ) | #("sin" n=expr {tbd=new DTFloat(None,Math.sin(n.getFloat()));} ) | #("sqr" n=expr {tbd=new DTFloat(None,Math.sqr(n.getFloat()));} ) | #("tan" n=expr {tbd=new DTFloat(None,Math.tan(n.getFloat()));} ) | #("time" {tbd=new DTFloat(None,Math.time(n.getFloat()));} ) | #("ubound" s=expr i=expr {tbd=new DTInteger(None,Math.ubound(n.getFloat()));} ) | #("val" s=expr {tbd=new DTFloat(None,Math.val(n.getFloat()));} ) // BIT Functions | #("andb" i=expr i=expr {tbd=new DTInteger(None,Math.andb(n.getFloat()));} ) | #("orb" i=expr i=expr {tbd=new DTInteger(None,Math.orb(n.getInteger()));} ) | #("notb" i=expr {tbd=new DTInteger(None,Math.abs(n.getInteger()));} ) | #("shiftb" i=expr i=expr {tbd=new DTInteger(None,Math.abs(i.getInteger()));} ) | #("xorb" i=expr i=expr {tbd=new DTInteger(None,Math.abs(i.getInteger()));} ) */ ; //-------------Orphan helpers // Helper Orphan condition returns [condValue] : #(CONDITION condValue=expr) ; // Helper Orphan forBody : #(FOR_BODY codeBlock) ; // Helper Orphan codeBlock : #(CODE_BLOCK (statement)*) ; antlr-2.7.7/examples/python/tinybasic/basic2.in0000644000175000017500000000034510522211616021422 0ustar twernertwernerPROGRAM ( ChainParameterString$ , DebugMode% ) dim a%(2,3) a%(1,2)=7 print "row=1 col=2=>>>",a%(1,2) x%=3 call xyz(x%,2,a%(,)) end sub xyz( y% , z% ,b%(,) ) print "Are you watching?",y%,z%,b%(1,2) exit sub end sub antlr-2.7.7/examples/python/HTML/0000755000175000017500000000000010522211616016504 5ustar twernertwernerantlr-2.7.7/examples/python/HTML/Makefile.in0000644000175000017500000000340510522211616020553 0ustar twernertwerner## This file is part of ANTLR (http://www.antlr.org). Have a ## look into LICENSE.txt for license details. This file has ## been written by (C) Wolfgang Haefelinger, 2004. ## do not change this value subdir=examples/python/HTML ## get configured (standard) variables - checkout or modify ## scripts/config.vars[.in] for details. @stdvars@ ### how to get rid of damned dos line ending style and -- al- ### most equally worse -- stupid tab character. ### dos2unix = perl -p -i.tmp -e 's,\r,,g;s,\t, ,g' dos2unix = : ### when running python we invoke python like .. python = /bin/sh @abs_this_builddir@/scripts/python.sh ## get configured rules @stdmake@ ## By default we compile class files so we are ready to carry ## out a test. Note that deps have been setup in such a way ## that you can do a 'make compile' whithout having made ## antlr.jar before. this : compile all :: compile g_FILES = \ $(_srcdir)/html.g \ $(eol) g_py_FILES = \ html_l.py \ $(eol) compile : $(g_py_FILES) test :: test1 test1_deps = \ $(g_py_FILES) \ $(buildtree)/scripts/python.sh \ $(eol) test1_cmd = \ $(python) html_l.py < $(_srcdir)/html.in \ $(eol) test1 : $(test1_deps) @ $(test1_cmd) $(g_py_FILES) : $(g_FILES) @ @RMF@ $(g_py_FILES) @ @ANTLR_COMPILE_CMD@ $(g_FILES) @ $(dos2unix) $(g_py_FILES) $(g_py_FILES) : @ANTLR_JAR@ $(g_py_FILES) : $(buildtree)/scripts/antlr.sh ### cleanup html clean :: @@ECHO@ cleaning html ... @ -@RMF@ $(g_py_FILES) @ -@RMF@ *.pyc *.tmp *TokenTypes.txt *TokenTypes ### get configured dependencies - for example, just list ### autoconf variable ANTLR_JAR as reference and it will ### be done automatically as stddeps contains appropr. ### rule. For details, checkout scripts/config.vars[.in] @stddeps@ .PHONY: compile .PHONY: test1 antlr-2.7.7/examples/python/HTML/html.in0000644000175000017500000000312410522211616020000 0ustar twernertwerner A test file fdsfdsfdssfd

ANTLR 2.xx Meta-Language

ANTLR 2.0 accepts three types of grammar specifications -- parsers, lexers, and tree-parsers (also called tree-walkers). Because ANTLR 2.0 uses LL(k) analysis for all three grammar variants, the grammar specifications are similar, and the generated lexers and parsers behave similarly.

Note: in this document, the word "parser" usually includes tree-parsers as well as token stream parsers, except where noted.

Meta-Language Vocabulary

Whitespace. Spaces, tabs, and newlines are separators in that they can separate ANTLR vocabulary

Download ANTLR 2.4.0.

ANTLR 2.4.0 release notes

ANTLR Meta-Language

antlr-2.7.7/examples/python/HTML/html.g0000644000175000017500000002105010522211616017616 0ustar twernertwerner// This file is part of PyANTLR. See LICENSE.txt for license // details..........Copyright (C) Wolfgang Haefelinger, 2004. // // $Id$ header "html_l.__main__" { L = Lexer() token = L.nextToken() while not token.isEOF(): print token token = L.nextToken() } options { language=Python; } class html_l extends Lexer; options { k = 4; exportVocab=HTML; charVocabulary = '\3'..'\377'; caseSensitive=false; filter=UNDEFINED_TOKEN; } /* STRUCTURAL tags */ DOCTYPE : "' ; OHTML : "" ; CHTML : "" ; OHEAD : "" ; CHEAD : "" ; OBODY : "' ; CBODY : "" ; /* HEAD ELEMENTS */ OTITLE : "" ; CTITLE : "" ; OSCRIPT : "" ; ISINDEX : "' ; META : "' ; LINK : "' ; /* headings */ OH1 : "' ; CH1 : "" ; OH2 : "' ; CH2 : "" ; OH3 : "' ; CH3 : "" ; OH4 : "' ; CH4 : "" ; OH5 : "' ; CH5 : "" ; OH6 : "' ; CH6 : "" ; OADDRESS : "
" ; CADDRESS : "
" ; OPARA : "' ; CPARA : "

" //it's optional ; /*UNORDERED LIST*/ OULIST : "' ; CULIST : "" ; /*ORDERED LIST*/ OOLIST : "' ; COLIST : "" ; /*LIST ITEM*/ OLITEM : "' ; CLITEM : "" ; /*DEFINITION LIST*/ ODLIST : "' ; CDLIST : "" ; ODTERM : "
" ; CDTERM : "
" ; ODDEF : "
" ; CDDEF : "
" ; ODIR: "" ; CDIR_OR_CDIV : "' ; ODIV: "' ; OMENU : "" ; CMENU : "" ; OPRE: ("
" | "") ('\n')? 
	;

CPRE:	 "</pre>" | "" 
	;

OCENTER
	:	"
"
	;

CCENTER
	:	"
"
	;

OBQUOTE
	:	"
"
	;

CBQUOTE
	:	"
"
	;

//this is block element and thus can't be nested inside of
//other block elements, ex: paragraphs.
//Netscape appears to generate bad HTML vis-a-vis the standard.

HR	:	"'
	;


OTABLE	
	:	"'
	;

CTABLE
	: 	""
	;

OCAP:	"'
	;

CCAP:	""
	;

O_TR
	:	"'
	;

C_TR:	""
	;

O_TH_OR_TD
	:	("'
	;

C_TH_OR_TD
	:	"" | ""
	;

/*	PCDATA-LEVEL ELEMENTS
*/

/*		font style elemens*/
	
OTTYPE
	:	""
	;

CTTYPE
	:	""
	;

OITALIC
	:	""
	;

CITALIC
	:	""
	;

OBOLD
 	:	"" 
	;

CBOLD
	:	"" 
	;

OUNDER
	:	""
	;

CUNDER
	:	"" 
	;

/* Left-factor  and  to reduce lookahead */
OSTRIKE_OR_OSTRONG
	:	"'
	;

CST_LEFT_FACTORED
	:	"'
	;

OSTYLE
 	: 	"

  

  
          
C++ Notes

          


          
The C++ runtime and generated grammars look very much the
          same as the java ones. There are some subtle differences
          though, but more on this later.


          
Building the runtime


          
The following is a bit unix centric. For Windows some
          contributed project files can be found in lib/cpp/contrib. These
          may be slightly outdated.
          
The runtime files are located in the lib/cpp subdirectory
          of the ANTLR distribution. Building it is in general done via the
			 toplevel configure script and the Makefile generated by the configure
			 script. Before configuring please read INSTALL.txt in the toplevel directory. The file lib/cpp/README may contain some extra information on specific target machines.


./configure --prefix=/usr/local
make



          
Installing ANTLR and the runtime is then done by typing


make install


          This installs the runtime library libantlr.a in
          /usr/local/lib and the header files in
          /usr/local/include/antlr. Two convenience scripts antlr and
          antlr-config are also installed into /usr/local/bin. The first
          script takes care of invoking antlr and the other can be used to
          query the right options for your compiler to build files with
          antlr.

          
Using the runtime

          Generally you will compile the ANTLR generated files with
          something similar to:

c++ -c MyParser.cpp -I/usr/local/include


          Linking is done with something similar to:

c++ -o MyExec <your .o files> -L/usr/local/lib -lantlr



          
Getting ANTLR to generate
          C++


          
To get ANTLR to generate C++ code you have to add


language="Cpp";


          to the global options section. After that things are pretty
          much the same as in java mode except that a all token and AST
          classes are wrapped by a reference counting class (this to
          make live easier (in some ways and much harder in others)).
			 The reference counting class uses

operator->


          to reference the object it is wrapping. As a result of this
          you use -> in C++ mode in stead of the '.' of java. See
          the examples in examples/cpp for some illustrations.

          
AST types


			
New as of ANTLR 2.7.2 is that if you supply the
			
buildAST=true
 option to a parser then you have
			to set and initialize an ASTFactory for the parser and
			treewalkers that use the resulting AST.

ASTFactory my_factory;	// generates CommonAST per default..
MyParser parser( some-lexer );
// Do setup from the AST factory repeat this for all parsers using the AST
parser.initializeASTFactory( my_factory );
parser.setASTFactory( &my_factory );


			 
In C++ mode it is also possible to override the AST type used
          by the code generated by ANTLR. To do this you have to do the
          following:

          
    
            
  • 
              Define a custom AST class like the following:

    #ifndef __MY_AST_H__
#define __MY_AST_H__

#include <antlr/CommonAST.hpp>

class MyAST;

typedef ANTLR_USE_NAMESPACE(antlr)ASTRefCount<MyAST> RefMyAST;

/** Custom AST class that adds line numbers to the AST nodes.
 * easily extended with columns. Filenames will take more work since
 * you'll need a custom token class as well (one that contains the
 * filename)
 */
class MyAST : public ANTLR_USE_NAMESPACE(antlr)CommonAST {
public:
   // copy constructor
   MyAST( const MyAST& other )
   : CommonAST(other)
   , line(other.line)
   {
   }
   // Default constructor
   MyAST( void ) : CommonAST(), line(0) {}
   virtual ~MyAST( void ) {}
   // get the line number of the node (or try to derive it from the child node
   virtual int getLine( void ) const
   {
      // most of the time the line number is not set if the node is a
      // imaginary one. Usually this means it has a child. Refer to the
      // child line number. Of course this could be extended a bit.
      // based on an example by Peter Morling.
      if ( line != 0 )
         return line;
      if( getFirstChild() )
         return ( RefMyAST(getFirstChild())->getLine() );
      return 0;
   }
   virtual void setLine( int l )
   {
      line = l;
   }
   /** the initialize methods are called by the tree building constructs
    * depending on which version is called the line number is filled in.
    * e.g. a bit depending on how the node is constructed it will have the
    * line number filled in or not (imaginary nodes!).
    */
   virtual void initialize(int t, const ANTLR_USE_NAMESPACE(std)string& txt)
   {
      CommonAST::initialize(t,txt);
      line = 0;
   }
   virtual void initialize( ANTLR_USE_NAMESPACE(antlr)RefToken t )
   {
      CommonAST::initialize(t);
      line = t->getLine();
   }
   virtual void initialize( RefMyAST ast )
   {
      CommonAST::initialize(ANTLR_USE_NAMESPACE(antlr)RefAST(ast));
      line = ast->getLine();
   }
   // for convenience will also work without
   void addChild( RefMyAST c )
   {
      BaseAST::addChild( ANTLR_USE_NAMESPACE(antlr)RefAST(c) );
   }
   // for convenience will also work without
   void setNextSibling( RefMyAST c )
   {
      BaseAST::setNextSibling( ANTLR_USE_NAMESPACE(antlr)RefAST(c) );
   }
   // provide a clone of the node (no sibling/child pointers are copied)
   virtual ANTLR_USE_NAMESPACE(antlr)RefAST clone( void )
   {
      return ANTLR_USE_NAMESPACE(antlr)RefAST(new MyAST(*this));
   }
   static ANTLR_USE_NAMESPACE(antlr)RefAST factory( void )
   {
      return ANTLR_USE_NAMESPACE(antlr)RefAST(RefMyAST(new MyAST()));
   }
private:
   int line;
};
#endif

    
            
    • 

            
  • 
              Tell ANTLR's C++ codegenerator to use your RefMyAST by
              including the following in the options section of your grammars:

    ASTLabelType = "RefMyAST";

    
              After that you only need to tell the parser before every
              invocation of a new instance that it should use the AST
              factory defined in your class. This is done like this:

    // make factory with default type of MyAST
ASTFactory my_factory( "MyAST", MyAST::factory );
My_Parser parser(lexer);
// make sure the factory knows about all AST types in the parser..
parser.initializeASTFactory(my_factory);
// and tell the parser about the factory..
parser.setASTFactory( &my_factory );

    

    After these steps you can access methods/attributes of (Ref)MyAST
directly (without typecasting) in parser/treewalker productions.

    Forgetting to do a setASTFactory results in a nice SIGSEGV or you OS's
equivalent. The default constructor of ASTFactory initializes itself to
generate CommonAST objects.

    If you use a 'chain' of parsers/treewalkers then you have to make sure
they all share the same AST factory. Also if you add new definitions of
ASTnodes/tokens in downstream parsers/treewalkers you have to apply the
respective initializeASTFactory methods to this factory.

    This all is demonstrated in the examples/cpp/treewalk example.
            
    • 
          


          
Using Heterogeneous AST
          types


			 
This should now (as of 2.7.2) work in C++ mode. With probably some
			 caveats.
			 
The heteroAST example show how to set things up. A short excerpt:

ASTFactory ast_factory;

parser.initializeASTFactory(ast_factory);
parser.setASTFactory(&ast_factory);


			
A small excerpt from the generated initializeASTFactory method:

void CalcParser::initializeASTFactory( antlr::ASTFactory& factory )
{
   factory.registerFactory(4, "PLUSNode", PLUSNode::factory);
   factory.registerFactory(5, "MULTNode", MULTNode::factory);
   factory.registerFactory(6, "INTNode", INTNode::factory);
   factory.setMaxNodeType(11);
}



After these steps ANTLR should be able to decide what factory to use at
what time.

          
Extra functionality in C++
          mode.

          In C++ mode ANTLR supports some extra functionality to make
          life a little easier.

          
Inserting Code

          In C++ mode some extra control is supplied over the places
          where code can be placed in the gerenated files. These are
          extensions on the header directive. The syntax is:

header "<identifier>" {  }




          

            

              identifier

              where
            


            

              pre_include_hpp

              Code is inserted before ANTLR generated includes in
              the header file.
            


            

              post_include_hpp

              Code is inserted after ANTLR generated includes in
              the header file, but outside any generated namespace
              specifications.
            


            

              pre_include_cpp

              Code is inserted before ANTLR generated includes in
              the cpp file.
            


            

              post_include_cpp

              Code is inserted after ANTLR generated includes in
              the cpp file, but outside any generated namespace
              specifications.
            

          


          
Pacifying the preprocessor


          
Sometimes various tree building constructs with '#'
          in them clash with the C/C++ preprocessor. ANTLR's
          preprocessor for actions is slightly extended in C++ mode to
          alleviate these pains.

			 
NOTE: At some point I plan to replace the '#' by
          something different that gives less trouble in C++.

          
The following preprocessor constructs are not
          touched. (And as a result you cannot use these as labels for
          AST nodes.


          
    
            
  • if
    • 

            
  • define
    • 

            
  • ifdef
    • 

            
  • ifndef
    • 

            
  • else
    • 

            
  • elif
    • 

            
  • endif
    • 

            
  • warning
    • 

            
  • error
    • 

            
  • ident
    • 

            
  • pragma
    • 

            
  • include
    • 
          


          
As another extra it's possible to escape '#'-signs
          with a backslash e.g. "\#". As the action lexer sees these
          they get translated to simple '#' characters.


          
A template grammar file for
          C++


header "pre_include_hpp" {
    // gets inserted before antlr generated includes in the header file
}
header "post_include_hpp" {
    // gets inserted after antlr generated includes in the header file
     // outside any generated namespace specifications
}

header "pre_include_cpp" {
    // gets inserted before the antlr generated includes in the cpp file
}

header "post_include_cpp" {
    // gets inserted after the antlr generated includes in the cpp file
}

header {
    // gets inserted after generated namespace specifications in the header
    // file. But outside the generated class.
}

options {
   language="Cpp";
    namespace="something";      // encapsulate code in this namespace
//  namespaceStd="std";         // cosmetic option to get rid of long defines
                                // in generated code
//  namespaceAntlr="antlr";     // cosmetic option to get rid of long defines
                                // in generated code
    genHashLines = true;        // generated #line's or turn it off.
}

{
   // global stuff in the cpp file
   ...
}
class MyParser extends Parser;
options {
   exportVocab=My;
}
{
   // additional methods and members
   ...
}
... rules ...

{
   // global stuff in the cpp file
   ...
}
class MyLexer extends Lexer;
options {
   exportVocab=My;
}
{
   // additional methods and members
   ...
}
... rules ...

{
   // global stuff in the cpp file
   ...
}
class MyTreeParser extends TreeParser;
options {
   exportVocab=My;
}
{
   // additional methods and members
   ...
}
... rules ...






antlr-2.7.7/doc/glossary.html0000644000175000017500000005577010522211615016114 0ustar  twernertwerner

	ANTLR-centric Language Glossary






ANTLR-centric Language Glossary


Terence Parr



This glossary defines some of the more important terms used in the
ANTLR documentation.  I have tried to be very informal and provide
references to other pages that are useful.  For another great source
of information about formal computer languages, see Wikipedia.








Ambiguous


A language is ambiguous if the same sentence or phrase can be
interpreted in more than a single way.  For example, the following
sentence by Groucho Marx is easily interpreted in two ways: "I once
shot an elephant in my pajamas.  How he got in my pajamas I'll never
know!"  In the computer world, a typical language ambiguity is the
if-then-else ambiguity where the else-clause may be attached to either
the most recent if-then or an older one.  Reference manuals for
computer languages resolve this ambiguity by stating that else-clauses
always match up with the most recent if-then.



A grammar is ambiguous if the same input sequence can be derived in
multiple ways.  Ambiguous languages always yield ambiguous grammars
unless you can find a way to encode semantics (actions or predicates
etc...) that resolve the ambiguity.  Most language tools like ANTLR
resolve the if-then-else ambiguity by simply choosing to match
greedily (i.e., as soon as possible).  This matches the else with the
most recent if-then.  See nondeterministic.


ANTLR


ANother Tool for Language Recognition, a
predicated-LL(k) parser generator that handles lexers, parsers, and
tree parsers.  ANTLR has been available since 1990 and led to a
resurgence of recursive-descent parsing after decades dominated by LR
and other DFA-based strategies.


AST


Abstract Syntax Tree.  ASTs are used as internal
representations of an input stream, normally constructed during a
parsing phase.  Because AST are two-dimensional trees they
can encode the structure (as determined by the parser) of the input as
well as the input symbols.



A homogeneous AST is in one in which the physical objects are all of
the same type; e.g., CommonAST in ANTLR.  A heterogeneous
tree may have multiple types such as PlusNode,
MultNode etc...


 An AST is not a parse tree, which encodes the sequence of rules
used to match input symbols.  See What's the
difference between a parse tree and an abstract syntax tree (AST)? Why
doesn't ANTLR generate trees with nodes for grammar rules like JJTree
does?.


An AST for input 3+4 might be represented as

   +
  / \
 3   4



or more typically (ala ANTLR) in child-sibling form:


+
|
3--4



Operators are usually subtree roots and operands are usually leaves.


Bit set


Bit sets are an extremely efficient representation for dense integer
sets.  You can easily encode sets of strings also by mapping unique
strings to unique integers.  ANTLR uses bitsets for lookahead
prediction in parsers and lexers.  Simple bit set implementations do
not work so well for sparse sets, particularly when the maximum
integer stored in the set is large.


 ANTLR's bit set represents membership with a bit for each possible
integer value.  For a maximum value of n, a bit set needs
n/64 long words or n/8 bytes.  For ASCII bit sets with a
maximum value of 127, you only need 16 bytes or 2 long words.  UNICODE
has a max value of \uFFFF or 65535, requiring 8k bytes, and these sets
are typically sparse.  Fortunately most lexers only need a few of
these space inefficient (but speedy) bitsets and so it's not really a
problem.


Child-sibling Tree


A particularly efficient data structure for representing trees.  See AST.


Context-free grammar


A grammar where recognition of a particular construct does not depend
on whether it is in a particular syntactic context.  A context-free
grammar has a set of rules like


stat : IF expr THEN stat
     | ...
     ;



where there is no restriction on when the IF alternative may
be applied--if you are in rule stat, you may apply the
alternative.


Context-sensitive


A grammar where recognition of a particular construct may depend on a
syntactic context.  You never see these grammars in practice because
they are impractical (Note, an Earley parser is O(n^3) worst-case for
context-free grammars).  A context-free rule looks like:


Α → γ



but a context-sensitive rule may have context on the left-side:


αΑβ → αγβ



meaning that rule Α may only be applied (converted to γ)
in between α and β.



In an ANTLR sense, you can recognize context-sensitive constructs with
a semantic predicate.  The action evaluates to true or false
indicating the validity of applying the alternative.



See Context-sensitive gramar.


DFA


Deterministic Finite Automata.  A state machine
used typically to formally describe lexical analyzers.  lex
builds a DFA to recognize tokens whereas ANTLR builds a recursive
descent lexer similar to what you would build by hand.  See Finite
state machine and ANTLR's lexer documentation.


FIRST


The set of symbols that may be matched on the left-edge of a rule.
For example, the FIRST(decl) is set {ID, INT} for the following:


decl : ID ID SEMICOLON
     | INT ID SEMICOLON
     ;



The situation gets more complicated when you have optional
constructs.  The FIRST(a) below is {A,B,C}


a : (A)? B
  | C
  ;



because the A is optional and the B may be seen on the left-edge.



Naturally k>1 lookahead symbols makes this even more complicated.
FIRST_k must track sets of k-sequences not just individual symbols.


FOLLOW


The set of input symbols that may follow any reference to the
specified rule.  For example, FOLLOW(decl) is {RPAREN, SEMICOLON):


methodHead : ID LPAREN decl RPAREN ;
var : decl SEMICOLON ;
decl : TYPENAME ID ;



because RPAREN and SEMICOLON both follow references to rule decl.
FIRST and FOLLOW computations are used to analyze grammars and
generate parsing decisions.



This grammar analysis all gets very complicated when k>1.


Grammar


A finite means of formally describing the structure of a possibly
infinite language.  Parser generators build parsers that recognize
sentences in the language described by a grammar.  Most parser
generators allow you to add actions to be executed during the parse.


Hoisting


Semantic predicates describe the semantic context in which a rule or
alternative applies.  The predicate is hoisted into a prediction
expression.  Hoisting typically refers to pulling a predicate out of
its enclosing rule and into the prediction expression of another
rule.  For example,


decl     : typename ID SEMICOLON
         | ID ID SEMICOLON
         ;
typename : {isType(LT(1))}? ID
         ;



The predicate is not needed in typename as there is no decision,
however, rule decl needs it to distinguish between its two
alternatives.  The first alternative would look like:


if ( LA(1)==ID && isType(LT(1)) ) {
  typename();
  match(ID);
  match(SEMICOLON);
}



PCCTS 1.33 did, but ANTLR currently does not hoist predicates into
other rules.


Inheritance, grammar


The ability of ANTLR to define a new grammar as it differs from an
existing grammar.  See the ANTLR documentation.


LA(n)

The nth lookahead character, token type, or AST node type depending
on the grammar type (lexer, parser, or tree parser respectively).


Left-prefix, left factor


A common sequence of symbols on the left-edge of a set of alternatives
such as:


a : A B X
  | A B Y
  ;



The left-prefix is A B, which you can remove by left-factoring:


a : A B (X|Y)
  ;



Left-factoring is done to reduce lookahead requirements.


Literal


Generally a literal refers to a fixed string such as begin
that you wish to match.  When you reference a literal in an ANTLR
grammar via "begin", ANTLR assigns it a token type like any
other token.  If you have defined a lexer, ANTLR provides information
about the literal (type and text) to the lexer so it may detect
occurrences of the literal.


Linear approximate lookahead


An approximation to full lookahead (that can be applied to both LL and LR
parsers) for k>1 that reduces the complexity of storing and testing
lookahead from O(n^k) to O(nk); exponential to linear reduction.  When
linear approximate lookahead is insufficient (results in a
nondeterministic parser), you can use the approximate lookahead to
attenuate the cost of building the full decision.


Here is a simple example illustrating the difference between full
and approximate lookahead:


a : (A B | C D)
  | A D
  ;



This rule is LL(2) but not linear approximate LL(2).  The real
FIRST_2(a) is {AB,CD} for alternative 1 and {AD} for alternative 2.
No intersection, so no problem.  Linear approximate lookahead
collapses all symbols at depth i yielding k sets instead of a possibly
n^k k-sequences.  The approximation (compressed) sets are
{AB,AD,CD,CB} and {AD}.  Note the introduction of the spurious
k-sequences AD and CB.  Unfortunately, this compression introduces a
conflict upon AD between the alternatives.  PCCTS did full LL(k) and
ANTLR does linear approximate only as I found that linear approximate
lookahead works for the vast majority of parsing decisions and is
extremely fast.  I find one or two problem spots in a large grammar
usually with ANTLR, which forces me to reorganize my grammar in a
slightly unnatural manner.  Unfortunately, your brain does full LL(k)
and ANTLR does a slightly weaker linear approximate lookahead--a
source of many (invalid) bug reports ;)



This compression was the subject of my doctoral
dissertation (PDF 477k) at Purdue.


LL(k)


Formally, LL(k) represents a class of parsers and grammars that parse
symbols from left-to-right (beginning to end of input stream) using a
leftmost derivation and using k symbols of lookahead.  A leftmost
derivation is one in which derivations (parses) proceed by attempting
to replace rule references from left-to-right within a production.
Given the following rule


stat : IF expr THEN stat
     | ...
     ;



an LL parser would match the IF then attempt to parse expr rather than
a rightmost derivation, which would attempt to parse stat first.



LL(k) is synonymous with a "top-down" parser because the
parser begins at the start symbol and works its way down the
derivation/parse tree (tree here means the stack of method activations
for recursive descent or symbol stack for a table-driven parser).  A
recursive-descent parser is particular implementation of an LL parser
that uses functions or method calls to implement the parser rather
than a table.



ANTLR generates predicate-LL(k) parsers that support syntactic and
sematic predicates allowing you to specify many context-free and
context-sensitive grammars (with a bit of work).



LT(n)

In a parser, this is the nth lookahead Token object.


Language
 A possibly infinite set of valid sentences.  The
vocabulary symbols may be characters, tokens, and tree nodes in an
ANTLR context.


Lexer

   A recognizer that breaks up a stream of characters into
vocabulary symbols for a parser.  The parser pulls vocabulary symbols
from the lexer via a queue. 


Lookahead


When parsing a stream of input symbols, a parser has matched (and no
longer needs to consider) a portion of the stream to the left of its
read pointer.  The next k symbols to the right of the read pointer are
considered the fixed lookahead.  This information is used to direct
the parser to the next state.  In an LL(k) parser this means to
predict which path to take from the current state using the next k
symbols of lookahead.


 ANTLR supports syntactic predicates, a manually-specified form of
backtracking that effectively gives you infinite lookahead.  For
example, consider the following rule that distinguishes between sets
(comma-separated lists of words) and parallel assignments (one list
assigned to another):


stat:   ( list "=" )=> list "=" list
    |   list
    ;



If a list followed by an assignment operator is found on the input
stream, the first production is predicted. If not, the second
alternative production is attempted.


nextToken


A lexer method automatically generated by ANTLR that figures out which
of the lexer rules to apply.  For example, if you have two rules ID
and INT in your lexer, ANTLR will generate a lexer with methods for ID
and INT as well as a nextToken method that figures out which rule
method to attempt given k input characters.


NFA


Nondeterministic Finite Automata.  See Finite
state machine.


Nondeterministic


A parser is nondeterministic if there is at least one decision point
where the parser cannot resolve which path to take.  Nondeterminisms
arise because of parsing strategy weaknesses.


    


  • If your strategy works only for unambiguous grammars, then
ambiguous grammars will yield nondeterministic parsers; this is true
of the basic LL, LR strategies.  Even unambiguous grammars can yield
nondeterministic parsers though.  Here is a nondeterministic LL(1)
grammar:


    decl : ID ID SEMICOLON
     | ID SEMICOLON
     ;

    

Rule decl is, however, LL(2) because the second lookahead
symbol (either ID or SEMICOLON) uniquely determines which alternative
to predict.  You could also left-factor the rule to reduce the
lookahead requirements.

    


  • 
If you are willing to pay a
performance hit or simply need to handle ambiguous grammars, you can
use an Earley parser or a Tomita parser (LR-based) that match all
possible interpretations of the input, thus, avoiding the idea of
nondeterminism altogether.  This does present problems when trying to
execute actions, however, because multiple parses are, in effect,
occurring in parallel.






Note that a parser may have multiple decision points that are
nondeterministic.


Parser

A recognizer that applies a grammatical structure to a stream
of vocabulary symbols called tokens.


Predicate, semantic


A semantic predicate is a boolean expression used to alter the parse
based upon semantic information.  This information is usually a
function of the constructs/input that have already been matched, but
can even be a flag that turns on and off subsets of the language (as
you might do for a grammar handling both K&R and ANSI C).  One of the
most common semantic predicates uses a symbol table to help
distinguish between syntactically, but semantically different
productions.  In FORTRAN, array references and function calls look the
same, but may be distinguished by checking what the type of the
identifier is.


expr : {isVar(LT(1))}? ID LPAREN args RPAREN  // array ref
     | {isFunction(LT(1))}? ID LPAREN args RPAREN // func call
     ;




Predicate, syntactic


A selective form of backtracking used to recognize language constructs
that cannot be distinguished without seeing all or most of the
construct.  For example, in C++ some declarations look exactly like
expressions.  You have to check to see if it is a declaration.  If it
parses like a declaration, assume it is a declaration--reparse it with
"feeling" (execute your actions).  If not, it must be an expression or
an error:


stat : (declaration) => declaration
     | expression
     ;




Production


An alternative in a grammar rule.


Protected


A protected lexer rule does not represent a complete token--it is a
helper rule referenced by another lexer rule.  This overloading of the
access-visibility Java term occurs because if the rule is not visible,
it cannot be "seen" by the parser (yes, this nomeclature sucks).


Recursive-descent


See LL(k).


Regular


A regular language is one that can be described by a regular grammar
or regular expression or accepted by a DFA-based lexer such as those
generated by lex.  Regular languages are normally used to
describe tokens.


 In practice you can pick out a regular grammar by noticing that
references to other rules are not allowed accept at the end of a
production.  The following grammar is regular because reference to
B occurs at the right-edge of rule A.


A : ('a')+ B ;
B : 'b' ;



Another way to look at it is, "what can I recognize without a stack
(such as a method return address stack)?".



Regular grammars cannot describe context-free languages, hence, LL or
LR based grammars are used to describe programming languages.  ANTLR
is not restricted to regular languages for tokens because it generates
recursive-descent lexers.  This makes it handy to recognize HTML tags
and so on all in the lexer.


Rule


A rule describes a partial sentence in a language such as a statement
or expression in a programming language.  Rules may have one or more
alternative productions.


Scanner


See Lexer.


Semantics
 See What
do "syntax" and "semantics" mean and how are they different?.


Subrule


Essentially a rule that has been expanded inline.  Subrules are
enclosed in parenthesis and may have suffixes like star, plus, and
question mark that indicate zero-or-more, one-or-more, or optional.
The following rule has 3 subrules:


a : (A|B)+ (C)* (D)?
  ;




Syntax

See What
do "syntax" and "semantics" mean and how are they different?.


Token


A vocabulary symbol for a language.  This term typically refers to the
vocabulary symbols of a parser.  A token may represent a constant
symbol such as a keyword like begin or a "class" of input
symbols like ID or INTEGER_LITERAL.


Token stream


See Token
Streams in the ANTLR documentation.


Tree

See AST and What's the
difference between a parse tree and an abstract syntax tree (AST)? Why
doesn't ANTLR generate trees with nodes for grammar rules like JJTree
does?.
  

Tree parser
   A recognizer that applies a grammatical structure to a
two-dimensional input tree.  Grammatical rules are like an "executable
comment" that describe the tree structure.  These parsers are useful
during translation to (i) annotate trees with, for example, symbol
table information, (2) perform tree rewrites, and (3) generate output.


Vocabulary


The set of symbols used to construct sentences in a language.  These
symbols are usually called tokens or token types.  For lexers, the
vocabulary is a set of characters.


Wow
  See ANTLR.




antlr-2.7.7/doc/optional.gif0000644000175000017500000000374210522211615015667 0ustar  twernertwernerGIF89aｸｼｼｼﾄﾄﾄﾀﾀﾀ,ｸ@Hｰﾁ*\ﾈｰ｡ﾃ#J徂ﾅ,X`｢ﾇ	;:D@ｲ､K鱈ﾉ0繧(G>T$K5mVLﾀ3蹌:?葺Q｣Q曰*]ﾊ%ﾌ｡7カ*ｵ*DｪVgfﾝz+ﾗ檻ｿD#Qｱ8ｯｨﾗ擢ﾟ殺ﾛ5,ﾚ｢0ﾏﾒ('ﾏｲLN黎%ﾆｽ|+.ﾘWq翡69m蜀/'ﾖﾖｲX酪3ｦIｺ4鯰l	｢jｺuiﾎｨ)俺lｮｷﾉ"u
xp`ﾀｼ3ﾚｭ6ﾘﾇU'j栩ﾕg據1 ﾉ圃IﾈﾄﾚyﾑWs^ｵ_犹w|ﾉｧ抑ﾙ磔`僧ﾈ痰}"tｹf竕4y6?･ﾈWmｮ8禮ｲeX轟cuﾝ･c勘"州nd詮"ｩ苒L6ﾉ咳夊臠ﾗm 畷}ﾒ榴cﾑ綏ｧQ9ﾓvﾖ!由#aGd頂ｱ)唐C訂ﾗ|G箒ﾑ_NQﾟ幌)續yHh噐ﾕ恰d(_QFZ初H譁p8｣j.ﾎ瓢H{篁｢､:)ｧ-腿)｣ｲcｩkb*陋:'g｡tRﾊF｢ﾒﾊﾗ'L:鰐｣ﾞ=堪rﾇ.ﾋl･ﾎﾘlｴﾒB,亮R[-ｫﾚbﾛｪｶｧr[ｫUnﾎｪi斟:qｺ%ｳ+睚ﾘｭ膊[\ziH0埆>ｴ.q'ｫｱﾖ^epﾋpm媾s.I(lS}>50lﾞrﾖﾆ樫,ｲ"#nﾉZ⊇ｨｪｶﾋ蟐,ﾌ4ﾗlﾍｾ昼ﾘ
3ｮ｢ｸ9ｴｾ)ｭz脱m叉J&lﾔﾞKｦｼﾞﾁｬuｾﾛR]ﾑﾖ-巍&v\Kﾗﾁcｧ=ﾙｦKﾇﾜ6ﾔ｢*ﾖｳ=ｽI+ﾍｮﾝﾕｹﾙﾚi%ﾈ囎ｶ丑-
o蓼辮G.yｨr+3QﾁNｮ貘ｹｭ豼S癡亟ﾑ喊ｯﾊｪ~-ｯﾛ{ﾂﾈｶ手ﾉｰｧｧﾁ｡>ｼl桴eｵovｵﾝﾋ+髟ｵｻVﾙ9i	ｼ蛟c肪[pO]ﾞｷ5丿>ｯﾟｽ{雖7ﾏ|懺ｻｾｷU橦k､Dﾗ堝ﾅﾏ|ｴi9儘ｯ|JHﾁ%/} ﾋﾄｿ河ﾌv約B｢Qｫﾏ｡H6ﾂ牲P(D
iGﾂ跣T!Xgﾃ)餘|'｡読~襍ﾙeｰ+<栞ﾜw?&ﾞM2D\Yｦlｵ=o贋 S0<燎ｮW -ﾋSb5
Mqｯﾘ｢ｦpjZ張ﾅ錺/k`ｴ82んM'd\!ｿｻ=腎ﾄﾈMﾆ-.&7bﾗｸｸLoC$'ｴIﾉ4a$ｻ2Ip,L"i錚Yﾖ猪0b討ﾘｵ ﾚ2料$/yｩ｡`hﾈLｦ2遼ﾌf:厰DR@;antlr-2.7.7/doc/jguru-logo.gif0000644000175000017500000001002110522211615016120 0ustar  twernertwernerGIF89ags|xzv|~{}zп~}潟′究эヮр濠鴛随寶字沿嶋仲漕錐圏結侭勗丼囹ｧ粕涛汨増試剪喋ﾘﾘ瞻ﾛ聲ﾟ鈬肚粐鱆礪珥鉉鴆跏裹泛ｮ｡ｯ悃ｪ圀ｨ棔ｬ撼ｫ劒ｦ利､沫｣屆ｨﾏﾐﾛﾐﾑﾜﾕﾖ獪ﾕﾟﾓﾔﾞﾒﾓﾝﾘﾙ籏ﾘ瞶ﾗ獨ﾖﾟ､ｦｵ｣･ｴ｢､ｳｩｫｺｨｪｹｦｨｷ･ｧｶ｡｣ｱﾜﾝ袢ﾚ龝v詠u棧ｭ據ｬ｢ｯﾇﾉﾖﾉﾋﾗﾌﾎﾙﾋﾍﾘﾊﾌﾗｮｱﾁｬｯｿｦｩｸｫｮｽｪｭｼｩｬｻｧｪｹﾀﾃﾒﾃﾆﾔﾂﾅﾓﾁﾄﾒﾍﾏﾙｮｲﾂｭｱﾁｲｶﾆｱｵﾅﾅﾈﾕﾄﾇﾔﾆﾉﾕﾇﾊﾖﾒﾔﾝｬｰｿｫｯｾｽﾁﾐｼﾀﾏｿﾃﾑlu遡t生ｻﾌｵｺﾋｴｹﾊｹｾﾎｸｽﾍｷｼﾌｶｻﾋｳｸﾈﾂﾆﾓ圓ｺ丐ｷ擂ｼｳｹﾊｻﾀﾏｺｿﾎｹｾﾍwΒ｣ｭﾆｧｱﾊ鎗ｮcs賄t勞ｲﾋｪｵﾎｨｳﾋ[rrｫ峠椡ﾒ攬ﾐ悽ﾍｨｴﾍLpｰQvｶRwｷTrｩTqｨfｾfｭn姐嶇､ﾗ｣ﾖ｢ﾔ束ﾔ刈ﾉ頭ﾕ朝ﾔ制ﾑ擶ﾑ&kﾗ.lﾏ5tﾘ8wﾛ;{ﾟ6mﾇDAzﾕ=nｿ>oﾀO願J}ﾏDoｸRﾚT緯Y寂X冴Z上SﾊXﾐe甫f紗p壜p吽{渺|ﾛ|渺{樂束ﾒﾀﾀﾀ`YﾟSﾏLｿFｯ@93-p&` P@0
 g	hkkhmlnpio s"u"vjﾟ!m%r,y-{-z,rﾟ88@∵B錣鵑颯Z蝉!ﾈ,gs@	Hｰﾁ*\ﾈｰ｡ﾃ
ｳ
ﾓCｱ｢ﾒﾙﾃﾑFア廬S ｼ?ﾁｼ枠c｡9cﾚｰﾉ篥"BｴXｱ	"K2s
鴣fﾎ?緞凱8槻掣ﾙ側,B!ｵ.ﾔFＥﾉ筥ﾍ9ｶvｵH鏗ﾘｱb!a&
4jiS-ﾆ鋼}ﾜﾌyｳﾖ幌詁Sﾍ霜5hﾒbﾘ"<ﾈ醒F%H悽v掲5ｇ喝設N近f虚*渝jｫ#I*9,dﾘ5ﾂ[Wmｶｩ Y/f58ｯ
ｽｾ}頤罘ｲz遠5苣ｴQA,ﾞ-IF(,p h@[<靤ム (b6`ｰﾃ8ﾐﾀ$ｨ`bﾒ b袰纃8讓緕72ﾎ4,@i苟H&9S3ｪﾔ聿徹ZC
八,｣苺M$4A馘2)｣･領漉Vﾄｭ馥5eﾄ諒	蘂n>禍偖ﾐ)P5^ｪﾒBﾓｰ)滸Hｦ@ﾌ4	e慂蓚$､	93=綟泝z9(蔓:ﾓ7ﾁQF}､ｪjｪx悁ﾇNﾁ$'鷙鱠tFyTIouﾆA>･IXﾍﾁQｫｯzEﾈaｳ､Npｶﾂ+唆EF +ﾈ@ﾏｸ.ｬTFﾛWJ
VﾑWD;8廻晦驗Rﾑek．ﾒo%ｰﾀVｵAﾆG,qﾕｬ｡芯%ﾑ%2ﾙ慕帥zH,ﾞcｿ!LCﾅｸ*ｲﾈ2-剥0ﾏ摶ﾚjﾘC7Gﾀ@ﾐｶ=ｱc最捏ﾔ$ﾐD
tﾊ*ｯF=!hA蝉60N安l÷U霈M0{hｧ暘^ﾗ4ﾚﾀmL-/0ﾅ5ｳｲ2RX靄Bﾘ r`
$0@8ﾅ肖^K$3I9	父ﾉﾟBｷP.ｯB獵医-ｧｷ#遲ﾇ.ﾐ2ﾌﾔnｻ2%ｳi43%c;3iｻ`*ﾍ3ﾁ釵4ﾌ褐2ｿ縅撰ﾃSJ殳J%ｦj逑ﾖGjｨ.ｽ度zｹ'梅dｼ5截Y4ﾍ,jﾐ2ﾏ03ﾉ輜?ﾄκ懼ﾗﾄ｢bG0.aｭ-"ｩ;d7｣t0ｰ（aBﾐ痺t(D!Xﾂ=｣ Cqn-sｨH,l+ZﾘﾂHﾒ3|$0|8ﾕNQ28i眄ﾀ聡丕
nﾈﾂＦ E#rｪ#:!Er#B"襖jｴ腐#E)Xﾄｰ "ﾘ秧ﾘﾐvQ契
香Fvdehｲ*癌濟ﾁ个 /{!	8DBxLvｻPﾃﾄｲSmD3s ﾉ"ﾏ｣ｸRX]<棒ｲ"^bｭ\｡EB?p譜茖2yH4yE:1ﾔﾄﾀ/pｰ朔73)･ﾁr無ｭ"ﾆh"午ｫih$}C9&ﾚteTH:Y%gﾎcｺｰ奎ﾐ 7ﾈ@'b摩T67ﾈ
ﾘｳﾇ99ｹﾄ0j腺}ｧIG-aO:G｡障ﾓ秦ﾈ-0 
ﾐ税r 6/ｬｼ餉}屡ﾔｦﾚ5hﾀﾀ┬	@0ﾐﾝﾐ$¨< OP1*紺ｧ	;j潮涕鼇i帥{ﾂP暄ﾔﾔｦsﾓ@"1祀ﾛ揆(Dd<ｬ岾9ｱ舟ﾂｨ"怦6六0!ﾝ｛｡`ｳ6｡lBp6ﾄﾚﾖｶ6EX欺7Maｲﾛ#D94vYzｹﾐEｴF,ﾈ5f1Zﾑ9FSrcｷ
ｵ!ﾛ(ﾇ,f介Fwn$ｶ[ﾜ&7!pﾏﾋﾞﾉo0b{[w
ND(H3
ｿi8cｾHJ･
MﾎpC$ﾕ'Å梁b≡鐙q桧 溌､/ｵo ﾖﾓAｰﾗ%-Qq:_=ﾂﾇ`H1{	Qq4b蚣ﾀHAﾅｪi|-6"oｩ ﾋ陪5L)g,yS.檻2/DSVｰ程K%i Pﾋ`	9b輝､あｩﾅｸD頚ｨ亠A
%.ﾑ孳2	gﾑﾇ)b{Q-愚ＣﾀF0d!ｬ棉!└ﾏ寫J配鴬ﾈ{ｫWｾRｱ$IJｴ｢ｰN箴ZﾔC値kr｡犠ｰｽe磨aV'渋DBﾞ"ﾈﾙﾈ$%鱈1@ﾉ,hRY徼ﾖ~AAm-菜Zcｶﾕｭok\(ﾗｹﾒum?ｺk.U眇ｨF6ｺ)q乎ｸfﾀ<1|48 =		~#ﾙ匁碓ﾒ+ﾅ(t9ﾁRXｨ*["ｱｮ廖b擲k@ﾈ相神ﾋ臼巴ｰoARBｱbﾞMｺ8､枢:ZﾈT ﾟ0鬣ｹ+EﾅB+@ｺﾞﾚ鯖孛qtDｫ首ﾍﾔeR~｡ｲmxﾃ
ｲ,*?罩､yx&ｪ7ｱ啼AIczdﾈ`懦ﾉ｢｡罠Z｡!cJj｡旺u(ﾍ9ｲyaｺC｡bQ&｡q｢O")瓦ﾗ｣｢ﾈ0悍R
ｦ;ﾌPO｢
ﾔ 
9｢Aｶﾏ%ﾓ0
!ﾆ｣◆*VeU｢&U*･ﾌﾃ､+｡#
･8$C晰>zﾐc>シ
ﾎ =ﾌ燬ﾖ4癪I
忝;antlr-2.7.7/doc/options.html0000644000175000017500000007176510522211615015746 0ustar  twernertwerner


	
	ANTLR Options



Options
 
File, Grammar, and Rule Options



	Rather than have the programmer specify a bunch of command-line arguments to the parser generator, an options section within the grammar itself serves this purpose. This solution is preferrable because it associates the required options with the grammar rather than ANTLR invocation. The section is preceded by the options keyword and contains a series of option/value assignments surrounded by curly braces such as:




options {
   k = 2;
   tokenVocbaulary = IDL;
   defaultErrorHandler = false;
}



	The options section for an entire (.g) file, if specified, immediately follows the (optional) file header:



header { package X; }
options {language="FOO";}



	The options section for a grammar, if specified, must immediately follow the ';' of the class specifier:




	class MyParser extends Parser;
		

		options { k=2; }




	The options section for a rule, if specified, must immediately follow the rule name:



myrule[args] returns [retval]
   options { defaultErrorHandler=false; }
   :   // body of rule...
   ;    



	The option names are not keywords in ANTLR, but rather are entries in a symbol table examined by ANTLR. The scope of option names is limited to the options section; identifiers within your grammar may overlap with these symbols.




	The only ANTLR options not specified in the options section are things that do not vary with the grammar, but rather than invocation of ANTLR itself. The best example is debugging information. Typically, the programmer will want a makefile to change an ANTLR flag indicating a debug or release build.



Options supported in ANTLR



	Key for the type column: F=file, G=grammar, R=rule, L=lexer, S=subrule, C=C++ only. 




	

		

			

				
					Symbol
				
				
					Type
				
				
					Description
				
			

			

				
					language
				
				
					F
				
				
					Set the generated language
				
			

			

				
					k
				
				
					G
				
				
					Set the lookahead depth
				
			

			

				
					importVocab
				
				
					G
				
				
					Initial grammar vocabulary
				
			

			

				
					exportVocab
				
				
					G
				
				
					Vocabulary exported from grammar
				
			

			

				
					testLiterals
				
				
					LG,LR
				
				
					Generate literal-testing code
				
			

			

				
					defaultErrorHandler
				
				
					G,R
				
				
					Control default exception-handling
				
			

			

				
					greedy
				
				
					S
				
				
					False implies you want subrule loop, (..)* and (..)+, to exit when it sees lookahead consistent with what follows the loop.
				
			

			

				
					codeGenMakeSwitchThreshold
				
				
					G
				
				
					Control code generation
				
			

			

				
					codeGenBitsetTestThreshold
				
				
					G
				
				
					Control code generation
				
			

			

				
					buildAST
				
				
					G
				
				
					Set automatic AST construction in Parser (transform mode in Tree-Parser)
				
			

			

				
					analyzerDebug
				
				
					G
				
				
					Spit out lots of debugging information while performing grammar analysis.
				
			

			

				
					codeGenDebug
				
				
					G
				
				
					Spit out lots of debugging information while doing code generation.
				
			

			

				
					ASTLabelType
				
				
					G
				
				
					Specify the type of all user-defined labels, overrides default of AST.
				
			

			

				
					charVocabulary
				
				
					LG
				
				
					Set the lexer character vocabulary
				
			

			

				
					interactive
				
				
					G
				
				
					Both the lexer and the parser have an interactive option, which defaults to "false". See the parser speed section above.
				
			

			

				
					caseSensitive
				
				
					LG
				
				
					Case is ignored when comparing against character and string literals in the lexer. The case of the input stream is maintained when stored in the token objects.
				
			

			

				
					ignore
				
				
					LR
				
				
					Specify a lexer rule to use as whitespace between lexical rule atomic elements (chars, strings, and rule references). The grammar analysis and, hence, the lookhaead sets are aware of the whitespace references. This is a lexer rule option.
				
			

			

				
					paraphrase
				
				
					LR
				
				
					An easy way to specify a string to use in place of the token name during error processing.
				
			

			

				
					caseSensitiveLiterals
				
				
					LG
				
				
					Case is ignored when comparing tokens against the listerals table.
				
			

			

				
					classHeaderPrefix
				
				
					G
				
				
					Replace the usual class prefix ("public" in Java) for the enclosing class definition.
				
			

			

				
					classHeaderSuffix
				
				
					G
				
				
					Append a string to the enclosing class definition. In Java, this amounts to a comma-separated list of interfaces that your lexer, parser, or tree walker must implement.
				
			

			

				
					mangleLiteralPrefix
				
				
					F
				
				
					Sets the prefix for the token type definitions of literals rather than using the default of "TOKEN_".
				
			

			

				
					warnWhenFollowAmbig
				
				
					S
				
				
					Warnings will be printed when the lookahead set of what follows a subrule containing an empty alternative conflicts with a subrule alternative or when the implicit exit branch of a closure loop conflicts with an alternative.  The default is true.
				
			

			

				
					generateAmbigWarnings
				
				
					S
				
				
					When true, no ambiguity/nondeterminism warning is generated for the decision associated with the subrule.  Use this very carefully--you may change the subrule and miss an ambiguity because of the option.  Make very sure that the ambiguity you mask is handled properly by ANTLR.  ANTLR-generated parsers resolve ambiguous decisions by consuming input as soon as possible (or by choosing the alternative listed first).
					

						See the Java and HTML grammars for proper use of this option.  A comment should be supplied for each use indicating why it is ok to shut off the warning.
				

			

			

				
					filter
				
				
					LG
				
				
					When true, the lexer ignores any input not exactly matching one of the nonprotected lexer rules.  When set to a rule name, the filter option using the rule to parse input characters between valid tokens or those tokens of interest.
				
			

			

				
					namespace
				
				
					FGC
				
				
					When set, all the C++ code generated is wrapped in the namespace mentioned here.
				
			

			

				
					namespaceStd
				
				
					FGC
				
				
					When set, the ANTLR_USE_NAMESPACE(std) macros in the generated C++ code are replaced by this value. This is a cosmetic option that only makes the code more readable. It does not replace this macro in the support C++ files. Note: use this option directly after setting the language to C++.
				
			

			

				
					namespaceAntlr
				
				
					FGC
				
				
					When set, the ANTLR_USE_NAMESPACE(antlr) macros in the generated C++ code are replaced by this value. This is a cosmetic option that only makes the code more readable. It does not replace this macro in the support C++ files. Note: use this option directly after setting the language to C++.
				
			

			

				
					genHashLines
				
				
					FGC
				
				
					Boolean toggle, when set to 'true' #line <linenumber> "filename" lines are inserted in the generated code so compiler errors/warnings refer the .g files.
				
			

			

				
					noConstructors
				
				
					FGLC
				
				
					Boolean toggle, when set to 'true' the default constructors
               for the generated lexer/parser/treewalker are omitted. The
               user then has the option to specify them himself (with extra
               initializers etc.)
				
			

		

	




language: Setting the generated language



	ANTLR supports multiple, installable code generators. Any code-generator conforming to the ANTLR specification may be invoked via the language option. The default language is "Java", but "Cpp" and "CSharp" are also supported.   The language option is specified at the file-level, for example:



header { package zparse; }
options { language="Java"; }
... classes follow ...    
 
k: Setting the lookahead depth 



	You may set the lookahead depth for any grammar (parser, lexer, or tree-walker), by using the k= option:



class MyLexer extends Lexer;
options { k=3; }
...



	Setting the lookahead depth changes the maximum number of tokens that will be examined to select alternative productions, and test for exit conditions of the EBNF constructs (...)?, (...)+, and (...)*. The lookahead analysis is linear approximate (as opposed to full LL(k) ). This is a bit involved to explain in detail, but consider this example with k=2:



r :  ( A B | B A )
  |  A A
  ;



	Full LL(k) analysis would resolve the ambiguity and produce a lookahead test for the first alternate like:



if ( (LA(1)==A && LA(2)==B) || (LA(1)==B && LA(2)==A) )



	However, linear approximate analysis would logically OR the lookahead sets at each depth, resulting in a test like:



if ( (LA(1)==A || LA(1)==B) && (LA(2)==A || LA(2)==B) )



	Which is ambiguous with the second alternate for {A,A}. Because of this, setting the lookahead depth very high tends to yield diminishing returns in most cases, because the lookahead sets at large depths will include almost everything.



importVocab: Initial Grammar Vocabulary



	[See the documentation on vocabularies for more information]




	To specify an initial vocabulary (tokens, literals, and token types), use the importVocab grammar option.




	class MyParser extends Parser;
		

		options {
		

		   importVocab=V;
		

		}




	ANTLR will look for VTokenTypes.txt in the current directory and preload the token manager for MyParser with the enclosed information.




	This option is useful, for example, if you create an external lexer and want to connect it to an ANTLR parser. Conversely, you may create an external parser and wish to use the token set with an ANTLR lexer. Finally, you may find it more convenient to place your grammars in separate files, especially if you have multiple tree-walkers that do not add any literals to the token set.




	The vocabulary file has an identifier on the first line that names the token vocabulary that is followed by lines of the form ID=value or "literal"=value. For example:



ANTLR // vocabulary name
"header"=3
ACTION=4
COLON=5
SEMI=6
...



	A file of this form is automatically generated by ANTLR for each grammar.




	Note: you must take care to run ANTLR on the vocabulay-generating grammar files before you run ANTLR on the vocabulary-consuming grammar files.



exportVocab: Naming Export Vocabulary



	[See the documentation on vocabularies for more information]




	The vocabulary of a grammar is the union of the set of tokens provided by an importVocab option and the set of tokens and literals defined in the grammar.  ANTLR exports a vocabulary for each grammar whose default name is the same as the grammar.   So, the following grammar yields a vocabulary called P:



class P extends Parser;
a : A;



	ANTLR generates files PTokenTypes.txt and PTokenTypes.java.




	You can specify the name of the exported vocabulary with the exportVocab option.   The following grammar generates a vocabulary called V not P.



class P extends Parser;
options {
  exportVocab=V;
}
a : A;



	All grammars in the same file witht the same vocabulary name contribute to the same vocabulary (and resulting files).  If the the grammars were in separate files, on the other hand, they would all overwrite the same file.  For example, the following parser and lexer grammars both may contribute literals and tokens to the MyTokens vocabulary.



class MyParser extends Parser;
options {
  exportVocab=MyTokens;
}
...

class MyLexer extends Lexer;
options {
  exportVocab=MyTokens;
}
... 
 
testLiterals: Generate literal-testing code



	By default, ANTLR will generate code in all lexers to test each token against the literals table (the table generated for literal strings), and change the token type if it matches the table. However, you may suppress this code generation in the lexer by using a grammar option:



class L extends Lexer;
options { testLiterals=false; }
...



	If you turn this option off for a lexer, you may re-enable it for specific rules. This is useful, for example, if all literals are keywords, which are special cases of ID:



ID
options { testLiterals=true; }
   : LETTER (LETTER | DIGIT)*
   ;



	If you want to test only a portion of a token's text for a match in the literals table, explicitly test the substring within an action using method:



    public int testLiteralsTable(String text, int ttype) {...}



	For example, you might want to test the literals table for just the tag word in an HTML word.



defaultErrorHandler: Controlling default exception-handling



	By default, ANTLR will generate default exception handling code for a parser or tree-parser rule. The generated code will catch any parser exceptions, synchronize to the follow set of the rule, and return. This is simple and often useful error-handling scheme, but it is not very sophisticated. Eventually, you will want to install your own exepttion handlers. ANTLR will automatically turn off generation of default exception handling for rule where an exception handler is specified. You may also explicitly control generation of default exception handling on a per-grammar or per-rule basis. For example, this will turn off default error-handing for the entire grammar, but turn it back on for rule "r":



class P extends Parser;
options {defaultErrorHandler=false;}

r
options {defaultErrorHandler=true;}
: A B C;



	For more information on exception handling in the lexer, go here.



codeGenMakeSwitchThreshold: controlling code generation



	ANTLR will optimize lookahead tests by generating a switch statement instead of a series of if/else tests for rules containing a sufficiently large number of alternates whose lookahead is strictly LL(1). The option codeGenMakeSwitchThreshold controls this test. You may want to change this to control optimization of the parser. You may also want to disable it entirely for debugging purposes, by setting it to a large number:



class P extends Parser;
options { codeGenMakeSwitchThreshold=999; }
...
 
codeGenBitsetTestThreshold: controlling code generation



	ANTLR will optimize lookahead tests by generating a bitset test instead of an if statement, for very complex lookahead sets. The option codeGenBitsetTestThreshold controls this test. You may want to change this to control optimization of the parser:



class P extends Parser;
// make bitset if test involves five or more terms
options { codeGenBitsetTestThreshold=5; }
...



	You may also want to disable it entirely for debugging purposes, by setting it to a large number:



class P extends Parser;
options { codeGenBitsetTestThreshold=999; }
...      
 
buildAST: Automatic AST construction 



	In a Parser, you can tell ANTLR to generate code to construct ASTs corresponding to the structure of the recognized syntax. The option, if set to true, will cause ANTLR to generate AST-building code. With this option set, you can then use all of the AST-building syntax and support methods.




	In a Tree-Parser, this option turns on "transform mode", which means an output AST will be generated that is a transformation of the input AST. In a tree-walker, the default action of buildAST is to generate a copy of the portion of the input AST that is walked. Tree-transformation is almost identical to building an AST in a Parser, except that the input is an AST, not a stream of tokens.



ASTLabelType: Setting label type



	When you must define your own AST node type, your actions within the grammar will require lots of downcasting from AST (the default type of any user-defined label) to your tree node type; e.g.,



decl : d:ID {MyAST t=(MyAST)#d;}
     ;



	This makes your code a pain to type in and hard to read.  To avoid this, use the grammar option ASTLabelType to have ANTLR automatically do casts and define labels of the appropriate type.



class ExprParser extends Parser;

options {
  buildAST=true;
  ASTLabelType = "MyAST";
}

expr : a:term ;



	The type of #a within an action is MyAST not AST.



charVocabulary: Setting the lexer character vocabulary



	ANTLR processes Unicode. Because of this this, ANTLR cannot make any assumptions about the character set in use, else it would wind up generating huge lexers. Instead ANTLR assumes that the character literals, string literals, and character ranges used in the lexer constitute the entire character set of interest. For example, in this lexer:



class L extends Lexer;
A : 'a';
B : 'b';
DIGIT : '0' .. '9';



	The implied character set is { 'a', 'b', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9' }. This can produce unexpected results if you assume that the normal ASCII character set is always used. For example, in:



class L extends Lexer;
A : 'a';
B : 'b';
DIGIT : '0' .. '9';
STRING: '"' (~'"")* '"';



	The lexer rule STRING will only match strings containing 'a', 'b' and the digits, which is usually not what you want. To control the character set used by the lexer, use the charVocbaulary option. This example will use a general eight-bit character set.



class L extends Lexer;
options { charVocabulary = '\3'..'\377'; }
...



	This example uses the ASCII character set in conjunction with some values from the extended Unicode character set:




class L extends Lexer;
options {
	charVocabulary = '\3'..'\377' | '\u1000'..'\u1fff';
}
...
 
warnWhenFollowAmbig



	[Warning: you should know what you are doing before you use this option.  I deliberately made it a pain to shut warnings off (rather than a single character operator) so you would not just start turning off all the warnings.  I thought for long time before implementing this exact mechanism.  I recommend a comment in front of any use of this option that explains why it is ok to hush the warning.]




	This subrule option is true by default and controls the generation of nondeterminism (ambiguity) warnings when comparing the FOLLOW lookahead sets for any subrule with an empty alternative and any closure subrule such as (..)+ and (...)*.  For example, the following simple rule has a nondeterministic subrule, which arises from a language ambiguity that you could attach an ELSE clause to the most recent IF or to an outer IF because the construct can nest.



stat	:	"if" expr "then" stat ("else" stat)?
	|	ID ASSIGN expr SEMI
	;



	Because the language is ambiguous, the context-free grammar must be ambiguous and the resulting parser nondeterministic (in theory).  However, being the practical language folks that we are, we all know you can trivially solve this problem by having ANTLR resolve conflicts by consuming input as soon as possible; I have yet to see a case where this was the wrong thing to do, by the way.  This option, when set to false, merely informs ANTLR that it has made the correct assumption and can shut off an ambiguity related to this subrule and an empty alternative or exit path.  Here is a version of the rule that does not yield a warning message:




	 



stat	:	"if" expr "then" stat
		(
		    // standard if-then-else ambig
		    options {
		        warnWhenFollowAmbig=false;
		    }
		:	"else" stat
		)?
	|	ID ASSIGN expr SEMI
	;



	One important note: This option does not affect non-empty alternatives.  For example, you will still get a warning for the following subrule between alts 1 and 3 (upon lookahead A):



(
	options {
		warnWhenFollowAmbig=false;
	}
:	A
|	B
|	A
)



	Further, this option is insensitive to lookahead.  Only completely empty alternatives count as candidate alternatives for hushing warnings.  So, at k=2, just because ANTLR can see past alternatives with single tokens, you still can get warnings.



Command Line Options



	

		
			-o outputDir
		
		
			specify output directory where all output generated.
		
	

	

		
			-glib supergrammarFile
		
		
			Specify a file with a supergrammar for the generated file.
		
	

	

		
			-debug
		
		
			launch the ParseView debugger upon parser invocation.  Unless you have downloaded and unzipped the debugger over the top of the standard ANTLR distribution, the code emanating from ANTLR with this option will not compile (likewise for Swing).
		
	

	

		
			-html
		
		
			generate a HTML file from your grammar without actions and so on.   This is only a prototype, but seems to do something useful.   It only works for parsers, not lexers or tree parsers.
		
	

	

		
			-docbook
		
		
			generate a docbook SGML file from your grammar without actions and so on.   This is only a prototype, but seems to do something useful.   It only works for parsers, not lexers or tree parsers.
		
	

	

		
			-diagnostic
		
		
			generate a text file from your grammar with a lot of debugging info.
		
	

	

		
			-trace
		
		
			have all rules call traceIn/traceOut.
		
	

	

		
			-traceParser
		
		
			have parser rules call traceIn/traceOut.
		
	

	

		
			-traceLexer
		
		
			have lexer rules call traceIn/traceOut.
		
	

	

		
			-traceTreeParser
		
		
			have tree walker rules call traceIn/traceOut.
		
	

	

		
			-h|-help|--help
		
		
		        help message.
		
	





	Version: $Id: //depot/code/org.antlr/release/antlr-2.7.7/doc/options.html#2 $



antlr-2.7.7/doc/runtime.html0000644000175000017500000012225010522211615015720 0ustar  twernertwerner

	ANTLR Specification: Run-time 



Java Runtime Model
 



Programmer's Interface
 


	In this section, we describe what ANTLR generates after reading your grammar file and how to use that output to parse input. The classes from which your lexer, token, and parser classes are derived are provided as well. 



What ANTLR generates
 


	ANTLR generates the following types of files, where MyParser, MyLexer, and MyTreeParser are names of grammar classes specified in the grammar file. You may have an arbitrary number of parsers, lexers, and tree-parsers per grammar file; a separate class file will be generated for each. In addition, token type files will be generated containing the token vocabularies used in the parsers and lexers. One or more token vocabularies may be defined in a grammar file, and shared between different grammars. For example, given the grammar file: 



class MyParser extends Parser;
options {
  exportVocab=My;
}
... rules ...

class MyLexer extends Lexer;
options {
  exportVocab=My;
}
... rules ...

class MyTreeParser extends TreeParser;
options {
  exportVocab=My;
}
... rules ...
 


	The following files will be generated: 

    
	
  • 
		MyParser.java. The parser with member methods for the parser rules. 
	
    • 
	
  • 
		MyLexer.java. The lexer with the member methods for the lexical rules. 
	
    • 
	
  • 
		MyTreeParser.java. The tree-parser with the member methods for the tree-parser rules. 
	
    • 
	
  • 
		MyTokenTypes.java. An interface containing all of the token types defined by your parsers and lexers using the exported vocabulary named My.
	
    • 
	
  • 
		MyTokenTypes.txt. A text file containing all of the token types, literals, and paraphrases defined by parsers and lexers contributing vocabulary My.
	
    • 




	The programmer uses the classes by referring to them: 

    
	
  1. 
		Create a lexical analyzer. The constructor with no arguments implies that you want to read from standard input. 
	
    2. 
	
  2. 
		Create a parser and attach it to the lexer (or other TokenStream). 
	
    3. 
	
  3. 
		Call one of the methods in the parser to begin parsing.
	
    4. 




	If your parser generates an AST, then get the AST value, create a tree-parser, and invoke one of the tree-parser rules using the AST. 



MyLexer lex = new MyLexer();
MyParser p =
  new MyParser(lex,user-defined-args-if-any);
p.start-rule();
// and, if you are tree parsing the result...
MyTreeParser tp = new MyTreeParser();
tp.start-rule(p.getAST());
 


	You can also specify the name of the token and/or AST objects that you want the lexer/parser to create. Java's support of dynamic programming makes this quite painless: 



MyLexer lex = new MyLexer();
lex.setTokenObjectClass("mypackage.MyToken");
  // defaults to "antlr.CommonToken"
...
parser.setASTNodeClass("mypackage.MyASTNode");
  // defaults to "antlr.CommonAST"
 


Make sure you give a fully-qualified class name.


The lexer and parser can cause IOExceptions as well as RecognitionExceptions, which you must catch:



  CalcLexer lexer =
    new CalcLexer(new DataInputStream(System.in));
  CalcParser parser = new CalcParser(lexer);
  // Parse the input expression
  try {
    parser.expr();
  }
  catch (IOException io) {
    System.err.println("IOException");
  }
  catch(RecognitionException e) {
    System.err.println("exception: "+e);
  }
 
Multiple Lexers/Parsers With Shared Input State
 


	Occasionally, you will want two parsers or two lexers to share input state; that is, you will want them to pull input from the same source token stream or character stream.   The section on multiple lexer "states" describes such a situation.




	ANTLR factors the input variables such as line number, guessing state, input stream, etc... into a separate object so that another lexer or parser could same that state.  The LexerSharedInputState and ParserSharedInputState embody this factoring.   Method getInputState() can be used on either CharScanner or Parser objects.  Here is how to construct two lexers sharing the same input stream:



// create Java lexer
JavaLexer mainLexer = new JavaLexer(input);
// create javadoc lexer; attach to shared
// input state of java lexer
JavaDocLexer doclexer =
  new JavaDocLexer(mainLexer.getInputState());
 


	Parsers with shared input state can be created similarly:



JavaDocParser jdocparser =
  new JavaDocParser(getInputState());
jdocparser.content(); // go parse the comment
 


	Sharing state is easy, but what happens upon exception during the execution of the "subparser"?  What about syntactic predicate execution?  It turns out that invoking a subparser with the same input state is exactly the same as calling another rule in the same parser as far as error handling and syntactic predicate guessing are concerned.  If the parser is guessing before the call to the subparser, the subparser must continue guessing, right?  Exceptions thrown inside the subparser must exit the subparser and return to enclosing erro handler or syntactic predicate handler.



Parser Implementation
 
Parser Class
 


	ANTLR generates a parser class (an extension of LLkParser) that contains a method for every rule in your grammar. The general format looks like: 



public class MyParser extends LLkParser
    implements MyLexerTokenTypes
{
  protected P(TokenBuffer tokenBuf, int k) {
    super(tokenBuf,k);
    tokenNames = _tokenNames;
  }
  public P(TokenBuffer tokenBuf) {  
    this(tokenBuf,1);
  }
  protected P(TokenStream lexer, int k) {
    super(lexer,k);
    tokenNames = _tokenNames;       
  }
  public P(TokenStream lexer) {  
    this(lexer,1);
  }
  public P(ParserSharedInputState state) {
    super(state,1);
    tokenNames = _tokenNames;
  }
  ...
  // add your own constructors here...
  rule-definitions
}
  
 
Parser Methods
 


	ANTLR generates recursive-descent parsers, therefore, every rule in the grammar will result in a method that applies the specified grammatical structure to the input token stream. The general form of a parser method looks like: 



public void rule()
  throws RecognitionException,
         TokenStreamException
{
  init-action-if-present
  if ( lookahead-predicts-production-1 ) {
     code-to-match-production-1
  }
  else if ( lookahead-predicts-production-2 ) {
     code-to-match-production-2
  }
  ...
  else if ( lookahead-predicts-production-n ) {
     code-to-match-production-n
  }
  else {
    // syntax error
    throw new NoViableAltException(LT(1));
  }
}
  This code results from a rule of the form:  
 
rule:   production-1
    |   production-2
   ...
    |   production-n
    ;
  
 


	If you have specified arguments and a return type for the rule, the method header changes to: 



/* generated from:
 *    rule(user-defined-args)
 *      returns return-type : ... ;
 */
public return-type rule(user-defined-args)
  throws RecognitionException,
         TokenStreamException
{
  ...
}
  
 


	Token types are integers and we make heavy use of bit sets and range comparisons to avoid excessively-long test expressions. 



EBNF Subrules
 


	Subrules are like unlabeled rules, consequently, the code generated for an EBNF subrule mirrors that generated for a rule. The only difference is induced by the EBNF subrule operators that imply optionality or looping. 




	(...)? optional subrule. The only difference between the code generated for an optional subrule and a rule is that there is no default else-clause to throw an exception--the recognition continues on having ignored the optional subrule. 



{
  init-action-if-present
  if ( lookahead-predicts-production-1 ) {
     code-to-match-production-1
  }
  else if ( lookahead-predicts-production-2 ) {
     code-to-match-production-2
  }
  ...
  else if ( lookahead-predicts-production-n ) {
     code-to-match-production-n
  }
}
  
 


	Not testing the optional paths of optional blocks has the potential to delay the detection of syntax errors. 




	(...)* closure subrule. A closure subrule is like an optional looping subrule, therefore, we wrap the code for a simple subrule in a "forever" loop that exits whenever the lookahead is not consistent with any of the alternative productions. 



{
  init-action-if-present
loop:
  do {
    if ( lookahead-predicts-production-1 ) {
       code-to-match-production-1
    }
    else if ( lookahead-predicts-production-2 ) {
       code-to-match-production-2
    }
    ...
    else if ( lookahead-predicts-production-n ) {
       code-to-match-production-n
    }
    else {
      break loop;
    }
  }
  while (true);
}
  
 


	While there is no need to explicity test the lookahead for consistency with the exit path, the grammar analysis phase computes the lookahead of what follows the block. The lookahead of what follows much be disjoint from the lookahead of each alternative otherwise the loop will not know when to terminate. For example, consider the following subrule that is nondeterministic upon token A. 



( A | B )* A
  
 


	Upon A, should the loop continue or exit? One must also ask if the loop should even begin. Because you cannot answer these questions with only one symbol of lookahead, the decision is non-LL(1). 




	Not testing the exit paths of closure loops has the potential to delay the detection of syntax errors. 




	As a special case, a closure subrule with one alternative production results in: 



{
  init-action-if-present
loop:
  while ( lookahead-predicts-production-1 ) {
       code-to-match-production-1
  }
}
   
 


	This special case results in smaller, faster, and more readable code. 




	(...)+ positive closure subrule. A positive closure subrule is a loop around a series of production prediction tests like a closure subrule. However, we must guarantee that at least one iteration of the loop is done before proceeding to the construct beyond the subrule. 



{
  int _cnt = 0;
  init-action-if-present
loop:
  do {
    if ( lookahead-predicts-production-1 ) {
       code-to-match-production-1
    }
    else if ( lookahead-predicts-production-2 ) {
       code-to-match-production-2
    }
    ...
    else if ( lookahead-predicts-production-n ) {
       code-to-match-production-n
    }
    else if ( _cnt>1 ) {
      // lookahead predicted nothing and we've
      // done an iteration
      break loop;
    }
    else {
      throw new NoViableAltException(LT(1));
    }
    _cnt++;  // track times through the loop
  }
  while (true);
}
  
 


	While there is no need to explicity test the lookahead for consistency with the exit path, the grammar analysis phase computes the lookahead of what follows the block. The lookahead of what follows much be disjoint from the lookahead of each alternative otherwise the loop will not know when to terminate. For example, consider the following subrule that is nondeterministic upon token A. 



( A | B )+ A
  
 


	Upon A, should the loop continue or exit? Because you cannot answer this with only one symbol of lookahead, the decision is non-LL(1). 




	Not testing the exit paths of closure loops has the potential to delay the detection of syntax errors. 




	You might ask why we do not have a while loop that tests to see if the lookahead is consistent with any of the alternatives (rather than having series of tests inside the loop with a break). It turns out that we can generate smaller code for a series of tests than one big one. Moreover, the individual tests must be done anyway to distinguish between alternatives so a while condition would be redundant. 




	As a special case, if there is only one alternative, the following is generated: 



{
  init-action-if-present
  do {
    code-to-match-production-1
  }
  while ( lookahead-predicts-production-1 );
}
  
 


	Optimization. When there are a large (where large is user-definable) number of strictly LL(1) prediction alternatives, then a switch-statement can be used rather than a sequence of if-statements. The non-LL(1) cases are handled by generating the usual if-statements in the default case. For example: 



switch ( LA(1) ) {
  case KEY_WHILE :
  case KEY_IF :
  case KEY_DO :
    statement();
    break;
  case KEY_INT :
  case KEY_FLOAT :
    declaration();
    break;
  default :
    // do whatever else-clause is appropriate
}
  
 


	This optimization relies on the compiler building a more direct jump (via jump table or hash table) to the ith production matching code. This is also more readable and faster than a series of bit set membership tests. 



Production Prediction 
 


	LL(1) prediction. Any LL(1) prediction test is a simple set membership test. If the set is a singleton set (a set with only one element), then an integer token type == comparison is done. If the set degree is greater than one, a bit set is created and the single input token type is tested for membership against that set. For example, consider the following rule: 



a : A | b ;
b : B | C | D | E | F;
  
 


	The lookahead that predicts production one is {A} and the lookahead that predicts production two is {B,C,D,E,F}. The following code would be generated by ANTLR for rule a (slightly cleaned up for clarity): 



public void a() {
  if ( LA(1)==A ) {
    match(A);
  }
  else if (token_set1.member(LA(1))) {
    b();
  }
}
  
 


	The prediction for the first production can be done with a simple integer comparison, but the second alternative uses a bit set membership test for speed, which you probably didn't recognize as testing LA(1) member {B,C,D,E,F}. The complexity threshold above which bitset-tests are generated is user-definable. 




	We use arrays of long ints (64 bits) to hold bit sets. The ith element of a bitset is stored in the word number i/64 and the bit position within that word is i % 64. The divide and modulo operations are extremely expensive and, but fortunately, a strength reduction can be done. Dividing by a power of two is the same as shifting right and modulo a power of two is the same as masking with that power minus one. All of these details are hidden inside the implementation of the BitSet class in the package antlr.collections.impl. 




	The various bit sets needed by ANTLR are created and initialized in the generated parser (or lexer) class. 




	Approximate LL(k) prediction. An extension of LL(1)...basically we do a series of up to k bit set tests rather than a single as we do in LL(1) prediction. Each decision will use a different amount of lookahead, with LL(1) being the dominant decision type. 



Production Element Recognition 
 


	Token references. Token references are translated to: 



match(token-type);
  
 


	For example, a reference to token KEY_BEGIN results in: 



match(KEY_BEGIN);
  
 


	where KEY_BEGIN will be an integer constant defined in the MyParserTokenType interface generated by ANTLR. 




	String literal references. String literal references are references to automatically generated tokens to which ANTLR automatically assigns a token type (one for each unique string). String references are translated to: 



match(T);
  
 


	where T is the token type assigned by ANTLR to that token. 




	Character literal references. Referencing a character literal implies that the current rule is a lexical rule. Single characters, 't', are translated to: 



match('t');
  
 


	which can be manually inlined with: 



if ( c=='t' ) consume();
else throw new MismatchedCharException(
               "mismatched char: '"+(char)c+"'");
   
 


	if the method call proves slow (at the cost of space). 




	Wildcard references. In lexical rules, the wildcard is translated to: 



consume();
  
 


	which simply gets the next character of input without doing a test. 




	References to the wildcard in a parser rule results in the same thing except that the consume call will be with respect to the parser. 




	Not operator. When operating on a token, ~T is translated to: 



matchNot(T);
 
 


	When operating on a character literal, 't' is translated to: 



matchNot('t');
  
 


	Range operator. In parser rules, the range operator (T1..T2) is translated to: 



matchRange(T1,T2);
   
 


	In a lexical rule, the range operator for characters c1..c2 is translated to: 



matchRange(c1,c2);
  
 


	Labels. Element labels on atom references become Token references in parser rules and ints in lexical rules. For example, the parser rule: 



a : id:ID {System.out.println("id is "+id);} ;
  would be translated to:  
 
public void a() {
  Token id = null;
  id = LT(1);
  match(ID);
  System.out.println("id is "+id);
}
  For lexical rules such as:  
 
ID : w:. {System.out.println("w is "+(char)w);};
  the following code would result:  
 
public void ID() {
  int w = 0;
  w = c;
  consume(); // match wildcard (anything)
  System.out.println("w is "+(char)w);
}
  
 


	Labels on rule references result in AST references, when generating trees, of the form label_ast. 




	Rule references. Rule references become method calls. Arguments to rules become arguments to the invoked methods. Return values are assigned like Java assignments. Consider rule reference i=list[1] to rule: 



list[int scope] returns int
    :   { return scope+3; }
    ;
  The rule reference would be translated to:  
 
i = list(1);
  
 


	Semantic actions. Actions are translated verbatim to the output parser or lexer except for the translations required for AST generation and the following:


    

  • $FOLLOW(r): FOLLOW set name for rule r

  • $FIRST(r): FIRST set name for rule r





Omitting the rule argument implies you mean the current rule.  The result type is a BitSet, which you can test via $FIRST(a).member(LBRACK) etc...



Here is a sample rule:


a : A {System.out.println($FIRST(a));} B
  exception
    catch [RecognitionException e] {    
        if ( $FOLLOW.member(SEMICOLON) ) {
        consumeUntil(SEMICOLON);
    }
    else {
        consume();
    }
    }
  ;



Results in


public final void a() throws RecognitionException, TokenStreamException {  
    try {
        match(A);
        System.out.println(_tokenSet_0);
        match(B);
    }
    catch (RecognitionException e) {
        if ( _tokenSet_1.member(SEMICOLON) ) {
            consumeUntil(SEMICOLON);
        }
        else {
            consume();
        }
    }
}





	To add members to a lexer or parser class definition, add the class member definitions enclosed in {} immediately following the class specification, for example: 



class MyParser;
{
   protected int i;
   public MyParser(TokenStream lexer,
        int aUsefulArgument) {
      i = aUsefulArgument;
   }
}
... rules ...

 


	ANTLR collects everything inside the {...} and inserts it in the class definition before the rule-method definitions. When generating C++, this may have to be extended to allow actions after the rules due to the wacky ordering restrictions of C++. 




Standard Classes
 


	ANTLR constructs parser classes that are subclasses of the antlr.LLkParser class, which is a subclass of the antlr.Parser class. We summarize the more important members of these classes here. See Parser.java and LLkParser.java for details of the implementation. 



public abstract class Parser {
   protected ParserSharedInputState inputState;
   protected ASTFactory ASTFactory;
   public abstract int LA(int i);
   public abstract Token LT(int i);
   public abstract void consume();
   public void consumeUntil(BitSet set) { ... }
   public void consumeUntil(int tokenType) { ... }
   public void match(int t)
      throws MismatchedTokenException { ... }
   public void matchNot(int t)
      throws MismatchedTokenException { ... }
   ...
}

public class LLkParser extends Parser {
   public LLkParser(TokenBuffer tokenBuf, int k_)
     { ... }
   public LLkParser(TokenStream lexer, int k_)
     { ... }
   public int LA(int i) { return input.LA(i); }
   public Token LT(int i) { return input.LT(i); }
   public void consume() { input.consume(); }
   ...
}

 
Lexer Implementation
 
Lexer Form
 


	The lexers produced by ANTLR are a lot like the parsers produced by ANTLR. They only major differences are that (a) scanners use characters instead of tokens, and (b) ANTLR generates a special nextToken rule for each scanner which is a production containing each public lexer rule as an alternate. The name of the lexical grammar class provided by the programmer results in a subclass of CharScanner, for example 



public class MyLexer extends antlr.CharScanner
  implements LTokenTypes, TokenStream
{
  public L(InputStream in) {
          this(new ByteBuffer(in));
  }
  public L(Reader in) {
          this(new CharBuffer(in));
  }
  public L(InputBuffer ib) {
          this(new LexerSharedInputState(ib));
  }
  public L(LexerSharedInputState state) {
          super(state);
          caseSensitiveLiterals = true;
          setCaseSensitive(true);
          literals = new Hashtable();
  }

  public Token nextToken() throws TokenStreamException {
     scanning logic
    ...
  }
  recursive and other non-inlined lexical methods
  ...
}
  
 


	When an ANTLR-generated parser needs another token from its lexer, it calls a method called nextToken. The general form of the nextToken method is: 



public Token nextToken()
  throws TokenStreamException {
  int tt;
  for (;;) {
     try {
        resetText();
        switch ( c ) {
        case for each char predicting lexical rule
           call lexical rule gets token type -> tt
        default :
           throw new NoViableAltForCharException(
               "bad char: '"+(char)c+"'");
        }
        if ( tt!=Token.SKIP ) {
           return makeToken(tt);
        }
     }
     catch (RecognitionException ex) {
        reportError(ex.toString());
     }
  }
}
  
 


	For example, the lexical rules: 



lexclass Lex;

WS   : ('\t' | '\r' | ' ') {_ttype=Token.SKIP;} ;
PLUS : '+';
MINUS: '-';
INT  : ( '0'..'9' )+ ;
ID   : ( 'a'..'z' )+ ;
UID  : ( 'A'..'Z' )+ ;
  would result in something like:  
 
public class Lex extends CharScanner
  implements TTokenTypes {
...
public Token nextToken()
    throws TokenStreamException {
    int _tt = Token.EOF_TYPE;
    for (;;) {
    try {
       resetText();
       switch ( _c ) {
       case '\t': case '\r': case ' ': 
           _tt=mWS();
           break;
       case '+': 
           _tt=mPLUS();
           break;
       case '-': 
           _tt=mMINUS();
           break;
       case '0': case '1': case '2': case '3': 
       case '4': case '5': case '6': case '7': 
       case '8': case '9': 
           _tt=mINT();
           break;
       case 'a': case 'b': case 'c': case 'd': 
       case 'e': case 'f': case 'g': case 'h': 
       case 'i': case 'j': case 'k': case 'l': 
       case 'm': case 'n': case 'o': case 'p': 
       case 'q': case 'r': case 's': case 't': 
       case 'u': case 'v': case 'w': case 'x': 
       case 'y': case 'z': 
           _tt=mID();
           break;
       case 'A': case 'B': case 'C': case 'D': 
       case 'E': case 'F': case 'G': case 'H': 
       case 'I': case 'J': case 'K': case 'L': 
       case 'M': case 'N': case 'O': case 'P': 
       case 'Q': case 'R': case 'S': case 'T': 
       case 'U': case 'V': case 'W': case 'X': 
       case 'Y': case 'Z': 
           _tt=mUID();
           break;
       case EOF_CHAR :
           _tt = Token.EOF_TYPE;
           break;
       default :
          throw new NoViableAltForCharException(
               "invalid char "+_c);
       }
       if ( _tt!=Token.SKIP ) {
           return makeToken(_tt);
       }
    }  // try
	catch (RecognitionException ex) {
	  reportError(ex.toString());
	}
	}  // for
}

public int mWS()
    throws RecognitionException,
           CharStreamException,
           TokenStreamException {
    int _ttype = WS;
    switch ( _c) {
    case '\t': 
        match('\t');
        break;
    case '\r': 
        match('\r');
        break;
    case ' ': 
        match(' ');
        break;
    default :
    {
        throw new NoViableAltForException(
               "no viable for char: "+(char)_c);
    }
    }
     _ttype = Token.SKIP;
    return _ttype;
}

public int mPLUS()
    throws RecognitionException,
           CharStreamException,
           TokenStreamException {
    int _ttype = PLUS;
    match('+');
    return _ttype;
}

public int mMINUS()
    throws RecognitionException,
           CharStreamException,
           TokenStreamException {

    int _ttype = MINUS;
    match('-');
    return _ttype;
}

public int mINT()
    throws RecognitionException,
           CharStreamException,
           TokenStreamException {

    int _ttype = INT;
    {
    int _cnt=0;
    _loop:
    do {
        if ( _c>='0' && _c<='9')
          { matchRange('0','9'); }
        else
        if ( _cnt>=1 ) break _loop;
        else {
           throw new ScannerException(
              "no viable alternative for char: "+
                (char)_c);
        }
        _cnt++;
    } while (true);
    }
    return _ttype;
}

public int mID()
    throws RecognitionException,
           CharStreamException,
           TokenStreamException {
    int _ttype = ID;
    {
    int _cnt=0;
    _loop:
    do {
        if ( _c>='a' && _c<='z')
        { matchRange('a','z'); }
        else
        if ( _cnt>=1 ) break _loop;
        else {
            throw new NoViableAltForCharException(
               "no viable alternative for char: "+
                 (char)_c);
        }
        _cnt++;
        } while (true);
    }
    return _ttype;
}

public int mUID()
    throws RecognitionException,
           CharStreamException,
           TokenStreamException {

    int _ttype = UID;
    {
    int _cnt=0;
    _loop:
    do {
        if ( _c>='A' && _c<='Z')
        { matchRange('A','Z'); }
        else
        if ( _cnt>=1 ) break _loop;
        else {
            throw new NoViableAltForCharException(
               "no viable alternative for char: "+
                 (char)_c);
        }
        _cnt++;
    } while (true);
    }
    return _ttype;
}

}
  
 


	ANTLR-generated lexers assume that you will be reading streams of characters. If this is not the case, you must create your own lexer. 



Creating Your Own Lexer
 


	To create your own lexer, your Java class that will doing the lexing must implement interface TokenStream, which simply states that you must be able to return a stream of tokens via nextToken: 



/**This interface allows any object to
 * pretend it is a stream of tokens.
 * @author Terence Parr, MageLang Institute
 */
public interface TokenStream {
  public Token nextToken();
}
  
 


	ANTLR will not generate a lexer if you do not specify a lexical class. 




	Launching a parser with a non-ANTLR-generated lexer is the same as launching a parser with an ANTLR-generated lexer: 



HandBuiltLexer lex = new HandBuiltLexer(...);
MyParser p = new MyParser(lex);
p.start-rule();
 


	The parser does not care what kind of object you use for scanning as as long as it can answer nextToken. 




	If you build your own lexer, and the token values are also generated by that lexer, then you should inform the ANTLR-generated parsers about the token type values generated by that lexer. Use the importVocab in the parsers that use the externally-generated token set, and create a token definition file following the requirements of the importVocab option. 



Lexical Rules 
 


	Lexical rules are essentially the same as parser rules except that lexical rules apply a structure to a series of characters rather than a series of tokens. As with parser rules, each lexical rule results in a method in the output lexer class. 




	Alternative blocks. Consider a simple series of alternatives within a block: 



FORMAT : 'x' | 'f' | 'd';
  
 


	The lexer would contain the following method: 



public int mFORMAT() {
  if ( c=='x' ) {
    match('x');
  }
  else if ( c=='x' ) {
    match('x');
  }
  else if ( c=='f' ) {
    match('f');
  }
  else if ( c=='d' ) {
    match('d');
  }
  else {
    throw new NoViableAltForCharException(
        "no viable alternative: '"+(char)c+"'");
  }
  return FORMAT;
}
  
 


	The only real differences between lexical methods and grammar methods are that lookahead prediction expressions do character comparisons rather than LA(i) comparisons, match matches characters instead of tokens, a return is added to the bottom of the rule, and lexical methods throw CharStreamException objects in addition to TokenStreamException and RecognitionException objects. 




	Optimization: Non-Recursive lexical rules. Rules that do not directly or indirectly call themselves can be inlined into the lexer entry method: nextToken. For example, the common identifier rule would be placed directly into the nextToken method. That is, rule: 



ID  :   ( 'a'..'z' | 'A'..'Z' )+
    ;
 
 


	would not result in a method in your lexer class. This rule would become part of the resulting lexer as it would be probably inlined by ANTLR: 



public Token nextToken() {
  switch ( c ) {
  cases for operators and such here
  case '0': // chars that predict ID token
  case '1':
  case '2':
  case '3':
  case '4':
  case '5':
  case '6':
  case '7':
  case '8':
  case '9':
    while ( c>='0' && c<='9' ) {
      matchRange('0','9');
    }
    return makeToken(ID);
  default :
    check harder stuff here like rules
      beginning with a..z
}
  
 


	If not inlined, the method for scanning identifiers would look like: 



public int mID() {
  while ( c>='0' && c<='9' ) {
    matchRange('0','9');
  }
  return ID;
}
  
 


	where token names are converted to method names by prefixing them with the letter m. The nextToken method would become: 



public Token nextToken() {
  switch ( c ) {
  cases for operators and such here
  case '0': // chars that predict ID token
  case '1':
  case '2':
  case '3':
  case '4':
  case '5':
  case '6':
  case '7':
  case '8':
  case '9':
    return makeToken(mID());
  default :
    check harder stuff here like rules
      beginning with a..z
}
  
 


	Note that this type of range loop is so common that it should probably be optimized to: 



while ( c>='0' && c<='9' ) {
  consume();
}
  
 


	Optimization: Recursive lexical rules. Lexical rules that are directly or indirectly recursive are not inlined. For example, consider the following rule that matches nested actions: 



ACTION
    :   '{' ( ACTION | ~'}' )* '}'
    ;
  
 


	ACTION would be result in (assuming a character vocabulary of 'a'..'z', '{', '}'): 



public int mACTION()
    throws RecognitionException,
           CharStreamException,
           TokenStreamException {

    int _ttype = ACTION;
    match('{');
    {
    _loop:
    do {
        switch ( _c) {
        case '{':
            mACTION();
            break;
        case 'a': case 'b': case 'c': case 'd':
        case 'e': case 'f': case 'g': case 'h':
        case 'i': case 'j': case 'k': case 'l':
        case 'm': case 'n': case 'o': case 'p':
        case 'q': case 'r': case 's': case 't':
        case 'u': case 'v': case 'w': case 'x':
        case 'y': case 'z':
            matchNot('}');
            break;
        default :
            break _loop;
        }
    } while (true);
    }
    match('}');
    return _ttype;
}
       
 
Token Objects
 


	The basic token knows only about a token type:



public class Token {
  // constants
  public static final int MIN_USER_TYPE = 3;
  public static final int INVALID_TYPE = 0;
  public static final int EOF_TYPE = 1;
  public static final int SKIP = -1;
  
  // each Token has at least a token type
  int type=INVALID_TYPE;
  
  // the illegal token object
  public static Token badToken =
    new Token(INVALID_TYPE, "");
  
  public Token() {;}
  public Token(int t) { type = t; }
  public Token(int t, String txt) {
    type = t; setText(txt);
  }

  public void setType(int t) { type = t; }
  public void setLine(int l) {;}
  public void setColumn(int c) {;}
  public void setText(String t) {;}
  
  public int getType() { return type; }
  public int getLine() { return 0; }
  public int getColumn() { return 0; }
  public String getText() {...}
}

 
	

		The raw Token class is not very useful.  ANTLR supplies a "common" token class that it uses by default, which contains the line number and text associated with the token:
	

	
	

		public class CommonToken extends Token {
			

			  // most tokens will want line, text information
			

			  int line;
			

			  String text = null;
			

			  
			

			  public CommonToken() {}
			

			  public CommonToken(String s)  { text = s; }
			

			  public CommonToken(int t, String txt) {
			

			    type = t;
			

			    setText(txt);
			

			  }
			

			

			  public void setLine(int l)    { line = l; }
			

			  public int  getLine()         { return line; }
			

			  public void setText(String s) { text = s; }
			

			  public String getText()       { return text; }
			

			}
	

	

		ANTLR will generate an interface that defines the types of tokens in a token vocabulary. Parser and lexers that share this token vocabulary are generated such that they implement the resulting token types interface: 
	


public interface MyLexerTokenTypes {
  public static final int ID = 2;
  public static final int BEGIN = 3;
  ...
}
 
	

		ANTLR defines a token object for use with the TokenStreamHiddenTokenFilter object called CommonHiddenStreamToken:
	


public class CommonHiddenStreamToken
  extends CommonToken {
  protected CommonHiddenStreamToken hiddenBefore;
  protected CommonHiddenStreamToken hiddenAfter;

  public CommonHiddenStreamToken
    getHiddenAfter() {...}
  public CommonHiddenStreamToken
    getHiddenBefore() {...}
}
 
	

		Hidden tokens are weaved amongst the normal tokens.  Note that, for garbage collection reasons, hidden tokens never point back to normal tokens (preventing a linked list of the entire token stream).
	

	
Token Lookahead Buffer
 
	

		The parser must always have fast access to k symbols of lookahead. In a world without syntactic predicates, a simple buffer of k Token references would suffice. However, given that even LL(1) ANTLR parsers must be able to backtrack, an arbitrarily-large buffer of Token references must be maintained. LT(i) looks into the token buffer. 
	

	

		Fortunately, the parser itself does not implement the token-buffering and lookahead algorithm. That is handled by the TokenBuffer object. We begin the discussion of lookahead by providing an LL(k) parser framework: 
	


public class LLkParser extends Parser {
   TokenBuffer input;
   public int LA(int i) {
      return input.LA(i);
   }
   public Token LT(int i) {
      return input.LT(i);
   }
   public void consume() {
      input.consume();
   }
}
       
 
	

		All lookahead-related calls are simply forwarded to the TokenBuffer object. In the future, some simple caching may be performed in the parser itself to avoid the extra indirection, or ANTLR may generate the call to input.LT(i) directly. 
	

	

		The TokenBuffer object caches the token stream emitted by the scanner. It supplies LT() and LA() methods for accessing the kth lookahead token or token type, as well as methods for consuming tokens, guessing, and backtracking. 
	


public class TokenBuffer {
   ...
   /** Mark another token for
    *  deferred consumption */
   public final void consume() {...}

   /** Get a lookahead token */
   public final Token LT(int i) { ... }

   /** Get a lookahead token value */
   public final int LA(int i) { ... }

   /**Return an integer marker that can be used to
    * rewind the buffer to its current state. */
   public final int mark() { ... }

   /**Rewind the token buffer to a marker.*/
   public final void rewind(int mark) { ... }
}

 
	

		To begin backtracking, a mark is issued, which makes the TokenBuffer record the current position so that it can rewind the token stream. A subsequent rewind directive will reset the internal state to the point before the last mark. 
	

	

		Consider the following rule that employs backtracking: 
	

	
stat:   (list EQUAL) => list EQUAL list
    |   list
    ;
list:   LPAREN (ID)* RPAREN
    ;
 
 


	Something like the following code would be generated: 



public void stat()
  throws RecognitionException,
         TokenStreamException
{
  boolean synPredFailed;
  if ( LA(1)==LPAREN ) { // check lookahead
    int marker = tokenBuffer.mark();
    try {
      list();
      match(EQUAL);
      synPredFailed = false;
    }
    catch (RecognitionException e) {
      tokenBuffer.rewind(marker);
      synPredFailed = true;
    }
  }
  if ( LA(1)==LPAREN && !synPredFailed ) {
    // test prediction of alt 1
    list();
    match(EQUAL);
    list();
  }
  else if ( LA(1)==LPAREN ) {
    list();
  }
}
      
 


	The token lookahead buffer uses a circular token buffer to perform quick indexed access to the lookahead tokens. The circular buffer is expanded as necessary to calculate LT(i) for arbitrary i. TokenBuffer.consume() does not actually read more tokens. Instead, it defers the read by counting how many tokens have been consumed, and then adjusts the token buffer and/or reads new tokens when LA() or LT() is called. 




	Version: $Id: //depot/code/org.antlr/release/antlr-2.7.7/doc/runtime.html#2 $ 


antlr-2.7.7/doc/trees.html0000644000175000017500000012007510522211615015362 0ustar  twernertwerner


	
	ANTLR Tree Construction



ANTLR Tree Construction



	ANTLR helps you build intermediate form trees, or abstract syntax trees
	(ASTs), by providing grammar annotations that indicate what tokens are to
	be treated as subtree roots, which are to be leaves, and which are to be
	ignored with respect to tree construction.  As with PCCTS 1.33, you
	may manipulate trees using tree grammar actions.     





	It is often the case that programmers either have existing
	tree definitions or need a special physical structure, thus,
	preventing ANTLR from specifically defining the implementation
	of AST nodes. ANTLR specifies only an interface describing
	minimum behavior. Your tree implementation must implement this
	interface so ANTLR knows how to work with your trees. Further,
	you must tell the parser the name of your tree nodes or
	provide a tree "factory" so that ANTLR knows how to
	create nodes with the correct type (rather than hardcoding in
	a new AST() expression everywhere).   ANTLR can
	construct and walk any tree that satisfies the AST
	interface.  A number of common tree definitions are
	provided.  Unfortunately, ANTLR cannot parse XML DOM trees since our
	method names conflict (e.g., getFirstChild()); ANTLR was here
	first <wink>.  Argh!




Notation



	In this and other documents, tree structures are represented by a
	LISP-like notation, for example:



#(A B C)



	is a tree with A at the root, and children B and C. This notation can be
	nested to describe trees of arbitrary structure, for example:



#(A B #(C D E))



	is a tree with A at the root, B as a first child, and an entire subtree
	as the second child. The subtree, in turn, has C at the root and D,E as
	children.



Controlling AST construction



	AST construction in an ANTLR Parser, or AST transformation in a
	Tree-Parser, is turned on and off by the 
	buildAST option.




	From an AST construction and walking point of view, ANTLR considers all
	tree nodes to look the same (i.e., they appear to be homogeneous). 
	Through a tree factory or by specification, however, you can instruct ANTLR
	to create nodes of different types.   See the section below on
	heterogeneous trees.



Grammar annotations for building ASTs
 
Leaf nodes



	ANTLR assumes that any nonsuffixed token reference or token-range is a
	leaf node in the resulting tree for the enclosing rule. If no suffixes at
	all are specified in a grammar, then a Parser will construct a linked-list
	of the tokens (a degenerate AST), and a Tree-Parser will copy the input
	AST.



Root nodes



	Any token suffixed with the "^" operator is
	considered a root token. A tree node is constructed for that token and is
	made the root of whatever portion of the tree has been built



a : A B^ C^ ;



	results in tree #(C #(B A)).




	First A is matched and made a lonely child, followed by B which is made the parent of the current tree, A. Finally, C is matched and made the parent of the current tree, making it the parent of the B node. Note that the same rule without any operators results in the flat tree A B C.



Turning off standard tree construction



	Suffix a token reference with "!" to prevent
	incorporation of the node for that token into the resulting tree (the AST
	node for the token is still constructed and may be referenced in actions,
	it is just not added to the result tree automatically). Suffix a rule
	reference "!" to indicate that the tree constructed by
	the invoked rule should not be linked into the tree constructed for the
	current rule.




	Suffix a rule definition with "!" to indicate that
	tree construction for the rule is to be turned off. Rules and tokens
	referenced within that rule still create ASTs, but they are not linked into
	a result tree. The following rule does no automatic tree construction.
	Actions must be used to set the return AST value, for example:



begin!
    :   INT PLUS i:INT
        { #begin = #(PLUS INT i); }
    ;



	For finer granularity, prefix alternatives with "!"
	to shut off tree construction for that alternative only. This granularity
	is useful, for example, if you have a large number of alternatives and you
	only want one to have manual tree construction:



stat:
        ID EQUALS^ expr   // auto construction
    ... some alternatives ...
    |!  RETURN expr
        {#stat = #([IMAGINARY_TOKEN_TYPE] expr);}
    ... more alternatives ...
    ; 
 
Tree node construction



	With automatic tree construction off (but with buildAST
	on), you must construct your own tree nodes and combine them into tree
	structures within embedded actions. There are several ways to create a tree
	node in an action:

    
	
  1. 
		use new T(arg) where T is your tree
		node type and arg is either a single token type, a token type and
		token text, or a Token.
	
    2. 
	
  2. 
		use ASTFactory.create(arg) where T is your
		tree node type and arg is either a single token type, a token type
		and token text, or a Token. Using the factory is more
		general than creating a new node directly, as it defers the node-type
		decision to the factory, and can be easily changed for the entire
		grammar.
	
    3. 
	
  3. 
		use the shorthand notation #[TYPE] or #[TYPE,"text"] or
		#[TYPE,"text",ASTClassNameToConstruct]. The shorthand notation
		results in a call to ASTFactory.create() with any specified arguments.
	
    4. 
	
  4. 
		use the shorthand notation #id, where id is either a
		token matched in the rule, a label, or a rule-reference.
	
    5. 




	To construct a tree structure from a set of nodes, you can set the
	first-child and next-sibling references yourself or call the factory
	make method or use #(...) notation described below.



AST Action Translation



	In parsers and tree parsers with buildAST set to true, ANTLR
	will translate portions of user actions in order to make it easier to build
	ASTs within actions. In particular, the following constructs starting with
	'#' will be translated:


	

		#label
	

	

		The AST associated with a labeled token-reference or rule-reference
		may be accessed as #label. The translation is to a
		variable containing the AST node built from that token, or the AST
		returned from the	rule.
	

	

		#rule
	

	

		When rule is the name of the enclosing rule, ANTLR will
		translate this into the variable containing the result AST for the rule.
		This allows you to set the return AST for a rule or examine it from
		within an action. This can be used when AST generation is on or
		suppressed for the rule or alternate. For example:
		
r! : a:A	{ #r = #a; }


	

	

		Setting the return tree is very useful
		in combination with normal tree construction because you can have
		ANTLR do all the work of building a tree and then add an imaginary
		root node such as:
	

	

		 
	

	


decl : ( TYPE ID )+
       { #decl = #([DECL,"decl"], #decl); }
     ;

	

	

		ANTLR allows you to assign to #rule anywhere within an
      alternative of the rule. ANTLR ensures that references of and
		assignments to #rule within an action force the parser's
		internal AST construction variables into a stable state. After you
		assign to #rule, the state of the parser's automatic AST
		construction variables will be set as if ANTLR had generated the tree
		rooted at #rule. For example, any children nodes added after
		the action will be added to the children of #rule.
	

	

		#label_in
	

	

		In a tree parser, the input AST associated with a labeled
		token reference or rule reference may be accessed as
		#label_in. The translation is to a variable containing the
		input-tree AST node from which the rule or token was extracted. Input
		variables are seldom used. You almost always want to use
		#label instead of #label_in.
	

	

		 
	

	

		#id
	

	

		ANTLR supports the translation of unlabeled token references as a
		shorthand notation, as long as the token is unique within the scope
		of a single alternative. In these cases, the use of an unlabeled
		token reference identical to using a label. For example, this:


r! : A { #r = #A; }


		

			is equivalent to:
		



r! : a:A { #r = #a; }

	

	

		#id_in is given similar treatment to
		#label_in.
	

	

		 
	

	

		#[TOKEN_TYPE] or #[TOKEN_TYPE,"text"] or #[TYPE,"text",ASTClassNameToConstruct]
	

	

		AST node constructor shorthand. The translation is a call to the ASTFactory.create() method.  For example, #[T] is translated to: 
ASFFactory.create(T)

	

	

		#(root, c1, ..., cn)
	

	

		AST tree construction shorthand. ANTLR looks for the comma character
to separate the tree arguments. Commas within method call tree elements are
handled properly; i.e., an element of "foo(#a,34)" is ok
and will not conflict with the comma separator between the other tree
elements in the tree. This tree construct is translated to a "make
tree" call. The "make-tree" call is complex due to the need
to simulate variable arguments in languages like Java, but the result will
be something like: 
ASTFactory.make(root, c1, ...,
cn);

		

			In addition to the translation of the #(...) as a whole,
the root and each child c1..cn will be translated.
Within the context of a #(...) construct, you may use:
		
    
			
  • 
				id or label as a shorthand for
				#id or #label.
			
    • 
			
  • 
				[...] as a shorthand for #[...].
			
    • 
			
  • 
				(...) as a shorthand for #(...).
			
    • 
		

	





	The target code generator performs this translation with the help of a
special lexer that parses the actions and asks the code-generator to create
appropriate substitutions for each translated item. This lexer might impose
some restrictions on label names (think of C/C++ preprocessor directives)



Invoking parsers that build trees



	Assuming that you have defined a lexer L and a parser P in your grammar, you can invoke them sequentially on the system input stream as follows.



L lexer = new L(System.in);
P parser = new P(lexer);
parser.setASTNodeType("MyAST");
parser.startRule();   



	If you have set buildAST=true in your parser grammar, then it will build an AST, which can be accessed via parser.getAST(). If you have defined a tree parser called T, you can invoke it with:



T walker = new T();
walker.startRule(parser.getAST()); // walk tree  



	If, in addition, you have set buildAST=true in your tree-parser to turn on transform mode, then you can access the resulting AST of the tree-walker:



AST results = walker.getAST();
DumpASTVisitor visitor = new DumpASTVisitor();
visitor.visit(results);



	Where DumpASTVisitor is a predefined ASTVisitor implementation that simply prints the tree to the standard output.




	You can also use get a LISP-like print out of a tree via



String s = parser.getAST().toStringList();
 
AST Factories



	ANTLR uses a factory pattern to create and connect AST nodes. This is done to primarily to separate out the tree construction facility from the parser, but also gives you a hook in between the parser and the tree node construction.  Subclass ASTFactory to alter the create methods.




	If you are only interested in specifying the AST node type at runtime, use the



setASTNodeType(String className)



	method on the parser or factory.  By default, trees are constructed of nodes of type antlr.CommonAST.  (You must use the fully-qualified class name).





You can also specify a different class name for each token type to generate heterogeneous trees:


/** Specify an "override" for the Java AST object created for a
 *  specific token.  It is provided as a convenience so
 *  you can specify node types dynamically.  ANTLR sets
 *  the token type mapping automatically from the tokens{...}
 *  section, but you can change that mapping with this method.
 *  ANTLR does it's best to statically determine the node
 *  type for generating parsers, but it cannot deal with
 *  dynamic values like #[LT(1)].  In this case, it relies
 *  on the mapping.  Beware differences in the tokens{...}
 *  section and what you set via this method.  Make sure
 *  they are the same.
 *
 *  Set className to null to remove the mapping.
 *
 *  @since 2.7.2
 */
public void setTokenTypeASTNodeType(int tokenType, String className)
	throws IllegalArgumentException;





	The ASTFactory has some generically useful methods:



/** Copy a single node with same Java AST objec type.
 *  Ignore the tokenType->Class mapping since you know
 *  the type of the node, t.getClass(), and doing a dup.
 *
 *  clone() is not used because we want all AST creation
 *  to go thru the factory so creation can be
 *  tracked.  Returns null if t is null.
 */
public AST dup(AST t);


/** Duplicate tree including siblings
 * of root.
 */
public AST dupList(AST t);
 
/**Duplicate a tree, assuming this is a
 * root node of a tree--duplicate that node
 * and what's below; ignore siblings of root
 * node.
 */
public AST dupTree(AST t);
 
Heterogeneous ASTs



	Each node in an AST must encode information about the kind of node it is; for example, is it an ADD operator or a leaf node such as an INT?  There are two ways to encode this: with a token type or with a Java (or C++ etc...) class type.  In other words, do you have a single class type with numerous token types or no token types and numerous classes?  For lack of better terms, I (Terence) have been calling ASTs with a single class type homogeneous trees and ASTs with many class types heterogeneous trees.




	The only reason to have a different class type for the various kinds of nodes is for the case where you want to execute a bunch of hand-coded tree walks or your nodes store radically different kinds of data.  The example I use below demonstrates an expression tree where each node overrides value() so that root.value() is the result of evaluating the input expression.   From the perspective of building trees and walking them with a generated tree parser, it is best to consider every node as an identical AST node.  Hence, the schism that exists between the hetero- and homogeneous AST camps.




	ANTLR supports both kinds of tree nodes--at the same time!  If you do nothing but turn on the "buildAST=true" option, you get a homogeneous tree.  Later, if you want to use physically separate class types for some of the nodes, just specify that in the grammar that builds the tree.  Then you can have the best of both worlds--the trees are built automatically, but you can apply different methods to and store different data in the various nodes.  Note that the structure of the tree is unaffected; just the type of the nodes changes.




	ANTLR applies a "scoping" sort of algorithm for determining the class type of a particular AST node that it needs to create.  The default type is CommonAST unless, prior to parser invocation, you override that with a call to:



  myParser.setASTNodeType("com.acme.MyAST");



where you must use a fully qualified class name.


	In the grammar, you can override the default class type by setting the type for nodes created from a particular input token.  Use the element option <AST=typename> in the tokens section:



tokens {
    PLUS<AST=PLUSNode>;
    ...
}



	You may further override the class type by annotating a particular token reference in your parser grammar:



anInt : INT<AST=INTNode> ;



	This reference override is super useful for tokens such as ID that you might want converted to a TYPENAME node in one context and a VARREF in another context.




	ANTLR uses the AST factory to create all AST nodes even if it knows the specific type.   In other words, ANTLR generates code similar to the following:



ANode tmp1_AST = (ANode)astFactory.create(LT(1),"ANode");



from


a : A<AST=ANode> ;
.


An Expression Tree Example



	This example includes a parser that constructs expression ASTs, the usual lexer, and some AST node class definitions.




	Let's start by describing the AST structure and node types.   Expressions have plus and multiply operators and integers.  The operators will be subtree roots (nonleaf nodes) and integers will be leaf nodes.  For example, input 3+4*5+21 yields a tree with structure:




	(  + (  +  3 (  *  4  5 ) )  21 )




	or:



  +
  |
  +--21
  |
  3--*
     |
     4--5



	All AST nodes are subclasses of CalcAST, which are BaseAST's that also answer method value().   Method value() evaluates the tree starting at that node.  Naturally, for integer nodes, value() will simply return the value stored within that node.  Here is CalcAST:



public abstract class CalcAST
    extends antlr.BaseAST
{
    public abstract int value();
}



	The AST operator nodes must combine the results of computing the value of their two subtrees.  They must perform a depth-first walk of the tree below them.  For fun and to make the operations more obvious, the operator nodes define left() and right() instead, making them appear even more different than the normal child-sibling tree representation.  Consequently, these expression trees can be treated as both homogeneous child-sibling trees and heterogeneous expression trees.



public abstract class BinaryOperatorAST extends
    CalcAST
{
    /** Make me look like a heterogeneous tree */
    public CalcAST left() {
        return (CalcAST)getFirstChild();
    }

    public CalcAST right() {
        CalcAST t = left();
        if ( t==null ) return null;
        return (CalcAST)t.getNextSibling();
    }
}



	The simplest node in the tree looks like:



import antlr.BaseAST;
import antlr.Token;
import antlr.collections.AST;
import java.io.*;

/** A simple node to represent an INT */
public class INTNode extends CalcAST {
    int v=0;

    public INTNode(Token tok) {
        v = Integer.parseInt(tok.getText());
    }

    /** Compute value of subtree; this is
     *  heterogeneous part :)
     */
    public int value() {
        return v;
    }

    public String toString() {
        return " "+v;
    }

    // satisfy abstract methods from BaseAST
    public void initialize(int t, String txt) {
    }
    public void initialize(AST t) {
    }
    public void initialize(Token tok) {
    }
}



	The operators derive from BinaryOperatorAST and define value() in terms of left() and right().  For example, here is PLUSNode:



import antlr.BaseAST;
import antlr.Token;
import antlr.collections.AST;
import java.io.*;

/** A simple node to represent PLUS operation */
public class PLUSNode extends BinaryOperatorAST {
    public PLUSNode(Token tok) {
    }

    /** Compute value of subtree;
     * this is heterogeneous part :)
     */
    public int value() {
        return left().value() + right().value();
    }

    public String toString() {
        return " +";
    }

    // satisfy abstract methods from BaseAST
    public void initialize(int t, String txt) {
    }
    public void initialize(AST t) {
    }
    public void initialize(Token tok) {
    }
}



	The parser is pretty straightforward except that you have to add the options to tell ANTLR what node types you want to create for which token matched on the input stream.   The tokens section lists the operators with element option AST appended to their definitions.  This tells ANTLR to build PLUSNode objects for any PLUS tokens seen on the input stream, for example.  For demonstration purposes, INT is not included in the tokens section--the specific token references is suffixed with the element option to specify that nodes created from that INT should be of type INTNode (of course, the effect is the same as there is only that one reference to INT).



class CalcParser extends Parser;
options {
    buildAST = true; // uses CommonAST by default
}

// define a bunch of specific AST nodes to build.
// can override at actual reference of tokens in
// grammar below.
tokens {
    PLUS<AST=PLUSNode>;
    STAR<AST=MULTNode>;
}

expr:   mexpr (PLUS^ mexpr)* SEMI!
    ;

mexpr
    :   atom (STAR^ atom)*
    ;

// Demonstrate token reference option
atom:   INT<AST=INTNode>
    ;



	Invoking the parser is done as usual.  Computing the value of the resulting AST is accomplished by simply calling method value() on the root.



import java.io.*;
import antlr.CommonAST;
import antlr.collections.AST;

class Main {
    public static void main(String[] args) {
        try {
            CalcLexer lexer =
                new CalcLexer(
                  new DataInputStream(System.in)
                );
            CalcParser parser =
                new CalcParser(lexer);
            // Parse the input expression
            parser.expr();
            CalcAST t = (CalcAST)parser.getAST();

            System.out.println(t.toStringTree());

            // Compute value and return
            int r = t.value();
            System.out.println("value is "+r);
        } catch(Exception e) {
            System.err.println("exception: "+e);
            e.printStackTrace();
        }
    }
}



	For completeness, here is the lexer:



class CalcLexer extends Lexer;

WS  :   (' '
    |   '\t'
    |   '\n'
    |   '\r')
        { $setType(Token.SKIP); }
    ;

LPAREN: '(' ;

RPAREN: ')' ;

STAR:   '*' ;

PLUS:   '+' ;

SEMI:   ';' ;

protected
DIGIT
    :   '0'..'9' ;

INT :   (DIGIT)+ ;
 
Describing Heterogeneous Trees With Grammars



	So what's the difference between this approach and default homogeneous tree construction?  The big difference is that you need a tree grammar to describe the expression tree and compute resulting values.  But, that's a good thing as it's "executable documentation" and negates the need to handcode the tree parser (the value() methods).  If you used homogeneous trees, here is all you would need beyond the parser/lexer to evaluate the expressions:  [This code comes from the examples/java/calc directory.]



class CalcTreeWalker extends TreeParser;

expr returns [float r]
{
    float a,b;
    r=0;
}
    :   #(PLUS a=expr b=expr)   {r = a+b;}
    |   #(STAR a=expr b=expr)   {r = a*b;}
    |   i:INT
        {r = (float)
         Integer.parseInt(i.getText());}
    ;



	Because Terence wants you to use tree grammars even when constructing heterogeneous ASTs (to avoid handcoding methods that implement a depth-first-search), implement the following methods in your various heterogeneous AST node class definitions:



    /** Get the token text for this node */
    public String getText();
    /** Get the token type for this node */
    public int getType();



	That is how you can use heterogeneous trees with a tree grammar.  Note that your token types must match the PLUS and STAR token types imported from your parser.  I.e., make sure PLUSNode.getType() returns CalcParserTokenTypes.PLUS.   The token types are generated by ANTLR in interface files that look like:



public interface CalcParserTokenTypes {
	...
        int PLUS = 4;
        int STAR = 5;
	...
}
 
AST (XML) Serialization



	[Oliver Zeigermann olli@zeigermann.de provided the initial implementation of this serialization.  His XTAL XML translation code is worth checking out; particularly for reading XML-serialized ASTs back in.]




	For a variety of reasons, you may want to store an AST or pass it to another program or computer.  Class antlr.BaseAST is Serializable using the Java code generator, which means you can write ASTs to the disk using the standard Java stuff.  You can also write the ASTs out in XML form using the following methods from BaseAST:

    
	
  • 
		public void xmlSerialize(Writer out)
	
    • 
	
  • 
		public void xmlSerializeNode(Writer out)
	
    • 
	
  • 
		public void xmlSerializeRootOpen(Writer out)
	
    • 
	
  • 
		public void xmlSerializeRootClose(Writer out)
	
    • 




	All methods throw IOException.




	You can override xmlSerializeNode and so on to change the way nodes are written out.  By default the serialization uses the class type name as the tag name and has attributes text and type to store the text and token type of the node.




	The output from running the simple heterogeneous tree example, examples/java/heteroAST, yields:



 (  + (  +  3 (  *  4  5 ) )  21 )
<PLUS><PLUS><int>3</int><MULT>
<int>4</int><int>5</int>
</MULT></PLUS><int>21</int></PLUS>
value is 44



	The LISP-form of the tree shows the structure and contents.  The various heterogeneous nodes override the open and close tags and change the way leaf nodes are serialized to use <int>value</int> instead of tag attributes of a single node.




	Here is the code that generates the XML:



Writer w = new OutputStreamWriter(System.out);
t.xmlSerialize(w);
w.write("\n");
w.flush();
 
AST enumerations



	The AST findAll and findAllPartial methods return enumerations of tree nodes that you can walk.  Interface



antlr.collections.ASTEnumeration



	and



class antlr.Collections.impl.ASTEnumerator



	implement this functionality.  Here is an example:



// Print out all instances of
// a-subtree-of-interest
// found within tree 't'.
ASTEnumeration enum;
enum = t.findAll(a-subtree-of-interest);
while ( enum.hasMoreNodes() ) {
  System.out.println(
    enum.nextNode().toStringList()
  );
}
 
A few examples
 

sum :term ( PLUS^ term)*
    ; 



	The "^" suffix on the PLUS tells ANTLR to create an additional node and place it as the root of whatever subtree has been constructed up until that point for rule sum. The subtrees returned by the term references are collected as children of the addition nodes.  If the subrule is not matched, the associated nodes would not be added to the tree. The rule returns either the tree matched for the first term reference or a PLUS-rooted tree.




	The grammar annotations should be viewed as operators, not static specifications. In the above example, each iteration of the (...)* will create a new PLUS root, with the previous tree on the left, and the tree from the new term on the right, thus preserving the usual associatively for "+".




	Look at the following rule that turns off default tree construction.



decl!:
    modifiers type ID SEMI;
	{ #decl = #([DECL], ID, ([TYPE] type),
                    ([MOD] modifiers) ); }
    ;



	In this example, a declaration is matched. The resulting AST has an "imaginary" DECL node at the root, with three children. The first child is the ID of the declaration. The second child is a subtree with an imaginary TYPE node at the root and the AST from the type rule as its child. The third child is a subtree with an imaginary MOD at the root and the results of the modifiers rule as its child.



Labeled subrules



	[THIS WILL NOT BE IMPLEMENTED AS LABELED SUBRULES...We'll do something else eventually.]




	In 2.00 ANTLR, each rule has exactly one tree associated with it. Subrules simply add elements to the tree for the enclosing rule, which is normally what you want. For example, expression trees are easily built via:




expr: ID ( PLUS^ ID )*
    ;
    



	However, many times you want the elements of a subrule to produce a tree that is independent of the rule's tree. Recall that exponents must be computed before coefficients are multiplied in for exponent terms. The following grammar matches the correct syntax.




// match exponent terms such as "3*x^4"
eterm
    :   expr MULT ID EXPONENT expr
    ;
    



	However, to produce the correct AST, you would normally split the ID EXPONENT expr portion into another rule like this:




eterm:
    expr MULT^ exp
    ;

exp:
	ID EXPONENT^ expr
    ;
    



	In this manner, each operator would be the root of the appropriate subrule. For input 3*x^4, the tree would look like:




#(MULT 3 #(EXPONENT ID 4))
    



	However, if you attempted to keep this grammar in the same rule:




eterm
    :   expr MULT^ (ID EXPONENT^ expr)
    ;
    



	both "^" root operators would modify the same tree yielding




#(EXPONENT #(MULT 3 ID) 4)
    



	This tree has the operators as roots, but they are associated with the wrong operands.




	Using a labeled subrule allows the original rule to generate the correct tree.




eterm
    :   expr MULT^ e:(ID EXPONENT^ expr)
    ;
    



	In this case, for the same input 3*x^4, the labeled subrule would build up its own subtree and make it the operand of the MULT tree of the eterm rule. The presence of the label alters the AST code generation for the elements within the subrule, making it operate more like a normal rule. Annotations of "^" make the node created for that token reference the root of the tree for the e subrule.




	Labeled subrules have a result AST that can be accessed just like the result AST for a rule. For example, we could rewrite the above decl example using labeled subrules (note the use of ! at the start of the subrules to suppress automatic construction for the subrule):




decl!:
    m:(! modifiers { #m = #([MOD] modifiers); } )
    t:(! type { #t = #([TYPE] type); } )
    ID
    SEMI;
    { #decl = #( [DECL] ID t m ); }
    ;
    



	What about subrules that are closure loops? The same rules apply to a closure subrule--there is a single tree for that loop that is built up according to the AST operators annotating the elements of that loop. For example, consider the following rule.




term:   T^ i:(OP^ expr)+
    ;
    



	For input T OP A OP B OP C, the following tree structure would be created:




#(T #(OP #(OP #(OP A) B) C) )
    



	which can be drawn graphically as




T
|
OP
|
OP--C
|
OP--B
|
A
    



	The first important thing to note is that each iteration of the loop in the subrule operates on the same tree. The resulting tree, after all iterations of the loop, is associated with the subrule label. The result tree for the above labeled subrule is:




#(OP #(OP #(OP A) B) C)
    



	The second thing to note is that, because T is matched first and there is a root operator after it in the rule, T would be at the bottom of the tree if it were not for the label on the subrule.




	Loops will generally be used to build up lists of subtree. For example, if you want a list of polynomial assignments to produce a sibling list of ASSIGN subtrees, then the following rule you would normally split into two rules.




interp
    :   ( ID ASSIGN poly ";" )+
    ;
    



	Normally, the following would be required




interp
    :   ( assign )+
    ;
assign
    :   ID ASSIGN^ poly ";"!
    ;
    



	Labeling a subrule allows you to write the above example more easily as:




interp
    :   ( r:(ID ASSIGN^ poly ";") )+
    ;
    



	Each recognition of a subrule results in a tree and if the subrule is nested in a loop, all trees are returned as a list of trees (i.e., the roots of the subtrees are siblings). If the labeled subrule is suffixed with a "!", then the tree(s) created by the subrule are not linked into the tree for the enclosing rule or subrule.




	Labeled subrules within labeled subrules result in trees that are linked into the surrounding subrule's tree. For example, the following rule results in a tree of the form X #( A #(B C) D) Y.




a   :   X r:( A^ s:(B^ C) D) Y
    ;
    



	Labeled subrules within nonlabeled subrules result in trees that are linked into the surrounding rule's tree. For example, the following rule results in a tree of the form #(A X #(B C) D Y).




a   :   X ( A^ s:(B^ C) D) Y
    ;    
 
Reference nodes



	Not implemented. A node that does nothing but refer to another node in the tree. Nice for embedding the same tree in multiple lists.



Required AST functionality and form



	The data structure representing your trees can have any form or type name as long as they implement the AST interface:



package antlr.collections;

/** Minimal AST node interface used by ANTLR
 *  AST generation and tree-walker.
 */
public interface AST {
    /** Get the token type for this node */
    public int getType();

    /** Set the token type for this node */
    public void setType(int ttype);

    /** Get the token text for this node */
    public String getText();

    /** Set the token text for this node */
    public void setText(String text);

    /** Get the first child of this node;
     *  null if no children */
    public AST getFirstChild();

    /** Set the first child of a node */
    public void setFirstChild(AST c);

    /** Get the next sibling in line after this
     * one
     */
    public AST getNextSibling();

    /** Set the next sibling after this one */
    public void setNextSibling(AST n);

    /** Add a (rightmost) child to this node */
    public void addChild(AST node);
 
    /** Are two nodes exactly equal? */
    public boolean equals(AST t);
 
    /** Are two lists of nodes/subtrees exactly
     *  equal in structure and content? */
    public boolean equalsList(AST t);
 
    /** Are two lists of nodes/subtrees
     *  partially equal? In other words, 'this'
     *  can be bigger than 't'
     */
    public boolean equalsListPartial(AST t);
 
    /** Are two nodes/subtrees exactly equal? */
    public boolean equalsTree(AST t);
 
    /** Are two nodes/subtrees exactly partially
     *  equal? In other words, 'this' can be
     *  bigger than 't'.
     */
    public boolean equalsTreePartial(AST t);
 
    /** Return an enumeration of all exact tree
     * matches for tree within 'this'.
     */
    public ASTEnumeration findAll(AST tree);
 
    /** Return an enumeration of all partial
     *  tree matches for tree within 'this'.
     */
    public ASTEnumeration findAllPartial(
        AST subtree);
 
    /** Init a node with token type and text */
    public void initialize(int t, String txt);
 
    /** Init a node using content from 't' */
    public void initialize(AST t);
 
    /** Init a node using content from 't' */
    public void initialize(Token t);
 
    /** Convert node to printable form */
    public String toString();
 
    /** Treat 'this' as list (i.e.,
     *  consider 'this'
     *  siblings) and convert to printable
     *  form
     */
    public String toStringList();
 
    /** Treat 'this' as tree root
     *  (i.e., don't consider
     *  'this' siblings) and convert
     *   to printable form */
    public String toStringTree();
}



	This scheme does not preclude the use of heterogeneous trees versus homogeneous trees. However, you will need to write extra code to create heterogeneous trees (via a subclass of ASTFactory) or by specifying the node types at the token reference sites or in the tokens section, whereas the homogeneous trees are free.



Version: $Id: //depot/code/org.antlr/release/antlr-2.7.7/doc/trees.html#2 $



antlr-2.7.7/doc/subrule.gif0000644000175000017500000000353710522211615015525 0ustar  twernertwernerGIF89aｼｼｼﾄﾄﾄﾀﾀﾀ,@Hｰﾁ*\ﾈｰ｡ﾃ#J忸ﾅ,X`｢ﾇ
;:D@彫@K址ﾈ0繧(ﾆ\ｨr&H6!貍I0cw(耘?*]ﾊｴ飫､+1掏潮U昿ｯﾊﾔﾊ秒ﾖｮ4?~霞鰄Ｈﾁｲ悩r`ﾑ挌]葺V-Zｱv}ﾎ彬7鎹櫞
|T耘ｨ:Uﾌn罸ﾗe<92Yﾋ
+cｾｨ9/^ｵ.5w]ｳｴiﾞ\6蓚ﾗｦ7-(mﾙ\ﾋ~會`､f:m稈cfEiｭ矼4;*ys肩孫kX#pﾟ7ﾚﾖXUﾚqｦgｽ*zﾕｻ"ｦﾛｾ*[訛ﾙ;Ny捫}ﾚRyﾇpﾟ；x苟ｷX{BX`Qx套ﾚa_＠l gnSM^ﾙ ^%4｢[+ｵ蘆Rｲｸﾖl籃h緕M両ｼm蔟ﾗ`ｵｼｺ厂jｼ^{'ﾚl38ﾙﾂhu為Rﾍ0ﾂY弦ﾓz/ﾞｻｭuｲ'ｩn1ﾏｹE7ﾔ躄戈ﾙSｻﾗ4ﾟ任>ﾆ框ｭ3粥$W~鉞1zﾎhｳ=a酵ﾜB｣ﾖﾏcｽｫ9ﾑ3k[
p7ｲ桑z燹G蟐*ﾓ插{ﾝ#ｼAﾍ}ｵｾ"椶x]ｷ=bｿrF･i?;ｶr[ｧﾟ8ｳ拡Op'>?磊響ﾍﾟｰｷｻ	P\<ﾏ｢,D@ﾝ-⊆j 78AVlｻ2ﾈ2ﾓ1	Q艝晰:ﾃﾁﾕﾁ/:畴&ｳｨ3,_y<ﾅN$5ﾃ!CRｺﾛ4H｣D['ｾ	ﾑ~ﾚ]ﾇ&邁".Q]=\糜ｪｵZFaN傴B$%)ｶd7RﾆFｯｲyq$ﾜﾗﾅvｨXN[|殕;antlr-2.7.7/doc/ANTLRException.gif0000644000175000017500000003425010522211615016577 0ustar  twernertwernerGIF89aтﾄﾄﾄт､､､ﾄﾜﾄﾀﾀﾀ!,@(p ｰ@*DｨpaC
#J8ｱ D/Rｶ{X+ﾟｽﾃﾅﾛ4鞣汳O^ｸﾗｰ5_&鉢ﾜﾇo+ﾎ噛ｳ贊}Y瞳ﾛ:ｲG#ｦjﾊ攅F*1ﾖﾃk+_ﾎ懼ﾞﾌﾉwﾋFｽyﾋﾕBﾗ1聽ｱ’7m=)[ﾏ"Pﾐaｂ	ﾈ欅_ｯW_ｺ｡LueﾕSTｧdfﾑzｺiｴ_gH焜ﾂ	_}ﾞgﾐ=ｨﾕErW刄ﾘ｡7ﾖabｷｷﾙ顕烏ceMｩｦ潼w鐔jﾞm$Oｨﾀ9薯iﾈﾟ
<ｸSB	e桧>Ie油9･BXnｹe燃ｦ寝ZYd考(ﾉ艚Nｦy蝮xﾚ曳幼ｩ&揺齷ﾐ/Yｦ拈"軾Q
ﾗ｢_ｿ｡輊y2ｦ｣虻YｨnｶYｧ7vﾊ(･ﾒｹuｦ囃ｪ黔ﾁ=ｺｫ｢ﾆh繽ｬｦ釐X獏
徃駄D 痔紫ﾙｬｲzwｮｽ[ﾑﾂ横}･ｨ%&dｶoQi｢楪箜ﾅ`LｭｩｨWｵx\:謨ｫ慣ﾂ*aｿk蜷ｰvg$zｲ[鯊ｪｫｯｺGﾁ)?Mz阯遨ｨ=絹這^ﾋ泓ﾛ1ﾅ 道gy.i｣俾sﾊ堤｢aﾍﾛｯﾎｾｶ｢ﾇﾍﾖVﾊｶｹﾌｽ淒嫩型!Lpｿﾅ"ｭﾒbｦｲﾌｸｬｲ+7校托ﾆ
ｰtｮﾒﾋlc槲ﾔﾘ麁ｳKI;ｭ敦teﾁrV1ﾕ蛟Gﾑ肱ﾋ捲ﾁﾃﾆJｵﾎLﾋﾖuﾘoｯ岼kdW緇ﾆN｡ﾔﾖeCw麗1X
/ﾉ0Dｨ｢Y6ｻ+ﾕn7ｼ`Z<n .wXｷ1y,uﾃ｡赤U1沙ﾉmU硅ﾄ乕ﾐ{>Q毬,D%Ml[Tﾆ乖)３､HｵC;Pd:T貫,ｷ幟薛4^ｬWﾕJu)鬘g#ﾟgH9z8	iﾇｾXﾒ壷K	)uｶ蚓2wﾄｷｨ羣駟アCﾕ|ﾄ@ｼ鼠4lﾘ謌xA,Dﾕｿｽ
鷦S/剰ﾋE｢or箱ﾎｩｻ!K{彬&	擧H ﾌwｼ$宸GM%3dpｹﾉF$
#ｧ
CD 1叱｡ﾕｺZｱdiｷﾅ丞ﾑ8>+'^､ｩｼﾞ
ﾍ|ﾂ$w<疏H叩
	ﾇﾗｩﾃEｧ.^ﾓ&儕X犀q`'2Qｶ客qqﾕQﾓfT踵j5ﾊ%渾Rjｪ@t+Iﾙwﾆt槓Dﾆ*Zｺ)5ﾆ而v$$Zｪｸ事秦ツxﾄｯ､茯XKJﾓu决｢ﾊｼYｾＧｲ｡D'霙看 Bｱ洽疑]
W+ｮq徒-$ZOﾒｬ2p嬢hｼｺｾ諍#､dﾋ｢ｯ6}Fjｭｪｼ婀瀲vy,ｿﾊ2ｫﾎｳﾌ#+AﾚYﾊ>4ｭ胃ﾚEc{fｲ6(CMH,AﾇKuｬW精oE膏ｼ*尚8Vz"Gｪ咋s)ﾊﾕｶVｺ.ﾃnWOﾊ\"ｫﾄ.jMｰﾐﾆ0%罷ﾈﾅｺ踈ｷｻg|脯ﾏCﾒ星ｻkaKﾌﾉjｵｯk_>超ｮｩP!ｸ8代揄Sｫﾙﾚ9ﾂ4qｨ嶷ｧ[聞ﾈ
ﾑご;甞ﾘAL\ﾋ壞%ﾙZ｡AvｻDｺﾕ-ﾆﾍｫｬIﾗ]牧mｷ需ﾒ｣F｢ﾅｻfTｰﾆ｣{ﾖI/ﾚｼ揃ｴｦ7ﾍ餒xﾁΓ1乕cﾟ+ﾀJｮg6.'ﾅ短ｱﾉiｩL｡Tｾｲ不ﾍ)zﾗｿﾖｵｰ{
b;ﾘﾄ>ｶｱ届l,#q-ｩg6ﾖYｾvﾅｶﾊb}ﾎQuｴｶ総eﾚ*ﾚﾓ鎭ｷｺﾗﾍvｻ幢執ｼ蹼zﾛ峙ﾋ&wｾｭ~7已ｷｾOxﾁN#憮wｸﾂiea!{7ｮ#	znﾕ
m:W勃揃ukﾍﾅ:wUYG[[ﾑｷBUｳ.p63ﾝ#Lﾀｭc]N8sｼj朱8mYks映埖E6攀r剽S,ﾛﾂ{ﾛﾓJｧW,U蓉ﾂRｾ聴ﾈｬﾉ老2ｼeｴ;ｫF旬xｪﾛGﾝｪ7ﾌﾎｮ GpNtｰ窘ﾂｷ釁ﾆｮw}ｾ|AXr､蒙.Mｭｬ姐s亠2動ﾎ;ﾏ'41樔>p2聚ﾎ?oｨ3ｸ_n8ｺｿqﾄ_IｵG2ﾎGtﾕ験MIﾇｧ<}h{Fﾏ-yﾂ=證ｭxﾊW*ﾈz}(ｽｯt.yﾉU練ｻb讙ﾃ蒂ﾍ!?&=a5ﾒOｼ方lSz{|r3x打y^ｧ\CM=ｵfQ	%uﾈｲSﾎ濃>j詒BｴｴL‥qHy輸ﾘ_Ty5，ｫ48 8H坤ﾇ!cx~ｦﾆtvｧRﾍQYﾚｷ婚粕zpF2GYgﾉ躾X|ｮgGﾃjﾛﾖDﾂu{h本ﾒ_8XXG=Mﾗ＠M@ﾖJ]枚~ｻV+ﾗ+ﾁｴ?#!\薺e[qFqｾﾆ磨]鑿(v;ｨHueu
vj｢r+Eg､wV"5rｲuUWｹ%,WJg'$Hzﾎ&ﾕ_P#送}o剖uy4ﾙ!N8gv晉tﾎE[･t陣}Q頼88預c{?ｸz4轡ｨ|jﾖgI1tfOkTﾇﾗ|ﾜｦEw伯ｷｳ解v鎌Nｫﾒe乾7閇NF/}a芝aD,4G"ﾚｵ,xq｢∩ﾃX5RkｶhLｆ諄⊥諭gAI+Sﾅxcxvｬ慎X?｡T｢%映挙Eu9u9線uyp卓r諠@ﾘNﾇ聾ﾓｸNK}限mﾐghﾓH_ﾆﾓf陳&ｮ綽Eu芭2.IGU`IU争cz諚V'ﾖV-!ﾆ!kﾂTｾ5依%$＆＋綰ﾕoｨ4ｪ冒､弼･#F腟o/)qﾘﾑ6ﾕ'hqI])"ﾁm紮h兆rOf妨Hih齋KwﾑI｢EJｵ馮砧T鰭Yv}騫=rH:x9ｦq｢)3JVi昆=]8[$$3ヰﾛ･Y/"t4ｴｨZx4叨テ乎Wgcﾒ怒Vсｶf{2.ｺﾗPﾔﾘ[1合)rd警ｹ燐Y3ｷ縛ﾉ足桝ﾘ撈	榕ｩKIｧWﾁEwｸ&コｦUa)~,ｧ草	y蚕>`H}｣ﾗ跳ゃ餡ｴ笊髑ｧ儷ﾘZY)ﾙ鐘)隊鴎LQ｣妾ｴ抄ｨxYv沌｡ｪ *腿8ﾕ4Dｽ8:>(t\ｯ繻ﾄ牢D|Fihｹ{ｩy准ﾘ`蜉赤we收壥頼z､ﾈ0g Yﾇ喞i､遐ｹvylYﾂ=:啄Yu7蝌逋e~Od)ｨ撩)w3ﾈVﾝvﾙLﾉ祉服泗J｢駅g'7<ｪ信ｺ｣~黛JﾟHvdU刪ｳy9ｧｯY斈ﾁ崑x塚ﾈEﾍ(捐{)y｣ﾑ0EPXhﾐy｣
ﾙx礫鎧体Qｧe:｡ﾘ･┝川)<#fr`X､鑛UZ･)ｧｽﾖ針穫逎5､ｿJｦｾ嗤ﾋx鏑
ｩiZt'娥I炊D｣ﾒL#ｺ7Iｮeﾅ｣ﾅ･7Sb*m漠ｦｬﾊャﾇa】ｽiｩT9mD喩ﾒ%,瑤|G-)｣U｣qT的	jzgｺ天Jb6fｯ嗚F\D｣y邃0ﾚ｢tKｪ殍ｪ;d呶ﾚitgwｲﾋ皙ｪｰ閻lc鬯ﾇ渮jGFw剩稔遯7ｴﾍｪｳBKｳFKｴC[ｴ!ｻIｨu晒{･b3ｭ5肚･頸l_ﾊｦ,ﾛｵ^[oM[)J@WDN+Y_ｻｩﾛ姚傅m
Dｰ}fｰﾋ慮.ｵx峭zﾛｲ>1･{+TwfｵｸﾅｬGｫｴ峩顎ｸ給ｴ口ｸｹｹ+ｹ梗ｬNｷ埆ｹ憬ｹ檢ｹｺ｢;ｺ､{柑Yｨ*[|｣ﾔﾚ壼yｏ､室1$Uiiｳｷﾛｦﾂﾒ8ｧﾖZ-ﾈｸ帥8婉.犧ｼﾘ離ｯ*;sｵQ4ｨｬyｴﾆｨXｻFW4C抬｢ｰｫ4ｼoｺｧJ演ﾓｺ啗:ｼ:ｦｿｭr%ｨｦﾚ｣ﾖG｡♀Ｘ
潤Gr+縲rjｫHvL馴U,Xｽ\[Rwｹ必+ｾ?vｫL;*ｿ唱$ｺ道ｬﾎｿA8捌淫K鍖)Iﾚｾ鵯ﾆﾂWﾕﾂ卻cﾂﾓ八ｻ6G帑槽ｼﾀzｧ喩克渥ｲ+陽垰:\S@l=ﾁ劫xPL･冨H7緊*06ｨw峭HｹRﾁｲZｺ{ﾂdｼn]\ｼ検ｿ?ｻｿNkｻｳzｫ)ubI"芙ﾚ櫪ｽ*嵒ﾛ*mﾚｧKgl`8ｽﾗyI
ｿﾜ4ﾇﾌ:Z隍btZｩ|｣fNpｳa&ｯｪｏfｻ*:鯔A&_蜻(i?*ﾄﾗ(ﾇ､ﾅ3*讎&S｢,幅嫖+|k4｣ﾓK)ﾋ%2KﾈY佻悽落W1ｶM調74fﾅ%ﾑ|'｡､Oｳｼ｢｢#L┼ｸ3_･UﾈqｹｺｸﾁｭKｫuｷ室YｻVﾌiﾑAｸxｹﾂ$径ｪ)ﾇa9ｸ|ｬ5悄"ﾌR!ｨｼｪ♭<ﾆｻz|ﾆ'zﾖ采ﾍ｡ｵｫﾜｮ:ﾂ&]}､`ﾑﾑ~ﾜcﾓwﾈ愾kﾑx+｡ｿｧﾆ)ｵ糺ﾆ<ﾋｼ$ｮIﾍｦﾇ万ﾁｽ3:S下･6魯#ｩiﾐ･ｭ｡rﾄﾒZﾓ:ﾂﾍ=｡
}沍:ｩ､5ﾃvﾌﾓｨ吽ｫﾕﾑJT慘ﾊ！{ﾜ距ﾝ:n｡lﾏ$Q圷V(ﾕ*
ｫqlｦＶ2斃囂{ｦ,瓧K燉ﾘbU2Oﾍ^:U剪sﾖ┏9ｻﾇﾌﾒLmﾓ竇暴ﾝ:Wﾈ｣gaﾉｱ厄l幺ｸﾅｨﾑ;5ﾐULoｻxL｢Cmx]ﾅnｽﾑｹﾋﾘEﾂﾒ申ｸtt*､U･ｵ$ﾁﾒ6ﾍ4k緯ｬ項耆}x'M殊ﾘ鳥ﾈｺﾔ}ﾈﾌ勢筅ﾙ
ｽﾛmoLﾜﾒﾔﾎﾈ
ﾘOﾅｿｹﾜ
雪巫ﾛｻ姶ﾕ恩ﾕﾞ}iﾅi&ﾘｦiB勠ﾖ"]<7Jｳｻlﾞ{鱗,ZaｫlﾌAｸ:,ｭﾌ"ｩｯ党｢{ﾍ`)iﾍ+ﾅ%ﾟ器拵Mﾅtﾛ´ﾄ懆ﾋｨｨJ軒ﾟ]罸<ｫ[
尢W｢ｪF)Ck"["CRｱｴa&ﾚﾐ|ﾎ･ｽｱG慟.ｫｸｾｪrｺﾛLｹﾑﾎﾂ｡ﾓ<ﾌwｼw)炳$Q9ﾟｵ{ﾑﾄﾔ\ﾃﾍﾞ｡wﾈ酌ﾐｻ<楴廊Lﾞｷrﾚｭ逵ﾕﾗ敲帙kmﾕｺ:ﾝJ=B>ﾛﾇ地)aﾋ38ｼ<ｶﾟ麥ﾆﾘ拵ﾑ蝕"wｬ~ﾁy)ｵﾍ踟h 
ｸ梔綴5ｩ~)ﾃ!ﾙmﾍx>ｼﾞｮｾﾕﾈﾂ湖潯=廷Cﾌｪ'ﾗｼ4%-ｳ['.K)LTﾄB鎰ﾕ=^ｨｼuﾅnﾖCDi欧KNｶﾁ]{Tﾞ]ﾕVｪﾀｹd｣ﾍW
楳ﾓ9dQﾙ5vftﾈ7薇ﾍﾎ聾iｯﾎT勲c^ｸ	N9cOMﾈW\ﾝ`l~ﾔﾓ3変ﾎﾗﾆ釐^TR驟ｨﾌｷﾑUp>ﾏ騷楠A ,ﾛ寂2N4糞Tｲ-A創IUVﾏ;ｯｦ丑ﾔS,矧ﾆlﾓCV:蛩um瓏ﾙｽ.譴寮4鎖驅V8ｮTｽ([､0,ｽ晉H]1箝癜>ｼ皿wﾆ>5ﾘﾋ`懿Йｬ･8ﾈ樋ｮ?ﾟ.渉粽/\M／:赴縡ｬ"6
ﾋﾐnmヶﾕ襞ﾊ=o釐澁
嗜ﾝnﾌｺ%J輙"ﾝｧｽﾎｯ魅･ｶｾfMm沽nﾛｩQ菫蔕ﾈ鷂煩ﾞギﾗ御ﾎy_ｨOﾀ･2ﾁ@狢	D榔瓧
>T礇Jｴx紮`ﾌｸ｣ﾇ	AZ<aJWｪiｲbJ,kｶｼsfB9Rd2'N'θ<*TｧR｢.52zSaﾏ'ｩ.ﾅ啅Vｮ]ｽ"ｼZ朝ﾑｯdez
jｳ鰮ｬjｦﾕ*租Rｨb稼Z7[ｧzlHｷhﾇｼ
F杜ﾔｪﾗｶﾍ(ｩ翩}!O四勹CｸC鋸ｮTｻ?｣3倏B賑l6ﾈM'H@P ﾌｽwｦ=覿ﾖ鴻袰xrﾕﾍﾝﾂ4忽riｿxﾇl\uﾊﾀO3ﾎ]vkﾉIsｿｻ04ｹ9s蹇`|^]ﾟ5?ﾘﾄ
榻ｷ遐ﾛL3FkNﾀﾇ2m<ｮﾆｳｼjoｩﾋｫｿﾙｺ#沼而zo>tﾛﾍ!`ｱﾅ{ﾑ?e繋ﾅg､ｰｧｰZt柁РGc0ｵcpD:SpC4Tﾒｻ(aDoﾊ+Οﾀｵ款ｲJ-ﾏ*ｯI･|?ЙDdｳLｯﾌｼRﾂ'滬rｳ､ﾄｭ\mL?tﾂﾓ､ｨBｴ4C4Q)ﾛｼNN%#､ﾓﾉｳ濺ｴRKｧrｲﾎEｭTTｻNt-ﾉ5ｭﾂOg2ﾌS9\pｺI%+苳U[/ﾅ5W]uｯMﾍrﾕ-w=ﾘkE娘8陛窩孕YO#ｳ.2mﾛ7y#vD促墳Yｧ
CAEﾋs9qTｶﾝﾘ}7ﾐ`?L還｡概p搖Uﾟ/ﾕ@Z
-
M88ELﾏqｶ樔:ﾍi､ｫ各zﾘﾜ_=褪ﾂQｻｵｴﾚ!U甫pｽI03]t^ｿ6ﾎ5ﾄm1ﾃﾘY\烏栲\ﾏF}ﾖF!)Vod恟謇閹H/
ｶN&ｧd6	ﾔﾂHﾃ甸淅oｯﾅｪ(ｬｫeﾍ峽/..4ﾐ甑^UvWoyoﾁowa逧%ﾙe挈lｱ･;ﾔF'nﾋ/ﾗ)#%
拓"ﾇ廩｡=tﾓﾃ(ｴﾒOgｽuﾖﾗv=vM面｣Z mu6ﾝd!ﾒe航\7鯆gﾏ織ｷﾕｴﾏﾉS^j升+Urｫﾋｻﾗ-^ﾂｽ{3ｲ%j6ｱ>弸｣ｨｿ｢ｻ6oXJﾒﾙGﾘf5ﾟwf?抂C$`ｹ惇ﾉﾎ＾2ﾞv>ｪｬNﾃVﾐ~$ｰ$G#X&B
iO{ﾄ"ﾆ%ﾊﾍﾉP7 B#>技Oｨ｣?*ﾌﾅzHｼHE4ﾚ抗bCC瞎П`ｯVqfY檢ｬ亅彿pb	･ｲX碩ｹ.∞	ﾊ)tｽ舞O|otcﾍ'ﾇﾕ)jﾜb濁ﾘｨｰdﾓc 9ﾄr睡Dd"ﾃ5E6ﾒ4d繆薊JVﾒ追鬚Eﾀｨﾝﾕ'wﾁｳSｮ"ﾗ@z産dｲ#8GVｦｲ吻te,a9KUﾖ文%.
Wﾊｾ/aﾛUBﾌObﾁDfvXｷﾞﾒd(ｻd4･9ﾍｼﾈ!1ﾔ｢X3@ﾖｰl?8D､ﾑ錬ｦ･ｶｴ!族Gｧﾍ)ﾊｻQﾓ檐ﾄgCｩ1*,潁ﾋK&-VMS贅E(-ｪﾐﾒ｡}hC!:QW.湲|｡BﾓEﾊ久ﾔ｣iHi;走ﾔ､'EiJ;Qｶ櫨/･ｨKc
S茄Tｦ6･餉u售榻ﾔｧ8)p8ｪR｢ﾕｨGu敲声Tｦ6ﾕｩOjT･:Uｪrｮ詐*對ﾚｩ?Bｪ;hCcﾊﾆuｮXeo辻:Y窩ﾕT.oc･"ｼ-Jq軍*ｧｵ$5ｭ0Kﾏ悧7}藏ｰﾈ2氷Aﾅﾆﾙu_[･]$;XｾI.Ns+cｹYiｭｬ笏#ｷﾍ託2ﾓCｫ[Yｵn'ｵxｻｬUﾃLhV]ﾃ鼾a7袢ｷvw)lﾅｱﾟｸﾅ･ﾗｧﾜ2TﾙMｹl杯ｻ7ｶｪ6漬gｴWVeｵｯ~ｭl$e=ﾎｦｬ|ﾜaｹJｽﾚ~MK舶-{Z\｡<畝mﾗEﾒｮD'kﾎ纓vJｻｪ摶ﾀk%nｭ4[7yﾈ/uﾗ羇Ix怖5ｵｸ.KSN.v扛[ｸｿ樶ﾉｼｻﾒｿｫﾀﾍ翰ﾋb望$^ｬｳVVﾋｫｮｰ才a庠ｬlｴmk,ﾆ6ｭ樺束ﾛ$M民Mｯpﾇ[h失V7ﾌd-郛Ｃｮ椏b
w刔vruｱ^SKﾎ1幇祉ﾙnﾎ.ｰ\_I*ypﾖ"tＰ_ｬ拯ﾐR^)yZ9ｽTIﾎrCﾙ8ｻf6歴壼6oｮ8収sｯiyﾌﾘﾇT+jQmｷ2ﾎﾞ弁2ｫ堡ｱcｭ(MRｯqﾋｳ｣WV6_7ﾖｿn`sydNｴV岬ｳ-]ｿﾙｱﾘnh└oxﾍ>5ｺoｼYf嘩沁#ｪ`RW{ﾒｩNｴ偃M+[ｻｷｭj}_{ﾗ`y-.w媼3k畏ｶcﾅ{!Vﾜﾇxﾆ5ｾq指ﾜｹﾅ
裟雛ﾜ'GyﾊU~r譖睛ｦ迺=Iwr@紮Wﾋmﾗ檐ｼk	n;Lｫ*ﾊｫvｵf阡､嶮ﾂｼﾐ{ﾇ酲%x龜ﾈj\ﾄ~xｻKｽn貨n!ｹ'0fcUﾗﾔ. kﾅ&2ｮZXｭ)ｽ;ｻw瀲ｲｳ9ﾛZｷ麺rvｺｼﾉ3ォMpﾀ/?	ﾏ冉帋lｳ甸F:ｨW/ﾃﾑﾓ#ｿﾆ$ﾆ販-:ｩJﾑｩI`KGkﾔZﾚﾋｫ舗dж0f遘yｺｯIﾝｦ<->=z>kvｶﾓ<;y}!!kAﾓd|ｦOﾟ暼qｾzｶ笑fg>\ｹﾉD/gﾍ?蕎ｿｽvXｲ2ﾏ;#1宸Zｯo<,	俣ｺ｡ｾｿmｱ&ﾃ>ｹ	髮!"<ｽ('ﾊc囎8D	ｿ(ｾ!ｱ
L'硫ﾀ咫ﾗΔSz｢(B"佳0ﾀ2ｭｻ竜ｹpﾛk!>dTｻｹ@ｬｾ'(箸ｰ@｢!)<｡4&$?Lﾑ@ﾋ)?3,C'ﾄ<､4@､ARﾒ-ﾝc5|5;ｼｼ詆:｡橋ｧﾃﾁ鑚ｾ>Dl奎ACﾄｿ i荘ｨ?oﾃﾀvｻ"C斌｢ｻl奪｡
Z<衲ｦ#ﾅﾄCｼD8=鐚ｼGｬ践4Dﾚ@T4=ﾗ+@ｭ \ｻﾗﾃｯｻ bﾊ湧*Oｺﾃ7<(ﾛcl#TE!周H	eﾜ
f4揣cﾀｦﾅｪﾂｴ|=Yｳｪﾏｺｽ瘻F?l9ﾊX= 囎y､GBﾃﾂｵtﾜｻ癇9s5Tｪﾔ$DﾈУﾈｹｭaﾈﾈ禰a<:,{;簫1M\+Hｪ5f*Z､ﾎｴNA>Wﾅ迂ｾ愼+$｢郡/ﾅﾆﾅﾎﾎ,Iｲｱ^婉-Mﾟﾚﾉ膾ｷﾒz[ｴ-ﾖ団!=Eﾁ|ﾃ･ﾀ飴< ｢!ｩ､ﾍﾂ
ﾒ]ｭmﾛQﾕﾖ｡ﾄﾛgaｳsS3Kｽ%ﾜx3'ｽﾗﾓ擇ｻ}ﾞﾗﾃﾜｯｵﾛ&Pﾆ旃ﾟ昊5｡(ｴAｭRsP8ﾜ｡ｽﾓ在Xﾐ\ｮDｸﾏ悩ｳｪ･JQﾅTMｽﾟｪk-ｾI｣'=-M;Uﾃ+dﾓnｾ7ｽｿ(ﾓ闍ﾌ	杤Hﾅ*t"ｬｿﾇMDBﾒ|H~|ﾇ=ﾞﾇ{Y､UﾎmW\ｴ蝉/+Y｢<ﾗﾖﾈﾞ0ﾍG:p態G張L･`_}I{i;
ﾀｦﾕq纜T該ﾍHﾐ5XiｪC}桟
ﾗJIﾍ,ﾑ｢藺uﾓｯzﾅOUｱｮﾟt-T羞ｬ;G萬//ﾇ靨IU･:ｶ縅ﾚOvc
攪ｭM粒ﾝ+&(疼ZB.3ﾝｳﾍ\V7fﾛ]e饐刈ﾕ;ﾆ膈ﾝ｣婬ﾔ膂W媒#]ﾓ/ﾛPｷRｻ兩ｭ博暎9橦ﾆｳ_ｶ^`嬌隙ｴ､蠹Vﾝﾟ瞻ﾅ濘｡6ｽQm瀘C幟ﾑﾉ僕ｯ=
eVﾒｸﾛ0ﾞ1^jｼ'L!k-ﾌ_eﾟｳ姪ｩnXﾝ$髀M唸n|9ﾜｱﾘ/A]]ﾔh瓧ｳ舮ﾖﾒﾜICSﾄ鯑Mｿ.･iﾋ孔｢ﾑ`s?x
O.\RWN@D`#ｭQ5eD､ﾏNS衢犂4D\ﾏ9綱8uｩ愉Lﾅ;ｻ>ﾘ使@ｲﾄDｸﾍ楹｡袢矮於6忤饅ﾂ;/<ﾍN｣<ｩﾔ(qT誦茘ﾎｴ秬z~gｸ|6nX鑞｢ﾋﾝU=ﾃ/ﾜ継
rFdﾌﾒ､'[uﾖ2\Nﾉ5B3q<ｹ ﾗ=EﾛE&6lmﾉｵ\ｨｾn刎m
ﾄｦc]ﾌ筐ﾁ*ﾗrｸﾖﾏ石ｹ,ｮ譁ｮｻ=｡kd\ｱｮlﾖNPﾗvkGﾁ滉q%fa6ﾝ｣縣儲Rd]体ﾄSﾋﾖw\sﾎ$藝h^O!ﾟｧaﾎuZ荒ｪ置奕搓d5ﾎCﾈwM=bv2FB=惰d遨lﾑﾔ哺ﾚr+=[pOｧZ%ﾘ?樔\g=卜iw}2ｧﾒ>j9ﾌiV齷ﾆｼ&gqｩf#賞要uJ|ﾋ}pj那譲ﾌ[溏Tn迪.ﾞjﾍﾐﾛT1>fﾊｼj"oﾝ',_ｻ&ｧｺ^EFoj]@.評Q満ﾐﾓﾎｳS2v
`JﾓwﾇT^ｧ"ｦ_懍uﾟｷGﾉﾕ簿%S+_7mｫ?O7沍ﾙtﾂ･Pｾzｿzf4ｮﾜ三薨ｳ/,Oa~{HﾓﾐZﾇ	ｯｽ駭&k槐Cd"盟ﾓｧI\Dｩ_ﾓｷfjs'[燔ﾗﾅﾙ:2%^呂NQﾓﾙ<ﾆﾆViﾈｿﾔｷｼﾔ竈!V年ﾖ岸ｯｺ:ｼ]働ﾈ>ﾍ皷瓣fﾏnECO
綮｢4籖b>ﾄw.G=Re穀9pﾟﾙyﾓﾜﾖ｢戊	ｱb>7ﾌ~o^ﾍwﾙ
,hA*,ﾘp｡C,|(qE#^頌#ﾄ/nTX$ﾊ"!RL9ﾌ2gﾒｬi&ﾎ:w鴣'ﾐBcbtﾉ芯ﾂ｢FU2Eｪt)ﾊ徹扼ｸ彫R-G&jﾗｰbｱz=ZV篥ｴh*ﾝﾚﾕ葮ｸr醴ｭﾛ,ﾛｺx+Rｵ[Uﾅｽ\6ﾋwﾗﾁ}26ｯ篦?ﾂeﾛ､ﾈﾀ冠ﾞ5ﾋﾙrHｧ;|Lz(ﾔｪWｳｶIﾘ0ﾃ'sﾖ源ｩ獵ｳ#Oｮzﾕﾟｱ{3>\ﾙﾛ並踐;ﾖ*oｹﾍwGｸ隆''韶}sVｷ馭;z｡魏/扼v|粲_ｦﾛ=Tﾁ
)JUﾖs6 Rﾜ|ﾑmﾔF! W	00!& vｻ|`餮敢y(ﾛF攪`q9GoﾄI&RBﾘ`$(ｮ7ﾛy8rﾘQr昿Rｸ8`瓮ﾈｩR]gdY5JdZs;撹ﾘ／~儚泉¶7｣!ｦﾈｦy'/｢ｸｦdZ｢ﾗ葬6Y!卑｡G牌0ｽ莓L･ｵﾙQ[%ﾚ&Bj隍.ﾊｨ｡
)･ｒUﾞ浬鮒`}ｯ濠畝:G窖｣抔'彜	+^｣Y`lｬﾒ贏岌ﾆ:ﾑPｸ
ﾔ':痳u*)､柬J(ﾍ2驃-ke範
:ｭｶﾒ坊hZ膜ﾑ)ggｾ鑓櫁ﾂ逾槐	惻cｶ偃\ｰ｢喚ｼ*zｱﾆ駆ｿｦg鮓ﾙ"ﾌｭi\Z0ﾄ3ｩｴﾕRﾟ娯ﾙ淦ｾaYｽbﾙ悋ｾ8ﾉ蘓ﾜﾆ,ﾆﾈｲ塵囮轅ﾄK0ｰDﾓ~A;ﾛｨｶ>矩Lﾝ"}ｴ｢>3Lｽoﾌ燦妛ﾓ褂"ﾕ 幃j斬Oe熕遷ﾗcﾇ^{3U(繆ｮｪUﾋﾚuwﾇvgg3ﾘ5ﾆyｯ 巽ｩﾈ模6i+楫ｻ?Wｼ&敵齒ｫ)ｳp#x+ｿ%ｹ罍駒ﾘ闥ﾃ9踉ｾｶ%^ｺﾛﾛiﾅ懍|~pｶ樂2柆V棔cｭ	?<ﾅ;-觜^ﾆj`凱ﾝ髢ﾛnﾗﾏｽ7絲溲ﾟ椽ｼ豪ｧｾｺﾜqｿｪq寮>ﾗｶﾋDGW	IKｲ1ｨｹﾈ妙rK4%ｩIﾙ
ｰI･鬱I｡-F,潁ﾔ:IKtｶ	\l=ﾛiQ凱Liﾚ-aﾖ･3%ｨﾎU#━O]&ﾙ*ﾎｿH2Kﾜs･
W	･ﾆｸｱR&ﾐ^"ｴKｪZHLﾔ(｢ﾕwｲtST%塲d鍔ｦUiｷ)WE8ﾓ｡j建?4_4)ﾗｸﾒu嗽ﾍ｣1	ﾍ8ｨi#ｺ55ｫf呟ｦE寂~ﾈDA;ﾂVO｢鎖
kYﾌ昼ｳ5ｪq贓ﾑ致O?-絽ﾚmFqﾗｻc`_ｫ<ｶ*s投\ﾛ跛"2%l p+ﾜ
ｶx罹ﾄｻ鷏墅m.tｵg6ｽｽuｵﾖﾅlFZ｢ﾚrｷｻｨUｮwI+ﾙWｷｼ=(ﾘｭﾜｷｽ}/|uX艷裏-Kﾐwｿ	8ﾎ
ｦﾙ	ｼﾋn!ﾗｼkV	0c8Fﾖ答T(峺ﾑ-ｵvs+bGｷｵ仁B8塲@qQｨ伊'ﾋｪ鞏ﾗ割ﾈ7癌1ﾔｾm1ﾙ鋪PQｸｾ藁*uC'B馗到､聳韜ｰ
59"H%ﾖ｡m!ｧｧ]院輯nﾋ$ｭﾜQz槫1j詛 C鐐ｯx僣Fｾ3	俄ｧ$｣;却ﾃ9ｴkｩｴ房･*.ﾉｰｿ碯淀ｦﾑnY(fﾙｸﾋ暎ｳﾝ(夊DJz&&ﾚﾒ6騷ｮ景5ｵ0ｧ錣#zﾒ滾蟯	餃抻ﾑ&ﾖﾍH<ｺﾗｼvf8!ﾌBL3ﾎ鶚ｧ+ﾗ閘ｺｴRﾊﾞgv冤槙Ta.淙ｩQｻeﾘｶ$飃I]1j;嶮PgｳQﾊly杁溥ﾆr楪ﾑjｧ[Qhu-橦M:藷Bﾛ6+ﾏIgﾋ-ﾍｼﾆyO類	ｿ5ｐH8Tj;｣,鵡	fαｻ碆Vx!{fvﾜ瞶vｷ.問Sjb楡c>ｷl+蛭#t｣Uz4I!ﾊｫ叡ﾂh地G迺邨6w&ｭ蝎>3ﾇ融V黠龍ﾜM5｢∪Kｦ榕ｩ^OｵTVD=ｹheｩ`^輅ﾍﾗｯ｣kｹﾇ}ﾗt上ﾅﾀｦXｵｲsｷ;車ｿKｼぼr[蔕ｾﾑ續ｷI~,hｱ[1o$ｲﾌ3sﾍs＊嵒;/ﾎｿy｣/鶸NLQｮ=WF ｽwｼq{ﾁ迸ｻ=oｼiﾘﾆｷ0^
ｬﾞ3ｿﾎWｺ|b/wｯ]蓙7浣[箭3$X 粐ﾆ-~ｳ!%\yﾓB4ｽ_ｧo瓩0欣MeY_Q忠M傷滬`Xaｭ醗uE6ﾔ!平F僮厦ｭT鏖IﾈｹQqｲ枡ﾉﾘｮ 贔娉愾 ｵﾖﾚ
Z.}ｭﾚﾑ校｡ﾙ ﾘﾓｷ骨ｶﾚ,!ﾍ0=~
}6!ﾞ鸚R2W8Iｱ]ﾜﾅ萼U杲-Zﾉ]ｴ､UMﾒ	Jｴﾌｴﾕﾉi椎ﾟ^_ﾖ｡ｿ)泄	aﾇ\｡ﾆｼﾁﾛ~rｨﾜ ﾜ2ﾘ醤!$FbQﾍm 
ﾚｶ`簧EIﾏﾚﾅ｣u-ﾝﾓ=	]ﾎ｡啖y"崔]]a>!,ﾎ｢ﾖ｢,ﾚb,趙smYc(ｲ8-ﾞ｢0曩/X$6｣3劾=c襴｣ｽ`4^#66m#7ｪYﾟ0｣.笋8#9枋8｢8ｦ#;ｮ｣;團0ﾎW6ﾎ#=ﾖ｣=禳Qﾝ｣>#?聿$ﾎ;ｪ#<d;､A
$BdB$C､Bﾒ?F､DN$EﾘiU$Ff､F6繻9dC.､G$H惹C~dI贋I彫I跂Fｶ､Kｾ$Lﾆ､Lﾎ$M酌J｢膊ｪ$N､NdJdN%OBdM･Q･;antlr-2.7.7/doc/stream.splitter.gif0000644000175000017500000001262710522211615017204 0ustar  twernertwernerGIF89a"ｼｼｼﾌﾌﾌﾄﾄﾄﾀﾀﾀ,"@Hｰﾁ*\ﾈｰ｡ﾃ#J廩ｱ｢ﾅ3jﾜﾈｱ｣ﾇ +"IFTｹﾁ,ﾆi膈8sﾜﾉｳｧﾏ檗/ﾞ,ｩﾑ萢XｵhiR:]<ｺ4ｨﾕｫXｳ>DPUｫWｬ]憤ﾘU&Jｧbﾎ,ﾛ)ﾒｴ8Mr斃Uﾗｻxｶｫｷ/PｶﾝﾚﾊQSｲQ_=ｰﾟﾇ星Vuｹ2EﾊLﾏｾ%ﾜR`ﾄ9
ｵLｺ4OﾌQ广[sbｧｰcﾋFy薺ｧGsﾟﾖﾚfmﾛｳﾟ泡びｫ+/wｹ醫UCﾝ.ﾘｯｳｽY7ｻﾈkｿ_yｻD鱠ﾓEｯｾｽ{ﾙ[Oｿ~}kv'Z&~ｰw朸ﾆﾇgEZgﾜ亦A墸炙rﾅﾗQM棠!Yｯﾁｴ噐ｶ｡By4b~確6bk*^ﾛH'BH\R+ｦHUﾉ^)~ｶ"衡氷^織営KM`[坪經?fﾈ艚M6笏$I嚼iｩ.h;緬ﾟ断]yfてi鐫oGﾒ烟nNY'夂'YgQ%寞ﾁxaB､喙7ｺﾘｧM{頂fjｰｽｴcgmVﾙeo
7ｧ&6b\H纐硲y&i伐☆h5fﾘｩ6.J(kaﾘ｡ｭｼﾂ雅:D勞=嬾ｼ,Uｷ)uﾛｲﾊF帋擁b
mｲﾉﾂ=v+ｵ｡ﾖ,淙b{堂ﾆ｢gﾏ~ｮｹ檢nRｭﾚｧ)ｧｹjｾN ~ｿlﾁ[揉ﾂ絋lｪ_WﾃWﾜSﾄY麌ﾆ|Yﾇ褶(gfWr秒｢5ﾗﾆ^qﾋｹﾜ$~M
ﾈxﾞｬ3ﾂ2嶌鑰;隷ﾘh+鏑Vﾑ"-]+ﾕu醵aﾍ4笛s95ﾕﾝ!-0軍kｭuﾐnｭdjvﾙh淇(｢={tWc\_ﾋ､痴;佐ｾmU6ﾔM釛冴
ｸﾝmΟxﾌ7网yJｸﾑ&i8胞ﾊｺﾟ艾_-ﾌkﾆ
隍7肺鬨7囃ｱﾗ鬩ﾇｲ臠% iﾎ"Uj飄｢ﾉ:zｴﾝｻﾋHjﾃ'O"ｻcﾒﾔcﾝﾀﾏ旨ﾓﾄ<余?ｽﾈ遨Y8{ﾅｴ_j瑠渮{ﾜρ/弱ﾇllｸﾃﾕ/iｸsｳ+vg	?ｻ(ﾙBuｿXQﾉ}
=~\炯A蛻ｯVｿO}!qA夸э	弃ﾈB)ｪ^#,矢J｣ﾂ<ｬQﾛ^ﾈ*9ｨ^52耳ｨ#敏u勲R蛎j虎A
粱Luz[ﾉtﾉ0ｽ拠ﾍz8ｶ祈ﾟ8GBｦ8ｻmｦﾄ鰍yｩ!ﾊrﾃｸdﾋ#[tﾀ\	L糒ﾄTﾆ覈q祉;bIN･Q%ﾑ､ﾏx!ｦ*肯ﾌW･ﾘﾅKn焔"｢ﾆ(ｹﾃGｾﾐ竹｢Dr:/ｶJAW,11ﾂ再ﾋ^Bｯsｾｦ韶ｵJ'
傑32ﾁ.et覈#>Jﾌｴ5%｣kz\5Q(ﾇ卒鎰ｧ9$uｺ晤T<QF著>i"=憚鳬徇｡ﾟiﾃ}40｡!烏5.嘆ｿｴ>埃隠
]棺 E7ﾚﾀﾈｽ誚嗣ﾞO&ﾒ爪今tｦｫ<ｨﾌidbJ/NﾁD8ｵ殪,ｺ8rｧ@葺ｻﾓ(~1^沿&ｿ%ms}ﾓ瑞ﾔｪDr｡3ｩ熹5ｨ$UｫKﾝ\WｸB1o>ｵｪZyｷﾖｶｺｭpﾍ$2%ﾗｭMｦ｢k\ﾉ&ｦ鐵#^郤ｾ@陸ﾖ`緩ﾅ2Y<=ｬ1YH3ﾓ･跳｡]c%ｬﾈｬ毋Tﾋe緊ﾆﾞ96w.,>=/ﾐﾎﾔ@跋ｧM[ﾗﾌｨﾌuｪE,@XｾHb1夬斗s;ｱQ6*｣蜻o騒ﾄba&造ﾗﾛﾂﾖﾖｲｱEｮ口ﾜxｲxﾁEﾉq:ｪI^W%4BtDﾘRﾘiﾓ>
Us煤RX$-ｷ8C鑪#H7NT$hn悶蒿yyiｸ譲tI9QgF提0SX1-x~鑷xZﾒXQﾖЯ8&\HS8Ｂ廚X5栄云HJｦ揺運8渦H!8革H寒x勘ｨ'xﾑ%ｪVｴCHA侠"桶ﾘ/3yﾅ協vWｹｸQ疇ｹ3ﾄXpﾆ掘･Y６#Fvﾌ%\ﾊ(袴彩%fｶp27昨ﾄ庫貢ﾖ故ﾕgﾜH<鏥Y讎X'Z^R射鋒ｮ斌ﾀ~k=s揚ﾒ(絶臭x\溢ｨ落ﾖmｸSW)w蒋s芸,ｹP?錢ｮE迅f畝p"飆AByh""pcs*ｩ+x]ﾒQ3ｫｒw8!-\	ｹF儷B2ォΩ(摺ｶ壌剩/wq8EvB<&ﾗ敦Sf8ｹ鞄BS9PLﾉjK9呆ﾗ&A郵VIXiｹ>ｹ姫)aW3ﾉgTy年Y翰'dvY>髟bY}ｷ'{ﾙ2z倭Ixb､Rﾘ.に~網~｡,iS劭｢-\{乂6в+!/vﾆｨ士~	>ﾍtv慄+uWﾍd-譲yt5v喃w听8柏hｨY+jﾘ%&ｾ餉ﾌ2ｨ憙"P瀦蟋､ｯwn7nｹ屹俣ﾗ往B葡ﾑﾙdﾜﾙ昃ｩ帋	]}EY檍gﾙ~5ｨ7Wn爰挺ｩd(ﾙ柢駻i"ﾔw}ｹ渺Y曉ｹaﾖhVZbshiﾆ愆"d{ﾈt(/&｡ﾜ閖[◆ｪN/ｺ｡蔬}｢､ﾘ｡L｡z~ﾟ	wD$｢ｬD｢蓴#驩>ﾐg｢6ﾗtY站B｡｣'國 逎#枳g｣/ﾗHqﾖS.ｺﾅUKImFﾊ#M)ﾑq､/ｳ$mGWgDﾊ;纓Xﾀf冕ymil!ﾖu_I_ﾘ労ｺ:x=wo荼qyz副｡｢ｵｭ薫*uﾅIH熔努Rｼﾉ毳 廛p<7Dｨyﾅ~0ｼ･dfwo垣8s蛭}ッLﾕmf鋭Sｧr丁 ﾏｩﾋ#wｷ畠w痙ｭｷh{B)rdﾊo3Vi:ｧ	C朦zｧ白sﾊEｩｪｺrе册XИfﾅｩﾘ付駱Iw歟9YsTﾁ圖ﾄziｬ､hﾉZuｿ"ｳ*@ｪpテｫsｹjrZ妙畛ｫB!∵Evwhｭ4觜oﾊjｧｪｶhﾘｪ|ﾆE7\E20ｵｰmﾚ\lﾊjFDdｬXｱQﾖv鋸辞
t詼ヱｪｮTl;･Tb具R減HW番'ｫR述ｴAﾄo9}ZJ屋ﾍｱﾜ薑"ｦﾌzmｭR背ｲ拮☆I蚕4ｯﾇｺyｼ:Ih･i]ｰ98｡[ｳ=ｯ?ｵ(ｰ>3ｲjｰ槙	mGｸｯa尸梔!9ｱ:娯wbｶi亰]Bｴ`k[ﾈJ)ｻJ踏tQk経'･ｫ臙ｭｺｺ講qiaTｧｵｦcｷｸﾂﾆｪgﾛf皆 4ｲ拐ｴ天敏jｯ･1ﾑ
j{zｩ呱ｪｱ2ｲ{ｮﾋr-ｷ$(ｷxJ嚏ﾊ恤x>｣Gｬｺ_KｼdKｲｴkｲEﾔ*ｺｺｫｹｹ下BｳZｹ"ｼﾛｷﾅｻ|ﾛｹ(<ｸ]棋~<ﾔｸt{ｺ"勸框ｭﾆk[ｭﾋ萌ﾛpﾞｫｦ朱ｲvzﾟﾚ=B)ｽOY 輳ﾚ=ｾV鼻ﾋｾ(ﾎjO窖~$Wm堤8>^[佼kｦﾏ价-Q[,Wﾇlｶﾇ?剽.@3ｺﾇｻ｢漢ｨAｫ- 巉辰mｱ_ｲﾁ
Ce戉b`/ｻ'ﾄ0ｱI.ﾌﾂﾈ鯏R-ﾍcﾃ`U@窿)
ﾖ*3鯀cｶK7{&.丁熹ﾑ+二UD+\ﾆｽ1･tfqﾟt#ｹﾉﾒRﾆz<rﾅVで=ｬｮ
ｸﾇ4|U.:+fS蜀ﾋlｵS[ﾇｸﾉzﾇﾅAﾉﾛ)o癜i｢M{ﾉCｼ弗ｹﾒSye,ｺeｮｨﾊｰﾈﾊﾒ鯡;x!*ｮ"Sﾈ0j圖lﾋｷ戸ｴｬ<(ｺﾋ;IkﾌﾌｱﾈvGﾌｩｸmﾃのｧb5ﾉﾌ%
7ﾍχ<
zﾍｨｺﾚL.ﾘﾍﾚADｫﾆ1ｿL｢<ﾈ･K
ﾎ-ｺｼKﾙｻ讖ﾎ｢ﾈﾎoﾃu
ﾏHｺｼｾ駘ﾏｯ"ΡﾇuﾈﾏfVL:ｰ訓醫,ﾐ
拔ﾓｫｳ:#ﾐ-ｧ{ﾑ[ｪGﾘｰXﾈ!険}Uﾑﾍn;ｻШﾘｶUｯﾒ"ﾃ?(g)姨$$*
2Hﾐj9lｻｲgｸ7Mｹ-]ｳ-ｿ|3Q9ﾔﾟ|1｡孀ｨ､33ｪﾔ,ｨﾔ{ﾐR
=UﾕV易ﾀfﾙﾘNﾐaﾕ嚢Om^ﾍ｣xbﾍｺﾒDﾂg斎ｻﾈﾟ6жﾋ
笈H;3途Vx3=V;-弯>h兄」M)Ч亳(Uh挟e袷蔆｡zﾘｬｲ<
ﾖ+腿'ﾓ]ﾙ｣ﾍﾙ`ｸ宕酲,ﾉ^剣!ｵX}ｭk◎]ﾗBwm)ｲ<~ﾍﾘ9ﾛｪﾉｼﾚ焙决ｦMDﾖ;廊ｶﾙﾜｫ鰤_gﾊﾝ:z{UM狛hLﾜﾚﾑr旌痞9ﾝﾞ-鐘ｮﾞ鼇ｾ3\ﾝ跫柎ﾋ離ﾟﾅ呑ｭｶﾘ楮ﾞQｧ諾ZH侖挿Tzｭﾟ淒ﾟ2	ﾚ"ﾚMﾚn璋ｻ｢ｽｭｵﾍｭ]ﾚ精ｵ|=ﾙ-	$ｨ na<簍h簗Xﾞ(>d(ｸ.至;antlr-2.7.7/doc/closure.gif0000644000175000017500000000416610522211615015517 0ustar  twernertwernerGIF89a｣ﾅｼｼｼﾄﾄﾄﾀﾀﾀ,｣ﾅ@Hｰﾁ*\ﾈｰ｡ﾃ#J廩ｱ｢ﾅ3JDｱ｣ﾇ9Ｕ(r､ﾉQ.,艶･ﾊ]ｶ9S｡L8ﾞ匍猥?{
ThQ*･H4#6eTｩU｣+!ZItkﾍО｣.囎餠ｬdﾁｾD v,ﾆｴXｩv|
5∂ｻxﾝ+ﾖnﾒｷq5ﾂ
q0a插NLpq羞P｣:~ﾌ乘ﾖ･ｻｪmV*猝'g^ﾛVhﾐ)ﾛ瑳ｷｵｻ}ｽhpmﾔ徠Gｼｭﾛf仭O;<ｸO縒-o)Y0票｣K戎ｴu?ｧkﾟ~ｹﾉ:ﾊ慈ｺXｿ^ﾏzｬg耆欅_k}ﾂ焉ｾ:7ﾚﾙ梨Qｸﾘ櫟O
7U~$ﾙ4g.5ﾅﾒMUｵW寉｡}z｢yEﾟ筵wﾞz,FF夕ｴ'bo3ｮe焉儼cピﾉxﾙ
脳d翡丱(u｣r>ﾒ肪{-ｲ俥6ycЖ^影}5籔e短ny"mﾜ品誡_
dK&ﾙ!Rf6f皴岬廨%)ﾞ桍*陟j陦k擠陲6麌｣ﾄ!祢ﾜ>ｪ鬥忻ｷ_ぁ"`､｡:*ｦ姜z*ｨｩ滑b
ｺ*ｬ･nﾔｩ剴ｾﾚS〈2鞅･ｱ笏擧8*W押・,MｼRxUｳﾘd^U垠,ｳkJ[kH鉉Xg|:B&Vｵ\f;ﾒ却Z%m皷%{Sj.ｸ芳ｻｮｫ嗚%ｾ{+wｹ;ｧp&;&等稱ﾝ舌<ﾟｭﾊｭO^_ｸl~+ﾝｴu捜pｯ~6<ﾅ#ｶZｺﾋ.^ｾﾛZz臆ﾊ~\ﾃRｰｪ+p｡:穆ﾏｲ
ｴﾑ  ﾒﾜ\ﾉﾞﾁ･0ｴ\q､0ｷ;LhwﾐioKDｭ蜴aﾗﾒ嘲6挿ﾅ2ﾋ~eｭｹ)ｾ2ﾛﾏｭﾞ|ﾟ.焙ﾛXｶﾘﾞｮ/>T綫ﾑ
qｨN5繹:+謗=苟l笶oｭ纖ｺ9･k~ｺｰ｣ｻ9遑=;ｵ{ｻ皴ｫ:鮖宀;ｩｺ:ｽ^Xqﾇ証ﾌﾂ｡r`ｴqﾊ?]t7ﾖ貘ﾟ
5v3ｨlﾞbﾒy_ｩｵAW%5杁kｶw^ｾｳ;鉈_X螫Jr:驪ｷsｵﾏ{ｻ^蘿-蛭|NQ`葵3閻5ﾆBVｰ騏p釆滿GｲｷｰM0僑g8ﾃｻｰEzﾅｲ决ﾞCﾐﾔ貯	Eｸｼrﾐゥｴ蛮uｳ$gﾂ｣呵th;)V相ｺﾃbﾒｾﾃ<ｦ･\8ﾄﾞ	ﾕEﾂﾛ,ﾑ)ﾎｱ@ﾈB顕U%ﾒJHF-fNA(F'殉jﾔgｺﾕﾆｨ]r#s(8Dz!lLcpﾞ扎>ｲ骨ﾔ
%Jﾒ麹悧剏ｸ筆^ﾒ康yW	DｿLｩ積甌XTﾄﾊZﾆ0!t､`Hｽ:子漢ｼb0ｳ8ﾌ(ﾚﾑwP駁蛾G`6S佰dｦ.Gﾓx^ﾄf2損LcS燮萼a9ｼIuq嵬寞CｩOB=R<7｢杤bﾒ陽4軽ｴ夕ITﾆ,ｳGﾊS鑑+]Tﾀbﾊﾉﾕｩ*pｴ	-ﾇ ｲﾔrｫ$#1j@柵謄ﾕ､ﾈ@
A^&蘚5ﾐ巾[|$ifh$淋ﾐ]<帝M:麾;antlr-2.7.7/doc/metalang.html0000644000175000017500000013176210522211615016035 0ustar  twernertwerner


	
	ANTLR Specification: Meta Language 




  ANTLR Meta-Language



	ANTLR accepts three types of grammar specifications -- parsers, lexers, and tree-parsers (also called tree-walkers). Because ANTLR uses LL(k) analysis for all three grammar variants, the grammar specifications are similar, and the generated lexers and parsers behave similarly.  The generated recognizers are human-readable and you can consult the output to clear up many of your questions about ANTLR's behavior.



    Meta-Language Vocabulary  



 Whitespace.  Spaces, tabs, and newlines are separators in that they can separate ANTLR vocabulary symbols such as identifiers, but are ignored beyond that. For example, "FirstName LastName" appears as a sequence of two token references to ANTLR not token reference, space, followed by token reference.




 Comments.  ANTLR accepts C-style block comments and C++-style line comments. Java-style documenting comments are allowed on grammar classes and rules, which are passed to the generated output if requested. For example,



/**This grammar recognizes simple expressions
 * @author Terence Parr
 */
class ExprParser;

/**Match a factor */
factor : ... ;



 Characters.  Character literals are specified just like in Java. They may contain octal-escape characters (e.g., '\377'), Unicode characters (e.g., '\uFF00'), and the usual special character escapes recognized by Java ('\b', '\r', '\t', '\n', '\f', '\'', '\\'). In lexer rules, single quotes represent a character to be matched on the input character stream. Single-quoted characters are not supported in parser rules.




End of file. The EOF token is automatically generated for use in parser rules:



rule : (statement)+ EOF;



You can test for EOF_CHAR in actions of lexer rules:



// make sure nothing but newline or
// EOF is past the #endif
ENDIF
{
  boolean eol=false;
}
     :   "#endif"
         ( ('\n' | '\r') {eol=true;} )?
         {
           if (!eol) {
             if (LA(1)==EOF_CHAR) {error("EOF");}
             else {error("Invalid chars");}
           }
         }
     ;



While you can test for end-of-file as a character, it is not really a character--it is a condition.  You should instead override CharScanner.uponEOF(), in your lexer grammar:



/** This method is called by YourLexer.nextToken()
 *  when the lexer has
 * hit EOF condition. EOF is NOT a character.
 * This method is not called if EOF is reached
 * during syntactic predicate evaluation or during
 * evaluation of normal lexical rules, which
 * presumably would be an IOException. This
 * traps the "normal" EOF * condition.
 *
 * uponEOF() is called after the complete evaluation
 * of the previous token and only if your parser asks
 * for another token beyond that last non-EOF token.
 *
 * You might want to throw token or char stream
 * exceptions like: "Heh, premature eof" or a retry
 * stream exception ("I found the end of this file,
 * go back to referencing file").
 */
public void uponEOF()
  throws TokenStreamException, CharStreamException
{
}



The end-of-file situation is a bit nutty (since version 2.7.1) because Terence used -1 as a char not an int (-1 is '\uFFFF'...oops).




Strings.  String literals are sequences of characters enclosed in double quotes. The characters in the string may be represented using the same escapes (octal, Unicode, etc.) that are valid in character literals.  Currently, ANTLR does not actually allow Unicode characters within string literals (you have to use the escape).  This is because the antlr.g file sets the charVocabulary option
to ascii.




In lexer rules, strings are interpreted as sequences of characters to be matched on the input character stream (e.g., "for" is equivalent to 'f' 'o' 'r').




In parser rules, strings represent tokens, and each unique string is assigned a token type. However, ANTLR does not create lexer rules to match the strings. Instead, ANTLR enters the strings into a literals table in the associated lexer. ANTLR will generate code to test the text of each token against the literals table, and change the token type when a match is encountered before handing the token off to the parser. You may also perform the test manually -- the automatic code-generation is controllable by a  lexer option.




You may want to use the token type value of a string literal in your actions, for example in the synchronization part of an error-handler. For string literals that consist of alphabetic characters only, the string literal value will be a constant with a name like LITERAL_xxx, where xxx is the name of the token. For example, the literal "return" will have an associated value of LITERAL_return.   You may also assign a specific label to a literal using the tokens section.




 Token references.  Identifiers beginning with an uppercase letter are token references. The subsequent characters may be any letter, digit, or underscore. A token reference in a parser rule results in matching the specified token. A token reference in a lexer rule results in a call to the lexer rule for matching the characters of the token. In other words, token references in the lexer are treated as rule references.




 Token definitions.  Token definitions in a lexer have the same syntax as parser rule definitions, but refer to tokens, not parser rules. For example,



class MyParser extends Parser;
idList : ( ID )+;   // parser rule definition

class MyLexer extends Lexer;
ID : ( 'a'..'z' )+ ;   // token definition    



 Rule references.  Identifiers beginning with a lowercase letter are references to ANTLR parser rules. The subsequent characters may be any letter, digit, or underscore. Lexical rules may not reference parser rules.




 Actions.  Character sequences enclosed in (possibly nested) curly braces are semantic actions. Curly braces within string and character literals are not action delimiters.




 Arguments Actions.  Character sequences in (possibly nested) square brackets are rule argument actions. Square braces within string and character literals are not action delimiters. The arguments within [] are specified using the syntax of the generated language, and should be separated by commas.



codeBlock
[int scope, String name] // input arguments
returns [int x]          // return values
: ... ;

// pass 2 args, get return
testcblock
{int y;}
	:	y=cblock[1,"John"]
	;




Many people would prefer that we use normal parentheses for arguments, but parentheses are best used as grammatical grouping symbols for EBNF.




 Symbols.  The following table summarizes punctuation and keywords in ANTLR.






	

		

			
				Symbol
			
			
				Description
			
		

		

			
				(...)
			
			
				subrule
			
		

		

			
				(...)*
			
			
				closure subrule zero-or-more
			
		

		

			
				(...)+
			
			
				positive closure subrule one-or-more
			
		

		

			
				(...)?
			
			
				optional zero-or-one
			
		

		

			
				{...}
			
			
				semantic action
			
		

		

			
				[...]
			
			
				rule arguments
			
		

		

			
				{...}?
			
			
				semantic predicate
			
		

		

			
				(...)=>
			
			
				syntactic predicate
			
		

		

			
				|
			
			
				alternative operator
			
		

		

			
				..
			
			
				range operator
			
		

		

			
				~
			
			
				not operator
			
		

		

			
				.
			
			
				wildcard
			
		

		

			
				=
			
			
				assignment operator
			
		

		

			
				:
			
			
				label operator, rule start
			
		

		

			
				;
			
			
				rule end
			
		

		

			
				<...>
			
			
				element option
			
		

		

			
				class
			
			
				grammar class
			
		

		

			
				extends
			
			
				specifies grammar base class
			
		

		

			
				returns
			
			
				specifies return type of rule
			
		

		

			
				options
			
			
				options section
			
		

		

			
				tokens
			
			
				tokens section
			
		

		

			
				header
			
			
				header section
			
		

		

			
				tokens
			
			
				token definition section
			
		

	






    Header Section  



A header section contains source code that must be placed before any ANTLR-generated code in the output parser. This is mainly useful for C++ output due to its requirement that elements be declared before being referenced. In Java, this can be used to specify a package for the resulting parser, and any imported classes. A header section looks like:



header {
  source code in the language generated by ANTLR;
}  



The header section is the first section in a grammar file. Depending on the
selected target language more types of header sections might be possible.
See the respective addendums.



    Parser Class Definitions 




All parser rules must be associated with a parser class. A grammar (.g)
file may contain only one parser class definitions (along
with lexers and tree-parsers). A parser class specification precedes the
options and rule definitions of the parser. A parser specification in a
grammar file often looks like:




{ optional class code preamble }
class YourParserClass extends Parser;
options
tokens
{ optional action for instance vars/methods }
parser rules...    



When generating code in an object-oriented language, parser classes result
in classes in the output, and rules become member methods of the class. In C, classes would result in structs, and some name-mangling would be used to make the resulting rule functions globally unique.




The optional class preamble is some arbitrary text enclosed in {}. The preamble, if it exists, will be output to the generated class file immediately before the definition of the class.




Enclosing curly braces are not used to delimit the class because it is hard to associate the trailing right curly brace at the bottom of a file with the left curly brace at the top of the file. Instead, a parser class is assumed to continue until the next class statement.




You may specify a parser superclass that is used as the superclass fo the generate parser.  The superclass must be fully-qualified and in double-quotes; it must itself be a subclass of antlr.LLkParser.  For example,


class TinyCParser extends Parser("antlr.debug.ParseTreeDebugParser");




    Lexical Analyzer Class Definitions 



A parser class results in parser objects that know how to apply the associated grammatical structure to an input stream of tokens. To perform lexical analysis, you need to specify a lexer class that describes how to break up the input character stream into a stream of tokens. The syntax is similar to that of a parser class:




{ optional class code preamble }
class YourLexerClass extends Lexer;
options
tokens
{ optional action for instance vars/methods }
lexer rules...




Lexical rules contained within a lexer class become member methods in the
generated class. Each grammar (.g) file may contain only one lexer class.
The parser and lexer classes may appear in any order.





The optional class preamble is some arbitrary text enclosed in {}. The preamble, if it exists, will be output to the generated class file immediately before the definition of the class.





You may specify a lexer superclass that is used as the superclass for the generate lexer.  The superclass must be fully-qualified and in double-quotes; it must itself be a subclass of antlr.CharScanner.


    Tree-parser Class Definitions 




A tree-parser is like a parser, except that is processes a two-dimensional
tree of AST nodes instead of a one-dimensional stream of tokens. Tree
parsers are specified identically to parsers, except that the rule
definitions may contain a  special form 
to indicate descent into the tree. Again only one tree parser may be
specified per grammar (.g) file.




{ optional class code preamble }
class YourTreeParserClass extends TreeParser;
options
tokens
{ optional action for instance vars/methods }
tree parser rules...



You may specify a tree parser superclass that is used as the superclass for the generate tree parser.  The superclass must be fully-qualified and in double-quotes; it must itself be a subclass of antlr.TreeParser.


    Options Section 



Rather than have the programmer specify a bunch of command-line arguments to the parser generator, an  options section  within the grammar itself serves this purpose. This solution is preferable because it associates the required options with the grammar rather than ANTLR invocation. The section is preceded by the options keyword and contains a series of option/value assignments. An options section may be specified on both a per-file, per-grammar, per-rule, and per-subrule basis.




You may also specify an option on an element, such as a token reference.



  Tokens Section 



If you need to define an "imaginary" token, one that has no corresponding real input symbol, use the tokens section to define them.  Imaginary tokens are used often for tree nodes that mark or group a subtree resulting from real input.  For example, you may decide to have an EXPR node be the root of every expression subtree and DECL for declaration subtrees for easy reference during tree walking.  Because there is no corresponding input symbol for EXPR, you cannot reference it in the grammar to implicitly define it.  Use the following to define those imaginary tokens.



tokens {
    EXPR;
    DECL;
}



The formal syntax is:



tokenSpec : "tokens" LCURLY
            (tokenItem SEMI)+
            RCURLY
          ;

tokenItem : TOKEN ASSIGN STRING (tokensSpecOptions)?
          | TOKEN  (tokensSpecOptions)?
          | STRING (tokensSpecOptions)?
          ;
 
tokensSpecOptions
          : "<"
              id ASSIGN optionValue
              ( SEMI id ASSIGN optionValue )*
            ">"
          ;



You can also define literals in this section and, most importantly, assign to them a valid label as in the following example.



tokens {
    KEYWORD_VOID="void";
    EXPR;
    DECL;
    INT="int";
}



Strings defined in this way are treated just as if you had referenced them in the parser.




If a grammar imports a vocabulary containing a token, say  T, then you may attach a literal to that token type simply by adding  T="a literal" to the tokens section of the grammar.  Similarly, if the imported vocabulary defines a literal, say "_int32", without a label, you may attach a label via INT32="_int32" in the tokens section.




You may define options on the tokens defined in the tokens section.  The only option available so far is AST=class-type-to-instantiate.



// Define a bunch of specific AST nodes to build.
// Can override at actual reference of tokens in
// grammar.
tokens {
    PLUS<AST=PLUSNode>;
    STAR<AST=MULTNode>;
}
 
    Grammar Inheritance  



Object-oriented programming languages such as C++ and Java allow you to define a new object as it differs from an existing object, which provides a number of benefits. "Programming by difference" saves development/testing time and future changes to the  base  or  superclass  are automatically propagated to the  derived  or  subclass. ANTLR= supports  grammar inheritance  as a mechanism for creating a new grammar class based on a base class. Both the grammatical structure and the actions associated with the grammar may be altered independently.



    Rule Definitions 



Because ANTLR considers lexical analysis to be parsing on a character stream, both lexer and parser rules may be discussed simultaneously. When speaking generically about rules, we will use the term  atom  to mean an element from the input stream (be they characters or tokens).




The structure of an input stream of atoms is specified by a set of mutually-referential rules. Each rule has a name, optionally a set of arguments, optionally a "throws" clause, optionally an init-action, optionally a return value, and an alternative or alternatives. Each alternative contains a series of elements that specify what to match and where.




The basic form of an ANTLR rule is:



rulename
    :   alternative_1
    |   alternative_2
   ...
    |   alternative_n
    ;    



If parameters are required for the rule, use the following form:



rulename[formal parameters] : ... ;



If you want to return a value from the rule, use the returns keyword:



rulename returns [type id] : ... ;    



where type is a type specifier of the generated language, and id is a valid identifier of the generated language. In Java, a single type identifier would suffice most of the time, but returning an array of strings, for example, would require brackets:



ids returns [String[] s]: ( ID {...} )* ;    



Also, when generating C++, the return type could be complex such as:



ids returns [char *[] s]: ... ;    



The id of the returns statement is passed to the output code. An action may assign directly to this id to set the return value.  Do not use a return instruction in an action.




To specify that your parser (or tree parser rule) can throw a non-ANTLR specific exception, use the exceptions clause.  For example, here is a simple parser specification with a rule that throws MyException:



class P extends Parser;

a throws MyException
  : A
  ;



ANTLR generates the following for rule a:



    public final void a()
        throws RecognitionException,
               TokenStreamException,
               MyException
    {
        try {
            match(A);
        }
        catch (RecognitionException ex) {
            reportError(ex);
            consume();
            consumeUntil(_tokenSet_0);
        }
    }



Lexer rules may not specify exceptions.




Init-actions are specified before the colon. Init-actions differ from normal actions because they are always executed regardless of guess mode. In addition, they are suitable for local variable definitions.



rule
{
    init-action
}
    :   ...
    ;    



 Lexer rules.  Rules defined within a lexer grammar must have a name beginning with an uppercase letter. These rules implicitly match characters on the input stream instead of tokens on the token stream. Referenced grammar elements include token references (implicit lexer rule references), characters, and strings. Lexer rules are processed in the exact same manner as parser rules and, hence, may specify arguments and return values; further, lexer rules can also have local variables and use recursion. See more about  lexical analysis with ANTLR.




 Parser rules.  Parser rules apply structure to a stream of tokens whereas lexer rules apply structure to a stream of characters. Parser rules, therefore, must not reference character literals. Double-quoted strings in parser rules are considered token references and force ANTLR to squirrel away the string literal into a table that can be checked by actions in the associated lexer.




All parser rules must begin with lowercase letters.




  Tree-parser rules.  In a tree-parser, an additional special syntax is allowed to specify the match of a two-dimensional structure. Whereas a parser rule may look like:



rule : A B C;    



which means "match A B and C sequentially", a tree-parser rule may also use the syntax:



rule : #(A B C);  



which means "match a node of type A, and then descend into its list of children and match B and C". This notation can be nested arbitrarily, using #(...) anywhere an EBNF construct could be used, for example:



rule : #(A B #(C D (E)*) );      
 
    Atomic Production elements  



 Character literal.  A character literal can only be referred to within a lexer rule. The single character is matched on the character input stream. There are no need to escape regular expression meta symbols because regular expressions are not used to match lexical atoms. For example, '{' need not have an escape as you are specifying the literal character to match. Meta symbols are used outside of characters and string literals to specify lexical structure.




All characters that you reference are implicitly added to the overall character vocabulary (see option charVocabulary).  The vocabulary comes into play when you reference the wildcard character, '.', or ~c ("every character but c").


You do not have to treat Unicode character literals specially.  Just reference them as you would any other character literal.  For example, here is a rule called LETTER that matches characters considered Unicode letters:



protected
LETTER
    :   '\u0024' |
        '\u0041'..'\u005a' |
        '\u005f' |
        '\u0061'..'\u007a' |
        '\u00c0'..'\u00d6' |
        '\u00d8'..'\u00f6' |
        '\u00f8'..'\u00ff' |
        '\u0100'..'\u1fff' |
        '\u3040'..'\u318f' |
        '\u3300'..'\u337f' |
        '\u3400'..'\u3d2d' |
        '\u4e00'..'\u9fff' |
        '\uf900'..'\ufaff'
    ;



You can reference this rule from another rule:



ID  :   (LETTER)+
    ;



ANTLR will generate code that tests the input characters against a bit set created in the lexer object.


 String literal.  Referring to a string literal within a parser rule defines a token type for the string literal, and causes the string literal to be placed in a hash table of the associated lexer. The associated lexer will have an automated check against every matched token to see if it matches a literal.  If so, the token type for that token is set to the token type for that literal defintion imported from the parser.  You may turn off the automatic checking and do it yourself in a convenient rule like ID.  References to string literals within the parser may be suffixed with an element option; see token references below.




Referring to a string within a lexer rule matches the indicated sequence of characters and is a shorthand notation. For example, consider the following lexer rule definition:



BEGIN : "begin" ;



This rule can be rewritten in a functionally equivalent manner:



BEGIN : 'b' 'e' 'g' 'i' 'n' ;    



There are no need to escape regular expression meta symbols because regular expressions are not used to match characters in the lexer.




  Token reference.  Referencing a token in a parser rule implies that you want to recognize a token with the specified token type. This does not actually call the associated lexer rule--the lexical analysis phase delivers a stream of tokens to the parser.




A token reference within a lexer rule implies a method call to that rule, and carries the same analysis semantics as a rule reference within a parser. In this situation, you may specify rule arguments and return values. See the next section on rule references.




You may also specify an option on a token reference.  Currently, you can only specify the AST node type to create from the token.  For example, the following rule instructs ANTLR to build INTNode objects from the INT reference:



i : INT<AST=INTNode> ;



The syntax of an element option is



<option=value; option=value; ...>



 Wildcard.  The "." wildcard within a parser rule matches any single token; within a lexer rule it matches any single character. For example, this matches any single token between the B and C:



r : A B . C;



    Simple Production elements  



 Rule reference.  Referencing a rule implies a method call to that rule at that point in the parse. You may pass parameters and obtain return values. For example, formal and actual parameters are specified within square brackets:



funcdef
    :   type ID "(" args ")" block[1]
    ;
block[int scope]
    :   "begin" ... {/*use arg scope/*} "end"
    ;



Return values that are stored into variables use a simple assignment notation:



set
{ Vector ids=null; }  // init-action
    :  "(" ids=idList ")"
    ;
idList returns [Vector strs]
{ strs = new Vector(); }   // init-action
    :  id:ID
       { strs.appendElement(id.getText()); }
       (
          "," id2:ID
          { strs.appendElement(id2.getText()); }
       )*
    ;    



 Semantic action.  Actions are blocks of source code (expressed in the target language) enclosed in curly braces. The code is executed after the preceding production element has been recognized and before the recognition of the following element. Actions are typically used to generate output, construct trees, or modify a symbol table. An action's position dictates when it is recognized relative to the surrounding grammar elements.




If the action is the first element of a production, it is executed before any other element in that production, but only if that production is predicted by the lookahead.




The first action of an EBNF subrule may be followed by ':'. Doing so designates the action as an  init-action  and associates it with the subrule as a whole, instead of any production. It is executed immediately upon entering the subrule -- before lookahead prediction for the alternates of the subrule -- and is executed even while guessing (testing syntactic predicates). For example:



(   {init-action}:
    {action of 1st production} production_1
|   {action of 2nd production} production_2
)?    



The init-action would be executed regardless of what (if anything) matched in the optional subrule.



The init-actions are placed within the loops generated for subrules (...)+ and (...)*.


    Production Element Operators  



 Element complement.  The "~" not unary operator must be applied to an atomic element such as a token identifier. For some token atom  T, ~T matches any token other than  T  except end-of-file. Within lexer rules, ~'a' matches any character other than character 'a'. The sequence ~. ("not anything") is meaningless and not allowed.




The vocabulary space is very important for this operator. In parsers, the complete list of token types is known to ANTLR and, hence, ANTLR simply clones that set and clears the indicated element. For characters, you must specify the character vocabulary if you want to use the complement operator.  Note that for large vocabularies like Unicode character blocks, complementing a character means creating a set with 2^16 elements in the worst case (about 8k). The character vocabulary is the union of characters specified in the charVocabulary option and any characters referenced in the lexer rules. Here is a sample use of the character vocabulary option:



class L extends Lexer;
options { charVocabulary = '\3'..'\377'; } // LATIN

DIGIT : '0'..'9';
SL_COMMENT : "//" (~'\n')* '\n'; 



 Set complement.  the not operator can also be used to construct a token set or character set by  complementing  another set. This is most useful when you want to match tokens or characters until a certain delimiter set is encountered. Rather than invent a special syntax for such sets, ANTLR allows the placement of ~ in front of a subrule containing only simple elements and no actions. In this specific case, ANTLR will not generate a subrule, and will instead create a set-match. The simple elements may be token references, token ranges, character literals, or character ranges. For example:



class P extends Parser;
r : T1 (~(T1|T2|T3))* (T1|T2|T3);

class L extends Lexer;
SL_COMMENT : "//" (~('\n'|'\r'))* ('\n'|'\r);

STRING : '"' (ESC | ~('\\'|'"'))* '"';
protected ESC : '\\' ('n' | 'r');



 Range operator.  The range binary operator implies a range of atoms may be matched. The expression 'c1'..'c2' in a lexer matches characters inclusively in that range. The expression  T..U in a parser matches any token whose token type is inclusively in that range, which is of dubious value unless the token types are generated externally.




 AST root operator.  When generating abstract syntax trees (ASTs), token references suffixed with the "^" root operator force AST nodes to be created and added as the root of the current tree. This symbol is only effective when the  buildAST option  is set.  More information  about ASTs is also available.




 AST exclude operator.  When generating abstract syntax trees, token references suffixed with the "!" exclude operator are not included in the AST constructed for that rule. Rule references can also be suffixed with the exclude operator, which implies that, while the tree for the referenced rule is constructed, it is not linked into the tree for the referencing rule. This symbol is only effective when the  buildAST option  is set.  More information  about ASTs is also available.



    Token Classes 



By using a range operator, a not operator, or a subrule with purely atomic elements, you implicitly define an "anonymous" token or character class--a set that is very efficient in time and space. For example, you can define a lexer rule such as:



OPS : (PLUS | MINUS | MULT | DIV) ;



or



WS  : (' '|'\n'|'\t') ;



These describe sets of tokens and characters respectively that are easily optimized to simple, single, bit-sets rather than series of token and character comparisons.



    Predicates  



 Semantic predicate.  Semantics predicates are conditions that must
be met at parse-time before parsing can continue past them. The
functionality of  semantic
predicates  is explained in more detail later. The syntax of a semantic
predicate is a semantic action suffixed by a question operator:



{ expression }?



The expression must not have side-effects and must evaluate to true or false (boolean in Java or bool in C++). Since semantic predicates can be executed while guessing, they should not rely upon the results of actions or rule parameters.




 Syntactic predicate.  Syntactic predicates specify the lookahead
language needed to predict an alternative.
 Syntactic predicates  are
explained in more detail later.
The syntax of a syntactic predicate is a subrule with a =>
operator suffix:




( lookahead-language ) => production



Where the lookahead-language can be any valid ANTLR construct including references to other rules. Actions are not executed, however, during the evaluation of a syntactic predicate.



   Element Labels 



Any atomic or rule reference production element can be labeled with an
identifier (case not significant). In the case of a labeled atomic element,
the identifier is used within a semantic action to access the associated
Token object or character. For example,



assign
    :   v:ID "=" expr ";"
        { System.out.println(
            "assign to "+v.getText()); }
    ;



No "$" operator is needed to reference the label from
within an action as was the case with PCCTS 1.xx.



Inside actions a token reference can be accessed as
label to acces the Token object, or as
#label to access the AST generated for
the token. The AST node constructed for a rule reference may be
accessed from within actions as #label.




Labels on token references can also be used in association with parser
 exception handlers
 to specify what happens when that token cannot be matched.




Labels on rule references are used for
 parser exception handling 
so that any exceptions generated while executing the labeled rule can be
caught.



    EBNF Rule Elements 



ANTLR supports extended BNF notation according to the following four subrule syntax / syntax diagrams:




	(  P1  |  P2  | ... |  Pn  )




	




	(  P1  |  P2  | ... |  Pn  )?




	




	(  P1  |  P2  | ... |  Pn  )*




	




	(  P1  |  P2  | ... |  Pn  )+




	





    Interpretation Of Semantic Actions  



Semantic actions are copied to the appropriate position in the output
parser verbatim with the exception of AST action translation.




None of the $-variable notation from PCCTS 1.xx carries forward into ANTLR.



Semantic Predicates



A semantic predicate specifies a condition that must be met (at run-time) before parsing may proceed. We differentiate between two types of semantic predicates: (i) validating predicates that throw exceptions if their conditions are not met while parsing a production (like assertions) and (ii) disambiguating predicates that are hoisted into the prediction expression for the associated production.




Semantic predicates are syntactically semantic actions suffixed with a question mark operator:



{ semantic-predicate-expression }?



The expression may use any symbol provided by the programmer or generated by ANTLR that is visible at the point in the output the expression appears.




The position of a predicate within a production determines which type of predicate it is. For example, consider the following validating predicate (which appear at any non-left-edge position) that ensures an identifier is semantically a type name:



decl: "var" ID ":" t:ID
      { isTypeName(t.getText()) }?
    ;    



Validating predicates generate parser exceptions when they fail. The thrown
exception is is of type SemanticException. You can catch this and other
parser exceptions in an  exception handler.




Disambiguating predicates are always the first element in a production because they cannot be hoisted over actions, token, or rule references. For example, the first production of the following rule has a disambiguating predicate that would be hoisted into the prediction expression for the first alternative:




stat:   // declaration "type varName;"
        {isTypeName(LT(1))}? ID ID ";"
    |   ID "=" expr ";"            // assignment
    ;



If we restrict this grammar to LL(1), it is syntactically nondeterministic because of the common left-prefix: ID. However, the semantic predicate correctly provides additional information that disambiguates the parsing decision. The parsing logic would be:



if ( LA(1)==ID && isTypeName(LT(1)) ) {
    match production one
}
else if ( LA(1)==ID ) {
    match production one
}
else error    



Formally, in PCCTS 1.xx, semantic predicates represented the semantic context of a production. As such, the semantic AND syntactic context (lookahead) could be hoisted into other rules. In ANTLR, predicates are not hoisted outside of their enclosing rule. Consequently, rules such as:



type : {isType(t)}? ID ;



are meaningless. On the other hand, this "semantic context" feature caused considerable confusion to many PCCTS 1.xx folks.



Syntactic Predicates 



There are occasionally parsing decisions that cannot be rendered deterministic with finite lookahead. For example:



a   :   ( A )+ B
    |   ( A )+ C
    ;



The common left-prefix renders these two productions nondeterministic in the LL(k) sense for any value of k. Clearly, these two productions can be  left-factored  into:



a   :   ( A )+ (B|C)
    ;



without changing the recognized language. However, when actions are embedded in grammars, left-factoring is not always possible. Further, left-factoring and other grammatical manipulations do not result in natural (readable) grammars.




The solution is simply to use arbitrary lookahead in the few cases where finite LL(k) for k>1 is insufficient. ANTLR allows you to specify a lookahead language with possibly infinite strings using the following syntax:



( prediction block ) => production



For example, consider the following rule that distinguishes between sets (comma-separated lists of words) and parallel assignments (one list assigned to another):



stat:   ( list "=" )=> list "=" list
    |   list
    ;



If a list followed by an assignment operator is found on the input stream, the first production is predicted. If not, the second alternative production is attempted.




Syntactic predicates are a form of selective backtracking and, therefore, actions are turned off while evaluating a syntactic predicate so that actions do not have to be undone.




Syntactic predicates are implemented using exceptions in the target language if they exist. When generating C code, longjmp would have to be used.




We could have chosen to simply use arbitrary lookahead for any non-LL(k) decision found in a grammar. However, making the arbitrary lookahead explicit in the grammar is useful because you don't have to guess what the parser will be doing. Most importantly, there are language constructs that are ambiguous for which there exists no deterministic grammar! For example, the infamous if-then-else construct has no LL(k) grammar for any k. The following grammar is ambiguous and, hence, nondeterministic:




stat:   "if" expr "then" stat ( "else" stat )?
    |   ...
    ;



Given a choice between two productions in a nondeterministic decision, we simply choose the first one. This works out well is most situations. Forcing this decision to use arbitrary lookahead would simply slow the parse down.



    Fixed depth lookahead and syntactic predicates 



ANTLR cannot be sure what lookahead can follow a syntactic predicate (the only logical possibility is whatever follows the alternative predicted by the predicate, but erroneous input and so on complicates this), hence, ANTLR assumes anything can follow.  This situation is similar to the computation of lexical lookahead when it hits the end of the token rule definition.




Consider a predicate with a (...)* whose implicit exit branch forces a computation attempt on what follows the loop, which is the end of the syntactic predicate in this case.



class parse extends Parser;
a	:	(A (P)*) => A (P)*
	|	A
	;



The lookahead is artificially set to "any token" for the exit branch.   Normally, the P and the "any token" would conflict, but ANTLR knows that what you mean is to match a bunch of P tokens if they are present--no warning is generated.




If more than one path can lead to the end of the predicate in any one decision, ANTLR will generate a warning.  The following rule results in two warnings.



class parse extends Parser;
a	:	(A (P|)*) => A (P)*
	|	A
	;



The empty alternative can indirectly be the start of the loop and, hence, conflicts with the P.  Further, ANTLR detects the problem that two paths reach end of predicate.  The resulting parser will compile but never terminate the (P|)* loop.




The situation is complicated by k>1 lookahead.  When the nth lookahead depth reaches the end of the predicate, it records the fact and then code generation ignores the lookahead for that depth.



class parse extends Parser;
options {
	k=2;
}
a	:	(A (P B|P )*) => A (P)*
	|	A
	;



ANTLR generates a decision of the following form inside the (..)* of the predicate:



if ((LA(1)==P) && (LA(2)==B)) {
    match(P);
    match(B);
}
else if ((LA(1)==P) && (true)) {
    match(P);
}
else {
    break _loop4;
}



This computation works in all grammar types.



    ANTLR Meta-Language Grammar  



See antlr/antlr.g for the grammar that describes ANTLR input grammar syntax in ANTLR meta-language itself.




 Version: $Id: //depot/code/org.antlr/release/antlr-2.7.7/doc/metalang.html#2 $


antlr-2.7.7/doc/csharp-runtime.html0000755000175000017500000001573210522211615017207 0ustar  twernertwerner


Notes for using the ANTLR C# Code Generator




    
C# Code Generator for ANTLR 2.x

    
Since the release of ANTLR 2.7.3, it has been possible to generate your Lexers, Parsers and TreeParsers in the ECMA-standard C# language developed by Microsoft.  This feature extends the benefits of ANTLR's predicated-LL(k) parsing technology to applications and components running on the Microsoft .NET platform and, the Mono and dotGNU open-source C#/CLI platforms.


To be able to build and use the C# language Lexers, Parsers and TreeParsers, you will need to link to the ANTLR C# runtime library. The C# runtime model is based on the existing runtime models for Java and C++ and is thus immediately familiar. The C# runtime and the Java runtime in particular are very similar although there a number of subtle (and not so subtle) differences. Some of these result from differences in the respective runtime environments.


ANTLR C# support was contributed (and is maintained) by Kunle Odutola, Micheal Jordan and Anthony Oguntimehin.



Building the ANTLR C# Runtime



The ANTLR C# runtime source and build files are located in the lib/csharp subdirectory of the ANTLR distribution. This sub-directory is known as the ANTLR C# runtime directory. The first step in building the ANTLR C# runtime library is to ensure that ANTLR has been properly installed and built. This process is described in the ANTLR Installation Guide that comes with the distribution. Once ANTLR has been properly built, the ANTLR C# runtime can be built using any one of two distinct methods:


    
	
  • Using the Microsoft Visual Studio .NET development tool.
    
    A Visual Studio.NET solution file named antlr.net-runtime-2.7.<X>.sln 
      is provided in the ANTLR C# runtime directory. This allows you to build 
      the ANTLR C# runtime library and test it with a semi-complex grammar. The 
      solution file references three Visual Studio .NET project files: 
    
      
	  
    • lib/csharp/src/antlr.runtime-2.7.<X>.csproj - for 
        the ANTLR C# runtime library itself (where X is a version 
        number),
      • 
      
    • lib/csharp/ASTFrame/antlr.astframe.csproj - for the ANTLR 
        C# ASTFrame library (used for displaying ASTs) and,
      • 
	  
    • examples/csharp/java/JavaParser.csproj - for the Java grammar 
        project located within the ANTLR C# examples directory tree.
      • 

    • 
	
  • Using the freely available NAnt build tool.
    A build file named antlr.runtime.build is located in the ANTLR C# runtime directory. To build the ANTLR C# runtime, run 
    nant build
     from a command shell in the ANTLR C# runtime directory. You can also run 
    nant release 
    nant docs
     to build a release version and documentation in lib/csharp/release.
    



All the example grammars located in the ANTLR C# examples directory - examples\csharp are also supplied with a NAnt build file. Once the ANTLR C# library has been built, you can test it by running 
nant
 from a command shell in any of the example directories.



Specifying Code Generation



You can instruct ANTLR to generate your Lexers, Parsers and TreeParsers using the C# code generator by adding the following entry to the global options section at the beginning of your grammar file.

{
    language  =  "CSharp";
}


After that things are pretty much the same as in the default java code generation mode. See the examples in examples/csharp for some illustrations.

    
	
  
  • TIP: If you are new to NAnt, ANTLR or the .NET platform, you might want 
    to build your ANTLR projects with something similar to the NANT build files 
    used for the C# examples. The build file for java example in particular also 
    shows one way to automatically copy and reference both the antlr.runtime.dll 
    and antlr.astframe.dll assemblies during your build.
    • 






C#-Specific ANTLR Options



    
	
  • header - specify additional using directives
    You can instruct the ANTLR C# code generator to include additional using directives in your generated Lexer/Parser/TreeParser by listing the directives within the header section which must be the first section at the beginning of your ANTLR grammar file. Please note that using directives are the only source code elements that can currently be safely included in the header section for C# code generation.

    header
{
   using SymbolTable =  kunle.parser.SymbolTable;
   using kunle.compiler;
}

    • 

	
  • namespace - specify an enclosing C# Namespace
    You can instruct the ANTLR C# code generator to place your Lexer/Parser/TreeParser in a specific C# namespace by adding a namespace option to either the global options section at the beginiing of your ANTLR grammar file or, to the grammar options section for individual Lexers/Parsers/TreeParsers.

    {
   namespace  =  "kunle.smalltalk.parser";
}

    • 




A Template C# ANTLR Grammar File



header 
{
    // gets inserted in the C# source file before any
    // generated namespace declarations
    // hence -- can only be using directives
}

options {
    language  = "CSharp";
    namespace = "something";          // encapsulate code in this namespace
    classHeaderPrefix = "protected"; // use to specify access level for generated class
}

{
   // global code stuff that will be included in the source file just before the 'MyParser' class below
   ...
}
class MyParser extends Parser;
options {
   exportVocab=My;
}
{
   // additional methods and members for the generated 'MyParser' class
   ...
}

... generated RULES go here ...

{
   // global code stuff that will be included in the source file just before the 'MyLexer' class below
   ...
}
class MyLexer extends Lexer;
options {
   exportVocab=My;
}
{
   // additional methods and members for the generated 'MyParser' class
   ...
}

... generated RULES go here ...

{
   // global code stuff that will be included in the source file just before the 'MyTreeParser' class below
   ...
}
class MyTreeParser extends TreeParser;
options {
   exportVocab=My;
}
{
   // additional methods and members for the generated 'MyParser' class
   ...
}

... generated RULES go here ...




antlr-2.7.7/doc/hidden.stream.gif0000644000175000017500000000712310522211615016564 0ustar  twernertwernerGIF89ayｼｼｼﾌﾌﾌﾄﾄﾄﾀﾀﾀ,y@Hｰﾁ*\ﾈｰ｡ﾃ#J廩ｱ｢ﾅ3jﾜ(Glｰﾀ紊C札ﾙ仙G!人瑣蠡6ｪ\IｧE2}のYp'ﾍィ$=9Sｦﾈ･7?	ｵ#Q"ｽjbﾕ#ﾃ~ﾙAﾕｩOur(ﾓ餡ｲ	Qｺ4	mﾚ
2惻ﾚ和ﾟ梱ﾖkTｸc去l+､ﾟ3y>ｾ橿ﾝﾃ#Kﾞ+5+ﾕﾂ\:MJﾚｽ奬xﾂﾄ+kﾖ:∝ﾆy;
ｬﾛﾋHsO>掫ｱkﾓ>ｭ<ｯﾛﾟ▲KｷNﾏﾔｳGﾙ-v爰s>8b勒oｷn>2t+ﾙC6?x糲wLxｿ(烙芳焉&`w
6鞨2｡ANh痳U!f鞦 ｢#防竕$｢X曦ｪ靱n)ｺ8漸ﾅ(#f,ｮﾖUQ6\ﾑX#就vd忘F9ﾜ隈ｲ4VHｶ}ﾛ9!#yJ容p[rﾙeWｴｱ､]@XUJﾞﾔd僵哦d3ｶｷ瀦TNﾘb挌喝槞w'6	ｨbQ蝣ｨ55$｢ﾊVﾟ｣色*)utｩﾙ､惑h･

嫡柮ﾚ｣T樶ｹ`僑2X*RKｭZﾔﾐ-ﾇ}ｲｦﾕq6*]o｡~WkfｳY抃ﾖﾝ｢W%粒ｪa`ｪi隕阻塰ｭErﾖｧ[ﾎVym凩k鶲昿{h岷gｮｰ^ｾｦｫ｢ﾈR(丙陞ｻｽﾉｾｷ翦mｽｳｻ｢ｼgWｼ&輒ｿｬ痣ｼ友:ﾚﾂ:ｽｧﾞs4ﾛ'ﾄﾐbwｫ{ﾇ
i狢ﾅﾝｦi};6羈gw+弘ﾞj1ﾈ4k並z椹ﾊｨ#ﾏ@doﾐDmtﾏF'ﾍ｡ﾒL7=:;-uQ8ﾕMW=`ｨX｣ﾖ旒"\ｰ浬w'ｮ$航`ｸa喟ｺ孃羊ｵ+,怦ｽﾉ&o"%ﾐ､ﾏpd邨4ﾁ}ｸﾙZﾊ隍n爽{v桑[9R拍ｳhb_n)ﾄ5.z鬨洌:鬩Uｧｵ3,､ｰｹ邵邂{ﾜ>ﾅｫnｿ蛔~mﾏ'ｪ,ﾂ|hｲ霽茅蕣ﾗｻ~f將ﾃΙ2ｸﾏ~ﾏﾊｿQ?oX鼡ｽ榠z_,R,8｢m7Fｲ1f~ﾀｦﾊ僂^綽ﾃｽVI~ﾖﾞJ#$栗ﾟz@ﾋ栄〉ﾊ^ｺi及媽ﾝﾇ@~90aH荏ｾ9$_､ﾂ蚋a!M8ｿ]j3ｪ!&Dﾂ秦｢
姪⊂ｫﾞHﾃﾛi-D
ﾓ气-ﾔ!ｰx仟ﾎ遂ｱY/r角債;｣#G$首8Zk
6=8$ﾒｷﾘEtｮ景l7｢
	Uｳ[LP尨ﾄN;ﾛI%e2M吝uh娯ﾙZIJ9
Tｻﾘﾍﾚ｢IIb-$I+_ｷZﾚ椋T+sﾉﾋ[､梁赳@ﾌbﾓ漣;ｦ0c｣ﾌfC|ｦ4ｧ'R壓ｴ｣6ｳﾉﾍnns窃臟3ﾇIﾎr嘖辧:ｧ:ﾗﾉﾎvｺ3p*^8輅ﾍﾉ到$$ﾔﾉO1龠ﾄ'@ﾐ３譟Mhｮ礫ｪw:｡ﾎ	D'鷄ｩ 5ﾒ<沸Q]Gﾏ&ﾒj2｣!ﾖH7ｧRｪlｦﾁﾉ泥]唔qYL数ﾓ4x i@｡ｷﾓ0ｧd!
OwZ斂“"｣UﾑﾉeｦJ⊥Uﾕﾏｦ:)蹤ｧｺ･ｱｪ!ｵｪ厂ｮﾚ
ｧRRMｿ芥HJﾕx
ﾒRﾝｪ,3.SThｻ&2?R
ｨeｿo-enｨbYﾁzｾｱ	･ｨf7[ﾋ,糞ｧg9劔ｴｩC鶻ﾋﾚﾕBot%餓(KI[IﾉL%%ｭnwﾋﾛﾞsｳｿt'3渙｢桃ｮfy@Uu詭,hnﾓ｡^AWxﾑ,ﾇﾊFPｲｵhｧr6%V着nﾌcj枦ﾆﾆ:ｶｽYﾛt;hE昼}Wdcﾃ2結Y)5xﾐﾖ1ｯ`!鞜ｺW+F忤-ﾛ釘Mx｡I,｢,･R西濺b)悵#ﾘ{Yｹ2/ｷ\ｾ/ｻ`G蛇ﾃ2vo磯XYχRﾕ;rKqﾆuｭ娟搖9ﾌｧg駲(ｧﾜdﾋ莖}Pｦ鱸槭篝FYﾁ覿薦ｹ#ｳﾚｸY齷uLﾟuﾅ13dLe2欹ﾅFﾕn倒%ｺｵ\{ｳk艷3/ﾅﾄｲﾞﾆ!>I]1#弟虎ｲ&ﾊﾄO豈R､徃7ｯ属ｴGhGK8ｼm~､G&ｿnzﾌVｳbY蘭ﾖｵ1ﾓj1sｳｭs躑ﾏﾉ\ｩｭ5ｻ7ｻﾍ&諮JBVK切ﾉ^ｳｹﾔ鍠_塹ｲ鳫}ﾇ槌3ｶEｼg]宜ﾟ拯ｹ−7踟ﾘ&q杞ｶ巒佩巾7ﾄj>rSｺ從T巛ﾛﾆ､
;pｻﾝﾏv窩qp}Vﾘuｶ6n>晋ﾜwsｻA挾ﾈ幣ﾖ濔ｹﾉsq[ﾁz跿Y@
>|Sｺ蟲R｣}N{Kﾟ寫%oﾞ	鰕jﾐC6S豪KC企$Qｷ)
E"Z`WTﾘ3ｸ`,cMle險ｰｵc%ﾈ}攅｣]xｿ;ﾚモ嶋N籔ﾋAｻｫ膨k,dｿ檐ﾆ[F|5窪^ｦ･ｼ縱&[ｩWy}S"維涵GｵﾗXzﾔﾊｦUｵ骨ｪf鉤嵐[ﾐ栲甦悽mgYｦ[
ｼﾈ?醍苫|{zｼﾐ紹｣ONMｿﾘ_ﾐｳﾏ}穃ｿ璞ﾅﾃO~やｼﾓO6vvｿA痂AK｣'ｫゐﾟﾇ'PpFd竇8ﾘM
RNcxﾗT9｢xR;ﾄｷn;3FG5ｨ;1ﾁpASzﾉ早ﾆ'Ｆｷ~x2ﾕ蠏;hLｳネャB迭Vt.ｲx?ｨﾝFdﾓuV'0SH*''ov|wC)軋|縱韆8)ｸH25*･8A4'%M%d36t`KｻfS#｣fｼｶ,y#ﾄﾂ7ｸ8彙CH[E-eV&cHｾ7<9HUﾈ%W$35ﾃｲh、ｲ覃ｶ4ukﾂの虍wxoﾜOAx9K&癖%(J^ﾅﾑ[､篭]V[ｸkDVL帽j･%X核ﾈkYh釜r"Zx鏡8沿vﾖVtﾎHRKｨ[(Q&Xwsﾖ2ｻ附
bI',借浪ﾗX,ｧ刺ﾈ%X､e室鉦ﾘ3ｨ8xﾑOｿﾆ州ｸ昇xY81ｱdHｬ憂剞ﾙ)琢!Q21ﾝh{	zﾙzﾙ霜aa密uﾇ9w(饂'ｩ(ﾉy(ｧ&薐xY7陶ﾗ6I78Y8ｹ:ﾙ93ﾙ:ｲdq跳{F9;ｯ･s｣{ﾂw濡剩7sﾉGuTﾙNﾁU氷YKｸ父;antlr-2.7.7/doc/streams.html0000644000175000017500000007456610522211615015733 0ustar  twernertwerner


	
	ANTLR Specification: Token Streams 



Token Streams
 


	Traditionally, a lexer and parser are tightly coupled objects; that is, one does not imagine anything sitting between the parser and the lexer, modifying the stream of tokens.   However, language recognition and translation can benefit greatly from treating the connection between lexer and parser as a token stream.  This idea is analogous to Java I/O streams, where you can pipeline lots of stream objects to produce highly-processed data streams.



Introduction
 


	ANTLR identifies a stream of Token objects as any object that satisfies the TokenStream interface (prior to 2.6, this interface was called Tokenizer); i.e., any object that implements the following method.



Token nextToken();
 


	Graphically, a normal stream of tokens from a lexer (producer) to a parser (consumer) might look like the following at some point during the parse.




	lexer.to.parser.tokens.gif (3585 bytes)




	The most common token stream is a lexer, but once you imagine a physical stream between the lexer and parser, you start imagining interesting things that you can do.  For example, you can:

    
	
  • 
		filter a stream of tokens to strip out unwanted tokens
	
    • 
	
  • 
		insert imaginary tokens to help the parser recognize certain nasty structures
	
    • 
	
  • 
		split a single stream into multiple streams, sending certain tokens of interest down the various streams
	
    • 
	
  • 
		multiplex multiple token streams onto one stream, thus, "simulating" the lexer states of tools like PCCTS, lex, and so on.
	
    • 




	The beauty of the token stream concept is that parsers and lexers are not affected--they are merely consumers and producers of streams.  Stream objects are filters that produce, process, combine, or separate token streams for use by consumers.   Existing lexers and parsers may be combined in new and interesting ways without modification.




	This document formalizes the notion of a token stream and describes in detail some very useful stream filters.



Pass-Through Token Stream
 


	A token stream is any object satisfying the following interface.



public interface TokenStream {
  public Token nextToken()
    throws java.io.IOException;
}
 


	For example, a "no-op" or pass-through filter stream looks like:



import antlr.*;
import java.io.IOException;

class TokenStreamPassThrough
    implements TokenStream {
  protected TokenStream input;

  /** Stream to read tokens from */
  public TokenStreamPassThrough(TokenStream in) {
    input = in;
  }

  /** This makes us a stream */
  public Token nextToken() throws IOException {
    return input.nextToken(); // "short circuit"
  }
}
 


	You would use this simple stream by having it pull tokens from the lexer and then have the parser pull tokens from it as in the following main() program.



public static void main(String[] args) {
  MyLexer lexer =
    new MyLexer(new DataInputStream(System.in));
  TokenStreamPassThrough filter =
    new TokenStreamPassThrough(lexer);
  MyParser parser = new MyParser(filter);
  parser.startRule();
}
 
Token Stream Filtering
 


	Most of the time, you want the lexer to discard whitespace and comments, however, what if you also want to reuse the lexer in situations where the parser must see the comments?  You can design a single lexer to cover many situations by having the lexer emit comments and whitespace along with the normal tokens.  Then, when you want to discard whitespace, put a filter between the lexer and the parser to kill whitespace tokens.




	ANTLR provides TokenStreamBasicFilter for such situations.  You can instruct it to discard any token type or types without having to modify the lexer.  Here is an example usage of TokenStreamBasicFilter that filters out comments and whitespace.



public static void main(String[] args) {
  MyLexer lexer =
    new MyLexer(new DataInputStream(System.in));
  TokenStreamPassThrough filter =
    new TokenStreamPassThrough(lexer);
  filter.discard(MyParser.WS);
  filter.discard(MyParser.COMMENT);
  MyParser parser = new MyParser(filter);
  parser.startRule();
}
 


	Note that it is more efficient to have the lexer immediately discard lexical structures you do not want because you do not have to construct a Token object.  On the other hand, filtering the stream leads to more flexible lexers.



Token Stream Splitting
 


	Sometimes you want a translator to ignore but not discard portions of the input during the recognition phase.   For example, you want to ignore comments vis-a-vis parsing, but you need the comments for translation.   The solution is to send the comments to the parser on a hidden token stream--one that the parser is not "listening" to.  During recognition, actions can then examine the hidden stream or streams, collecting the comments and so on.  Stream-splitting filters are like prisms that split white light into rainbows.




	The following diagram illustrates a situation in which a single stream of tokens is split into three.




	stream.splitter.gif (5527 bytes)




	You would have the parser pull tokens from the topmost stream.




	There are many possible capabilities and implementations of a stream splitter.   For example, you could have a "Y-splitter" that actually duplicated a stream of tokens like a cable-TV Y-connector.  If the filter were thread-safe and buffered, you could have multiple parsers pulling tokens from the filter at the same time.




	This section describes a stream filter supplied with ANTLR called TokenStreamHiddenTokenFilter that behaves like a coin sorter, sending pennies to one bin, dimes to another, etc...  This filter splits the input stream into two streams, a main stream with the majority of the tokens and a hidden stream that is buffered so that you can ask it questions later about its contents.   Because of the implementation, however, you cannot attach a parser to the hidden stream.  The filter actually weaves the hidden tokens among the main tokens as you will see below.



Example
 


	Consider the following simple grammar that reads in integer variable declarations.



decls: (decl)+
     ;
decl : begin:INT ID end:SEMI
     ; 
 


	Now assume input:



int n; // list length
/** doc */
int f;
 


	Imagine that whitespace is ignored by the lexer and that you have instructed the filter to split comments onto the hidden stream.  Now if the parser is pulling tokens from the main stream, it will see only "INT ID SEMI FLOAT ID SEMI" even though the comments are hanging around on the hidden stream.  So the parser effectively ignores the comments, but your actions can query the filter for tokens on the hidden stream.




	The first time through rule decl, the begin token reference has no hidden tokens before or after, but



filter.getHiddenAfter(end)
 


	returns a reference to token



// list length
 


	which in turn provides access to




	/** doc */




	The second time through decl



filter.getHiddenBefore(begin)
 


	refers to the



/** doc */
 


	comment.



Filter Implementation
 


	The following diagram illustrates how the Token objects are physically weaved together to simulate two different streams.




	hidden.stream.gif (3667 bytes)




	 




	As the tokens are consumed, the TokenStreamHiddenTokenFilter object hooks the hidden tokens to the main tokens via linked list.  There is only one physical TokenStream of tokens emanating from this filter and the interweaved pointers maintain sequence information.




	Because of the extra pointers required to link the tokens together, you must use a special token object called CommonHiddenStreamToken (the normal object is called CommonToken).   Recall that you can instruct a lexer to build tokens of a particular class with



lexer.setTokenObjectClass("classname");
 


	Technically, this exact filter functionality could be implemented without requiring a special token object, but this filter implementation is extremely efficient and it is easy to tell the lexer what kind of tokens to create.  Further, this implementation makes it very easy to automatically have tree nodes built that preserve the hidden stream information.




	This filter affects the lazy-consume of ANTLR.  After recognizing every main stream token, the TokenStreamHiddenTokenFilter must grab the next Token to see if it is a hidden token. Consequently, the use of this filter is not be very workable for interactive (e.g., command-line) applications.



How To Use This Filter
 


	To use TokenStreamHiddenTokenFilter, all you have to do is: 

    
	
  • 
		Create the lexer and tell it to create token objects augmented with links to hidden tokens.
	
    • 



MyLexer lexer = new MyLexer(some-input-stream);
lexer.setTokenObjectClass(
  "antlr.CommonHiddenStreamToken"
);
 

    
	
  • 
		Create a TokenStreamHiddenTokenFilter object that pulls tokens from the lexer.
	
    • 



TokenStreamHiddenTokenFilter filter =
  new TokenStreamHiddenTokenFilter(lexer);
 

    
	
  • 
		Tell the TokenStreamHiddenTokenFilter which tokens to hide, and which to discard.  For example,
	
    • 



filter.discard(MyParser.WS);
filter.hide(MyParser.SL_COMMENT);
 

    
	
  • 
		Create a parser that pulls tokens from the TokenStreamHiddenTokenFilter rather than the lexer.
	
    • 



MyParser parser = new MyParser(filter);
try {
  parser.startRule(); // parse as usual
}
catch (Exception e) {
  System.err.println(e.getMessage());
}
 


	See the ANTLR fieldguide entry on preserving whitespace for a complete example.



Tree Construction
 


	Ultimately, hidden stream tokens are needed during the translation phase, which normally means while tree walking.  How do we pass the hidden stream info to the translator without mucking up the tree grammar?  Easy: use AST nodes that save the hidden stream tokens.  ANTLR defines CommonASTWithHiddenTokens for you that hooks the hidden stream tokens onto the tree nodes automatically; methods are available to access the hidden tokens associated with a tree node.  All you have to do is tell the parser to create nodes of this node type rather than the default CommonAST.



parser.setASTNodeClass("antlr.CommonASTWithHiddenTokens");
 


	Tree nodes are created as functions of Token objects.  The initialize() method of the tree node is called with a Token object when the ASTFactory creates the tree node.  Tree nodes created from tokens with hidden tokens before or after will have the same hidden tokens.  You do not have to use this node definition, but it works for many translation tasks:



package antlr;

/** A CommonAST whose initialization copies
 *  hidden token information from the Token
 *  used to create a node.
 */
public class CommonASTWithHiddenTokens
  extends CommonAST {
  // references to hidden tokens
  protected Token hiddenBefore, hiddenAfter;

  public CommonHiddenStreamToken getHiddenAfter() {
    return hiddenAfter;
  }
  public CommonHiddenStreamToken getHiddenBefore() {
    return hiddenBefore;
  }
  public void initialize(Token tok) {
    CommonHiddenStreamToken t =
      (CommonHiddenStreamToken)tok;
    super.initialize(t);
    hiddenBefore = t.getHiddenBefore();
    hiddenAfter  = t.getHiddenAfter();
  }
}
 


	Notice that this node definition assumes that you are using CommonHiddenStreamToken objects.  A runtime class cast except occurs if you do not have the lexer create CommonHiddenStreamToken objects. 



Garbage Collection Issues
 


	By partitioning up the input stream and preventing hidden stream tokens from referring to main stream tokens, GC is allowed to work on the Token stream. In the integer declaration example above, when there are no more references to the first SEMI token and the second INT token, the comment tokens are candidates for garbage collection.  If all tokens were linked together, a single reference to any token would prevent GC of any tokens.  This is not the case in ANTLR's implementation.



Notes
 


	This filter works great for preserving whitespace and comments during translation, but is not always the best solution for handling comments in situations where the output is very dissimilar to the input.  For example, there may be 3 comments interspersed within an input statement that you want to combine at the head of the output statement during translation.  Rather than having to ask each parsed token for the comments surrounding it, it would be better to have a real, physically-separate stream that buffered the comments and a means of associating groups of parsed tokens with groups of comment stream tokens.  You probably want to support questions like "give me all of the tokens on the comment stream that originally appeared between this beginning parsed token and this ending parsed token."




	This filter implements the exact same functionality as JavaCC's special tokens.  Sriram Sankar (father of JavaCC) had a great idea with the special tokens and, at the 1997 Dr. T's Traveling Parsing Revival and Beer Tasting Festival, the revival attendees extended the idea to the more general token stream concept.  Now, the JavaCC special token functionality is just another ANTLR stream filter with the bonus that you do not have to modify the lexer to specify which tokens are special.



Token Stream Multiplexing (aka "Lexer states")
 


	Now, consider the opposite problem where you want to combine multiple streams rather than splitting a single stream.  When your input contains sections or slices that are radically diverse such as Java and JavaDoc comments, you will find that it is hard to make a single lexer recognize all slices of the input.  This is primarily because merging the token definitions of the various slices results in an ambiguous lexical language or allows invalid tokens.  For example, "final" may be a keyword in one section, but an identifier in another.  Also, "@author" is a valid javadoc tag within a comment, but is invalid in the surrounding Java code.




	Most people solve this problem by having the lexer sit in one of multiple states (for example, "reading Java stuff" vs "reading JavaDoc stuff").  The lexer starts out in Java mode and then, upon "/**", switches to JavaDoc mode; "*/" forces the lexer to switch back to Java mode.



Multiple Lexers
 


	Having a single lexer with multiple states works, but having multiple lexers that are multiplexed onto the same token stream solves the same problem better because the separate lexers are easier to reuse (no cutting and pasting into a new lexer--just tell the stream multiplexor to switch to it).  For example, the JavaDoc lexer could be reused for any language problem that had JavaDoc comments.




	ANTLR provides a predefined token stream called TokenStreamSelector that lets you switch between multiple lexers.  Actions in the various lexers control how the selector switches input streams.  Consider the following Java fragment.



/** Test.
 *  @author Terence
 */
int n;
 


	Given two lexers, JavaLexer and JavaDocLexer, the sequence of actions by the two lexers might look like this:




	JavaLexer: match JAVADOC_OPEN, switch to JavaDocLexer
			

			JavaDocLexer: match AUTHOR
			

			JavaDocLexer: match ID
			

			JavaDocLexer: match JAVADOC_CLOSE, switch back to JavaLexer
			

			JavaLexer: match INT
			

			JavaLexer: match ID
			

			JavaLexer: match SEMI




	In the Java lexer grammar, you will need a rule to perform the switch to the JavaDoc lexer (recording on the stack of streams the "return lexer"):



JAVADOC_OPEN
    :    "/**" {selector.push("doclexer");}
    ;
 


	Similarly, you will need a rule in the JavaDoc lexer to switch back:



JAVADOC_CLOSE
    :    "*/" {selector.pop();}
    ;
 


	The selector has a stack of streams so the JavaDoc lexer does not need to know who invoked it.




	Graphically, the selector combines the two lexer streams into a single stream presented to the parser.




	stream.selector.gif (5976 bytes)




	The selector can maintain of list of streams for you so that you can switch to another input stream by name or you can tell it to switch to an actual stream object.



public class TokenStreamSelector implements TokenStream {
  public TokenStreamSelector() {...}
  public void addInputStream(TokenStream stream,
    String key) {...}
  public void pop() {...}
  public void push(TokenStream stream) {...}
  public void push(String sname) {...}
  /** Set the stream without pushing old stream */
  public void select(TokenStream stream) {...}
  public void select(String sname)
    throws IllegalArgumentException {...}
}
 


	Using the selector is easy:

    
	
  • 
		Create a selector.
	
    • 



TokenStreamSelector selector =
  new TokenStreamSelector();
 

    
	
  • 
		Name the streams (don't have to name--you can use stream object references instead to avoid the hashtable lookup on each switch).
	
    • 



selector.addInputStream(mainLexer, "main");
selector.addInputStream(doclexer, "doclexer");
 

    
	
  • 
		Select which lexer reads from the char stream first.
	
    • 



// start with main java lexer
selector.select("main");
 

    
	
  • 
		Attach your parser to the selector instead of one of the lexers.
	
    • 



JavaParser parser = new JavaParser(selector);
 
Lexers Sharing Same Character Stream
 


	Before moving on to how the parser uses the selector, note that the two lexers have to read characters from the same input stream.  Prior to ANTLR 2.6.0, each lexer had its own line number variable, input char stream variable and so on.  In order to share the same input state, ANTLR 2.6.0 factors the portion of a lexer dealing with the character input into an object, LexerSharedInputState, that can be shared among n lexers (single-threaded).  To get multiple lexers to share state, you create the first lexer, ask for its input state object, and then use that when constructing any further lexers that need to share that input state:



// create Java lexer
JavaLexer mainLexer = new JavaLexer(input);
// create javadoc lexer; attach to shared
// input state of java lexer
JavaDocLexer doclexer =
  new JavaDocLexer(mainLexer.getInputState());
 
Parsing Multiplexed Token Streams
 


	Just as a single lexer may have trouble producing a single stream of tokens from diverse input slices or sections, a single parser may have trouble handling the multiplexed token stream.  Again, a token that is a keyword in one lexer's vocabulary may be an identifier in another lexer's vocabulary.  Factoring the parser into separate subparsers for each input section makes sense to handle the separate vocabularies as well as for promoting grammar reuse.




	The following parser grammar uses the main lexer token vocabulary (specified with the importVocab option) and upon JAVADOC_OPEN it creates and invokes a JavaDoc parser to handle the subsequent stream of tokens from within the comment.



class JavaParser extends Parser;
options {
    importVocab=Java;
}

input
    :   ( (javadoc)? INT ID SEMI )+
    ;

javadoc
    :   JAVADOC_OPEN
        {
        // create a parser to handle the javadoc comment
        JavaDocParser jdocparser =
          new JavaDocParser(getInputState());
        jdocparser.content(); // go parse the comment
        }
        JAVADOC_CLOSE
    ;
 


	You will note that ANTLR parsers from 2.6.0 also share token input stream state.   When creating the "subparser", JavaParser tells it to pull tokens from the same input state object.




	The JavaDoc parser matches a bunch of tags:



class JavaDocParser extends Parser;
options {
    importVocab=JavaDoc;
}

content
    :   (   PARAM // includes ID as part of PARAM
        |   EXCEPTION
        |   AUTHOR
        )*
    ;
 


	When the subparser rule content finishes, control is naturally returned to the invoking method, javadoc, in the Java parser.



The Effect of Lookahead Upon Multiplexed Token Streams
 


	What would happen if the parser needed to look two tokens ahead at the start of the JavaDoc comment?  In other words, from the perspective of the main parser, what is the token following JAVADOC_OPEN?   Token JAVADOC_CLOSE, naturally!  The main parser treats any JavaDoc comment, no matter how complicated, as a single entity; it does not see into the token stream of the comment nor should it--the subparser handles that stream.




	What is the token following the content rule in the subparser?  "End of file".  The analysis of the subparser cannot determine what random method will call it from your code.  This is not an issue because there is normally a single token that signifies the termination of the subparser.  Even if EOF gets pulled into the analysis somehow, EOF will not be present on the token stream.



Multiple Lexers Versus Calling Another Lexer Rule
 


	Multiple lexer states are also often used to handle very complicated single   tokens such as strings with embedded escape characters where input "\t" should not be allowed outside of a string.  Typically, upon the initial quote, the lexer switches to a "string state" and then switches back to the "normal state" after having matched the guts of the string.




	So-called "modal" programming, where your code does something different depending on a mode, is often a bad practice.  In the situation of complex tokens, it is better to explicity specify the complicated token with more rules.  Here is the golden rule of when to and when not to use multiplexed token streams:




	

		Complicated single tokens should be matched by calling another (protected) lexer rule whereas streams of tokens from diverse slices or sections should be handled by different lexers multiplexed onto the same stream that feeds the parser.
	





	For example, the definition of a string in a lexer should simply call another rule to handle the nastiness of escape characters:



STRING_LITERAL
    :    '"' (ESC|~('"'|'\\'))* '"'
    ;

protected // not a token; only invoked by another rule.
ESC
    :    '\\'
        (    'n'
        |    'r'
        |    't'
        |    'b'
        |    'f'
        |    '"'
        |    '\''
        |    '\\'
        |    ('u')+
             HEX_DIGIT HEX_DIGIT HEX_DIGIT HEX_DIGIT 
        ...
       )
    ;



TokenStreamRewriteEngine Easy Syntax-Directed Translation


There are many common situations where you want to tweak or augment
a program or data file.  ANTLR 2.7.3 introduced a (Java/C# versions only) a very simple but powerful TokenStream targeted at the class of problems where:


    

  1. the output language and the input language are similar

  2. the relative order of language elements does not change



See the Syntax Directed TokenStream Rewriting article on the antlr website.


The Future
 


	The ANTLR 2.6 release provides the basic structure for using token streams--future versions will be more sophisticated once we have experience using them.




	The current "hidden token" stream filter clearly solves the "ignore but preserve whitespace" problem really well, but it does not handle comments too well in most situations.  For example, in real translation problems you want to collect comments at various single tree nodes (like DECL or METHOD) for interpretation rather than leaving them strewn throughout the tree.  You really need a stream splitter that buffers up the comments on a separate stream so you can say "give me all comments   consumed during the recognition of this rule" or "give me all comments found between these two real tokens." That is almost certainly something you need for translation of comments.




	Token streams will lead to fascinating possibilities.  Most folks are not used to thinking about token streams so it is hard to imagine what else they could be good for.  Let your mind go wild.  What about embedded languages where you see slices (aspects) of the input such as Java and SQL (each portion of the input could be sliced off and put through on a different stream).  What about parsing Java .class files with and without debugging information?  If you have a parser for .class files without debug info and you want to handle .class files with debug info, leave the parser alone and augment the lexer to see the new debug structures.  Have a filter split the debug tokens of onto a different stream and the same parser will work for both types of .class files.




	Later, I would like to add "perspectives", which are really just another way to look at filters.  Imagine a raw stream of tokens emanating from a lexer--the root perspective.  I can build up a tree of perspectives very easily from there.  For example, given a Java program with embedded SQL, you might want multiple perspectives on the input stream for parsing or translation reasons:




	stream.perspectives.gif (2679 bytes)




	You could attach a parser to the SQL stream or the Java stream minus comments, with actions querying the comment stream.




	In the future, I would also like to add the ability of a parser to generate a stream of tokens (or text) as output just like it can build trees now.  In this manner, multipass parsing becomes a very natural and simple problem because parsers become stream producers also.  The output of one parser can be the input to another.




	Version: $Id: //depot/code/org.antlr/release/antlr-2.7.7/doc/streams.html#2 $ 


antlr-2.7.7/doc/j-guru-blue.jpg0000644000175000017500000001762610522211615016221 0ustar  twernertwernerﾘJFIFHH	ﾔPhotoshop 3.08BIMHH8BIM
x8BIM8BIM
8BIM'
8BIMH/fflff/ff｡劒2Z5-8BIMp8BIM@@8BIM	8BIMDFPﾔB@(ﾘJFIFHH&File written by Adobe Photoshopｨ 5.2Adobedﾛ			



ﾀPF"ﾝﾄ?	
	
3!1AQa"q2贈ｱB#$Rﾁb34rびC%担碵cs5｢ｲ&D典dEﾂ｣t6ﾒU稙ｳﾃﾓu胚F'筈ｴ米ﾔ蔬･ｵﾅﾕ襄Vfv岬ｶﾆﾖ踐7GWgw立ｷﾇﾗ銷5!1AQaq"2¢｡ｱB#ﾁRﾑ3$b疵ｒCScs4%｢ｲ&5ﾂﾒD典｣dEU6te糘ｳﾃﾓu胚F筈ｴ米ﾔ蔬･ｵﾅﾕ襄Vfv岬ｶﾆﾖ踐'7GWgw立ｷﾇﾚ?T棚%"ｾ6ﾚ獰7歎Wﾖ,	n(ｷﾎｮ?ﾕｬY.~[qｦXﾑwｸmY創槧6ｻﾜﾟ|~沛ﾓ麋O!ﾘ!ﾎs併G,cﾇdﾃ位BG`ﾝI$6ﾛﾒU哇;+ｦ[Nｶﾞ`ﾀ0\?9尠壻zﾇVﾊｫfGVｾｾﾍﾆﾃgﾓ{ﾏｺｺﾚﾗ
文ｶ;｣ｽﾘﾓ]zｭ未ｨﾙﾕn泰1z仄>計Cﾏﾓﾐﾓｶｻ誉燥薗ﾝｹｲ磬ｶﾕ.;･}mﾕ*ﾘﾟWｫﾟ+ｱ=@ﾝ?｣ﾘｺｷe箚ﾓf--8h踴e遣ﾛ侯ﾋ磯艾cｿ娥ﾟU懸6|朽壼c｢彜4bTﾇｴsｷ9]M"bu繿ﾐﾈｫｸcﾘ}稽ｦｫｫuVｴ>ｷsJl|zqｪm442ｶﾌ4y敝=ﾂH#秘ｩRI$帖ﾓｾｾVﾇPｻ膨ｹ<踴壟ｼ闘ｶLｯ窯uｸ元-ｷI&nﾝ~ｦｻbｯOｯ]☆ﾐ:NCｳiｫ.ｲNﾇиoｾｧ"ﾏq]ｵNｬｩｸｽｭﾒﾌ縮掵GPﾗ=ｻklgJｽM椚o｢Juo{sｺOｫﾓ2ﾙV|噬ﾐ"XvXﾗﾗｱyU{ｬﾕ3:敞ﾊE6ｱ｢ｲﾆ擯w"ｿﾟ]}*ｶｺ弯ｧﾔｱq;ｱjｼ
ﾈ?Iｻv-ｮ穣3児待6粢卻mﾎ/ﾟｦﾍ~擬樋]_-ｹ_竡ｼ嬾nn-iwｻﾕkｫｭﾞ鰡黨5ﾋﾛｧ[}]ﾌｦﾇﾗ.ｵ8ｵIｼｹｻﾚCｿ1郷ｧWOｬ尋ｭｶｩ%ｴ>Mm'Xﾗｷ埆麼oIﾆ靹ﾐ≧f=Mｱ犇停Iｸﾘ恍圄/Eﾀｯ5漆ｰoｽ=ﾞｮ聞R轉.ｭﾛｿqsﾟ窈*ﾗ3ｬ濺Xmamq;A+ｲｨﾝﾒkｭｵﾖﾚﾙX[7ﾔ?ﾅﾟﾕ|｣eS倉.ｸﾑk'9ｬ輙IO暉ｴｿ=Fﾉﾆnf7さﾔ+a狸ﾒｨO+ﾜ|ﾖｱ5鱒[ｽjｾ副峺ﾆ$帖ﾙ8BIMXICC_PROFILEHLinomntrRGB XYZ ﾎ	1acspMSFTIEC sRGBﾖﾓ-HP  cprtP3desclwtptbkptrXYZgXYZ,bXYZ@dmndTpdmddﾄvuedLviewﾔ$lumimeas$tech0rTRC<gTRC<bTRC<textCopyright (c) 1998 Hewlett-Packard CompanydescsRGB IEC61966-2.1sRGB IEC61966-2.1XYZ QﾌXYZ XYZ o｢8森YZ bｷﾚXYZ $ｶﾏdescIEC http://www.iec.chIEC http://www.iec.chdesc.IEC 61966-2.1 Default RGB colour space - sRGB.IEC 61966-2.1 Default RGB colour space - sRGBdesc,Reference Viewing Condition in IEC61966-2.1,Reference Viewing Condition in IEC61966-2.1view､_.ﾏﾌ\XYZ L	VPW輓eassig CRT curv
#(-27;@EJOTY^chmrw|､ｩｮｲｷｼﾁﾆﾋﾐﾕﾛ
%+28>ELRY`gnu|｡ｩｱｹﾁﾉﾑﾙ&/8AKT]gqz｢ｬｶﾁﾋﾕ!-8COZfr~｢ｮｺﾇﾓ -;HUcq~ｨｶﾄﾓ
+:IXgwｦｵﾅﾕ'7HYj{ｯﾀﾑ+=Oatｬｿﾒ2FZnｪｾﾒ		%	:	O	d	y		､	ｺ	ﾏ		

'
=
T
j


ｮ
ﾅ
ﾜ
"9Qiｰﾈ*C\uｧﾀﾙ


&
@
Z
t

ｩ
ﾃ
ﾞ
.Idｶﾒ	%A^zｳﾏ	&Ca~ｹﾗ1Omｪﾉ&Ed｣ﾃ#Cc､ﾅ'Ijｭﾎ4Vxｽ&IlｲﾖAeｮﾒ@eｯﾕ Ekｷﾝ*Qwﾅ;cｲﾚ*R{｣ﾌGpﾃ@jｾ>iｿ  A l  ﾄ !!H!u!｡!ﾎ!"'"U""ｯ"ﾝ#
#8#f##ﾂ#$$M$|$ｫ$ﾚ%	%8%h%%ﾇ%&'&W&&ｷ&''I'z'ｫ'ﾜ(
(?(q(｢(ﾔ))8)k))ﾐ**5*h**ﾏ++6+i++ﾑ,,9,n,｢,ﾗ--A-v-ｫ-..L..ｷ./$/Z//ﾇ/050l0､0ﾛ11J11ｺ12*2c22ﾔ3
3F33ｸ34+4e44ﾘ55M55ﾂ5676r6ｮ67$7`77ﾗ88P88ﾈ99B99ｼ9:6:t:ｲ:;-;k;ｪ;<' >`>>?!?a?｢?磧#@d@ｦ@蹉)AjAｬAB0BrBｵBC:C}CﾀDDGD灰ﾎEEUE哘ﾞF"FgFｫFG5G{GﾀHHKH践ﾗIIcIｩIJ7J}JﾄKKSK哮祗*LrLｺMMJM溺ﾜN%NnNｷOOIO徹ﾝP'PqPｻQQPQ娉覲1R|RﾇSS_SｪSTBT週ﾛU(UuUﾂVV\VｩVWDW淡濆/X}XﾋYYiYｸZZVZｦZ[E[票藹5\\ﾖ]']x]ﾉ^^l^ｽ__a_ｳ``W`ｪ`aOa｢abIb彙cCc幼d@d播馥=e弾軫=f断鑒=g堵馼?h防iCi喨jHj殍kOkｧklWlｯmm`mｹnnknﾄooxoﾑp+pp瀲:q敏rKrｦss]sｸttptﾌu(uu疱>v孥wVwｳxxnxﾌy*y謁轉Fz･{{c{ﾂ|!|−痾A}｡~~b~ﾂ#蛟Gｨ
〔∀0ｒジｺо繞Gｫrﾗ;汕i夷3甥嚇缶0許屈慶弧1腰伺斜6償刃蹟?捉築偵溺童 矧簸廟碧4漫
蓉伶廊从$剞咨喇墸妝岷怏戈拇旆曄椣沂滯iﾘ｡G｡ｶ｢&｢魅｣v｣讀V､ﾇ･8･ｩｦｦ協ｧnｧ爲Rｨﾄｩ7ｩｩｪｪ将ｫuｫ鬯\ｬﾐｭDｭｸｮ-ｮ｡ｯｯ恐ｰuｰｱ`ｱﾖｲKｲﾂｳ8ｳｮｴ%ｴ愀ｵ憾ｶyｶｷhｷ犧YｸﾑｹJｹﾂｺ;ｺｵｻ.ｻｧｼ!ｼ嵜ｽ樟
ｾ╂ｿzｿﾀpﾀﾁgﾁ翊_ﾂﾛﾃXﾃﾔﾄQﾄﾎﾅKﾅﾈﾆFﾆﾃﾇAﾇｿﾈ=ﾈｼﾉ:ﾉｹﾊ8ﾊｷﾋ6ﾋｶﾌ5ﾌｵﾍ5ﾍｵﾎ6ﾎｶﾏ7ﾏｸﾐ9ﾐｺﾑ<ﾑｾﾒ?ﾒﾁﾓDﾓﾆﾔIﾔﾋﾕNﾕﾑﾖUﾖﾘﾗ\ﾗ獵dﾘ鞁lﾙﾚvﾚﾛﾜﾜ岸ﾝ尤ﾞ｢ﾟ)ﾟｯ6狄瓮睥禊籟緜肭舖蕈蜆
譁遨2霈颶鰔鷦褄p懣(ｴ@ﾌX褥r候ｧ4ﾂPﾞm旗ｨ8ﾇW鍄w)ｺKﾜm&File written by Adobe Photoshopｨ 5.2Adobedﾛ







""ﾀPFﾝ	ﾄ｢	
	
s!1AQa"q2贈ｱB#ﾁRﾑ3b$rん%C4S弔ｲcsﾂ5D'謄ｳ6Tdtﾃﾒ&	
忍F､ｴVﾓU(胚ﾄﾔ蔬eu払ｵﾅﾕ襄fv岬ｶﾆﾖ踐7GWgw立ｷﾇﾗ銷8HXhx乖ｸﾈﾘ顏)9IYiy甥ｩｹﾉﾙ鴿*:JZjz噛ｪｺﾊﾚm!1AQa"q¢2｡ｱﾁﾑ#BRbr3$4C担%｢cｲﾂsﾒ5礇T	
&6E'dtU7｣ｳﾃ()ﾓ胚筈ｴﾄﾔ蔬eu払ｵﾅﾕ襄FVfv岬ｶﾆﾖ踐GWgw立ｷﾇﾗ銷8HXhx乖ｸﾈﾘ顏9IYiy甥ｩｹﾉﾙ鴿*:JZjz噛ｪｺﾊﾚﾚ?ﾘｫｱU+笈ｭ｢if`ｱｯR	Anﾌﾗ2ｶ"O輓ﾘg2cｹｸﾍ|神､5Wｾｱ%}癈熄s)+Cｯ麪0禝Uﾆ@Wﾅﾉ>)ﾓ3Xq>(ﾏk傚1亶C 団文ｻﾐﾘｫｱV)諚ｧ{ﾕｵｭ#On螺;[鋸IUｲq^l噫dvz|r@\(3S ｹ1舎F｡
｣2ﾘ嬖丶3<,ﾑｷ菰癈1ｰﾀ,=Xc又譯ｩﾌ(ｹﾀﾘTﾀﾑﾘｪ栽ﾄvﾐｼ1ﾆ*N,	"ﾛﾌ1ﾈHn穉┗^ｳﾋ/7ｴP喙uｧ^iYVｱ賎ﾂr靂IｨﾄｈSdN ﾓ"`ﾈM#ﾍw/Tｻ條r\旁;_/､nｵS1/Mｿ卅譛ｪYlﾐl*ﾜｦ.ｰｷ$lMｯ泪+ﾉﾜsｴﾛ*lﾒﾘｫﾅﾓAｧA4Yｦ
ﾇﾘ+53#N.N>ﾐc嘲ｶ､ﾐｿ?糞*Bﾆ{'VV冑｣洸r續MN+NQ(JEｾ2	VｭｮMz8鰥タ?eｰﾃﾂﾗ<廩/ﾟ4~`ｵE;JZ6ｸ簣,｣ﾒﾃｩ=0ﾓﾘｫ椦%岩!ﾊXL九ﾇf'.ﾃ>4謐巓^ 1zfypy&曽ｫSｧｭ_ﾗSﾟV5ﾒ挫ﾕ橿wｦ昿ｰ訳X7?sjｦ際斈*ｿ9N｢T)ｻ,ﾛﾒﾎﾔﾘｪﾓ烝PX/<猛ﾈﾚO膃Km^Iﾆ劔=m'&｡:\ﾚﾊc瓢)ｪｸ*v%ｳ(n笶突sC[eK0ﾉqｧｩﾘｸ?疵ｩ缸[a5ｸJ/o~ｳpEﾛﾄ~ﾄ(I篆ｾ&甸ﾑ9ｵ菖ｳ|ｿY怡Rﾁ~).eﾛ閑ｾ'ﾊfl#'･阮ﾚmｶ
i､5ｭ*ｲu,i滌ｮYｯ伯漉:1'ﾕﾘｪQ觴]BI
9ﾜ5
禳Gﾚ@ﾙf9-ﾚD袖画MUgﾞﾕC	ΑｷPx蓋粐ﾟｵ9ｲD$9ｹｱｳｻ^7PG2H｡ｿ禳	Y･ｭ/.1ｩｰ丈+e,ｻﾘxQDﾚ鏤5｡蚩e0鞋Ao&葮9e逗鄭43 xﾜQ微M[[Ak
ﾁn8直T{曩ｯｾ*ｫ漢ﾖｸｫﾗ5ｫｿ(Iuｬ7Xｰ栖ZX･yﾈ蔗5V#Xﾗﾉ面Q#aｻTc w(]ﾎ~~ﾕ秕Bﾗﾊｩ1(ｽK･蓋Cｽc@褞渤|ｩｵ彿ﾗｭ{i[ﾉi+ﾞ[ﾌ(霤f_ｨ6璧ｪ+j｢ｴｮiﾟw%ｩF*ﾞ*ﾖ*ﾗ?促'Y*RﾙB~%`Gｾ*qnﾈｾOｼ惷ｶI-籤T擢3入+pﾅ^pｨhﾆ]&$An｡"ｼ|?ﾉﾅ^1q=wﾌ_目ﾅｫpgｻｰｾA2"ﾆQOoDﾏ幹ﾍjo?%｣ｻV疝1o禁W6ｫﾋﾔjﾘｫ
ﾄ~UZ	d幾O2ёY8ｱ愆Rzg?/4->;K臾/ﾌ`ﾜ\<7ｭ'VhYｽ沙}ｫ晶蕪^ﾓｮef0ﾍKyｷ}H茴}ﾏc>]銑柤ﾉ[5ｽｱEﾏﾔ紕ｯﾘｾ1Wﾐ輩Uu霊ｼｻurﾗﾊa"ｯv9_'"EOﾉ寒Ul6ﾞFｳｽoﾇﾂs	ﾜ+H7想=XﾟLU-日

  
    Notes for using the ANTLR Python Code Generator
  
  
    
Python Code Generator for ANTLR 2.7.7

    
As of ANTLR 2.7.5, you can generate your Lexers,
    Parsers and TreeParsers in Python. This feature extends the benefits of
    ANTLR's predicated-LL(k) parsing technology to the Python language and
    platform.

    
To be able to build and use the Python language Lexers, Parsers and
    TreeParsers, you will need to have the ANTLR Python runtime library
    installed in your Python path. The Python runtime model is based on the
    existing runtime model for Java and is thus
    immediately familiar. The Python runtime and the Java runtime are very
    similar although there a number of subtle (and not so subtle)
    differences. Some of these result from differences in the respective
    runtime environments.

    
ANTLR Python support was contributed (and is to be maintained) by
    Wolfgang Haefelinger and Marq Kole.

    
Building the ANTLR Python Runtime

    
The ANTLR Python runtime source and build files are completely
    integrated in the ANTLR build process.The ANTLR runtime support module
    for Python is located in the lib/python subdirectory
    of the ANTLR distribution. Installation of the Python runtime support
    is enabled automatically if Python can be found on your system by the
    configure script.

    
With Python support enabled the current distribution will look for
    the presence of a python executable of version 2.2 or higher. If it has
    found such a beast, it will generate and install the ANTLR Python
    runtime as part of the overall ANTLR building and installation
    process.

    
If the python distribution you are using is at an unusual location,
    perhaps because you are using a local installation instead of a
    system-wide one, you can provide the location of that python executable
    using the --with-python=<path> option for the configure
    script, for instance:

    


./configure --with-python=$HOME/bin/python2.3


    

    
Also, if the python executable is at a regular location, but has a
    name that differs from "python", you can specify the correct
    name through the --with-python=<path>, as shown above, or through
    environment variable $PYTHON

    


PYTHON=python2.3
export PYTHON
./configure


    

    
All the example grammars for the ANTLR Python runtime are built when
    ANTLR itself is built. They can be run in one go by running make
    test in the same directory where you ran the configure script in
    the ANTLR distribution. So after you've run configure you can
    do:

    


# Build ANTLR and all examples
make
# Run them
make test
# Install everything
make install






Note that make install will not add the ANTLR Python
runtime (i.e. antlr.py) to your Python installation but rather install
antlr.py in ${prefix}/lib. To be able to use antlr.py you
would need to adjust Python's sys.path.



However, there a script is provided that let's you easily add antlr.py
as module to your Python installation. After installation just run




${prefix}/sbin/pyantlr.sh install





Note that usually you need to be superuser in order to succeed. Also
note that you can run this command later at any time again, for
example, if you have a second Python installation etc. Just make sure
that python is in your $PATH when running pyantlr.sh.



Note further that you can also do this to install ANTLR Python
runtime immediatly after having called ./configure:
 



scripts/pyantlr.sh install





    
Specifying Code Generation

    
You can instruct ANTLR to generate your Lexers, Parsers and
    TreeParsers using the Python code generator by adding the following
    entry to the global options section at the beginning of your grammar
    file.

    


{
    language="Python";
}


    

    
After that things are pretty much the same as in the default
    java code generation mode. See the examples in
    examples/python for some illustrations.

    
One particular issue that is worth mentioning is the handling of
    comments in ANTLR Python. Java, C++, and C# all use the same lexical
    structures to define comments: // for single-line
    comments, and /* ... */ for block comments. Unfortunately,
    Python does not handle comments this way. It only knows about
    single-line comments, and these start off with a #
    symbol.

    
Normally, all comments outside of actions are actually comments in
    the ANTLR input language. These comments, and that is both block
    comments and single-line comments are translated into Python
    single-line comments.

    
Secondly, all comments inside actions should be comments in the
    target language, Python in this case. Unfortunately, if the actions
    contain ANTLR actions, such as $getText, the code
    generator seems to choke on Python comments as the # sign
    is also used in tree construction. The solution is to use Java/C++-style
    comments in all actions; these will be translated into Python comments
    by the ANTLR as it checks these actions for the presence of predefined
    action symbols such as $getText.

    
So, as a general issue: all comments in an ANTLR grammar for the
    Python target should be in Java/C++ style, not in Python style.

    
Python-Specific ANTLR Sections

    
    
      
  • 
        header - specify additional import directives 
        
    You can instruct the ANTLR Python code generator to import
        additional Python packages in your generated
        Lexer/Parser/TreeParser by adding code to the header section which
        must be the first section at the beginning of your ANTLR grammar
        file, apart from any other header sections.
    
        
    

    header {
   import os, sys
}

    
        
    
      
    • 
      
  • 
        header "__init__" - specify additional code in the
        __init__ method 
        
    You can instruct the ANTLR Python code generator to include
        additional Python code in your generated Lexer/Parser/TreeParser by
        adding code to the init header section which must
        be the first section at the beginning of your ANTLR grammar file,
        apart from any other header sections. The code in the header is
        appended to the end of the __init__ method.
    
        
    

    header "__init__" {
   self.message = "This is the default message"
}

    
        
    
        
    If your grammar file contains both a Lexer and a Parser (or any
        other multiple of definitions), the code in the
        __init__ header will be reproduced in the
        __init__ methods of all of these definitions without
        change. If you really want to update only one of the definitions,
        for instance, the __init__ method of the Lexer class
        you are creating, use
    
        
    

    header "<LexerGrammar>.__init__" {
   self.message = "This is the default message"
}

    
        
    
        
    where <LexerGrammar> is the name of the Lexer
        grammar. The same construction also works with the Parsers and
        TreeParsers, of course.
    
        
    In the case both a generic init header and a grammar-specific
        header are present, the grammar-specific one will override the
        generic one.
    
      
    • 
      
  • 
        header "__main__" - specify additional code after the class
        definition 
        
    You can instruct the ANTLR Python code generator to add
        additional Python code at the end of your generated
        Lexer/Parser/TreeParser, so after the class definition itself by
        adding code to the __main__ header section which must
        be the first section at the beginning of your ANTLR grammar file,
        apart from any other header sections.
    
        
    

    header "__main__" {
    print "You cannot execute this file!"
}

    
        
    
        
    If your grammar file contains both a Lexer and a Parser (or any
        other multiple of definitions), the code in the __main__
        header will be reproduced at the end of all of the generated class
        definitions. If you really want to add code after only one of the
        definitions, for instance, after the Lexer class, use
    
        
    

    header "<LexerGrammar>.__main__" {
    print "You cannot execute this file!"
}

    
        
    
        
    where <LexerGrammar> is the name of the Lexer
        grammar. The same construction also works with the Parsers and
        TreeParsers, of course.
    
        
    In the case both a generic init header and a grammar-specific
        header are present, the grammar-specific one will override the
        generic one. If no __main__ headers are present and the
        grammar is for a Lexer,  automated test code for that lexer is
        automatically added at the end of the generated module. This can be
        prevented by providing an empty __main__ header. In the
        latter case it is good practise to provide a comment explaining why
        an empty header is present.
    
        
    

    header "<LexerGrammar>.__main__" {
    // Empty main header to prevent automatic test code from being added
    // to the generated lexer module.
}

    
        
    
        
    This automated test code can be executed by running Python with
        the generated lexer file (<LexerGrammar>.pywhere
        <LexerGrammar> is the name of the Lexer grammar) and
        providing some test input on stdin:
    
        
    

    python <LexerGrammar>.py < test.in

    
        
    
      
    • 
    

    
Python-Specific ANTLR Options

    
    
      
  • 
        className - change the default name of the generated class 
        
    
        
    

    options {
    className="Scanner";
}

    
        
    
        
    If you are using the className option conjunction with the
        Python specific header options, there will be no collisions. The
        className option changes the class name, while the
        main headers require the use of the grammar name which
        will become the module name after code generation.
    
        
    

    header "ParrotSketch.init" {
    self.state = JohnCleese.select("dead", "pushing up daisies", \
                                   "no longer", "in Parrot Heaven")
    print "This parrot is", self.state
}

class ParrotSketch extends Lexer;

options {
    className="Scanner";
}

    
        
    
      
    • 
    

    
A Template Python ANTLR Grammar File

    
As the handling of modules &emdash; packages in Java speak &emdash;
    in Python differs from that in Java, the current approach in ANTLR to
    call both the file and the class they contain after the name of the
    grammar is kind of awkward. Instead, a different approach is chosen that
    better reflects the handling of modules in Python. The name of the
    generated Python file is still derived from the name of the grammar, but
    the name of the class is fixed to the particular kind of grammar. A
    lexer grammar will be used to generate a class Lexer; a parser
    grammar will be used to generate a class Parser; and a
    treeparser grammar will be used to generate a class Walker.

    


header {
    // gets inserted in the Python source file before any generated
    // declarations
    ...
}
header "__init__" {
    // gets inserted in the __init__ method of each of the generated Python
    // classes
    ...
}
header "MyParser.__init__" {
    // gets inserted in the __init__ method of the generated Python class
    // for the MyParser grammar
    ...
}
header "__main__" {
    // gets inserted at the end of each of the generated Python files in an
    // indented section preceeded by the conditional:
    // if __name__ == "__main__":
    ...
}
header "MyLexer.__init__" {
    // gets inserted at the end of the generated Python file for the MyLexer
    // grammar in an indented section preceeded by the conditional:
    // if __name__ == "__main__":
    // and preventing the insertion of automatic test code in the same place.
    ...
}
options {
    language  = "Python";
}
{
    // global code stuff that will be included in the 'MyParser.py' source
    // file just before the 'Parser' class below
    ...
}
class MyParser extends Parser;
options {
   exportVocab=My;
}
{
   // additional methods and members for the generated 'Parser' class
   ...
}
... generated RULES go here ...
{
   // global code stuff that will be included in the 'MyLexer' source file
   // just before the 'Lexer' class below
   ...
}
class MyLexer extends Lexer;
options {
   exportVocab=My;
}
{
   // additional methods and members for the generated 'Lexer' class
   ...
}
... generated RULES go here ...
{
   // global code stuff that will be included in the 'MyTreeParser' source
   // file just before the 'Walker' class below
   ...
}
class MyTreeParser extends TreeParser;
options {
   exportVocab=My;
}
{
   // additional methods and members for the generated 'Walker' class
   ...
}
... generated RULES go here ...


      
Version number in parentheses shows the tool version used to
      develop and test. It may work with older versions as well. Python 2.2
      or better is required as some recent Python features (like
      super() for example) are being used.

      
More notes on using ANTLR Python

      
    
        
  • 
          
    The API of the generated lexers, parsers, and treeparsers is
          supposed to be similar to the Java ones. However, calling a lexer
          is somewhat simplified:
     
          
    

    ### class "calcLexer extends Lexer" will generate python
### module "calcLexer" with class "Lexer". 
import calcLexer
### read from stdin ..
L = calcLexer.Lexer() 
### read from file "test.in" ..
L = calcLexer.Lexer("test.in")
### open a file and read from it ..
f = file("test.in", "r")
L = calcLexer.Lexer(f)
### this works of course as well
import sys
L = calcLexer.Lexer(sys.stdin)
### use a shared input state
L1 = calcLexer.Lexer(...)
state = L1.inputState
L2 = calcLexer.Lexer(state)

    
          
    
        
    • 
        
  • 
          
    The loop for the lexer to retrieve token by token can be written
          as:
     
          
    

    lexer = calcLexer.Lexer()          ### create a lexer for calculator
for token in lexer:
    ## do something with token
    print token

    
          
    
          or even: 
          
    

    for token in calcLexer.Lexer():    ### create a lexer for calculator
    ## do something with token
    print token

    
          
    
          
    As an iterator is available for all TokenStreams, you
          can apply  the same technique with a TokenStreamSelector.
    
        
    • 
        
  • 
          
    However, writing this particular lexer loop is rarely necessary as it
          is generated by default in each generated lexer. Just run:
     
          
    

    python calcLexer.py < calc.in

    
          
    
          to test the generated lexer.
    
        
    • 
        
  • 
          
    Symbolic token number, table of literals bitsets and bitset data
          functions are generated on file (module) scope instead of class
          scope. For example:
     
          
    

    import calcLexer      # import calc lexer module
  
calcLexer.EOF_TYPE    # prints 1
calcLexer.literals    # { ';': 11, 'end': 12, 'begin': 10 }

    
          
    
        
    • 
        
  • 
          
    Comments in action should be in Java/C++ formats, ie. //
          and /* ... */ are valid comments. However, make sure
          that you put a comment before or after a statement, but not
          within. For example, this will not work:
     
          
    

    x = /* one */ 1

    
          
    
          
    The reason is that Python only supports single-line comments. Such
          a Python comment skips everything till end-of-line. Therefore in
          the translation of the comment a newline will be introduced on
          reaching */. The code above would result in the following
          Python code in the generated file:
    
          
    

    x = # one
1

    
          
    
          
    which is probably not what you want.
    
        
    • 
        
  • The Lexer actions $newline, $nl and
        $skip have been introduced as language independent
        shortcuts for calling self.newline() ($newline,
        $nl) and _ttype = SKIP ($skip).
    
        
    • 
        
  • 
           
    In Python arguments to function and method calls do not have a
          declared type. Also, functionns and methdos do not have to declare
          a return type. If you want to pass a value to a rule in your grammar,
          you can do so by providing simply the name of a variable.
    
          
    

    ident [symtable]
    :   ( 'a'..'z' | '0'..'9' )+
    ;

    
          
    
          
    Similarly, is you want a rule to pass a return value, you do not
          have to provide a type either. It is possible to provide a default
          value.
     
          
    

    sign returns [isPos = False]
    :    '-' { /* default value is OK */ }
    |    '+' { isPos = True }
    ;

    
          
    
        
    • 
        
  • 
          
    The __init__ method of the generated Lexer, Parser, or
          TreeParser has the following heading:
    
          
    

    def __init__(self, *args, **kwargs):
    ...

    
          
    
          
    So if you need to pass special arguments to your generated class,
          you can use the **kwargs to check for a particular keyword
          argument, irrespective of any non-keyword arguments that you did
          provide. So if you have a TokenStreamSelector that you want
          to access locally, you can pass it to the Lexer in the following
          call:
    
          
    

    MySpecialLexer.Lexer(sys.stdin, selector=TokenStreamSelector())

    
          
    
          
    while in the __init__ header of this particular grammar
          you can specify the handling of the selector keyword
          argument in the following way:
    
          
    

    header "MyParser.__init__" {
    self.selector = None
    if kwargs.has_key("selector"):
        self.selector = kwargs["selector"]
        assert(isinstance(self.selector, TokenStreamSelector))

}

    
          
    
        
    • 
        
  • 
          
    Because of limitations in the lexer of the ANTLR compiler
          generator  itself, you cannot use single quoted strings of more than
          one character  in your Python code.
    
          So if you use a Python string like 'wink, wink, nudge,
          nudge'  in one of your actions, ANTLR will give a parse error
          when you try to compile this grammar. Instead you should use double
          quotes: "wink, wink, nudge, nudge".
    
        
    • 
        
  • 
          
    Unicode is supported but it's easy to run into errors if your
          terminal(output device) is not able to handle unicode chars.
    
          Here are some rules when using Unicode input:
     
          
      
            
    1. 
              You need to wrap your input stream by a stream reader which
              translates bytes into unicode chars. This requires usually
              knowledge about your input's encoding. Assume for example
              that your input is 'latin1', you would do this: 
              
      

      ### replace  stdin  with  a  wrapper that spits out
### unicode chars.       
sys.stdin = codecs.lookup('latin1')[-2](sys.stdin)

      
              
      
              Here reading from stdin gets wrapped.
            
      2. 
            
    2. 
              When printing tokens etc containing Unicode chars it appears
              to be best to translate explicit to a unicode string before
              printing. Consider: 
              
      

      for token in unicode_l.Lexer() :
    print unicode(token)   ## explict cast

      
              
      
              This explicit cast appears to be a bug in Python found during
              development (discussion still in progress).
            
      3. 
          
    
        
    • 
      

    

  

antlr-2.7.7/scripts/0000755000175000017500000000000010522211616014270 5ustar  twernertwernerantlr-2.7.7/scripts/Rules.make0000644000175000017500000002400610522211616016223 0ustar  twernertwerner###############################################################################
# $Id:$
###############################################################################
#
# Rules.make :
#  General make rules, supporting
#   -compilation of .cpp to .o, .cpp to .s and .s to .o
#   -combining of multiple .o files into one single .o file
#   -creation of .a archives from multiple .o files
#   -recursive subdirectories
#   -recursive (dist)clean
#   -creation of binary executables
#   -doxygen generated docs
#

.EXPORT_ALL_VARIABLES:

#
# Depending on the definition of these variables in submakefiles different
# targets get build.
# NOTE: These should not be exported so we unexport them right here.
#
unexport SUBDIRS			# specifying all subdirs from $(TOPDIR)
unexport SUB_DIRS       # specifying all subdirs to make
unexport ALL_SUB_DIRS   # specifying all subdirs to process (dep/clean)

unexport O_TARGET			# name of combined .o file to generate
unexport O_OBJS			# name of .o files to combine into $(O_TARGET)

unexport L_TARGET			# name of .a archive to generate
unexport L_OBJS			# name of .o files to place in $(L_TARGET)

unexport B_NAME			# name of binary to generate
unexport B_OBJS			# name of .o files to combine into $(B_NAME)

unexport GCJ_B_NAME		# Rules for gcj (native java binaries)
unexport GCJ_B_OBJS

unexport DOXY_TARGET		# name of a doxygen config file to build docs from
unexport DOXY_GENDIR    # name of dir doxygen generates docs into

unexport JAR_TARGETS		# jar files..
unexport JAR_DEST			# jar files..

unexport G_FILES        # antlr .g files
unexport G_TAG_FILES		# empty file to record compiling .g files
unexport G_TARGETS		# per-Makefile list of ANTLR generated files

unexport C_TARGETS		# name of additional targets to "clean"
unexport DC_TARGETS		# name of additional targets to "distclean"

#
# Implicit rules
#
%.s:	%.cpp
	$(CXX) $(CXXFLAGS) $(EXTRA_CXXFLAGS) -S $< -o $@
#
# These rules support buiding the .o files into a obj_dir different than the
# current dir. This keeps the source dirs nice and clean..
# FIXME: VPATH?
#
ifdef obj_dir
OBJDIR_DEP := $(obj_dir)objects
else
OBJDIR_DEP :=
obj_dir :=
endif

$(obj_dir)%.o:	%.cpp $(OBJDIR_DEP)
	$(CXX) -c -o $@ $< $(CXXFLAGS) $(SHARED_FLAGS)

$(obj_dir)%.o: %.c
	$(CC) $(CFLAGS) $(SHARED_FLAGS) -c -o $@ $<

$(obj_dir)%.o: %.s
	$(AS) $(ASFLAGS) -o $@ $<

#
# Automatic dependency generation rules
#
$(obj_dir)%.d: %.c $(OBJDIR_DEP)
	@echo "Building dependencies for $<"
	@$(CC) -MM -MG $(CFLAGS) $< | $(SED) -e 's,\($*\)\.o[ :]*,$(obj_dir)\1.o $@ : ,g' > $@
$(obj_dir)%.d: %.cpp $(OBJDIR_DEP)
	@echo "Building dependencies for $<"
	@$(CXX) -MM -MG $(CXXFLAGS) $< | $(SED) -e 's,\($*\)\.o[ :]*,$(obj_dir)\1.o $@ : ,g' > $@
$(obj_dir)%.d: %.g $(OBJDIR_DEP) ;
	@echo "Building dependencies for $<"
	@echo "$($(addsuffix _FILES,$(subst .,_,$<))): $(obj_dir).$*.g ;" > $@

#
# How to make .x.g files from .g files. (ANTLR)
# A .x.g file is an empty target to record running ANTLR on x.g
# Customize flags per file 'x.g' by setting x_FLAGS
# The chmod is dirty but it makes life a lot easier with perforce
#
$(obj_dir).%.g: %.g $(OBJDIR_DEP);
	@ -$(CHMOD) -f u+w $($(addsuffix _FILES, $(subst .,_,$^))) 2> /dev/null
	$(ANTLR) $(ANTLR_FLAGS) $($*_FLAGS) $^
	@ $(TOUCH) $@

ifdef G_FILES
# make list of the sentinel files of the .g files
G_TARGETS := $(addprefix .,$(G_FILES))
endif

#
# How to build class files
#
# Take along existing CLASSPATH definition. Necessary for jikes.
ifdef JAVAC_CLASSPATH
 ifneq ($(JAVAC_CLASSPATH),)
  javac_paths= -classpath $(call fix_path,$(TOPDIR)$(PATH_SEPARATOR)$(JAVAC_CLASSPATH))
 else
  javac_paths	= -classpath $(call fix_path,$(TOPDIR))
 endif
endif

#
# For native binary java
#
%.o:  %.java
ifdef VERBOSE
	$(GCJ) -c -o $@ $< -classpath $(TOPDIR) $(GCJFLAGS) $(EXTRA_GCJFLAGS)
else
	@ echo "Building native binary for $<"
	@ $(GCJ) -c -o $@ $< -classpath $(TOPDIR) $(GCJFLAGS) $(EXTRA_GCJFLAGS)
endif

#
# For class files
#
%.class: %.java
ifdef VERBOSE
	$(JAVAC) $(JAVAC_FLAGS) $(javac_paths) $(obj_dir_arg) $<
else
	@ echo "Building java bytecode for $<"
	@ $(JAVAC) $(JAVAC_FLAGS) $(javac_paths) $(obj_dir_arg) $<
endif
unexport obj_dir_arg javac_paths

#
# Note: this stuff is just too annoying to use.... Now do it in the
# submakefile itself
#
#  How to build a Java jar file.
#
#  Note: The jar contents are taken from the rule dependency
#  list; thus the user must explicitly define dependencies per
#  jar target.  E.g.
#     x.jar : $(x_jar_FILES)
#  Make performs variable expansion before implicit rule search,
#  hence, the desired implicit rule dependency
#	$($(subst .,_,$%)_jar_FILES)
#  is an undefined variable, resulting in an empty dependency
#  list.
#
#%.jar:
#	@ echo "==========================================="
#	@ echo "Making $(JAR_DEST)/$(@)..."
#	@ rm -f $@
#	@ (cd $(JAR_DEST) $(JAR) cf $(JAR_DEST)/$@ $(subst $$,\$$,$^)
#	@ echo "==========================================="

#
# Get things started:
# 1. Build ANTLR generated files, subdirectories.
# 2. Remaining TARGETS
#
first_rule: sub_dirs
	$(MAKE) all_targets

unexport TARGETS
#
# Build default targets
#
all_targets: $(G_TARGETS) $(O_TARGET) $(L_TARGET) $(GCJ_B_NAME) $(B_NAME) $(JAR_TARGETS) $(GCJ_B_NAME)

#
# Compile a set of .o files into one .o file
#
ifdef O_TARGET
$(O_TARGET): $(O_OBJS)
	-$(RM) -f $@
ifneq "$(strip $(O_OBJS))" ""
	$(LD) $(EXTRA_LDFLAGS) -r -o $@ $(O_OBJS)
else
	$(AR) rus $@
endif
endif

#
# Compile a set of .o files into one .a file
#
ifdef L_TARGET
$(L_TARGET): $(L_OBJS)
	-$(RM) -f $@
	$(AR) $(EXTRA_ARFLAGS) $(ARFLAGS) $@ $(L_OBJS)
	$(RANLIB) $@
endif

#
# This takes care of creating obj_dirs's
#
ifdef obj_dir
$(OBJDIR_DEP): ;
	$(MKDIR) -p $(obj_dir)
	$(TOUCH) $(OBJDIR_DEP)
endif

ifeq ($(ANTLR_WIN32),"yes")
ifdef DLL_TARGET
$(DLL_TARGET): $(DLL_OBJS)
	-$(RM) -f $@
	$(CXX) -o $@ -Wl,-mdll $(L_OBJS)
endif
endif

ifdef DOXY_TARGET
gen_doc: $(DOXY_TARGET) ;
ifdef DOXY_GENDIR
ifneq ($(DOXY_GENDIR),)
	-$(RM) -f $(DOXY_GENDIR)/*
endif
endif
ifneq ($(DOXYGEN),"")
	$(DOXYGEN) -f $(DOXY_TARGET)
else
	echo "Doxygen not installed skipping $(DOXY_TARGET)"
endif
endif

# Rule to make subdirs
#
.PHONY: $(SUB_DIRS) sub_dirs
sub_dirs: $(SUB_DIRS)
ifdef SUB_DIRS
ifneq ($(strip $(SUB_DIRS)),)
$(SUB_DIRS):
	@echo ">>>>>>>>>>>>>>>>>>>> Entering $@ ..."
	$(MAKE) -C $@
	@echo "<<<<<<<<<<<<<<<<<<<< Leaving $@"
endif
endif

#
# Rule to make binaries
#

ifdef B_NAME
$(B_NAME): $(B_OBJS)
	-$(RM) -f $@
	$(CXX) -o $@ $(EXTRA_LDFLAGS) $(B_OBJS) $(EXTRA_LIBS)
endif

ifdef GCJ_B_NAME
$(GCJ_B_NAME): $(GCJ_B_OBJS)
	@ -$(RM) -f $@
	$(GCJ) $(GCJFLAGS) $(EXTRA_GCJFLAGS) -o $@ --main=antlr.Tool $(GCJ_B_OBJS)
endif

#
# Include dependency files if they exist (and we're not cleaning)
#
ifneq (clean,$(findstring clean,$(MAKECMDGOALS)))
-include .depend
ifneq ($(SOURCE),)
-include $(addprefix $(obj_dir),$(SOURCE:.cpp=.d))
endif
ifneq ($(SOURCES),)
-include $(addprefix $(obj_dir),$(SOURCES:.cpp=.d))
endif
ifneq ($(CXXSOURCE),)
-include $(addprefix $(obj_dir),$(CXXSOURCE:.cpp=.d))
endif
ifneq ($(GCJSOURCES),)
-include $(GCJSOURCES:.java=.d)
endif
ifneq ($(CSOURCE),)
-include $(addprefix $(obj_dir),$(CSOURCE:.c=.d))
endif
ifneq ($(G_FILES),)
-include $(addprefix $(obj_dir),$(G_FILES:.g=.d))
endif
endif

#
#  Rule to bootstrap from external ANTLR jar.
#
.PHONY: bootstrap_g
bootstrap_g: ANTLR := $(ANTLR_BOOTSTRAP)
bootstrap_g: ANTLR_FLAGS := $(ANTLR_BOOTSTRAP_FLAGS)
bootstrap_g: $(G_TAG_FILES)
ifdef ALL_SUB_DIRS
	@set -e; for i in $(ALL_SUB_DIRS); do $(MAKE) -C $$i bootstrap_g; done
endif

#
#  Rule to clean ANTLR generated files (corresponding
#  to bootstrap_g targets).
#
.PHONY: clean_g
clean_g:
ifdef ALL_SUB_DIRS
	@set -e; for i in $(ALL_SUB_DIRS); do $(MAKE) -C $$i clean_g; done
endif
	-$(RM) -f $(G_TAG_FILES) $(G_TARGETS)

#
# Rule to remove all objects, cores, etc.; leaving
# ANTLR generated and config files.
#
.PHONY: mostlyclean
mostlyclean:
ifdef obj_dir
ifneq ($(obj_dir),)
	-$(RM) -f $(obj_dir)/*
endif
endif
ifdef DOXY_GENDIR
ifneq ($(DOXY_GENDIR),)
	-$(RM) -f $(DOXY_GENDIR)/*
endif
endif
ifdef ALL_SUB_DIRS
	set -e; for i in $(ALL_SUB_DIRS); do $(MAKE) -C $$i mostlyclean; done
endif
	-$(RM) -f *.o *.class *.a *.so core *.s $(B_NAME) $(C_TARGETS) $(JAR_TARGETS)

#
# Rule to remove all objects, cores, ANTLR generated, etc.;
# leaving configure generated files.
#
.PHONY: clean
clean: mostlyclean clean_g
ifdef obj_dir
# make sure to do nothing if obj_dir empty...
ifneq ($(obj_dir),)
	@-test -d $(obj_dir) && $(RM) -f $(obj_dir)/* $(obj_dir)/.*.g
	@-test -d $(obj_dir) && $(RMDIR) $(obj_dir)
endif
endif
ifdef ALL_SUB_DIRS
	set -e; for i in $(ALL_SUB_DIRS); do $(MAKE) -C $$i clean; done
endif

#
# Rule to remove all objects, cores, ANTLR generated,
# configure generated, etc.; leaving files requiring
# additional programs to generate (e.g., autoconf).
#
# FIXME: can not be called more than once successively because
# FIXME: it removes files unconditionally included by subdirectory
# FIXME: Makefiles (e.g., Config.make).
#
.PHONY: distclean
distclean: clean
ifdef ALL_SUB_DIRS
	set -e; for i in $(ALL_SUB_DIRS); do $(MAKE) -C $$i distclean; done
endif
	-$(RM) -f .depend $(DC_TARGETS)

#
#  Install rule
#
ifndef OVERRULE_INSTALL
.PHONY: install
install:
ifdef B_NAME
	@echo "Installing $(B_NAME) into $(bindir)"
	@test -d $(DESTDIR)$(bindir) || $(MKDIR) -p $(DESTDIR)$(bindir)
	@$(INSTALL) -m 755 $(B_NAME) $(DESTDIR)$(bindir)
endif
ifdef L_TARGET
	@echo "Installing $(L_TARGET) into $(libdir)"
	@test -d $(DESTDIR)$(libdir) || $(MKDIR) -p $(DESTDIR)$(libdir)
	@$(INSTALL) -m 644 $(L_TARGET) $(DESTDIR)$(libdir)
endif
ifdef JAR_TARGETS
	@test -d $(DESTDIR)$(datadir)/$(versioneddir) || $(MKDIR) -p $(DESTDIR)$(datadir)/$(versioneddir)
	@for i in $(JAR_TARGETS); do \
		echo "Installing $i into $(datadir)/$(versioneddir)" \
		$(INSTALL) -m 644 $$i $(DESTDIR)$(datadir)/$(versioneddir) ;\
	done
endif
ifdef INSTALL_TARGETS
	@test -d $(DESTDIR)$(INSTALL_DIR) || $(MKDIR) -p $(DESTDIR)$(INSTALL_DIR)
	@for i in $(INSTALL_TARGETS); do \
		echo "Installing $$i into $(INSTALL_DIR)" ; \
		$(INSTALL) -m $(INSTALL_MODE) $$i $(DESTDIR)$(INSTALL_DIR) > /dev/null ;\
	done
endif
ifdef ALL_SUB_DIRS
	@set -e; for i in $(ALL_SUB_DIRS); do $(MAKE) -C $$i install; done
endif
endif
antlr-2.7.7/scripts/lib.sh.in0000755000175000017500000001545310522211616016012 0ustar  twernertwerner#!/bin/sh
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This file is part of ANTLR. See LICENSE.txt for licence  ##
## details. Written by W. Haefelinger.                      ##
##                                                          ##
##       Copyright (C) Wolfgang Haefelinger, 2004           ##
##                                                          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This script shall wrap/hide how we are going to build a library
## within the ANTLR (www.antlr.org) project.
test -z "${1}" && exit 0

if test -z "${AR}" ; then
  AR="@AR@"
  ar="@ar@"
else
  ar="`basename $AR`"
  ar="`echo $ar|sed 's,\..*$,,'`"
fi

test -z "${DEBUG}" && {
  DEBUG="@DEBUG@"
}

RANLIB="@RANLIB@"
LIBNAME="@ANTLR_LIB@"

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##             Prepate input arguments                    ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
case "@build_os@" in
  cygwin)
    LIBNAME="`cygpath -m ${LIBNAME}`"
    ARGV="`cygpath -m ${*}`"
    ;;
  *)
    ARGV="${*}"
    ;;
esac

L="${ARGV}" ; ARGV=""
for x in $L ; do
  if test -f "${x}" ; then
    ARGV="$ARGV ${x}"
  fi
done
unset L

if test -z "${ARGV}" ; then
cat < c:/). This does not
    ## work when using arguments like "-out:/c". Such a path
    ## remains untranslated causing underlying tool to choke.
    case @build_os@ in
      mingw*)
        d=`dirname "${LIBNAME}"`
        b=`basename "${LIBNAME}"`
        d=`cd "$d" && pwd -W`
        LIBNAME="$d/$b"
        ;;
    esac
    arflags="-nologo -verbose -out:${LIBNAME}"
    cmd_pfx="rm -f ${LIBNAME}"
    ## no runlib required   
    unset RANLIB 
    ;;
  bcc32)
    ## I'm shamelessly override what has been configured --   
    ## nothing more than a hack.   
    AR='tlib'  
    ## to make the general command work   
    b=`basename "${LIBNAME}"`
    cmd_pfx="rm -f ${b} ${LIBNAME}"
    cmd_sfx="cp $b .${b} ; rm ${b}; cp .${b} ${LIBNAME}"
    arflags="/P128 ${b}" 
      ## no runlib required   
    unset RANLIB
    
    ## Borland's interface for tlib (making a static library)
    ## is most stupid ever seen. For example,  it  does  not
    ## accept "-" in file  names,  not  is it able to handle 
    ## forward  slashes  in pathnames. Even Microsoft can do 
    ## this..
    L="${ARGV}" ; ARGV=""
    for x in $L ; do
      ARGV="$ARGV +`basename ${x}`"
    done
    unset L
    ;;
  CC)
    AR="@CXX@"
    arflags="-xar -o ${LIBNAME}"
    cmd_pfx="rm -f ${LIBNAME}"
    ;;
  *)
    arflags="rus"
    ARGV="${LIBNAME} ${ARGV}"
    cmd_pfx="rm -f ${LIBNAME}"
    ;;
esac

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## **NO CHANGE NECESSARY BELOW THIS LINE - EXPERTS ONLY** ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
test -z "${verbose}" && { 
  verbose=@VERBOSE@
}

## If specific flags have been configured then they overrule
## our precomputed flags. Still a user can override by using
## environment variable $ARFLAGS - see below.
test -n "@ARFLAGS@" && {
  set x @ARFLAGS@  ; shift
  case $1 in
    +)
      shift
      ARFLAGS="${arflags} $*"
      ;;
    -)
      shift
      arflags="$* ${arflags}"
      ;;
    =)
      shift
      arflags="$*"
      ;;
    *)
      if test -z "$1" ; then
        arflags="${arflags}"
      else
        arflags="$*"
      fi
      ;;
  esac
}

## Regardless what has been configured, a user should always
## be able to  override  without  the need to reconfigure or
## change this file. Therefore we check variable $ARFLAGS.
## In almost all cases the precomputed flags are just ok but
## some  additional  flags are needed. To support this in an
## easy way, we check for the very first value. If this val-
## ue is 
## '+'  -> append content of ARFLAGS to precomputed flags
## '-'  -> prepend content    -*-
## '='  -> do not use precomputed flags
## If none of these characters are given, the behaviour will
## be the same as if "=" would have been given.

set x ${ARFLAGS}  ; shift
case $1 in
  +)
    shift
    ARFLAGS="${arflags} $*"
    ;;
  -)
    shift
    ARFLAGS="$* ${arflags}"
    ;;
  =)
    shift
    ARFLAGS="$*"
    ;;
  *)
    if test -z "$1" ; then
      ARFLAGS="${arflags}"
    else
      ARFLAGS="$*"
    fi
    ;;
esac

## Any special treatment goes here ..
case "${ar}" in
  ar)
    ;;
  *)
    ;;
esac

##%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%##
##    No  c u s t o m i z a t i o n  below this line          ##
##%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%##


## Reset positional args
set x ${ARGV} ; shift

## This is how we would run 'ranlib' ..
test -n "${RANLIB}" && {
  ranlib_cmd="${RANLIB} ${LIBNAME}"
}



## This extra copy is a hack for Borland's TLIB which does
## not accept '-' in filenames.
cmd="${AR} ${ARFLAGS} ${ARGV}"

## If there's something to be done ..
test -n "${cmd}" && {
  
  test -n "${cmd_pfx}" && {
    test $verbose -gt 0 && {
      echo $cmd_pfx
    }
    eval ${cmd_pfx} || exit 1
  }

  ## be verbose of required  
  case "${verbose}" in
    0|no|nein|non)
      echo "*** creating ${LIBNAME}"
      ;;
    *)
      echo $cmd
      ;;
  esac
   
  ## remove library - just in case.
  test -n "${LIBNAME}" -a -f "${LIBNAME}" && {
    rm -f ${LIBNAME}
  }

 
  ## eventually ..
  $cmd || {
    rc=$?
    cat <> E R R O R <<
============================================================

$cmd

============================================================
Got an error while trying to execute  command  above.  Error
messages (if any) must have shown before. The exit code was:
exit($rc)
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
EOF
    exit $rc
  }
  
  test -n "${cmd_sfx}" && {
    test $verbose -gt 0 && {
      echo $cmd_sfx
    }
    eval ${cmd_sfx} || exit 1
  }

  ## and even later ..
  test -n "${RANLIB}" && {
    cmd="${RANLIB} ${LIBNAME}"
    test $verbose -gt 0 && {
      echo $cmd
    }
    $cmd || {
      exit 1
    }
  }
}

exit 0antlr-2.7.7/scripts/java.sh.in0000644000175000017500000000316210522211616016154 0ustar  twernertwerner#!/bin/sh
test -z "${verbose}" && { 
  verbose=@VERBOSE@
}

abs_top_build_dir=@abs_top_builddir@
java_cmd="@JAVA@"
antlr_jar="@ANTLR_JAR@"
ARGV="$*"

case @build_os@ in
  cygwin)
    test -n "${antlr_jar}" && {
      antlr_jar="`cygpath -m ${antlr_jar}`"
    }
    sep=";"
    ;;
  macos*)
    sep=";"
    ;;
  *)
    sep=":"
    ;;
esac

if test -d "${abs_top_build_dir}"; then
  if test -f "${antlr_jar}" ; then
    
    if test -z "${CLASSPATH}"; then
      ## needs fine tuning - depends on os (wh:tbd)
      CLASSPATH=".${sep}${antlr_jar}"
      export CLASSPATH
    else
      ## needs fine tuning - depends on os (wh:tbd)
      CLASSPATH="${sep}${antlr_jar}${sep}${CLASSPATH}" 
    fi        
  fi
fi

## Translate all non option arguments 
case @build_os@ in
  cygwin)
    set x $ARGV ; shift
    ARGV=
    while test $# -gt 0 ; do
      case $1 in
        -*) 
          ARGV="$ARGV $1"
          ;;
        *)
          ARGV="$ARGV `@CYGPATH_M@ $1`"
          ;;
      esac
      shift
    done
    ;;
  *)
    ;;
esac



## go ahead ..
cmd="${java_cmd} ${ARGV}"
case "${verbose}" in
  0)
    echo $cmd 
    ;;
  *)
    echo $cmd
    ;;
esac

$cmd || {
  rc=$?
  cat <> E R R O R <<
============================================================
CLASSPATH=$CLASSPATH

$cmd

============================================================
Got an error while trying to execute  command  above.  Error
messages (if any) must have shown before. The exit code was:
exit($rc)
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
EOF
  exit $rc
}
exit 0
antlr-2.7.7/scripts/cpp.sh.in0000755000175000017500000001276510522211616016031 0ustar  twernertwerner#!/bin/sh
## This script shall wrap/hide how we are going to compile C++ 
## source files within the ANTLR (www.antlr.org) project.
test -z "${verbose}" && { 
  verbose=@VERBOSE@
}

## check whether we have something to do ..
test -z "$1" &&  exit 0

## get arguments
ARGV="$*"

## Command CXX is precomputed but user may override.
if test -z "${CXX}" ; then
  CXX="@CXX@"
  cxx="@cxx@"
else
  cxx="`basename $CXX`"
  cxx="`echo $cxx|sed 's,\..*$,,'`"
fi

## use whitespace  to separate dirs, don't use compiler specific
## options like '-I' etc.  That will be added at runtime when we
## know what compiler is in use.
CXXINCLUDE=". @abs_top_srcdir@/lib/cpp"

test -z "${DEBUG}" && {
  DEBUG="@DEBUG@"
}

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##       Here we set flags for well know programs         ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##
## Do not set variable CXXFLAGS here, just use it's sister
## variable 'cxxflags'. This  allows  the call to override
## this settings - see handling of CXXFLAGS below.

case "${cxx}" in
  gcc)
    cxxflags="-MM"
    ;;
  *)
    for x in ${ARGV} ; do
      echo > $x.d
    done
    return 0
    ;;
esac

case ${cxx} in
  bcc32|CC|aCC|xlC)
    CXX_OPT_INCLUDE="-I"
    ;;
  *)
    CXX_OPT_INCLUDE="-I "
    ;;
esac

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## **NO CHANGE NECESSARY BELOW THIS LINE - EXPERTS ONLY** ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##


## If specific flags have been configured then they overrule
## our precomputed flags. Still a user can override by using
## environment variable $CXXFLAGS - see below.
test -n "@CXXFLAGS@" && {
  set x @CXXFLAGS@  ; shift
  case $1 in
    +)
      shift
      CXXFLAGS="${cxxflags} $*"
      ;;
    -)
      shift
      cxxflags="$* ${cxxflags}"
      ;;
    =)
      shift
      cxxflags="$*"
      ;;
    *)
      if test -z "$1" ; then
        cxxflags="${cxxflags}"
      else
        cxxflags="$*"
      fi
      ;;
  esac
}

## Regardless what has been configured, a user should always
## be able to  override  without  the need to reconfigure or
## change this file. Therefore we check variable $CXXFLAGS.
## In almost all cases the precomputed flags are just ok but
## some  additional  flags are needed. To support this in an
## easy way, we check for the very first value. If this val-
## ue is 
## '+'  -> append content of CXXFLAGS to precomputed flags
## '-'  -> prepend content    -*-
## '='  -> do not use precomputed flags
## If none of these characters are given, the behaviour will
## be the same as if "=" would have been given.

set x ${CXXFLAGS}  ; shift
case $1 in
  +)
    shift
    CXXFLAGS="${cxxflags} $*"
    ;;
  -)
    shift
    CXXFLAGS="$* ${cxxflags}"
    ;;
  =)
    shift
    CXXFLAGS="$*"
    ;;
  *)
    if test -z "$1" ; then
      CXXFLAGS="${cxxflags}"
    else
      CXXFLAGS="$*"
    fi
    ;;
esac

##%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%##
##    No  c u s t o m i z a t i o n  below this line          ##
##%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%##

## translate args - requires that we are on cygwin. Other-
## wise  we have to assume that args are already in proper 
## format.

case "@build_os@" in
  cygwin)
    case "@cxx@" in
      cl|bcc32)
        ARGV="`cygpath -m ${ARGV}`"
        ;;
    esac
    ;;
esac

## we only add valid directories - note that CXXINCLUDE is
## supposed to  contain  directories  and  not optionized'
## arguments.

set x ${CXXINCLUDE} ; shift
Y=""

## filter non valid directories
while test $# -gt 0 ; do
  y="$1" ; shift
  test -d "${y}" && {
    Y="${Y} ${y}"
  }
done

set x ${Y} ; shift ; Y=""

## translate directories on cygwin
case "@build_os@" in
  cygwin)
    set x `cygpath -m ${*}` ; shift
    ;;
esac

## prefix each arg with CXX_OPT_INCLUDE (for instance -I)
while test $# -gt 0 ; do
  y="$1" ; shift
  Y="${Y} ${CXX_OPT_INCLUDE}${y}"
done

CXXINCLUDE="${Y}"

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###            LAST CHANCE COMPILER TUNIG HERE                     ###
###================================================================###

case "${cxx}" in
  cl)
    ;;
  bcc32)
    ;;
  gcc)
    ;;
  xlC)
    ;;
  CC)
    ;;
  aCC)
    ;;
  *)
    ;;
esac

case "@cxx@" in
  *)
    CXXFLAGS="${CXXFLAGS} -c"
    ;;
esac

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
### all variables participating in calling must be set now..
###---------------------------------------------------------

CXX_CMD="${CXX} ${CXXFLAGS} ${CXXINCLUDE}"

test -z "${ARGV}" && exit 0


for x in ${ARGV} ; do
  cmd="$CXX_CMD $x"
  
  case "${verbose}" in
    0|no|nein|non)
      echo "*** update deps for `basename $x`"
      ;;
    *)
      echo "*** making $x.d"
      echo $cmd
      ;;
  esac
  
  $cmd > $x.$$$$ || {
    rc=$?
    cat <> E R R O R <<
============================================================

$cmd

============================================================
Got an error while trying to execute  command  above.  Error
messages (if any) must have shown before. The exit code was:
exit($rc)
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
EOF
    exit $rc
 }
  ## on compiling ${dir}/x.cpp we get dep  x.o : x.cpp ${dir}/y.h ..
  ## but we need to have x.o ${dir}/x.o ${dir}/x.d : ...
  dx=`echo $x|sed 's,\.[^.]*$,@OBJEXT@,g'`
  sed "s,\(.*\)\@OBJEXT@[ ]*:,\1@OBJEXT@ ${dx} ${x}.d : ,g" < $x.$$$$ > $x.d
  rm -f $x.$$$$

done
exit 0

antlr-2.7.7/scripts/config.vars.in0000644000175000017500000000476510522211616017053 0ustar  twernertwerner## --*- Makefile -*--
SUBDIRS         := 

## helper utilities ..
INSTALL         = @INSTALL@
MKDIR           = @MKDIR@
RM              = @RM@ -r -f
RMF             = @RMF@
TAR             = @TAR@
TOUCH           = @TOUCH@
CHMOD           = @CHMOD@
SED             = @SED@
GREP            = @GREP@
CAT             = @CAT@
CHMOD           = @CHMOD@
CP              = @CP@
ECHO            = @ECHO@

# usual dribble
exec_prefix     = @exec_prefix@
prefix          = @prefix@
program_transform_name = @program_transform_name@
bindir          = @bindir@
sbindir         = @sbindir@
libexecdir      = @libexecdir@
datadir         = @datadir@
sysconfdir      = @sysconfdir@
sharedstatedir  = @sharedstatedir@
localstatedir   = @localstatedir@
libdir          = @libdir@
includedir      = @includedir@
oldincludedir   = @oldincludedir@
infodir         = @infodir@
mandir          = @mandir@
build_alias     = @build_alias@
host_alias      = @host_alias@
target_alias    = @target_alias@
build           = @build@
build_cpu       = @build_cpu@
build_vendor    = @build_vendor@
build_os        = @build_os@
host            = @host@
host_cpu        = @host_cpu@
host_vendor     = @host_vendor@
host_os         = @host_os@
just_make       = @just_make@

# Version stuff...
VERSION         = @VERSION@
SUBVERSION      = @SUBVERSION@
PATCHLEVEL      = @PATCHLEVEL@
PACKAGE_NAME    = @PACKAGE_NAME@
PACKAGE_VERSION = @PACKAGE_VERSION@
versioneddir    = @PACKAGE_NAME@-@PACKAGE_VERSION@

# navigation 
builddir        = @abs_this_builddir@
buildtree       = @abs_this_builddir@
sourcetree      = @abs_top_srcdir@

## Two abbrevs to shorten things. $(thisdir) shall be the current
## working  directory  as  absolute  name  and $(_srcdir) is it's 
## source dir companion. That means that  $(thisdir)/Makefile has
## been generated by $(_srcdir)/Makefile.in.
_srcdir         = @abs_top_srcdir@/$(subdir)
thisdir         = @abs_this_builddir@/$(subdir)

# variable 'srcdir' is deprecated - use sourcetree
srcdir          = @abs_top_srcdir@
# variable 'objdir' is deprecated - use buildtree
objdir          = @abs_this_builddir@

# other
verbose         = @VERBOSE@

## SUBDIRS you want to exclude (separate them by using "|").
SUBDIRS_NOT    := .

CLR            = @CLR@

ANTLR_JAR      = @ANTLR_JAR@
ANTLR_LIB      = @ANTLR_LIB@
ANTLR_NET      = @ANTLR_NET@
ANTLR_PY       = @ANTLR_PY@
ASTFRAME_NET   = @ASTFRAME_NET@

antlr_jar      = @antlr_jar@
antlr_lib      = @antlr_lib@
antlr_net      = @antlr_net@
antlr_py       = @antlr_py@
astframe_net   = @astframe_net@
antlr-2.7.7/scripts/c.sh.in0000755000175000017500000000203010522211616015451 0ustar  twernertwerner#!/bin/sh
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This file is part of ANTLR. See LICENSE.txt for licence  ##
## details. Written by W. Haefelinger.                      ##
##                                                          ##
##       Copyright (C) Wolfgang Haefelinger, 2004           ##
##                                                          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This script shall wrap/hide how we are going to run a C/C++
## preprocessor within the ANTLR (www.antlr.org) project.
test -z "${verbose}" && {
  verbose=@VERBOSE@
}

## check whether we have something to do ..
if test -z "$1" ; then
  exit 0
fi

ARCHFLAGS=
INCLUDE="-I @abs_top_srcdir@/lib/cpp"
DEBUG=
EXTRA_CFLAGS=

C_CMD="@CC@ @CFLAGS@ ${ARCHFLAGS} ${INCLUDE} ${DEBUG} ${EXTRA_CFLAGS} -c"

while test $# -gt 0 ; do
  x="$1" ; shift
  echo "compiling (C) $x .."
  c_cmd="$C_CMD $x"
  $c_cmd || {
    echo ""
    echo "error caught on .."
    echo ">>> $c_cmd"
    echo ""
    exit 1
  }
done
antlr-2.7.7/scripts/jar.sh.in0000755000175000017500000001017010522211616016007 0ustar  twernertwerner#!/bin/sh
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This file is part of ANTLR. See LICENSE.txt for licence  ##
## details. Written by W. Haefelinger.                      ##
##                                                          ##
##       Copyright (C) Wolfgang Haefelinger, 2004           ##
##                                                          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This script shall wrap/hide how we are going to pack Java class
## files. We need to wrap  this  as  SUN's jar does not understand
## UNIX filename notation on Cygwin.
test -z "${verbose}" && { 
  verbose=@VERBOSE@
}

## check whether we have something to do ..
test -z "$1" && exit 0


case @build_os@ in
  cygwin)
    ARGV="`cygpath -m $*`"
    ;;
  *)
    ARGV="$*"
    ;;
esac


## Command JAR is precomputed but user may override.
if test -z "${JAR}" ; then
  JAR="@JAR@"
  jar="@jar@"
else
  jar="`basename $JAR`"
  jar="`echo $jar|sed 's,\..*$,,'`"
fi

test -z "${DEBUG}" && {
  DEBUG="@DEBUG@"
}

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##       Here we set flags for well know programs         ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##
## Do not set variable JARFLAGS here, just use it's sister
## variable 'jarflags'. This  allows  the call to override
## this settings - see handling of JARFLAGS below.

case "${jar}" in
  jar)
    jarflags="cf"
    ;;
  *)
    jarflags="cf"
    ;;
esac

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## **NO CHANGE NECESSARY BELOW THIS LINE - EXPERTS ONLY** ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##


## If specific flags have been configured then they overrule
## our precomputed flags. Still a user can override by using
## environment variable $JARFLAGS - see below.
test -n "@JARFLAGS@" && {
  set x @JARFLAGS@  ; shift
  case $1 in
    +)
      shift
      JARFLAGS="${jarflags} $*"
      ;;
    -)
      shift
      jarflags="$* ${jarflags}"
      ;;
    =)
      shift
      jarflags="$*"
      ;;
    *)
      if test -z "$1" ; then
        jarflags="${jarflags}"
      else
        jarflags="$*"
      fi
      ;;
  esac
}

## Regardless what has been configured, a user should always
## be able to  override  without  the need to reconfigure or
## change this file. Therefore we check variable $JARFLAGS.
## In almost all cases the precomputed flags are just ok but
## some  additional  flags are needed. To support this in an
## easy way, we check for the very first value. If this val-
## ue is 
## '+'  -> append content of JARFLAGS to precomputed flags
## '-'  -> prepend content    -*-
## '='  -> do not use precomputed flags
## If none of these characters are given, the behaviour will
## be the same as if "=" would have been given.

set x ${JARFLAGS}  ; shift
case $1 in
  +)
    shift
    JARFLAGS="${jarflags} $*"
    ;;
  -)
    shift
    JARFLAGS="$* ${jarflags}"
    ;;
  =)
    shift
    JARFLAGS="$*"
    ;;
  *)
    if test -z "$1" ; then
      JARFLAGS="${jarflags}"
    else
      JARFLAGS="$*"
    fi
    ;;
esac

## Any special treatment goes here ..
case "${jar}" in
  jar)
    ;;
  *)
    ;;
esac

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##    This shall be the command to be excuted below       ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##

cmd="${JAR} ${JARFLAGS} ${ARGV}"

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##        standard template to execute a command          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
case "${verbose}" in
  0|no|nein|non)
    set x ${ARGV}
    echo "*** creating $2 .."
    ;;
  *)
    echo $cmd
    ;;
esac

$cmd || {
  rc=$?
  cat <> E R R O R <<
============================================================

$cmd

============================================================
Got an error while trying to execute  command  above.  Error
messages (if any) must have shown before. The exit code was:
exit($rc)
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
EOF
  exit $rc
}
exit 0
antlr-2.7.7/scripts/cxx.sh.in0000755000175000017500000001421210522211616016036 0ustar  twernertwerner#!/bin/sh
## This script shall wrap/hide how we are going to compile C++ 
## source files within the ANTLR (www.antlr.org) project.
test -z "${verbose}" && { 
  verbose=@VERBOSE@
}

## check whether we have something to do ..
test -z "$1" &&  exit 0

## get arguments
ARGV="$*"

## Command CXX is precomputed but user may override.
if test -z "${CXX}" ; then
  CXX="@CXX@"
  cxx="@cxx@"
else
  cxx="`basename $CXX`"
  cxx="`echo $cxx|sed 's,\..*$,,'`"
fi

## use whitespace  to separate dirs, don't use compiler specific
## options like '-I' etc.  That will be added at runtime when we
## know what compiler is in use.
## 2.7.6: take CXXINCLUDE from environment into account.
CXXINCLUDE=". ${CXXINCLUDE} @abs_top_srcdir@/lib/cpp"

## according to Kurt we need to set some additional included
## paths when using 'cxx' on Tru64. Here we go ..
case $cxx in
  cxx)
    CXXINCLUDE="$CXXINCLUDE @abs_top_srcdir@/include"
    CXXINCLUDE="$CXXINCLUDE /usr/include/cxx"
    CXXINCLUDE="$CXXINCLUDE /usr/include"
    ;;
esac


test -z "${DEBUG}" && {
  DEBUG="@DEBUG@"
}

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##       Here we set flags for well know programs         ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##
## Do not set variable CXXFLAGS here, just  use it's sister
## variable 'cxxflags'. This  allows the caller to override
## this settings - see handling of CXXFLAGS below.

case "${cxx}" in
  cxx) 
    cxxflags="-D__DECCXX -ieee -DDEC -O0 -arch host -trapuv -check_bounds -warnprotos -std1 -noansi_args -portable"
    #-I/spare/mccalke/antlr-2.7.5-new/include -I/usr/include/cxx -I/usr/include -L/usr/lib/cmplrs/cxx -L/usr/lib/cmplrs/cxx/V6.5-042"
    ;;

  gcc)
    cxxflags="-felide-constructors -pipe"
    case "${DEBUG}" in
      0)
        cxxflags="-O2 -DNDEBUG ${cxxflags}"
        ;;
      1)
        cxxflags="-g ${cxxflags} -W -Wall"
        ;;
    esac
    ;;
  cl)
    cxxflags="-nologo -GX -GR" 
    ;;
  bcc32)
    cxxflags="-q -v -w-inl -w-aus -w-par -w-ccc" 
    ;;
  CC)
    cxxflags="-g" 
    ;;
  xlC)
    cxxflags="" 
    ;;
  aCC)
    cxxflags="" 
    ;;
  *)
    cxxflag=""
    ;;
esac

case ${cxx} in
  bcc32|CC|aCC|xlC|cxx)
    CXX_OPT_INCLUDE="-I"
    ;;
  *)
    CXX_OPT_INCLUDE="-I "
    ;;
esac

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## **NO CHANGE NECESSARY BELOW THIS LINE - EXPERTS ONLY** ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##


## If specific flags have been configured then they overrule
## our precomputed flags. Still a user can override by using
## environment variable $CXXFLAGS - see below.
test -n "@CXXFLAGS@" && {
  set x @CXXFLAGS@  ; shift
  case $1 in
    +)
      shift
      CXXFLAGS="${cxxflags} $*"
      ;;
    -)
      shift
      cxxflags="$* ${cxxflags}"
      ;;
    =)
      shift
      cxxflags="$*"
      ;;
    *)
      if test -z "$1" ; then
        cxxflags="${cxxflags}"
      else
        cxxflags="$*"
      fi
      ;;
  esac
}

## Regardless what has been configured, a user should always
## be able to  override  without  the need to reconfigure or
## change this file. Therefore we check variable $CXXFLAGS.
## In almost all cases the precomputed flags are just ok but
## some  additional  flags are needed. To support this in an
## easy way, we check for the very first value. If this val-
## ue is 
## '+'  -> append content of CXXFLAGS to precomputed flags
## '-'  -> prepend content    -*-
## '='  -> do not use precomputed flags
## If none of these characters are given, the behaviour will
## be the same as if "=" would have been given.

set x ${CXXFLAGS}  ; shift
case $1 in
  +)
    shift
    CXXFLAGS="${cxxflags} $*"
    ;;
  -)
    shift
    CXXFLAGS="$* ${cxxflags}"
    ;;
  =)
    shift
    CXXFLAGS="$*"
    ;;
  *)
    if test -z "$1" ; then
      CXXFLAGS="${cxxflags}"
    else
      CXXFLAGS="$*"
    fi
    ;;
esac

##%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%##
##    No  c u s t o m i z a t i o n  below this line          ##
##%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%##

## translate args - requires that we are on cygwin. Other-
## wise  we have to assume that args are already in proper 
## format.

case "@build_os@" in
  cygwin)
    case "@cxx@" in
      cl|bcc32)
        ARGV="`cygpath -m ${ARGV}`"
        ;;
    esac
    ;;
esac

## we only add valid directories - note that CXXINCLUDE is
## supposed to  contain  directories  and  not optionized'
## arguments.

set x ${CXXINCLUDE} ; shift
Y=""

## filter non valid directories
while test $# -gt 0 ; do
  y="$1" ; shift
  test -d "${y}" && {
    Y="${Y} ${y}"
  }
done

set x ${Y} ; shift ; Y=""

## translate directories on cygwin
case "@build_os@" in
  cygwin)
    set x `cygpath -m ${*}` ; shift
    ;;
esac

## prefix each arg with CXX_OPT_INCLUDE (for instance -I)
while test $# -gt 0 ; do
  y="$1" ; shift
  Y="${Y} ${CXX_OPT_INCLUDE}${y}"
done

CXXINCLUDE="${Y}"

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###            LAST CHANCE COMPILER TUNIG HERE                     ###
###================================================================###

case "${cxx}" in
  cl)
    ;;
  bcc32)
    ;;
  gcc)
    ;;
  xlC)
    ;;
  CC)
    ;;
  aCC)
    ;;
  cxx)
    ;;
  *)
    ;;
esac

case "@cxx@" in
  *)
    CXXFLAGS="${CXXFLAGS} -c"
    ;;
esac

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
### all variables participating in calling must be set now..
###---------------------------------------------------------

CXX_CMD="${CXX} ${CXXFLAGS} ${CXXINCLUDE}"

test -z "${ARGV}" && exit 0

for x in ${ARGV} ; do
  cmd="$CXX_CMD $x"
  
  case "${verbose}" in
    0|no|nein|non)
      echo "*** compiling $x"
      ;;
    *)
      echo $cmd
      ;;
  esac
  
  $cmd || {
    rc=$?
    cat <> E R R O R <<
============================================================

$cmd

============================================================
Got an error while trying to execute  command  above.  Error
messages (if any) must have shown before. The exit code was:
exit($rc)
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
EOF
    exit $rc
 }

done
exit 0

antlr-2.7.7/scripts/config.make.in0000644000175000017500000000656410522211616017014 0ustar  twernertwerner##xxxxxxxxxxxxxxxxxxxxxx --*- Makefile -*-- xxxxxxxxxxxxxxxx>>> config.make
## By default, make will jump into any sub directory that contains a   file 
## named "Makefile". This is done  in the order implied by "/bin/ls"  which
## is in almost  all  cases  correct  (note  that  you  should  not  design 
## Makefiles which depend on a specific invocation order). You can override
## specific  behaviour  by  using  variable SUBDIRS. If given and not empty,
## "/bin/ls" is not used. Also,  if you want to disable jumping subdirs you
## may  use  either ".", ".."  as  value for SUBDIRS. Note that SUBDIRS may 
## contain any directory (except "." and "..).

## This is very much  GNU specific, sigh.  Variable SUBDIRS is used to tell 
## make which  subdirectory to jump. It's  value is normally preset or just
## empty, in which case /bin/ls is used as discussed above. However, I also
## want that a user can say
##
##  make SUBDIRS="d1 d2 .. dn"
##
## That means, ignore defaults and go ahead and make exactly this director-
## ies mentioned. Of course, this should only have  an  impact  on Makefile
## being used  by  "make"  but not for any makefils in d1 .. dn, right? For
## example, if di  needs  to  make directories a,b and c, then they need to
## be made of course. So all burns down to the question how to prevent a
## variable from being passed to submakes. Below you can see the answer. If
## you believe that there's a simpler answer to the problem don't hesistate
## to try it out. If  it  works, send me an email: ora dot et dot labora at
## web dot de. But be warned - you need to try all variations.
##
## Here is in short what  I  found  and how  it  works.  Variables given on 
## command line  are  saved  in  variable  MAKEOVERRIDES. This  variable is 
## exported  and  passed down. On  invocation  of a submake file, make will
## have a  look  into MAKEOVERRIDES  and unpack each variable found therein.
## Therefore I'm just going to  remove  every (?) occurance of SUBDIRS from
## this variable. 
MAKEOVERRIDES := $(patsubst SUBDIRS=%,,$(MAKEOVERRIDES))


## The actuall rule on how to make a recursive target.
all clean distclean test install force-target clean-target :: 
	@dirs="$(SUBDIRS)" ; \
	test -z "$${dirs}" && { \
		dirs=`/bin/ls` ; \
  } ; \
	for d in . $${dirs} ; do \
		case $${d} in \
		. | .. ) ;; \
	  $(SUBDIRS_NOT) ) ;; \
		*) \
		if test -f "$${d}/Makefile" ; then \
		  echo ">>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>" ; \
		  echo ">> @MAKE@ -C $(subdir)/$${d} $@                          " ; \
			echo ">>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>" ; \
			@MAKE@ -C "$$d" $@ || exit 1 ;\
		fi ; \
		;; \
		esac ; \
	done

## For historical  reasons only you can make local targets as "this-*" or 
## "*-this" rules. The  default is to do nothing. Although this targets
## exists, it is recommended to define further "all", "clean" etc. double
## colon rules.
 
all       :: this-all all-this
clean     :: this-clean clean-this
distclean :: this-distclean distclean-this
test      :: this-test test-this
install   :: this-install install-this

this-all ::
this-clean ::
this-distclean ::
this-test ::
this-install ::

all-this ::
clean-this ::
distclean-this ::
test-this ::
install-this ::

force-target :: clean-target all

distclean :: clean

distclean ::
	$(RM) Makefile

## xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx<< config.make 
antlr-2.7.7/scripts/config.deps.in0000644000175000017500000001247310522211616017026 0ustar  twernertwerner## --*- Makefile -*--
## Make listed targets even in case a file with same name exists.
.PHONY: \
 this \
 all clean install test distclean \
 this-all this-clean this-install this-test this-distclean \
 all-this clean-this install-this test-this distclean-this \
 $(eof)

## delete suffix rules - shortens output when using -d and is not
## used anyway (and should not be used).
.SUFFIXES:

Makefile :: @abs_top_srcdir@/$(subdir)/Makefile.in  \
            @abs_this_builddir@/scripts/config.deps \
					  @abs_this_builddir@/scripts/config.make \
					  @abs_this_builddir@/scripts/config.vars \
            @abs_this_builddir@/config.status
	@echo "*** update $(subdir)/Makefile"
	@cd @abs_this_builddir@ && CONFIG_FILES="$(subdir)/Makefile" @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/config.deps : \
	@abs_top_srcdir@/scripts/config.deps.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/config.deps @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/config.make : \
	@abs_top_srcdir@/scripts/config.make.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/config.make @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/config.vars : \
	@abs_top_srcdir@/scripts/config.vars.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/config.vars @SHELL@ ./config.status -q

@abs_this_builddir@/config.status : \
	@abs_top_srcdir@/configure
	@echo "*** reconfigure $@ - stay tuned .."
	@cd @abs_this_builddir@ && @SHELL@ ./config.status -q --recheck
	@echo "*** update all configured files .."
	@cd @abs_this_builddir@ && @SHELL@ ./config.status -q

### In a pure devel mode there should be also a dependency listed on how
### to make configure out of  configure.in.  This  requires that usr has 
### m4  and  autoconf (proper version) installed. Appropriate checks are 
### not done in configure. If so, then uncomment next lines:
###
###   @rule_configure_configure_in@
###

@abs_this_builddir@/scripts/antlr.sh : \
	@abs_top_srcdir@/scripts/antlr.sh.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/antlr.sh @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/cpp.sh : \
	@abs_top_srcdir@/scripts/cpp.sh.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/cpp.sh @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/csc.sh : \
	@abs_top_srcdir@/scripts/csc.sh.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/csc.sh @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/cxx.sh : \
	@abs_top_srcdir@/scripts/cxx.sh.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/cxx.sh @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/jar.sh : \
	@abs_top_srcdir@/scripts/jar.sh.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/jar.sh @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/javac.sh : \
	@abs_top_srcdir@/scripts/javac.sh.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/javac.sh @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/java.sh : \
	@abs_top_srcdir@/scripts/java.sh.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/java.sh @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/lib.sh : \
	@abs_top_srcdir@/scripts/lib.sh.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/lib.sh @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/link.sh : \
	@abs_top_srcdir@/scripts/link.sh.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/link.sh @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/pyinst.sh : \
	@abs_top_srcdir@/scripts/pyinst.sh.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/pyinst.sh @SHELL@ ./config.status -q

@abs_this_builddir@/scripts/python.sh : \
	@abs_top_srcdir@/scripts/python.sh.in
	@echo "*** update $@"
	@cd @abs_this_builddir@ && CONFIG_FILES=scripts/python.sh @SHELL@ ./config.status -q


## This rule shall ensure that ANTLR_NET is up-to-date. The rule is a 
## double colon rule, ie. further  rules  with the same target may be
## added. For unknown reasons, double colon rules are always phony,ie.
## getting executed even in case target exists. We break the infinite
## loop,  we only  jump  into  subdir  "lib/csharp/src" if we are not 
## already in. It is very important that  each Makefile[.in] sets the
## variable $(subdir) proper.

@ANTLR_NET@ :: 
	@ subdir="lib/csharp/antlr.runtime" ; \
    case $(subdir) in \
	  $$subdir ) ;; \
	  * ) d="@abs_this_builddir@/$$subdir" ; \
        test -f "$$d/Makefile" && {  \
         @MAKE@ -C "$$d" $@ ; \
        } 	\
        ;; \
    esac

@ASTFRAME_NET@ :: 
	@ subdir="lib/csharp/antlr.astframe" ; \
    case $(subdir) in \
	  $$subdir ) ;; \
	  * ) d="@abs_this_builddir@/$$subdir" ; \
        test -f "$$d/Makefile" && {  \
         @MAKE@ -C "$$d" $@ ; \
        } 	\
        ;; \
    esac


@ANTLR_JAR@ ::
	@ subdir="antlr" ; \
    case $(subdir) in \
	  $$subdir ) ;; \
	  * ) d="@abs_this_builddir@/$$subdir" ; \
        test -f "$$d/Makefile" && {  \
         @MAKE@ -C "$$d" $@ ; \
        } 	\
        ;; \
    esac


@ANTLR_LIB@ ::
	@ subdir="lib/cpp/src" ; \
    case $(subdir) in \
	  $$subdir ) ;; \
	  * ) d="@abs_this_builddir@/$$subdir" ; \
        test -f "$$d/Makefile" && {  \
         @MAKE@ -C "$$d" $@ ; \
        } 	\
        ;; \
    esac

antlr-2.7.7/scripts/link.sh.in0000755000175000017500000001261510522211616016176 0ustar  twernertwerner#!/bin/sh
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This file is part of ANTLR. See LICENSE.txt for licence  ##
## details. Written by W. Haefelinger.                      ##
##                                                          ##
##       Copyright (C) Wolfgang Haefelinger, 2004           ##
##                                                          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
test -z "$1" && exit 0
## This script shall wrap/hide how we are going to link C++
## object files within the ANTLR (www.antlr.org) project.
CXX="@CXX@"
CXXFLAGS="@LDFLAGS@"

LIBNAME="@ANTLR_LIB@"
TARGET="$1" ; shift

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##             Prepate input arguments                    ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
case "@build_os@" in
  cygwin)
    ARGV="`cygpath -m ${*}`"
    test -n "${TARGET}" && {
      TARGET=`cygpath -m ${TARGET}`
    }
    test -n "${LIBNAME}" && {
      LIBNAME="`cygpath -m ${LIBNAME}`"
    }
    ;;
  *)
    ARGV="${*}"
    ;;
esac

# RK: Disabled it strips -l arguments
#L="${ARGV}" ; ARGV=""
#for x in $L ; do
#  if test -f "${x}" ; then
#    ARGV="$ARGV ${x}"
#  fi
#done
#unset L

if test -z "${ARGV}" ; then
cat < append content of LDFLAGS to precomputed flags
## '-'  -> prepend content    -*-
## '='  -> do not use precomputed flags
## If none of these characters are given, the behaviour will
## be the same as if "=" would have been given.

set x ${LDFLAGS}  ; shift
case $1 in
  +)
    shift
    LDFLAGS="${ldflags} $*"
    ;;
  -)
    shift
    LDFLAGS="$* ${ldflags}"
    ;;
  =)
    shift
    LDFLAGS="$*"
    ;;
  *)
    if test -z "$1" ; then
      LDFLAGS="${ldflags}"
    else
      LDFLAGS="$*"
    fi
    ;;
esac

## Any special treatment goes here ..
case "${ld}" in
  ld)
    ;;
  *)
    ;;
esac

##%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%##
##    No  c u s t o m i z a t i o n  below this line          ##
##%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%##
test -z "${verbose}" && {
  verbose=@VERBOSE@
}

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##    This shall be the command to be excuted below       ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##

cmd="${LD} ${LDFLAGS} ${ARGV}"

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##        standard template to execute a command          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
case "${verbose}" in
  0|no|nein|non)
    echo "*** creating ${TARGET} .."
    ;;
  *)
    echo $cmd
    ;;
esac

$cmd || {
  rc=$?
  cat <> E R R O R <<
============================================================

$cmd

============================================================
Got an error while trying to execute  command  above.  Error
messages (if any) must have shown before. The exit code was:
exit($rc)
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
EOF
  exit $rc
}
exit 0
antlr-2.7.7/scripts/install-sh0000755000175000017500000001273610522211616016305 0ustar  twernertwerner#!/bin/sh
#
# install - install a program, script, or datafile
# This comes from X11R5 (mit/util/scripts/install.sh).
#
# Copyright 1991 by the Massachusetts Institute of Technology
#
# Permission to use, copy, modify, distribute, and sell this software and its
# documentation for any purpose is hereby granted without fee, provided that
# the above copyright notice appear in all copies and that both that
# copyright notice and this permission notice appear in supporting
# documentation, and that the name of M.I.T. not be used in advertising or
# publicity pertaining to distribution of the software without specific,
# written prior permission.  M.I.T. makes no representations about the
# suitability of this software for any purpose.  It is provided "as is"
# without express or implied warranty.
#
# Calling this script install-sh is preferred over install.sh, to prevent
# `make' implicit rules from creating a file called install from it
# when there is no Makefile.
#
# This script is compatible with the BSD install script, but was written
# from scratch.  It can only install one file at a time, a restriction
# shared with many OS's install programs.


# set DOITPROG to echo to test this script

# Don't use :- since 4.3BSD and earlier shells don't like it.
doit="${DOITPROG-}"


# put in absolute paths if you don't have them in your path; or use env. vars.

mvprog="${MVPROG-mv}"
cpprog="${CPPROG-cp}"
chmodprog="${CHMODPROG-chmod}"
chownprog="${CHOWNPROG-chown}"
chgrpprog="${CHGRPPROG-chgrp}"
stripprog="${STRIPPROG-strip}"
rmprog="${RMPROG-rm}"
mkdirprog="${MKDIRPROG-mkdir}"

transformbasename=""
transform_arg=""
instcmd="$mvprog"
chmodcmd="$chmodprog 0755"
chowncmd=""
chgrpcmd=""
stripcmd=""
rmcmd="$rmprog -f"
mvcmd="$mvprog"
src=""
dst=""
dir_arg=""

while [ x"$1" != x ]; do
    case $1 in
	-c) instcmd="$cpprog"
	    shift
	    continue;;

	-d) dir_arg=true
	    shift
	    continue;;

	-m) chmodcmd="$chmodprog $2"
	    shift
	    shift
	    continue;;

	-o) chowncmd="$chownprog $2"
	    shift
	    shift
	    continue;;

	-g) chgrpcmd="$chgrpprog $2"
	    shift
	    shift
	    continue;;

	-s) stripcmd="$stripprog"
	    shift
	    continue;;

	-t=*) transformarg=`echo $1 | sed 's/-t=//'`
	    shift
	    continue;;

	-b=*) transformbasename=`echo $1 | sed 's/-b=//'`
	    shift
	    continue;;

	*)  if [ x"$src" = x ]
	    then
		src=$1
	    else
		# this colon is to work around a 386BSD /bin/sh bug
		:
		dst=$1
	    fi
	    shift
	    continue;;
    esac
done

if [ x"$src" = x ]
then
	echo "install:	no input file specified"
	exit 1
else
	true
fi

if [ x"$dir_arg" != x ]; then
	dst=$src
	src=""
	
	if [ -d $dst ]; then
		instcmd=:
		chmodcmd=""
	else
		instcmd=mkdir
	fi
else

# Waiting for this to be detected by the "$instcmd $src $dsttmp" command
# might cause directories to be created, which would be especially bad 
# if $src (and thus $dsttmp) contains '*'.

	if [ -f $src -o -d $src ]
	then
		true
	else
		echo "install:  $src does not exist"
		exit 1
	fi
	
	if [ x"$dst" = x ]
	then
		echo "install:	no destination specified"
		exit 1
	else
		true
	fi

# If destination is a directory, append the input filename; if your system
# does not like double slashes in filenames, you may need to add some logic

	if [ -d $dst ]
	then
		dst="$dst"/`basename $src`
	else
		true
	fi
fi

## this sed command emulates the dirname command
dstdir=`echo $dst | sed -e 's,[^/]*$,,;s,/$,,;s,^$,.,'`

# Make sure that the destination directory exists.
#  this part is taken from Noah Friedman's mkinstalldirs script

# Skip lots of stat calls in the usual case.
if [ ! -d "$dstdir" ]; then
defaultIFS='	
'
IFS="${IFS-${defaultIFS}}"

oIFS="${IFS}"
# Some sh's can't handle IFS=/ for some reason.
IFS='%'
set - `echo ${dstdir} | sed -e 's@/@%@g' -e 's@^%@/@'`
IFS="${oIFS}"

pathcomp=''

while [ $# -ne 0 ] ; do
	pathcomp="${pathcomp}${1}"
	shift

	if [ ! -d "${pathcomp}" ] ;
        then
		$mkdirprog "${pathcomp}"
	else
		true
	fi

	pathcomp="${pathcomp}/"
done
fi

if [ x"$dir_arg" != x ]
then
	$doit $instcmd $dst &&

	if [ x"$chowncmd" != x ]; then $doit $chowncmd $dst; else true ; fi &&
	if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dst; else true ; fi &&
	if [ x"$stripcmd" != x ]; then $doit $stripcmd $dst; else true ; fi &&
	if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dst; else true ; fi
else

# If we're going to rename the final executable, determine the name now.

	if [ x"$transformarg" = x ] 
	then
		dstfile=`basename $dst`
	else
		dstfile=`basename $dst $transformbasename | 
			sed $transformarg`$transformbasename
	fi

# don't allow the sed command to completely eliminate the filename

	if [ x"$dstfile" = x ] 
	then
		dstfile=`basename $dst`
	else
		true
	fi

# Make a temp file name in the proper directory.

	dsttmp=$dstdir/#inst.$$#

# Move or copy the file name to the temp name

	$doit $instcmd $src $dsttmp &&

	trap "rm -f ${dsttmp}" 0 &&

# and set any options; do chmod last to preserve setuid bits

# If any of these fail, we abort the whole thing.  If we want to
# ignore errors from any of these, just make sure not to ignore
# errors from the above "$doit $instcmd $src $dsttmp" command.

	if [ x"$chowncmd" != x ]; then $doit $chowncmd $dsttmp; else true;fi &&
	if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd $dsttmp; else true;fi &&
	if [ x"$stripcmd" != x ]; then $doit $stripcmd $dsttmp; else true;fi &&
	if [ x"$chmodcmd" != x ]; then $doit $chmodcmd $dsttmp; else true;fi &&

# Now rename the file to the real destination.

	$doit $rmcmd -f $dstdir/$dstfile &&
	$doit $mvcmd $dsttmp $dstdir/$dstfile 

fi &&


exit 0
antlr-2.7.7/scripts/javac.sh.in0000755000175000017500000001345110522211616016324 0ustar  twernertwerner#!/bin/sh
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This file is part of ANTLR. See LICENSE.txt for licence  ##
## details. Written by W. Haefelinger.                      ##
##                                                          ##
##       Copyright (C) Wolfgang Haefelinger, 2004           ##
##                                                          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
test -z "${verbose}" && { 
  verbose=@VERBOSE@
}
## This script will be called to compile a list of java files on
## all UNIX/Cygwin platforms. Whether we'll use SUN java, gcj or
## another Java compiler doesn't matter.

## precompute some variables required or useful to compile
## Java source files.

## srcdir shall contain absolute path to package directory.
srcdir="@abs_top_srcdir@"

## objdir shall contain absolute path to this build directory.
objdir="@abs_this_builddir@"

## bootclasspath shall contain jar or zip file required to
## boot Javac. An example where this variable is used is 
## jikes. Note, this variable can be plain empty.
bootclasspath="@BOOTCLASSPATH@"

classpath="@ANTLR_JAR@"

case @build_os@ in
  cygwin)
    sep=";"
    ;;
  macos*)
    sep=";"
    ;;
  *)
    sep=":"
    ;;
esac

## When on cygwin we translage paths into mixed notation (DOS
## with forward slashes).
case @build_os@ in
  cygwin)
    test -n "$1" && {
      ARGV="`cygpath -m $*`"
    }
    test -n "${srcdir}" && {
      srcdir="`cygpath -m ${srcdir}`"
    }
    test -n "${objdir}" && {
      objdir="`cygpath -m ${objdir}`"
    }
    test -n "${bootclasspath}" && {
      bootclasspath="`cygpath -m ${bootclasspath}`"
    }
    test -n "${classpath}" && {
      classpath="`cygpath -m ${classpath}`"
    }
    ;;
  *)
    ARGV="$*"
    ;;
esac

## Command JAVAC is precomputed but user may override.
if test -z "${JAVAC}" ; then
  JAVAC="@JAVAC@"
  javac="@javac@"
else
  javac=`basename $JAVAC`
  javac=`echo $javac|sed 's,\..*$,,'`
fi

## Take environment variable CLASSPATH into account
if test -n "$CLASSPATH" ; then
  ifs_save=$IFS
  IFS=$sep
  for d in $CLASSPATH ; do
    case @build_os@ in
      cygwin)
        d=`@CYGPATH_M@ $d`
        ;;
    esac
    classpath="$classpath$sep$d"
  done
  IFS=$ifs_save
fi
## Compute the flags for well known compilers. Note that a user
## may override this settings by providing JAVACFLAGS - see be-
## low.
case "${javac}" in
  jikes)
    javacflags="-nowarn -d ."
    javacflags="${javacflags} -sourcepath ${srcdir}"
    javacflags="${javacflags} -bootclasspath ${bootclasspath}"
    javacflags="${javacflags} -classpath ${classpath}"
    ;;
  javac)
    javacflags="-d ."
    javacflags="${javacflags} -sourcepath ${srcdir}"
    javacflags="${javacflags} -classpath ${classpath}"
    ;;
  gcj)
    javacflags="-d ."
    javacflags="${javacflags} -I${srcdir} -C"
    javacflags="${javacflags} -classpath ${classpath}"
    ;;
  *)
    javacflags="-d ."
    javacflags="${javacflags} -sourcepath ${srcdir}"
    javacflags="${javacflags} -classpath ${classpath}"
    ;;
esac

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## **NO CHANGE NECESSARY BELOW THIS LINE - EXPERTS ONLY** ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##


## If specific flags have been configured then they overrule
## our precomputed flags. Still a user can override by using
## environment variable $JAVACFLAGS - see below.
test -n "@JAVACFLAGS@" && {
  set x @JAVACFLAGS@  ; shift
  case $1 in
    +)
      shift
      JAVACFLAGS="${javacflags} $*"
      ;;
    -)
      shift
      javacflags="$* ${javacflags}"
      ;;
    =)
      shift
      javacflags="$*"
      ;;
    *)
      if test -z "$1" ; then
        javacflags="${javacflags}"
      else
        javacflags="$*"
      fi
      ;;
  esac
}

## Regardless what has been configured, a user should always
## be able to  override  without  the need to reconfigure or
## change this file. Therefore we check variable $JAVACFLAGS.
## In almost all cases the precomputed flags are just ok but
## some  additional  flags are needed. To support this in an
## easy way, we check for the very first value. If this val-
## ue is 
## '+'  -> append content of JAVACFLAGS to precomputed flags
## '-'  -> prepend content    -*-
## '='  -> do not use precomputed flags
## If none of these characters are given, the behaviour will
## be the same as if "=" would have been given.

set x ${JAVACFLAGS}  ; shift
case $1 in
  +)
    shift
    JAVACFLAGS="${javacflags} $*"
    ;;
  -)
    shift
    JAVACFLAGS="$* ${javacflags}"
    ;;
  =)
    shift
    JAVACFLAGS="$*"
    ;;
  *)
    if test -z "$1" ; then
      JAVACFLAGS="${javacflags}"
    else
      JAVACFLAGS="$*"
    fi
    ;;
esac

## Any special treatment goes here ..
case "${javac}" in
  jikes)
    ;;
  javac)
    ;;
  gcj)
    ;;
  *)
    ;;
esac


##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##    This shall be the command to be excuted below       ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##

cmd="${JAVAC} ${JAVACFLAGS} ${ARGV}"

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##        standard template to execute a command          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
case "${verbose}" in
  0|no|nein|non)
    set x `echo $ARGV | wc`
    echo "*** compiling $3 Java file(s)"
    ;;
  *)
    echo CLASSPATH=${CLASSPATH}
    echo $cmd
    ;;
esac

$cmd || {
  rc=$?
  cat <> E R R O R <<
============================================================

$cmd

============================================================
Got an error while trying to execute  command  above.  Error
messages (if any) must have shown before. The exit code was:
exit($rc)
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
EOF
  exit $rc
}
exit 0
antlr-2.7.7/scripts/config.guess0000755000175000017500000012555210522211616016622 0ustar  twernertwerner#! /bin/sh
# Attempt to guess a canonical system name.
#   Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
#   2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.

timestamp='2006-01-02'

# This file is free software; you can redistribute it and/or modify it
# under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
# General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
# 02110-1301, USA.
#
# As a special exception to the GNU General Public License, if you
# distribute this file as part of a program that contains a
# configuration script generated by Autoconf, you may include it under
# the same distribution terms that you use for the rest of that program.


# Originally written by Per Bothner .
# Please send patches to .  Submit a context
# diff and a properly formatted ChangeLog entry.
#
# This script attempts to guess a canonical system name similar to
# config.sub.  If it succeeds, it prints the system name on stdout, and
# exits with 0.  Otherwise, it exits with 1.
#
# The plan is that this can be called by configure scripts if you
# don't specify an explicit build system type.

me=`echo "$0" | sed -e 's,.*/,,'`

usage="\
Usage: $0 [OPTION]

Output the configuration name of the system \`$me' is run on.

Operation modes:
  -h, --help         print this help, then exit
  -t, --time-stamp   print date of last modification, then exit
  -v, --version      print version number, then exit

Report bugs and patches to ."

version="\
GNU config.guess ($timestamp)

Originally written by Per Bothner.
Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
Free Software Foundation, Inc.

This is free software; see the source for copying conditions.  There is NO
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."

help="
Try \`$me --help' for more information."

# Parse command line
while test $# -gt 0 ; do
  case $1 in
    --time-stamp | --time* | -t )
       echo "$timestamp" ; exit ;;
    --version | -v )
       echo "$version" ; exit ;;
    --help | --h* | -h )
       echo "$usage"; exit ;;
    -- )     # Stop option processing
       shift; break ;;
    - )	# Use stdin as input.
       break ;;
    -* )
       echo "$me: invalid option $1$help" >&2
       exit 1 ;;
    * )
       break ;;
  esac
done

if test $# != 0; then
  echo "$me: too many arguments$help" >&2
  exit 1
fi

trap 'exit 1' 1 2 15

# CC_FOR_BUILD -- compiler used by this script. Note that the use of a
# compiler to aid in system detection is discouraged as it requires
# temporary files to be created and, as you can see below, it is a
# headache to deal with in a portable fashion.

# Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still
# use `HOST_CC' if defined, but it is deprecated.

# Portable tmp directory creation inspired by the Autoconf team.

set_cc_for_build='
trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ;
trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ;
: ${TMPDIR=/tmp} ;
 { tmp=`(umask 077 && mktemp -d -q "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } ||
 { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } ||
 { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } ||
 { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ;
dummy=$tmp/dummy ;
tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ;
case $CC_FOR_BUILD,$HOST_CC,$CC in
 ,,)    echo "int x;" > $dummy.c ;
	for c in cc gcc c89 c99 ; do
	  if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then
	     CC_FOR_BUILD="$c"; break ;
	  fi ;
	done ;
	if test x"$CC_FOR_BUILD" = x ; then
	  CC_FOR_BUILD=no_compiler_found ;
	fi
	;;
 ,,*)   CC_FOR_BUILD=$CC ;;
 ,*,*)  CC_FOR_BUILD=$HOST_CC ;;
esac ; set_cc_for_build= ;'

# This is needed to find uname on a Pyramid OSx when run in the BSD universe.
# (ghazi@noc.rutgers.edu 1994-08-24)
if (test -f /.attbin/uname) >/dev/null 2>&1 ; then
	PATH=$PATH:/.attbin ; export PATH
fi

UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown
UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown
UNAME_SYSTEM=`(uname -s) 2>/dev/null`  || UNAME_SYSTEM=unknown
UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown

# Note: order is significant - the case branches are not exclusive.

case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in
    *:NetBSD:*:*)
	# NetBSD (nbsd) targets should (where applicable) match one or
	# more of the tupples: *-*-netbsdelf*, *-*-netbsdaout*,
	# *-*-netbsdecoff* and *-*-netbsd*.  For targets that recently
	# switched to ELF, *-*-netbsd* would select the old
	# object file format.  This provides both forward
	# compatibility and a consistent mechanism for selecting the
	# object file format.
	#
	# Note: NetBSD doesn't particularly care about the vendor
	# portion of the name.  We always set it to "unknown".
	sysctl="sysctl -n hw.machine_arch"
	UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \
	    /usr/sbin/$sysctl 2>/dev/null || echo unknown)`
	case "${UNAME_MACHINE_ARCH}" in
	    armeb) machine=armeb-unknown ;;
	    arm*) machine=arm-unknown ;;
	    sh3el) machine=shl-unknown ;;
	    sh3eb) machine=sh-unknown ;;
	    *) machine=${UNAME_MACHINE_ARCH}-unknown ;;
	esac
	# The Operating System including object format, if it has switched
	# to ELF recently, or will in the future.
	case "${UNAME_MACHINE_ARCH}" in
	    arm*|i386|m68k|ns32k|sh3*|sparc|vax)
		eval $set_cc_for_build
		if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \
			| grep __ELF__ >/dev/null
		then
		    # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout).
		    # Return netbsd for either.  FIX?
		    os=netbsd
		else
		    os=netbsdelf
		fi
		;;
	    *)
	        os=netbsd
		;;
	esac
	# The OS release
	# Debian GNU/NetBSD machines have a different userland, and
	# thus, need a distinct triplet. However, they do not need
	# kernel version information, so it can be replaced with a
	# suitable tag, in the style of linux-gnu.
	case "${UNAME_VERSION}" in
	    Debian*)
		release='-gnu'
		;;
	    *)
		release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'`
		;;
	esac
	# Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM:
	# contains redundant information, the shorter form:
	# CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used.
	echo "${machine}-${os}${release}"
	exit ;;
    *:OpenBSD:*:*)
	UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'`
	echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE}
	exit ;;
    *:ekkoBSD:*:*)
	echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE}
	exit ;;
    *:SolidBSD:*:*)
	echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE}
	exit ;;
    macppc:MirBSD:*:*)
	echo powerppc-unknown-mirbsd${UNAME_RELEASE}
	exit ;;
    *:MirBSD:*:*)
	echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE}
	exit ;;
    alpha:OSF1:*:*)
	case $UNAME_RELEASE in
	*4.0)
		UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'`
		;;
	*5.*)
	        UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'`
		;;
	esac
	# According to Compaq, /usr/sbin/psrinfo has been available on
	# OSF/1 and Tru64 systems produced since 1995.  I hope that
	# covers most systems running today.  This code pipes the CPU
	# types through head -n 1, so we only detect the type of CPU 0.
	ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^  The alpha \(.*\) processor.*$/\1/p' | head -n 1`
	case "$ALPHA_CPU_TYPE" in
	    "EV4 (21064)")
		UNAME_MACHINE="alpha" ;;
	    "EV4.5 (21064)")
		UNAME_MACHINE="alpha" ;;
	    "LCA4 (21066/21068)")
		UNAME_MACHINE="alpha" ;;
	    "EV5 (21164)")
		UNAME_MACHINE="alphaev5" ;;
	    "EV5.6 (21164A)")
		UNAME_MACHINE="alphaev56" ;;
	    "EV5.6 (21164PC)")
		UNAME_MACHINE="alphapca56" ;;
	    "EV5.7 (21164PC)")
		UNAME_MACHINE="alphapca57" ;;
	    "EV6 (21264)")
		UNAME_MACHINE="alphaev6" ;;
	    "EV6.7 (21264A)")
		UNAME_MACHINE="alphaev67" ;;
	    "EV6.8CB (21264C)")
		UNAME_MACHINE="alphaev68" ;;
	    "EV6.8AL (21264B)")
		UNAME_MACHINE="alphaev68" ;;
	    "EV6.8CX (21264D)")
		UNAME_MACHINE="alphaev68" ;;
	    "EV6.9A (21264/EV69A)")
		UNAME_MACHINE="alphaev69" ;;
	    "EV7 (21364)")
		UNAME_MACHINE="alphaev7" ;;
	    "EV7.9 (21364A)")
		UNAME_MACHINE="alphaev79" ;;
	esac
	# A Pn.n version is a patched version.
	# A Vn.n version is a released version.
	# A Tn.n version is a released field test version.
	# A Xn.n version is an unreleased experimental baselevel.
	# 1.2 uses "1.2" for uname -r.
	echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'`
	exit ;;
    Alpha\ *:Windows_NT*:*)
	# How do we know it's Interix rather than the generic POSIX subsystem?
	# Should we change UNAME_MACHINE based on the output of uname instead
	# of the specific Alpha model?
	echo alpha-pc-interix
	exit ;;
    21064:Windows_NT:50:3)
	echo alpha-dec-winnt3.5
	exit ;;
    Amiga*:UNIX_System_V:4.0:*)
	echo m68k-unknown-sysv4
	exit ;;
    *:[Aa]miga[Oo][Ss]:*:*)
	echo ${UNAME_MACHINE}-unknown-amigaos
	exit ;;
    *:[Mm]orph[Oo][Ss]:*:*)
	echo ${UNAME_MACHINE}-unknown-morphos
	exit ;;
    *:OS/390:*:*)
	echo i370-ibm-openedition
	exit ;;
    *:z/VM:*:*)
	echo s390-ibm-zvmoe
	exit ;;
    *:OS400:*:*)
        echo powerpc-ibm-os400
	exit ;;
    arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*)
	echo arm-acorn-riscix${UNAME_RELEASE}
	exit ;;
    arm:riscos:*:*|arm:RISCOS:*:*)
	echo arm-unknown-riscos
	exit ;;
    SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*)
	echo hppa1.1-hitachi-hiuxmpp
	exit ;;
    Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*)
	# akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE.
	if test "`(/bin/universe) 2>/dev/null`" = att ; then
		echo pyramid-pyramid-sysv3
	else
		echo pyramid-pyramid-bsd
	fi
	exit ;;
    NILE*:*:*:dcosx)
	echo pyramid-pyramid-svr4
	exit ;;
    DRS?6000:unix:4.0:6*)
	echo sparc-icl-nx6
	exit ;;
    DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*)
	case `/usr/bin/uname -p` in
	    sparc) echo sparc-icl-nx7; exit ;;
	esac ;;
    sun4H:SunOS:5.*:*)
	echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
	exit ;;
    sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*)
	echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
	exit ;;
    i86pc:SunOS:5.*:*)
	echo i386-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
	exit ;;
    sun4*:SunOS:6*:*)
	# According to config.sub, this is the proper way to canonicalize
	# SunOS6.  Hard to guess exactly what SunOS6 will be like, but
	# it's likely to be more like Solaris than SunOS4.
	echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
	exit ;;
    sun4*:SunOS:*:*)
	case "`/usr/bin/arch -k`" in
	    Series*|S4*)
		UNAME_RELEASE=`uname -v`
		;;
	esac
	# Japanese Language versions have a version number like `4.1.3-JL'.
	echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'`
	exit ;;
    sun3*:SunOS:*:*)
	echo m68k-sun-sunos${UNAME_RELEASE}
	exit ;;
    sun*:*:4.2BSD:*)
	UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null`
	test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3
	case "`/bin/arch`" in
	    sun3)
		echo m68k-sun-sunos${UNAME_RELEASE}
		;;
	    sun4)
		echo sparc-sun-sunos${UNAME_RELEASE}
		;;
	esac
	exit ;;
    aushp:SunOS:*:*)
	echo sparc-auspex-sunos${UNAME_RELEASE}
	exit ;;
    # The situation for MiNT is a little confusing.  The machine name
    # can be virtually everything (everything which is not
    # "atarist" or "atariste" at least should have a processor
    # > m68000).  The system name ranges from "MiNT" over "FreeMiNT"
    # to the lowercase version "mint" (or "freemint").  Finally
    # the system name "TOS" denotes a system which is actually not
    # MiNT.  But MiNT is downward compatible to TOS, so this should
    # be no problem.
    atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*)
        echo m68k-atari-mint${UNAME_RELEASE}
	exit ;;
    atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*)
	echo m68k-atari-mint${UNAME_RELEASE}
        exit ;;
    *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*)
        echo m68k-atari-mint${UNAME_RELEASE}
	exit ;;
    milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*)
        echo m68k-milan-mint${UNAME_RELEASE}
        exit ;;
    hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*)
        echo m68k-hades-mint${UNAME_RELEASE}
        exit ;;
    *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*)
        echo m68k-unknown-mint${UNAME_RELEASE}
        exit ;;
    m68k:machten:*:*)
	echo m68k-apple-machten${UNAME_RELEASE}
	exit ;;
    powerpc:machten:*:*)
	echo powerpc-apple-machten${UNAME_RELEASE}
	exit ;;
    RISC*:Mach:*:*)
	echo mips-dec-mach_bsd4.3
	exit ;;
    RISC*:ULTRIX:*:*)
	echo mips-dec-ultrix${UNAME_RELEASE}
	exit ;;
    VAX*:ULTRIX*:*:*)
	echo vax-dec-ultrix${UNAME_RELEASE}
	exit ;;
    2020:CLIX:*:* | 2430:CLIX:*:*)
	echo clipper-intergraph-clix${UNAME_RELEASE}
	exit ;;
    mips:*:*:UMIPS | mips:*:*:RISCos)
	eval $set_cc_for_build
	sed 's/^	//' << EOF >$dummy.c
#ifdef __cplusplus
#include   /* for printf() prototype */
	int main (int argc, char *argv[]) {
#else
	int main (argc, argv) int argc; char *argv[]; {
#endif
	#if defined (host_mips) && defined (MIPSEB)
	#if defined (SYSTYPE_SYSV)
	  printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0);
	#endif
	#if defined (SYSTYPE_SVR4)
	  printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0);
	#endif
	#if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD)
	  printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0);
	#endif
	#endif
	  exit (-1);
	}
EOF
	$CC_FOR_BUILD -o $dummy $dummy.c &&
	  dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` &&
	  SYSTEM_NAME=`$dummy $dummyarg` &&
	    { echo "$SYSTEM_NAME"; exit; }
	echo mips-mips-riscos${UNAME_RELEASE}
	exit ;;
    Motorola:PowerMAX_OS:*:*)
	echo powerpc-motorola-powermax
	exit ;;
    Motorola:*:4.3:PL8-*)
	echo powerpc-harris-powermax
	exit ;;
    Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*)
	echo powerpc-harris-powermax
	exit ;;
    Night_Hawk:Power_UNIX:*:*)
	echo powerpc-harris-powerunix
	exit ;;
    m88k:CX/UX:7*:*)
	echo m88k-harris-cxux7
	exit ;;
    m88k:*:4*:R4*)
	echo m88k-motorola-sysv4
	exit ;;
    m88k:*:3*:R3*)
	echo m88k-motorola-sysv3
	exit ;;
    AViiON:dgux:*:*)
        # DG/UX returns AViiON for all architectures
        UNAME_PROCESSOR=`/usr/bin/uname -p`
	if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ]
	then
	    if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \
	       [ ${TARGET_BINARY_INTERFACE}x = x ]
	    then
		echo m88k-dg-dgux${UNAME_RELEASE}
	    else
		echo m88k-dg-dguxbcs${UNAME_RELEASE}
	    fi
	else
	    echo i586-dg-dgux${UNAME_RELEASE}
	fi
 	exit ;;
    M88*:DolphinOS:*:*)	# DolphinOS (SVR3)
	echo m88k-dolphin-sysv3
	exit ;;
    M88*:*:R3*:*)
	# Delta 88k system running SVR3
	echo m88k-motorola-sysv3
	exit ;;
    XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3)
	echo m88k-tektronix-sysv3
	exit ;;
    Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD)
	echo m68k-tektronix-bsd
	exit ;;
    *:IRIX*:*:*)
	echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'`
	exit ;;
    ????????:AIX?:[12].1:2)   # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX.
	echo romp-ibm-aix     # uname -m gives an 8 hex-code CPU id
	exit ;;               # Note that: echo "'`uname -s`'" gives 'AIX '
    i*86:AIX:*:*)
	echo i386-ibm-aix
	exit ;;
    ia64:AIX:*:*)
	if [ -x /usr/bin/oslevel ] ; then
		IBM_REV=`/usr/bin/oslevel`
	else
		IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}
	fi
	echo ${UNAME_MACHINE}-ibm-aix${IBM_REV}
	exit ;;
    *:AIX:2:3)
	if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then
		eval $set_cc_for_build
		sed 's/^		//' << EOF >$dummy.c
		#include 

		main()
			{
			if (!__power_pc())
				exit(1);
			puts("powerpc-ibm-aix3.2.5");
			exit(0);
			}
EOF
		if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy`
		then
			echo "$SYSTEM_NAME"
		else
			echo rs6000-ibm-aix3.2.5
		fi
	elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then
		echo rs6000-ibm-aix3.2.4
	else
		echo rs6000-ibm-aix3.2
	fi
	exit ;;
    *:AIX:*:[45])
	IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'`
	if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then
		IBM_ARCH=rs6000
	else
		IBM_ARCH=powerpc
	fi
	if [ -x /usr/bin/oslevel ] ; then
		IBM_REV=`/usr/bin/oslevel`
	else
		IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE}
	fi
	echo ${IBM_ARCH}-ibm-aix${IBM_REV}
	exit ;;
    *:AIX:*:*)
	echo rs6000-ibm-aix
	exit ;;
    ibmrt:4.4BSD:*|romp-ibm:BSD:*)
	echo romp-ibm-bsd4.4
	exit ;;
    ibmrt:*BSD:*|romp-ibm:BSD:*)            # covers RT/PC BSD and
	echo romp-ibm-bsd${UNAME_RELEASE}   # 4.3 with uname added to
	exit ;;                             # report: romp-ibm BSD 4.3
    *:BOSX:*:*)
	echo rs6000-bull-bosx
	exit ;;
    DPX/2?00:B.O.S.:*:*)
	echo m68k-bull-sysv3
	exit ;;
    9000/[34]??:4.3bsd:1.*:*)
	echo m68k-hp-bsd
	exit ;;
    hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*)
	echo m68k-hp-bsd4.4
	exit ;;
    9000/[34678]??:HP-UX:*:*)
	HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'`
	case "${UNAME_MACHINE}" in
	    9000/31? )            HP_ARCH=m68000 ;;
	    9000/[34]?? )         HP_ARCH=m68k ;;
	    9000/[678][0-9][0-9])
		if [ -x /usr/bin/getconf ]; then
		    sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null`
                    sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null`
                    case "${sc_cpu_version}" in
                      523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0
                      528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1
                      532)                      # CPU_PA_RISC2_0
                        case "${sc_kernel_bits}" in
                          32) HP_ARCH="hppa2.0n" ;;
                          64) HP_ARCH="hppa2.0w" ;;
			  '') HP_ARCH="hppa2.0" ;;   # HP-UX 10.20
                        esac ;;
                    esac
		fi
		if [ "${HP_ARCH}" = "" ]; then
		    eval $set_cc_for_build
		    sed 's/^              //' << EOF >$dummy.c

              #define _HPUX_SOURCE
              #include 
              #include 

              int main ()
              {
              #if defined(_SC_KERNEL_BITS)
                  long bits = sysconf(_SC_KERNEL_BITS);
              #endif
                  long cpu  = sysconf (_SC_CPU_VERSION);

                  switch (cpu)
              	{
              	case CPU_PA_RISC1_0: puts ("hppa1.0"); break;
              	case CPU_PA_RISC1_1: puts ("hppa1.1"); break;
              	case CPU_PA_RISC2_0:
              #if defined(_SC_KERNEL_BITS)
              	    switch (bits)
              		{
              		case 64: puts ("hppa2.0w"); break;
              		case 32: puts ("hppa2.0n"); break;
              		default: puts ("hppa2.0"); break;
              		} break;
              #else  /* !defined(_SC_KERNEL_BITS) */
              	    puts ("hppa2.0"); break;
              #endif
              	default: puts ("hppa1.0"); break;
              	}
                  exit (0);
              }
EOF
		    (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy`
		    test -z "$HP_ARCH" && HP_ARCH=hppa
		fi ;;
	esac
	if [ ${HP_ARCH} = "hppa2.0w" ]
	then
	    eval $set_cc_for_build

	    # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating
	    # 32-bit code.  hppa64-hp-hpux* has the same kernel and a compiler
	    # generating 64-bit code.  GNU and HP use different nomenclature:
	    #
	    # $ CC_FOR_BUILD=cc ./config.guess
	    # => hppa2.0w-hp-hpux11.23
	    # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess
	    # => hppa64-hp-hpux11.23

	    if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) |
		grep __LP64__ >/dev/null
	    then
		HP_ARCH="hppa2.0w"
	    else
		HP_ARCH="hppa64"
	    fi
	fi
	echo ${HP_ARCH}-hp-hpux${HPUX_REV}
	exit ;;
    ia64:HP-UX:*:*)
	HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'`
	echo ia64-hp-hpux${HPUX_REV}
	exit ;;
    3050*:HI-UX:*:*)
	eval $set_cc_for_build
	sed 's/^	//' << EOF >$dummy.c
	#include 
	int
	main ()
	{
	  long cpu = sysconf (_SC_CPU_VERSION);
	  /* The order matters, because CPU_IS_HP_MC68K erroneously returns
	     true for CPU_PA_RISC1_0.  CPU_IS_PA_RISC returns correct
	     results, however.  */
	  if (CPU_IS_PA_RISC (cpu))
	    {
	      switch (cpu)
		{
		  case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break;
		  case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break;
		  case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break;
		  default: puts ("hppa-hitachi-hiuxwe2"); break;
		}
	    }
	  else if (CPU_IS_HP_MC68K (cpu))
	    puts ("m68k-hitachi-hiuxwe2");
	  else puts ("unknown-hitachi-hiuxwe2");
	  exit (0);
	}
EOF
	$CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` &&
		{ echo "$SYSTEM_NAME"; exit; }
	echo unknown-hitachi-hiuxwe2
	exit ;;
    9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* )
	echo hppa1.1-hp-bsd
	exit ;;
    9000/8??:4.3bsd:*:*)
	echo hppa1.0-hp-bsd
	exit ;;
    *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*)
	echo hppa1.0-hp-mpeix
	exit ;;
    hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* )
	echo hppa1.1-hp-osf
	exit ;;
    hp8??:OSF1:*:*)
	echo hppa1.0-hp-osf
	exit ;;
    i*86:OSF1:*:*)
	if [ -x /usr/sbin/sysversion ] ; then
	    echo ${UNAME_MACHINE}-unknown-osf1mk
	else
	    echo ${UNAME_MACHINE}-unknown-osf1
	fi
	exit ;;
    parisc*:Lites*:*:*)
	echo hppa1.1-hp-lites
	exit ;;
    C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)
	echo c1-convex-bsd
        exit ;;
    C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*)
	if getsysinfo -f scalar_acc
	then echo c32-convex-bsd
	else echo c2-convex-bsd
	fi
        exit ;;
    C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*)
	echo c34-convex-bsd
        exit ;;
    C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*)
	echo c38-convex-bsd
        exit ;;
    C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*)
	echo c4-convex-bsd
        exit ;;
    CRAY*Y-MP:*:*:*)
	echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
	exit ;;
    CRAY*[A-Z]90:*:*:*)
	echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \
	| sed -e 's/CRAY.*\([A-Z]90\)/\1/' \
	      -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \
	      -e 's/\.[^.]*$/.X/'
	exit ;;
    CRAY*TS:*:*:*)
	echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
	exit ;;
    CRAY*T3E:*:*:*)
	echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
	exit ;;
    CRAY*SV1:*:*:*)
	echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
	exit ;;
    *:UNICOS/mp:*:*)
	echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/'
	exit ;;
    F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*)
	FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'`
        FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'`
        FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'`
        echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
        exit ;;
    5000:UNIX_System_V:4.*:*)
        FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'`
        FUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'`
        echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
	exit ;;
    i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*)
	echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE}
	exit ;;
    sparc*:BSD/OS:*:*)
	echo sparc-unknown-bsdi${UNAME_RELEASE}
	exit ;;
    *:BSD/OS:*:*)
	echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE}
	exit ;;
    *:FreeBSD:*:*)
	case ${UNAME_MACHINE} in
	    pc98)
		echo i386-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;
	    *)
		echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;;
	esac
	exit ;;
    i*:CYGWIN*:*)
	echo ${UNAME_MACHINE}-pc-cygwin
	exit ;;
    i*:MINGW*:*)
	echo ${UNAME_MACHINE}-pc-mingw32
	exit ;;
    i*:windows32*:*)
    	# uname -m includes "-pc" on this system.
    	echo ${UNAME_MACHINE}-mingw32
	exit ;;
    i*:PW*:*)
	echo ${UNAME_MACHINE}-pc-pw32
	exit ;;
    x86:Interix*:[345]*)
	echo i586-pc-interix${UNAME_RELEASE}|sed -e 's/\..*//'
	exit ;;
    [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*)
	echo i${UNAME_MACHINE}-pc-mks
	exit ;;
    i*:Windows_NT*:* | Pentium*:Windows_NT*:*)
	# How do we know it's Interix rather than the generic POSIX subsystem?
	# It also conflicts with pre-2.0 versions of AT&T UWIN. Should we
	# UNAME_MACHINE based on the output of uname instead of i386?
	echo i586-pc-interix
	exit ;;
    i*:UWIN*:*)
	echo ${UNAME_MACHINE}-pc-uwin
	exit ;;
    amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*)
	echo x86_64-unknown-cygwin
	exit ;;
    p*:CYGWIN*:*)
	echo powerpcle-unknown-cygwin
	exit ;;
    prep*:SunOS:5.*:*)
	echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'`
	exit ;;
    *:GNU:*:*)
	# the GNU system
	echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-gnu`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'`
	exit ;;
    *:GNU/*:*:*)
	# other systems with GNU libc and userland
	echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-gnu
	exit ;;
    i*86:Minix:*:*)
	echo ${UNAME_MACHINE}-pc-minix
	exit ;;
    arm*:Linux:*:*)
	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    cris:Linux:*:*)
	echo cris-axis-linux-gnu
	exit ;;
    crisv32:Linux:*:*)
	echo crisv32-axis-linux-gnu
	exit ;;
    frv:Linux:*:*)
    	echo frv-unknown-linux-gnu
	exit ;;
    ia64:Linux:*:*)
	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    m32r*:Linux:*:*)
	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    m68*:Linux:*:*)
	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    mips:Linux:*:*)
	eval $set_cc_for_build
	sed 's/^	//' << EOF >$dummy.c
	#undef CPU
	#undef mips
	#undef mipsel
	#if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL)
	CPU=mipsel
	#else
	#if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB)
	CPU=mips
	#else
	CPU=
	#endif
	#endif
EOF
	eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n '/^CPU/{s: ::g;p;}'`"
	test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; }
	;;
    mips64:Linux:*:*)
	eval $set_cc_for_build
	sed 's/^	//' << EOF >$dummy.c
	#undef CPU
	#undef mips64
	#undef mips64el
	#if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL)
	CPU=mips64el
	#else
	#if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB)
	CPU=mips64
	#else
	CPU=
	#endif
	#endif
EOF
	eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n '/^CPU/{s: ::g;p;}'`"
	test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; }
	;;
    or32:Linux:*:*)
	echo or32-unknown-linux-gnu
	exit ;;
    ppc:Linux:*:*)
	echo powerpc-unknown-linux-gnu
	exit ;;
    ppc64:Linux:*:*)
	echo powerpc64-unknown-linux-gnu
	exit ;;
    alpha:Linux:*:*)
	case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in
	  EV5)   UNAME_MACHINE=alphaev5 ;;
	  EV56)  UNAME_MACHINE=alphaev56 ;;
	  PCA56) UNAME_MACHINE=alphapca56 ;;
	  PCA57) UNAME_MACHINE=alphapca56 ;;
	  EV6)   UNAME_MACHINE=alphaev6 ;;
	  EV67)  UNAME_MACHINE=alphaev67 ;;
	  EV68*) UNAME_MACHINE=alphaev68 ;;
        esac
	objdump --private-headers /bin/sh | grep ld.so.1 >/dev/null
	if test "$?" = 0 ; then LIBC="libc1" ; else LIBC="" ; fi
	echo ${UNAME_MACHINE}-unknown-linux-gnu${LIBC}
	exit ;;
    parisc:Linux:*:* | hppa:Linux:*:*)
	# Look for CPU level
	case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in
	  PA7*) echo hppa1.1-unknown-linux-gnu ;;
	  PA8*) echo hppa2.0-unknown-linux-gnu ;;
	  *)    echo hppa-unknown-linux-gnu ;;
	esac
	exit ;;
    parisc64:Linux:*:* | hppa64:Linux:*:*)
	echo hppa64-unknown-linux-gnu
	exit ;;
    s390:Linux:*:* | s390x:Linux:*:*)
	echo ${UNAME_MACHINE}-ibm-linux
	exit ;;
    sh64*:Linux:*:*)
    	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    sh*:Linux:*:*)
	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    sparc:Linux:*:* | sparc64:Linux:*:*)
	echo ${UNAME_MACHINE}-unknown-linux-gnu
	exit ;;
    vax:Linux:*:*)
	echo ${UNAME_MACHINE}-dec-linux-gnu
	exit ;;
    x86_64:Linux:*:*)
	echo x86_64-unknown-linux-gnu
	exit ;;
    i*86:Linux:*:*)
	# The BFD linker knows what the default object file format is, so
	# first see if it will tell us. cd to the root directory to prevent
	# problems with other programs or directories called `ld' in the path.
	# Set LC_ALL=C to ensure ld outputs messages in English.
	ld_supported_targets=`cd /; LC_ALL=C ld --help 2>&1 \
			 | sed -ne '/supported targets:/!d
				    s/[ 	][ 	]*/ /g
				    s/.*supported targets: *//
				    s/ .*//
				    p'`
        case "$ld_supported_targets" in
	  elf32-i386)
		TENTATIVE="${UNAME_MACHINE}-pc-linux-gnu"
		;;
	  a.out-i386-linux)
		echo "${UNAME_MACHINE}-pc-linux-gnuaout"
		exit ;;
	  coff-i386)
		echo "${UNAME_MACHINE}-pc-linux-gnucoff"
		exit ;;
	  "")
		# Either a pre-BFD a.out linker (linux-gnuoldld) or
		# one that does not give us useful --help.
		echo "${UNAME_MACHINE}-pc-linux-gnuoldld"
		exit ;;
	esac
	# Determine whether the default compiler is a.out or elf
	eval $set_cc_for_build
	sed 's/^	//' << EOF >$dummy.c
	#include 
	#ifdef __ELF__
	# ifdef __GLIBC__
	#  if __GLIBC__ >= 2
	LIBC=gnu
	#  else
	LIBC=gnulibc1
	#  endif
	# else
	LIBC=gnulibc1
	# endif
	#else
	#if defined(__INTEL_COMPILER) || defined(__PGI)
	LIBC=gnu
	#else
	LIBC=gnuaout
	#endif
	#endif
	#ifdef __dietlibc__
	LIBC=dietlibc
	#endif
EOF
	eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n '/^LIBC/{s: ::g;p;}'`"
	test x"${LIBC}" != x && {
		echo "${UNAME_MACHINE}-pc-linux-${LIBC}"
		exit
	}
	test x"${TENTATIVE}" != x && { echo "${TENTATIVE}"; exit; }
	;;
    i*86:DYNIX/ptx:4*:*)
	# ptx 4.0 does uname -s correctly, with DYNIX/ptx in there.
	# earlier versions are messed up and put the nodename in both
	# sysname and nodename.
	echo i386-sequent-sysv4
	exit ;;
    i*86:UNIX_SV:4.2MP:2.*)
        # Unixware is an offshoot of SVR4, but it has its own version
        # number series starting with 2...
        # I am not positive that other SVR4 systems won't match this,
	# I just have to hope.  -- rms.
        # Use sysv4.2uw... so that sysv4* matches it.
	echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION}
	exit ;;
    i*86:OS/2:*:*)
	# If we were able to find `uname', then EMX Unix compatibility
	# is probably installed.
	echo ${UNAME_MACHINE}-pc-os2-emx
	exit ;;
    i*86:XTS-300:*:STOP)
	echo ${UNAME_MACHINE}-unknown-stop
	exit ;;
    i*86:atheos:*:*)
	echo ${UNAME_MACHINE}-unknown-atheos
	exit ;;
    i*86:syllable:*:*)
	echo ${UNAME_MACHINE}-pc-syllable
	exit ;;
    i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.0*:*)
	echo i386-unknown-lynxos${UNAME_RELEASE}
	exit ;;
    i*86:*DOS:*:*)
	echo ${UNAME_MACHINE}-pc-msdosdjgpp
	exit ;;
    i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*)
	UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'`
	if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then
		echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL}
	else
		echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL}
	fi
	exit ;;
    i*86:*:5:[678]*)
    	# UnixWare 7.x, OpenUNIX and OpenServer 6.
	case `/bin/uname -X | grep "^Machine"` in
	    *486*)	     UNAME_MACHINE=i486 ;;
	    *Pentium)	     UNAME_MACHINE=i586 ;;
	    *Pent*|*Celeron) UNAME_MACHINE=i686 ;;
	esac
	echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION}
	exit ;;
    i*86:*:3.2:*)
	if test -f /usr/options/cb.name; then
		UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then
		UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')`
		(/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486
		(/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \
			&& UNAME_MACHINE=i586
		(/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \
			&& UNAME_MACHINE=i686
		(/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \
			&& UNAME_MACHINE=i686
		echo ${UNAME_MACHINE}-pc-sco$UNAME_REL
	else
		echo ${UNAME_MACHINE}-pc-sysv32
	fi
	exit ;;
    pc:*:*:*)
	# Left here for compatibility:
        # uname -m prints for DJGPP always 'pc', but it prints nothing about
        # the processor, so we play safe by assuming i386.
	echo i386-pc-msdosdjgpp
        exit ;;
    Intel:Mach:3*:*)
	echo i386-pc-mach3
	exit ;;
    paragon:*:*:*)
	echo i860-intel-osf1
	exit ;;
    i860:*:4.*:*) # i860-SVR4
	if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then
	  echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4
	else # Add other i860-SVR4 vendors below as they are discovered.
	  echo i860-unknown-sysv${UNAME_RELEASE}  # Unknown i860-SVR4
	fi
	exit ;;
    mini*:CTIX:SYS*5:*)
	# "miniframe"
	echo m68010-convergent-sysv
	exit ;;
    mc68k:UNIX:SYSTEM5:3.51m)
	echo m68k-convergent-sysv
	exit ;;
    M680?0:D-NIX:5.3:*)
	echo m68k-diab-dnix
	exit ;;
    M68*:*:R3V[5678]*:*)
	test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;;
    3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0)
	OS_REL=''
	test -r /etc/.relid \
	&& OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid`
	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
	  && { echo i486-ncr-sysv4.3${OS_REL}; exit; }
	/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \
	  && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;;
    3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*)
        /bin/uname -p 2>/dev/null | grep 86 >/dev/null \
          && { echo i486-ncr-sysv4; exit; } ;;
    m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*)
	echo m68k-unknown-lynxos${UNAME_RELEASE}
	exit ;;
    mc68030:UNIX_System_V:4.*:*)
	echo m68k-atari-sysv4
	exit ;;
    TSUNAMI:LynxOS:2.*:*)
	echo sparc-unknown-lynxos${UNAME_RELEASE}
	exit ;;
    rs6000:LynxOS:2.*:*)
	echo rs6000-unknown-lynxos${UNAME_RELEASE}
	exit ;;
    PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.0*:*)
	echo powerpc-unknown-lynxos${UNAME_RELEASE}
	exit ;;
    SM[BE]S:UNIX_SV:*:*)
	echo mips-dde-sysv${UNAME_RELEASE}
	exit ;;
    RM*:ReliantUNIX-*:*:*)
	echo mips-sni-sysv4
	exit ;;
    RM*:SINIX-*:*:*)
	echo mips-sni-sysv4
	exit ;;
    *:SINIX-*:*:*)
	if uname -p 2>/dev/null >/dev/null ; then
		UNAME_MACHINE=`(uname -p) 2>/dev/null`
		echo ${UNAME_MACHINE}-sni-sysv4
	else
		echo ns32k-sni-sysv
	fi
	exit ;;
    PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort
                      # says 
        echo i586-unisys-sysv4
        exit ;;
    *:UNIX_System_V:4*:FTX*)
	# From Gerald Hewes .
	# How about differentiating between stratus architectures? -djm
	echo hppa1.1-stratus-sysv4
	exit ;;
    *:*:*:FTX*)
	# From seanf@swdc.stratus.com.
	echo i860-stratus-sysv4
	exit ;;
    i*86:VOS:*:*)
	# From Paul.Green@stratus.com.
	echo ${UNAME_MACHINE}-stratus-vos
	exit ;;
    *:VOS:*:*)
	# From Paul.Green@stratus.com.
	echo hppa1.1-stratus-vos
	exit ;;
    mc68*:A/UX:*:*)
	echo m68k-apple-aux${UNAME_RELEASE}
	exit ;;
    news*:NEWS-OS:6*:*)
	echo mips-sony-newsos6
	exit ;;
    R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*)
	if [ -d /usr/nec ]; then
	        echo mips-nec-sysv${UNAME_RELEASE}
	else
	        echo mips-unknown-sysv${UNAME_RELEASE}
	fi
        exit ;;
    BeBox:BeOS:*:*)	# BeOS running on hardware made by Be, PPC only.
	echo powerpc-be-beos
	exit ;;
    BeMac:BeOS:*:*)	# BeOS running on Mac or Mac clone, PPC only.
	echo powerpc-apple-beos
	exit ;;
    BePC:BeOS:*:*)	# BeOS running on Intel PC compatible.
	echo i586-pc-beos
	exit ;;
    SX-4:SUPER-UX:*:*)
	echo sx4-nec-superux${UNAME_RELEASE}
	exit ;;
    SX-5:SUPER-UX:*:*)
	echo sx5-nec-superux${UNAME_RELEASE}
	exit ;;
    SX-6:SUPER-UX:*:*)
	echo sx6-nec-superux${UNAME_RELEASE}
	exit ;;
    Power*:Rhapsody:*:*)
	echo powerpc-apple-rhapsody${UNAME_RELEASE}
	exit ;;
    *:Rhapsody:*:*)
	echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE}
	exit ;;
    *:Darwin:*:*)
	UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown
	case $UNAME_PROCESSOR in
	    unknown) UNAME_PROCESSOR=powerpc ;;
	esac
	echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE}
	exit ;;
    *:procnto*:*:* | *:QNX:[0123456789]*:*)
	UNAME_PROCESSOR=`uname -p`
	if test "$UNAME_PROCESSOR" = "x86"; then
		UNAME_PROCESSOR=i386
		UNAME_MACHINE=pc
	fi
	echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE}
	exit ;;
    *:QNX:*:4*)
	echo i386-pc-qnx
	exit ;;
    NSE-?:NONSTOP_KERNEL:*:*)
	echo nse-tandem-nsk${UNAME_RELEASE}
	exit ;;
    NSR-?:NONSTOP_KERNEL:*:*)
	echo nsr-tandem-nsk${UNAME_RELEASE}
	exit ;;
    *:NonStop-UX:*:*)
	echo mips-compaq-nonstopux
	exit ;;
    BS2000:POSIX*:*:*)
	echo bs2000-siemens-sysv
	exit ;;
    DS/*:UNIX_System_V:*:*)
	echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE}
	exit ;;
    *:Plan9:*:*)
	# "uname -m" is not consistent, so use $cputype instead. 386
	# is converted to i386 for consistency with other x86
	# operating systems.
	if test "$cputype" = "386"; then
	    UNAME_MACHINE=i386
	else
	    UNAME_MACHINE="$cputype"
	fi
	echo ${UNAME_MACHINE}-unknown-plan9
	exit ;;
    *:TOPS-10:*:*)
	echo pdp10-unknown-tops10
	exit ;;
    *:TENEX:*:*)
	echo pdp10-unknown-tenex
	exit ;;
    KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*)
	echo pdp10-dec-tops20
	exit ;;
    XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*)
	echo pdp10-xkl-tops20
	exit ;;
    *:TOPS-20:*:*)
	echo pdp10-unknown-tops20
	exit ;;
    *:ITS:*:*)
	echo pdp10-unknown-its
	exit ;;
    SEI:*:*:SEIUX)
        echo mips-sei-seiux${UNAME_RELEASE}
	exit ;;
    *:DragonFly:*:*)
	echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`
	exit ;;
    *:*VMS:*:*)
    	UNAME_MACHINE=`(uname -p) 2>/dev/null`
	case "${UNAME_MACHINE}" in
	    A*) echo alpha-dec-vms ; exit ;;
	    I*) echo ia64-dec-vms ; exit ;;
	    V*) echo vax-dec-vms ; exit ;;
	esac ;;
    *:XENIX:*:SysV)
	echo i386-pc-xenix
	exit ;;
    i*86:skyos:*:*)
	echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//'
	exit ;;
    i*86:rdos:*:*)
	echo ${UNAME_MACHINE}-pc-rdos
	exit ;;
esac

#echo '(No uname command or uname output not recognized.)' 1>&2
#echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2

eval $set_cc_for_build
cat >$dummy.c <
# include 
#endif
main ()
{
#if defined (sony)
#if defined (MIPSEB)
  /* BFD wants "bsd" instead of "newsos".  Perhaps BFD should be changed,
     I don't know....  */
  printf ("mips-sony-bsd\n"); exit (0);
#else
#include 
  printf ("m68k-sony-newsos%s\n",
#ifdef NEWSOS4
          "4"
#else
	  ""
#endif
         ); exit (0);
#endif
#endif

#if defined (__arm) && defined (__acorn) && defined (__unix)
  printf ("arm-acorn-riscix\n"); exit (0);
#endif

#if defined (hp300) && !defined (hpux)
  printf ("m68k-hp-bsd\n"); exit (0);
#endif

#if defined (NeXT)
#if !defined (__ARCHITECTURE__)
#define __ARCHITECTURE__ "m68k"
#endif
  int version;
  version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`;
  if (version < 4)
    printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version);
  else
    printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version);
  exit (0);
#endif

#if defined (MULTIMAX) || defined (n16)
#if defined (UMAXV)
  printf ("ns32k-encore-sysv\n"); exit (0);
#else
#if defined (CMU)
  printf ("ns32k-encore-mach\n"); exit (0);
#else
  printf ("ns32k-encore-bsd\n"); exit (0);
#endif
#endif
#endif

#if defined (__386BSD__)
  printf ("i386-pc-bsd\n"); exit (0);
#endif

#if defined (sequent)
#if defined (i386)
  printf ("i386-sequent-dynix\n"); exit (0);
#endif
#if defined (ns32000)
  printf ("ns32k-sequent-dynix\n"); exit (0);
#endif
#endif

#if defined (_SEQUENT_)
    struct utsname un;

    uname(&un);

    if (strncmp(un.version, "V2", 2) == 0) {
	printf ("i386-sequent-ptx2\n"); exit (0);
    }
    if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */
	printf ("i386-sequent-ptx1\n"); exit (0);
    }
    printf ("i386-sequent-ptx\n"); exit (0);

#endif

#if defined (vax)
# if !defined (ultrix)
#  include 
#  if defined (BSD)
#   if BSD == 43
      printf ("vax-dec-bsd4.3\n"); exit (0);
#   else
#    if BSD == 199006
      printf ("vax-dec-bsd4.3reno\n"); exit (0);
#    else
      printf ("vax-dec-bsd\n"); exit (0);
#    endif
#   endif
#  else
    printf ("vax-dec-bsd\n"); exit (0);
#  endif
# else
    printf ("vax-dec-ultrix\n"); exit (0);
# endif
#endif

#if defined (alliant) && defined (i860)
  printf ("i860-alliant-bsd\n"); exit (0);
#endif

  exit (1);
}
EOF

$CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` &&
	{ echo "$SYSTEM_NAME"; exit; }

# Apollos put the system type in the environment.

test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; }

# Convex versions that predate uname can use getsysinfo(1)

if [ -x /usr/convex/getsysinfo ]
then
    case `getsysinfo -f cpu_type` in
    c1*)
	echo c1-convex-bsd
	exit ;;
    c2*)
	if getsysinfo -f scalar_acc
	then echo c32-convex-bsd
	else echo c2-convex-bsd
	fi
	exit ;;
    c34*)
	echo c34-convex-bsd
	exit ;;
    c38*)
	echo c38-convex-bsd
	exit ;;
    c4*)
	echo c4-convex-bsd
	exit ;;
    esac
fi

cat >&2 < in order to provide the needed
information to handle your system.

config.guess timestamp = $timestamp

uname -m = `(uname -m) 2>/dev/null || echo unknown`
uname -r = `(uname -r) 2>/dev/null || echo unknown`
uname -s = `(uname -s) 2>/dev/null || echo unknown`
uname -v = `(uname -v) 2>/dev/null || echo unknown`

/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null`
/bin/uname -X     = `(/bin/uname -X) 2>/dev/null`

hostinfo               = `(hostinfo) 2>/dev/null`
/bin/universe          = `(/bin/universe) 2>/dev/null`
/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null`
/bin/arch              = `(/bin/arch) 2>/dev/null`
/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null`
/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null`

UNAME_MACHINE = ${UNAME_MACHINE}
UNAME_RELEASE = ${UNAME_RELEASE}
UNAME_SYSTEM  = ${UNAME_SYSTEM}
UNAME_VERSION = ${UNAME_VERSION}
EOF

exit 1

# Local variables:
# eval: (add-hook 'write-file-hooks 'time-stamp)
# time-stamp-start: "timestamp='"
# time-stamp-format: "%:y-%02m-%02d"
# time-stamp-end: "'"
# End:
antlr-2.7.7/scripts/antlr.sh.in0000755000175000017500000000616310522211616016362 0ustar  twernertwerner#!/bin/sh
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This file is part of ANTLR. See LICENSE.txt for licence  ##
## details. Written by W. Haefelinger.                      ##
##                                                          ##
##       Copyright (C) Wolfgang Haefelinger, 2004           ##
##                                                          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
test -z "${verbose}" && { 
  verbose=@VERBOSE@
}

## If there's nothing to be done we exit gracefully.
test -z "$1" && exit 0

## This is the top build directory.
abs_top_build_dir="@abs_this_builddir@"

## If $ANTLR_JAR is given as environment variable we are going
## to use it, otherwise we are using configured value. The value
## given by $ANTLR_JAR must be a valid file or directory - this 
## will be checked. If not, an error gets reported.
antlr_jar= 
test -n "${ANTLR_JAR}" && {
  antlr_jar="${ANTLR_JAR}"
  test -f "${antlr_jar}" -o -d "${antlr_jar}" || {
    cat <&2
  cat <> E R R O R <<
============================================================

CLASSPATH=$CLASSPATH

$cmd $arg

============================================================
Got an error while trying to execute  command  above.  Error
messages (if any) must have shown before. The exit code was:
exit($rc)
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
EOF
    exit $rc
  }
done
exit 0


antlr-2.7.7/scripts/pyinst.sh.in0000755000175000017500000000226410522211616016566 0ustar  twernertwerner#!/usr/bin/env python
import os,sys

from distutils.core import setup

## This is where module 'antlr' resides in the installed package
dstdir = '@prefix@/share/@PACKAGE_NAME@-@PACKAGE_VERSION@'

## This is where module 'antlr' resides in the source distribution'
srcdir = '@abs_top_srcdir@/lib/python/antlr'
moddir = None

for d in [ dstdir, srcdir ] :
   moddir = d
   for f in [ '__init__.py','antlr.py' ] :
      if moddir :
         x = "%s/%s" % (moddir,f)
         if not os.path.exists(x) :
            sys.stderr.write('notice: "%s" does not exist - going to skip dir "%s")\n' % (x,moddir))
            sys.stderr.flush()
            moddir = None
   if moddir:
      break

if not moddir:
   sys.stderr.write('error: unable to find module "antlr".\n')
   sys.stderr.flush()
   sys.exit(1)
else:
   sys.stderr.write('notice: module "antlr" found in "%s"\n' % (moddir))

setup(name="antlr",
      version="@PACKAGE_VERSION@",
      description="Python runtime support for ANTLR-generated parsers",
      author="Wolfgang Haefelinger / Marq Kole",
      author_email="ora.et.labora@web.de",
      url="http://www.antlr.org/",
      packages=['antlr'],
      package_dir={'antlr' : moddir }
     )
antlr-2.7.7/scripts/python.sh.in0000755000175000017500000000305010522211616016553 0ustar  twernertwerner#!/bin/bash
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This file is part of ANTLR. See LICENSE.txt for licence  ##
## details. Written by W. Haefelinger.                      ##
##                                                          ##
##       Copyright (C) Wolfgang Haefelinger, 2004           ##
##                                                          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
test -z "${verbose}" && { 
  verbose=@VERBOSE@
}

cmd=@PYTHON@
PYTHONPATH=@abs_top_srcdir@/lib/python
export PYTHONPATH
ARGV="$*"

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##    This shall be the command to be excuted below       ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##

cmd="@PYTHON@ @PYTHONFLAGS@ ${ARGV}"

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##        standard template to execute a command          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
case "${verbose}" in
  0|no|nein|non)
    ;;
  *)
    echo PYTHONPATH=${PYTHONPATH}
    echo $cmd
    ;;
esac

$cmd || {
  rc=$?
  cat <> E R R O R <<
============================================================

$cmd

============================================================
Got an error while trying to execute  command  above.  Error
messages (if any) must have shown before. The exit code was:
exit($rc)
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
EOF
  exit $rc
}
exit 0
antlr-2.7.7/scripts/csc.sh.in0000755000175000017500000001427110522211616016011 0ustar  twernertwerner#!/bin/sh
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This file is part of ANTLR. See LICENSE.txt for licence  ##
## details. Written by W. Haefelinger.                      ##
##                                                          ##
##       Copyright (C) Wolfgang Haefelinger, 2004           ##
##                                                          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
test -z "${verbose}" && { 
  verbose=@VERBOSE@
}
## This script will be called to compile a list of C#  files
## on all UNIX/Cygwin platforms.

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
## pre-set some variables required or useful  to  compile C# 
## source files:

## srcdir shall contain absolute path to package directory.
srcdir="@abs_top_srcdir@"

## objdir shall contain absolute path to this build directory.
objdir="@abs_this_builddir@"

## variable javac contains the canonical java compiler name.
## At point of writing known names are csc.
csc="@csc@"

antlr_net="@ANTLR_NET@"

## When on cygwin we translage paths into DOS notation as 
## csc appears not to understand mixed notation.

case @build_os@ in
  cygwin)
    test -n "$1" && {
      ARGV="`cygpath -w $*`"
    }
    test -n "${srcdir}" && {
      srcdir="`cygpath -w ${srcdir}`"
    }
    test -n "${objdir}" && {
      objdir="`cygpath -w ${objdir}`"
    }
    test -n "${antlr_net}" && {
      antlr_net="`cygpath -w ${antlr_net}`"
    }
    ;;
  mingw*)
    cygpathw () {
      test -n "$1" && {
        d=`dirname "$1"`
        b=`basename "$1"`
        d=`cd $d && pwd -W`
        d=`echo "$d" | sed -e 's:/:\\\:g'`
        echo "$d\\$b"
      }
    }
    ARGV=""
    for x in $* ; do
      x=`cygpathw "$x"`
      ARGV="$ARGV $x"
    done
    test -n "${srcdir}" && {
      srcdir="`cygpathw ${srcdir}`"
    }
    test -n "${objdir}" && {
      objdir="`cygpathw ${objdir}`"
    }
    test -n "${antlr_net}" && {
      antlr_net="`cygpathw ${antlr_net}`"
    }
    ;;
  *)
    ARGV="$*"
    ;;
esac

## The very first argument shall alway tell us what we are
## going to build. We support here either a DLL, or an EXE.
set x ${ARGV}
case "$2" in
  *.dll|*.DLL)
    TARGET="$2"; shift; shift
    ;;
  *.exe|*.EXE)
    TARGET="$2"; shift; shift
    ;;
  *.cs|*.CS)
    TARGET="main.exe" ; shift
    ;;
  *)
    cat < append content of CSHARPCFLAGS to precomputed flags
## '-'  -> prepend content    -*-
## '='  -> do not use precomputed flags
## If none of these characters are given, the behaviour will
## be the same as if "=" would have been given.

set x ${CSHARPCFLAGS}  ; shift
case $1 in
  +)
    shift
    CSHARPCFLAGS="${csharpcflags} $*"
    ;;
  -)
    shift
    CSHARPCFLAGS="$* ${csharpcflags}"
    ;;
  =)
    shift
    CSHARPCFLAGS="$*"
    ;;
  *)
    if test -z "$1" ; then
      CSHARPCFLAGS="${csharpcflags}"
    else
      CSHARPCFLAGS="$*"
    fi
    ;;
esac

## Any special treatment goes here ..
case "${csharpc}" in
  csc)
    ;;
  *)
    ;;
esac

 ## go ahead ..
cmd="${CSHARPC} ${CSHARPCFLAGS}"
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
##        standard template to execute a command          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
case "${verbose}" in
  0|no|nein|non)
    set x `echo $ARGV | wc`
    case $3 in
      1) files="file" ;; 
      *) files="files";;
    esac
    echo "*** compiling $3 C# ${files}"
    ;;
  *)
    echo $cmd
    ;;
esac

$cmd ${ARGV} || {
  rc=$?
  cat <> E R R O R <<
============================================================

$cmd [$3 file(s) skipped]

============================================================
Got an error while trying to execute  command  above.  Error
messages (if any) must have shown before. The exit code was:
exit($rc)
xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
EOF
  exit $rc
}
exit 0
antlr-2.7.7/scripts/run-antlr.in0000755000175000017500000000252710522211616016553 0ustar  twernertwerner#!/bin/sh

## helper utilities ..
INSTALL="@INSTALL@"
MKDIR="@MKDIR@"
RM="@RM@"
TAR="@TAR@"
TOUCH="@TOUCH@"
CHMOD="@CHMOD@"
SED="@SED@"
GREP="@GREP@"
CAT="@CAT@"
CHMOD="@CHMOD@"

# usual dribble
prefix="@prefix@"
exec_prefix="@exec_prefix@"
program_transform_name="@program_transform_name@"
bindir="@bindir@"
sbindir="@sbindir@"
libexecdir="@libexecdir@"
datadir="@datadir@"
sysconfdir="@sysconfdir@"
sharedstatedir="@sharedstatedir@"
localstatedir="@localstatedir@"
libdir="@libdir@"
includedir="@includedir@"
oldincludedir="@oldincludedir@"
infodir="@infodir@"
mandir="@mandir@"
build_alias="@build_alias@"
host_alias="@host_alias@"
target_alias="@target_alias@"
build="@build@"
build_cpu="@build_cpu@"
build_vendor="@build_vendor@"
build_os="@build_os@"
host="@host@"
host_cpu="@host_cpu@"
host_vendor="@host_vendor@"
host_os="@host_os@"
just_make="@just_make@"

# Version stuff...
VERSION="@VERSION@"
SUBVERSION="@SUBVERSION@"
PATCHLEVEL="@PATCHLEVEL@"
PACKAGE_NAME="@PACKAGE_NAME@"
PACKAGE_VERSION="@PACKAGE_VERSION@"
versioneddir="@PACKAGE_NAME@-@PACKAGE_VERSION@"

ANTLR_JAR="@libdir@/antlr.jar"

case @build_os@ in
  cygwin|mingw|msys)
    ANTLR_JAR="`cygpath -m $ANTLR_JAR`"
    ;;
  *)
    ;;
esac

if test "x$CLASSPATH" = x; then
	CLASSPATH="${ANTLR_JAR}"
else
	CLASSPATH="${ANTLR_JAR}@PATH_SEPARATOR@${CLASSPATH}"
fi
export CLASSPATH
@JAVA@ antlr.Tool $*
antlr-2.7.7/scripts/antlr.spec.in0000644000175000017500000001070110522211616016670 0ustar  twernertwernerSummary: The ANTLR Parser Framework
Name:    antlr
Version: @PACKAGE_VERSION@
Release: 1
License: Public Domain
Group:   Development/Tools
Source:  http://www.antlr.org/download/antlr-%{version}.tar.gz
URL:     http://www.antlr.org

%description
ANTLR, ANother Tool for Language Recognition, (formerly PCCTS) is a
language tool that provides a framework for constructing recognizers,
compilers, and translators using Java, C#, C++ or Python. ANTLR
provides  excellent support for tree construction, tree walking, and 
translation.

%prep
%setup -q

%build
%configure --disable-examples
make

%install
rm -rf $RPM_BUILD_ROOT

make install

%files
%defattr(-,root,root)

/usr/bin/antlr
/usr/bin/antlr-config
/usr/sbin/pyantlr.sh
/usr/include/antlr/ANTLRException.hpp
/usr/include/antlr/ANTLRUtil.hpp
/usr/include/antlr/ASTArray.hpp
/usr/include/antlr/ASTFactory.hpp
/usr/include/antlr/AST.hpp
/usr/include/antlr/ASTNULLType.hpp
/usr/include/antlr/ASTPair.hpp
/usr/include/antlr/ASTRefCount.hpp
/usr/include/antlr/BaseAST.hpp
/usr/include/antlr/BitSet.hpp
/usr/include/antlr/CharBuffer.hpp
/usr/include/antlr/CharInputBuffer.hpp
/usr/include/antlr/CharScanner.hpp
/usr/include/antlr/CharStreamException.hpp
/usr/include/antlr/CharStreamIOException.hpp
/usr/include/antlr/CircularQueue.hpp
/usr/include/antlr/CommonAST.hpp
/usr/include/antlr/CommonASTWithHiddenTokens.hpp
/usr/include/antlr/CommonHiddenStreamToken.hpp
/usr/include/antlr/CommonToken.hpp
/usr/include/antlr/config.hpp
/usr/include/antlr/InputBuffer.hpp
/usr/include/antlr/IOException.hpp
/usr/include/antlr/LexerSharedInputState.hpp
/usr/include/antlr/LLkParser.hpp
/usr/include/antlr/MismatchedCharException.hpp
/usr/include/antlr/MismatchedTokenException.hpp
/usr/include/antlr/NoViableAltException.hpp
/usr/include/antlr/NoViableAltForCharException.hpp
/usr/include/antlr/Parser.hpp
/usr/include/antlr/ParserSharedInputState.hpp
/usr/include/antlr/RecognitionException.hpp
/usr/include/antlr/RefCount.hpp
/usr/include/antlr/SemanticException.hpp
/usr/include/antlr/String.hpp
/usr/include/antlr/TokenBuffer.hpp
/usr/include/antlr/Token.hpp
/usr/include/antlr/TokenStreamBasicFilter.hpp
/usr/include/antlr/TokenStreamException.hpp
/usr/include/antlr/TokenStreamHiddenTokenFilter.hpp
/usr/include/antlr/TokenStream.hpp
/usr/include/antlr/TokenStreamIOException.hpp
/usr/include/antlr/TokenStreamRecognitionException.hpp
/usr/include/antlr/TokenStreamRetryException.hpp
/usr/include/antlr/TokenStreamRewriteEngine.hpp
/usr/include/antlr/TokenStreamSelector.hpp
/usr/include/antlr/TokenWithIndex.hpp
/usr/include/antlr/TreeParser.hpp
/usr/include/antlr/TreeParserSharedInputState.hpp
/usr/lib/antlr.jar
/usr/lib/libantlr.a
/usr/lib/antlr.py
/usr/share/@PACKAGE_VERSION@/antlr.jar
/usr/share/@PACKAGE_VERSION@/__init__.py
/usr/share/@PACKAGE_VERSION@/antlr.py
/usr/share/@PACKAGE_VERSION@/antlr-mode.el
/usr/share/@PACKAGE_VERSION@/antlr-jedit.xml
/usr/share/doc/@PACKAGE_VERSION@/closure.gif
/usr/share/doc/@PACKAGE_VERSION@/cpp-runtime.html
/usr/share/doc/@PACKAGE_VERSION@/csharp-runtime.html
/usr/share/doc/@PACKAGE_VERSION@/err.html
/usr/share/doc/@PACKAGE_VERSION@/glossary.html
/usr/share/doc/@PACKAGE_VERSION@/hidden.stream.gif
/usr/share/doc/@PACKAGE_VERSION@/index.html
/usr/share/doc/@PACKAGE_VERSION@/inheritance.html
/usr/share/doc/@PACKAGE_VERSION@/j-guru-blue.jpg
/usr/share/doc/@PACKAGE_VERSION@/jguru-logo.gif
/usr/share/doc/@PACKAGE_VERSION@/lexer.html
/usr/share/doc/@PACKAGE_VERSION@/lexer.to.parser.tokens.gif
/usr/share/doc/@PACKAGE_VERSION@/logo.gif
/usr/share/doc/@PACKAGE_VERSION@/metalang.html
/usr/share/doc/@PACKAGE_VERSION@/optional.gif
/usr/share/doc/@PACKAGE_VERSION@/options.html
/usr/share/doc/@PACKAGE_VERSION@/posclosure.gif
/usr/share/doc/@PACKAGE_VERSION@/python-runtime.html
/usr/share/doc/@PACKAGE_VERSION@/runtime.html
/usr/share/doc/@PACKAGE_VERSION@/sor.html
/usr/share/doc/@PACKAGE_VERSION@/stream.perspectives.gif
/usr/share/doc/@PACKAGE_VERSION@/stream.selector.gif
/usr/share/doc/@PACKAGE_VERSION@/streams.html
/usr/share/doc/@PACKAGE_VERSION@/stream.splitter.gif
/usr/share/doc/@PACKAGE_VERSION@/subrule.gif
/usr/share/doc/@PACKAGE_VERSION@/trees.html
/usr/share/doc/@PACKAGE_VERSION@/vocab.html
/usr/share/doc/@PACKAGE_VERSION@/LICENSE.txt
/usr/share/doc/@PACKAGE_VERSION@/README.txt
/usr/share/doc/@PACKAGE_VERSION@/INSTALL.txt


%clean


%changelog
* Tue Jan 11 2005 Wolfgang Haefelinger  
  Build RPM on Mandrake 1o 
* Thu Aug 21 2003 Ric Klaren 
- First stab at RPM for RH9
antlr-2.7.7/scripts/antlr-config.in0000755000175000017500000000233710522211616017213 0ustar  twernertwerner#!/bin/sh
# @configure_input@

prefix=@prefix@
exec_prefix=@exec_prefix@
datadir=@datadir@
libdir=@libdir@
includedir=@includedir@

usage()
{
	cat <&2
fi

includes=""
libs=""

while test $# -gt 0; do
	case "$1" in
		-*=*) optarg=`echo "$1" | sed 's/[-_a-zA-Z0-9]*=//'` ;;
		*) optarg= ;;
	esac

	case $1 in
	--prefix)
		echo_prefix=yes
      ;;
	--exec-prefix)
		echo_exec_prefix=yes
      ;;
	--version)
		echo @PACKAGE_VERSION@
      exit 0
      ;;
	--cflags|-cxxflags)
      includes="-I${includedir}"
      echo_cflags="yes"
      ;;
	--libs)
      case @cxx@ in
        cl|bcc32)
          libs="${libdir}/antlr.lib"
          ;;
          *)
          libs="${libdir}/libantlr.a"
          ;;
      esac
      echo_libs=yes
      ;;
	*)
      usage 1 1>&2
      ;;
		esac
	shift
done

if test "$echo_prefix" = "yes"; then
	echo $prefix
fi
if test "$echo_exec_prefix" = "yes"; then
	echo $exec_prefix
fi
if test "$echo_cflags" = "yes"; then
	echo $includes
fi
if test "$echo_libs" = "yes"; then
	echo "${libs}"
fi

exit 0
antlr-2.7.7/scripts/config.sub0000755000175000017500000007706010522211616016265 0ustar  twernertwerner#! /bin/sh
# Configuration validation subroutine script.
#   Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
#   2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.

timestamp='2006-01-02'

# This file is (in principle) common to ALL GNU software.
# The presence of a machine in this file suggests that SOME GNU software
# can handle that machine.  It does not imply ALL GNU software can.
#
# This file is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
# 02110-1301, USA.
#
# As a special exception to the GNU General Public License, if you
# distribute this file as part of a program that contains a
# configuration script generated by Autoconf, you may include it under
# the same distribution terms that you use for the rest of that program.


# Please send patches to .  Submit a context
# diff and a properly formatted ChangeLog entry.
#
# Configuration subroutine to validate and canonicalize a configuration type.
# Supply the specified configuration type as an argument.
# If it is invalid, we print an error message on stderr and exit with code 1.
# Otherwise, we print the canonical config type on stdout and succeed.

# This file is supposed to be the same for all GNU packages
# and recognize all the CPU types, system types and aliases
# that are meaningful with *any* GNU software.
# Each package is responsible for reporting which valid configurations
# it does not support.  The user should be able to distinguish
# a failure to support a valid configuration from a meaningless
# configuration.

# The goal of this file is to map all the various variations of a given
# machine specification into a single specification in the form:
#	CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM
# or in some cases, the newer four-part form:
#	CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM
# It is wrong to echo any other type of specification.

me=`echo "$0" | sed -e 's,.*/,,'`

usage="\
Usage: $0 [OPTION] CPU-MFR-OPSYS
       $0 [OPTION] ALIAS

Canonicalize a configuration name.

Operation modes:
  -h, --help         print this help, then exit
  -t, --time-stamp   print date of last modification, then exit
  -v, --version      print version number, then exit

Report bugs and patches to ."

version="\
GNU config.sub ($timestamp)

Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
Free Software Foundation, Inc.

This is free software; see the source for copying conditions.  There is NO
warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."

help="
Try \`$me --help' for more information."

# Parse command line
while test $# -gt 0 ; do
  case $1 in
    --time-stamp | --time* | -t )
       echo "$timestamp" ; exit ;;
    --version | -v )
       echo "$version" ; exit ;;
    --help | --h* | -h )
       echo "$usage"; exit ;;
    -- )     # Stop option processing
       shift; break ;;
    - )	# Use stdin as input.
       break ;;
    -* )
       echo "$me: invalid option $1$help"
       exit 1 ;;

    *local*)
       # First pass through any local machine types.
       echo $1
       exit ;;

    * )
       break ;;
  esac
done

case $# in
 0) echo "$me: missing argument$help" >&2
    exit 1;;
 1) ;;
 *) echo "$me: too many arguments$help" >&2
    exit 1;;
esac

# Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any).
# Here we must recognize all the valid KERNEL-OS combinations.
maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'`
case $maybe_os in
  nto-qnx* | linux-gnu* | linux-dietlibc | linux-newlib* | linux-uclibc* | \
  uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | knetbsd*-gnu* | netbsd*-gnu* | \
  storm-chaos* | os2-emx* | rtmk-nova*)
    os=-$maybe_os
    basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'`
    ;;
  *)
    basic_machine=`echo $1 | sed 's/-[^-]*$//'`
    if [ $basic_machine != $1 ]
    then os=`echo $1 | sed 's/.*-/-/'`
    else os=; fi
    ;;
esac

### Let's recognize common machines as not being operating systems so
### that things like config.sub decstation-3100 work.  We also
### recognize some manufacturers as not being operating systems, so we
### can provide default operating systems below.
case $os in
	-sun*os*)
		# Prevent following clause from handling this invalid input.
		;;
	-dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \
	-att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \
	-unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \
	-convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\
	-c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \
	-harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \
	-apple | -axis | -knuth | -cray)
		os=
		basic_machine=$1
		;;
	-sim | -cisco | -oki | -wec | -winbond)
		os=
		basic_machine=$1
		;;
	-scout)
		;;
	-wrs)
		os=-vxworks
		basic_machine=$1
		;;
	-chorusos*)
		os=-chorusos
		basic_machine=$1
		;;
 	-chorusrdb)
 		os=-chorusrdb
		basic_machine=$1
 		;;
	-hiux*)
		os=-hiuxwe2
		;;
	-sco6)
		os=-sco5v6
		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
		;;
	-sco5)
		os=-sco3.2v5
		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
		;;
	-sco4)
		os=-sco3.2v4
		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
		;;
	-sco3.2.[4-9]*)
		os=`echo $os | sed -e 's/sco3.2./sco3.2v/'`
		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
		;;
	-sco3.2v[4-9]*)
		# Don't forget version if it is 3.2v4 or newer.
		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
		;;
	-sco5v6*)
		# Don't forget version if it is 3.2v4 or newer.
		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
		;;
	-sco*)
		os=-sco3.2v2
		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
		;;
	-udk*)
		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
		;;
	-isc)
		os=-isc2.2
		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
		;;
	-clix*)
		basic_machine=clipper-intergraph
		;;
	-isc*)
		basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'`
		;;
	-lynx*)
		os=-lynxos
		;;
	-ptx*)
		basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'`
		;;
	-windowsnt*)
		os=`echo $os | sed -e 's/windowsnt/winnt/'`
		;;
	-psos*)
		os=-psos
		;;
	-mint | -mint[0-9]*)
		basic_machine=m68k-atari
		os=-mint
		;;
esac

# Decode aliases for certain CPU-COMPANY combinations.
case $basic_machine in
	# Recognize the basic CPU types without company name.
	# Some are omitted here because they have special meanings below.
	1750a | 580 \
	| a29k \
	| alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \
	| alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \
	| am33_2.0 \
	| arc | arm | arm[bl]e | arme[lb] | armv[2345] | armv[345][lb] | avr \
	| bfin \
	| c4x | clipper \
	| d10v | d30v | dlx | dsp16xx \
	| fr30 | frv \
	| h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \
	| i370 | i860 | i960 | ia64 \
	| ip2k | iq2000 \
	| m32r | m32rle | m68000 | m68k | m88k | maxq | mb | microblaze | mcore \
	| mips | mipsbe | mipseb | mipsel | mipsle \
	| mips16 \
	| mips64 | mips64el \
	| mips64vr | mips64vrel \
	| mips64orion | mips64orionel \
	| mips64vr4100 | mips64vr4100el \
	| mips64vr4300 | mips64vr4300el \
	| mips64vr5000 | mips64vr5000el \
	| mips64vr5900 | mips64vr5900el \
	| mipsisa32 | mipsisa32el \
	| mipsisa32r2 | mipsisa32r2el \
	| mipsisa64 | mipsisa64el \
	| mipsisa64r2 | mipsisa64r2el \
	| mipsisa64sb1 | mipsisa64sb1el \
	| mipsisa64sr71k | mipsisa64sr71kel \
	| mipstx39 | mipstx39el \
	| mn10200 | mn10300 \
	| mt \
	| msp430 \
	| ns16k | ns32k \
	| or32 \
	| pdp10 | pdp11 | pj | pjl \
	| powerpc | powerpc64 | powerpc64le | powerpcle | ppcbe \
	| pyramid \
	| sh | sh[1234] | sh[24]a | sh[23]e | sh[34]eb | shbe | shle | sh[1234]le | sh3ele \
	| sh64 | sh64le \
	| sparc | sparc64 | sparc64b | sparc86x | sparclet | sparclite \
	| sparcv8 | sparcv9 | sparcv9b \
	| strongarm \
	| tahoe | thumb | tic4x | tic80 | tron \
	| v850 | v850e \
	| we32k \
	| x86 | xscale | xscalee[bl] | xstormy16 | xtensa \
	| z8k)
		basic_machine=$basic_machine-unknown
		;;
	m32c)
		basic_machine=$basic_machine-unknown
		;;
	m6811 | m68hc11 | m6812 | m68hc12)
		# Motorola 68HC11/12.
		basic_machine=$basic_machine-unknown
		os=-none
		;;
	m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k)
		;;
	ms1)
		basic_machine=mt-unknown
		;;

	# We use `pc' rather than `unknown'
	# because (1) that's what they normally are, and
	# (2) the word "unknown" tends to confuse beginning users.
	i*86 | x86_64)
	  basic_machine=$basic_machine-pc
	  ;;
	# Object if more than one company name word.
	*-*-*)
		echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2
		exit 1
		;;
	# Recognize the basic CPU types with company name.
	580-* \
	| a29k-* \
	| alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \
	| alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \
	| alphapca5[67]-* | alpha64pca5[67]-* | arc-* \
	| arm-*  | armbe-* | armle-* | armeb-* | armv*-* \
	| avr-* \
	| bfin-* | bs2000-* \
	| c[123]* | c30-* | [cjt]90-* | c4x-* | c54x-* | c55x-* | c6x-* \
	| clipper-* | craynv-* | cydra-* \
	| d10v-* | d30v-* | dlx-* \
	| elxsi-* \
	| f30[01]-* | f700-* | fr30-* | frv-* | fx80-* \
	| h8300-* | h8500-* \
	| hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \
	| i*86-* | i860-* | i960-* | ia64-* \
	| ip2k-* | iq2000-* \
	| m32r-* | m32rle-* \
	| m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \
	| m88110-* | m88k-* | maxq-* | mcore-* \
	| mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \
	| mips16-* \
	| mips64-* | mips64el-* \
	| mips64vr-* | mips64vrel-* \
	| mips64orion-* | mips64orionel-* \
	| mips64vr4100-* | mips64vr4100el-* \
	| mips64vr4300-* | mips64vr4300el-* \
	| mips64vr5000-* | mips64vr5000el-* \
	| mips64vr5900-* | mips64vr5900el-* \
	| mipsisa32-* | mipsisa32el-* \
	| mipsisa32r2-* | mipsisa32r2el-* \
	| mipsisa64-* | mipsisa64el-* \
	| mipsisa64r2-* | mipsisa64r2el-* \
	| mipsisa64sb1-* | mipsisa64sb1el-* \
	| mipsisa64sr71k-* | mipsisa64sr71kel-* \
	| mipstx39-* | mipstx39el-* \
	| mmix-* \
	| mt-* \
	| msp430-* \
	| none-* | np1-* | ns16k-* | ns32k-* \
	| orion-* \
	| pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \
	| powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* | ppcbe-* \
	| pyramid-* \
	| romp-* | rs6000-* \
	| sh-* | sh[1234]-* | sh[24]a-* | sh[23]e-* | sh[34]eb-* | shbe-* \
	| shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \
	| sparc-* | sparc64-* | sparc64b-* | sparc86x-* | sparclet-* \
	| sparclite-* \
	| sparcv8-* | sparcv9-* | sparcv9b-* | strongarm-* | sv1-* | sx?-* \
	| tahoe-* | thumb-* \
	| tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \
	| tron-* \
	| v850-* | v850e-* | vax-* \
	| we32k-* \
	| x86-* | x86_64-* | xps100-* | xscale-* | xscalee[bl]-* \
	| xstormy16-* | xtensa-* \
	| ymp-* \
	| z8k-*)
		;;
	m32c-*)
		;;
	# Recognize the various machine names and aliases which stand
	# for a CPU type and a company and sometimes even an OS.
	386bsd)
		basic_machine=i386-unknown
		os=-bsd
		;;
	3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc)
		basic_machine=m68000-att
		;;
	3b*)
		basic_machine=we32k-att
		;;
	a29khif)
		basic_machine=a29k-amd
		os=-udi
		;;
    	abacus)
		basic_machine=abacus-unknown
		;;
	adobe68k)
		basic_machine=m68010-adobe
		os=-scout
		;;
	alliant | fx80)
		basic_machine=fx80-alliant
		;;
	altos | altos3068)
		basic_machine=m68k-altos
		;;
	am29k)
		basic_machine=a29k-none
		os=-bsd
		;;
	amd64)
		basic_machine=x86_64-pc
		;;
	amd64-*)
		basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'`
		;;
	amdahl)
		basic_machine=580-amdahl
		os=-sysv
		;;
	amiga | amiga-*)
		basic_machine=m68k-unknown
		;;
	amigaos | amigados)
		basic_machine=m68k-unknown
		os=-amigaos
		;;
	amigaunix | amix)
		basic_machine=m68k-unknown
		os=-sysv4
		;;
	apollo68)
		basic_machine=m68k-apollo
		os=-sysv
		;;
	apollo68bsd)
		basic_machine=m68k-apollo
		os=-bsd
		;;
	aux)
		basic_machine=m68k-apple
		os=-aux
		;;
	balance)
		basic_machine=ns32k-sequent
		os=-dynix
		;;
	c90)
		basic_machine=c90-cray
		os=-unicos
		;;
	convex-c1)
		basic_machine=c1-convex
		os=-bsd
		;;
	convex-c2)
		basic_machine=c2-convex
		os=-bsd
		;;
	convex-c32)
		basic_machine=c32-convex
		os=-bsd
		;;
	convex-c34)
		basic_machine=c34-convex
		os=-bsd
		;;
	convex-c38)
		basic_machine=c38-convex
		os=-bsd
		;;
	cray | j90)
		basic_machine=j90-cray
		os=-unicos
		;;
	craynv)
		basic_machine=craynv-cray
		os=-unicosmp
		;;
	cr16c)
		basic_machine=cr16c-unknown
		os=-elf
		;;
	crds | unos)
		basic_machine=m68k-crds
		;;
	crisv32 | crisv32-* | etraxfs*)
		basic_machine=crisv32-axis
		;;
	cris | cris-* | etrax*)
		basic_machine=cris-axis
		;;
	crx)
		basic_machine=crx-unknown
		os=-elf
		;;
	da30 | da30-*)
		basic_machine=m68k-da30
		;;
	decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn)
		basic_machine=mips-dec
		;;
	decsystem10* | dec10*)
		basic_machine=pdp10-dec
		os=-tops10
		;;
	decsystem20* | dec20*)
		basic_machine=pdp10-dec
		os=-tops20
		;;
	delta | 3300 | motorola-3300 | motorola-delta \
	      | 3300-motorola | delta-motorola)
		basic_machine=m68k-motorola
		;;
	delta88)
		basic_machine=m88k-motorola
		os=-sysv3
		;;
	djgpp)
		basic_machine=i586-pc
		os=-msdosdjgpp
		;;
	dpx20 | dpx20-*)
		basic_machine=rs6000-bull
		os=-bosx
		;;
	dpx2* | dpx2*-bull)
		basic_machine=m68k-bull
		os=-sysv3
		;;
	ebmon29k)
		basic_machine=a29k-amd
		os=-ebmon
		;;
	elxsi)
		basic_machine=elxsi-elxsi
		os=-bsd
		;;
	encore | umax | mmax)
		basic_machine=ns32k-encore
		;;
	es1800 | OSE68k | ose68k | ose | OSE)
		basic_machine=m68k-ericsson
		os=-ose
		;;
	fx2800)
		basic_machine=i860-alliant
		;;
	genix)
		basic_machine=ns32k-ns
		;;
	gmicro)
		basic_machine=tron-gmicro
		os=-sysv
		;;
	go32)
		basic_machine=i386-pc
		os=-go32
		;;
	h3050r* | hiux*)
		basic_machine=hppa1.1-hitachi
		os=-hiuxwe2
		;;
	h8300hms)
		basic_machine=h8300-hitachi
		os=-hms
		;;
	h8300xray)
		basic_machine=h8300-hitachi
		os=-xray
		;;
	h8500hms)
		basic_machine=h8500-hitachi
		os=-hms
		;;
	harris)
		basic_machine=m88k-harris
		os=-sysv3
		;;
	hp300-*)
		basic_machine=m68k-hp
		;;
	hp300bsd)
		basic_machine=m68k-hp
		os=-bsd
		;;
	hp300hpux)
		basic_machine=m68k-hp
		os=-hpux
		;;
	hp3k9[0-9][0-9] | hp9[0-9][0-9])
		basic_machine=hppa1.0-hp
		;;
	hp9k2[0-9][0-9] | hp9k31[0-9])
		basic_machine=m68000-hp
		;;
	hp9k3[2-9][0-9])
		basic_machine=m68k-hp
		;;
	hp9k6[0-9][0-9] | hp6[0-9][0-9])
		basic_machine=hppa1.0-hp
		;;
	hp9k7[0-79][0-9] | hp7[0-79][0-9])
		basic_machine=hppa1.1-hp
		;;
	hp9k78[0-9] | hp78[0-9])
		# FIXME: really hppa2.0-hp
		basic_machine=hppa1.1-hp
		;;
	hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893)
		# FIXME: really hppa2.0-hp
		basic_machine=hppa1.1-hp
		;;
	hp9k8[0-9][13679] | hp8[0-9][13679])
		basic_machine=hppa1.1-hp
		;;
	hp9k8[0-9][0-9] | hp8[0-9][0-9])
		basic_machine=hppa1.0-hp
		;;
	hppa-next)
		os=-nextstep3
		;;
	hppaosf)
		basic_machine=hppa1.1-hp
		os=-osf
		;;
	hppro)
		basic_machine=hppa1.1-hp
		os=-proelf
		;;
	i370-ibm* | ibm*)
		basic_machine=i370-ibm
		;;
# I'm not sure what "Sysv32" means.  Should this be sysv3.2?
	i*86v32)
		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
		os=-sysv32
		;;
	i*86v4*)
		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
		os=-sysv4
		;;
	i*86v)
		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
		os=-sysv
		;;
	i*86sol2)
		basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'`
		os=-solaris2
		;;
	i386mach)
		basic_machine=i386-mach
		os=-mach
		;;
	i386-vsta | vsta)
		basic_machine=i386-unknown
		os=-vsta
		;;
	iris | iris4d)
		basic_machine=mips-sgi
		case $os in
		    -irix*)
			;;
		    *)
			os=-irix4
			;;
		esac
		;;
	isi68 | isi)
		basic_machine=m68k-isi
		os=-sysv
		;;
	m88k-omron*)
		basic_machine=m88k-omron
		;;
	magnum | m3230)
		basic_machine=mips-mips
		os=-sysv
		;;
	merlin)
		basic_machine=ns32k-utek
		os=-sysv
		;;
	mingw32)
		basic_machine=i386-pc
		os=-mingw32
		;;
	miniframe)
		basic_machine=m68000-convergent
		;;
	*mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*)
		basic_machine=m68k-atari
		os=-mint
		;;
	mips3*-*)
		basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`
		;;
	mips3*)
		basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown
		;;
	monitor)
		basic_machine=m68k-rom68k
		os=-coff
		;;
	morphos)
		basic_machine=powerpc-unknown
		os=-morphos
		;;
	msdos)
		basic_machine=i386-pc
		os=-msdos
		;;
	ms1-*)
		basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'`
		;;
	mvs)
		basic_machine=i370-ibm
		os=-mvs
		;;
	ncr3000)
		basic_machine=i486-ncr
		os=-sysv4
		;;
	netbsd386)
		basic_machine=i386-unknown
		os=-netbsd
		;;
	netwinder)
		basic_machine=armv4l-rebel
		os=-linux
		;;
	news | news700 | news800 | news900)
		basic_machine=m68k-sony
		os=-newsos
		;;
	news1000)
		basic_machine=m68030-sony
		os=-newsos
		;;
	news-3600 | risc-news)
		basic_machine=mips-sony
		os=-newsos
		;;
	necv70)
		basic_machine=v70-nec
		os=-sysv
		;;
	next | m*-next )
		basic_machine=m68k-next
		case $os in
		    -nextstep* )
			;;
		    -ns2*)
		      os=-nextstep2
			;;
		    *)
		      os=-nextstep3
			;;
		esac
		;;
	nh3000)
		basic_machine=m68k-harris
		os=-cxux
		;;
	nh[45]000)
		basic_machine=m88k-harris
		os=-cxux
		;;
	nindy960)
		basic_machine=i960-intel
		os=-nindy
		;;
	mon960)
		basic_machine=i960-intel
		os=-mon960
		;;
	nonstopux)
		basic_machine=mips-compaq
		os=-nonstopux
		;;
	np1)
		basic_machine=np1-gould
		;;
	nsr-tandem)
		basic_machine=nsr-tandem
		;;
	op50n-* | op60c-*)
		basic_machine=hppa1.1-oki
		os=-proelf
		;;
	openrisc | openrisc-*)
		basic_machine=or32-unknown
		;;
	os400)
		basic_machine=powerpc-ibm
		os=-os400
		;;
	OSE68000 | ose68000)
		basic_machine=m68000-ericsson
		os=-ose
		;;
	os68k)
		basic_machine=m68k-none
		os=-os68k
		;;
	pa-hitachi)
		basic_machine=hppa1.1-hitachi
		os=-hiuxwe2
		;;
	paragon)
		basic_machine=i860-intel
		os=-osf
		;;
	pbd)
		basic_machine=sparc-tti
		;;
	pbb)
		basic_machine=m68k-tti
		;;
	pc532 | pc532-*)
		basic_machine=ns32k-pc532
		;;
	pc98)
		basic_machine=i386-pc
		;;
	pc98-*)
		basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'`
		;;
	pentium | p5 | k5 | k6 | nexgen | viac3)
		basic_machine=i586-pc
		;;
	pentiumpro | p6 | 6x86 | athlon | athlon_*)
		basic_machine=i686-pc
		;;
	pentiumii | pentium2 | pentiumiii | pentium3)
		basic_machine=i686-pc
		;;
	pentium4)
		basic_machine=i786-pc
		;;
	pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*)
		basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'`
		;;
	pentiumpro-* | p6-* | 6x86-* | athlon-*)
		basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'`
		;;
	pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*)
		basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'`
		;;
	pentium4-*)
		basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'`
		;;
	pn)
		basic_machine=pn-gould
		;;
	power)	basic_machine=power-ibm
		;;
	ppc)	basic_machine=powerpc-unknown
		;;
	ppc-*)	basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'`
		;;
	ppcle | powerpclittle | ppc-le | powerpc-little)
		basic_machine=powerpcle-unknown
		;;
	ppcle-* | powerpclittle-*)
		basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'`
		;;
	ppc64)	basic_machine=powerpc64-unknown
		;;
	ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'`
		;;
	ppc64le | powerpc64little | ppc64-le | powerpc64-little)
		basic_machine=powerpc64le-unknown
		;;
	ppc64le-* | powerpc64little-*)
		basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'`
		;;
	ps2)
		basic_machine=i386-ibm
		;;
	pw32)
		basic_machine=i586-unknown
		os=-pw32
		;;
	rdos)
		basic_machine=i386-pc
		os=-rdos
		;;
	rom68k)
		basic_machine=m68k-rom68k
		os=-coff
		;;
	rm[46]00)
		basic_machine=mips-siemens
		;;
	rtpc | rtpc-*)
		basic_machine=romp-ibm
		;;
	s390 | s390-*)
		basic_machine=s390-ibm
		;;
	s390x | s390x-*)
		basic_machine=s390x-ibm
		;;
	sa29200)
		basic_machine=a29k-amd
		os=-udi
		;;
	sb1)
		basic_machine=mipsisa64sb1-unknown
		;;
	sb1el)
		basic_machine=mipsisa64sb1el-unknown
		;;
	sei)
		basic_machine=mips-sei
		os=-seiux
		;;
	sequent)
		basic_machine=i386-sequent
		;;
	sh)
		basic_machine=sh-hitachi
		os=-hms
		;;
	sh64)
		basic_machine=sh64-unknown
		;;
	sparclite-wrs | simso-wrs)
		basic_machine=sparclite-wrs
		os=-vxworks
		;;
	sps7)
		basic_machine=m68k-bull
		os=-sysv2
		;;
	spur)
		basic_machine=spur-unknown
		;;
	st2000)
		basic_machine=m68k-tandem
		;;
	stratus)
		basic_machine=i860-stratus
		os=-sysv4
		;;
	sun2)
		basic_machine=m68000-sun
		;;
	sun2os3)
		basic_machine=m68000-sun
		os=-sunos3
		;;
	sun2os4)
		basic_machine=m68000-sun
		os=-sunos4
		;;
	sun3os3)
		basic_machine=m68k-sun
		os=-sunos3
		;;
	sun3os4)
		basic_machine=m68k-sun
		os=-sunos4
		;;
	sun4os3)
		basic_machine=sparc-sun
		os=-sunos3
		;;
	sun4os4)
		basic_machine=sparc-sun
		os=-sunos4
		;;
	sun4sol2)
		basic_machine=sparc-sun
		os=-solaris2
		;;
	sun3 | sun3-*)
		basic_machine=m68k-sun
		;;
	sun4)
		basic_machine=sparc-sun
		;;
	sun386 | sun386i | roadrunner)
		basic_machine=i386-sun
		;;
	sv1)
		basic_machine=sv1-cray
		os=-unicos
		;;
	symmetry)
		basic_machine=i386-sequent
		os=-dynix
		;;
	t3e)
		basic_machine=alphaev5-cray
		os=-unicos
		;;
	t90)
		basic_machine=t90-cray
		os=-unicos
		;;
	tic54x | c54x*)
		basic_machine=tic54x-unknown
		os=-coff
		;;
	tic55x | c55x*)
		basic_machine=tic55x-unknown
		os=-coff
		;;
	tic6x | c6x*)
		basic_machine=tic6x-unknown
		os=-coff
		;;
	tx39)
		basic_machine=mipstx39-unknown
		;;
	tx39el)
		basic_machine=mipstx39el-unknown
		;;
	toad1)
		basic_machine=pdp10-xkl
		os=-tops20
		;;
	tower | tower-32)
		basic_machine=m68k-ncr
		;;
	tpf)
		basic_machine=s390x-ibm
		os=-tpf
		;;
	udi29k)
		basic_machine=a29k-amd
		os=-udi
		;;
	ultra3)
		basic_machine=a29k-nyu
		os=-sym1
		;;
	v810 | necv810)
		basic_machine=v810-nec
		os=-none
		;;
	vaxv)
		basic_machine=vax-dec
		os=-sysv
		;;
	vms)
		basic_machine=vax-dec
		os=-vms
		;;
	vpp*|vx|vx-*)
		basic_machine=f301-fujitsu
		;;
	vxworks960)
		basic_machine=i960-wrs
		os=-vxworks
		;;
	vxworks68)
		basic_machine=m68k-wrs
		os=-vxworks
		;;
	vxworks29k)
		basic_machine=a29k-wrs
		os=-vxworks
		;;
	w65*)
		basic_machine=w65-wdc
		os=-none
		;;
	w89k-*)
		basic_machine=hppa1.1-winbond
		os=-proelf
		;;
	xbox)
		basic_machine=i686-pc
		os=-mingw32
		;;
	xps | xps100)
		basic_machine=xps100-honeywell
		;;
	ymp)
		basic_machine=ymp-cray
		os=-unicos
		;;
	z8k-*-coff)
		basic_machine=z8k-unknown
		os=-sim
		;;
	none)
		basic_machine=none-none
		os=-none
		;;

# Here we handle the default manufacturer of certain CPU types.  It is in
# some cases the only manufacturer, in others, it is the most popular.
	w89k)
		basic_machine=hppa1.1-winbond
		;;
	op50n)
		basic_machine=hppa1.1-oki
		;;
	op60c)
		basic_machine=hppa1.1-oki
		;;
	romp)
		basic_machine=romp-ibm
		;;
	mmix)
		basic_machine=mmix-knuth
		;;
	rs6000)
		basic_machine=rs6000-ibm
		;;
	vax)
		basic_machine=vax-dec
		;;
	pdp10)
		# there are many clones, so DEC is not a safe bet
		basic_machine=pdp10-unknown
		;;
	pdp11)
		basic_machine=pdp11-dec
		;;
	we32k)
		basic_machine=we32k-att
		;;
	sh[1234] | sh[24]a | sh[34]eb | sh[1234]le | sh[23]ele)
		basic_machine=sh-unknown
		;;
	sparc | sparcv8 | sparcv9 | sparcv9b)
		basic_machine=sparc-sun
		;;
	cydra)
		basic_machine=cydra-cydrome
		;;
	orion)
		basic_machine=orion-highlevel
		;;
	orion105)
		basic_machine=clipper-highlevel
		;;
	mac | mpw | mac-mpw)
		basic_machine=m68k-apple
		;;
	pmac | pmac-mpw)
		basic_machine=powerpc-apple
		;;
	*-unknown)
		# Make sure to match an already-canonicalized machine name.
		;;
	*)
		echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2
		exit 1
		;;
esac

# Here we canonicalize certain aliases for manufacturers.
case $basic_machine in
	*-digital*)
		basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'`
		;;
	*-commodore*)
		basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'`
		;;
	*)
		;;
esac

# Decode manufacturer-specific aliases for certain operating systems.

if [ x"$os" != x"" ]
then
case $os in
        # First match some system type aliases
        # that might get confused with valid system types.
	# -solaris* is a basic system type, with this one exception.
	-solaris1 | -solaris1.*)
		os=`echo $os | sed -e 's|solaris1|sunos4|'`
		;;
	-solaris)
		os=-solaris2
		;;
	-svr4*)
		os=-sysv4
		;;
	-unixware*)
		os=-sysv4.2uw
		;;
	-gnu/linux*)
		os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'`
		;;
	# First accept the basic system types.
	# The portable systems comes first.
	# Each alternative MUST END IN A *, to match a version number.
	# -sysv* is not here because it comes later, after sysvr4.
	-gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \
	      | -*vms* | -sco* | -esix* | -isc* | -aix* | -sunos | -sunos[34]*\
	      | -hpux* | -unos* | -osf* | -luna* | -dgux* | -solaris* | -sym* \
	      | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \
	      | -aos* \
	      | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \
	      | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \
	      | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \
	      | -openbsd* | -solidbsd* \
	      | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \
	      | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \
	      | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \
	      | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \
	      | -chorusos* | -chorusrdb* \
	      | -cygwin* | -pe* | -psos* | -moss* | -proelf* | -rtems* \
	      | -mingw32* | -linux-gnu* | -linux-newlib* | -linux-uclibc* \
	      | -uxpv* | -beos* | -mpeix* | -udk* \
	      | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \
	      | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \
	      | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \
	      | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \
	      | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \
	      | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \
	      | -skyos* | -haiku* | -rdos*)
	# Remember, each alternative MUST END IN *, to match a version number.
		;;
	-qnx*)
		case $basic_machine in
		    x86-* | i*86-*)
			;;
		    *)
			os=-nto$os
			;;
		esac
		;;
	-nto-qnx*)
		;;
	-nto*)
		os=`echo $os | sed -e 's|nto|nto-qnx|'`
		;;
	-sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \
	      | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \
	      | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*)
		;;
	-mac*)
		os=`echo $os | sed -e 's|mac|macos|'`
		;;
	-linux-dietlibc)
		os=-linux-dietlibc
		;;
	-linux*)
		os=`echo $os | sed -e 's|linux|linux-gnu|'`
		;;
	-sunos5*)
		os=`echo $os | sed -e 's|sunos5|solaris2|'`
		;;
	-sunos6*)
		os=`echo $os | sed -e 's|sunos6|solaris3|'`
		;;
	-opened*)
		os=-openedition
		;;
        -os400*)
		os=-os400
		;;
	-wince*)
		os=-wince
		;;
	-osfrose*)
		os=-osfrose
		;;
	-osf*)
		os=-osf
		;;
	-utek*)
		os=-bsd
		;;
	-dynix*)
		os=-bsd
		;;
	-acis*)
		os=-aos
		;;
	-atheos*)
		os=-atheos
		;;
	-syllable*)
		os=-syllable
		;;
	-386bsd)
		os=-bsd
		;;
	-ctix* | -uts*)
		os=-sysv
		;;
	-nova*)
		os=-rtmk-nova
		;;
	-ns2 )
		os=-nextstep2
		;;
	-nsk*)
		os=-nsk
		;;
	# Preserve the version number of sinix5.
	-sinix5.*)
		os=`echo $os | sed -e 's|sinix|sysv|'`
		;;
	-sinix*)
		os=-sysv4
		;;
        -tpf*)
		os=-tpf
		;;
	-triton*)
		os=-sysv3
		;;
	-oss*)
		os=-sysv3
		;;
	-svr4)
		os=-sysv4
		;;
	-svr3)
		os=-sysv3
		;;
	-sysvr4)
		os=-sysv4
		;;
	# This must come after -sysvr4.
	-sysv*)
		;;
	-ose*)
		os=-ose
		;;
	-es1800*)
		os=-ose
		;;
	-xenix)
		os=-xenix
		;;
	-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)
		os=-mint
		;;
	-aros*)
		os=-aros
		;;
	-kaos*)
		os=-kaos
		;;
	-zvmoe)
		os=-zvmoe
		;;
	-none)
		;;
	*)
		# Get rid of the `-' at the beginning of $os.
		os=`echo $os | sed 's/[^-]*-//'`
		echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2
		exit 1
		;;
esac
else

# Here we handle the default operating systems that come with various machines.
# The value should be what the vendor currently ships out the door with their
# machine or put another way, the most popular os provided with the machine.

# Note that if you're going to try to match "-MANUFACTURER" here (say,
# "-sun"), then you have to tell the case statement up towards the top
# that MANUFACTURER isn't an operating system.  Otherwise, code above
# will signal an error saying that MANUFACTURER isn't an operating
# system, and we'll never get to this point.

case $basic_machine in
	*-acorn)
		os=-riscix1.2
		;;
	arm*-rebel)
		os=-linux
		;;
	arm*-semi)
		os=-aout
		;;
    c4x-* | tic4x-*)
        os=-coff
        ;;
	# This must come before the *-dec entry.
	pdp10-*)
		os=-tops20
		;;
	pdp11-*)
		os=-none
		;;
	*-dec | vax-*)
		os=-ultrix4.2
		;;
	m68*-apollo)
		os=-domain
		;;
	i386-sun)
		os=-sunos4.0.2
		;;
	m68000-sun)
		os=-sunos3
		# This also exists in the configure program, but was not the
		# default.
		# os=-sunos4
		;;
	m68*-cisco)
		os=-aout
		;;
	mips*-cisco)
		os=-elf
		;;
	mips*-*)
		os=-elf
		;;
	or32-*)
		os=-coff
		;;
	*-tti)	# must be before sparc entry or we get the wrong os.
		os=-sysv3
		;;
	sparc-* | *-sun)
		os=-sunos4.1.1
		;;
	*-be)
		os=-beos
		;;
	*-haiku)
		os=-haiku
		;;
	*-ibm)
		os=-aix
		;;
    	*-knuth)
		os=-mmixware
		;;
	*-wec)
		os=-proelf
		;;
	*-winbond)
		os=-proelf
		;;
	*-oki)
		os=-proelf
		;;
	*-hp)
		os=-hpux
		;;
	*-hitachi)
		os=-hiux
		;;
	i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent)
		os=-sysv
		;;
	*-cbm)
		os=-amigaos
		;;
	*-dg)
		os=-dgux
		;;
	*-dolphin)
		os=-sysv3
		;;
	m68k-ccur)
		os=-rtu
		;;
	m88k-omron*)
		os=-luna
		;;
	*-next )
		os=-nextstep
		;;
	*-sequent)
		os=-ptx
		;;
	*-crds)
		os=-unos
		;;
	*-ns)
		os=-genix
		;;
	i370-*)
		os=-mvs
		;;
	*-next)
		os=-nextstep3
		;;
	*-gould)
		os=-sysv
		;;
	*-highlevel)
		os=-bsd
		;;
	*-encore)
		os=-bsd
		;;
	*-sgi)
		os=-irix
		;;
	*-siemens)
		os=-sysv4
		;;
	*-masscomp)
		os=-rtu
		;;
	f30[01]-fujitsu | f700-fujitsu)
		os=-uxpv
		;;
	*-rom68k)
		os=-coff
		;;
	*-*bug)
		os=-coff
		;;
	*-apple)
		os=-macos
		;;
	*-atari*)
		os=-mint
		;;
	*)
		os=-none
		;;
esac
fi

# Here we handle the case where we know the os, and the CPU type, but not the
# manufacturer.  We pick the logical manufacturer.
vendor=unknown
case $basic_machine in
	*-unknown)
		case $os in
			-riscix*)
				vendor=acorn
				;;
			-sunos*)
				vendor=sun
				;;
			-aix*)
				vendor=ibm
				;;
			-beos*)
				vendor=be
				;;
			-hpux*)
				vendor=hp
				;;
			-mpeix*)
				vendor=hp
				;;
			-hiux*)
				vendor=hitachi
				;;
			-unos*)
				vendor=crds
				;;
			-dgux*)
				vendor=dg
				;;
			-luna*)
				vendor=omron
				;;
			-genix*)
				vendor=ns
				;;
			-mvs* | -opened*)
				vendor=ibm
				;;
			-os400*)
				vendor=ibm
				;;
			-ptx*)
				vendor=sequent
				;;
			-tpf*)
				vendor=ibm
				;;
			-vxsim* | -vxworks* | -windiss*)
				vendor=wrs
				;;
			-aux*)
				vendor=apple
				;;
			-hms*)
				vendor=hitachi
				;;
			-mpw* | -macos*)
				vendor=apple
				;;
			-*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*)
				vendor=atari
				;;
			-vos*)
				vendor=stratus
				;;
		esac
		basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"`
		;;
esac

echo $basic_machine$os
exit

# Local variables:
# eval: (add-hook 'write-file-hooks 'time-stamp)
# time-stamp-start: "timestamp='"
# time-stamp-format: "%:y-%02m-%02d"
# time-stamp-end: "'"
# End:
antlr-2.7.7/LICENSE.txt0000644000175000017500000000225310522211616014426 0ustar  twernertwerner
SOFTWARE RIGHTS

ANTLR 1989-2006 Developed by Terence Parr
Partially supported by University of San Francisco & jGuru.com

We reserve no legal rights to the ANTLR--it is fully in the
public domain. An individual or company may do whatever
they wish with source code distributed with ANTLR or the
code generated by ANTLR, including the incorporation of
ANTLR, or its output, into commerical software.

We encourage users to develop software with ANTLR. However,
we do ask that credit is given to us for developing
ANTLR. By "credit", we mean that if you use ANTLR or
incorporate any source code into one of your programs
(commercial product, research project, or otherwise) that
you acknowledge this fact somewhere in the documentation,
research report, etc... If you like ANTLR and have
developed a nice tool with the output, please mention that
you developed it using ANTLR. In addition, we ask that the
headers remain intact in our source code. As long as these
guidelines are kept, we expect to continue enhancing this
system and expect to make other tools available as they are
completed.

The primary ANTLR guy:

Terence Parr
parrt@cs.usfca.edu
parrt@antlr.org
antlr-2.7.7/extras/0000755000175000017500000000000010522211615014106 5ustar  twernertwernerantlr-2.7.7/extras/setup.hint0000644000175000017500000000046710522211615016141 0ustar  twernertwerner# comment
sdesc: (AN)other (T)ool for (L)anguage (R)ecognition
ldesc: "A language tool  that provides a framework for constructing
recognizers, compilers, and  translators  from grammatical
descriptions. The following languages are supported:

  Java |  C++ | C# | Python


"
category: "Devel"
requires: cygwin
antlr-2.7.7/extras/antlr-mode.el0000755000175000017500000031704410522211615016506 0ustar  twernertwerner;;; antlr-mode.el --- major mode for ANTLR grammar files

;; Copyright (C) 1999-2001 Free Software Foundation, Inc.
;;
;; Author: Christoph.Wedler@sap.com
;; Keywords: languages
;; Version: 2.1
;; X-URL: http://www.fmi.uni-passau.de/~wedler/antlr-mode/

;; This file is part of GNU Emacs.

;; GNU Emacs is free software; you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation; either version 2, or (at your option)
;; any later version.

;; GNU Emacs is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
;; GNU General Public License for more details.

;; You should have received a copy of the GNU General Public License
;; along with GNU Emacs; see the file COPYING.  If not, write to the
;; Free Software Foundation, Inc., 59 Temple Place - Suite 330,
;; Boston, MA 02111-1307, USA.

;;; Commentary:

;; This Emacs extension (major mode) provides various features for editing
;; ANTLR grammar files.  ANTLR is a tool for LL(k)-based language recognition
;; and an excellent alternative to lex & yacc, see .
;; Some features depend on the value of ANTLR's "language" option (check the
;; modeline for "Antlr.Java" or "Antlr.C++").

;; This package provides the following features:
;;  * Syntax highlighting for grammar symbols and the code in actions.
;;  * Indentation (pretty-print) for the current line (TAB) and lines in the
;;    selected region (C-M-\).  Inserting an ANTLR syntax symbol (one of
;;    ":;|&(){}") might also indent the current line.
;;  * Menu "Index" and Speedbar tags with all class, token and rule
;;    definitions.  Jump to corresponding position by selecting an entry.
;;  * Commands to move to previous/next rule, beginning/end of rule body etc.
;;  * Commands to hide/unhide actions.
;;  * Support to insert/change file/grammar/rule/subrule options.
;;  * Run ANTLR from within Emacs, create Makefile dependencies.

;; SYNTAX HIGHLIGHTING comes in three phases.  First, comments and strings are
;; highlighted.  Second, the grammar code is highlighted according to
;; `antlr-font-lock-additional-keywords' (rule refs: dark blue, token refs:
;; dark orange, definition: bold blue).  Third, actions, semantic predicates
;; and arguments are highlighted according to the usual font-lock keywords of
;; the major-mode corresponding to ANTLR's "language" option, see also
;; `antlr-font-lock-maximum-decoration'.  We define special font-lock faces for
;; the grammar code to allow you to distinguish ANTLR keywords from Java/C++
;; keywords.

;; INDENTATION.  This package supports ANTLR's (intended) indentation style
;; which is based on a simple paren/brace/bracket depth-level calculation, see
;; `antlr-indent-line'.  The indentation engine of cc-mode is only used inside
;; block comments.  By default, this package defines a tab width of 4 to be
;; consistent to both ANTLR's conventions (TABs usage) and the
;; `c-indentation-style' "java" which sets `c-basic-offset' to 4, see
;; `antlr-tab-offset-alist'.  You might want to set this variable to nil.

;; OPTION SUPPORT.  This package provides special support to insert or change
;; file, grammar, rule and subrule options via the menu or via the keyboard
;; with completion.  For most options, you can also insert the value with
;; completion (or select a value from a list by pressing `?').  You get a
;; warning if an option is not supported by the version of ANTLR you are using
;; (`antlr-tool-version' defaults to 2.7.1), or if the option shouldn't be
;; inserted for other reasons.  This package knows the correct position where
;; to insert the option and inserts "options {...}" if it is not already
;; present.  For details, see the docstring of command \\[antlr-insert-option].

;; MAKEFILE CREATION.  Command \\[antlr-show-makefile-rules] shows/inserts the
;; dependencies for all grammar files in the current directory.  It considers
;; ANTLR's "language" option, import/export vocabularies and grammar
;; inheritance, and provides a value for the -glib option if necessary (which
;; you have to edit if the super-grammar is not in the same directory).

;; TODO/WISH-LIST.  Things which might be supported in future versions:

;;  * Next Version [C-c C-w].  Produce HTML document with syntax highlighted
;;    and hyper-links (using htmlize).
;;  * Next Version [C-c C-u].  Insert/update special comments: each rule lists
;;    all rules which use the current rule.  With font-lock update.
;;  * Next Version.  Make hiding much more customizable.
;;  * Planned [C-c C-j].  Jump to generated coding.
;;  * Planned.  Further support for imenu, i.e., include entries for method
;;    definitions at beginning of grammar class.
;;  * Planned [C-c C-p].  Pack/unpack rule/subrule & options (one/multi-line).

;;  * Probably.  Show rules/dependencies for ANT like for Makefile (does ANT
;;    support vocabularies and grammar inheritance?), I have to look at
;;    jde-ant.el: http://jakarta.apache.org/ant/manual/OptionalTasks/antlr.html
;;  * Unlikely.  Sather as generated language with syntax highlighting etc/.
;;    Questions/problems: is sather-mode.el the standard mode for sather, is it
;;    still supported, what is its relationship to eiffel3.el?  Requirement:
;;    this mode must not depend on a Sather mode.
;;  * Unlikely.  Faster syntax highlighting: sectionize the buffer into Antlr
;;    and action code and run special highlighting functions on these regions.
;;    Problems: code size, this mode would depend on font-lock internals.

;; Bug fixes, bug reports, improvements, and suggestions are strongly
;; appreciated.  Please check the newest version first:
;;   http://www.fmi.uni-passau.de/~wedler/antlr-mode/changes.html

;;; Installation:

;; This file requires Emacs-20.3, XEmacs-20.4 or higher and package cc-mode.

;; If antlr-mode is not part of your distribution, put this file into your
;; load-path and the following into your ~/.emacs:
;;   (autoload 'antlr-mode "antlr-mode" nil t)
;;   (setq auto-mode-alist (cons '("\\.g\\'" . antlr-mode) auto-mode-alist))
;;   (add-hook 'speedbar-load-hook  ; would be too late in antlr-mode.el
;;	       (lambda () (speedbar-add-supported-extension ".g")))

;; If you edit ANTLR's source files, you might also want to use
;;   (autoload 'antlr-set-tabs "antlr-mode")
;;   (add-hook 'java-mode-hook 'antlr-set-tabs)

;; I strongly recommend to use font-lock with a support mode like fast-lock,
;; lazy-lock or better jit-lock (Emacs-21.1+) / lazy-shot (XEmacs).

;; To customize, use menu item "Antlr" -> "Customize Antlr".

;;; Code:

(provide 'antlr-mode)
(eval-when-compile			; required and optional libraries
  (require 'cc-mode)
  (defvar c-Java-access-key)		; former cc-mode variable
  (condition-case nil (require 'font-lock) (error nil))
  (condition-case nil (require 'compile) (error nil))
  (defvar outline-level) (defvar imenu-use-markers)
  (defvar imenu-create-index-function))
(eval-when-compile			; Emacs: cl, easymenu, XEmacs vars
  (require 'cl)
  (require 'easymenu)
  (defvar zmacs-region-stays))
(eval-when-compile			; XEmacs: Emacs vars
  (defvar inhibit-point-motion-hooks) (defvar deactivate-mark))

(eval-and-compile			; XEmacs functions, simplified
  (if (featurep 'xemacs)
      (defalias 'antlr-scan-sexps 'scan-sexps)
    (defalias 'antlr-scan-sexps 'antlr-scan-sexps-internal))
  (if (featurep 'xemacs)
      (defalias 'antlr-scan-lists 'scan-lists)
    (defalias 'antlr-scan-lists 'antlr-scan-lists-internal))
  (if (fboundp 'default-directory)
      (defalias 'antlr-default-directory 'default-directory)
    (defun antlr-default-directory () default-directory))
  (if (fboundp 'read-shell-command)
      (defalias 'antlr-read-shell-command 'read-shell-command)
    (defun antlr-read-shell-command (prompt &optional initial-input history)
      (read-from-minibuffer prompt initial-input nil nil
			    (or history 'shell-command-history))))
  (if (fboundp 'with-displaying-help-buffer)
      (defalias 'antlr-with-displaying-help-buffer 'with-displaying-help-buffer)
    (defun antlr-with-displaying-help-buffer (thunk &optional name)
      (with-output-to-temp-buffer "*Help*"
	(save-excursion (funcall thunk)))))
  (if (and (fboundp 'buffer-syntactic-context)
	   (fboundp 'buffer-syntactic-context-depth))
      (progn
	(defalias 'antlr-invalidate-context-cache 'antlr-xemacs-bug-workaround)
	(defalias 'antlr-syntactic-context 'antlr-fast-syntactic-context))
    (defalias 'antlr-invalidate-context-cache 'ignore)
    (defalias 'antlr-syntactic-context 'antlr-slow-syntactic-context)))



;;;;##########################################################################
;;;;  Variables
;;;;##########################################################################


(defgroup antlr nil
  "Major mode for ANTLR grammar files."
  :group 'languages
  :link '(emacs-commentary-link "antlr-mode.el")
  :link '(url-link "http://www.fmi.uni-passau.de/~wedler/antlr-mode/")
  :prefix "antlr-")

(defconst antlr-version "2.1"
  "ANTLR major mode version number.")


;;;===========================================================================
;;;  Controlling ANTLR's code generator (language option)
;;;===========================================================================

(defvar antlr-language nil
  "Major mode corresponding to ANTLR's \"language\" option.
Set via `antlr-language-alist'.  The only useful place to change this
buffer-local variable yourself is in `antlr-mode-hook' or in the \"local
variable list\" near the end of the file, see
`enable-local-variables'.")

(defcustom antlr-language-alist
  '((java-mode "Java" nil "\"Java\"" "Java")
    (c++-mode "C++" "\"Cpp\"" "Cpp"))
  "List of ANTLR's supported languages.
Each element in this list looks like
  \(MAJOR-MODE MODELINE-STRING OPTION-VALUE...)

MAJOR-MODE, the major mode of the code in the grammar's actions, is the
value of `antlr-language' if the first group in the string matched by
REGEXP in `antlr-language-limit-n-regexp' is one of the OPTION-VALUEs.
An OPTION-VALUE of nil denotes the fallback element.  MODELINE-STRING is
also displayed in the modeline next to \"Antlr\"."
  :group 'antlr
  :type '(repeat (group :value (java-mode "")
			(function :tag "Major mode")
			(string :tag "Modeline string")
			(repeat :tag "ANTLR language option" :inline t
				(choice (const :tag "Default" nil)
					string )))))

(defcustom antlr-language-limit-n-regexp
  '(8192 . "language[ \t]*=[ \t]*\\(\"?[A-Z][A-Za-z_]*\"?\\)")
  "Used to set a reasonable value for `antlr-language'.
Looks like \(LIMIT \. REGEXP).  Search for REGEXP from the beginning of
the buffer to LIMIT and use the first group in the matched string to set
the language according to `antlr-language-alist'."
  :group 'antlr
  :type '(cons (choice :tag "Limit" (const :tag "No" nil) (integer :value 0))
	       regexp))


;;;===========================================================================
;;;  Hide/Unhide, Indent/Tabs
;;;===========================================================================

(defcustom antlr-action-visibility 3
  "Visibility of actions when command `antlr-hide-actions' is used.
If nil, the actions with their surrounding braces are hidden.  If a
number, do not hide the braces, only hide the contents if its length is
greater than this number."
  :group 'antlr
  :type '(choice (const :tag "Completely hidden" nil)
		 (integer :tag "Hidden if longer than" :value 3)))

(defcustom antlr-indent-comment 'tab
  "*Non-nil, if the indentation should touch lines in block comments.
If nil, no continuation line of a block comment is changed.  If t, they
are changed according to `c-indentation-line'.  When not nil and not t,
they are only changed by \\[antlr-indent-command]."
  :group 'antlr
  :type '(radio (const :tag "No" nil)
		(const :tag "Always" t)
		(sexp :tag "With TAB" :format "%t" :value tab)))

(defcustom antlr-tab-offset-alist
  '((antlr-mode nil 4 nil)
    (java-mode "antlr" 4 nil))
  "Alist to determine whether to use ANTLR's convention for TABs.
Each element looks like \(MAJOR-MODE REGEXP TAB-WIDTH INDENT-TABS-MODE).
The first element whose MAJOR-MODE is nil or equal to `major-mode' and
whose REGEXP is nil or matches variable `buffer-file-name' is used to
set `tab-width' and `indent-tabs-mode'.  This is useful to support both
ANTLR's and Java's indentation styles.  Used by `antlr-set-tabs'."
  :group 'antlr
  :type '(repeat (group :value (antlr-mode nil 8 nil)
			(choice (const :tag "All" nil)
				(function :tag "Major mode"))
			(choice (const :tag "All" nil) regexp)
			(integer :tag "Tab width")
			(boolean :tag "Indent-tabs-mode"))))

(defcustom antlr-indent-style "java"
  "*If non-nil, cc-mode indentation style used for `antlr-mode'.
See `c-set-style' for details."
  :group 'antlr
  :type '(choice (const nil) regexp))

(defcustom antlr-indent-item-regexp
  "[]}):;|&]\\|default[ \t]*:\\|case[ \t]+\\('\\\\?.'\\|[0-9]+\\|[A-Za-z_][A-Za-z_0-9]*\\)[ \t]*:" ; & is local ANTLR extension (SGML's and-connector)
  "Regexp matching lines which should be indented by one TAB less.
See `antlr-indent-line' and command \\[antlr-indent-command]."
  :group 'antlr
  :type 'regexp)

(defcustom antlr-indent-at-bol-alist
  ;; eval-when-compile not usable with defcustom...
  '((c++-mode . "#\\(assert\\|cpu\\|define\\|endif\\|el\\(if\\|se\\)\\|i\\(dent\\|f\\(def\\|ndef\\)?\\|mport\\|nclude\\(_next\\)?\\)\\|line\\|machine\\|pragma\\|system\\|un\\(assert\\|def\\)\\|warning\\)\\>"))
  "Alist of regexps matching lines are indented at column 0.
Each element in this list looks like (MODE . REGEXP) where MODE is a
function and REGEXP is a regular expression.

If `antlr-language' equals to a MODE and the line starting at the first
non-whitespace is matched by the corresponding REGEXP, indent the line
at column 0 instead according to the normal rules of `antlr-indent-line'."
  :group 'antlr
  :type '(repeat (cons (function :tag "Major mode") regexp)))


;;;===========================================================================
;;;  Options: customization
;;;===========================================================================

(defcustom antlr-options-use-submenus t
  "*Non-nil, if the major mode menu should include option submenus.
If nil, the menu just includes a command to insert options.  Otherwise,
it includes four submenus to insert file/grammar/rule/subrule options."
  :group 'antlr
  :type 'boolean)

(defcustom antlr-tool-version 20701
  "*The version number of the Antlr tool.
The value is an integer of the form XYYZZ which stands for vX.YY.ZZ.
This variable is used to warn about non-supported options and to supply
version correct option values when using \\[antlr-insert-option].

Don't use a number smaller than 20600 since the stored history of
Antlr's options starts with v2.06.00, see `antlr-options-alists'.  You
can make this variable buffer-local."
  :group 'antlr
  :type 'integer)

(defcustom antlr-options-auto-colon t
  "*Non-nil, if `:' is inserted with a rule or subrule options section.
A `:' is only inserted if this value is non-nil, if a rule or subrule
option is inserted with \\[antlr-insert-option], if there was no rule or
subrule options section before, and if a `:' is not already present
after the section, ignoring whitespace, comments and the init action."
  :group 'antlr
  :type 'boolean)

(defcustom antlr-options-style nil
  "List of symbols which determine the style of option values.
If a style symbol is present, the corresponding option value is put into
quotes, i.e., represented as a string, otherwise it is represented as an
identifier.

The only style symbol used in the default value of `antlr-options-alist'
is `language-as-string'.  See also `antlr-read-value'."
  :group 'antlr
  :type '(repeat (symbol :tag "Style symbol")))

(defcustom antlr-options-push-mark t
  "*Non-nil, if inserting an option should set & push mark.
If nil, never set mark when inserting an option with command
\\[antlr-insert-option].  If t, always set mark via `push-mark'.  If a
number, only set mark if point was outside the options area before and
the number of lines between point and the insert position is greater
than this value.  Otherwise, only set mark if point was outside the
options area before."
  :group 'antlr
  :type '(radio (const :tag "No" nil)
		(const :tag "Always" t)
		(integer :tag "Lines between" :value 10)
		(sexp :tag "If outside options" :format "%t" :value outside)))

(defcustom antlr-options-assign-string " = "
  "*String containing `=' to use between option name and value.
This string is only used if the option to insert did not exist before
or if there was no `=' after it.  In other words, the spacing around an
existing `=' won't be changed when changing an option value."
  :group 'antlr
  :type 'string)


;;;===========================================================================
;;;  Options: definitions
;;;===========================================================================

(defvar antlr-options-headings '("file" "grammar" "rule" "subrule")
  "Headings for the four different option kinds.
The standard value is (\"file\" \"grammar\" \"rule\" \"subrule\").  See
`antlr-options-alists'")

(defvar antlr-options-alists
  '(;; file options ----------------------------------------------------------
    (("language" antlr-language-option-extra
      (20600 antlr-read-value
	     "Generated language: " language-as-string
	     (("Java") ("Cpp") ("HTML") ("Diagnostic")))
      (20700 antlr-read-value
	     "Generated language: " language-as-string
	     (("Java") ("Cpp") ("HTML") ("Diagnostic") ("Sather"))))
     ("mangleLiteralPrefix" nil
      (20600 antlr-read-value
	     "Prefix for literals (default LITERAL_): " t))
     ("namespace" antlr-c++-mode-extra
      (20700 antlr-read-value
	     "Wrap generated C++ code in namespace: " t))
     ("namespaceStd" antlr-c++-mode-extra
      (20701 antlr-read-value
	     "Replace ANTLR_USE_NAMESPACE(std) by: " t))
     ("namespaceAntlr" antlr-c++-mode-extra
      (20701 antlr-read-value
	     "Replace ANTLR_USE_NAMESPACE(antlr) by: " t))
     ("genHashLines" antlr-c++-mode-extra
      (20701 antlr-read-boolean
	     "Include #line in generated C++ code? "))
     )
    ;; grammar options --------------------------------------------------------
    (("k" nil
      (20600 antlr-read-value
	     "Lookahead depth: "))
     ("importVocab" nil
      (20600 antlr-read-value
	     "Import vocabulary: "))
     ("exportVocab" nil
      (20600 antlr-read-value
	     "Export vocabulary: "))
     ("testLiterals" nil		; lexer only
      (20600 antlr-read-boolean
	     "Test each token against literals table? "))
     ("defaultErrorHandler" nil		; not for lexer
      (20600 antlr-read-boolean
	     "Generate default exception handler for each rule? "))
     ("codeGenMakeSwitchThreshold" nil
      (20600 antlr-read-value
	     "Min number of alternatives for 'switch': "))
     ("codeGenBitsetTestThreshold" nil
      (20600 antlr-read-value
	     "Min size of lookahead set for bitset test: "))
     ("analyzerDebug" nil
      (20600 antlr-read-boolean
	     "Display debugging info during grammar analysis? "))
     ("codeGenDebug" nil
      (20600 antlr-read-boolean
	     "Display debugging info during code generation? "))
     ("buildAST" nil			; not for lexer
      (20600 antlr-read-boolean
	     "Use automatic AST construction/transformation? "))
     ("ASTLabelType" nil		; not for lexer
      (20600 antlr-read-value
	     "Class of user-defined AST node: " t))
     ("charVocabulary" nil		; lexer only
      (20600 nil
	     "Insert character vocabulary"))
     ("interactive" nil
      (20600 antlr-read-boolean
	     "Generate interactive lexer/parser? "))
     ("caseSensitive" nil		; lexer only
      (20600 antlr-read-boolean
	     "Case significant when matching characters? "))
     ("caseSensitiveLiterals" nil	; lexer only
      (20600 antlr-read-boolean
	     "Case significant when testing literals table? "))
     ("classHeaderSuffix" nil
      (20600 nil
	     "Additional string for grammar class definition"))
     ("filter" nil			; lexer only
      (20600 antlr-read-boolean
	     "Skip rule (the name, true or false): "
	     antlr-grammar-tokens))
     ("namespace" antlr-c++-mode-extra
      (20700 antlr-read-value
	     "Wrap generated C++ code for grammar in namespace: " t))
     ("namespaceStd" antlr-c++-mode-extra
      (20701 antlr-read-value
	     "Replace ANTLR_USE_NAMESPACE(std) by: " t))
     ("namespaceAntlr" antlr-c++-mode-extra
      (20701 antlr-read-value
	     "Replace ANTLR_USE_NAMESPACE(antlr) by: " t))
     ("genHashLines" antlr-c++-mode-extra
      (20701 antlr-read-boolean
	     "Include #line in generated C++ code? "))
;;;     ("autoTokenDef" nil		; parser only
;;;      (80000 antlr-read-boolean		; default: true
;;;	     "Automatically define referenced token? "))
;;;     ("keywordsMeltTo" nil		; parser only
;;;      (80000 antlr-read-value
;;;	     "Change non-matching keywords to token type: "))
     )
    ;; rule options ----------------------------------------------------------
    (("testLiterals" nil		; lexer only
      (20600 antlr-read-boolean
	     "Test this token against literals table? "))
     ("defaultErrorHandler" nil		; not for lexer
      (20600 antlr-read-boolean
	     "Generate default exception handler for this rule? "))
     ("ignore" nil			; lexer only
      (20600 antlr-read-value
	     "In this rule, ignore tokens of type: " nil
	     antlr-grammar-tokens))
     ("paraphrase" nil			; lexer only
      (20600 antlr-read-value
	     "In messages, replace name of this token by: " t))
     )
    ;; subrule options -------------------------------------------------------
    (("warnWhenFollowAmbig" nil
      (20600 antlr-read-boolean
	     "Display warnings for ambiguities with FOLLOW? "))
     ("generateAmbigWarnings" nil
      (20600 antlr-read-boolean
	     "Display warnings for ambiguities? "))
     ("greedy" nil
      (20700 antlr-read-boolean
	     "Make this optional/loop subrule greedy? "))
     ))
  "Definitions for Antlr's options of all four different kinds.

The value looks like \(FILE GRAMMAR RULE SUBRULE) where each FILE,
GRAMMAR, RULE, and SUBRULE is a list of option definitions of the
corresponding kind, i.e., looks like \(OPTION-DEF...).

Each OPTION-DEF looks like \(OPTION-NAME EXTRA-FN VALUE-SPEC...) which
defines a file/grammar/rule/subrule option with name OPTION-NAME.  The
OPTION-NAMEs are used for the creation of the \"Insert XXX Option\"
submenus, see `antlr-options-use-submenus', and to allow to insert the
option name with completion when using \\[antlr-insert-option].

If EXTRA-FN is a function, it is called at different phases of the
insertion with arguments \(PHASE OPTION-NAME).  PHASE can have the
values `before-input' or `after-insertion', additional phases might be
defined in future versions of this mode.  The phase `before-input'
occurs before the user is asked to insert a value.  The phase
`after-insertion' occurs after the option value has been inserted.
EXTRA-FN might be called with additional arguments in future versions of
this mode.

Each specification VALUE-SPEC looks like \(VERSION READ-FN ARG...).  The
last VALUE-SPEC in an OPTION-DEF whose VERSION is smaller or equal to
`antlr-tool-version' specifies how the user is asked for the value of
the option.

If READ-FN is nil, the only ARG is a string which is printed at the echo
area to guide the user what to insert at point.  Otherwise, READ-FN is
called with arguments \(INIT-VALUE ARG...) to get the new value of the
option.  INIT-VALUE is the old value of the option or nil.

The standard value contains the following functions as READ-FN:
`antlr-read-value' with ARGs = \(PROMPT AS-STRING TABLE) which reads a
general value, or `antlr-read-boolean' with ARGs = \(PROMPT TABLE) which
reads a boolean value or a member of TABLE.  PROMPT is the prompt when
asking for a new value.  If non-nil, TABLE is a table for completion or
a function evaluating to such a table.  The return value is quoted iff
AS-STRING is non-nil and is either t or a symbol which is a member of
`antlr-options-style'.")


;;;===========================================================================
;;;  Run tool, create Makefile dependencies
;;;===========================================================================

(defcustom antlr-tool-command "java antlr.Tool"
  "*Command used in \\[antlr-run-tool] to run the Antlr tool.
This variable should include all options passed to Antlr except the
option \"-glib\" which is automatically suggested if necessary."
  :group 'antlr
  :type 'string)

(defcustom antlr-ask-about-save t
  "*If not nil, \\[antlr-run-tool] asks which buffers to save.
Otherwise, it saves all modified buffers before running without asking."
  :group 'antlr
  :type 'boolean)

(defcustom antlr-makefile-specification
  '("\n" ("GENS" "GENS%d" " \\\n\t") "$(ANTLR)")
  "*Variable to specify the appearance of the generated makefile rules.
This variable influences the output of \\[antlr-show-makefile-rules].
It looks like \(RULE-SEP GEN-VAR-SPEC COMMAND).

RULE-SEP is the string to separate different makefile rules.  COMMAND is
a string with the command which runs the Antlr tool, it should include
all options except the option \"-glib\" which is automatically added
if necessary.

If GEN-VAR-SPEC is nil, each target directly consists of a list of
files.  If GEN-VAR-SPEC looks like \(GEN-VAR GEN-VAR-FORMAT GEN-SEP), a
Makefile variable is created for each rule target.

Then, GEN-VAR is a string with the name of the variable which contains
the file names of all makefile rules.  GEN-VAR-FORMAT is a format string
producing the variable of each target with substitution COUNT/%d where
COUNT starts with 1.  GEN-SEP is used to separate long variable values."
  :group 'antlr
  :type '(list (string :tag "Rule separator")
	       (choice
		(const :tag "Direct targets" nil)
		(list :tag "Variables for targets"
		      (string :tag "Variable for all targets")
		      (string :tag "Format for each target variable")
		      (string :tag "Variable separator")))
	       (string :tag "ANTLR command")))

(defvar antlr-file-formats-alist
  '((java-mode ("%sTokenTypes.java") ("%s.java"))
    (c++-mode ("%sTokenTypes.hpp") ("%s.cpp" "%s.hpp")))
  "Language dependent formats which specify generated files.
Each element in this list looks looks like
  \(MAJOR-MODE (VOCAB-FILE-FORMAT...) (CLASS-FILE-FORMAT...)).

The element whose MAJOR-MODE is equal to `antlr-language' is used to
specify the generated files which are language dependent.  See variable
`antlr-special-file-formats' for language independent files.

VOCAB-FILE-FORMAT is a format string, it specifies with substitution
VOCAB/%s the generated file for each export vocabulary VOCAB.
CLASS-FILE-FORMAT is a format string, it specifies with substitution
CLASS/%s the generated file for each grammar class CLASS.")

(defvar antlr-special-file-formats '("%sTokenTypes.txt" "expanded%s.g")
  "Language independent formats which specify generated files.
The value looks like \(VOCAB-FILE-FORMAT EXPANDED-GRAMMAR-FORMAT).

VOCAB-FILE-FORMAT is a format string, it specifies with substitution
VOCAB/%s the generated or input file for each export or import
vocabulary VOCAB, respectively.  EXPANDED-GRAMMAR-FORMAT is a format
string, it specifies with substitution GRAMMAR/%s the constructed
grammar file if the file GRAMMAR.g contains a grammar class which
extends a class other than \"Lexer\", \"Parser\" or \"TreeParser\".

See variable `antlr-file-formats-alist' for language dependent
formats.")

(defvar antlr-unknown-file-formats '("?%s?.g" "?%s?")
  "*Formats which specify the names of unknown files.
The value looks like \(SUPER-GRAMMAR-FILE-FORMAT SUPER-EVOCAB-FORMAT).

SUPER-GRAMMAR-FORMAT is a format string, it specifies with substitution
SUPER/%s the name of a grammar file for Antlr's option \"-glib\" if no
grammar file in the current directory defines the class SUPER or if it
is defined more than once.  SUPER-EVOCAB-FORMAT is a format string, it
specifies with substitution SUPER/%s the name for the export vocabulary
of above mentioned class SUPER.")

(defvar antlr-help-unknown-file-text
  "## The following rules contain filenames of the form
##  \"?SUPERCLASS?.g\" (and \"?SUPERCLASS?TokenTypes.txt\")
## where SUPERCLASS is not found to be defined in any grammar file of
## the current directory or is defined more than once.  Please replace
## these filenames by the grammar files (and their exportVocab).\n\n"
  "String indicating the existence of unknown files in the Makefile.
See \\[antlr-show-makefile-rules] and `antlr-unknown-file-formats'.")

(defvar antlr-help-rules-intro
  "The following Makefile rules define the dependencies for all (non-
expanded) grammars in directory \"%s\".\n
They are stored in the kill-ring, i.e., you can insert them with C-y
into your Makefile.  You can also invoke M-x antlr-show-makefile-rules
from within a Makefile to insert them directly.\n\n\n"
  "Introduction to use with \\[antlr-show-makefile-rules].
It is a format string and used with substitution DIRECTORY/%s where
DIRECTORY is the name of the current directory.")


;;;===========================================================================
;;;  Menu
;;;===========================================================================

(defcustom antlr-imenu-name t
  "*Non-nil, if a \"Index\" menu should be added to the menubar.
If it is a string, it is used instead \"Index\".  Requires package
imenu."
  :group 'antlr
  :type '(choice (const :tag "No menu" nil)
		 (const :tag "Index menu" t)
		 (string :tag "Other menu name")))

(defvar antlr-mode-map
  (let ((map (make-sparse-keymap)))
    (define-key map "\t" 'antlr-indent-command)
    (define-key map "\e\C-a" 'antlr-beginning-of-rule)
    (define-key map "\e\C-e" 'antlr-end-of-rule)
    (define-key map "\C-c\C-a" 'antlr-beginning-of-body)
    (define-key map "\C-c\C-e" 'antlr-end-of-body)
    (define-key map "\C-c\C-f" 'c-forward-into-nomenclature)
    (define-key map "\C-c\C-b" 'c-backward-into-nomenclature)
    (define-key map "\C-c\C-c" 'comment-region)
    (define-key map "\C-c\C-v" 'antlr-hide-actions)
    (define-key map "\C-c\C-r" 'antlr-run-tool)
    (define-key map "\C-c\C-o" 'antlr-insert-option)
    ;; I'm too lazy to define my own:
    (define-key map "\ea" 'c-beginning-of-statement)
    (define-key map "\ee" 'c-end-of-statement)
    ;; electric keys:
    (define-key map ":" 'antlr-electric-character)
    (define-key map ";" 'antlr-electric-character)
    (define-key map "|" 'antlr-electric-character)
    (define-key map "&" 'antlr-electric-character)
    (define-key map "(" 'antlr-electric-character)
    (define-key map ")" 'antlr-electric-character)
    (define-key map "{" 'antlr-electric-character)
    (define-key map "}" 'antlr-electric-character)
    map)
  "Keymap used in `antlr-mode' buffers.")

(easy-menu-define antlr-mode-menu antlr-mode-map
  "Major mode menu."
  `("Antlr"
    ,@(if (and antlr-options-use-submenus
	       (boundp 'emacs-major-version)
	       (or (featurep 'xemacs) (>= emacs-major-version 21)))
	  `(("Insert File Option"
	     :filter ,(lambda (x) (antlr-options-menu-filter 1 x)))
	    ("Insert Grammar Option"
	     :filter ,(lambda (x) (antlr-options-menu-filter 2 x)))
	    ("Insert Rule Option"
	     :filter ,(lambda (x) (antlr-options-menu-filter 3 x)))
	    ("Insert Subrule Option"
	     :filter ,(lambda (x) (antlr-options-menu-filter 4 x)))
	    "---")
	'(["Insert Option" antlr-insert-option
	   :active (not buffer-read-only)]))
    ("Forward/Backward"
     ["Backward Rule" antlr-beginning-of-rule t]
     ["Forward Rule" antlr-end-of-rule t]
     ["Start of Rule Body" antlr-beginning-of-body
      :active (antlr-inside-rule-p)]
     ["End of Rule Body" antlr-end-of-body
      :active (antlr-inside-rule-p)]
     "---"
     ["Backward Statement" c-beginning-of-statement t]
     ["Forward Statement" c-end-of-statement t]
     ["Backward Into Nomencl." c-backward-into-nomenclature t]
     ["Forward Into Nomencl." c-forward-into-nomenclature t])
    ["Indent Region" indent-region
     :active (and (not buffer-read-only) (c-region-is-active-p))]
    ["Comment Out Region" comment-region
     :active (and (not buffer-read-only) (c-region-is-active-p))]
    ["Uncomment Region"
     (comment-region (region-beginning) (region-end) '(4))
     :active (and (not buffer-read-only) (c-region-is-active-p))]
    "---"
    ["Hide Actions (incl. Args)" antlr-hide-actions t]
    ["Hide Actions (excl. Args)" (antlr-hide-actions 2) t]
    ["Unhide All Actions" (antlr-hide-actions 0) t]
    "---"
    ["Run Tool on Grammar" antlr-run-tool t]
    ["Show Makefile Rules" antlr-show-makefile-rules t]
    "---"
    ["Customize Antlr" (customize-group 'antlr) t]))


;;;===========================================================================
;;;  font-lock
;;;===========================================================================

(defcustom antlr-font-lock-maximum-decoration 'inherit
  "*The maximum decoration level for fontifying actions.
Value `none' means, do not fontify actions, just normal grammar code
according to `antlr-font-lock-additional-keywords'.  Value `inherit'
means, use value of `font-lock-maximum-decoration'.  Any other value is
interpreted as in `font-lock-maximum-decoration' with no level-0
fontification, see `antlr-font-lock-keywords-alist'.

While calculating the decoration level for actions, `major-mode' is
bound to `antlr-language'.  For example, with value
  \((java-mode \. 2) (c++-mode \. 0))
Java actions are fontified with level 2 and C++ actions are not
fontified at all."
  :type '(choice (const :tag "None" none)
		 (const :tag "Inherit" inherit)
		 (const :tag "Default" nil)
		 (const :tag "Maximum" t)
		 (integer :tag "Level" 1)
		 (repeat :menu-tag "Mode specific" :tag "Mode specific"
			 :value ((t . t))
			 (cons :tag "Instance"
			       (radio :tag "Mode"
				      (const :tag "All" t)
				      (symbol :tag "Name"))
			       (radio :tag "Decoration"
				      (const :tag "Default" nil)
				      (const :tag "Maximum" t)
				      (integer :tag "Level" 1))))))

(defconst antlr-no-action-keywords nil
  ;; Using nil directly won't work (would use highest level, see
  ;; `font-lock-choose-keywords'), but a non-symbol, i.e., (list), at `car'
  ;; would break Emacs-21.0:
  "Empty font-lock keywords for actions.
Do not change the value of this constant.")

(defvar antlr-font-lock-keywords-alist
  '((java-mode
     antlr-no-action-keywords
     java-font-lock-keywords-1 java-font-lock-keywords-2
     java-font-lock-keywords-3)
    (c++-mode
     antlr-no-action-keywords
     c++-font-lock-keywords-1 c++-font-lock-keywords-2
     c++-font-lock-keywords-3))
  "List of font-lock keywords for actions in the grammar.
Each element in this list looks like
  \(MAJOR-MODE KEYWORD...)

If `antlr-language' is equal to MAJOR-MODE, the KEYWORDs are the
font-lock keywords according to `font-lock-defaults' used for the code
in the grammar's actions and semantic predicates, see
`antlr-font-lock-maximum-decoration'.")

(defvar antlr-font-lock-default-face 'antlr-font-lock-default-face)
(defface antlr-font-lock-default-face nil
  "Face to prevent strings from language dependent highlighting.
Do not change."
  :group 'antlr)

(defvar antlr-font-lock-keyword-face 'antlr-font-lock-keyword-face)
(defface antlr-font-lock-keyword-face
  '((((class color) (background light)) (:foreground "black" :bold t)))
  "ANTLR keywords."
  :group 'antlr)

(defvar antlr-font-lock-syntax-face 'antlr-font-lock-keyword-face)
(defface antlr-font-lock-syntax-face
  '((((class color) (background light)) (:foreground "black" :bold t)))
  "ANTLR syntax symbols like :, |, (, ), ...."
  :group 'antlr)

(defvar antlr-font-lock-ruledef-face 'antlr-font-lock-ruledef-face)
(defface antlr-font-lock-ruledef-face
  '((((class color) (background light)) (:foreground "blue" :bold t)))
  "ANTLR rule references (definition)."
  :group 'antlr)

(defvar antlr-font-lock-tokendef-face 'antlr-font-lock-tokendef-face)
(defface antlr-font-lock-tokendef-face
  '((((class color) (background light)) (:foreground "blue" :bold t)))
  "ANTLR token references (definition)."
  :group 'antlr)

(defvar antlr-font-lock-ruleref-face 'antlr-font-lock-ruleref-face)
(defface antlr-font-lock-ruleref-face
  '((((class color) (background light)) (:foreground "blue4")))
  "ANTLR rule references (usage)."
  :group 'antlr)

(defvar antlr-font-lock-tokenref-face 'antlr-font-lock-tokenref-face)
(defface antlr-font-lock-tokenref-face
  '((((class color) (background light)) (:foreground "orange4")))
  "ANTLR token references (usage)."
  :group 'antlr)

(defvar antlr-font-lock-literal-face 'antlr-font-lock-literal-face)
(defface antlr-font-lock-literal-face
  '((((class color) (background light)) (:foreground "brown4" :bold t)))
  "ANTLR special literal tokens.
It is used to highlight strings matched by the first regexp group of
`antlr-font-lock-literal-regexp'."
  :group 'antlr)

(defcustom antlr-font-lock-literal-regexp "\"\\(\\sw\\(\\sw\\|-\\)*\\)\""
  "Regexp matching literals with special syntax highlighting, or nil.
If nil, there is no special syntax highlighting for some literals.
Otherwise, it should be a regular expression which must contain a regexp
group.  The string matched by the first group is highlighted with
`antlr-font-lock-literal-face'."
  :group 'antlr
  :type '(choice (const :tag "None" nil) regexp))

(defvar antlr-class-header-regexp
  "\\(class\\)[ \t]+\\([A-Za-z\300-\326\330-\337]\\sw*\\)[ \t]+\\(extends\\)[ \t]+\\([A-Za-z\300-\326\330-\337]\\sw*\\)[ \t]*;"
  "Regexp matching class headers.")

(defvar antlr-font-lock-additional-keywords
  `((antlr-invalidate-context-cache)
    ("\\$setType[ \t]*(\\([A-Za-z\300-\326\330-\337]\\sw*\\))"
     (1 antlr-font-lock-tokendef-face))
    ("\\$\\sw+" (0 font-lock-keyword-face))
    ;; the tokens are already fontified as string/docstrings:
    (,(lambda (limit)
	(if antlr-font-lock-literal-regexp
	    (antlr-re-search-forward antlr-font-lock-literal-regexp limit)))
     (1 antlr-font-lock-literal-face t)
     ,@(and (featurep 'xemacs) '((0 nil)))) ; XEmacs bug workaround
    (,(lambda (limit)
	(antlr-re-search-forward antlr-class-header-regexp limit))
     (1 antlr-font-lock-keyword-face)
     (2 antlr-font-lock-ruledef-face)
     (3 antlr-font-lock-keyword-face)
     (4 (if (member (match-string 4) '("Lexer" "Parser" "TreeParser"))
	    'antlr-font-lock-keyword-face
	  'font-lock-type-face)))
    (,(lambda (limit)
	(antlr-re-search-forward
	 "\\<\\(header\\|options\\|tokens\\|exception\\|catch\\|returns\\)\\>"
	 limit))
     (1 antlr-font-lock-keyword-face))
    (,(lambda (limit)
	(antlr-re-search-forward
	 "^\\(private\\|public\\|protected\\)\\>[ \t]*\\(\\(\\sw+[ \t]*\\(:\\)?\\)\\)?"
	 limit))
     (1 font-lock-type-face)		; not XEmacs' java level-3 fruit salad
     (3 (if (antlr-upcase-p (char-after (match-beginning 3)))
	    'antlr-font-lock-tokendef-face
	  'antlr-font-lock-ruledef-face) nil t)
     (4 antlr-font-lock-syntax-face nil t))
    (,(lambda (limit)
	(antlr-re-search-forward "^\\(\\sw+\\)[ \t]*\\(:\\)?" limit))
     (1 (if (antlr-upcase-p (char-after (match-beginning 0)))
	    'antlr-font-lock-tokendef-face
	  'antlr-font-lock-ruledef-face) nil t)
     (2 antlr-font-lock-syntax-face nil t))
    (,(lambda (limit)
	;; v:ruleref and v:"literal" is allowed...
	(antlr-re-search-forward "\\(\\sw+\\)[ \t]*\\([=:]\\)?" limit))
     (1 (if (match-beginning 2)
	    (if (eq (char-after (match-beginning 2)) ?=)
		'antlr-font-lock-default-face
	      'font-lock-variable-name-face)
	  (if (antlr-upcase-p (char-after (match-beginning 1)))
	      'antlr-font-lock-tokenref-face
	    'antlr-font-lock-ruleref-face)))
     (2 antlr-font-lock-default-face nil t))
    (,(lambda (limit)
	(antlr-re-search-forward "[|&:;(]\\|)\\([*+?]\\|=>\\)?" limit))
     (0 'antlr-font-lock-syntax-face)))
  "Font-lock keywords for ANTLR's normal grammar code.
See `antlr-font-lock-keywords-alist' for the keywords of actions.")

(defvar antlr-font-lock-defaults
  '(antlr-font-lock-keywords
    nil nil ((?_ . "w") (?\( . ".") (?\) . ".")) beginning-of-defun)
  "Font-lock defaults used for ANTLR syntax highlighting.
The SYNTAX-ALIST element is also used to initialize
`antlr-action-syntax-table'.")


;;;===========================================================================
;;;  Internal variables
;;;===========================================================================

(defvar antlr-mode-hook nil
  "Hook called by `antlr-mode'.")

(defvar antlr-mode-syntax-table nil
  "Syntax table used in `antlr-mode' buffers.
If non-nil, it will be initialized in `antlr-mode'.")

;; used for "in Java/C++ code" = syntactic-depth>0
(defvar antlr-action-syntax-table nil
  "Syntax table used for ANTLR action parsing.
Initialized by `antlr-mode-syntax-table', changed by SYNTAX-ALIST in
`antlr-font-lock-defaults'.  This table should be selected if you use
`buffer-syntactic-context' and `buffer-syntactic-context-depth' in order
not to confuse their context_cache.")

(defvar antlr-mode-abbrev-table nil
  "Abbreviation table used in `antlr-mode' buffers.")
(define-abbrev-table 'antlr-mode-abbrev-table ())



;;;;##########################################################################
;;;;  The Code
;;;;##########################################################################



;;;===========================================================================
;;;  Syntax functions -- Emacs vs XEmacs dependent
;;;===========================================================================

;; From help.el (XEmacs-21.1), without `copy-syntax-table'
(defmacro antlr-with-syntax-table (syntab &rest body)
  "Evaluate BODY with the syntax table SYNTAB."
  `(let ((stab (syntax-table)))
     (unwind-protect
	 (progn (set-syntax-table ,syntab) ,@body)
       (set-syntax-table stab))))
(put 'antlr-with-syntax-table 'lisp-indent-function 1)
(put 'antlr-with-syntax-table 'edebug-form-spec '(form body))

(defun antlr-scan-sexps-internal (from count &optional dummy no-error)
;; checkdoc-params: (from count dummy)
  "Like `scan-sexps' but with additional arguments.
When optional arg NO-ERROR is non-nil, `antlr-scan-sexps-internal' will
return nil instead of signaling an error."
  (if no-error
      (condition-case nil
	  (scan-sexps from count)
	(error nil))
    (scan-sexps from count)))

(defun antlr-scan-lists-internal (from count depth &optional dummy no-error)
;; checkdoc-params: (from count depth dummy)
  "Like `scan-lists' but with additional arguments.
When optional arg NO-ERROR is non-nil, `antlr-scan-lists-internal' will
return nil instead of signaling an error."
  (if no-error
      (condition-case nil
	  (scan-lists from count depth)
	(error nil))
    (scan-lists from count depth)))

(defun antlr-xemacs-bug-workaround (&rest dummies)
;; checkdoc-params: (dummies)
  "Invalidate context_cache for syntactical context information."
  ;; XEmacs bug workaround
  (save-excursion
    (set-buffer (get-buffer-create " ANTLR XEmacs bug workaround"))
    (buffer-syntactic-context-depth))
  nil)

(defun antlr-fast-syntactic-context ()
  "Return some syntactic context information.
Return `string' if point is within a string, `block-comment' or
`comment' is point is within a comment or the depth within all
parenthesis-syntax delimiters at point otherwise.
WARNING: this may alter `match-data'."
  (or (buffer-syntactic-context) (buffer-syntactic-context-depth)))

(defun antlr-slow-syntactic-context ()
  "Return some syntactic context information.
Return `string' if point is within a string, `block-comment' or
`comment' is point is within a comment or the depth within all
parenthesis-syntax delimiters at point otherwise.
WARNING: this may alter `match-data'."
  (let ((orig (point)))
    (beginning-of-defun)
    (let ((state (parse-partial-sexp (point) orig)))
      (goto-char orig)
      (cond ((nth 3 state) 'string)
	    ((nth 4 state) 'comment)	; block-comment? -- we don't care
	    (t (car state))))))


;;;===========================================================================
;;;  Misc functions
;;;===========================================================================

(defun antlr-upcase-p (char)
  "Non-nil, if CHAR is an uppercase character (if CHAR was a char)."
  ;; in XEmacs, upcase only works for ASCII
  (or (and (<= ?A char) (<= char ?Z))
      (and (<= ?\300 char) (<= char ?\337)))) ; ?\327 is no letter

(defun antlr-re-search-forward (regexp bound)
  "Search forward from point for regular expression REGEXP.
Set point to the end of the occurrence found, and return point.  Return
nil if no occurrence was found.  Do not search within comments, strings
and actions/semantic predicates.  BOUND bounds the search; it is a
buffer position.  See also the functions `match-beginning', `match-end'
and `replace-match'."
  ;; WARNING: Should only be used with `antlr-action-syntax-table'!
  (let ((continue t))
    (while (and (re-search-forward regexp bound 'limit)
		(save-match-data
		  (if (eq (antlr-syntactic-context) 0)
		      (setq continue nil)
		    t))))
    (if continue nil (point))))

(defun antlr-search-forward (string)
  "Search forward from point for STRING.
Set point to the end of the occurrence found, and return point.  Return
nil if no occurrence was found.  Do not search within comments, strings
and actions/semantic predicates."
  ;; WARNING: Should only be used with `antlr-action-syntax-table'!
  (let ((continue t))
    (while (and (search-forward string nil 'limit)
		(if (eq (antlr-syntactic-context) 0) (setq continue nil) t)))
    (if continue nil (point))))

(defun antlr-search-backward (string)
  "Search backward from point for STRING.
Set point to the beginning of the occurrence found, and return point.
Return nil if no occurrence was found.  Do not search within comments,
strings and actions/semantic predicates."
  ;; WARNING: Should only be used with `antlr-action-syntax-table'!
  (let ((continue t))
    (while (and (search-backward string nil 'limit)
		(if (eq (antlr-syntactic-context) 0) (setq continue nil) t)))
    (if continue nil (point))))

(defsubst antlr-skip-sexps (count)
  "Skip the next COUNT balanced expressions and the comments after it.
Return position before the comments after the last expression."
  (goto-char (or (antlr-scan-sexps (point) count nil t) (point-max)))
  (prog1 (point)
    (c-forward-syntactic-ws)))


;;;===========================================================================
;;;  font-lock
;;;===========================================================================

(defun antlr-font-lock-keywords ()
  "Return font-lock keywords for current buffer.
See `antlr-font-lock-additional-keywords', `antlr-language' and
`antlr-font-lock-maximum-decoration'."
  (if (eq antlr-font-lock-maximum-decoration 'none)
      antlr-font-lock-additional-keywords
    (append antlr-font-lock-additional-keywords
	    (eval (let ((major-mode antlr-language)) ; dynamic
			(font-lock-choose-keywords
			 (cdr (assq antlr-language
				    antlr-font-lock-keywords-alist))
			 (if (eq antlr-font-lock-maximum-decoration 'inherit)
			     font-lock-maximum-decoration
			   antlr-font-lock-maximum-decoration)))))))


;;;===========================================================================
;;;  imenu support
;;;===========================================================================

(defun antlr-grammar-tokens ()
  "Return alist for tokens defined in current buffer."
  (save-excursion (antlr-imenu-create-index-function t)))

(defun antlr-imenu-create-index-function (&optional tokenrefs-only)
  "Return imenu index-alist for ANTLR grammar files.
IF TOKENREFS-ONLY is non-nil, just return alist with tokenref names."
  (let ((items nil)
	(classes nil)
	(semi (point-max)))
    ;; Using `imenu-progress-message' would require imenu for compilation --
    ;; nobody is missing these messages...
    (antlr-with-syntax-table antlr-action-syntax-table
      ;; We stick to the imenu standard and search backwards, although I don't
      ;; think this is right.  It is slower and more likely not to work during
      ;; editing (you are more likely to add functions to the end of the file).
      (while semi
	(goto-char semi)
	(setq semi (antlr-search-backward ";"))
	(if semi
	    (progn (forward-char) (antlr-skip-exception-part t))
	  (antlr-skip-file-prelude t))
	(if (looking-at "{") (antlr-skip-sexps 1))
	(if (looking-at antlr-class-header-regexp)
	    (or tokenrefs-only
		(push (cons (match-string 2)
			    (if imenu-use-markers
				(copy-marker (match-beginning 2))
			      (match-beginning 2)))
		      classes))
	  (if (looking-at "p\\(ublic\\|rotected\\|rivate\\)")
	      (antlr-skip-sexps 1))
	  (when (looking-at "\\sw+")
	    (if tokenrefs-only
		(if (antlr-upcase-p (char-after (point)))
		    (push (list (match-string 0)) items))
	      (push (cons (match-string 0)
			  (if imenu-use-markers
			      (copy-marker (match-beginning 0))
			    (match-beginning 0)))
		    items))))))
    (if classes (cons (cons "Classes" classes) items) items)))


;;;===========================================================================
;;;  Parse grammar files (internal functions)
;;;===========================================================================

(defun antlr-skip-exception-part (skip-comment)
  "Skip exception part of current rule, i.e., everything after `;'.
This also includes the options and tokens part of a grammar class
header.  If SKIP-COMMENT is non-nil, also skip the comment after that
part."
  (let ((pos (point))
	(class nil))
    (c-forward-syntactic-ws)
    (while (looking-at "options\\>\\|tokens\\>")
      (setq class t)
      (setq pos (antlr-skip-sexps 2)))
    (if class
	;; Problem: an action only belongs to a class def, not a normal rule.
	;; But checking the current rule type is too expensive => only expect
	;; an action if we have found an option or tokens part.
	(if (looking-at "{") (setq pos (antlr-skip-sexps 1)))
      (while (looking-at "exception\\>")
	(setq pos (antlr-skip-sexps 1))
	(when (looking-at "\\[")
	  (setq pos (antlr-skip-sexps 1)))
	(while (looking-at "catch\\>")
	  (setq pos (antlr-skip-sexps 3)))))
    (or skip-comment (goto-char pos))))

(defun antlr-skip-file-prelude (skip-comment)
  "Skip the file prelude: the header and file options.
If SKIP-COMMENT is non-nil, also skip the comment after that part.
Return the start position of the file prelude.

Hack: if SKIP-COMMENT is `header-only' only skip header and return
position before the comment after the header."
  (let* ((pos (point))
	 (pos0 pos))
    (c-forward-syntactic-ws)
    (if skip-comment (setq pos0 (point)))
    (while (looking-at "header\\>[ \t]*\\(\"\\)?")
      (setq pos (antlr-skip-sexps (if (match-beginning 1) 3 2))))
    (if (eq skip-comment 'header-only)	; a hack...
	pos
      (when (looking-at "options\\>")
	(setq pos (antlr-skip-sexps 2)))
      (or skip-comment (goto-char pos))
      pos0)))

(defun antlr-next-rule (arg skip-comment)
  "Move forward to next end of rule.  Do it ARG many times.
A grammar class header and the file prelude are also considered as a
rule.  Negative argument ARG means move back to ARGth preceding end of
rule.  The behavior is not defined when ARG is zero.  If SKIP-COMMENT
is non-nil, move to beginning of the rule."
  ;; WARNING: Should only be used with `antlr-action-syntax-table'!
  ;; PRE: ARG<>0
  (let ((pos (point))
	(beg (point)))
    ;; first look whether point is in exception part
    (if (antlr-search-backward ";")
	(progn
	  (setq beg (point))
	  (forward-char)
	  (antlr-skip-exception-part skip-comment))
      (antlr-skip-file-prelude skip-comment))
    (if (< arg 0)
	(unless (and (< (point) pos) (zerop (incf arg)))
	  ;; if we have moved backward, we already moved one defun backward
	  (goto-char beg)		; rewind (to ";" / point)
	  (while (and arg (<= (incf arg) 0))
	    (if (antlr-search-backward ";")
		(setq beg (point))
	      (when (>= arg -1)
		;; try file prelude:
		(setq pos (antlr-skip-file-prelude skip-comment))
		(if (zerop arg)
		    (if (>= (point) beg)
			(goto-char (if (>= pos beg) (point-min) pos)))
		  (goto-char (if (or (>= (point) beg) (= (point) pos))
				 (point-min) pos))))
	      (setq arg nil)))
	  (when arg			; always found a ";"
	    (forward-char)
	    (antlr-skip-exception-part skip-comment)))
      (if (<= (point) pos)		; moved backward?
	  (goto-char pos)		; rewind
	(decf arg))			; already moved one defun forward
      (unless (zerop arg)
	(while (>= (decf arg) 0)
	  (antlr-search-forward ";"))
	(antlr-skip-exception-part skip-comment)))))

(defun antlr-outside-rule-p ()
  "Non-nil if point is outside a grammar rule.
Move to the beginning of the current rule if point is inside a rule."
  ;; WARNING: Should only be used with `antlr-action-syntax-table'!
  (let ((pos (point)))
    (antlr-next-rule -1 nil)
    (let ((between (or (bobp) (< (point) pos))))
      (c-forward-syntactic-ws)
      (and between (> (point) pos) (goto-char pos)))))


;;;===========================================================================
;;;  Parse grammar files (commands)
;;;===========================================================================
;; No (interactive "_") in Emacs... use `zmacs-region-stays'.

(defun antlr-inside-rule-p ()
  "Non-nil if point is inside a grammar rule.
A grammar class header and the file prelude are also considered as a
rule."
  (save-excursion
    (antlr-with-syntax-table antlr-action-syntax-table
      (not (antlr-outside-rule-p)))))

(defun antlr-end-of-rule (&optional arg)
  "Move forward to next end of rule.  Do it ARG [default: 1] many times.
A grammar class header and the file prelude are also considered as a
rule.  Negative argument ARG means move back to ARGth preceding end of
rule.  If ARG is zero, run `antlr-end-of-body'."
  (interactive "p")
  (if (zerop arg)
      (antlr-end-of-body)
    (antlr-with-syntax-table antlr-action-syntax-table
      (antlr-next-rule arg nil))
    (setq zmacs-region-stays t)))

(defun antlr-beginning-of-rule (&optional arg)
  "Move backward to preceding beginning of rule.  Do it ARG many times.
A grammar class header and the file prelude are also considered as a
rule.  Negative argument ARG means move forward to ARGth next beginning
of rule.  If ARG is zero, run `antlr-beginning-of-body'."
  (interactive "p")
  (if (zerop arg)
      (antlr-beginning-of-body)
    (antlr-with-syntax-table antlr-action-syntax-table
      (antlr-next-rule (- arg) t))
    (setq zmacs-region-stays t)))

(defun antlr-end-of-body (&optional msg)
  "Move to position after the `;' of the current rule.
A grammar class header is also considered as a rule.  With optional
prefix arg MSG, move to `:'."
  (interactive)
  (antlr-with-syntax-table antlr-action-syntax-table
    (let ((orig (point)))
      (if (antlr-outside-rule-p)
	  (error "Outside an ANTLR rule"))
      (let ((bor (point)))
	(when (< (antlr-skip-file-prelude t) (point))
	  ;; Yes, we are in the file prelude
	  (goto-char orig)
	  (error (or msg "The file prelude is without `;'")))
	(antlr-search-forward ";")
	(when msg
	  (when (< (point)
		   (progn (goto-char bor)
			  (or (antlr-search-forward ":") (point-max))))
	    (goto-char orig)
	    (error msg))
	  (c-forward-syntactic-ws)))))
  (setq zmacs-region-stays t))

(defun antlr-beginning-of-body ()
  "Move to the first element after the `:' of the current rule."
  (interactive)
  (antlr-end-of-body "Class headers and the file prelude are without `:'"))


;;;===========================================================================
;;;  Literal normalization, Hide Actions
;;;===========================================================================

(defun antlr-downcase-literals (&optional transform)
  "Convert all literals in buffer to lower case.
If non-nil, TRANSFORM is used on literals instead of `downcase-region'."
  (interactive)
  (or transform (setq transform 'downcase-region))
  (let ((literals 0))
    (save-excursion
      (goto-char (point-min))
      (antlr-with-syntax-table antlr-action-syntax-table
	(antlr-invalidate-context-cache)
	(while (antlr-re-search-forward "\"\\(\\sw\\(\\sw\\|-\\)*\\)\"" nil)
	  (funcall transform (match-beginning 0) (match-end 0))
	  (incf literals))))
    (message "Transformed %d literals" literals)))

(defun antlr-upcase-literals ()
  "Convert all literals in buffer to upper case."
  (interactive)
  (antlr-downcase-literals 'upcase-region))

(defun antlr-hide-actions (arg &optional silent)
  "Hide or unhide all actions in buffer.
Hide all actions including arguments in brackets if ARG is 1 or if
called interactively without prefix argument.  Hide all actions
excluding arguments in brackets if ARG is 2 or higher.  Unhide all
actions if ARG is 0 or negative.  See `antlr-action-visibility'.

Display a message unless optional argument SILENT is non-nil."
  (interactive "p")
  ;; from Emacs/lazy-lock: `save-buffer-state'
  (let ((modified (buffer-modified-p))
	(buffer-undo-list t) (inhibit-read-only t)
	(inhibit-point-motion-hooks t) deactivate-mark ; Emacs only
	before-change-functions after-change-functions
	buffer-file-name buffer-file-truename)
    (if (> arg 0)
	(let ((regexp (if (= arg 1) "[]}]" "}"))
	      (diff (and antlr-action-visibility
			 (+ (max antlr-action-visibility 0) 2))))
	  (antlr-hide-actions 0 t)
	  (save-excursion
	    (goto-char (point-min))
	    (antlr-with-syntax-table antlr-action-syntax-table
	      (antlr-invalidate-context-cache)
	      (while (antlr-re-search-forward regexp nil)
		(let ((beg (antlr-scan-sexps (point) -1 nil t)))
		  (when beg
		    (if diff		; braces are visible
			(if (> (point) (+ beg diff))
			    (add-text-properties (1+ beg) (1- (point))
						 '(invisible t intangible t)))
		      ;; if actions is on line(s) of its own, hide WS
		      (and (looking-at "[ \t]*$")
			   (save-excursion
			     (goto-char beg)
			     (skip-chars-backward " \t")
			     (and (bolp) (setq beg (point))))
			   (beginning-of-line 2)) ; beginning of next line
		      (add-text-properties beg (point)
					   '(invisible t intangible t))))))))
	  (or silent
	      (message "Hide all actions (%s arguments)...done"
		       (if (= arg 1) "including" "excluding"))))
      (remove-text-properties (point-min) (point-max)
			      '(invisible nil intangible nil))
      (or silent
	  (message "Unhide all actions (including arguments)...done")))
    (and (not modified) (buffer-modified-p)
	 (set-buffer-modified-p nil))))


;;;===========================================================================
;;;  Insert option: command
;;;===========================================================================

(defun antlr-insert-option (level option &optional location)
  "Insert file/grammar/rule/subrule option near point.
LEVEL determines option kind to insert: 1=file, 2=grammar, 3=rule,
4=subrule.  OPTION is a string with the name of the option to insert.
LOCATION can be specified for not calling `antlr-option-kind' twice.

Inserting an option with this command works as follows:

 1. When called interactively, LEVEL is determined by the prefix
    argument or automatically deduced without prefix argument.
 2. Signal an error if no option of that level could be inserted, e.g.,
    if the buffer is read-only, the option area is outside the visible
    part of the buffer or a subrule/rule option should be inserted with
    point outside a subrule/rule.
 3. When called interactively, OPTION is read from the minibuffer with
    completion over the known options of the given LEVEL.
 4. Ask user for confirmation if the given OPTION does not seem to be a
    valid option to insert into the current file.
 5. Find a correct position to insert the option.
 6. Depending on the option, insert it the following way \(inserting an
    option also means inserting the option section if necessary\):
     - Insert the option and let user insert the value at point.
     - Read a value (with completion) from the minibuffer, using a
       previous value as initial contents, and insert option with value.
 7. Final action depending on the option.  For example, set the language
    according to a newly inserted language option.

The name of all options with a specification for their values are stored
in `antlr-options-alist'.  The used specification also depends on the
value of `antlr-tool-version', i.e., step 4 will warn you if you use an
option that has been introduced in newer version of ANTLR, and step 5
will offer completion using version-correct values.

If the option already exists inside the visible part of the buffer, this
command can be used to change the value of that option.  Otherwise, find
a correct position where the option can be inserted near point.

The search for a correct position is as follows:

  * If search is within an area where options can be inserted, use the
    position of point.  Inside the options section and if point is in
    the middle of a option definition, skip the rest of it.
  * If an options section already exists, insert the options at the end.
    If only the beginning of the area is visible, insert at the
    beginning.
  * Otherwise, find the position where an options section can be
    inserted and insert a new section before any comments.  If the
    position before the comments is not visible, insert the new section
    after the comments.

This function also inserts \"options {...}\" and the \":\" if necessary,
see `antlr-options-auto-colon'.  See also `antlr-options-assign-string'.

This command might also set the mark like \\[set-mark-command] does, see
`antlr-options-push-mark'."
  (interactive (antlr-insert-option-interactive current-prefix-arg))
  (barf-if-buffer-read-only)
  (or location (setq location (cdr (antlr-option-kind level))))
  (cond ((null level)
	 (error "Cannot deduce what kind of option to insert"))
	((atom location)
	 (error "Cannot insert any %s options around here"
		(elt antlr-options-headings (1- level)))))
  (let ((area (car location))
	(place (cdr location)))
    (cond ((null place)		; invisible
	   (error (if area
		      "Invisible %s options, use %s to make them visible"
		    "Invisible area for %s options, use %s to make it visible")
		  (elt antlr-options-headings (1- level))
		  (substitute-command-keys "\\[widen]")))
	  ((null area)			; without option part
	   (antlr-insert-option-do level option nil
				   (null (cdr place))
				   (car place)))
	  ((save-excursion		; with option part, option visible
	     (goto-char (max (point-min) (car area)))
	     (re-search-forward (concat "\\(^\\|;\\)[ \t]*\\(\\<"
					(regexp-quote option)
					"\\>\\)[ \t\n]*\\(\\(=[ \t]?\\)[ \t]*\\(\\(\\sw\\|\\s_\\)+\\|\"\\([^\n\"\\]\\|[\\][^\n]\\)*\"\\)?\\)?")
				;; 2=name, 3=4+5, 4="=", 5=value
				(min (point-max) (cdr area))
				t))
	   (antlr-insert-option-do level option
				   (cons (or (match-beginning 5)
					     (match-beginning 3))
					 (match-end 5))
				   (and (null (cdr place)) area)
				   (or (match-beginning 5)
				       (match-end 4)
				       (match-end 2))))
	  (t				; with option part, option not yet
	   (antlr-insert-option-do level option t
				   (and (null (cdr place)) area)
				   (car place))))))

(defun antlr-insert-option-interactive (arg)
  "Interactive specification for `antlr-insert-option'.
Use prefix argument ARG to return \(LEVEL OPTION LOCATION)."
  (barf-if-buffer-read-only)
  (if arg (setq arg (prefix-numeric-value arg)))
  (unless (memq arg '(nil 1 2 3 4))
    (error "Valid prefix args: no=auto, 1=file, 2=grammar, 3=rule, 4=subrule"))
  (let* ((kind (antlr-option-kind arg))
	 (level (car kind)))
    (if (atom (cdr kind))
	(list level nil (cdr kind))
      (let* ((table (elt antlr-options-alists (1- level)))
	     (completion-ignore-case t)	;dynamic
	     (input (completing-read (format "Insert %s option: "
					     (elt antlr-options-headings
						  (1- level)))
				     table)))
	(list level input (cdr kind))))))

(defun antlr-options-menu-filter (level menu-items)
  "Return items for options submenu of level LEVEL."
  ;; checkdoc-params: (menu-items)
  (let ((active (if buffer-read-only
		    nil
		  (consp (cdr-safe (cdr (antlr-option-kind level)))))))
    (mapcar (lambda (option)
	      (vector option
		      (list 'antlr-insert-option level option)
		      :active active))
	    (sort (mapcar 'car (elt antlr-options-alists (1- level)))
		  'string-lessp))))
    

;;;===========================================================================
;;;  Insert option: determine section-kind
;;;===========================================================================

(defun antlr-option-kind (requested)
  "Return level and location for option to insert near point.
Call function `antlr-option-level' with argument REQUESTED.  If the
result is nil, return \(REQUESTED \. error).  If the result has the
non-nil value LEVEL, return \(LEVEL \. LOCATION) where LOCATION looks
like \(AREA \. PLACE), see `antlr-option-location'."
  (save-excursion
    (save-restriction
      (let ((min0 (point-min))		; before `widen'!
	    (max0 (point-max))
	    (orig (point))
	    (level (antlr-option-level requested)) ; calls `widen'!
	    pos)
	(cond ((null level)
	       (setq level requested))
	      ((eq level 1)		; file options
	       (goto-char (point-min))
	       (setq pos (antlr-skip-file-prelude 'header-only)))
	      ((not (eq level 3))	; grammar or subrule options
	       (setq pos (point))
	       (c-forward-syntactic-ws))
	      ((looking-at "^\\(private[ \t\n]\\|public[ \t\n]\\|protected[ \t\n]\\)?[ \t\n]*\\(\\(\\sw\\|\\s_\\)+\\)[ \t\n]*\\(!\\)?[ \t\n]*\\(\\[\\)?")
	       ;; rule options, with complete rule header
	       (goto-char (or (match-end 4) (match-end 3)))
	       (setq pos (antlr-skip-sexps (if (match-end 5) 1 0)))
	       (when (looking-at "returns[ \t\n]*\\[")
		 (goto-char (1- (match-end 0)))
		 (setq pos (antlr-skip-sexps 1)))))
	(cons level
	      (cond ((null pos) 'error)
		    ((looking-at "options[ \t\n]*{")
		     (goto-char (match-end 0))
		     (setq pos (antlr-scan-lists (point) 1 1 nil t))
		     (antlr-option-location orig min0 max0
					    (point)
					    (if pos (1- pos) (point-max))
					    t))
		    (t
		     (antlr-option-location orig min0 max0
					    pos (point)
					    nil))))))))

(defun antlr-option-level (requested)
  "Return level for option to insert near point.
Remove any restrictions from current buffer and return level for the
option to insert near point, i.e., 1, 2, 3, 4, or nil if no such option
can be inserted.  If REQUESTED is non-nil, it is the only possible value
to return except nil.  If REQUESTED is nil, return level for the nearest
option kind, i.e., the highest number possible.

If the result is 2, point is at the beginning of the class after the
class definition.  If the result is 3 or 4, point is at the beginning of
the rule/subrule after the init action.  Otherwise, the point position
is undefined."
  (widen)
  (if (eq requested 1)
      1
    (antlr-with-syntax-table antlr-action-syntax-table
      (antlr-invalidate-context-cache)
      (let* ((orig (point))
	     (outsidep (antlr-outside-rule-p))
	     bor depth)
	(if (eq (char-after) ?\{) (antlr-skip-sexps 1))
	(setq bor (point))		; beginning of rule (after init action)
	(cond ((eq requested 2)		; grammar options required?
	       (let (boc)		; beginning of class
		 (goto-char (point-min))
		 (while (and (<= (point) bor)
			     (antlr-re-search-forward antlr-class-header-regexp
						      nil))
		   (if (<= (match-beginning 0) bor)
		       (setq boc (match-end 0))))
		 (when boc
		   (goto-char boc)
		   2)))
	      ((save-excursion		; in region of file options?
		 (goto-char (point-min))
		 (antlr-skip-file-prelude t) ; ws/comment after: OK
		 (< orig (point)))
	       (and (null requested) 1))
	      (outsidep			; outside rule not OK
	       nil)
	      ((looking-at antlr-class-header-regexp) ; rule = class def?
	       (goto-char (match-end 0))
	       (and (null requested) 2))
	      ((eq requested 3)		; rule options required?
	       (goto-char bor)
	       3)
	      ((setq depth (antlr-syntactic-grammar-depth orig bor))
	       (if (> depth 0)		; move out of actions
		   (goto-char (scan-lists (point) -1 depth)))
	       (set-syntax-table antlr-mode-syntax-table)
	       (antlr-invalidate-context-cache)
	       (if (eq (antlr-syntactic-context) 0) ; not in subrule?
		   (unless (eq requested 4)
		     (goto-char bor)
		     3)
		 (goto-char (1+ (scan-lists (point) -1 1)))
		 4)))))))

(defun antlr-option-location (orig min-vis max-vis min-area max-area withp)
  "Return location for the options area.
ORIG is the original position of `point', MIN-VIS is `point-min' and
MAX-VIS is `point-max'.  If WITHP is non-nil, there exists an option
specification and it starts after the brace at MIN-AREA and stops at
MAX-AREA.  If WITHP is nil, there is no area and the region where it
could be inserted starts at MIN-AREA and stops at MAX-AREA.

The result has the form (AREA . PLACE).  AREA is (MIN-AREA . MAX-AREA)
if WITHP is non-nil, and nil otherwise.  PLACE is nil if the area is
invisible, (ORIG) if ORIG is inside the area, (MIN-AREA . beginning) for
a visible start position and (MAX-AREA . end) for a visible end position
where the beginning is preferred if WITHP is nil and the end if WITHP is
non-nil."
  (cons (and withp (cons min-area max-area))
	(cond ((and (<= min-area orig) (<= orig max-area))
	       ;; point in options area
	       (list orig))
	      ((and (null withp) (<= min-vis min-area) (<= min-area max-vis))
	       ;; use start of options area (only if not `withp')
	       (cons min-area 'beginning))
	      ((and (<= min-vis max-area) (<= max-area max-vis))
	       ;; use end of options area
	       (cons max-area 'end))
	      ((and withp (<= min-vis min-area) (<= min-area max-vis))
	       ;; use start of options area (only if `withp')
	       (cons min-area 'beginning)))))

(defun antlr-syntactic-grammar-depth (pos beg)
  "Return syntactic context depth at POS.
Move to POS and from there on to the beginning of the string or comment
if POS is inside such a construct.  Then, return the syntactic context
depth at point if the point position is smaller than BEG.
WARNING: this may alter `match-data'."
  (goto-char pos)
  (let ((context (or (antlr-syntactic-context) 0)))
    (while (and context (not (integerp context)))
      (cond ((eq context 'string)
	     (setq context
		   (and (search-backward "\"" nil t)
			(>= (point) beg)
			(or (antlr-syntactic-context) 0))))
	    ((memq context '(comment block-comment))
	     (setq context
		   (and (re-search-backward "/[/*]" nil t)
			(>= (point) beg)
			(or (antlr-syntactic-context) 0))))))
    context))


;;;===========================================================================
;;;  Insert options: do the insertion
;;;===========================================================================

(defun antlr-insert-option-do (level option old area pos)
  "Insert option into buffer at position POS.
Insert option of level LEVEL and name OPTION.  If OLD is non-nil, an
options area is already exists.  If OLD looks like \(BEG \. END), the
option already exists.  Then, BEG is the start position of the option
value, the position of the `=' or nil, and END is the end position of
the option value or nil.

If the original point position was outside an options area, AREA is nil.
Otherwise, and if an option specification already exists, AREA is a cons
cell where the two values determine the area inside the braces."
  (let* ((spec (cdr (assoc option (elt antlr-options-alists (1- level)))))
	 (value (antlr-option-spec level option (cdr spec) (consp old))))
    (if (fboundp (car spec)) (funcall (car spec) 'before-input option))
    ;; set mark (unless point was inside options area before)
    (if (cond (area (eq antlr-options-push-mark t))
	      ((numberp antlr-options-push-mark)
	       (> (count-lines (min (point) pos) (max (point) pos))
		  antlr-options-push-mark))
	      (antlr-options-push-mark))
	(push-mark))
    ;; read option value -----------------------------------------------------
    (goto-char pos)
    (if (null value)
	;; no option specification found
	(if (y-or-n-p (format "Insert unknown %s option %s? "
			      (elt antlr-options-headings (1- level))
			      option))
	    (message "Insert value for %s option %s"
		     (elt antlr-options-headings (1- level))
		     option)
	  (error "Didn't insert unknown %s option %s"
		 (elt antlr-options-headings (1- level))
		 option))
      ;; option specification found
      (setq value (cdr value))
      (if (car value)
	  (let ((initial (and (consp old) (cdr old)
			      (buffer-substring (car old) (cdr old)))))
	    (setq value (apply (car value)
			       (and initial
				    (if (eq (aref initial 0) ?\")
					(read initial)
				      initial))
			       (cdr value))))
	(message (cadr value))
	(setq value nil)))
    ;; insert value ----------------------------------------------------------
    (if (consp old)
	(antlr-insert-option-existing old value)
      (if (consp area)
	  ;; Move outside string/comment if point is inside option spec
	  (antlr-syntactic-grammar-depth (point) (car area)))
      (antlr-insert-option-space area old)
      (or old (antlr-insert-option-area level))
      (insert option " = ;")
      (backward-char)
      (if value (insert value)))
    ;; final -----------------------------------------------------------------
    (if (fboundp (car spec)) (funcall (car spec) 'after-insertion option))))

(defun antlr-option-spec (level option specs existsp)
  "Return version correct option value specification.
Return specification for option OPTION of kind level LEVEL.  SPECS
should correspond to the VALUE-SPEC... in `antlr-option-alists'.
EXISTSP determines whether the option already exists."
  (let (value)
    (while (and specs (>= antlr-tool-version (caar specs)))
      (setq value (pop specs)))
    (cond (value)			; found correct spec
	  ((null specs) nil)		; didn't find any specs
	  (existsp (car specs))	; wrong version, but already present
	  ((y-or-n-p (format "Insert v%s %s option %s in v%s? "
			     (antlr-version-string (caar specs))
			     (elt antlr-options-headings (1- level))
			     option
			     (antlr-version-string antlr-tool-version)))
	   (car specs))
	  (t
	   (error "Didn't insert v%s %s option %s in v%s"
		  (antlr-version-string (caar specs))
		  (elt antlr-options-headings (1- level))
		  option
		  (antlr-version-string antlr-tool-version))))))

(defun antlr-version-string (version)
  "Format the Antlr version number VERSION, see `antlr-tool-version'."
  (let ((version100 (/ version 100)))
    (format "%d.%d.%d"
	    (/ version100 100) (mod version100 100) (mod version 100))))


;;;===========================================================================
;;;  Insert options: the details (used by `antlr-insert-option-do')
;;;===========================================================================

(defun antlr-insert-option-existing (old value)
  "Insert option value VALUE at point for existing option.
For OLD, see `antlr-insert-option-do'."
  ;; no = => insert =
  (unless (car old) (insert antlr-options-assign-string))
  ;; with user input => insert if necessary
  (when value
    (if (cdr old)		; with value
	(if (string-equal value (buffer-substring (car old) (cdr old)))
	    (goto-char (cdr old))
	  (delete-region (car old) (cdr old))
	  (insert value))
      (insert value)))
  (unless (looking-at "\\([^\n=;{}/'\"]\\|'\\([^\n'\\]\\|\\\\.\\)*'\\|\"\\([^\n\"\\]\\|\\\\.\\)*\"\\)*;")
    ;; stuff (no =, {, } or /) at point is not followed by ";"
    (insert ";")
    (backward-char)))
	
(defun antlr-insert-option-space (area old)
  "Find appropriate place to insert option, insert newlines/spaces.
For AREA and OLD, see `antlr-insert-option-do'."
  (let ((orig (point))
	(open t))
    (skip-chars-backward " \t")
    (unless (bolp)
      (let ((before (char-after (1- (point)))))
	(goto-char orig)
	(and old			; with existing options area
	     (consp area)		; if point inside existing area
	     (not (eq before ?\;))	; if not at beginning of option
					; => skip to end of option
	     (if (and (search-forward ";" (cdr area) t)
		      (let ((context (antlr-syntactic-context)))
			(or (null context) (numberp context))))
		 (setq orig (point))
	       (goto-char orig)))
	(skip-chars-forward " \t")
	
	(if (looking-at "$\\|//")
	    ;; just comment after point => skip (+ lines w/ same col comment)
	    (let ((same (if (> (match-end 0) (match-beginning 0))
			    (current-column))))
	      (beginning-of-line 2)
	      (or (bolp) (insert "\n"))
	      (when (and same (null area)) ; or (consp area)?
		(while (and (looking-at "[ \t]*\\(//\\)")
			    (goto-char (match-beginning 1))
			    (= (current-column) same))
		  (beginning-of-line 2)
		  (or (bolp) (insert "\n")))))
	  (goto-char orig)
	  (if (null old)
	      (progn (insert "\n") (antlr-indent-line))
	    (unless (eq (char-after (1- (point))) ?\ )
	      (insert " "))
	    (unless (eq (char-after (point)) ?\ )
	      (insert " ")
	      (backward-char))
	    (setq open nil)))))
    (when open
      (beginning-of-line 1)
      (insert "\n")
      (backward-char)
      (antlr-indent-line))))

(defun antlr-insert-option-area (level)
  "Insert new options area for options of level LEVEL.
Used by `antlr-insert-option-do'."
  (insert "options {\n\n}")
  (when (and antlr-options-auto-colon
	     (memq level '(3 4))
	     (save-excursion
	       (c-forward-syntactic-ws)
	       (if (eq (char-after (point)) ?\{) (antlr-skip-sexps 1))
	       (not (eq (char-after (point)) ?\:))))
    (insert "\n:")
    (antlr-indent-line)
    (end-of-line 0))
  (backward-char 1)
  (antlr-indent-line)
  (beginning-of-line 0)
  (antlr-indent-line))


;;;===========================================================================
;;;  Insert options: in `antlr-options-alists'
;;;===========================================================================

(defun antlr-read-value (initial-contents prompt
					  &optional as-string table table-x)
  "Read a string from the minibuffer, possibly with completion.
If INITIAL-CONTENTS is non-nil, insert it in the minibuffer initially.
PROMPT is a string to prompt with, normally it ends in a colon and a
space.  If AS-STRING is t or is a member \(comparison done with `eq') of
`antlr-options-style', return printed representation of the user input,
otherwise return the user input directly.

If TABLE or TABLE-X is non-nil, read with completion.  The completion
table is the resulting alist of TABLE-X concatenated with TABLE where
TABLE can also be a function evaluation to an alist.

Used inside `antlr-options-alists'."
  (let* ((table0 (and (or table table-x)
		      (append table-x
			      (if (functionp table) (funcall table) table))))
	 (input (if table0
		    (completing-read prompt table0 nil nil initial-contents)
		  (read-from-minibuffer prompt initial-contents))))
    (if (and as-string
	     (or (eq as-string t)
		 (cdr (assq as-string antlr-options-style))))
	(format "%S" input)
      input)))

(defun antlr-read-boolean (initial-contents prompt &optional table)
  "Read a boolean value from the minibuffer, with completion.
If INITIAL-CONTENTS is non-nil, insert it in the minibuffer initially.
PROMPT is a string to prompt with, normally it ends in a question mark
and a space.  \"(true or false) \" is appended if TABLE is nil.

Read with completion over \"true\", \"false\" and the keys in TABLE, see
also `antlr-read-value'.

Used inside `antlr-options-alists'."
  (antlr-read-value initial-contents
		    (if table prompt (concat prompt "(true or false) "))
		    nil
		    table '(("false") ("true"))))

(defun antlr-language-option-extra (phase &rest dummies)
;; checkdoc-params: (dummies)
  "Change language according to the new value of the \"language\" option.
Call `antlr-mode' if the new language would be different from the value
of `antlr-language', keeping the value of variable `font-lock-mode'.

Called in PHASE `after-insertion', see `antlr-options-alists'."
  (when (eq phase 'after-insertion)
    (let ((new-language (antlr-language-option t)))
      (or (null new-language)
	  (eq new-language antlr-language)
	  (let ((font-lock (and (boundp 'font-lock-mode) font-lock-mode)))
	    (if font-lock (font-lock-mode 0))
	    (antlr-mode)
	    (and font-lock (null font-lock-mode) (font-lock-mode 1)))))))

(defun antlr-c++-mode-extra (phase option &rest dummies)
;; checkdoc-params: (option dummies)
  "Warn if C++ option is used with the wrong language.
Ask user \(\"y or n\"), if a C++ only option is going to be inserted but
`antlr-language' has not the value `c++-mode'.

Called in PHASE `before-input', see `antlr-options-alists'."
  (and (eq phase 'before-input)
       (not (y-or-n-p (format "Insert C++ %s option? " option)))
       (error "Didn't insert C++ %s option with language %s"
	      option (cadr (assq antlr-language antlr-language-alist)))))


;;;===========================================================================
;;;  Compute dependencies
;;;===========================================================================

(defun antlr-file-dependencies ()
  "Return dependencies for grammar in current buffer.
The result looks like \(FILE \(CLASSES \. SUPERS) VOCABS \. LANGUAGE)
  where CLASSES = ((CLASS . CLASS-EVOCAB) ...),
        SUPERS  = ((SUPER . USE-EVOCAB-P) ...), and
        VOCABS  = ((EVOCAB ...) . (IVOCAB ...))

FILE is the current buffer's file-name without directory part and
LANGUAGE is the value of `antlr-language' in the current buffer.  Each
EVOCAB is an export vocabulary and each IVOCAB is an import vocabulary.

Each CLASS is a grammar class with its export vocabulary CLASS-EVOCAB.
Each SUPER is a super-grammar class where USE-EVOCAB-P indicates whether
its export vocabulary is used as an import vocabulary."
  (unless buffer-file-name
    (error "Grammar buffer does not visit a file"))
  (let (classes exportVocabs importVocabs superclasses default-vocab)
    (antlr-with-syntax-table antlr-action-syntax-table
      (goto-char (point-min))
      (while (antlr-re-search-forward antlr-class-header-regexp nil)
	;; parse class definition --------------------------------------------
	(let* ((class (match-string 2))
	       (sclass (match-string 4))
	       ;; export vocab defaults to class name (first grammar in file)
	       ;; or to the export vocab of the first grammar in file:
	       (evocab (or default-vocab class))
	       (ivocab nil))
	  (goto-char (match-end 0))
	  (c-forward-syntactic-ws)
	  (while (looking-at "options\\>\\|\\(tokens\\)\\>")
	    (if (match-beginning 1)
		(antlr-skip-sexps 2)
	      (goto-char (match-end 0))
	      (c-forward-syntactic-ws)
	      ;; parse grammar option sections -------------------------------
	      (when (eq (char-after (point)) ?\{)
		(let* ((beg (1+ (point)))
		       (end (1- (antlr-skip-sexps 1)))
		       (cont (point)))
		(goto-char beg)
		(if (re-search-forward "\\ (FILE . EVOCAB) ...
	 (deps (cdr deps0))		; FILE -> (c . s) (ev . iv) . LANGUAGE
	 (with-error nil)
	 (gen-sep (or (caddr (cadr antlr-makefile-specification)) " "))
	 (n (and (cdr deps) (cadr antlr-makefile-specification) 0)))
    (or in-makefile (set-buffer standard-output))
    (dolist (dep deps)
      (let ((supers (cdadr dep))
	    (lang (cdr (assoc (cdddr dep) antlr-file-formats-alist))))
	(if n (incf n))
	(antlr-makefile-insert-variable n "" " =")
	(if supers
	    (insert " "
		    (format (cadr antlr-special-file-formats)
			    (file-name-sans-extension (car dep)))))
	(dolist (class-def (caadr dep))
	  (let ((sep gen-sep))
	    (dolist (class-file (cadr lang))
	      (insert sep (format class-file (car class-def)))
	      (setq sep " "))))
	(dolist (evocab (caaddr dep))
	  (let ((sep gen-sep))
	    (dolist (vocab-file (cons (car antlr-special-file-formats)
				      (car lang)))
	      (insert sep (format vocab-file evocab))
	      (setq sep " "))))
	(antlr-makefile-insert-variable n "\n$(" ")")
	(insert ": " (car dep))
	(dolist (ivocab (cdaddr dep))
	  (insert " " (format (car antlr-special-file-formats) ivocab)))
	(let ((glibs (antlr-superclasses-glibs supers classes)))
	  (if (cadr glibs) (setq with-error t))
	  (dolist (super (cddr glibs))
	    (insert " " (car super))
	    (if (cdr super)
		(insert " " (format (car antlr-special-file-formats)
				    (cdr super)))))
	  (insert "\n\t"
		  (caddr antlr-makefile-specification)
		  (car glibs)
		  " $<\n"
		  (car antlr-makefile-specification)))))
    (if n
	(let ((i 0))
	  (antlr-makefile-insert-variable nil "" " =")
	  (while (<= (incf i) n)
	    (antlr-makefile-insert-variable i " $(" ")"))
	  (insert "\n" (car antlr-makefile-specification))))
    (if (string-equal (car antlr-makefile-specification) "\n")
	(backward-delete-char 1))
    (when with-error
      (goto-char (point-min))
      (insert antlr-help-unknown-file-text))
    (unless in-makefile
      (copy-region-as-kill (point-min) (point-max))
      (goto-char (point-min))
      (insert (format antlr-help-rules-intro dirname)))))

;;;###autoload
(defun antlr-show-makefile-rules ()
  "Show Makefile rules for all grammar files in the current directory.
If the `major-mode' of the current buffer has the value `makefile-mode',
the rules are directory inserted at point.  Otherwise, a *Help* buffer
is shown with the rules which are also put into the `kill-ring' for
\\[yank].

This command considers import/export vocabularies and grammar
inheritance and provides a value for the \"-glib\" option if necessary.
Customize variable `antlr-makefile-specification' for the appearance of
the rules.

If the file for a super-grammar cannot be determined, special file names
are used according to variable `antlr-unknown-file-formats' and a
commentary with value `antlr-help-unknown-file-text' is added.  The
*Help* buffer always starts with the text in `antlr-help-rules-intro'."
  (interactive)
  (if (null (eq major-mode 'makefile-mode))
      (antlr-with-displaying-help-buffer 'antlr-insert-makefile-rules)
    (push-mark)
    (antlr-insert-makefile-rules t)))


;;;===========================================================================
;;;  Indentation
;;;===========================================================================

(defun antlr-indent-line ()
  "Indent the current line as ANTLR grammar code.
The indentation of non-comment lines are calculated by `c-basic-offset',
multiplied by:
 - the level of the paren/brace/bracket depth,
 - plus 0/2/1, depending on the position inside the rule: header, body,
   exception part,
 - minus 1 if `antlr-indent-item-regexp' matches the beginning of the
   line starting from the first non-blank.

Lines inside block comments are indented by `c-indent-line' according to
`antlr-indent-comment'.

If `antlr-language' has value `c++-mode', indent line at column 0 if it
is matched by `antlr-c++-indent-at-bol-regexp'.

For the initialization of `c-basic-offset', see `antlr-indent-style' and,
to a lesser extent, `antlr-tab-offset-alist'."
  (save-restriction
    (let ((orig (point))
	  (min0 (point-min))
	  bol boi indent syntax)
      (widen)
      (beginning-of-line)
      (setq bol (point))
      (if (< bol min0)
	  (error "Beginning of current line not visible"))
      (skip-chars-forward " \t")
      (setq boi (point))
      ;; check syntax at beginning of indentation ----------------------------
      (antlr-with-syntax-table antlr-action-syntax-table
	(antlr-invalidate-context-cache)
	(setq syntax (antlr-syntactic-context))
	(cond ((symbolp syntax)
	       (setq indent nil))	; block-comments, strings, (comments)
	      ((and (assq antlr-language antlr-indent-at-bol-alist)
		    (looking-at (cdr (assq antlr-language
					   antlr-indent-at-bol-alist))))
	       (setq syntax 'bol)
	       (setq indent 0))		; indentation at 0
	      ((progn
		 (antlr-next-rule -1 t)
		 (if (antlr-search-forward ":") (< boi (1- (point))) t))
	       (setq indent 0))		; in rule header
	      ((if (antlr-search-forward ";") (< boi (point)) t)
	       (setq indent 2))		; in rule body
	      (t
	       (forward-char)
	       (antlr-skip-exception-part nil)
	       (setq indent (if (> (point) boi) 1 0))))) ; in exception part?
      ;; compute the corresponding indentation and indent --------------------
      (if (null indent)
	  ;; Use the indentation engine of cc-mode for block comments.  Using
	  ;; it-mode for actions is not easy, especially if the actions come
	  ;; early in the rule body.
	  (progn
	    (goto-char orig)
	    (and (eq antlr-indent-comment t)
		 (not (eq syntax 'string))
		 (c-indent-line)))
	;; do it ourselves
	(goto-char boi)
	(unless (symbolp syntax)		; direct indentation
	  (antlr-invalidate-context-cache)
	  (incf indent (antlr-syntactic-context))
	  (and (> indent 0) (looking-at antlr-indent-item-regexp) (decf indent))
	  (setq indent (* indent c-basic-offset)))
	;; the usual major-mode indent stuff ---------------------------------
	(setq orig (- (point-max) orig))
	(unless (= (current-column) indent)
	  (delete-region bol boi)
	  (beginning-of-line)
	  (indent-to indent))
	;; If initial point was within line's indentation,
	;; position after the indentation.  Else stay at same point in text.
	(if (> (- (point-max) orig) (point))
	    (goto-char (- (point-max) orig)))))))

(defun antlr-indent-command (&optional arg)
  "Indent the current line or insert tabs/spaces.
With optional prefix argument ARG or if the previous command was this
command, insert ARG tabs or spaces according to `indent-tabs-mode'.
Otherwise, indent the current line with `antlr-indent-line'."
  (interactive "*P")
  (if (or arg (eq last-command 'antlr-indent-command))
      (insert-tab arg)
    (let ((antlr-indent-comment (and antlr-indent-comment t))) ; dynamic
      (antlr-indent-line))))

(defun antlr-electric-character (&optional arg)
  "Insert the character you type and indent the current line.
Insert the character like `self-insert-command' and indent the current
line as `antlr-indent-command' does.  Do not indent the line if

 * this command is called with a prefix argument ARG,
 * there are characters except whitespaces between point and the
   beginning of the line, or
 * point is not inside a normal grammar code, { and } are also OK in
   actions.

This command is useful for a character which has some special meaning in
ANTLR's syntax and influences the auto indentation, see
`antlr-indent-item-regexp'."
  (interactive "*P")
  (if (or arg
	  (save-excursion (skip-chars-backward " \t") (not (bolp)))
	  (antlr-with-syntax-table antlr-action-syntax-table
	    (antlr-invalidate-context-cache)
	    (let ((context (antlr-syntactic-context)))
	      (not (and (numberp context)
			(or (zerop context)
			    (memq last-command-char '(?\{ ?\}))))))))
      (self-insert-command (prefix-numeric-value arg))
    (self-insert-command (prefix-numeric-value arg))
    (antlr-indent-line)))


;;;===========================================================================
;;;  Mode entry
;;;===========================================================================

(defun antlr-c-common-init ()
  "Like `c-common-init' except menu, auto-hungry and c-style stuff."
  ;; X/Emacs 20 only
  (make-local-variable 'paragraph-start)
  (make-local-variable 'paragraph-separate)
  (make-local-variable 'paragraph-ignore-fill-prefix)
  (make-local-variable 'require-final-newline)
  (make-local-variable 'parse-sexp-ignore-comments)
  (make-local-variable 'indent-line-function)
  (make-local-variable 'indent-region-function)
  (make-local-variable 'comment-start)
  (make-local-variable 'comment-end)
  (make-local-variable 'comment-column)
  (make-local-variable 'comment-start-skip)
  (make-local-variable 'comment-multi-line)
  (make-local-variable 'outline-regexp)
  (make-local-variable 'outline-level)
  (make-local-variable 'adaptive-fill-regexp)
  (make-local-variable 'adaptive-fill-mode)
  (make-local-variable 'imenu-generic-expression) ;set in the mode functions
  (and (boundp 'comment-line-break-function)
       (make-local-variable 'comment-line-break-function))
  ;; Emacs 19.30 and beyond only, AFAIK
  (if (boundp 'fill-paragraph-function)
      (progn
	(make-local-variable 'fill-paragraph-function)
	(setq fill-paragraph-function 'c-fill-paragraph)))
  ;; now set their values
  (setq paragraph-start (concat page-delimiter "\\|$")
	paragraph-separate paragraph-start
	paragraph-ignore-fill-prefix t
	require-final-newline t
	parse-sexp-ignore-comments t
	indent-line-function 'c-indent-line
	indent-region-function 'c-indent-region
	outline-regexp "[^#\n\^M]"
	outline-level 'c-outline-level
	comment-column 32
	comment-start-skip "/\\*+ *\\|// *"
	comment-multi-line nil
	comment-line-break-function 'c-comment-line-break-function
	adaptive-fill-regexp nil
	adaptive-fill-mode nil)
  ;; we have to do something special for c-offsets-alist so that the
  ;; buffer local value has its own alist structure.
  (setq c-offsets-alist (copy-alist c-offsets-alist))
  ;; setup the comment indent variable in a Emacs version portable way
  ;; ignore any byte compiler warnings you might get here
  (make-local-variable 'comment-indent-function)
  (setq comment-indent-function 'c-comment-indent))

(defun antlr-language-option (search)
  "Find language in `antlr-language-alist' for language option.
If SEARCH is non-nil, find element for language option.  Otherwise, find
the default language."
  (let ((value (and search
		    (save-excursion
		      (goto-char (point-min))
		      (re-search-forward (cdr antlr-language-limit-n-regexp)
					 (car antlr-language-limit-n-regexp)
					 t))
		    (match-string 1)))
	(seq antlr-language-alist)
	r)
    ;; Like (find-VALUE antlr-language-alist :key 'cddr :test 'member)
    (while seq
      (setq r (pop seq))
      (if (member value (cddr r))
	  (setq seq nil)		; stop
	(setq r nil)))			; no result yet
    (car r)))


;;;###autoload
(defun antlr-mode ()
  "Major mode for editing ANTLR grammar files.
\\{antlr-mode-map}"
  (interactive)
  (c-initialize-cc-mode)		; for java syntax table
  (kill-all-local-variables)
  ;; ANTLR specific ----------------------------------------------------------
  (setq major-mode 'antlr-mode
	mode-name "Antlr")
  (setq local-abbrev-table antlr-mode-abbrev-table)
  (unless antlr-mode-syntax-table
    (setq antlr-mode-syntax-table (make-syntax-table))
    (c-populate-syntax-table antlr-mode-syntax-table))
  (set-syntax-table antlr-mode-syntax-table)
  (unless antlr-action-syntax-table
    (let ((slist (nth 3 antlr-font-lock-defaults)))
      (setq antlr-action-syntax-table
	    (copy-syntax-table antlr-mode-syntax-table))
      (while slist
	(modify-syntax-entry (caar slist) (cdar slist)
			     antlr-action-syntax-table)
	(setq slist (cdr slist)))))
  (use-local-map antlr-mode-map)
  (make-local-variable 'antlr-language)
  (unless antlr-language
    (setq antlr-language
	  (or (antlr-language-option t) (antlr-language-option nil))))
  (if (stringp (cadr (assq antlr-language antlr-language-alist)))
      (setq mode-name
	    (concat "Antlr."
		    (cadr (assq antlr-language antlr-language-alist)))))
  ;; indentation, for the C engine -------------------------------------------
  (antlr-c-common-init)
  (setq indent-line-function 'antlr-indent-line
	indent-region-function nil)	; too lazy
  (setq comment-start "// "
 	comment-end "")
  (c-set-style "java")
  (if (eq antlr-language 'c++-mode)
      (setq c-conditional-key c-C++-conditional-key
	    c-comment-start-regexp c-C++-comment-start-regexp
	    c-class-key c-C++-class-key
	    c-extra-toplevel-key c-C++-extra-toplevel-key
	    c-access-key c-C++-access-key
	    c-recognize-knr-p nil)
    (setq c-conditional-key c-Java-conditional-key
	  c-comment-start-regexp c-Java-comment-start-regexp
	  c-class-key c-Java-class-key
	  c-method-key nil
	  c-baseclass-key nil
	  c-recognize-knr-p nil
	  c-access-key (and (boundp 'c-Java-access-key) c-Java-access-key))
    (and (boundp 'c-inexpr-class-key) (boundp 'c-Java-inexpr-class-key)
	 (setq c-inexpr-class-key c-Java-inexpr-class-key)))
  ;; various -----------------------------------------------------------------
  (make-local-variable 'font-lock-defaults)
  (setq font-lock-defaults antlr-font-lock-defaults)
  (easy-menu-add antlr-mode-menu)
  (make-local-variable 'imenu-create-index-function)
  (setq imenu-create-index-function 'antlr-imenu-create-index-function)
  (make-local-variable 'imenu-generic-expression)
  (setq imenu-generic-expression t)	; fool stupid test
  (and antlr-imenu-name			; there should be a global variable...
       (fboundp 'imenu-add-to-menubar)
       (imenu-add-to-menubar
	(if (stringp antlr-imenu-name) antlr-imenu-name "Index")))
  (antlr-set-tabs)
  (run-hooks 'antlr-mode-hook))

;; A smarter version of `group-buffers-menu-by-mode-then-alphabetically' (in
;; XEmacs) could use the following property.  The header of the submenu would
;; be "Antlr" instead of "Antlr.C++" or (not and!) "Antlr.Java".
(put 'antlr-mode 'mode-name "Antlr")

;;;###autoload
(defun antlr-set-tabs ()
  "Use ANTLR's convention for TABs according to `antlr-tab-offset-alist'.
Used in `antlr-mode'.  Also a useful function in `java-mode-hook'."
  (if buffer-file-name
      (let ((alist antlr-tab-offset-alist) elem)
	(while alist
	  (setq elem (pop alist))
	  (and (or (null (car elem)) (eq (car elem) major-mode))
	       (or (null (cadr elem))
		   (string-match (cadr elem) buffer-file-name))
	       (setq tab-width (caddr elem)
		     indent-tabs-mode (cadddr elem)
		     alist nil))))))

; LocalWords:  antlr ANother ANTLR's Cpp Lexer TreeParser esp refs VALUEs ea ee
; LocalWords:  Java's Nomencl ruledef tokendef ruleref tokenref setType ader ev
; LocalWords:  ivate syntab lexer treeparser lic rotected rivate bor boi AFAIK
; LocalWords:  slist knr inexpr unhide jit GENS SEP GEN sTokenTypes hpp cpp DEP
; LocalWords:  VOCAB EVOCAB Antlr's TokenTypes exportVocab incl excl SUPERS gen
; LocalWords:  VOCABS IVOCAB exportVocabs importVocabs superclasses vocab kens
; LocalWords:  sclass evocab ivocab importVocab deps glibs supers sep dep lang
; LocalWords:  htmlize subrule jde Sather sather eiffel SGML's XYYZZ namespace
; LocalWords:  mangleLiteralPrefix namespaceStd namespaceAntlr genHashLines AST
; LocalWords:  testLiterals defaultErrorHandler codeGenMakeSwitchThreshold XXX
; LocalWords:  codeGenBitsetTestThreshold bitset analyzerDebug codeGenDebug boc
; LocalWords:  buildAST ASTLabelType charVocabulary caseSensitive autoTokenDef
; LocalWords:  caseSensitiveLiterals classHeaderSuffix keywordsMeltTo NAMEs LL
; LocalWords:  warnWhenFollowAmbig generateAmbigWarnings ARGs tokenrefs withp
; LocalWords:  outsidep existsp JOR sert endif se ndef mport nclude pragma LE
; LocalWords:  TION ASE RSION OMPT ava serting VEL mparison AMMAR

;;; antlr-mode.el ends here
antlr-2.7.7/extras/antlr-x.y.z.README0000644000175000017500000000106510522211615017073 0ustar  twernertwernerANTLR, (AN)other (T)ool for (L)anguage (R)ecognition - formerly 
known  as PCCTS - is a language tool  that provides a framework 
for constructing recognizers, compilers, and  translators  from 
grammatical descriptions for the following languages:

  Java |  C++ | C# | Python

Canonical homepage:
  http://www.antlr.org

Canonical download:
  http://www.antlr.org

Canonical build & install:
  $ ./configure --prefix=/usr --disable-examples
  $ make
  $ make install 

For further information checkout README.txt and INSTALATION.txt 
the /share/doc/antlr-x.y.z.

antlr-2.7.7/extras/antlr-jedit.xml0000644000175000017500000001421310522211615017046 0ustar  twernertwerner



	
		
		
		
		
		
		
		
		
	
   
   
		
		 
			

      
      
         header{
         }
      
      
         header {
         }
      
      
      header	{
         }
      
      
         tokens
         }
      
      
         options
         }
      
      
         [
         ]
      
      
         {
         }
      
		
		/**/

		
		
			/**
			*/
		

		
		
			/*
			*/
		
		//

		
			"
			"
		
		
			'
			'
		

      
      
         <
         >
      

      
      
         :
         ;
      

      
      
         class
         extends
         returns
         private
         protected
      
   
   
   
		
		 
			
		
		/**/

		
		
			/**
			*/
		

		
		
			/*
			*/
		
		//

		
			"
			"
		
		
			'
			'
		
      
         [
         ]
      
      
         {
         }
      

      =>
      |
      #
      !
      ?
      ^
      +
      *
      (
      )

      =
      :
   

   
		
		 
			
      
      {
      
		
		/**/

		
		
			/**
			*/
		

		
		
			/*
			*/
		

		
			"
			"
		
		
			'
			'
		
      
      
         <
         >
      

		//

      
      
         language
         k
         importVocab
         exportVocab
         testLiterals
         defaultErrorHandler
         codeGenMakeSwitchThreshold
         codeGenBitsetTestThreshold
         buildAST
         analyzerDebug
         codeGenDebug
         ASTLabelType
         charVocabulary
         interactive
         caseSensitive
         ignore
         paraphrase
         caseSensitiveLiterals
         classHeaderPrefix
         classHeaderSuffix
         mangleLiteralPrefix
         warnWhenFollowAmbig
         generateAmbigWarnings
         filter
         namespace
         namespaceStd
         namespaceAntlr
         genHashLines
         greedy
         true
         false
      
   


antlr-2.7.7/configure.in0000644000175000017500000011141010522211616015110 0ustar  twernertwernerdnl --*- sh -*--
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This file is part of ANTLR. See LICENSE.txt for licence  ##
## details. Written by W. Haefelinger                       ##
##                                                          ##
## ...............Copyright (C) Wolfgang Haefelinger, 2004  ##
##                                                          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##

## Process this file with autoconf to produce a configure
## script.
AC_INIT(antlr, 2.7.7)
AC_CONFIG_SRCDIR([LICENSE.txt])
AC_CONFIG_AUX_DIR(scripts)

## This shall be the very first config file. Do not change
## this.
AC_CONFIG_FILES([scripts/config.vars])
AC_CONFIG_FILES([scripts/config.deps])
AC_CONFIG_FILES([scripts/config.make])

AC_CONFIG_FILES([antlr/Version.java])

AC_SUBST_FILE([stdvars])
AC_SUBST_FILE([stddeps])
AC_SUBST_FILE([stdmake])

## ANTLR's core libraries for each supporte language. The variable
## in  uppercase letters denotes the absolute name of the library.
## When in  lower  cases  letters - see below - the variable just
## holds the basename.
AC_SUBST([ANTLR_JAR])
AC_SUBST([ANTLR_LIB])
AC_SUBST([ANTLR_NET])
AC_SUBST([ANTLR_PY])
AC_SUBST([ASTFRAME_NET])

AC_SUBST([antlr_jar])
AC_SUBST([antlr_lib])
AC_SUBST([antlr_net])
AC_SUBST([antlr_py])
AC_SUBST([astframe_net])

AC_SUBST([ANTLRFLAGS])
AC_SUBST([ANTLR])
AC_SUBST([ANTLR_ACTION_FILES])
AC_SUBST([ANTLR_ANTLR_FILES])
AC_SUBST([ANTLR_COMPILE_CMD])
AC_SUBST([ANTLR_CYGWIN])
AC_SUBST([ANTLR_MINGW])
AC_SUBST([ANTLR_TOKDEF_FILES])
AC_SUBST([ANTLR_WIN32])
AC_SUBST([ANTLR_WITH_ANTLR_CMD])
AC_SUBST([ANTLR_WITH_ANTLR_JAR])
AC_SUBST([ARFLAGS])
AC_SUBST([AR])
AC_SUBST([AS])
AC_SUBST([BOOTCLASSPATH])
AC_SUBST([CSHARPCFLAGS])
AC_SUBST([CSHARPC])
AC_SUBST([CSHARP_COMPILE_CMD])
AC_SUBST([CLR])
AC_SUBST([CXX_COMPILE_CMD])
AC_SUBST([CXX_LIB_CMD])
AC_SUBST([CXX_LINK_CMD])
AC_SUBST([CYGPATH])
AC_SUBST([C_COMPILE_CMD])
AC_SUBST([DEBUG])
AC_SUBST([EXEEXT])
AC_SUBST([JARFLAGS])
AC_SUBST([JAR])
AC_SUBST([JAR_CMD])
AC_SUBST([JAVACFLAGS])
AC_SUBST([JAVAC])
AC_SUBST([JAVAFLAGS])
AC_SUBST([JAVA])
AC_SUBST([JAVA_CMD])
AC_SUBST([JAVA_COMPILE_CMD])
AC_SUBST([LIBEXT])
AC_SUBST([MAKE])
AC_SUBST([OBJEXT])
AC_SUBST([PATCHLEVEL])
AC_SUBST([PYTHONFLAGS])
AC_SUBST([PYTHON])
AC_SUBST([SUBVERSION])
AC_SUBST([TIMESTAMP])
AC_SUBST([TOUCH])
AC_SUBST([VERBOSE])
AC_SUBST([VERSION])
AC_SUBST([WITH_EXAMPLES])
AC_SUBST([abs_this_builddir])
AC_SUBST([cxx])
AC_SUBST([jar])
AC_SUBST([java])
AC_SUBST([javac])
AC_SUBST([TAR])
AC_SUBST([RMF])
AC_SUBST([CP])
AC_SUBST([ECHO])
AC_SUBST([FIND])
# create strong named assemblies [true|false(*)]
AC_SUBST([STRONGNAME])
# file containing public/private key pair for creating strong named
# assemblies (no default value)
AC_SUBST([KEYFILE])
# Allow partially trusted callers (C#)
AC_SUBST([APTC])


## introduce package information as autoconf vars.
VERSION=`echo $PACKAGE_VERSION | cut -d . -f 1`
SUBVERSION=`echo $PACKAGE_VERSION | cut -d . -f 2`
PATCHLEVEL=`echo $PACKAGE_VERSION | cut -d . -f 3`
TIMESTAMP=`date +%Y%m%d`

## @abs_this_builddir@  - absolute path to top of build directory.
## According to GNU autoconf we can rely on that there's a proper
## pwd around.
abs_this_builddir=`pwd`

## This is how we compile Java files ..
JAVA_COMPILE_CMD="/bin/sh $abs_this_builddir/scripts/javac.sh"

## This is how we run Java ..
JAVA_CMD="/bin/sh $abs_this_builddir/scripts/java.sh"

## This is how we pack Java (class) files ..
JAR_CMD="/bin/sh $abs_this_builddir/scripts/jar.sh"

## And this is how we are going to compile ANTLR grammar files ..
ANTLR_COMPILE_CMD="/bin/sh $abs_this_builddir/scripts/antlr.sh"

## This is how we compile CSHARP files ..
CSHARP_COMPILE_CMD="/bin/sh $abs_this_builddir/scripts/csc.sh"

## This is how we compile C++ files and how we are going to create
## libantlr.a or antlr.lib etc. ..

CXX_COMPILE_CMD="/bin/sh $abs_this_builddir/scripts/cxx.sh"
CXX_LIB_CMD="/bin/sh $abs_this_builddir/scripts/lib.sh"
CXX_LINK_CMD="/bin/sh $abs_this_builddir/scripts/link.sh"

C_COMPILE_CMD="/bin/sh $abs_this_builddir/scripts/c.sh"

ANTLR_JAR="$abs_this_builddir/antlr/antlr.jar"
ANTLR_NET="$abs_this_builddir/lib/antlr.runtime.dll"
ASTFRAME_NET="$abs_this_builddir/lib/antlr.astframe.dll"
ANTLR_PY="$abs_this_builddir/lib/python/antlr/python.py"

## Note: values might be overriden in C++ section.
OBJEXT=".o"
LIBEXT=".a"
ANTLR_LIB="$abs_this_builddir/lib/cpp/src/libantlr.a"

stdvars="scripts/config.vars"
stddeps="scripts/config.deps"
stdmake="scripts/config.make"

##
## option --enable-java
##
AX_ARG_ENABLE(
  [java],
  [LANG_JAVA],
  [enable or disable ANTLR for Java (enabled)],
  [1],
)

##
## option --enable-cxx
##
AX_ARG_ENABLE(
  [cxx],
  [LANG_CXX],
  [enable or disable ANTLR for C++ (enabled)],
  [1],
)

##
## option --enable-python
##
AX_ARG_ENABLE(
  [python],
  [LANG_PY],
  [enable or disable ANTLR for Python (enabled).],
  [1],
)

##
## option --enable-csharp
##
AX_ARG_ENABLE(
  [csharp],
  [LANG_CS],
  [enable or disable ANTLR for C# (enabled)],
  [1],
)

##
## option --enable-verbose=
##
AX_ARG_ENABLE(
  [verbose],
  [VERBOSE],
  [turn on verbosity when building package.],
  [0],
)

##
## option --enable-debug=
##
AX_ARG_ENABLE(
  [debug],
  [DEBUG],
  [set debug level - any value greater zero enables a debug version],
  [0],
)

##
## option --enable-examples
##

WITH_EXAMPLES=1

AX_ARG_ENABLE(
  [examples],
  [WITH_EXAMPLES],
  [include examples into this configuration (enabled)],
  [1],
)

##
## option --enable-allow-partially-trusted-callers
##

APTC=1

AX_ARG_ENABLE(
  [allow-partially-trusted-callers],
  [APTC],
  [allow partially trusted callers (C#)],
  [1],
)

case $APTC in
  0) APTC=false ;;
  *) APTC=true  ;;
esac
    

##
## option --with-antlr-jar
##
ANTLR_WITH_ANTLR_JAR=""

AC_ARG_WITH(
  [antlr-jar],
  [AC_HELP_STRING(
      [--with-antlr-jar=ARG],
      [use given file (antlr.jar) to bootstrap])
    ],[
    if test -n "${ANTLR_WITH_ANTLR_CMD}" ; then
      opts="--with-antlr-jar,--with-antlr-cmd"
      AC_MSG_ERROR(
        [this configuration options mutually exclusive: $opts])
    fi
    ANTLR_WITH_ANTLR_JAR="${withval}"]
)

##
## option --with-antlr-cmd
##
ANTLR_WITH_ANTLR_CMD=""

AC_ARG_WITH(
  [antlr-cmd],
  [AC_HELP_STRING(
      [--with-antlr-cmd=ARG],
      [use given command to compile ANTLR grammar files while bootstrapping..])
    ],[
    if test -n "${ANTLR_WITH_ANTLR_JAR}" ; then
      opts="--with-antlr-jar,--with-antlr-cmd"
      AC_MSG_ERROR(
        [this configuration options mutually exclusive: $opts])
    fi
    ANTLR_WITH_ANTLR_CMD="${withval}"
  ]
)

##
## option --with-strong-assemblies
##
STRONGNAME=false
KEYFILE=

AC_ARG_WITH(
  [strong-assemblies],
  [AC_HELP_STRING(
      [--with-strong-assemblies=ARG],
      [enable strong named assemblies by passing a keyfile holding a public/private key pair (only useful when building C#)])
    ],[
    STRONGNAME=true
    KEYFILE="${withval}"
  ]
)

AC_ARG_WITH(
  [bootclasspath],
  [AC_HELP_STRING(
      [--with-bootclasspath=ARG],
      [use this option to set bootclasspath when using jikes. ARG is a white
        space seperated list of absolute file or directory names, typically
        /opt/jdk1.3/jre/lib/rt.jar. In most cases this option is not requird
        as configure tries to detect rt.jar itself. If configure fails or
        detects the wrong boot library you may use this option. Note that
        this option is only used when using jikes.
        ])
    ],[
    BOOTCLASSPATH="${withval}"
  ]
)

AX_ARG_WITH(
  [cxx],
  [CXX],
)

AX_ARG_WITH(
  [make],
  [MAKE],
)

AX_ARG_WITH(
  [java],
  [JAVA],
)

AX_ARG_WITH(
  [javac],
  [JAVAC],
)

AX_ARG_WITH(
  [jar],
  [JAR],
)

AX_ARG_WITH(
  [python],
  [PYTHON],
)

AX_ARG_WITH(
  [csharpc],
  [CSHARPC],
)

#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx#
#                     S T A R T   T E S T S                          #
#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx#

# get host_os set
AC_CANONICAL_HOST

# Detect cygwin or mingw
ANTLR_CYGWIN=no
ANTLR_MINGW=no

AC_MSG_CHECKING(whether this is Cygwin)
case $host_os in
   *cygwin* )
    ANTLR_CYGWIN=yes
    ;;
  *)
    AC_MSG_RESULT(no)
  ;;
esac

AC_MSG_CHECKING(whether this is MinGW)
case $host_os in
   *mingw* )
    ANTLR_MINGW=yes
    ;;
  *)
    AC_MSG_RESULT(no)
  ;;
esac

## Set common file extensions depending on OS we are running on.
## File extensions depend on C++/C compiler in use. This values
## are just guesses and redefined further below.

case "${host_os}" in
  *mingw*|*cygwin*)
    OBJEXT=".o"
    LIBEXT=".a"
    EXEEXT=".exe"
    ;;
  *)
    OBJEXT=".o"
    LIBEXT=".a"
    EXEEXT=""
    ;;
esac

## Test whether we have cygpath
test -z "$CYGPATH"    && AC_PATH_PROGS(CYGPATH, cygpath$EXEEXT )

AC_SUBST([CYGPATH_M])
AC_SUBST([CYGPATH_W])

if test -n "$CYGPATH" ; then
  CYGPATH_M="${CYGPATH} -m"
  CYGPATH_W="${CYGPATH} -w"
else
  CYGPATH_M="echo"
  CYGPATH_W="echo"
fi

AC_ARG_VAR(
  [ANTLRFLAGS],
  [Use environment variable ANTLRFLAGS to pass some extra flags to antlr
   when compiling grammar (*.g) files.
  ]
)

AX_PATH_PROGS([CP],  [/bin/cp   /usr/bin/cp   cp])
AX_PATH_PROGS([ECHO],[/bin/echo /usr/bin/echo echo])
AX_PATH_PROGS([FIND],[/bin/find /usr/bin/find find])

AX_VAR_HEAD([CP])
AX_VAR_HEAD([ECHO])
AX_VAR_HEAD([FIND])

#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx#
#                             MAKE                                   #
#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx#
## Check whether there's a make program around. We search for a
## couple of well know names within $PATH. A user may skip this
## search by providing variable $MAKE.
AC_ARG_VAR(
  [MAKE],
  [By default we search for "make", "gmake" and "gnumake" in your PATH
   as well as "/bin/make" and "/usr/bin/make". You may  override  this
   search by  using  enviromnent variable $MAKE.  Note that a GNU make
   is required to build this package. However,  when  providing   your
   own candidate a check for GNU make is skipped and all bets are on.
  ]
)

## @MAKE@ shall contain absolut path name of make program found.

## Search for well known make programs - take user given MAKE
## into account. The result will be a list of valid make prog-
## grams found and will be stored in variable MAKE.
user_make="${MAKE}"
AX_PATH_PROGS(
  [MAKE],
  [make gmake gnumake /bin/make /usr/bin/make]
)

## right now we need to have a GNU make around, other makes are
## not supported and likely to fail.
if test "x${user_make}" == "x" ; then
  AX_GNU_MAKE(
    [MAKE],
    [AC_MSG_ERROR( [package requires GNU make])]
  )
fi

## we lookup 'make' in PATH. If the one found is not the same
## as the configured one we issue a warning message.
AC_PATH_PROGS([just_make],[make],[%])

case "${just_make}" in
  ${MAKE})
    ;;
  *)
    AC_CONFIG_COMMANDS([notice],[
        AC_MSG_NOTICE([
 ---------------------------------------------------------
                   * WARNING *

  This package has been configured to be build by using

   $MAKE

  It is very likely that just running "make" from  the
  command line will fail. Please remember therefore to
  use the configured version.
 =========================================================
          ])
        ],[
        MAKE="${MAKE}"
      ]
    )
  ;;
esac

#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx#
#                             JAVA                                   #
#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx#
## @JAVAC@ shall contain absolut path name of javac program and
## similar to  CXXFLAGS, @JAVACFLAGS@ shall contain all options
## required to compile JAVA source files.

AC_ARG_VAR(
  [JAVAC],
  [By default we search for "jikes", "javac" and "gcj" in your $PATH
   on how to comile Java source files.  You may override this search
   by using enviromnent variable $JAVAC. JAVAC may contain a list of
   candidates, either as absolute path names or as a relative one.
   In case a relative name is given, a search  in $PATH will take
   place, otherwise the absolute name is tried.
  ]
)
AC_ARG_VAR(
  [JAVACFLAGS],
  [Environment variable JAVACFLAGS can be used to change or override
   all flags required to compile Java source files. Note that
   JAVACFLAGS understands the following:
   "+ flag1 flag2 .." append  "flag1 flag2 .." to precomputed list
   "- flag1 flag2 .." prepend "flag1 flag2 .." to precomputed list
   "= flag1 flag2 ..   override with flag1 flag2 ..". If there is
   a need to hardwire additional flags then edit scripts/javac.sh.in
   and run "CONFIG_FILES=scripts/javac.sh ./config.status" again.
  ]
)
## @JAVA@ shall contain absolut path name of java  program and
## similar to  CXXFLAGS, @JAVAFLAGS@ shall contain all options
## required to run JAVA class files.

AC_ARG_VAR(
  [JAVA],
  [By default we search for "java" and "gij" in your PATH on how
   to run Java class files. You may override this search by
   using enviromnent variable $JAVA. JAVA may contain a list of
   candidates, either as absolute path name or as a relative one.
   In case of a relative name, a search in $PATH will take place.
   Otherwise the absolute name will be accepted if existing.
  ]
)
AC_ARG_VAR(
  [JAVAFLAGS],
  [Shall contain all flags required to run Java class files.
   You may override by using environment variable JAVAFLAGS.
  ]
)

AX_JAVA_PROGS(
  [JAVA],
  [java gij],
  [AX_VAR_HEAD([JAVA])]
)
AX_JAVA_PROGS(
  [JAVAC],
  [jikes javac gcj],
  [AX_VAR_HEAD([JAVAC])]
)
AX_JAVA_PROGS(
  [JAR],
  [fastjar jar],
  [
    AX_VAR_HEAD([JAR])
  ]
)

case $LANG_JAVA in
  1)
    jar="`basename $JAR`"
    jar="`echo ${jar}|sed 's,\..*$,,'`"

    ## This macro tries to determine which javac compiler is
    ## being used. Well  known  compilers are gcj, jikes and
    ## javac. A unknown compiler is treated as  if javac has
    ## been  given  in  the  very, very naive  hope that all
    ## javac compiler have at least the same  options as the
    ## original, ie. javac.
    ## If your compiler is not in the list  and does not be-
    ## have like javac, then you need  to  extend this macro
    ## by writing a specialized test.
    AX_WHICH_JAVAC([javac])
    ## Jikes cannot live without having a Java around. Have
    ## therefore a look into  Java  installations found for
    ## a 'rt.jar'.
    test -n "${BOOTCLASSPATH}" && {
      for f in ${BOOTCLASSPATH} ; do
        AC_MSG_CHECKING([bootclasspath \"$f\"])
        test -f "${f}" -o -d "${f}" || {
          AC_MSG_RESULT([does not exist])
          AC_MSG_ERROR(
            [
===================================================================
Please check arguments given to
  --with-bootclasspath
 or
  \${BOOTCLASSPATH}
Each argument must be a valid file or directory. Use whitespace to
seperate your args.
===================================================================
          ])
        }
        AC_MSG_RESULT([good])
      done
    }
    test -z "${BOOTCLASSPATH}" && {
      case "${javac}" in
        jikes)
          BOOTCLASSPATH=""
          set x ${JAVA}
          while test $# -gt 1 ; do
            x="$2" ; shift
            d=`dirname $x`
            test -d "$d" || continue
            d=`(cd $d && cd .. && pwd)`
            test -d "$d" || continue
            test -f "$d/jre/lib/rt.jar" && {
              BOOTCLASSPATH="$d/jre/lib/rt.jar"
              ## we need to try whether jikes accept .. (tbd)
              break
            }
            test -f "$d/lib/rt.jar" && {
              BOOTCLASSPATH="$d/lib/rt.jar"
              ## we need to try whether jikes accept .. (tbd)
              break
            }
          done
          ## go for some unusual locations (MacOS)
          test -z "${BOOTCLASSPATH}" && {
            fwdir=/System/Library/Frameworks/JavaVM.framework/Versions
            for x in 1.4.1 1.3.1 ; do
              if test -f "$fwdir/$x/Classes/classes.jar" ; then
                BOOTCLASSPATH="$fwdir/$x/Classes/classes.jar"
                break
              fi
            done
          }
          ## give up in case we can't set.
          test -z "${BOOTCLASSPATH}" && {
            AC_MSG_ERROR(
              [Unable to set BOOTCLASSPATH - there is no rt.jar around.])
          }
          ;;
        *)
          BOOTCLASSPATH=""
          ;;
      esac
    }
    test -n "${BOOTCLASSPATH}" && {
      ## Finalize BOOTCLASSPATH. Depending on platform join arguments using
      ## a different seperator.
      case $build_os in
        cygwin)
          sep=";"
          ;;
        *)
          sep=":"
          ;;
      esac
      set x $BOOTCLASSPATH ; shift
      BOOTCLASSPATH="$1"
      shift
      while test $# -gt 0 ; do
        BOOTCLASSPATH="${BOOTCLASSPATH}${sep}${1}"
        shift
      done
    }
    ## Use Java first in list.
    AX_VAR_HEAD([JAVA])

    ;;
esac

#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx#
#                             C++                                    #
#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx#

case $LANG_CXX in
  1)
    AX_PATH_PROGS(
      [AR],
      [tlib lib ar /usr/bin/ar]
    )
    ## Try to figure out what C++ compiler shall be used. Note that CC
    ## clashes on cygwin. While CC is usually SUN's C++ compiler name,
    ## CC is also present on Cygwin - it's just an alias for gcc. The
    ## real alias is  actually  'cc'  but  names  are searched in non-
    ## sensitive manner. To solve this problem we  use  kind  of  hack
    ## here and list compilers availabe to known operating systems.
    case $build_os in
      cygwin*|mingw*)
        ## On Cygwin/Microsoft we are aware of Borland C++, Microsoft
        ## C++ and GNU.
        cxx_compiler_list="bcc32 cl g++"
		  # FIXME: for bcc32
		  c_compiler_list="cl gcc"
        ;;
      *)
        ## On other platforms we now HP C++ (aCC), IBM C++ (xlC*) and
        ## of  course GNU. If there's a GNU compiler around we prefer
        ## GNU. This avoids also  a  problem  with  vendors having CC
        ## a symbolic link to "gcc" instead of "g++".
        cxx_compiler_list="g++ aCC CC xlC xlC_r cxx c++"
		  # FIXME: for other unix flavours
		  c_compiler_list="cc gcc xlc_r acc"
        ;;
    esac

    ## Find a compiler for me. If compiler is not in list you can al-
    ## ways override by using environment varialbe CXX.
    AC_PROG_CXX([${cxx_compiler_list}])
    AC_PROG_CC([${c_compiler_list}])

    ## just  overrule what autoconf figured out - we never asked for
    ## this anyway. Our  handling  of compiler options is done below
    ## in the fine tuning section.
    CXXFLAGS=""

    ## 'cxx'  shall  be  the canonical compiler name. For example, gcc
    ## cl, bcc, CC, etc. Note that this is in general not equal to CXX.
    ## For example, CYGWIN  appears to have c++ as name for g++ and cc
    ## as alias for gcc.
    ## CXX is used to call the compiler, 'cxx' shall be used for
    ## decisions based on compiler in use.
    cxx=""

    if test "x$GXX" = xyes; then
      cxx="gcc"
    else
      cxx=`basename $CXX`
      cxx=`echo ${cxx}|sed 's,\.@<:@^.@:>@*$,,'`
    fi

    case ${cxx} in
      gcc*)
        cxx='gcc'
        ;;
      cl*|CL*)
        cxx='cl'
        ## check whether this is Microsoft C++ (tbd)
        ;;
      bcc32*|BCC32*)
        cxx='bcc32'
        ## check whether this is Borland C++ (tbd)
        ;;
      CC*)
        ## check whether this is SUN C++ (tbd)
        cxx="CC"
        ;;
      xlC*|xlC_r*)
        cxx="xlC"
        ## check whether this is IBM C++ (tbd)
        ;;
      aCC*)
        cxx='aCC'
        ## check whether this is HP C++ (tbd)
        ;;
      cxx*)
        cxx='cxx'
        ## check for Digital UNIX cxx (Tru64)??
        ;;
      *)
        ## unknown compiler - good luck.
        AX_MSG_UNKOWN_CXX
        ;;
    esac

    ##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
    ##                  COMPILER TUNING SECTION                     ##
    ##==============================================================##

    ## compiler tuning has basically removed from this configure
    ## script as it appears not  to  be handy and practical. All
    ## compiler flags  are  set  in  cxx.sh.in.  If there is any
    ## change required, go there and change.
    ## Note that flags  given in this file may overrule settings
    ## given in cxx.sh.in. Therefore, if you "add" flags here,
    ## put a "+" in front of variable CXXFLAGS. For example, let's
    ## say you want to add "-g". Then do this:
    ##
    ##  CXXFLAGS="-g"
    ##  ..
    ##  CXXFLAGS="+ ${CXXFLAGS}"
    ##
    ## The addition of "+"  CXXFLAGS should be the last action for
    ## that variable. The net effect is that "-g" will be added to
    ## flags set in cxx.sh.in. So the result may look like
    ## gcc -Wall -c -g ..
    ##
    ## Similar, put a "-" in front to get "gcc -g -Wall -c .." and
    ## put nothing or a "=" in front to get "gcc -g ..".
    ##
    ## Similar to CXXFLAGS are LDFLAGS and ARFLAGS for linking
    ## and making a static library.

    case "${cxx}" in
      cl|bcc32)
        OBJEXT=".obj"
        LIBEXT=".lib"
        EXEEXT=".exe"
        ANTLR_LIB="$abs_this_builddir/lib/cpp/src/antlr.lib"
        CPP="${cxx}"
        CPPFLAGS="-EP"
        ;;
      *)
        OBJEXT=".o"
        ;;
    esac

    LDFLAGS=
    AX_VAR_HEAD([AR])

    ##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
    ##               END  COMPILER TUNING SECTION                   ##
    ##==============================================================##

    # Checks for header files.
    AC_HEADER_STDC
    AC_CHECK_HEADERS([stdlib.h unistd.h])

    # Checks for typedefs, structures, and compiler characteristics.
    AC_C_CONST
    AC_C_INLINE

    # Checks for library functions.
    AC_FUNC_MALLOC
    AC_CHECK_FUNCS([strcasecmp])

    ## Some further specific test required as are using std C++.
    ## (tbd)
    ;;
esac

##
test -z "$DOXYGEN" && AC_PATH_PROG(DOXYGEN, doxygen, doxygen,  )

# This seems to convince configure to use an absolute path to the backup
# install-sh script.
ac_install_sh="$PWD/scripts/install-sh"
AC_PROG_INSTALL
AC_PROG_RANLIB

test -z "$MKDIR" && AC_PATH_PROG(MKDIR, mkdir$EXEEXT, mkdir$EXEEXT )
test -z "$RM"    && AC_PATH_PROG(RM,    rm$EXEEXT, rm$EXEEXT )

AX_PATH_PROGS(
  [TAR],
  [gnutar tar],
  [AX_VAR_HEAD([TAR])]
)

AX_PATH_PROGS(
  [TOUCH],
  [/bin/touch /usr/bin/touch touch],
  [AX_VAR_HEAD([TOUCH])]
)

test -z "$CHMOD" && AC_PATH_PROG(CHMOD, chmod$EXEEXT, chmod$EXEEXT )
test -z "$SED"   && AC_PATH_PROG(SED,   sed$EXEEXT, sed$EXEEXT )
test -z "$CAT"   && AC_PATH_PROG(CAT,   cat$EXEEXT, cat$EXEEXT )
test -z "$GREP"  && AC_PATH_PROG(GREP,  grep$EXEEXT, grep$EXEEXT )

#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx#
#                             PYTHON                                 #
#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx#

AC_ARG_VAR([PYTHON],
  [By default we search for "python" in $PATH to execute Python files.
    Override this by providing a list of candidates in environment
    variable $PYTHON and use whitespace as spereration character. A
    candidate can be either a relative or absolute path name. In
    the former case a lookup in $PATH takes place, in the latter, the
    absolute path name must exist.])

AC_ARG_VAR([PYTHONFLAGS],[
    Shall contain all flags required to run Python. Override the
    default by using environment variable $PYTHONFLAGS.
])

AX_PYTHON_PROGS(
  [PYTHON],
  [python],
  [AX_VAR_HEAD([PYTHON])]
)

case $LANG_PY in
  1)
    # We need a script that wrap Python calls in order to make Python
    # ANTLR aware. This script needs to be executable.
    AC_CONFIG_FILES(
      [scripts/python.sh],
      [${CHMOD} a+x scripts/python.sh],
      [CHMOD=${CHMOD}]
    )

    AC_CONFIG_FILES(
      [scripts/pyantlr.sh:scripts/pyinst.sh.in],
      [${CHMOD} a+x scripts/pyantlr.sh],
      [CHMOD=${CHMOD}]
    )

    AC_CONFIG_FILES(
      [lib/python/Makefile]
    )

    # We have a Makefile that loops through all python examples.
    case $WITH_EXAMPLES in
      1 )
        AC_CONFIG_FILES(
          [examples/python/Makefile]
        )
        AC_CONFIG_FILES([
            examples/python/asn1/Makefile \
            examples/python/ASTsupport/Makefile \
            examples/python/calc/Makefile \
            examples/python/columns/Makefile \
            examples/python/exprAST/Makefile \
            examples/python/filter/Makefile \
            examples/python/filterWithRule/Makefile \
            examples/python/heteroAST/Makefile \
            examples/python/HTML/Makefile \
            examples/python/IDL/Makefile \
            examples/python/imagNodeAST/Makefile \
            examples/python/includeFile/Makefile \
            examples/python/inherit.tinyc/Makefile \
            examples/python/java/Makefile \
            examples/python/lexerTester/Makefile \
            examples/python/lexRewrite/Makefile \
            examples/python/linkChecker/Makefile \
            examples/python/multiLexer/Makefile \
            examples/python/multiParser/Makefile \
            examples/python/parseBinary/Makefile \
            examples/python/pascal/Makefile \
            examples/python/cpp/Makefile \
            examples/python/preserveWhiteSpace/Makefile \
            examples/python/tinybasic/Makefile \
            examples/python/tinyc/Makefile \
            examples/python/transform/Makefile \
            examples/python/treewalk/Makefile \
            examples/python/unicode/Makefile \
            examples/python/unicode.IDENTs/Makefile \
            examples/python/xml/Makefile
        ])
        ;;
    esac
    ;;
esac

#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx#
#                             CSHARP                                 #
#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx#

AC_ARG_VAR([CSHARPC],
  [By default we search for "cscc", "msc" and "csc" in $PATH to compile C# files.
    Override this by providing a list of candidates in environment
    variable $CSHARP and use whitespace as spereration character. A
    candidate can be either a relative or absolute path name. In
    the former case a lookup in $PATH takes place, in the latter, the
    absolute path name must exist.])

AC_ARG_VAR([CSHARPCFLAGS],[
    Shall contain all flags required to compile a #C file. Override the
    default by using environment variable $CSHARPCFLAGS.
])

AX_CSHARP_PROGS(
  [CSHARPC],
  [cscc mcs csc /usr/local/bin/cscc /usr/local/bin/mcs /opt/bin/cscc /opt/bin/mcs],
  [AX_VAR_HEAD([CSHARPC])]
)

## get the basename of C# compiler. Depending on basename we try to
## decide about the CLR.
test -n "${CSHARPC}"  && {
  csharpc=`basename ${CSHARPC}`
  csharpc_d=`dirname ${CSHARPC}`
}

case $csharpc in
  cscc*)
    AX_CSHARP_PROGS(
      [CLR],
      [${csharpc_d}/ilrun ilrun /usr/local/bin/ilrun /opt/bin/ilrun],
      [AX_VAR_HEAD([CLR])]
    )
    ;;
  mcs*)
    AX_CSHARP_PROGS(
      [CLR],
      [${csharpc_d}/mono mono /usr/local/bin/mono /opt/bin/mono],
      [AX_VAR_HEAD([CLR])]
    )
    ;;
esac

case $LANG_CS in
  1)
    AC_CONFIG_FILES(
      [scripts/csc.sh],
      [${CHMOD} a+x scripts/csc.sh],
      [CHMOD=${CHMOD}]
    )

    AC_CONFIG_FILES([lib/csharp/Makefile])
    AC_CONFIG_FILES([lib/csharp/antlr.runtime/Makefile])
    AC_CONFIG_FILES([lib/csharp/antlr.astframe/Makefile])

    # We have a Makefile that loops through all python examples.
    case $WITH_EXAMPLES in
      1)
        AC_CONFIG_FILES([examples/csharp/ASTsupport/Makefile])
        AC_CONFIG_FILES([examples/csharp/HTML/Makefile])
        AC_CONFIG_FILES([examples/csharp/IDL/Makefile])
        AC_CONFIG_FILES([examples/csharp/ParseTreeDebug/Makefile])
        AC_CONFIG_FILES([examples/csharp/TokenStreamRewrite/Makefile])
        AC_CONFIG_FILES([examples/csharp/calc/Makefile])
        AC_CONFIG_FILES([examples/csharp/columns/Makefile])
        AC_CONFIG_FILES([examples/csharp/exprAST/Makefile])
        AC_CONFIG_FILES([examples/csharp/filter/Makefile])
        AC_CONFIG_FILES([examples/csharp/filterWithRule/Makefile])
        AC_CONFIG_FILES([examples/csharp/heteroAST/Makefile])
        AC_CONFIG_FILES([examples/csharp/java/Makefile])
        AC_CONFIG_FILES([examples/csharp/multiLexer/Makefile])
        AC_CONFIG_FILES([examples/csharp/parseBinary/Makefile])
        AC_CONFIG_FILES([examples/csharp/preserveWhiteSpace/Makefile])
        AC_CONFIG_FILES([examples/csharp/tinyc/Makefile])
        AC_CONFIG_FILES([examples/csharp/unicode/Makefile])
        AC_CONFIG_FILES([examples/csharp/Makefile])
        ;;
    esac
    ;;
esac

# We need a script that wrap java calls in order to make Java
# ANTLR aware. This script needs to be executable.
AC_CONFIG_FILES(
  [scripts/java.sh],
  [${CHMOD} a+x scripts/java.sh])

# We need a script that wrap jar calls in order to make Java
# ANTLR aware. This script needs to be executable.
AC_CONFIG_FILES(
  [scripts/jar.sh],
  [${CHMOD} a+x scripts/jar.sh])

# We need a script that wrap javac calls in order to make Javac
# ANTLR aware. This script needs to be executable.
AC_CONFIG_FILES(
  [scripts/javac.sh],
  [${CHMOD} a+x scripts/javac.sh])

# We need a script that wraps antlr calls
AC_CONFIG_FILES(
  [scripts/antlr.sh],
  [${CHMOD} a+x scripts/antlr.sh])

case $LANG_CXX in
  1)
    # We need a script that wraps how we compile C++
    AC_CONFIG_FILES([scripts/cxx.sh],[${CHMOD} a+x scripts/cxx.sh])

    # # We need a script that wraps how we link C++
    AC_CONFIG_FILES([scripts/link.sh],[${CHMOD} a+x scripts/link.sh])

    # There's a few C files around so make sure we can compile those as well
    AC_CONFIG_FILES([scripts/c.sh],[${CHMOD} a+x scripts/c.sh])

     # We need a script that wraps how we build a (static?) library
    AC_CONFIG_FILES([scripts/lib.sh],[${CHMOD} a+x scripts/lib.sh])

    # We need a script that wraps how we run the preprocessor
    AC_CONFIG_FILES([scripts/cpp.sh],[${CHMOD} a+x scripts/cpp.sh])

    # C++ library
    AC_CONFIG_FILES([lib/cpp/Makefile])
    AC_CONFIG_FILES([lib/cpp/antlr/Makefile])
    AC_CONFIG_FILES([lib/cpp/src/Makefile])

    # C++ examples
    case $WITH_EXAMPLES in
      1)
        AC_CONFIG_FILES([examples/cpp/Makefile])
        AC_CONFIG_FILES([examples/cpp/ASTsupport/Makefile])
        AC_CONFIG_FILES([examples/cpp/calc/Makefile])
        AC_CONFIG_FILES([examples/cpp/exprAST/Makefile])
        AC_CONFIG_FILES([examples/cpp/filter/Makefile])
        AC_CONFIG_FILES([examples/cpp/filterWithRule/Makefile])
        AC_CONFIG_FILES([examples/cpp/flexLexer/Makefile])
        AC_CONFIG_FILES([examples/cpp/HTML/Makefile])
        AC_CONFIG_FILES([examples/cpp/heteroAST/Makefile])
        AC_CONFIG_FILES([examples/cpp/IDL/Makefile])
        AC_CONFIG_FILES([examples/cpp/imagNodeAST/Makefile])
        AC_CONFIG_FILES([examples/cpp/includeFile/Makefile])
        AC_CONFIG_FILES([examples/cpp/inherit.tinyc/Makefile])
        AC_CONFIG_FILES([examples/cpp/java/Makefile])
        AC_CONFIG_FILES([examples/cpp/lexRewrite/Makefile])
        AC_CONFIG_FILES([examples/cpp/multiLexer/Makefile])
        AC_CONFIG_FILES([examples/cpp/multiParser/Makefile])
        AC_CONFIG_FILES([examples/cpp/parseBinary/Makefile])
        AC_CONFIG_FILES([examples/cpp/preserveWhiteSpace/Makefile])
        AC_CONFIG_FILES([examples/cpp/tinyc/Makefile])
        AC_CONFIG_FILES([examples/cpp/tokenStreamRewrite/Makefile])
        AC_CONFIG_FILES([examples/cpp/transform/Makefile])
        AC_CONFIG_FILES([examples/cpp/treewalk/Makefile])
        AC_CONFIG_FILES([examples/cpp/unicode/Makefile])
        ;;
    esac
    ;;
esac

# Makefile to build supplementary libraries ..
AC_CONFIG_FILES([lib/Makefile])
case $WITH_EXAMPLES in
  1)
    AC_CONFIG_FILES([examples/Makefile])
    ;;
esac

AC_CONFIG_FILES([doc/Makefile])
AC_CONFIG_FILES([Makefile])
AC_CONFIG_FILES([scripts/antlr-config scripts/run-antlr scripts/antlr.spec])

case $LANG_JAVA in
  1)
    AC_CONFIG_FILES([antlr/Makefile])
    case $WITH_EXAMPLES in
      1)
        AC_CONFIG_FILES([examples/java/ASTsupport/Makefile])
        AC_CONFIG_FILES([examples/java/HTML/Makefile])
        AC_CONFIG_FILES([examples/java/IDL/Makefile])
        AC_CONFIG_FILES([examples/java/calc/Makefile])
        AC_CONFIG_FILES([examples/java/columns/Makefile])
        AC_CONFIG_FILES([examples/java/exprAST/Makefile])
        AC_CONFIG_FILES([examples/java/filter/Makefile])
        AC_CONFIG_FILES([examples/java/filterWithRule/Makefile])
        AC_CONFIG_FILES([examples/java/heteroAST/Makefile])
        AC_CONFIG_FILES([examples/java/imagNodeAST/Makefile])
        AC_CONFIG_FILES([examples/java/includeFile/Makefile])
        AC_CONFIG_FILES([examples/java/inherit.tinyc/Makefile])
        AC_CONFIG_FILES([examples/java/java/Makefile])
        AC_CONFIG_FILES([examples/java/lexRewrite/Makefile])
        AC_CONFIG_FILES([examples/java/linkChecker/Makefile])
        AC_CONFIG_FILES([examples/java/multiLexer/Makefile])
        AC_CONFIG_FILES([examples/java/parseBinary/Makefile])
        AC_CONFIG_FILES([examples/java/pascal/Makefile])
        AC_CONFIG_FILES([examples/java/preserveWhiteSpace/Makefile])
        AC_CONFIG_FILES([examples/java/tinybasic/Makefile])
        AC_CONFIG_FILES([examples/java/tinyc/Makefile])
        AC_CONFIG_FILES([examples/java/transform/Makefile])
        AC_CONFIG_FILES([examples/java/treewalk/Makefile])
        AC_CONFIG_FILES([examples/java/unicode.IDENTs/Makefile])
        AC_CONFIG_FILES([examples/java/unicode/Makefile])
        AC_CONFIG_FILES([examples/java/xml/Makefile])
        AC_CONFIG_FILES([examples/java/Makefile])
        AC_CONFIG_FILES([examples/java/cpp/Makefile])
        ;;
    esac

    ANTLR_ACTION_FILES=""
    ANTLR_ACTION_FILES="${ANTLR_ACTION_FILES} actions/cpp/ActionLexer.java"
    ANTLR_ACTION_FILES="${ANTLR_ACTION_FILES} actions/cpp/ActionLexerTokenTypes.java"
    ANTLR_ACTION_FILES="${ANTLR_ACTION_FILES} actions/csharp/ActionLexer.java"
    ANTLR_ACTION_FILES="${ANTLR_ACTION_FILES} actions/csharp/ActionLexerTokenTypes.java"
    ANTLR_ACTION_FILES="${ANTLR_ACTION_FILES} actions/java/ActionLexer.java"
    ANTLR_ACTION_FILES="${ANTLR_ACTION_FILES} actions/java/ActionLexerTokenTypes.java"
    ANTLR_ACTION_FILES="${ANTLR_ACTION_FILES} actions/python/ActionLexer.java"
    ANTLR_ACTION_FILES="${ANTLR_ACTION_FILES} actions/python/ActionLexerTokenTypes.java"
    ANTLR_ACTION_FILES="${ANTLR_ACTION_FILES} actions/python/CodeLexer.java"
    ANTLR_ACTION_FILES="${ANTLR_ACTION_FILES} actions/python/CodeLexerTokenTypes.java"

    ANTLR_ANTLR_FILES=""
    ANTLR_ANTLR_FILES="${ANTLR_ANTLR_FILES}   ANTLRParser.java"
    ANTLR_ANTLR_FILES="${ANTLR_ANTLR_FILES}   ANTLRTokenTypes.java"
    ANTLR_ANTLR_FILES="${ANTLR_ANTLR_FILES}   ANTLRLexer.java"

    ANTLR_TOKDEF_FILES=""
    ANTLR_TOKDEF_FILES="${ANTLR_TOKDEF_FILES} ANTLRTokdefParser.java"
    ANTLR_TOKDEF_FILES="${ANTLR_TOKDEF_FILES} ANTLRTokdefLexer.java"
    ANTLR_TOKDEF_FILES="${ANTLR_TOKDEF_FILES} ANTLRTokdefParserTokenTypes.java"

    ## This variables can be used in antlr/Makefile

    file_list="${ANTLR_ACTION_FILES} ${ANTLR_ANTLR_FILES} ${ANTLR_TOKDEF_FILES}"
    if test "x${file_list}" == "x" ; then
      :
    else
      ANTLR_CONFIG_FILES=""
      ANTLR_FILE_LIST=""

      ## iterate over my file list. If a file exists then  don't copy
      ## this file - autoconf's behaviour is to delete existing files.
      for x in ${file_list} ; do
        f="antlr/${x}"
        if test -f "${f}" ; then
          :
        else
          f="${f}:${f}"
          ANTLR_CONFIG_FILES="${ANTLR_CONFIG_FILES} ${f}"
          ANTLR_FILE_LIST="${ANTLR_FILE_LIST} antlr/${x}"
        fi
      done

      ## copy files into build directory and make them writeable  (in
      ## case we copy them from our depot. The actions necessary here
      ## to execute  a  command  (chmod)  on  a list  of files is bit
      ## hackish - it may depend  on autoconf version in  use  (works
      ## fine for autoconf 2.59).
      ## The problem is that autoconf takes the file list literally,
      ## ie. we end up in config.status by something like
      ##
      ##  case $ac_file in
      ##  ..
      ##  $ANTLR_CONFIG_FILES) chmod a+w .. ;;
      ##  esac
      ##
      ## To make this work I'm introducing ANTLR_CONFIG_FILES as kind
      ## of 'catch-all'  variable.  The  side   effect  is that every
      ## file with no explicit action will get a "chmod  a+w ..." But
      ## that should be ok for Makefiles etc.

      AC_CONFIG_FILES([
          ${ANTLR_CONFIG_FILES} ],[
          ### echo "config.status: chmod a+w ${ac_file} .."
          ${CHMOD} a+w "${ac_file}" ],[
          ANTLR_CONFIG_FILES='*'
          ANTLR_FILE_LIST="${ANTLR_FILE_LIST}"
          CHMOD="${CHMOD}"
        ]
      )
    fi
    ;;
esac

## compute basename of core libraries
antlr_jar=`basename ${ANTLR_JAR}`
antlr_net=`basename ${ANTLR_NET}`
antlr_lib=`basename ${ANTLR_LIB}`
antlr_py=`basename ${ANTLR_PY}`
astframe_net=`basename ${ASTFRAME_NET}`

test -z "${JAVA}" && {
  JAVA=java
}

### cygwin has no (supported) Java - users are requested to have java
### in their PATH in order to execute "bin/antlr.sh". To support this
### I'm making sure that just the basename is used.
case $host_os in
  *cygwin* |*mingw*|*msys*)
  AX_BASENAME([JAVA])
  ;;
esac

# we assume that we have standard rm arround. This should be checked.
RMF="$RM -r -f"

AC_OUTPUT
antlr-2.7.7/CHANGES.txt0000644000175000017500000001067210522211616014420 0ustar  twernertwernerChanges with Antlr 2.7.7 

# Terence Parr

* updated BaseAST.java to make the doWorkForAll method static. Same
behaviour, except no ClassCastExceptions when sibling.getFirstChild()
happens to return an AST that doesn't extend BaseAST.  Oliver Wong contributed
the patch.

* updated TokenStreamRewriteEngine.java to reflect bug fixes discovered
in v3 counterpart.

# Wolfgang Haefelinger
  * changing version to 2.7.7

  * configure*,scripts/csc.sh.in,*/AssemblyInfo.cs
    building of strong assemblies supported - default is building of 
    "weak" assemblies as before. Option --with-strong-assemblies=ARG
    enables strong assemblies (ARG must point to a keyfile). Such an
    assembly allows to be called by a partially trusted caller. This
    can be disabled by --disable-allow-partially-trusted-callers (if
    APTC is disabled, examples may not compile if located on network
    drive).

  * antlr/Makefile.in: couple of missing *.java files - missing in 2.7.6 - 
    added.

  * examples/cpp/heteroAST/*: fixed problem of missing include dir; example 
    compiles and tests fine.

  * examples/cpp/Makefile.in: enabled all directories (+ heteroAST and 
    flexLexer).

  * configure*, scripts/config.deps.in: fixes to reflect directory naming
    changes in C#.

  * examples/csharp/Makefile.in: disabled "broken" example HTML.
    
  * lib/python/antlr/antlr.py: fixed "hideen" type reported by Andrew
    McCulloh

Changes with Antlr 2.7.6

# Terence Parr
o added size, index methods to TokenStreamRewriteEngine.java

o bug in syn preds for tree parsers.  Submitted by Ole Kniemeyer.

o all Class.forName yanked out; uses thread context loader

o option to prevent System.exit termination

o added recover() method to lexers

o fixed code gen bug for syn preds in tree parsers.  Thanks to Marc Horowitz.

o BaseAST was not checking for null text in toString()

o Scott added java line ouput in code gen

o Prashant tweaked a few things for ANTLRStudio; a few new classes in ASdebug package

# Ric Klaren:

- Give errors if the user attempts to set k>1 in a TreeWalker

- Added missing Makefile.in for C++ heteroAST example and enabled it
  in configure.in

- Many small C++ support code and codegen tweaks fixes to increase
  portability. (Compaq Tru64 UNIX V5.1, VC's)

- Prevent '\' entering the bitset dump comments, might occur at end of
  line. Some compilers continue the comment to the next line (not sure
  if this is a compiler bug, should look it up)

For the thanks & kudos:

Among others thanks to Stuart Dootson, Bryan Ewbank, Kurt McCall and
a number of others who submitted patches. (my administration wasn't too
well this time)

# Wolfgang Haefelinger

  *) configure.* : support for 'fastjar' added  -fastjar will be preferred
     if jar and fastjar are available [geronimo, Nov 30th 2005].

  *) configure.*: fixed --with-bootclasspath error; configure --help
     incorrectly displayed this option as "--bootclasspath".  Thanks
     to Paul Jenner for reporting [geronimo, Nov 13th 2005].
      
  *) antlr/PythonCodeGenerator.java: fixed problems with raising 
     exceptions `SemanticException' and `MismatchedTokenException'
     unknown in current namespace. Thanks to Klaas Hofstra and 
     Benjamin Niemann for reporting [geronimo, Nov 13th 2005].

  *) examples/python/tinybasic/basic.g: fixed the unary MINUS problem
     reported by Klaas Hofstra [geronimo, Nov 13th 2005].

  *) configure*,scripts/[cxx|link].sh.in: Changes made by Kurt McCall
     added to support Tru64 Unix (version V5.1, Rev. 732) along with
     COMPAC/DEC CXX (version V6.5-042) [geronimo, Nov 13th 2005].

  *) antlr/PythonCodeGenerator.java: 'inputState.guessing' bug reported
     by Chris Minnoy and  Benjamin Niemann fixed [Mark Kole, Jul 4th 2005].

  *) lib/python/antlr/antlr.py: removed all 'tabs'; applied changes of patch
     `1126872211596/antlr.py.patch' regarding getting line and column number.
     Unknown patch contribution [geronimo, Nov 13th 2005].

# Changes for C# support (by Kunle Odutola & Micheal Jordan):

-- Fixed isssue where an empty input stream caused an exception in the lexer
due to the
   caching of LA1 and LA2. StringTemplate triggers this.

-- The rewind() method did not take into account the value of the case
insensitive flag.
   Reported by Dr. Hartmut Kocher.

--  ***BREAKING CHANGE*** ASTPair object pool had a race condition in
multi-threaded
    environments. ASTPair is now a struct.

--  C# examples now properly initialize the ASTFactory before a tree parser
is used.
antlr-2.7.7/lib/0000755000175000017500000000000010522211615013346 5ustar  twernertwernerantlr-2.7.7/lib/Makefile.in0000644000175000017500000000041610522211615015414 0ustar  twernertwerner###############################################################################
# $Id:$
###############################################################################
## do not change this value 
subdir=lib

@stdvars@

SUBDIRS = cpp python csharp

@stdmake@

@stddeps@
antlr-2.7.7/lib/python/0000755000175000017500000000000010522211615014667 5ustar  twernertwernerantlr-2.7.7/lib/python/Makefile.in0000644000175000017500000000260410522211615016736 0ustar  twernertwerner## do not change this value 
subdir=lib/python

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
@stdvars@
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx


PYTHON_SETUP = \
 setup.py \
 $(eol)

antlr_python_FILES = \
 $(eol)

all : 

test:

install: install-this

clean:

distclean: clean
	@RMF@ Makefile

antlr_py_DIR   = \
 $(datadir)/$(versioneddir)
 $(eol)

antlr_py_FILES = \
 @abs_top_srcdir@/lib/python/antlr/antlr.py \
 $(eol)

antlr_py1_FILES = \
 @abs_top_srcdir@/lib/python/antlr/__init__.py \
 @abs_top_srcdir@/lib/python/antlr/antlr.py \
 $(eol)

docdir   = $(datadir)/doc/$(versioneddir)
extradir = $(datadir)/$(versioneddir)

install-this:
	$(MKDIR) -p "$(antlr_py_DIR)"
	$(MKDIR) -p "$(libdir)"
	@@ECHO@ "install python files .. "
	@for f in $(antlr_py_FILES) ; do \
		@ECHO@ "install $${f}" ; \
		if test -f "$${f}" ; then \
			$(INSTALL) -m 444 "$${f}" "$(libdir)" ; \
		fi ;\
	done
	@for f in $(antlr_py1_FILES) ; do \
		@ECHO@ "install $${f}" ; \
		if test -f "$${f}" ; then \
			$(INSTALL) -m 444 "$${f}" "$(antlr_py_DIR)" ; \
		fi ;\
	done
	@f="$(objdir)/scripts/pyantlr.sh"; \
	if test -f "$${f}" ; then \
			@ECHO@ "install Python installer" ; \
			$(MKDIR) -p "$(sbindir)" ; \
			$(INSTALL) -m 555 "$${f}" "$(sbindir)" ; \
	fi


##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
@stddeps@
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
antlr-2.7.7/lib/python/setup.py0000644000175000017500000000051710522211615016404 0ustar  twernertwerner#!/usr/bin/env python

from distutils.core import setup

setup(name="antlr",
      version="2.7.5RC1",
      description="Python runtime support for ANTLR-generated parsers",
      author="Wolfgang Haefelinger / Marq Kole",
      author_email="ora.et.labora@web.de",
      url="http://www.antlr.org/",
      packages=['antlr'],
     )
antlr-2.7.7/lib/python/antlr/0000755000175000017500000000000010522211615016007 5ustar  twernertwernerantlr-2.7.7/lib/python/antlr/__init__.py0000644000175000017500000000025210522211615020117 0ustar  twernertwerner#
# ANTLR Translator Generator
# Project led by Terence Parr at http://www.jGuru.com
# Software rights: http://www.antlr.org/license.html
#
# $Id$
#

from antlr import *
antlr-2.7.7/lib/python/antlr/antlr.py0000644000175000017500000024123410522211615017507 0ustar  twernertwerner## This file is part of PyANTLR. See LICENSE.txt for license
## details..........Copyright (C) Wolfgang Haefelinger, 2004.

## get sys module
import sys

version = sys.version.split()[0]
if version < '2.2.1':
    False = 0
if version < '2.3':
    True = not False

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                     global symbols                             ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

### ANTLR Standard Tokens
SKIP                = -1
INVALID_TYPE        = 0
EOF_TYPE            = 1
EOF                 = 1
NULL_TREE_LOOKAHEAD = 3
MIN_USER_TYPE       = 4

### ANTLR's EOF Symbol
EOF_CHAR            = ''

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                    general functions                           ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

## Version should be automatically derived from configure.in. For now,
## we need to bump it ourselfs. Don't remove the  tags.
## 
def version():
    r = {
        'major'  : '2',
        'minor'  : '7',
        'micro'  : '5',
        'patch'  : '' ,
        'version': '2.7.5'
        }
    return r
## 

def error(fmt,*args):
    if fmt:
        print "error: ", fmt % tuple(args)

def ifelse(cond,_then,_else):
    if cond :
        r = _then
    else:
        r = _else
    return r

def is_string_type(x):
    return  (isinstance(x,str) or isinstance(x,unicode))

def assert_string_type(x):
    assert is_string_type(x)
    pass

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                     ANTLR Exceptions                           ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class ANTLRException(Exception):

    def __init__(self, *args):
        Exception.__init__(self, *args)


class RecognitionException(ANTLRException):

    def __init__(self, *args):
        ANTLRException.__init__(self, *args)
        self.fileName = None
        self.line = -1
        self.column = -1
        if len(args) >= 2:
            self.fileName = args[1]
        if len(args) >= 3:
            self.line = args[2]
        if len(args) >= 4:
            self.column = args[3]

    def __str__(self):
        buf = ['']
        if self.fileName:
            buf.append(self.fileName + ":")
        if self.line != -1:
            if not self.fileName:
                buf.append("line ")
            buf.append(str(self.line))
            if self.column != -1:
                buf.append(":" + str(self.column))
            buf.append(":")
        buf.append(" ")
        return str('').join(buf)

    __repr__ = __str__


class NoViableAltException(RecognitionException):

    def __init__(self, *args):
        RecognitionException.__init__(self, *args)
        self.token = None
        self.node  = None
        if isinstance(args[0],AST):
            self.node = args[0]
        elif isinstance(args[0],Token):
            self.token = args[0]
        else:
            raise TypeError("NoViableAltException requires Token or AST argument")

    def __str__(self):
        if self.token:
            line = self.token.getLine()
            col  = self.token.getColumn()
            text = self.token.getText()
            return "unexpected symbol at line %s (column %s): \"%s\"" % (line,col,text)
        if self.node == ASTNULL:
            return "unexpected end of subtree"
        assert self.node
        ### hackish, we assume that an AST contains method getText
        return "unexpected node: %s" % (self.node.getText())

    __repr__ = __str__


class NoViableAltForCharException(RecognitionException):

    def __init__(self, *args):
        self.foundChar = None
        if len(args) == 2:
            self.foundChar = args[0]
            scanner = args[1]
            RecognitionException.__init__(self, "NoViableAlt",
                                          scanner.getFilename(),
                                          scanner.getLine(),
                                          scanner.getColumn())
        elif len(args) == 4:
            self.foundChar = args[0]
            fileName = args[1]
            line = args[2]
            column = args[3]
            RecognitionException.__init__(self, "NoViableAlt",
                                          fileName, line, column)
        else:
            RecognitionException.__init__(self, "NoViableAlt",
                                          '', -1, -1)

    def __str__(self):
        mesg = "unexpected char: "
        if self.foundChar >= ' ' and self.foundChar <= '~':
            mesg += "'" + self.foundChar + "'"
        elif self.foundChar:
            mesg += "0x" + hex(ord(self.foundChar)).upper()[2:]
        else:
            mesg += ""
        return mesg

    __repr__ = __str__


class SemanticException(RecognitionException):

    def __init__(self, *args):
        RecognitionException.__init__(self, *args)


class MismatchedCharException(RecognitionException):

    NONE = 0
    CHAR = 1
    NOT_CHAR = 2
    RANGE = 3
    NOT_RANGE = 4
    SET = 5
    NOT_SET = 6

    def __init__(self, *args):
        self.args = args
        if len(args) == 5:
            # Expected range / not range
            if args[3]:
                self.mismatchType = MismatchedCharException.NOT_RANGE
            else:
                self.mismatchType = MismatchedCharException.RANGE
            self.foundChar = args[0]
            self.expecting = args[1]
            self.upper = args[2]
            self.scanner = args[4]
            RecognitionException.__init__(self, "Mismatched char range",
                                          self.scanner.getFilename(),
                                          self.scanner.getLine(),
                                          self.scanner.getColumn())
        elif len(args) == 4 and is_string_type(args[1]):
            # Expected char / not char
            if args[2]:
                self.mismatchType = MismatchedCharException.NOT_CHAR
            else:
                self.mismatchType = MismatchedCharException.CHAR
            self.foundChar = args[0]
            self.expecting = args[1]
            self.scanner = args[3]
            RecognitionException.__init__(self, "Mismatched char",
                                          self.scanner.getFilename(),
                                          self.scanner.getLine(),
                                          self.scanner.getColumn())
        elif len(args) == 4 and isinstance(args[1], BitSet):
            # Expected BitSet / not BitSet
            if args[2]:
                self.mismatchType = MismatchedCharException.NOT_SET
            else:
                self.mismatchType = MismatchedCharException.SET
            self.foundChar = args[0]
            self.set = args[1]
            self.scanner = args[3]
            RecognitionException.__init__(self, "Mismatched char set",
                                          self.scanner.getFilename(),
                                          self.scanner.getLine(),
                                          self.scanner.getColumn())
        else:
            self.mismatchType = MismatchedCharException.NONE
            RecognitionException.__init__(self, "Mismatched char")

    ## Append a char to the msg buffer.  If special,
    #  then show escaped version
    #
    def appendCharName(self, sb, c):
        if not c or c == 65535:
            # 65535 = (char) -1 = EOF
            sb.append("''")
        elif c == '\n':
            sb.append("'\\n'")
        elif c == '\r':
            sb.append("'\\r'");
        elif c == '\t':
            sb.append("'\\t'")
        else:
            sb.append('\'' + c + '\'')

    ##
    # Returns an error message with line number/column information
    #
    def __str__(self):
        sb = ['']
        sb.append(RecognitionException.__str__(self))

        if self.mismatchType == MismatchedCharException.CHAR:
            sb.append("expecting ")
            self.appendCharName(sb, self.expecting)
            sb.append(", found ")
            self.appendCharName(sb, self.foundChar)
        elif self.mismatchType == MismatchedCharException.NOT_CHAR:
            sb.append("expecting anything but '")
            self.appendCharName(sb, self.expecting)
            sb.append("'; got it anyway")
        elif self.mismatchType in [MismatchedCharException.RANGE, MismatchedCharException.NOT_RANGE]:
            sb.append("expecting char ")
            if self.mismatchType == MismatchedCharException.NOT_RANGE:
                sb.append("NOT ")
            sb.append("in range: ")
            appendCharName(sb, self.expecting)
            sb.append("..")
            appendCharName(sb, self.upper)
            sb.append(", found ")
            appendCharName(sb, self.foundChar)
        elif self.mismatchType in [MismatchedCharException.SET, MismatchedCharException.NOT_SET]:
            sb.append("expecting ")
            if self.mismatchType == MismatchedCharException.NOT_SET:
                sb.append("NOT ")
            sb.append("one of (")
            for i in range(len(self.set)):
                self.appendCharName(sb, self.set[i])
            sb.append("), found ")
            self.appendCharName(sb, self.foundChar)

        return str().join(sb).strip()

    __repr__ = __str__


class MismatchedTokenException(RecognitionException):

    NONE = 0
    TOKEN = 1
    NOT_TOKEN = 2
    RANGE = 3
    NOT_RANGE = 4
    SET = 5
    NOT_SET = 6

    def __init__(self, *args):
        self.args =  args
        self.tokenNames = []
        self.token = None
        self.tokenText = ''
        self.node =  None
        if len(args) == 6:
            # Expected range / not range
            if args[3]:
                self.mismatchType = MismatchedTokenException.NOT_RANGE
            else:
                self.mismatchType = MismatchedTokenException.RANGE
            self.tokenNames = args[0]
            self.expecting = args[2]
            self.upper = args[3]
            self.fileName = args[5]

        elif len(args) == 4 and isinstance(args[2], int):
            # Expected token / not token
            if args[3]:
                self.mismatchType = MismatchedTokenException.NOT_TOKEN
            else:
                self.mismatchType = MismatchedTokenException.TOKEN
            self.tokenNames = args[0]
            self.expecting = args[2]

        elif len(args) == 4 and isinstance(args[2], BitSet):
            # Expected BitSet / not BitSet
            if args[3]:
                self.mismatchType = MismatchedTokenException.NOT_SET
            else:
                self.mismatchType = MismatchedTokenException.SET
            self.tokenNames = args[0]
            self.set = args[2]

        else:
            self.mismatchType = MismatchedTokenException.NONE
            RecognitionException.__init__(self, "Mismatched Token: expecting any AST node", "", -1, -1)

        if len(args) >= 2:
            if isinstance(args[1],Token):
                self.token = args[1]
                self.tokenText = self.token.getText()
                RecognitionException.__init__(self, "Mismatched Token",
                                              self.fileName,
                                              self.token.getLine(),
                                              self.token.getColumn())
            elif isinstance(args[1],AST):
                self.node = args[1]
                self.tokenText = str(self.node)
                RecognitionException.__init__(self, "Mismatched Token",
                                              "",
                                              self.node.getLine(),
                                              self.node.getColumn())
            else:
                self.tokenText = ""
                RecognitionException.__init__(self, "Mismatched Token",
                                              "", -1, -1)

    def appendTokenName(self, sb, tokenType):
        if tokenType == INVALID_TYPE:
            sb.append("")
        elif tokenType < 0 or tokenType >= len(self.tokenNames):
            sb.append("<" + str(tokenType) + ">")
        else:
            sb.append(self.tokenNames[tokenType])

    ##
    # Returns an error message with line number/column information
    #
    def __str__(self):
        sb = ['']
        sb.append(RecognitionException.__str__(self))

        if self.mismatchType == MismatchedTokenException.TOKEN:
            sb.append("expecting ")
            self.appendTokenName(sb, self.expecting)
            sb.append(", found " + self.tokenText)
        elif self.mismatchType == MismatchedTokenException.NOT_TOKEN:
            sb.append("expecting anything but '")
            self.appendTokenName(sb, self.expecting)
            sb.append("'; got it anyway")
        elif self.mismatchType in [MismatchedTokenException.RANGE, MismatchedTokenException.NOT_RANGE]:
            sb.append("expecting token ")
            if self.mismatchType == MismatchedTokenException.NOT_RANGE:
                sb.append("NOT ")
            sb.append("in range: ")
            appendTokenName(sb, self.expecting)
            sb.append("..")
            appendTokenName(sb, self.upper)
            sb.append(", found " + self.tokenText)
        elif self.mismatchType in [MismatchedTokenException.SET, MismatchedTokenException.NOT_SET]:
            sb.append("expecting ")
            if self.mismatchType == MismatchedTokenException.NOT_SET:
                sb.append("NOT ")
            sb.append("one of (")
            for i in range(len(self.set)):
                self.appendTokenName(sb, self.set[i])
            sb.append("), found " + self.tokenText)

        return str().join(sb).strip()

    __repr__ = __str__


class TokenStreamException(ANTLRException):

    def __init__(self, *args):
        ANTLRException.__init__(self, *args)


# Wraps an Exception in a TokenStreamException
class TokenStreamIOException(TokenStreamException):

    def __init__(self, *args):
        if args and isinstance(args[0], Exception):
            io = args[0]
            TokenStreamException.__init__(self, str(io))
            self.io = io
        else:
            TokenStreamException.__init__(self, *args)
            self.io = self


# Wraps a RecognitionException in a TokenStreamException
class TokenStreamRecognitionException(TokenStreamException):

    def __init__(self, *args):
        if args and isinstance(args[0], RecognitionException):
            recog = args[0]
            TokenStreamException.__init__(self, str(recog))
            self.recog = recog
        else:
            raise TypeError("TokenStreamRecognitionException requires RecognitionException argument")

    def __str__(self):
        return str(self.recog)

    __repr__ = __str__


class TokenStreamRetryException(TokenStreamException):

    def __init__(self, *args):
        TokenStreamException.__init__(self, *args)


class CharStreamException(ANTLRException):

    def __init__(self, *args):
        ANTLRException.__init__(self, *args)


# Wraps an Exception in a CharStreamException
class CharStreamIOException(CharStreamException):

    def __init__(self, *args):
        if args and isinstance(args[0], Exception):
            io = args[0]
            CharStreamException.__init__(self, str(io))
            self.io = io
        else:
            CharStreamException.__init__(self, *args)
            self.io = self


class TryAgain(Exception):
    pass


###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       Token                                    ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class Token(object):
    SKIP                = -1
    INVALID_TYPE        = 0
    EOF_TYPE            = 1
    EOF                 = 1
    NULL_TREE_LOOKAHEAD = 3
    MIN_USER_TYPE       = 4

    def __init__(self,**argv):
        try:
            self.type = argv['type']
        except:
            self.type = INVALID_TYPE
        try:
            self.text = argv['text']
        except:
            self.text = ""

    def isEOF(self):
        return (self.type == EOF_TYPE)

    def getColumn(self):
        return 0

    def getLine(self):
        return 0

    def getFilename(self):
        return None

    def setFilename(self,name):
        return self

    def getText(self):
        return ""

    def setText(self,text):
        if is_string_type(text):
            pass
        else:
            raise TypeError("Token.setText requires string argument")
        return self

    def setColumn(self,column):
        return self

    def setLine(self,line):
        return self

    def getType(self):
        return self.type

    def setType(self,type):
        if isinstance(type,int):
            self.type = type
        else:
            raise TypeError("Token.setType requires integer argument")
        return self

    def toString(self):
        ## not optimal
        type_ = self.type
        if type_ == 3:
            tval = 'NULL_TREE_LOOKAHEAD'
        elif type_ == 1:
            tval = 'EOF_TYPE'
        elif type_ == 0:
            tval = 'INVALID_TYPE'
        elif type_ == -1:
            tval = 'SKIP'
        else:
            tval = type_
        return '["%s",<%s>]' % (self.getText(),tval)

    __str__ = toString
    __repr__ = toString

### static attribute ..
Token.badToken = Token( type=INVALID_TYPE, text="")

if __name__ == "__main__":
    print "testing .."
    T = Token.badToken
    print T

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       CommonToken                              ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class CommonToken(Token):

    def __init__(self,**argv):
        Token.__init__(self,**argv)
        self.line = 0
        self.col  = 0
        try:
            self.line = argv['line']
        except:
            pass
        try:
            self.col = argv['col']
        except:
            pass

    def getLine(self):
        return self.line

    def getText(self):
        return self.text

    def getColumn(self):
        return self.col

    def setLine(self,line):
        self.line = line
        return self

    def setText(self,text):
        self.text = text
        return self

    def setColumn(self,col):
        self.col = col
        return self

    def toString(self):
        ## not optimal
        type_ = self.type
        if type_ == 3:
            tval = 'NULL_TREE_LOOKAHEAD'
        elif type_ == 1:
            tval = 'EOF_TYPE'
        elif type_ == 0:
            tval = 'INVALID_TYPE'
        elif type_ == -1:
            tval = 'SKIP'
        else:
            tval = type_
        d = {
           'text' : self.text,
           'type' : tval,
           'line' : self.line,
           'colm' : self.col
           }

        fmt = '["%(text)s",<%(type)s>,line=%(line)s,col=%(colm)s]'
        return fmt % d

    __str__ = toString
    __repr__ = toString


if __name__ == '__main__' :
    T = CommonToken()
    print T
    T = CommonToken(col=15,line=1,text="some text", type=5)
    print T
    T = CommonToken()
    T.setLine(1).setColumn(15).setText("some text").setType(5)
    print T
    print T.getLine()
    print T.getColumn()
    print T.getText()
    print T.getType()

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                    CommonHiddenStreamToken                     ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class CommonHiddenStreamToken(CommonToken):
    def __init__(self,*args):
        CommonToken.__init__(self,*args)
        self.hiddenBefore = None
        self.hiddenAfter  = None

    def getHiddenAfter(self):
        return self.hiddenAfter

    def getHiddenBefore(self):
        return self.hiddenBefore

    def setHiddenAfter(self,t):
        self.hiddenAfter = t

    def setHiddenBefore(self, t):
        self.hiddenBefore = t

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       Queue                                    ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

## Shall be a circular buffer on tokens ..
class Queue(object):

    def __init__(self):
        self.buffer = [] # empty list

    def append(self,item):
        self.buffer.append(item)

    def elementAt(self,index):
        return self.buffer[index]

    def reset(self):
        self.buffer = []

    def removeFirst(self):
        self.buffer.pop(0)

    def length(self):
        return len(self.buffer)

    def __str__(self):
        return str(self.buffer)

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       InputBuffer                              ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class InputBuffer(object):
    def __init__(self):
        self.nMarkers = 0
        self.markerOffset = 0
        self.numToConsume = 0
        self.queue = Queue()

    def __str__(self):
        return "(%s,%s,%s,%s)" % (
           self.nMarkers,
           self.markerOffset,
           self.numToConsume,
           self.queue)

    def __repr__(self):
        return str(self)

    def commit(self):
        self.nMarkers -= 1

    def consume(self) :
        self.numToConsume += 1

    ## probably better to return a list of items
    ## because of unicode. Or return a unicode
    ## string ..
    def getLAChars(self) :
        i = self.markerOffset
        n = self.queue.length()
        s = ''
        while i 0:
            if self.nMarkers > 0:
                # guess mode -- leave leading characters and bump offset.
                self.markerOffset += 1
            else:
                # normal mode -- remove first character
                self.queue.removeFirst()
            self.numToConsume -= 1

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       CharBuffer                               ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class CharBuffer(InputBuffer):
    def __init__(self,reader):
        ##assert isinstance(reader,file)
        super(CharBuffer,self).__init__()
        ## a reader is supposed to be anything that has
        ## a method 'read(int)'.
        self.input = reader

    def __str__(self):
        base = super(CharBuffer,self).__str__()
        return "CharBuffer{%s,%s" % (base,str(input))

    def fill(self,amount):
        try:
            self.syncConsume()
            while self.queue.length() < (amount + self.markerOffset) :
                ## retrieve just one char - what happend at end
                ## of input?
                c = self.input.read(1)
                ### python's behaviour is to return the empty string  on
                ### EOF, ie. no exception whatsoever is thrown. An empty
                ### python  string  has  the  nice feature that it is of
                ### type 'str' and  "not ''" would return true. Contrary,
                ### one can't  do  this: '' in 'abc'. This should return
                ### false,  but all we  get  is  then  a TypeError as an
                ### empty string is not a character.

                ### Let's assure then that we have either seen a
                ### character or an empty string (EOF).
                assert len(c) == 0 or len(c) == 1

                ### And it shall be of type string (ASCII or UNICODE).
                assert is_string_type(c)

                ### Just append EOF char to buffer. Note that buffer may
                ### contain then just more than one EOF char ..

                ### use unicode chars instead of ASCII ..
                self.queue.append(c)
        except Exception,e:
            raise CharStreamIOException(e)
        ##except: # (mk) Cannot happen ...
            ##error ("unexpected exception caught ..")
            ##assert 0

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       LexerSharedInputState                    ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class LexerSharedInputState(object):
    def __init__(self,ibuf):
        assert isinstance(ibuf,InputBuffer)
        self.input = ibuf
        self.column = 1
        self.line = 1
        self.tokenStartColumn = 1
        self.tokenStartLine = 1
        self.guessing = 0
        self.filename = None

    def reset(self):
        self.column = 1
        self.line = 1
        self.tokenStartColumn = 1
        self.tokenStartLine = 1
        self.guessing = 0
        self.filename = None
        self.input.reset()

    def LA(self,k):
        return self.input.LA(k)

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                    TokenStream                                 ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class TokenStream(object):
    def nextToken(self):
        pass

    def __iter__(self):
        return TokenStreamIterator(self)

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                    TokenStreamIterator                                 ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class TokenStreamIterator(object):
    def __init__(self,inst):
        if isinstance(inst,TokenStream):
            self.inst = inst
            return
        raise TypeError("TokenStreamIterator requires TokenStream object")

    def next(self):
        assert self.inst
        item = self.inst.nextToken()
        if not item or item.isEOF():
            raise StopIteration()
        return item

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                    TokenStreamSelector                        ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class TokenStreamSelector(TokenStream):

    def __init__(self):
        self._input = None
        self._stmap = {}
        self._stack = []

    def addInputStream(self,stream,key):
        self._stmap[key] = stream

    def getCurrentStream(self):
        return self._input

    def getStream(self,sname):
        try:
            stream = self._stmap[sname]
        except:
            raise ValueError("TokenStream " + sname + " not found");
        return stream;

    def nextToken(self):
        while 1:
            try:
                return self._input.nextToken()
            except TokenStreamRetryException,r:
                ### just retry "forever"
                pass

    def pop(self):
        stream = self._stack.pop();
        self.select(stream);
        return stream;

    def push(self,arg):
        self._stack.append(self._input);
        self.select(arg)

    def retry(self):
        raise TokenStreamRetryException()

    def select(self,arg):
        if isinstance(arg,TokenStream):
            self._input = arg
            return
        if is_string_type(arg):
            self._input = self.getStream(arg)
            return
        raise TypeError("TokenStreamSelector.select requires " +
                        "TokenStream or string argument")

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                      TokenStreamBasicFilter                    ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class TokenStreamBasicFilter(TokenStream):

    def __init__(self,input):

        self.input = input;
        self.discardMask = BitSet()

    def discard(self,arg):
        if isinstance(arg,int):
            self.discardMask.add(arg)
            return
        if isinstance(arg,BitSet):
            self.discardMark = arg
            return
        raise TypeError("TokenStreamBasicFilter.discard requires" +
                        "integer or BitSet argument")

    def nextToken(self):
        tok = self.input.nextToken()
        while tok and self.discardMask.member(tok.getType()):
            tok = self.input.nextToken()
        return tok

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                      TokenStreamHiddenTokenFilter              ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class TokenStreamHiddenTokenFilter(TokenStreamBasicFilter):

    def __init__(self,input):
        TokenStreamBasicFilter.__init__(self,input)
        self.hideMask = BitSet()
        self.nextMonitoredToken = None
        self.lastHiddenToken = None
        self.firstHidden = None

    def consume(self):
        self.nextMonitoredToken = self.input.nextToken()

    def consumeFirst(self):
        self.consume()

        p = None;
        while self.hideMask.member(self.LA(1).getType()) or \
              self.discardMask.member(self.LA(1).getType()):
            if self.hideMask.member(self.LA(1).getType()):
                if not p:
                    p = self.LA(1)
                else:
                    p.setHiddenAfter(self.LA(1))
                    self.LA(1).setHiddenBefore(p)
                    p = self.LA(1)
                self.lastHiddenToken = p
                if not self.firstHidden:
                    self.firstHidden = p
            self.consume()

    def getDiscardMask(self):
        return self.discardMask

    def getHiddenAfter(self,t):
        return t.getHiddenAfter()

    def getHiddenBefore(self,t):
        return t.getHiddenBefore()

    def getHideMask(self):
        return self.hideMask

    def getInitialHiddenToken(self):
        return self.firstHidden

    def hide(self,m):
        if isinstance(m,int):
            self.hideMask.add(m)
            return
        if isinstance(m.BitMask):
            self.hideMask = m
            return

    def LA(self,i):
        return self.nextMonitoredToken

    def nextToken(self):
        if not self.LA(1):
            self.consumeFirst()

        monitored = self.LA(1)

        monitored.setHiddenBefore(self.lastHiddenToken)
        self.lastHiddenToken = None

        self.consume()
        p = monitored

        while self.hideMask.member(self.LA(1).getType()) or \
              self.discardMask.member(self.LA(1).getType()):
            if self.hideMask.member(self.LA(1).getType()):
                p.setHiddenAfter(self.LA(1))
                if p != monitored:
                    self.LA(1).setHiddenBefore(p)
                p = self.lastHiddenToken = self.LA(1)
            self.consume()
        return monitored

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       StringBuffer                             ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class StringBuffer:
    def __init__(self,string=None):
        if string:
            self.text = list(string)
        else:
            self.text = []

    def setLength(self,sz):
        if not sz :
            self.text = []
            return
        assert sz>0
        if sz >= self.length():
            return
        ### just reset to empty buffer
        self.text = self.text[0:sz]

    def length(self):
        return len(self.text)

    def append(self,c):
        self.text.append(c)

    ### return buffer as string. Arg 'a' is  used  as index
    ## into the buffer and 2nd argument shall be the length.
    ## If 2nd args is absent, we return chars till end of
    ## buffer starting with 'a'.
    def getString(self,a=None,length=None):
        if not a :
            a = 0
        assert a>=0
        if a>= len(self.text) :
            return ""

        if not length:
            ## no second argument
            L = self.text[a:]
        else:
            assert (a+length) <= len(self.text)
            b = a + length
            L = self.text[a:b]
        s = ""
        for x in L : s += x
        return s

    toString = getString ## alias

    def __str__(self):
        return str(self.text)

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       Reader                                   ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

## When reading Japanese chars, it happens that a stream returns a
## 'char' of length 2. This looks like  a  bug  in the appropriate
## codecs - but I'm  rather  unsure about this. Anyway, if this is
## the case, I'm going to  split  this string into a list of chars
## and put them  on  hold, ie. on a  buffer. Next time when called
## we read from buffer until buffer is empty.
## wh: nov, 25th -> problem does not appear in Python 2.4.0.c1.

class Reader(object):
    def __init__(self,stream):
        self.cin = stream
        self.buf = []

    def read(self,num):
        assert num==1

        if len(self.buf):
            return self.buf.pop()

        ## Read a char - this may return a string.
        ## Is this a bug in codecs/Python?
        c = self.cin.read(1)

        if not c or len(c)==1:
            return c

        L = list(c)
        L.reverse()
        for x in L:
            self.buf.append(x)

        ## read one char ..
        return self.read(1)

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       CharScanner                              ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class CharScanner(TokenStream):
    ## class members
    NO_CHAR = 0
    EOF_CHAR = ''  ### EOF shall be the empty string.

    def __init__(self, *argv, **kwargs):
        super(CharScanner, self).__init__()
        self.saveConsumedInput = True
        self.tokenClass = None
        self.caseSensitive = True
        self.caseSensitiveLiterals = True
        self.literals = None
        self.tabsize = 8
        self._returnToken = None
        self.commitToPath = False
        self.traceDepth = 0
        self.text = StringBuffer()
        self.hashString = hash(self)
        self.setTokenObjectClass(CommonToken)
        self.setInput(*argv)

    def __iter__(self):
        return CharScannerIterator(self)

    def setInput(self,*argv):
        ## case 1:
        ## if there's no arg we default to read from
        ## standard input
        if not argv:
            import sys
            self.setInput(sys.stdin)
            return

        ## get 1st argument
        arg1 = argv[0]

        ## case 2:
        ## if arg1 is a string,  we assume it's a file name
        ## and  open  a  stream  using 2nd argument as open
        ## mode. If there's no 2nd argument we fall back to
        ## mode '+rb'.
        if is_string_type(arg1):
            f = open(arg1,"rb")
            self.setInput(f)
            self.setFilename(arg1)
            return

        ## case 3:
        ## if arg1 is a file we wrap it by a char buffer (
        ## some additional checks?? No, can't do this in
        ## general).
        if isinstance(arg1,file):
            self.setInput(CharBuffer(arg1))
            return

        ## case 4:
        ## if arg1 is of type SharedLexerInputState we use
        ## argument as is.
        if isinstance(arg1,LexerSharedInputState):
            self.inputState = arg1
            return

        ## case 5:
        ## check whether argument type is of type input
        ## buffer. If so create a SharedLexerInputState and
        ## go ahead.
        if isinstance(arg1,InputBuffer):
            self.setInput(LexerSharedInputState(arg1))
            return

        ## case 6:
        ## check whether argument type has a method read(int)
        ## If so create CharBuffer ...
        try:
            if arg1.read:
                rd = Reader(arg1)
                cb = CharBuffer(rd)
                ss = LexerSharedInputState(cb)
                self.inputState = ss
            return
        except:
            pass

        ## case 7:
        ## raise wrong argument exception
        raise TypeError(argv)

    def setTabSize(self,size) :
        self.tabsize = size

    def getTabSize(self) :
        return self.tabsize

    def setCaseSensitive(self,t) :
        self.caseSensitive = t

    def setCommitToPath(self,commit) :
        self.commitToPath = commit

    def setFilename(self,f) :
        self.inputState.filename = f

    def setLine(self,line) :
        self.inputState.line = line

    def setText(self,s) :
        self.resetText()
        self.text.append(s)

    def getCaseSensitive(self) :
        return self.caseSensitive

    def getCaseSensitiveLiterals(self) :
        return self.caseSensitiveLiterals

    def getColumn(self) :
        return self.inputState.column

    def setColumn(self,c) :
        self.inputState.column = c

    def getCommitToPath(self) :
        return self.commitToPath

    def getFilename(self) :
        return self.inputState.filename

    def getInputBuffer(self) :
        return self.inputState.input

    def getInputState(self) :
        return self.inputState

    def setInputState(self,state) :
        assert isinstance(state,LexerSharedInputState)
        self.inputState = state

    def getLine(self) :
        return self.inputState.line

    def getText(self) :
        return str(self.text)

    def getTokenObject(self) :
        return self._returnToken

    def LA(self,i) :
        c = self.inputState.input.LA(i)
        if not self.caseSensitive:
            ### E0006
            c = c.__class__.lower(c)
        return c

    def makeToken(self,type) :
        try:
            ## dynamically load a class
            assert self.tokenClass
            tok = self.tokenClass()
            tok.setType(type)
            tok.setColumn(self.inputState.tokenStartColumn)
            tok.setLine(self.inputState.tokenStartLine)
            return tok
        except:
            self.panic("unable to create new token")
        return Token.badToken

    def mark(self) :
        return self.inputState.input.mark()

    def _match_bitset(self,b) :
        if b.member(self.LA(1)):
            self.consume()
        else:
            raise MismatchedCharException(self.LA(1), b, False, self)

    def _match_string(self,s) :
        for c in s:
            if self.LA(1) == c:
                self.consume()
            else:
                raise MismatchedCharException(self.LA(1), c, False, self)

    def match(self,item):
        if is_string_type(item):
            return self._match_string(item)
        else:
            return self._match_bitset(item)

    def matchNot(self,c) :
        if self.LA(1) != c:
            self.consume()
        else:
            raise MismatchedCharException(self.LA(1), c, True, self)

    def matchRange(self,c1,c2) :
        if self.LA(1) < c1 or self.LA(1) > c2 :
            raise MismatchedCharException(self.LA(1), c1, c2, False, self)
        else:
            self.consume()

    def newline(self) :
        self.inputState.line += 1
        self.inputState.column = 1

    def tab(self) :
        c = self.getColumn()
        nc = ( ((c-1)/self.tabsize) + 1) * self.tabsize + 1
        self.setColumn(nc)

    def panic(self,s='') :
        print "CharScanner: panic: " + s
        sys.exit(1)

    def reportError(self,ex) :
        print ex

    def reportError(self,s) :
        if not self.getFilename():
            print "error: " + str(s)
        else:
            print self.getFilename() + ": error: " + str(s)

    def reportWarning(self,s) :
        if not self.getFilename():
            print "warning: " + str(s)
        else:
            print self.getFilename() + ": warning: " + str(s)

    def resetText(self) :
        self.text.setLength(0)
        self.inputState.tokenStartColumn = self.inputState.column
        self.inputState.tokenStartLine = self.inputState.line

    def rewind(self,pos) :
        self.inputState.input.rewind(pos)

    def setTokenObjectClass(self,cl):
        self.tokenClass = cl

    def testForLiteral(self,token):
        if not token:
            return
        assert isinstance(token,Token)

        _type = token.getType()

        ## special tokens can't be literals
        if _type in [SKIP,INVALID_TYPE,EOF_TYPE,NULL_TREE_LOOKAHEAD] :
            return

        _text = token.getText()
        if not _text:
            return

        assert is_string_type(_text)
        _type = self.testLiteralsTable(_text,_type)
        token.setType(_type)
        return _type

    def testLiteralsTable(self,*args):
        if is_string_type(args[0]):
            s = args[0]
            i = args[1]
        else:
            s = self.text.getString()
            i = args[0]

        ## check whether integer has been given
        if not isinstance(i,int):
            assert isinstance(i,int)

        ## check whether we have a dict
        assert isinstance(self.literals,dict)
        try:
            ## E0010
            if not self.caseSensitiveLiterals:
                s = s.__class__.lower(s)
            i = self.literals[s]
        except:
            pass
        return i

    def toLower(self,c):
        return c.__class__.lower()

    def traceIndent(self):
        print ' ' * self.traceDepth

    def traceIn(self,rname):
        self.traceDepth += 1
        self.traceIndent()
        print "> lexer %s c== %s" % (rname,self.LA(1))

    def traceOut(self,rname):
        self.traceIndent()
        print "< lexer %s c== %s" % (rname,self.LA(1))
        self.traceDepth -= 1

    def uponEOF(self):
        pass

    def append(self,c):
        if self.saveConsumedInput :
            self.text.append(c)

    def commit(self):
        self.inputState.input.commit()

    def consume(self):
        if not self.inputState.guessing:
            c = self.LA(1)
            if self.caseSensitive:
                self.append(c)
            else:
                # use input.LA(), not LA(), to get original case
                # CharScanner.LA() would toLower it.
                c =  self.inputState.input.LA(1)
                self.append(c)

            if c and c in "\t":
                self.tab()
            else:
                self.inputState.column += 1
        self.inputState.input.consume()

    ## Consume chars until one matches the given char
    def consumeUntil_char(self,c):
        while self.LA(1) != EOF_CHAR and self.LA(1) != c:
            self.consume()

    ## Consume chars until one matches the given set
    def consumeUntil_bitset(self,bitset):
        while self.LA(1) != EOF_CHAR and not self.set.member(self.LA(1)):
            self.consume()

    ### If symbol seen is EOF then generate and set token, otherwise
    ### throw exception.
    def default(self,la1):
        if not la1 :
            self.uponEOF()
            self._returnToken = self.makeToken(EOF_TYPE)
        else:
            self.raise_NoViableAlt(la1)

    def filterdefault(self,la1,*args):
        if not la1:
            self.uponEOF()
            self._returnToken = self.makeToken(EOF_TYPE)
            return

        if not args:
            self.consume()
            raise TryAgain()
        else:
            ### apply filter object
            self.commit();
            try:
                func=args[0]
                args=args[1:]
                apply(func,args)
            except RecognitionException, e:
                ## catastrophic failure
                self.reportError(e);
                self.consume();
            raise TryAgain()

    def raise_NoViableAlt(self,la1=None):
        if not la1: la1 = self.LA(1)
        fname = self.getFilename()
        line  = self.getLine()
        col   = self.getColumn()
        raise NoViableAltForCharException(la1,fname,line,col)

    def set_return_token(self,_create,_token,_ttype,_offset):
        if _create and not _token and (not _ttype == SKIP):
            string = self.text.getString(_offset)
            _token = self.makeToken(_ttype)
            _token.setText(string)
        self._returnToken = _token
        return _token

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                   CharScannerIterator                          ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class CharScannerIterator:

    def __init__(self,inst):
        if isinstance(inst,CharScanner):
            self.inst = inst
            return
        raise TypeError("CharScannerIterator requires CharScanner object")

    def next(self):
        assert self.inst
        item = self.inst.nextToken()
        if not item or item.isEOF():
            raise StopIteration()
        return item

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       BitSet                                   ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

### I'm assuming here that a long is 64bits. It appears however, that
### a long is of any size. That means we can use a single long as the
### bitset (!), ie. Python would do almost all the work (TBD).

class BitSet(object):
    BITS     = 64
    NIBBLE   = 4
    LOG_BITS = 6
    MOD_MASK = BITS -1

    def __init__(self,data=None):
        if not data:
            BitSet.__init__(self,[long(0)])
            return
        if isinstance(data,int):
            BitSet.__init__(self,[long(data)])
            return
        if isinstance(data,long):
            BitSet.__init__(self,[data])
            return
        if not isinstance(data,list):
            raise TypeError("BitSet requires integer, long, or " +
                            "list argument")
        for x in data:
            if not isinstance(x,long):
                raise TypeError(self,"List argument item is " +
                                "not a long: %s" % (x))
        self.data = data

    def __str__(self):
        bits = len(self.data) * BitSet.BITS
        s = ""
        for i in xrange(0,bits):
            if self.at(i):
                s += "1"
            else:
                s += "o"
            if not ((i+1) % 10):
                s += '|%s|' % (i+1)
        return s

    def __repr__(self):
        return str(self)

    def member(self,item):
        if not item:
            return False

        if isinstance(item,int):
            return self.at(item)

        if not is_string_type(item):
            raise TypeError(self,"char or unichar expected: %s" % (item))

        ## char is a (unicode) string with at most lenght 1, ie.
        ## a char.

        if len(item) != 1:
            raise TypeError(self,"char expected: %s" % (item))

        ### handle ASCII/UNICODE char
        num = ord(item)

        ### check whether position num is in bitset
        return self.at(num)

    def wordNumber(self,bit):
        return bit >> BitSet.LOG_BITS

    def bitMask(self,bit):
        pos = bit & BitSet.MOD_MASK  ## bit mod BITS
        return (1L << pos)

    def set(self,bit,on=True):
        # grow bitset as required (use with care!)
        i = self.wordNumber(bit)
        mask = self.bitMask(bit)
        if i>=len(self.data):
            d = i - len(self.data) + 1
            for x in xrange(0,d):
                self.data.append(0L)
            assert len(self.data) == i+1
        if on:
            self.data[i] |=  mask
        else:
            self.data[i] &= (~mask)

    ### make add an alias for set
    add = set

    def off(self,bit,off=True):
        self.set(bit,not off)

    def at(self,bit):
        i = self.wordNumber(bit)
        v = self.data[i]
        m = self.bitMask(bit)
        return v & m


###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                      some further funcs                        ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

def illegalarg_ex(func):
    raise ValueError(
       "%s is only valid if parser is built for debugging" %
       (func.func_name))

def runtime_ex(func):
    raise RuntimeException(
       "%s is only valid if parser is built for debugging" %
       (func.func_name))

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       TokenBuffer                              ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class TokenBuffer(object):
    def __init__(self,stream):
        self.input = stream
        self.nMarkers = 0
        self.markerOffset = 0
        self.numToConsume = 0
        self.queue = Queue()

    def reset(self) :
        self.nMarkers = 0
        self.markerOffset = 0
        self.numToConsume = 0
        self.queue.reset()

    def consume(self) :
        self.numToConsume += 1

    def fill(self, amount):
        self.syncConsume()
        while self.queue.length() < (amount + self.markerOffset):
            self.queue.append(self.input.nextToken())

    def getInput(self):
        return self.input

    def LA(self,k) :
        self.fill(k)
        return self.queue.elementAt(self.markerOffset + k - 1).type

    def LT(self,k) :
        self.fill(k)
        return self.queue.elementAt(self.markerOffset + k - 1)

    def mark(self) :
        self.syncConsume()
        self.nMarkers += 1
        return self.markerOffset

    def rewind(self,mark) :
        self.syncConsume()
        self.markerOffset = mark
        self.nMarkers -= 1

    def syncConsume(self) :
        while self.numToConsume > 0:
            if self.nMarkers > 0:
                # guess mode -- leave leading characters and bump offset.
                self.markerOffset += 1
            else:
                # normal mode -- remove first character
                self.queue.removeFirst()
            self.numToConsume -= 1

    def __str__(self):
        return "(%s,%s,%s,%s,%s)" % (
           self.input,
           self.nMarkers,
           self.markerOffset,
           self.numToConsume,
           self.queue)

    def __repr__(self):
        return str(self)

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       ParserSharedInputState                   ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class ParserSharedInputState(object):

    def __init__(self):
        self.input = None
        self.reset()

    def reset(self):
        self.guessing = 0
        self.filename = None
        if self.input:
            self.input.reset()

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       Parser                                   ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class Parser(object):

    def __init__(self, *args, **kwargs):
        self.tokenNames = None
        self.returnAST  = None
        self.astFactory = None
        self.tokenTypeToASTClassMap = {}
        self.ignoreInvalidDebugCalls = False
        self.traceDepth = 0
        if not args:
            self.inputState = ParserSharedInputState()
            return
        arg0 = args[0]
        assert isinstance(arg0,ParserSharedInputState)
        self.inputState = arg0
        return

    def getTokenTypeToASTClassMap(self):
        return self.tokenTypeToASTClassMap


    def addMessageListener(self, l):
        if not self.ignoreInvalidDebugCalls:
            illegalarg_ex(addMessageListener)

    def addParserListener(self,l) :
        if (not self.ignoreInvalidDebugCalls) :
            illegalarg_ex(addParserListener)

    def addParserMatchListener(self, l) :
        if (not self.ignoreInvalidDebugCalls) :
            illegalarg_ex(addParserMatchListener)

    def addParserTokenListener(self, l) :
        if (not self.ignoreInvalidDebugCalls):
            illegalarg_ex(addParserTokenListener)

    def addSemanticPredicateListener(self, l) :
        if (not self.ignoreInvalidDebugCalls):
            illegalarg_ex(addSemanticPredicateListener)

    def addSyntacticPredicateListener(self, l) :
        if (not self.ignoreInvalidDebugCalls):
            illegalarg_ex(addSyntacticPredicateListener)

    def addTraceListener(self, l) :
        if (not self.ignoreInvalidDebugCalls):
            illegalarg_ex(addTraceListener)

    def consume(self):
        raise NotImplementedError()

    def _consumeUntil_type(self,tokenType):
        while self.LA(1) != EOF_TYPE and self.LA(1) != tokenType:
            self.consume()

    def _consumeUntil_bitset(self, set):
        while self.LA(1) != EOF_TYPE and not set.member(self.LA(1)):
            self.consume()

    def consumeUntil(self,arg):
        if isinstance(arg,int):
            self._consumeUntil_type(arg)
        else:
            self._consumeUntil_bitset(arg)

    def defaultDebuggingSetup(self):
        pass

    def getAST(self) :
        return self.returnAST

    def getASTFactory(self) :
        return self.astFactory

    def getFilename(self) :
        return self.inputState.filename

    def getInputState(self) :
        return self.inputState

    def setInputState(self, state) :
        self.inputState = state

    def getTokenName(self,num) :
        return self.tokenNames[num]

    def getTokenNames(self) :
        return self.tokenNames

    def isDebugMode(self) :
        return self.false

    def LA(self, i):
        raise NotImplementedError()

    def LT(self, i):
        raise NotImplementedError()

    def mark(self):
        return self.inputState.input.mark()

    def _match_int(self,t):
        if (self.LA(1) != t):
            raise MismatchedTokenException(
               self.tokenNames, self.LT(1), t, False, self.getFilename())
        else:
            self.consume()

    def _match_set(self, b):
        if (not b.member(self.LA(1))):
            raise MismatchedTokenException(
               self.tokenNames,self.LT(1), b, False, self.getFilename())
        else:
            self.consume()

    def match(self,set) :
        if isinstance(set,int):
            self._match_int(set)
            return
        if isinstance(set,BitSet):
            self._match_set(set)
            return
        raise TypeError("Parser.match requires integer ot BitSet argument")

    def matchNot(self,t):
        if self.LA(1) == t:
            raise MismatchedTokenException(
               tokenNames, self.LT(1), t, True, self.getFilename())
        else:
            self.consume()

    def removeMessageListener(self, l) :
        if (not self.ignoreInvalidDebugCalls):
            runtime_ex(removeMessageListener)

    def removeParserListener(self, l) :
        if (not self.ignoreInvalidDebugCalls):
            runtime_ex(removeParserListener)

    def removeParserMatchListener(self, l) :
        if (not self.ignoreInvalidDebugCalls):
            runtime_ex(removeParserMatchListener)

    def removeParserTokenListener(self, l) :
        if (not self.ignoreInvalidDebugCalls):
            runtime_ex(removeParserTokenListener)

    def removeSemanticPredicateListener(self, l) :
        if (not self.ignoreInvalidDebugCalls):
            runtime_ex(removeSemanticPredicateListener)

    def removeSyntacticPredicateListener(self, l) :
        if (not self.ignoreInvalidDebugCalls):
            runtime_ex(removeSyntacticPredicateListener)

    def removeTraceListener(self, l) :
        if (not self.ignoreInvalidDebugCalls):
            runtime_ex(removeTraceListener)

    def reportError(self,x) :
        fmt = "syntax error:"
        f = self.getFilename()
        if f:
            fmt = ("%s:" % f) + fmt
        if isinstance(x,Token):
            line = x.getColumn()
            col  = x.getLine()
            text = x.getText()
            fmt  = fmt + 'unexpected symbol at line %s (column %s) : "%s"'
            print >>sys.stderr, fmt % (line,col,text)
        else:
            print >>sys.stderr, fmt,str(x)

    def reportWarning(self,s):
        f = self.getFilename()
        if f:
            print "%s:warning: %s" % (f,str(x))
        else:
            print "warning: %s" % (str(x))

    def rewind(self, pos) :
        self.inputState.input.rewind(pos)

    def setASTFactory(self, f) :
        self.astFactory = f

    def setASTNodeClass(self, cl) :
        self.astFactory.setASTNodeType(cl)

    def setASTNodeType(self, nodeType) :
        self.setASTNodeClass(nodeType)

    def setDebugMode(self, debugMode) :
        if (not self.ignoreInvalidDebugCalls):
            runtime_ex(setDebugMode)

    def setFilename(self, f) :
        self.inputState.filename = f

    def setIgnoreInvalidDebugCalls(self, value) :
        self.ignoreInvalidDebugCalls = value

    def setTokenBuffer(self, t) :
        self.inputState.input = t

    def traceIndent(self):
        print " " * self.traceDepth

    def traceIn(self,rname):
        self.traceDepth += 1
        self.trace("> ", rname)

    def traceOut(self,rname):
        self.trace("< ", rname)
        self.traceDepth -= 1

    ### wh: moved from ASTFactory to Parser
    def addASTChild(self,currentAST, child):
        if not child:
            return
        if not currentAST.root:
            currentAST.root = child
        elif not currentAST.child:
            currentAST.root.setFirstChild(child)
        else:
            currentAST.child.setNextSibling(child)
        currentAST.child = child
        currentAST.advanceChildToEnd()

    ### wh: moved from ASTFactory to Parser
    def makeASTRoot(self,currentAST,root) :
        if root:
            ### Add the current root as a child of new root
            root.addChild(currentAST.root)
            ### The new current child is the last sibling of the old root
            currentAST.child = currentAST.root
            currentAST.advanceChildToEnd()
            ### Set the new root
            currentAST.root = root

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       LLkParser                                ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class LLkParser(Parser):

    def __init__(self, *args, **kwargs):
        try:
            arg1 = args[0]
        except:
            arg1 = 1

        if isinstance(arg1,int):
            super(LLkParser,self).__init__()
            self.k = arg1
            return

        if isinstance(arg1,ParserSharedInputState):
            super(LLkParser,self).__init__(arg1)
            self.set_k(1,*args)
            return

        if isinstance(arg1,TokenBuffer):
            super(LLkParser,self).__init__()
            self.setTokenBuffer(arg1)
            self.set_k(1,*args)
            return

        if isinstance(arg1,TokenStream):
            super(LLkParser,self).__init__()
            tokenBuf = TokenBuffer(arg1)
            self.setTokenBuffer(tokenBuf)
            self.set_k(1,*args)
            return

        ### unknown argument
        raise TypeError("LLkParser requires integer, " +
                        "ParserSharedInputStream or TokenStream argument")

    def consume(self):
        self.inputState.input.consume()

    def LA(self,i):
        return self.inputState.input.LA(i)

    def LT(self,i):
        return self.inputState.input.LT(i)

    def set_k(self,index,*args):
        try:
            self.k = args[index]
        except:
            self.k = 1

    def trace(self,ee,rname):
        print type(self)
        self.traceIndent()
        guess = ""
        if self.inputState.guessing > 0:
            guess = " [guessing]"
        print(ee + rname + guess)
        for i in xrange(1,self.k+1):
            if i != 1:
                print(", ")
            if self.LT(i) :
                v = self.LT(i).getText()
            else:
                v = "null"
            print "LA(%s) == %s" % (i,v)
        print("\n")

    def traceIn(self,rname):
        self.traceDepth += 1;
        self.trace("> ", rname);

    def traceOut(self,rname):
        self.trace("< ", rname);
        self.traceDepth -= 1;

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                    TreeParserSharedInputState                  ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class TreeParserSharedInputState(object):
    def __init__(self):
        self.guessing = 0

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       TreeParser                               ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class TreeParser(object):

    def __init__(self, *args, **kwargs):
        self.inputState = TreeParserSharedInputState()
        self._retTree   = None
        self.tokenNames = []
        self.returnAST  = None
        self.astFactory = ASTFactory()
        self.traceDepth = 0

    def getAST(self):
        return self.returnAST

    def getASTFactory(self):
        return self.astFactory

    def getTokenName(self,num) :
        return self.tokenNames[num]

    def getTokenNames(self):
        return self.tokenNames

    def match(self,t,set) :
        assert isinstance(set,int) or isinstance(set,BitSet)
        if not t or t == ASTNULL:
            raise MismatchedTokenException(self.getTokenNames(), t,set, False)

        if isinstance(set,int) and t.getType() != set:
            raise MismatchedTokenException(self.getTokenNames(), t,set, False)

        if isinstance(set,BitSet) and not set.member(t.getType):
            raise MismatchedTokenException(self.getTokenNames(), t,set, False)

    def matchNot(self,t, ttype) :
        if not t or (t == ASTNULL) or (t.getType() == ttype):
            raise MismatchedTokenException(getTokenNames(), t, ttype, True)

    def reportError(self,ex):
        print >>sys.stderr,"error:",ex

    def  reportWarning(self, s):
        print "warning:",s

    def setASTFactory(self,f):
        self.astFactory = f

    def setASTNodeType(self,nodeType):
        self.setASTNodeClass(nodeType)

    def setASTNodeClass(self,nodeType):
        self.astFactory.setASTNodeType(nodeType)

    def traceIndent(self):
        print " " * self.traceDepth

    def traceIn(self,rname,t):
        self.traceDepth += 1
        self.traceIndent()
        print("> " + rname + "(" +
              ifelse(t,str(t),"null") + ")" +
              ifelse(self.inputState.guessing>0,"[guessing]",""))

    def traceOut(self,rname,t):
        self.traceIndent()
        print("< " + rname + "(" +
              ifelse(t,str(t),"null") + ")" +
              ifelse(self.inputState.guessing>0,"[guessing]",""))
        self.traceDepth -= 1

    ### wh: moved from ASTFactory to TreeParser
    def addASTChild(self,currentAST, child):
        if not child:
            return
        if not currentAST.root:
            currentAST.root = child
        elif not currentAST.child:
            currentAST.root.setFirstChild(child)
        else:
            currentAST.child.setNextSibling(child)
        currentAST.child = child
        currentAST.advanceChildToEnd()

    ### wh: moved from ASTFactory to TreeParser
    def makeASTRoot(self,currentAST,root):
        if root:
            ### Add the current root as a child of new root
            root.addChild(currentAST.root)
            ### The new current child is the last sibling of the old root
            currentAST.child = currentAST.root
            currentAST.advanceChildToEnd()
            ### Set the new root
            currentAST.root = root

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###               funcs to work on trees                           ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

def rightmost(ast):
    if ast:
        while(ast.right):
            ast = ast.right
    return ast

def cmptree(s,t,partial):
    while(s and t):
        ### as a quick optimization, check roots first.
        if not s.equals(t):
            return False

        ### if roots match, do full list match test on children.
        if not cmptree(s.getFirstChild(),t.getFirstChild(),partial):
            return False

        s = s.getNextSibling()
        t = t.getNextSibling()

    r = ifelse(partial,not t,not s and not t)
    return r

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                          AST                                   ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class AST(object):
    def __init__(self):
        pass

    def addChild(self, c):
        pass

    def equals(self, t):
        return False

    def equalsList(self, t):
        return False

    def equalsListPartial(self, t):
        return False

    def equalsTree(self, t):
        return False

    def equalsTreePartial(self, t):
        return False

    def findAll(self, tree):
        return None

    def findAllPartial(self, subtree):
        return None

    def getFirstChild(self):
        return self

    def getNextSibling(self):
        return self

    def getText(self):
        return ""

    def getType(self):
        return INVALID_TYPE

    def getLine(self):
        return 0

    def getColumn(self):
        return 0

    def getNumberOfChildren(self):
        return 0

    def initialize(self, t, txt):
        pass

    def initialize(self, t):
        pass

    def setFirstChild(self, c):
        pass

    def setNextSibling(self, n):
        pass

    def setText(self, text):
        pass

    def setType(self, ttype):
        pass

    def toString(self):
        self.getText()

    __str__ = toString

    def toStringList(self):
        return self.getText()

    def toStringTree(self):
        return self.getText()

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       ASTNULLType                              ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

### There is only one instance of this class **/
class ASTNULLType(AST):
    def __init__(self):
        AST.__init__(self)
        pass

    def getText(self):
        return ""

    def getType(self):
        return NULL_TREE_LOOKAHEAD


###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       BaseAST                                  ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class BaseAST(AST):

    verboseStringConversion = False
    tokenNames = None

    def __init__(self):
        self.down  = None ## kid
        self.right = None ## sibling

    def addChild(self,node):
        if node:
            t = rightmost(self.down)
            if t:
                t.right = node
            else:
                assert not self.down
                self.down = node

    def getNumberOfChildren(self):
        t = self.down
        n = 0
        while t:
            n += 1
            t = t.right
        return n

    def doWorkForFindAll(self,v,target,partialMatch):
        sibling = self

        while sibling:
            c1 = partialMatch and sibling.equalsTreePartial(target)
            if c1:
                v.append(sibling)
            else:
                c2 = not partialMatch and sibling.equalsTree(target)
                if c2:
                    v.append(sibling)

            ### regardless of match or not, check any children for matches
            if sibling.getFirstChild():
                sibling.getFirstChild().doWorkForFindAll(v,target,partialMatch)

            sibling = sibling.getNextSibling()

    ### Is node t equal to 'self' in terms of token type and text?
    def equals(self,t):
        if not t:
            return False
        return self.getText() == t.getText() and self.getType() == t.getType()

    ### Is t an exact structural and equals() match of this tree.  The
    ### 'self' reference is considered the start of a sibling list.
    ###
    def equalsList(self, t):
        return cmptree(self, t, partial=False)

    ### Is 't' a subtree of this list?
    ### The siblings of the root are NOT ignored.
    ###
    def equalsListPartial(self,t):
        return cmptree(self,t,partial=True)

    ### Is tree rooted at 'self' equal to 't'?  The siblings
    ### of 'self' are ignored.
    ###
    def equalsTree(self, t):
        return self.equals(t) and \
               cmptree(self.getFirstChild(), t.getFirstChild(), partial=False)

    ### Is 't' a subtree of the tree rooted at 'self'?  The siblings
    ### of 'self' are ignored.
    ###
    def equalsTreePartial(self, t):
        if not t:
            return True
        return self.equals(t) and cmptree(
           self.getFirstChild(), t.getFirstChild(), partial=True)

    ### Walk the tree looking for all exact subtree matches.  Return
    ### an ASTEnumerator that lets the caller walk the list
    ### of subtree roots found herein.
    def findAll(self,target):
        roots = []

        ### the empty tree cannot result in an enumeration
        if not target:
            return None
        # find all matches recursively
        self.doWorkForFindAll(roots, target, False)
        return roots

    ### Walk the tree looking for all subtrees.  Return
    ###  an ASTEnumerator that lets the caller walk the list
    ###  of subtree roots found herein.
    def findAllPartial(self,sub):
        roots = []

        ### the empty tree cannot result in an enumeration
        if not sub:
            return None

        self.doWorkForFindAll(roots, sub, True)  ### find all matches recursively
        return roots

    ### Get the first child of this node None if not children
    def getFirstChild(self):
        return self.down

    ### Get the next sibling in line after this one
    def getNextSibling(self):
        return self.right

    ### Get the token text for this node
    def getText(self):
        return ""

    ### Get the token type for this node
    def getType(self):
        return 0

    def getLine(self):
        return 0

    def getColumn(self):
        return 0

    ### Remove all children */
    def removeChildren(self):
        self.down = None

    def setFirstChild(self,c):
        self.down = c

    def setNextSibling(self, n):
        self.right = n

    ### Set the token text for this node
    def setText(self, text):
        pass

    ### Set the token type for this node
    def setType(self, ttype):
        pass

    ### static
    def setVerboseStringConversion(verbose,names):
        verboseStringConversion = verbose
        tokenNames = names
    setVerboseStringConversion = staticmethod(setVerboseStringConversion)

    ### Return an array of strings that maps token ID to it's text.
    ##  @since 2.7.3
    def getTokenNames():
        return tokenNames

    def toString(self):
        return self.getText()

    ### return tree as lisp string - sibling included
    def toStringList(self):
        ts = self.toStringTree()
        sib = self.getNextSibling()
        if sib:
            ts += sib.toStringList()
        return ts

    __str__ = toStringList

    ### return tree as string - siblings ignored
    def toStringTree(self):
        ts = ""
        kid = self.getFirstChild()
        if kid:
            ts += " ("
        ts += " " + self.toString()
        if kid:
            ts += kid.toStringList()
            ts += " )"
        return ts

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       CommonAST                                ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

### Common AST node implementation
class CommonAST(BaseAST):
    def __init__(self,token=None):
        super(CommonAST,self).__init__()
        self.ttype = INVALID_TYPE
        self.text  = ""
        self.line  = 0
        self.column= 0
        self.initialize(token)
        #assert self.text

    ### Get the token text for this node
    def getText(self):
        return self.text

    ### Get the token type for this node
    def getType(self):
        return self.ttype
    
    ### Get the line for this node
    def getLine(self):
        return self.line

    ### Get the column for this node
    def getColumn(self):
        return self.column
    
    def initialize(self,*args):
        if not args:
            return

        arg0 = args[0]

        if isinstance(arg0,int):
            arg1 = args[1]
            self.setType(arg0)
            self.setText(arg1)
            return

        if isinstance(arg0,AST) or isinstance(arg0,Token):
            self.setText(arg0.getText())
            self.setType(arg0.getType())
            self.line = arg0.getLine()
            self.column = arg0.getColumn()
            return

    ### Set the token text for this node
    def setText(self,text_):
        assert is_string_type(text_)
        self.text = text_

    ### Set the token type for this node
    def setType(self,ttype_):
        assert isinstance(ttype_,int)
        self.ttype = ttype_

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                     CommonASTWithHiddenTokens                  ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class CommonASTWithHiddenTokens(CommonAST):

    def __init__(self,*args):
        CommonAST.__init__(self,*args)
        self.hiddenBefore = None
        self.hiddenAfter  = None

    def getHiddenAfter(self):
        return self.hiddenAfter

    def getHiddenBefore(self):
        return self.hiddenBefore

    def initialize(self,*args):
        CommonAST.initialize(self,*args)
        if args and isinstance(args[0],Token):
            assert isinstance(args[0],CommonHiddenStreamToken)
            self.hiddenBefore = args[0].getHiddenBefore()
            self.hiddenAfter  = args[0].getHiddenAfter()

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       ASTPair                                  ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class ASTPair(object):
    def __init__(self):
        self.root = None          ### current root of tree
        self.child = None         ### current child to which siblings are added

    ### Make sure that child is the last sibling */
    def advanceChildToEnd(self):
        if self.child:
            while self.child.getNextSibling():
                self.child = self.child.getNextSibling()

    ### Copy an ASTPair.  Don't call it clone() because we want type-safety */
    def copy(self):
        tmp = ASTPair()
        tmp.root = self.root
        tmp.child = self.child
        return tmp

    def toString(self):
        r = ifelse(not root,"null",self.root.getText())
        c = ifelse(not child,"null",self.child.getText())
        return "[%s,%s]" % (r,c)

    __str__ = toString
    __repr__ = toString


###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       ASTFactory                               ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class ASTFactory(object):
    def __init__(self,table=None):
        self._class = None
        self._classmap = ifelse(table,table,None)

    def create(self,*args):
        if not args:
            return self.create(INVALID_TYPE)

        arg0 = args[0]
        arg1 = None
        arg2 = None

        try:
            arg1 = args[1]
            arg2 = args[2]
        except:
            pass

        # ctor(int)
        if isinstance(arg0,int) and not arg2:
            ### get class for 'self' type
            c = self.getASTNodeType(arg0)
            t = self.create(c)
            if t:
                t.initialize(arg0, ifelse(arg1,arg1,""))
            return t

        # ctor(int,something)
        if isinstance(arg0,int) and arg2:
            t = self.create(arg2)
            if t:
                t.initialize(arg0,arg1)
            return t

        # ctor(AST)
        if isinstance(arg0,AST):
            t = self.create(arg0.getType())
            if t:
                t.initialize(arg0)
            return t

        # ctor(token)
        if isinstance(arg0,Token) and not arg1:
            ttype = arg0.getType()
            assert isinstance(ttype,int)
            t = self.create(ttype)
            if t:
                t.initialize(arg0)
            return t

        # ctor(token,class)
        if isinstance(arg0,Token) and arg1:
            assert isinstance(arg1,type)
            assert issubclass(arg1,AST)
            # this creates instance of 'arg1' using 'arg0' as
            # argument. Wow, that's magic!
            t = arg1(arg0)
            assert t and isinstance(t,AST)
            return t

        # ctor(class)
        if isinstance(arg0,type):
            ### next statement creates instance of type (!)
            t = arg0()
            assert isinstance(t,AST)
            return t


    def setASTNodeClass(self,className=None):
        if not className:
            return
        assert isinstance(className,type)
        assert issubclass(className,AST)
        self._class = className

    ### kind of misnomer - use setASTNodeClass instead.
    setASTNodeType = setASTNodeClass

    def getASTNodeClass(self):
        return self._class



    def getTokenTypeToASTClassMap(self):
        return self._classmap

    def setTokenTypeToASTClassMap(self,amap):
        self._classmap = amap

    def error(self, e):
        import sys
        print >> sys.stderr, e

    def setTokenTypeASTNodeType(self, tokenType, className):
        """
        Specify a mapping between a token type and a (AST) class.
        """
        if not self._classmap:
            self._classmap = {}

        if not className:
            try:
                del self._classmap[tokenType]
            except:
                pass
        else:
            ### here we should also perform actions to ensure that
            ### a. class can be loaded
            ### b. class is a subclass of AST
            ###
            assert isinstance(className,type)
            assert issubclass(className,AST)  ## a & b
            ### enter the class
            self._classmap[tokenType] = className

    def getASTNodeType(self,tokenType):
        """
        For a given token type return the AST node type. First we
        lookup a mapping table, second we try _class
        and finally we resolve to "antlr.CommonAST".
        """

        # first
        if self._classmap:
            try:
                c = self._classmap[tokenType]
                if c:
                    return c
            except:
                pass
        # second
        if self._class:
            return self._class

        # default
        return CommonAST

    ### methods that have been moved to file scope - just listed
    ### here to be somewhat consistent with original API
    def dup(self,t):
        return antlr.dup(t,self)

    def dupList(self,t):
        return antlr.dupList(t,self)

    def dupTree(self,t):
        return antlr.dupTree(t,self)

    ### methods moved to other classes
    ### 1. makeASTRoot  -> Parser
    ### 2. addASTChild  -> Parser

    ### non-standard: create alias for longish method name
    maptype = setTokenTypeASTNodeType

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###                       ASTVisitor                               ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

class ASTVisitor(object):
    def __init__(self,*args):
        pass

    def visit(self,ast):
        pass

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###
###               static methods and variables                     ###
###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx###

ASTNULL = ASTNULLType()

### wh: moved from ASTFactory as there's nothing ASTFactory-specific
### in this method.
def make(*nodes):
    if not nodes:
        return None

    for i in xrange(0,len(nodes)):
        node = nodes[i]
        if node:
            assert isinstance(node,AST)

    root = nodes[0]
    tail = None
    if root:
        root.setFirstChild(None)

    for i in xrange(1,len(nodes)):
        if not nodes[i]:
            continue
        if not root:
            root = tail = nodes[i]
        elif not tail:
            root.setFirstChild(nodes[i])
            tail = root.getFirstChild()
        else:
            tail.setNextSibling(nodes[i])
            tail = tail.getNextSibling()

        ### Chase tail to last sibling
        while tail.getNextSibling():
            tail = tail.getNextSibling()
    return root

def dup(t,factory):
    if not t:
        return None

    if factory:
        dup_t = factory.create(t.__class__)
    else:
        raise TypeError("dup function requires ASTFactory argument")
    dup_t.initialize(t)
    return dup_t

def dupList(t,factory):
    result = dupTree(t,factory)
    nt = result
    while t:
        ## for each sibling of the root
        t = t.getNextSibling()
        nt.setNextSibling(dupTree(t,factory))
        nt = nt.getNextSibling()
    return result

def dupTree(t,factory):
    result = dup(t,factory)
    if t:
        result.setFirstChild(dupList(t.getFirstChild(),factory))
    return result

###xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
### $Id: antlr.py,v 1.1.1.1 2005/02/02 10:24:36 geronimo Exp $

# Local Variables:    ***
# mode: python        ***
# py-indent-offset: 4 ***
# End:                ***
antlr-2.7.7/lib/csharp/0000755000175000017500000000000010522211615014626 5ustar  twernertwernerantlr-2.7.7/lib/csharp/Makefile.in0000644000175000017500000000037010522211615016673 0ustar  twernertwerner###############################################################################
# $Id:$
###############################################################################
## do not change this value 
subdir=lib/csharp

@stdvars@

@stdmake@

@stddeps@
antlr-2.7.7/lib/csharp/antlr.net-runtime.sln0000644000175000017500000000342310522211615020734 0ustar  twernertwernerMicrosoft Visual Studio Solution File, Format Version 7.00
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "JavaParser", "..\..\examples\csharp\java\JavaParser.csproj", "{A2DB8AF5-4C4B-4F6D-94D1-A6610E1D21B6}"
EndProject
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "antlr.runtime", "antlr.runtime\antlr.runtime.csproj", "{CB7CC882-ED47-46C0-AAAE-7A437F22F1C6}"
EndProject
Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "antlr.astframe", "antlr.astframe\antlr.astframe.csproj", "{AAFA5AC9-5967-443D-A564-71236163239D}"
EndProject
Global
	GlobalSection(SolutionConfiguration) = preSolution
		ConfigName.0 = Debug
		ConfigName.1 = Release
	EndGlobalSection
	GlobalSection(ProjectDependencies) = postSolution
	EndGlobalSection
	GlobalSection(ProjectConfiguration) = postSolution
		{A2DB8AF5-4C4B-4F6D-94D1-A6610E1D21B6}.Debug.ActiveCfg = Debug|.NET
		{A2DB8AF5-4C4B-4F6D-94D1-A6610E1D21B6}.Debug.Build.0 = Debug|.NET
		{A2DB8AF5-4C4B-4F6D-94D1-A6610E1D21B6}.Release.ActiveCfg = Release|.NET
		{A2DB8AF5-4C4B-4F6D-94D1-A6610E1D21B6}.Release.Build.0 = Release|.NET
		{CB7CC882-ED47-46C0-AAAE-7A437F22F1C6}.Debug.ActiveCfg = Debug|.NET
		{CB7CC882-ED47-46C0-AAAE-7A437F22F1C6}.Debug.Build.0 = Debug|.NET
		{CB7CC882-ED47-46C0-AAAE-7A437F22F1C6}.Release.ActiveCfg = Release|.NET
		{CB7CC882-ED47-46C0-AAAE-7A437F22F1C6}.Release.Build.0 = Release|.NET
		{AAFA5AC9-5967-443D-A564-71236163239D}.Debug.ActiveCfg = Debug|.NET
		{AAFA5AC9-5967-443D-A564-71236163239D}.Debug.Build.0 = Debug|.NET
		{AAFA5AC9-5967-443D-A564-71236163239D}.Release.ActiveCfg = Release|.NET
		{AAFA5AC9-5967-443D-A564-71236163239D}.Release.Build.0 = Release|.NET
	EndGlobalSection
	GlobalSection(ExtensibilityGlobals) = postSolution
	EndGlobalSection
	GlobalSection(ExtensibilityAddIns) = postSolution
	EndGlobalSection
EndGlobal
antlr-2.7.7/lib/csharp/antlr.runtime.build0000755000175000017500000002140510522211615020456 0ustar  twernertwerner

	
	
	

	
    	
    	
    	
    	
    	

    	
    	
    	
    	
    	
    	
    	

    	
    	
    	
    	
		
		

    	
  	


  	
  	
  	
  	
  	
    	
    	
    	
    	
    	
    	
    	
    	
    	
    	
    	
    	
    	
    	
  	



	
		
		
		

		
		
		
	

	
		
		
		

		
		
		
	

    
        
    

    
        
    

    
        
        

        
        
            
                
                
            
				              
            	
				              					
				
        

        
        

        
        
            
                
                
            
				              
	            	
					
					
					
				              					
				
        
    

    
        
        
            
                
            
            
                
                    
                    
                    
                    
                    
                    
                    
                    
                    
                    
                    
                    
                    
                    
                    
                    
                    
                    
                    
                    
                              
             
        
        
        
    

    
        
        
            
                
                
                
                
                
                
            
        
    

antlr-2.7.7/lib/csharp/antlr.astframe/0000755000175000017500000000000010522211615017547 5ustar  twernertwernerantlr-2.7.7/lib/csharp/antlr.astframe/Makefile.in0000644000175000017500000000377510522211615021630 0ustar  twernertwerner##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
@stdvars@
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx

## do not change this value 
subdir=lib/csharp/antlr.astframe

all :: lib

lib: @astframe_net@

## Get all files in directory.
antlr_cs_FILES = $(shell @FIND@ $(_srcdir) -name \*.cs)


## Next rule is about to compile antlr.astframe.dll. The  whole
## rule looks bit complicated.
## - First we remove the target. Later we check then  wether the
## target has really been created. Due  to  experience  we don't
## trust our tool's exit code.
## - Our target depends on antlr.runtime.dll and  so  we need to
## add (+) it via appropriate environment variable  CSHARPCFLAGS.
## - Then we check whether target really has been made.
## - Finally we  make  sure to update ASTFRAME_NET. ASTFRAME_NET 
## may point anywhere in the filesystem, especially also in this
## directory. We can't therefore remove ASTFRAME_NET as astframe_
## net and ASTFRAME_NET can be identical. To avoid this we make
## a copy of astframe_net which dies not clash with ASTFRAME_NET
## by adding the  process  id  to  the filename. Finally we copy 
## and remove temporaries.
 @astframe_net@ : $(antlr_cs_FILES) @ANTLR_NET@
	@-@RMF@ $@
	@ @CSHARP_COMPILE_CMD@  $@ $(antlr_cs_FILES)
	@test -f $@ || exit 1
	@ @CP@ $@ $@.$$$$ && @RMF@ @ASTFRAME_NET@ ; \
		@CP@ $@.$$$$ @ASTFRAME_NET@ ; \
		@CP@ @ASTFRAME_NET@ $@ ; \
	  @RMF@ $@.$$$$

clean ::
	@RMF@ *.obj *.o *.a  *.lib *.so *.dll *~ @astframe_net@ @ASTFRAME_NET@

distclean :: clean
	@RMF@ Makefile

## install our target ..
install :: @ASTFRAME_NET@ 
	@$(MKDIR) -p "$(libdir)"
	@@ECHO@ "install C# core files .. "
	@for f in @ASTFRAME_NET@  ; do \
		@ECHO@ "install $${f}" ; \
		if test -f "$${f}" ; then \
			$(INSTALL) -m 444 "$${f}" "$(libdir)" ; \
			$(INSTALL) -m 444 "$${f}" "$(datadir)/$(versioneddir)" ; \
		fi ;\
	done

## dependencies
@astframe_net@        : Makefile
@astframe_net@        : @abs_this_builddir@/scripts/csc.sh

## other dependencies to be listed below
@stddeps@
antlr-2.7.7/lib/csharp/antlr.astframe/antlr.astframe.csproj0000644000175000017500000001043610522211615023716 0ustar  twernertwerner
    
        
            
                
                
            
            
                
                
                
                
            
        
        
            
                
                
                
                
                
            
        
    


antlr-2.7.7/lib/csharp/antlr.astframe/antlr.debug.misc/0000755000175000017500000000000010522211615022706 5ustar  twernertwernerantlr-2.7.7/lib/csharp/antlr.astframe/antlr.debug.misc/ASTFrame.resx0000644000175000017500000001230610522211615025215 0ustar  twernertwerner



  

  

    

      

        

          

            

              

                

                

              

              

              

              

            

          

          

            

              

                

              

              

            

          

        

      

    

  

  

    text/microsoft-resx

  

  

    1.3

  

  

    System.Resources.ResXResourceReader, System.Windows.Forms, Version=1.0.3300.0, Culture=neutral, PublicKeyToken=b77a5c561934e089

  

  

    System.Resources.ResXResourceWriter, System.Windows.Forms, Version=1.0.3300.0, Culture=neutral, PublicKeyToken=b77a5c561934e089

  

  

    ASTFrame

  

antlr-2.7.7/lib/csharp/antlr.astframe/antlr.debug.misc/ASTFrame.cs0000644000175000017500000000533410522211615024644 0ustar  twernertwernerusing System;
using System.Drawing;
//using System.Collections;
//using System.ComponentModel;
using System.Windows.Forms;

//using antlr;
using AST = antlr.collections.AST;

namespace antlr.debug.misc
{
	/// 
	/// Summary description for myASTFrame.
	/// 
	public class ASTFrame : System.Windows.Forms.Form
	{
		// The initial width and height of the frame
		private const int WIDTH = 200;
		private const int HEIGHT = 300;

		/// 
		/// Required designer variable.
		/// 
		private System.ComponentModel.Container components = null;

		private ASTFrame()
		{
			//
			// Required for Windows Form Designer support
			//
			InitializeComponent();

			//
			// TODO: Add any constructor code after InitializeComponent call
			//
			this.Size = new System.Drawing.Size(WIDTH,HEIGHT);
			Application.ApplicationExit += new EventHandler(Form_OnExit);
		}

		public ASTFrame(string title, AST rootAST) : this()
		{
			this.Text = title;

			JTreeASTPanel treePanel = new JTreeASTPanel(new TreeViewEventHandler(tree_AfterSelect), rootAST);			
			this.Controls.Add(treePanel);
			treePanel.Location= new Point(5, 5);
			treePanel.Dock=DockStyle.Fill;
			treePanel.Anchor=AnchorStyles.Top|AnchorStyles.Left;
		}

		private void Form_OnExit(object sender, EventArgs e)
		{
			this.Visible = false;
			this.Dispose();
		}

		private void tree_AfterSelect(object sender, TreeViewEventArgs e)
		{
			//System.Console.Out.WriteLine("Selected: " + e.Node.Text);

			string path = e.Node.FullPath;
			path = path.Replace(e.Node.TreeView.PathSeparator, "->");
			//System.Console.Out.WriteLine(e.Node.FullPath); 
		}

		/// 
		/// Clean up any resources being used.
		/// 
		protected override void Dispose( bool disposing )
		{
			if( disposing )
			{
				if(components != null)
				{
					components.Dispose();
				}
			}
			base.Dispose( disposing );
		}

		public static void Main(string[] args)
		{
			// Create the tree nodes
			ASTFactory factory = new ASTFactory();
			CommonAST r = (CommonAST) factory.create(0, "ROOT");
			r.addChild((CommonAST) factory.create(0, "C1"));
			r.addChild((CommonAST) factory.create(0, "C2"));
			r.addChild((CommonAST) factory.create(0, "C3"));
			
			ASTFrame frame = new ASTFrame("AST JTree Example", r);
			Application.Run(frame);
		}

		#region Windows Form Designer generated code
		/// 
		/// Required method for Designer support - do not modify
		/// the contents of this method with the code editor.
		/// 
		private void InitializeComponent()
		{
			// 
			// ASTFrame
			// 
			this.AutoScaleBaseSize = new System.Drawing.Size(5, 13);
			this.ClientSize = new System.Drawing.Size(292, 273);
			this.Name = "ASTFrame";
			this.Text = "ASTFrame";

		}
		#endregion
	}
}
antlr-2.7.7/lib/csharp/antlr.astframe/antlr.debug.misc/JTreeASTPanel.resx0000644000175000017500000001231310522211615026152 0ustar  twernertwerner



  

  

    

      

        

          

            

              

                

                

              

              

              

              

            

          

          

            

              

                

              

              

            

          

        

      

    

  

  

    text/microsoft-resx

  

  

    1.3

  

  

    System.Resources.ResXResourceReader, System.Windows.Forms, Version=1.0.3300.0, Culture=neutral, PublicKeyToken=b77a5c561934e089

  

  

    System.Resources.ResXResourceWriter, System.Windows.Forms, Version=1.0.3300.0, Culture=neutral, PublicKeyToken=b77a5c561934e089

  

  

    JTreeASTPanel

  

antlr-2.7.7/lib/csharp/antlr.astframe/antlr.debug.misc/JTreeASTPanel.cs0000644000175000017500000000566410522211615025611 0ustar  twernertwernerusing System;
//using System.Collections;
//using System.ComponentModel;
//using System.Drawing;
//using System.Data;
using System.Windows.Forms;

using AST = antlr.collections.AST;

namespace antlr.debug.misc
{
	/// 
	/// Summary description for myJTreeASTPanel.
	/// 
	public class JTreeASTPanel : System.Windows.Forms.UserControl
	{
		private System.Windows.Forms.TreeView tree;
		///  
		/// Required designer variable.
		/// 
		private System.ComponentModel.Container components = null;

		private JTreeASTPanel()
		{
			// This call is required by the Windows.Forms Form Designer.
			InitializeComponent();

			// TODO: Add any initialization after the InitForm call

		}

		public JTreeASTPanel(TreeViewEventHandler afterSelectHandler, AST rootAST) : this()
		{
			tree.AfterSelect += afterSelectHandler;
			tree.BeforeExpand += new TreeViewCancelEventHandler(ASTTreeNode.tree_BeforeExpand);
			tree.Nodes.Add(new ASTTreeNode(rootAST));
		}

		///  
		/// Clean up any resources being used.
		/// 
		protected override void Dispose( bool disposing )
		{
			if( disposing )
			{
				if(components != null)
				{
					components.Dispose();
				}
			}
			base.Dispose( disposing );
		}

		#region Component Designer generated code
		///  
		/// Required method for Designer support - do not modify 
		/// the contents of this method with the code editor.
		/// 
		private void InitializeComponent()
		{
			this.tree = new System.Windows.Forms.TreeView();
			this.SuspendLayout();
			// 
			// tree
			// 
			this.tree.Dock = System.Windows.Forms.DockStyle.Fill;
			this.tree.ImageIndex = -1;
			this.tree.ImeMode = System.Windows.Forms.ImeMode.NoControl;
			this.tree.Location = new System.Drawing.Point(5, 5);
			this.tree.Name = "tree";
			this.tree.SelectedImageIndex = -1;
			this.tree.Size = new System.Drawing.Size(140, 140);
			this.tree.TabIndex = 0;
			// 
			// JTreeASTPanel
			// 
			this.Controls.AddRange(new System.Windows.Forms.Control[] {
																		  this.tree});
			this.DockPadding.All = 5;
			this.Name = "JTreeASTPanel";
			this.ResumeLayout(false);

		}
		#endregion

	}

	internal class ASTTreeNode : TreeNode
	{
		private  AST	ASTNode_;
		internal bool	IsAlreadyExpanded = false;

		public AST ASTNode
		{
			get { return ASTNode_;  }
			set { ASTNode_ = value; }
		}

		public ASTTreeNode(AST a)
		{
			ASTNode_ = a;
			this.Text = a.ToString();
			this.Nodes.Add("Loading.....");
		}

		internal static void tree_BeforeExpand(object sender, TreeViewCancelEventArgs e)
		{
			ASTTreeNode thisNode   = (ASTTreeNode)e.Node;
			AST			parentAST  = thisNode.ASTNode;
			AST			childAST;

			if (!thisNode.IsAlreadyExpanded)
			{
				thisNode.Nodes.Clear();
				childAST = parentAST.getFirstChild();
				while (null != childAST)
				{
					thisNode.Nodes.Add(new ASTTreeNode(childAST));
					childAST = childAST.getNextSibling();
				}
				thisNode.IsAlreadyExpanded = true;
			}
		}

	}
}
antlr-2.7.7/lib/csharp/antlr.astframe/AssemblyInfo.cs0000644000175000017500000000227110522211615022473 0ustar  twernertwernerusing System;
using System.Reflection;
using System.Runtime.CompilerServices;

// General Information about an assembly is controlled through the following
// set of attributes. Change these attribute values to modify the information
// associated with an assembly.

// TODO: Review the values of the assembly attributes

[assembly: AssemblyTitle("antlr.astframe")]
[assembly: AssemblyDescription("ANTLR ASTFrame for .NET")]
[assembly: AssemblyCompany("www.antlr.org")]
[assembly: AssemblyProduct("")]
[assembly: AssemblyCopyright("")]
[assembly: AssemblyTrademark("")]
[assembly: AssemblyCulture("")]

[assembly: AssemblyVersion("2.7.7.01")]


// Version information for an assembly consists of the following four values:
//
//      Major Version
//      Minor Version
//      Revision
//      Build Number
//
// You can specify all the values or you can default the Revision and Build Numbers
// by using the '*' as shown below:

[assembly: CLSCompliantAttribute(true)]

#if STRONGNAME
#pragma warning disable 1699
[assembly: AssemblyDelaySign(false)]
[assembly: AssemblyKeyFile("org.antlr.snk")]
#pragma warning restore 1699
#endif


#if APTC
[assembly: System.Security.AllowPartiallyTrustedCallers]
#endifantlr-2.7.7/lib/csharp/antlr.runtime/0000755000175000017500000000000010522211615017430 5ustar  twernertwernerantlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/0000755000175000017500000000000010522211615021635 5ustar  twernertwernerantlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/Listener.cs0000755000175000017500000000023010522211615023747 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	

	public interface Listener
	{
		void  doneParsing	(object source, TraceEventArgs e);
		void  refresh		();
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/DebuggingCharScanner.cs0000755000175000017500000001734310522211615026202 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	using System.Threading;
	using antlr;

	using BitSet	= antlr.collections.impl.BitSet;
	
	public abstract class DebuggingCharScanner : CharScanner, DebuggingParser
	{
		private void  InitBlock()
		{
			eventSupport = new ScannerEventSupport(this);
		}
		public virtual void setDebugMode(bool mode)
		{
			_notDebugMode = !mode;
		}

		private ScannerEventSupport eventSupport;
		private bool _notDebugMode = false;
		protected internal string[] ruleNames;
		protected internal string[] semPredNames;
		
		
		public DebuggingCharScanner(InputBuffer cb) : base(cb)
		{
			InitBlock();
		}
		public DebuggingCharScanner(LexerSharedInputState state) : base(state)
		{
			InitBlock();
		}
		public virtual void  addMessageListener(MessageListener l)
		{
			eventSupport.addMessageListener(l);
		}
		public virtual void  addNewLineListener(NewLineListener l)
		{
			eventSupport.addNewLineListener(l);
		}
		public virtual void  addParserListener(ParserListener l)
		{
			eventSupport.addParserListener(l);
		}
		public virtual void  addParserMatchListener(ParserMatchListener l)
		{
			eventSupport.addParserMatchListener(l);
		}
		public virtual void  addParserTokenListener(ParserTokenListener l)
		{
			eventSupport.addParserTokenListener(l);
		}
		public virtual void  addSemanticPredicateListener(SemanticPredicateListener l)
		{
			eventSupport.addSemanticPredicateListener(l);
		}
		public virtual void  addSyntacticPredicateListener(SyntacticPredicateListener l)
		{
			eventSupport.addSyntacticPredicateListener(l);
		}
		public virtual void  addTraceListener(TraceListener l)
		{
			eventSupport.addTraceListener(l);
		}
		public override void  consume()
		{
			int la_1 = - 99;
			try
			{
				la_1 = LA(1);
			}
			catch (CharStreamException)
			{
			}
			base.consume();
			eventSupport.fireConsume(la_1);
		}
		protected internal virtual void  fireEnterRule(int num, int data)
		{
			if (isDebugMode())
				eventSupport.fireEnterRule(num, inputState.guessing, data);
		}
		protected internal virtual void  fireExitRule(int num, int ttype)
		{
			if (isDebugMode())
				eventSupport.fireExitRule(num, inputState.guessing, ttype);
		}
		protected internal virtual bool fireSemanticPredicateEvaluated(int type, int num, bool condition)
		{
			if (isDebugMode())
				return eventSupport.fireSemanticPredicateEvaluated(type, num, condition, inputState.guessing);
			else
				return condition;
		}
		protected internal virtual void  fireSyntacticPredicateFailed()
		{
			if (isDebugMode())
				eventSupport.fireSyntacticPredicateFailed(inputState.guessing);
		}
		protected internal virtual void  fireSyntacticPredicateStarted()
		{
			if (isDebugMode())
				eventSupport.fireSyntacticPredicateStarted(inputState.guessing);
		}
		protected internal virtual void  fireSyntacticPredicateSucceeded()
		{
			if (isDebugMode())
				eventSupport.fireSyntacticPredicateSucceeded(inputState.guessing);
		}
		public virtual string getRuleName(int num)
		{
			return ruleNames[num];
		}
		public virtual string getSemPredName(int num)
		{
			return semPredNames[num];
		}
		public virtual void  goToSleep()
		{
			lock(this)
			{
				try
				{
					Monitor.Wait(this);
				}
				catch (System.Threading.ThreadInterruptedException)
				{
				}
			}
		}
		public virtual bool isDebugMode()
		{
			return !_notDebugMode;
		}
		public override char LA(int i)
		{
			char la = base.LA(i);
			eventSupport.fireLA(i, la);
			return la;
		}
		protected internal override IToken makeToken(int t)
		{
			// do something with char buffer???
			//		try {
			//			IToken tok = (Token)tokenObjectClass.newInstance();
			//			tok.setType(t);
			//			// tok.setText(getText()); done in generated lexer now
			//			tok.setLine(line);
			//			return tok;
			//		}
			//		catch (InstantiationException ie) {
			//			panic("can't instantiate a Token");
			//		}
			//		catch (IllegalAccessException iae) {
			//			panic("Token class is not accessible");
			//		}
			return base.makeToken(t);
		}
		public override void  match(int c)
		{
			char la_1 = LA(1);
			try
			{
				base.match(c);
				eventSupport.fireMatch(Convert.ToChar(c), inputState.guessing);
			}
			catch (MismatchedCharException e)
			{
				if (inputState.guessing == 0)
					eventSupport.fireMismatch(la_1, Convert.ToChar(c), inputState.guessing);
				throw e;
			}
		}
		public override void  match(BitSet b)
		{
			string text = this.text.ToString();
			char la_1 = LA(1);
			try
			{
				base.match(b);
				eventSupport.fireMatch(la_1, b, text, inputState.guessing);
			}
			catch (MismatchedCharException e)
			{
				if (inputState.guessing == 0)
					eventSupport.fireMismatch(la_1, b, text, inputState.guessing);
				throw e;
			}
		}
		public override void  match(string s)
		{
			System.Text.StringBuilder la_s = new System.Text.StringBuilder("");
			int len = s.Length;
			// peek at the next len worth of characters
			try
			{
				 for (int i = 1; i <= len; i++)
				{
					la_s.Append(base.LA(i));
				}
			}
			catch (System.Exception)
			{
			}
			
			try
			{
				base.match(s);
				eventSupport.fireMatch(s, inputState.guessing);
			}
			catch (MismatchedCharException e)
			{
				if (inputState.guessing == 0)
					eventSupport.fireMismatch(la_s.ToString(), s, inputState.guessing);
				throw e;
			}
			
		}
		public override void  matchNot(int c)
		{
			char la_1 = LA(1);
			try
			{
				base.matchNot(c);
				eventSupport.fireMatchNot(la_1, Convert.ToChar(c), inputState.guessing);
			}
			catch (MismatchedCharException e)
			{
				if (inputState.guessing == 0)
					eventSupport.fireMismatchNot(la_1, Convert.ToChar(c), inputState.guessing);
				throw e;
			}
			
		}
		public override void  matchRange(int c1, int c2)
		{
			char la_1 = LA(1);
			try
			{
				base.matchRange(c1, c2);
				eventSupport.fireMatch(la_1, "" + c1 + c2, inputState.guessing);
			}
			catch (MismatchedCharException e)
			{
				if (inputState.guessing == 0)
					eventSupport.fireMismatch(la_1, "" + c1 + c2, inputState.guessing);
				throw e;
			}
			
		}
		public override void  newline()
		{
			base.newline();
			eventSupport.fireNewLine(getLine());
		}
		public virtual void  removeMessageListener(MessageListener l)
		{
			eventSupport.removeMessageListener(l);
		}
		public virtual void  removeNewLineListener(NewLineListener l)
		{
			eventSupport.removeNewLineListener(l);
		}
		public virtual void  removeParserListener(ParserListener l)
		{
			eventSupport.removeParserListener(l);
		}
		public virtual void  removeParserMatchListener(ParserMatchListener l)
		{
			eventSupport.removeParserMatchListener(l);
		}
		public virtual void  removeParserTokenListener(ParserTokenListener l)
		{
			eventSupport.removeParserTokenListener(l);
		}
		public virtual void  removeSemanticPredicateListener(SemanticPredicateListener l)
		{
			eventSupport.removeSemanticPredicateListener(l);
		}
		public virtual void  removeSyntacticPredicateListener(SyntacticPredicateListener l)
		{
			eventSupport.removeSyntacticPredicateListener(l);
		}
		public virtual void  removeTraceListener(TraceListener l)
		{
			eventSupport.removeTraceListener(l);
		}
		/// Report exception errors caught in nextToken() 
		/// 
		public virtual void  reportError(MismatchedCharException e)
		{
			eventSupport.fireReportError(e);
			base.reportError(e);
		}
		/// Parser error-reporting function can be overridden in subclass 
		/// 
		public override void  reportError(string s)
		{
			eventSupport.fireReportError(s);
			base.reportError(s);
		}
		/// Parser warning-reporting function can be overridden in subclass 
		/// 
		public override void  reportWarning(string s)
		{
			eventSupport.fireReportWarning(s);
			base.reportWarning(s);
		}
		public virtual void  setupDebugging()
		{
		}

		public virtual void  wakeUp()
		{
			lock(this)
			{
				Monitor.Pulse(this);
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/MessageListener.cs0000755000175000017500000000032110522211615025255 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public interface MessageListener : Listener
	{
		void  reportError	(object source, MessageEventArgs e);
		void  reportWarning	(object source, MessageEventArgs e);
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ParseTreeDebugParser.cs0000644000175000017500000001056710522211615026213 0ustar  twernertwernernamespace antlr.debug
{

	/* ANTLR Translator Generator
	 * Project led by Terence Parr at http://www.jGuru.com
	 * Software rights: http://www.antlr.org/license.html
	 */

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//

	using System;
	using Stack = System.Collections.Stack;
	using antlr;
	using BitSet = antlr.collections.impl.BitSet;

	/// 
	/// Specifies the behaviour required (i.e. parser modifications) 
	/// specifically to support parse tree debugging and derivation.
	/// 
	/// 
	/// 
	/// Override the standard matching and rule entry/exit routines
	/// to build parse trees.  This class is useful for 2.7.3 where
	/// you can specify a superclass like
	/// 
	/// 
	/// class TinyCParser extends Parser(ParseTreeDebugParser);
	/// 
	/// 
	public class ParseTreeDebugParser : LLkParser 
	{
		/// 
		/// Each new rule invocation must have it's own subtree. Tokens are
		/// added to the current root so we must have a stack of subtree roots.
		/// 
		protected Stack currentParseTreeRoot = new Stack();

		/// 
		/// Track most recently created parse subtree so that when parsing
		/// is finished, we can get to the root.
		/// 
		protected ParseTreeRule mostRecentParseTreeRoot = null;

		/// 
		/// For every rule replacement with a production, we bump up count.
		/// 
		protected int numberOfDerivationSteps = 1; // n replacements plus step 0

		public ParseTreeDebugParser(int k_) : base(k_)
		{
		}

		public ParseTreeDebugParser(ParserSharedInputState state, int k_) : base(state, k_)
		{
		}

		public ParseTreeDebugParser(TokenBuffer tokenBuf, int k_) : base(tokenBuf, k_)
		{
		}

		public ParseTreeDebugParser(TokenStream lexer, int k_) : base(lexer,k_)
		{
		}

		public ParseTree getParseTree() 
		{
			return mostRecentParseTreeRoot;
		}

		public int getNumberOfDerivationSteps() 
		{
			return numberOfDerivationSteps;
		}

		public override void match(int i) 			// throws MismatchedTokenException, TokenStreamException 
		{
			addCurrentTokenToParseTree();
			base.match(i);
		}

		public override void match(BitSet bitSet) 	// throws MismatchedTokenException, TokenStreamException 
		{
			addCurrentTokenToParseTree();
			base.match(bitSet);
		}

		public override void matchNot(int i) 		// throws MismatchedTokenException, TokenStreamException
		{
			addCurrentTokenToParseTree();
			base.matchNot(i);
		}

		/// 
		/// Adds LT(1) to the current parse subtree.
		/// 
		/// 
		/// 
		/// Note that the match() routines add the node before checking for 
		/// correct match.  This means that, upon mismatched token, there 
		/// will a token node in the tree corresponding to where that token 
		/// was expected.  For no viable alternative errors, no node will 
		/// be in the tree as nothing was matched() (the lookahead failed 
		/// to predict an alternative).
		/// 
		/// 
		protected void addCurrentTokenToParseTree() 		// throws TokenStreamException 
		{
			if (inputState.guessing > 0) 
			{
				return;
			}
			ParseTreeRule root = (ParseTreeRule) currentParseTreeRoot.Peek();
			ParseTreeToken tokenNode = null;
			if ( LA(1) == Token.EOF_TYPE ) 
			{
				tokenNode = new ParseTreeToken(new antlr.CommonToken("EOF"));
			}
			else 
			{
				tokenNode = new ParseTreeToken(LT(1));
			}
			root.addChild(tokenNode);
		}

		/// 
		/// Create a rule node, add to current tree, and make it current root
		/// 
		/// 
		public override void traceIn(string s) 				// throws TokenStreamException 
		{
			if (inputState.guessing > 0) 
			{
				return;
			}
			ParseTreeRule subRoot = new ParseTreeRule(s);
			if ( currentParseTreeRoot.Count > 0 ) 
			{
				ParseTreeRule oldRoot = (ParseTreeRule) currentParseTreeRoot.Peek();
				oldRoot.addChild(subRoot);
			}
			currentParseTreeRoot.Push(subRoot);
			numberOfDerivationSteps++;
		}

		/// 
		/// Pop current root; back to adding to old root
		/// 
		/// 
		public override void traceOut(string s) 				// throws TokenStreamException
		{
			if (inputState.guessing > 0) 
			{
				return;
			}
			mostRecentParseTreeRoot = (ParseTreeRule) currentParseTreeRoot.Pop();
		}
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ANTLREventArgs.cs0000755000175000017500000000070310522211615024666 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public abstract class ANTLREventArgs : EventArgs
	{
		public ANTLREventArgs()
		{
		}
		public ANTLREventArgs(int type)
		{
			this.Type = type;
		}
	
		public virtual int Type
		{
			get
			{
				return this.type_;
			}
			set
			{
				this.type_ = value;
			}
		}

		internal void setValues(int type)
		{
			this.Type = type;
		}

		/// 
		/// Event type.
		/// 
		private int type_;
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/IParserDebugSubject.cs0000755000175000017500000000056710522211615026033 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public interface IParserDebugSubject : IDebugSubject
	{
		event MatchEventHandler					MatchedToken;
		event MatchEventHandler					MatchedNotToken;
		event MatchEventHandler					MisMatchedToken;
		event MatchEventHandler					MisMatchedNotToken;
		event TokenEventHandler					ConsumedToken;
		event TokenEventHandler					TokenLA;
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/MessageListenerBase.cs0000755000175000017500000000234210522211615026055 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	/// 
	/// Provides an abstract base for implementing  subclasses.
	/// 
	/// 
	///		
	///		This abstract class is provided to make it easier to create s. 
	///		You should extend this base class rather than creating your own.
	///		
	/// 
	public class MessageListenerBase : MessageListener
	{
		/// 
		/// Handle the "Done" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  doneParsing(object source, TraceEventArgs e)
		{
		}

		public virtual void  refresh()
		{
		}
		
		/// 
		/// Handle the "ReportError" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  reportError(object source, MessageEventArgs e)
		{
		}
		
		/// 
		/// Handle the "ReportWarning" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  reportWarning(object source, MessageEventArgs e)
		{
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/InputBufferReporter.cs0000755000175000017500000000156110522211615026146 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public class InputBufferReporter : InputBufferListenerBase, InputBufferListener
	{
		public virtual void inputBufferChanged(object source, InputBufferEventArgs e)
		{
			System.Console.Out.WriteLine(e);
		}

		///  charBufferConsume method comment.
		/// 
		public override void  inputBufferConsume(object source, InputBufferEventArgs e)
		{
			System.Console.Out.WriteLine(e);
		}

		///  charBufferLA method comment.
		/// 
		public override void  inputBufferLA(object source, InputBufferEventArgs e)
		{
			System.Console.Out.WriteLine(e);
		}

		public override void  inputBufferMark(object source, InputBufferEventArgs e)
		{
			System.Console.Out.WriteLine(e);
		}

		public override void  inputBufferRewind(object source, InputBufferEventArgs e)
		{
			System.Console.Out.WriteLine(e);
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ParserListener.cs0000755000175000017500000000032310522211615025127 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public interface ParserListener : SemanticPredicateListener, ParserMatchListener, MessageListener, ParserTokenListener, TraceListener, SyntacticPredicateListener
	{
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/IDebugSubject.cs0000755000175000017500000000116710522211615024653 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	//using EventHandlerList	= System.ComponentModel.EventHandlerList;
	
	public interface IDebugSubject
	{
	/*	EventHandlerList Events 
		{
			get;
		}
*/
		event TraceEventHandler					EnterRule;
		event TraceEventHandler					ExitRule;
		event TraceEventHandler					Done;
		event MessageEventHandler				ErrorReported;
		event MessageEventHandler				WarningReported;
		event SemanticPredicateEventHandler		SemPredEvaluated;
		event SyntacticPredicateEventHandler	SynPredStarted;
		event SyntacticPredicateEventHandler	SynPredFailed;
		event SyntacticPredicateEventHandler	SynPredSucceeded;
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/SemanticPredicateListener.cs0000755000175000017500000000027010522211615027260 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public interface SemanticPredicateListener : Listener
	{
		void  semanticPredicateEvaluated(object source, SemanticPredicateEventArgs e);
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/MessageEventArgs.cs0000755000175000017500000000135210522211615025373 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public class MessageEventArgs : ANTLREventArgs
	{
		public MessageEventArgs()
		{
		}
		public MessageEventArgs(int type, string text)
		{
			setValues(type, text);
		}

		public virtual string Text
		{
			get	{ return text_;			}
			set	{ this.text_ = value;	}
			
		}

		private string text_;

		public static int WARNING = 0;
		public static int ERROR = 1;
		
		
		/// This should NOT be called from anyone other than ParserEventSupport! 
		/// 
		internal void  setValues(int type, string text)
		{
			setValues(type);
			this.Text   = text;
		}

		public override string ToString()
		{
			return "ParserMessageEvent [" + (Type == WARNING?"warning,":"error,") + Text + "]";
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/DebuggingInputBuffer.cs0000755000175000017500000000333210522211615026235 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	using ArrayList	= System.Collections.ArrayList;
	
	public class DebuggingInputBuffer : InputBuffer
	{
		public virtual ArrayList InputBufferListeners
		{
			get { return inputBufferEventSupport.InputBufferListeners; }
		}
		public virtual bool DebugMode
		{
			set	{ debugMode = value;	}
		}

		private InputBuffer buffer;
		private InputBufferEventSupport inputBufferEventSupport;
		private bool debugMode = true;
		
		
		public DebuggingInputBuffer(InputBuffer buffer)
		{
			this.buffer = buffer;
			inputBufferEventSupport = new InputBufferEventSupport(this);
		}
		public virtual void  addInputBufferListener(InputBufferListener l)
		{
			inputBufferEventSupport.addInputBufferListener(l);
		}
		public override char  consume()
		{
			char la = ' ';
			try
			{
				la = buffer.LA(1);
			}
			catch (CharStreamException)
			{
			} // vaporize it...
			buffer.consume();
			if (debugMode)
				inputBufferEventSupport.fireConsume(la);
			return la;
		}
		public override void  fill(int a)
		{
			buffer.fill(a);
		}
		public virtual bool isDebugMode()
		{
			return debugMode;
		}
		public override bool isMarked()
		{
			return buffer.isMarked();
		}
		public override char LA(int i)
		{
			char la = buffer.LA(i);
			if (debugMode)
				inputBufferEventSupport.fireLA(la, i);
			return la;
		}
		public override int mark()
		{
			int m = buffer.mark();
			inputBufferEventSupport.fireMark(m);
			return m;
		}
		public virtual void  removeInputBufferListener(InputBufferListener l)
		{
			if (inputBufferEventSupport != null)
				inputBufferEventSupport.removeInputBufferListener(l);
		}
		public override void  rewind(int mark)
		{
			buffer.rewind(mark);
			inputBufferEventSupport.fireRewind(mark);
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ParserEventSupport.cs0000755000175000017500000004233410522211615026030 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	using System.Reflection;
	using Hashtable			= System.Collections.Hashtable;
	using DictionaryEntry	= System.Collections.DictionaryEntry;
	using ArrayList			= System.Collections.ArrayList;

	using antlr.collections.impl;
	
	
	public delegate void MessageEventHandler(object sender, MessageEventArgs e); 
	public delegate void NewLineEventHandler(object sender, NewLineEventArgs e); 
	public delegate void MatchEventHandler(object sender, MatchEventArgs e); 
	public delegate void TokenEventHandler(object sender, TokenEventArgs e); 
	public delegate void SemanticPredicateEventHandler(object sender, SemanticPredicateEventArgs e); 
	public delegate void SyntacticPredicateEventHandler(object sender, SyntacticPredicateEventArgs e); 
	public delegate void TraceEventHandler(object sender, TraceEventArgs e); 

	/// A class to assist in firing parser events
	/// NOTE: I intentionally _did_not_ synchronize the event firing and
	/// add/remove listener methods.  This is because the add/remove should
	/// _only_ be called by the parser at its start/end, and the _same_thread_
	/// should be performing the parsing.  This should help performance a tad...
	/// 
	public class ParserEventSupport
	{
		private object source;
		private Hashtable listeners;

		private MatchEventArgs matchEvent;
		private MessageEventArgs messageEvent;
		private TokenEventArgs tokenEvent;
		private SemanticPredicateEventArgs semPredEvent;
		private SyntacticPredicateEventArgs synPredEvent;
		private TraceEventArgs traceEvent;
		private NewLineEventArgs newLineEvent;

		private ParserController controller;

		private int ruleDepth = 0;
		
		
		public ParserEventSupport(object source)
		{
			matchEvent		= new MatchEventArgs();
			messageEvent	= new MessageEventArgs();
			tokenEvent		= new TokenEventArgs();
			traceEvent		= new TraceEventArgs();
			semPredEvent	= new SemanticPredicateEventArgs();
			synPredEvent	= new SyntacticPredicateEventArgs();
			newLineEvent	= new NewLineEventArgs();
			listeners		= new Hashtable();
			this.source		= source;
		}

		public virtual void checkController()
		{
			if (controller != null)
				controller.checkBreak();
		}

		public virtual void  addDoneListener(Listener l)
		{
			((Parser)source).Done += new TraceEventHandler(l.doneParsing);
			listeners[l] = l;
		}
		public virtual void  addMessageListener(MessageListener l)
		{
			((Parser)source).ErrorReported   += new MessageEventHandler(l.reportError);
			((Parser)source).WarningReported += new MessageEventHandler(l.reportWarning);
			//messageListeners.Add(l);
			addDoneListener(l);
		}
		public virtual void  addParserListener(ParserListener l)
		{
			if (l is ParserController)
			{
				((ParserController) l).ParserEventSupport = this;
				controller = (ParserController) l;
			}
			addParserMatchListener(l);
			addParserTokenListener(l);
			
			addMessageListener(l);
			addTraceListener(l);
			addSemanticPredicateListener(l);
			addSyntacticPredicateListener(l);
		}
		public virtual void  addParserMatchListener(ParserMatchListener l)
		{
			((Parser)source).MatchedToken		+= new MatchEventHandler(l.parserMatch);
			((Parser)source).MatchedNotToken	+= new MatchEventHandler(l.parserMatchNot);
			((Parser)source).MisMatchedToken	+= new MatchEventHandler(l.parserMismatch);
			((Parser)source).MisMatchedNotToken	+= new MatchEventHandler(l.parserMismatchNot);
			//matchListeners.Add(l);
			addDoneListener(l);
		}
		public virtual void  addParserTokenListener(ParserTokenListener l)
		{
			((Parser)source).ConsumedToken	+= new TokenEventHandler(l.parserConsume);
			((Parser)source).TokenLA		+= new TokenEventHandler(l.parserLA);
			//tokenListeners.Add(l);
			addDoneListener(l);
		}
		public virtual void  addSemanticPredicateListener(SemanticPredicateListener l)
		{
			((Parser)source).SemPredEvaluated	+= new SemanticPredicateEventHandler(l.semanticPredicateEvaluated);
			//semPredListeners.Add(l);
			addDoneListener(l);
		}
		public virtual void  addSyntacticPredicateListener(SyntacticPredicateListener l)
		{
			((Parser)source).SynPredStarted		+= new SyntacticPredicateEventHandler(l.syntacticPredicateStarted);
			((Parser)source).SynPredFailed		+= new SyntacticPredicateEventHandler(l.syntacticPredicateFailed);
			((Parser)source).SynPredSucceeded	+= new SyntacticPredicateEventHandler(l.syntacticPredicateSucceeded);
			//synPredListeners.Add(l);
			addDoneListener(l);
		}
		public virtual void  addTraceListener(TraceListener l)
		{
			((Parser)source).EnterRule	+= new TraceEventHandler(l.enterRule);
			((Parser)source).ExitRule	+= new TraceEventHandler(l.exitRule);
			//traceListeners.Add(l);
			addDoneListener(l);
		}
		public virtual void  fireConsume(int c)
		{
			TokenEventHandler eventDelegate = (TokenEventHandler)((Parser)source).Events[Parser.LAEventKey];
			if (eventDelegate != null) 
			{
				tokenEvent.setValues(TokenEventArgs.CONSUME, 1, c);
				eventDelegate(source, tokenEvent);
			}
			checkController();
		}
		public virtual void  fireDoneParsing()
		{
			TraceEventHandler eventDelegate = (TraceEventHandler)((Parser)source).Events[Parser.DoneEventKey];
			if (eventDelegate != null) 
			{
				traceEvent.setValues(TraceEventArgs.DONE_PARSING, 0, 0, 0);
				eventDelegate(source, traceEvent);
			}
			checkController();
		}
		public virtual void  fireEnterRule(int ruleNum, int guessing, int data)
		{
			ruleDepth++;
			TraceEventHandler eventDelegate = (TraceEventHandler)((Parser)source).Events[Parser.EnterRuleEventKey];
			if (eventDelegate != null) 
			{
				traceEvent.setValues(TraceEventArgs.ENTER, ruleNum, guessing, data);
				eventDelegate(source, traceEvent);
			}
			checkController();
		}
		public virtual void  fireExitRule(int ruleNum, int guessing, int data)
		{
			TraceEventHandler eventDelegate = (TraceEventHandler)((Parser)source).Events[Parser.ExitRuleEventKey];
			if (eventDelegate != null) 
			{
				traceEvent.setValues(TraceEventArgs.EXIT, ruleNum, guessing, data);
				eventDelegate(source, traceEvent);
			} 
			checkController();

			ruleDepth--;
			if (ruleDepth == 0)
				fireDoneParsing();

		}
		public virtual void  fireLA(int k, int la)
		{
			TokenEventHandler eventDelegate = (TokenEventHandler)((Parser)source).Events[Parser.LAEventKey];
			if (eventDelegate != null) 
			{
				tokenEvent.setValues(TokenEventArgs.LA, k, la);
				eventDelegate(source, tokenEvent);
			}
			checkController();
		}
		public virtual void  fireMatch(char c, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR, c, c, null, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatch(char c, BitSet b, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR_BITSET, c, b, null, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatch(char c, string target, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR_RANGE, c, target, null, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatch(int c, BitSet b, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.BITSET, c, b, text, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatch(int n, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.TOKEN, n, n, text, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatch(string s, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.STRING, 0, s, null, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatchNot(char c, char n, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MatchNotEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR, c, n, null, guessing, true, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatchNot(int c, int n, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MatchNotEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.TOKEN, c, n, text, guessing, true, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatch(char c, char n, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MisMatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR, c, n, null, guessing, false, false);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatch(char c, BitSet b, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MisMatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR_BITSET, c, b, null, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatch(char c, string target, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MisMatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR_RANGE, c, target, null, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatch(int i, int n, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MisMatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.TOKEN, i, n, text, guessing, false, false);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatch(int i, BitSet b, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MisMatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.BITSET, i, b, text, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatch(string s, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MisMatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.STRING, 0, text, s, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatchNot(char v, char c, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MisMatchNotEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR, v, c, null, guessing, true, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatchNot(int i, int n, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((Parser)source).Events[Parser.MisMatchNotEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.TOKEN, i, n, text, guessing, true, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireReportError(System.Exception e)
		{
			MessageEventHandler eventDelegate = (MessageEventHandler)((Parser)source).Events[Parser.ReportErrorEventKey];
			if (eventDelegate != null) 
			{
				messageEvent.setValues(MessageEventArgs.ERROR, e.ToString());
				eventDelegate(source, messageEvent);
			}
			checkController();
		}
		public virtual void  fireReportError(string s)
		{
			MessageEventHandler eventDelegate = (MessageEventHandler)((Parser)source).Events[Parser.ReportErrorEventKey];
			if (eventDelegate != null) 
			{
				messageEvent.setValues(MessageEventArgs.ERROR, s);
				eventDelegate(source, messageEvent);
			}
			checkController();
		}
		public virtual void  fireReportWarning(string s)
		{
			MessageEventHandler eventDelegate = (MessageEventHandler)((Parser)source).Events[Parser.ReportWarningEventKey];
			if (eventDelegate != null) 
			{
				messageEvent.setValues(MessageEventArgs.WARNING, s);
				eventDelegate(source, messageEvent);
			}
			checkController();
		}
		public virtual bool fireSemanticPredicateEvaluated(int type, int condition, bool result, int guessing)
		{
			SemanticPredicateEventHandler eventDelegate = (SemanticPredicateEventHandler)((Parser)source).Events[Parser.SemPredEvaluatedEventKey];
			if (eventDelegate != null) 
			{
				semPredEvent.setValues(type, condition, result, guessing);
				eventDelegate(source, semPredEvent);
			}
			checkController();

			return result;
		}
		public virtual void  fireSyntacticPredicateFailed(int guessing)
		{
			SyntacticPredicateEventHandler eventDelegate = (SyntacticPredicateEventHandler)((Parser)source).Events[Parser.SynPredFailedEventKey];
			if (eventDelegate != null) 
			{
				synPredEvent.setValues(0, guessing);
				eventDelegate(source, synPredEvent);
			}
			checkController();
		}
		public virtual void  fireSyntacticPredicateStarted(int guessing)
		{
			SyntacticPredicateEventHandler eventDelegate = (SyntacticPredicateEventHandler)((Parser)source).Events[Parser.SynPredStartedEventKey];
			if (eventDelegate != null) 
			{
				synPredEvent.setValues(0, guessing);
				eventDelegate(source, synPredEvent);
			}
			checkController();
		}
		public virtual void  fireSyntacticPredicateSucceeded(int guessing)
		{
			SyntacticPredicateEventHandler eventDelegate = (SyntacticPredicateEventHandler)((Parser)source).Events[Parser.SynPredSucceededEventKey];
			if (eventDelegate != null) 
			{
				synPredEvent.setValues(0, guessing);
				eventDelegate(source, synPredEvent);
			}
			checkController();
		}
		public virtual void  refreshListeners()
		{
			Hashtable clonedTable;

			lock(listeners.SyncRoot)
			{
				clonedTable = (Hashtable)listeners.Clone();
			}
			foreach (DictionaryEntry entry in clonedTable)
			{
				if (entry.Value != null)
				{
					((Listener) entry.Value).refresh();
				}
			}
		}
		public virtual void  removeDoneListener(Listener l)
		{
			((Parser)source).Done -= new TraceEventHandler(l.doneParsing);
			listeners.Remove(l);
		}
		public virtual void  removeMessageListener(MessageListener l)
		{
			((Parser)source).ErrorReported   -= new MessageEventHandler(l.reportError);
			((Parser)source).WarningReported -= new MessageEventHandler(l.reportWarning);
			//messageListeners.Remove(l);
			removeDoneListener(l);
		}
		public virtual void  removeParserListener(ParserListener l)
		{
			removeParserMatchListener(l);
			removeMessageListener(l);
			removeParserTokenListener(l);
			removeTraceListener(l);
			removeSemanticPredicateListener(l);
			removeSyntacticPredicateListener(l);
		}
		public virtual void  removeParserMatchListener(ParserMatchListener l)
		{
			((Parser)source).MatchedToken		-= new MatchEventHandler(l.parserMatch);
			((Parser)source).MatchedNotToken	-= new MatchEventHandler(l.parserMatchNot);
			((Parser)source).MisMatchedToken	-= new MatchEventHandler(l.parserMismatch);
			((Parser)source).MisMatchedNotToken	-= new MatchEventHandler(l.parserMismatchNot);
			//matchListeners.Remove(l);
			removeDoneListener(l);
		}
		public virtual void  removeParserTokenListener(ParserTokenListener l)
		{
			((Parser)source).ConsumedToken	-= new TokenEventHandler(l.parserConsume);
			((Parser)source).TokenLA		-= new TokenEventHandler(l.parserLA);
			//tokenListeners.Remove(l);
			removeDoneListener(l);
		}
		public virtual void  removeSemanticPredicateListener(SemanticPredicateListener l)
		{
			((Parser)source).SemPredEvaluated	-= new SemanticPredicateEventHandler(l.semanticPredicateEvaluated);
			//semPredListeners.Remove(l);
			removeDoneListener(l);
		}
		public virtual void  removeSyntacticPredicateListener(SyntacticPredicateListener l)
		{
			((Parser)source).SynPredStarted		-= new SyntacticPredicateEventHandler(l.syntacticPredicateStarted);
			((Parser)source).SynPredFailed		-= new SyntacticPredicateEventHandler(l.syntacticPredicateFailed);
			((Parser)source).SynPredSucceeded	-= new SyntacticPredicateEventHandler(l.syntacticPredicateSucceeded);
			//synPredListeners.Remove(l);
			removeDoneListener(l);
		}
		public virtual void  removeTraceListener(TraceListener l)
		{
			((Parser)source).EnterRule	-= new TraceEventHandler(l.enterRule);
			((Parser)source).ExitRule	-= new TraceEventHandler(l.exitRule);
			//traceListeners.Remove(l);
			removeDoneListener(l);
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/InputBufferEventArgs.cs0000755000175000017500000000205110522211615026235 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public class InputBufferEventArgs : ANTLREventArgs
	{
		public InputBufferEventArgs()
		{
		}

		public InputBufferEventArgs(int type, char c, int lookaheadAmount)
		{
			setValues(type, c, lookaheadAmount);
		}
	
		public virtual char Char
		{
			get	{ return this.c_;	}
			set	{ this.c_ = value;	}
		}
		public virtual int LookaheadAmount
		{
			get	{ return this.lookaheadAmount_;		}
			set	{ this.lookaheadAmount_ = value;	}
		}

		internal char c_;
		internal int lookaheadAmount_; // amount of lookahead

		public const int CONSUME = 0;
		public const int LA = 1;
		public const int MARK = 2;
		public const int REWIND = 3;
		
		
		/// This should NOT be called from anyone other than ParserEventSupport! 
		/// 
		internal void  setValues(int type, char c, int la)
		{
			setValues(type);
			this.Char	= c;
			this.LookaheadAmount = la;
		}

		public override string ToString()
		{
			return "CharBufferEvent [" + (Type == CONSUME?"CONSUME, ":"LA, ") + Char + "," + LookaheadAmount + "]";
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ParserController.cs0000755000175000017500000000027210522211615025470 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public interface ParserController : ParserListener
		{
			ParserEventSupport ParserEventSupport
			{
				set;
			}

			void  checkBreak();
		}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/NewLineEventArgs.cs0000755000175000017500000000077010522211615025353 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public class NewLineEventArgs : ANTLREventArgs
	{
		public NewLineEventArgs()
		{
		}
		public NewLineEventArgs(int line)
		{
			Line = line;
		}

		public virtual int Line
		{
			get	{ return this.line_; }
			set	{ this.line_ = value; }
		}

		private int line_;
		
		
		/// This should NOT be called from anyone other than ParserEventSupport! 
		/// 
		public override string ToString()
		{
			return "NewLineEvent [" + line_ + "]";
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ParserTokenEventArgs.cs0000755000175000017500000000170510522211615026246 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public class TokenEventArgs : ANTLREventArgs
	{
		public TokenEventArgs()
		{
		}
		public TokenEventArgs(int type, int amount, int val)
		{
			setValues(type, amount, val);
		}

		public virtual int Amount
		{
			get	{ return amount;	}
			set	{ this.amount = value;	}
		}

		public virtual int Value
		{
			get	{ return this.value_;	}
			set { this.value_ = value;	}
		}

		private int value_;
		private int amount;

		public static int LA = 0;
		public static int CONSUME = 1;
		
		
		/// This should NOT be called from anyone other than ParserEventSupport! 
		/// 
		internal void  setValues(int type, int amount, int val)
		{
			base.setValues(type);
			this.Amount = amount;
			this.Value  = val;
		}

		public override string ToString()
		{
			if (Type == LA)
				return "ParserTokenEvent [LA," + Amount + "," + Value + "]";
			else
				return "ParserTokenEvent [consume,1," + Value + "]";
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/SemanticPredicateListenerBase.cs0000755000175000017500000000204210522211615030052 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	/// 
	/// Provides an abstract base for implementing  subclasses.
	/// 
	/// 
	///		
	///		This abstract class is provided to make it easier to create s. 
	///		You should extend this base class rather than creating your own.
	///		
	/// 
	public class SemanticPredicateListenerBase : SemanticPredicateListener
	{
		/// 
		/// Handle the "Done" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  doneParsing(object source, TraceEventArgs e)
		{
		}

		public virtual void  refresh()
		{
		}

		/// 
		/// Handle the "SemPreEvaluated" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  semanticPredicateEvaluated(object source, SemanticPredicateEventArgs e)
		{
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/DebuggingParser.cs0000755000175000017500000000032210522211615025234 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	///  This type was created in VisualAge.
	/// 
	public interface DebuggingParser
	{
		string getRuleName(int n);
		string getSemPredName(int n);
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ICharScannerDebugSubject.cs0000755000175000017500000000064110522211615026757 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public interface ICharScannerDebugSubject : IDebugSubject
	{
		event NewLineEventHandler				HitNewLine;
		event MatchEventHandler					MatchedChar;
		event MatchEventHandler					MatchedNotChar;
		event MatchEventHandler					MisMatchedChar;
		event MatchEventHandler					MisMatchedNotChar;
		event TokenEventHandler					ConsumedChar;
		event TokenEventHandler					CharLA;
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/GuessingEventArgs.cs0000755000175000017500000000105210522211615025570 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public abstract class GuessingEventArgs : ANTLREventArgs
	{
		public GuessingEventArgs()
		{
		}
		public GuessingEventArgs(int type) : base(type)
		{
		}

		public virtual int Guessing
		{
			get	{ return guessing_;			}
			set	{ this.guessing_ = value;	}
		}

		private int guessing_;
		
		
		/// This should NOT be called from anyone other than ParserEventSupport! 
		/// 
		public virtual void  setValues(int type, int guessing)
		{
			setValues(type);
			this.Guessing = guessing;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/TraceListenerBase.cs0000755000175000017500000000231210522211615025524 0ustar  twernertwernernamespace antlr.debug
{
	using System;

	/// 
	/// Provides an abstract base for implementing  subclasses.
	/// 
	/// 
	///		
	///		This abstract class is provided to make it easier to create s. 
	///		You should extend this base class rather than creating your own.
	///		
	/// 
	public abstract class TraceListenerBase : TraceListener
	{
		/// 
		/// Handle the "Done" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  doneParsing(object source, TraceEventArgs e)
		{
		}

		/// 
		/// Handle the "EnterRule" event
		/// 
		/// Event source object
		/// Event data object
		public virtual void  enterRule(object source, TraceEventArgs e)
		{
		}

		/// 
		/// Handle the "ExitRule" event
		/// 
		/// Event source object
		/// Event data object
		public virtual void  exitRule(object source, TraceEventArgs e)
		{
		}

		public virtual void  refresh()
		{
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ParserMatchEventArgs.cs0000755000175000017500000000402010522211615026213 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public class MatchEventArgs : GuessingEventArgs
	{
		public MatchEventArgs()
		{
		}
		public MatchEventArgs(int type, int val, object target, string text, int guessing, bool inverse, bool matched)
		{
			setValues(type, val, target, text, guessing, inverse, matched);
		}

		public virtual object Target
		{
			get	{ return this.target_;	}
			set	{ this.target_ = value;	}
		}

		public virtual string Text
		{
			get	{ return this.text_;	}
			set	{ this.text_ = value;	}
		}

		public virtual int Value
		{
			get	{ return this.val_;		}
			set	{ this.val_ = value;	}
		}

		internal bool Inverse
		{
			set	{ this.inverse_ = value;	}
		}

		internal bool Matched
		{
			set	{ this.matched_ = value;	}
		}

		// NOTE: for a mismatch on type STRING, the "text" is used as the lookahead
		//       value.  Normally "value" is this
		public enum ParserMatchEnums
		{
			TOKEN		= 0,
			BITSET		= 1,
			CHAR		= 2,
			CHAR_BITSET = 3,
			STRING		= 4,
			CHAR_RANGE	= 5,
		}
		public static int TOKEN = 0;
		public static int BITSET = 1;
		public static int CHAR = 2;
		public static int CHAR_BITSET = 3;
		public static int STRING = 4;
		public static int CHAR_RANGE = 5;

		private bool	inverse_;
		private bool	matched_;
		private object	target_;
		private int		val_;
		private string	text_;
		
		
		public virtual bool isInverse()
		{
			return inverse_;
		}
		public virtual bool isMatched()
		{
			return matched_;
		}
		/// This should NOT be called from anyone other than ParserEventSupport! 
		/// 
		internal void  setValues(int type, int val, object target, string text, int guessing, bool inverse, bool matched)
		{
			base.setValues(type, guessing);
			this.Value = val;
			this.Target = target;
			this.Inverse = inverse;
			this.Matched = matched;
			this.Text = text;
		}
		
		public override string ToString()
		{
			return "ParserMatchEvent [" + (isMatched()?"ok,":"bad,") + (isInverse()?"NOT ":"") + (Type == TOKEN?"token,":"bitset,") + Value + "," + Target + "," + Guessing + "]";
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/LLkDebuggingParser.cs0000755000175000017500000002037010522211615025644 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	using System.Threading;
	using antlr.collections.impl;
	
	public class LLkDebuggingParser : LLkParser, DebuggingParser
	{
		private void  InitBlock()
		{
			parserEventSupport = new ParserEventSupport(this);
		}
		public override void setDebugMode(bool mode)
		{
			_notDebugMode = !mode;
		}
		protected internal ParserEventSupport parserEventSupport;
		
		private bool _notDebugMode = false;
		protected internal string[] ruleNames;
		protected internal string[] semPredNames;
		
		
		public LLkDebuggingParser(int k_):base(k_)
		{
			InitBlock();
		}
		public LLkDebuggingParser(ParserSharedInputState state, int k_):base(state, k_)
		{
			InitBlock();
		}
		public LLkDebuggingParser(TokenBuffer tokenBuf, int k_):base(tokenBuf, k_)
		{
			InitBlock();
		}
		public LLkDebuggingParser(TokenStream lexer, int k_):base(lexer, k_)
		{
			InitBlock();
		}
		public override void  addMessageListener(MessageListener l)
		{
			parserEventSupport.addMessageListener(l);
		}
		public override void  addParserListener(ParserListener l)
		{
			parserEventSupport.addParserListener(l);
		}
		public override void  addParserMatchListener(ParserMatchListener l)
		{
			parserEventSupport.addParserMatchListener(l);
		}
		public override void  addParserTokenListener(ParserTokenListener l)
		{
			parserEventSupport.addParserTokenListener(l);
		}
		public override void  addSemanticPredicateListener(SemanticPredicateListener l)
		{
			parserEventSupport.addSemanticPredicateListener(l);
		}
		public override void  addSyntacticPredicateListener(SyntacticPredicateListener l)
		{
			parserEventSupport.addSyntacticPredicateListener(l);
		}
		public override void  addTraceListener(TraceListener l)
		{
			parserEventSupport.addTraceListener(l);
		}
		/// Get another token object from the token stream 
		/// 
		public override void  consume()
		{
			int la_1 = - 99;
			la_1 = LA(1);
			base.consume();
			parserEventSupport.fireConsume(la_1);
		}
		protected internal virtual void  fireEnterRule(int num, int data)
		{
			if (isDebugMode())
				parserEventSupport.fireEnterRule(num, inputState.guessing, data);
		}
		protected internal virtual void  fireExitRule(int num, int data)
		{
			if (isDebugMode())
				parserEventSupport.fireExitRule(num, inputState.guessing, data);
		}
		protected internal virtual bool fireSemanticPredicateEvaluated(int type, int num, bool condition)
		{
			if (isDebugMode())
				return parserEventSupport.fireSemanticPredicateEvaluated(type, num, condition, inputState.guessing);
			else
				return condition;
		}
		protected internal virtual void  fireSyntacticPredicateFailed()
		{
			if (isDebugMode())
				parserEventSupport.fireSyntacticPredicateFailed(inputState.guessing);
		}
		protected internal virtual void  fireSyntacticPredicateStarted()
		{
			if (isDebugMode())
				parserEventSupport.fireSyntacticPredicateStarted(inputState.guessing);
		}
		protected internal virtual void  fireSyntacticPredicateSucceeded()
		{
			if (isDebugMode())
				parserEventSupport.fireSyntacticPredicateSucceeded(inputState.guessing);
		}
		public virtual string getRuleName(int num)
		{
			return ruleNames[num];
		}
		public virtual string getSemPredName(int num)
		{
			return semPredNames[num];
		}

		public virtual void  goToSleep()
		{
			lock(this)
			{
				try
				{
					Monitor.Wait(this);
				}
				catch (System.Threading.ThreadInterruptedException)
				{
				}
			}
		}
		public override bool isDebugMode()
		{
			return !_notDebugMode;
		}
		public virtual bool isGuessing()
		{
			return inputState.guessing > 0;
		}
		/// Return the token type of the ith token of lookahead where i=1
		/// is the current token being examined by the parser (i.e., it
		/// has not been matched yet).
		/// 
		public override int LA(int i)
		{
			int la = base.LA(i);
			parserEventSupport.fireLA(i, la);
			return la;
		}
		/// Make sure current lookahead symbol matches token type t.
		/// Throw an exception upon mismatch, which is catch by either the
		/// error handler or by the syntactic predicate.
		/// 
		public override void  match(int t)
		{
			string text = LT(1).getText();
			int la_1 = LA(1);
			try
			{
				base.match(t);
				parserEventSupport.fireMatch(t, text, inputState.guessing);
			}
			catch (MismatchedTokenException e)
			{
				if (inputState.guessing == 0)
					parserEventSupport.fireMismatch(la_1, t, text, inputState.guessing);
				throw e;
			}
		}
		/// Make sure current lookahead symbol matches the given set
		/// Throw an exception upon mismatch, which is catch by either the
		/// error handler or by the syntactic predicate.
		/// 
		public override void  match(BitSet b)
		{
			string text = LT(1).getText();
			int la_1 = LA(1);
			try
			{
				base.match(b);
				parserEventSupport.fireMatch(la_1, b, text, inputState.guessing);
			}
			catch (MismatchedTokenException e)
			{
				if (inputState.guessing == 0)
					parserEventSupport.fireMismatch(la_1, b, text, inputState.guessing);
				throw e;
			}
		}
		public override void  matchNot(int t)
		{
			string text = LT(1).getText();
			int la_1 = LA(1);
			try
			{
				base.matchNot(t);
				parserEventSupport.fireMatchNot(la_1, t, text, inputState.guessing);
			}
			catch (MismatchedTokenException e)
			{
				if (inputState.guessing == 0)
					parserEventSupport.fireMismatchNot(la_1, t, text, inputState.guessing);
				throw e;
			}
		}
		public override void  removeMessageListener(MessageListener l)
		{
			parserEventSupport.removeMessageListener(l);
		}
		public override void  removeParserListener(ParserListener l)
		{
			parserEventSupport.removeParserListener(l);
		}
		public override void  removeParserMatchListener(ParserMatchListener l)
		{
			parserEventSupport.removeParserMatchListener(l);
		}
		public override void  removeParserTokenListener(ParserTokenListener l)
		{
			parserEventSupport.removeParserTokenListener(l);
		}
		public override void  removeSemanticPredicateListener(SemanticPredicateListener l)
		{
			parserEventSupport.removeSemanticPredicateListener(l);
		}
		public override void  removeSyntacticPredicateListener(SyntacticPredicateListener l)
		{
			parserEventSupport.removeSyntacticPredicateListener(l);
		}
		public override void  removeTraceListener(TraceListener l)
		{
			parserEventSupport.removeTraceListener(l);
		}
		/// Parser error-reporting function can be overridden in subclass 
		/// 
		public override void  reportError(RecognitionException ex)
		{
			parserEventSupport.fireReportError(ex);
			base.reportError(ex);
		}
		/// Parser error-reporting function can be overridden in subclass 
		/// 
		public override void  reportError(string s)
		{
			parserEventSupport.fireReportError(s);
			base.reportError(s);
		}
		/// Parser warning-reporting function can be overridden in subclass 
		/// 
		public override void  reportWarning(string s)
		{
			parserEventSupport.fireReportWarning(s);
			base.reportWarning(s);
		}
		public virtual void  setupDebugging(TokenBuffer tokenBuf)
		{
			setupDebugging(null, tokenBuf);
		}
		public virtual void  setupDebugging(TokenStream lexer)
		{
			setupDebugging(lexer, null);
		}
		/// User can override to do their own debugging 
		/// 
		protected internal virtual void  setupDebugging(TokenStream lexer, TokenBuffer tokenBuf)
		{
			setDebugMode(true);
			// default parser debug setup is ParseView
			try
			{
//				try
//				{
//					System.Type.GetType("javax.swing.JButton");
//				}
//				catch (System.Exception)
//				{
//					System.Console.Error.WriteLine("Swing is required to use ParseView, but is not present in your CLASSPATH");
//					System.Environment.Exit(1);
//				}
				System.Type c = System.Type.GetType("antlr.parseview.ParseView");
				System.Reflection.ConstructorInfo constructor = c.GetConstructor(new System.Type[]{typeof(LLkDebuggingParser), typeof(TokenStream), typeof(TokenBuffer)});
				constructor.Invoke(new object[]{this, lexer, tokenBuf});
			}
			catch (System.Exception e)
			{
				System.Console.Error.WriteLine("Error initializing ParseView: " + e);
				System.Console.Error.WriteLine("Please report this to Scott Stanchfield, thetick@magelang.com");
				System.Environment.Exit(1);
			}
		}

		public virtual void  wakeUp()
		{
			lock(this)
			{
				Monitor.Pulse(this);
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/TraceEventArgs.cs0000755000175000017500000000176310522211615025053 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public class TraceEventArgs : GuessingEventArgs
	{
		public TraceEventArgs()
		{
		}
		public TraceEventArgs(int type, int ruleNum, int guessing, int data)
		{
			setValues(type, ruleNum, guessing, data);
		}

		public virtual int Data
		{
			get	{ return this.data_;	}
			set	{ this.data_ = value;	}
		}

		public virtual int RuleNum
		{
			get	{ return this.ruleNum_;		}
			set	{ this.ruleNum_ = value;	}
		}

		private int ruleNum_;
		private int data_;

		public static int ENTER = 0;
		public static int EXIT = 1;
		public static int DONE_PARSING = 2;
		
		
		/// This should NOT be called from anyone other than ParserEventSupport! 
		/// 
		internal void  setValues(int type, int ruleNum, int guessing, int data)
		{
			base.setValues(type, guessing);
			RuleNum = ruleNum;
			Data	= data;
		}

		public override string ToString()
		{
			return "ParserTraceEvent [" + (Type == ENTER?"enter,":"exit,") + RuleNum + "," + Guessing + "]";
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ParserReporter.cs0000755000175000017500000000333010522211615025145 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public class ParserReporter : Tracer, ParserListener
	{
		public virtual void  parserConsume(object source, TokenEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
		}
		public virtual void  parserLA(object source, TokenEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
		}
		public virtual void  parserMatch(object source, MatchEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
		}
		public virtual void  parserMatchNot(object source, MatchEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
		}
		public virtual void  parserMismatch(object source, MatchEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
		}
		public virtual void  parserMismatchNot(object source, MatchEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
		}
		public virtual void  reportError(object source, MessageEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
		}
		public virtual void  reportWarning(object source, MessageEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
		}
		public virtual void  semanticPredicateEvaluated(object source, SemanticPredicateEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
		}
		public virtual void  syntacticPredicateFailed(object source, SyntacticPredicateEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
		}
		public virtual void  syntacticPredicateStarted(object source, SyntacticPredicateEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
		}
		public virtual void  syntacticPredicateSucceeded(object source, SyntacticPredicateEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ScannerEventSupport.cs0000755000175000017500000004210510522211615026161 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	using System.Reflection;
	using Hashtable		= System.Collections.Hashtable;
	using ArrayList		= System.Collections.ArrayList;

	using antlr.collections.impl;
	
	
	/// A class to assist in firing parser events
	/// NOTE: I intentionally _did_not_ synchronize the event firing and
	/// add/remove listener methods.  This is because the add/remove should
	/// _only_ be called by the parser at its start/end, and the _same_thread_
	/// should be performing the parsing.  This should help performance a tad...
	/// 
	public class ScannerEventSupport
	{
		private object source;
		private Hashtable listeners;
		private MatchEventArgs matchEvent;
		private MessageEventArgs messageEvent;
		private TokenEventArgs tokenEvent;
		private SemanticPredicateEventArgs semPredEvent;
		private SyntacticPredicateEventArgs synPredEvent;
		private TraceEventArgs traceEvent;
		private NewLineEventArgs newLineEvent;
		//private ParserController controller;

		private int ruleDepth = 0;
		
		
		public ScannerEventSupport(object source)
		{
			matchEvent		= new MatchEventArgs();
			messageEvent	= new MessageEventArgs();
			tokenEvent		= new TokenEventArgs();
			traceEvent		= new TraceEventArgs();
			semPredEvent	= new SemanticPredicateEventArgs();
			synPredEvent	= new SyntacticPredicateEventArgs();
			newLineEvent	= new NewLineEventArgs();
			listeners		= new Hashtable();
			this.source		= source;
		}

		public virtual void checkController()
		{
			//if (controller != null)
			//	controller.checkBreak();
		}

		public virtual void  addDoneListener(Listener l)
		{
			((CharScanner)source).Done += new TraceEventHandler(l.doneParsing);
			listeners[l] = l;
		}
		public virtual void  addMessageListener(MessageListener l)
		{
			((CharScanner)source).ErrorReported   += new MessageEventHandler(l.reportError);
			((CharScanner)source).WarningReported += new MessageEventHandler(l.reportWarning);
			addDoneListener(l);
		}
		public virtual void  addNewLineListener(NewLineListener l)
		{
			((CharScanner)source).HitNewLine   += new NewLineEventHandler(l.hitNewLine);
			addDoneListener(l);
		}
		public virtual void  addParserListener(ParserListener l)
		{
			if (l is ParserController)
			{
				//((ParserController) l).ParserEventSupport = this;
				//controller = (ParserController) l;
			}
			addParserMatchListener(l);
			addParserTokenListener(l);
			
			addMessageListener(l);
			addTraceListener(l);
			addSemanticPredicateListener(l);
			addSyntacticPredicateListener(l);
		}
		public virtual void  addParserMatchListener(ParserMatchListener l)
		{
			((CharScanner)source).MatchedChar		+= new MatchEventHandler(l.parserMatch);
			((CharScanner)source).MatchedNotChar	+= new MatchEventHandler(l.parserMatchNot);
			((CharScanner)source).MisMatchedChar	+= new MatchEventHandler(l.parserMismatch);
			((CharScanner)source).MisMatchedNotChar	+= new MatchEventHandler(l.parserMismatchNot);
			addDoneListener(l);
		}
		public virtual void  addParserTokenListener(ParserTokenListener l)
		{
			((CharScanner)source).ConsumedChar	+= new TokenEventHandler(l.parserConsume);
			((CharScanner)source).CharLA		+= new TokenEventHandler(l.parserLA);
			addDoneListener(l);
		}
		public virtual void  addSemanticPredicateListener(SemanticPredicateListener l)
		{
			((CharScanner)source).SemPredEvaluated	+= new SemanticPredicateEventHandler(l.semanticPredicateEvaluated);
			addDoneListener(l);
		}
		public virtual void  addSyntacticPredicateListener(SyntacticPredicateListener l)
		{
			((CharScanner)source).SynPredStarted		+= new SyntacticPredicateEventHandler(l.syntacticPredicateStarted);
			((CharScanner)source).SynPredFailed		+= new SyntacticPredicateEventHandler(l.syntacticPredicateFailed);
			((CharScanner)source).SynPredSucceeded	+= new SyntacticPredicateEventHandler(l.syntacticPredicateSucceeded);
			addDoneListener(l);
		}
		public virtual void  addTraceListener(TraceListener l)
		{
			((CharScanner)source).EnterRule	+= new TraceEventHandler(l.enterRule);
			((CharScanner)source).ExitRule	+= new TraceEventHandler(l.exitRule);
			addDoneListener(l);
		}
		public virtual void  fireConsume(int c)
		{
			TokenEventHandler eventDelegate = (TokenEventHandler)((CharScanner)source).Events[Parser.LAEventKey];
			if (eventDelegate != null) 
			{
				tokenEvent.setValues(TokenEventArgs.CONSUME, 1, c);
				eventDelegate(source, tokenEvent);
			}
			checkController();
		}
		public virtual void  fireDoneParsing()
		{
			TraceEventHandler eventDelegate = (TraceEventHandler)((CharScanner)source).Events[Parser.DoneEventKey];
			if (eventDelegate != null) 
			{
				traceEvent.setValues(TraceEventArgs.DONE_PARSING, 0, 0, 0);
				eventDelegate(source, traceEvent);
			}
			checkController();
		}
		public virtual void  fireEnterRule(int ruleNum, int guessing, int data)
		{
			ruleDepth++;
			TraceEventHandler eventDelegate = (TraceEventHandler)((CharScanner)source).Events[Parser.EnterRuleEventKey];
			if (eventDelegate != null) 
			{
				traceEvent.setValues(TraceEventArgs.ENTER, ruleNum, guessing, data);
				eventDelegate(source, traceEvent);
			}
			checkController();
		}
		public virtual void  fireExitRule(int ruleNum, int guessing, int data)
		{
			TraceEventHandler eventDelegate = (TraceEventHandler)((CharScanner)source).Events[Parser.ExitRuleEventKey];
			if (eventDelegate != null) 
			{
				traceEvent.setValues(TraceEventArgs.EXIT, ruleNum, guessing, data);
				eventDelegate(source, traceEvent);
			} 
			checkController();

			ruleDepth--;
			if (ruleDepth == 0)
				fireDoneParsing();

		}
		public virtual void  fireLA(int k, int la)
		{
			TokenEventHandler eventDelegate = (TokenEventHandler)((CharScanner)source).Events[Parser.LAEventKey];
			if (eventDelegate != null) 
			{
				tokenEvent.setValues(TokenEventArgs.LA, k, la);
				eventDelegate(source, tokenEvent);
			}
			checkController();
		}
		public virtual void  fireMatch(char c, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR, c, c, null, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatch(char c, BitSet b, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR_BITSET, c, b, null, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatch(char c, string target, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR_RANGE, c, target, null, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatch(int c, BitSet b, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.BITSET, c, b, text, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatch(int n, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.TOKEN, n, n, text, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatch(string s, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.STRING, 0, s, null, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatchNot(char c, char n, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MatchNotEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR, c, n, null, guessing, true, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMatchNot(int c, int n, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MatchNotEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.TOKEN, c, n, text, guessing, true, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatch(char c, char n, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MisMatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR, c, n, null, guessing, false, false);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatch(char c, BitSet b, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MisMatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR_BITSET, c, b, null, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatch(char c, string target, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MisMatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR_RANGE, c, target, null, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatch(int i, int n, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MisMatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.TOKEN, i, n, text, guessing, false, false);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatch(int i, BitSet b, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MisMatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.BITSET, i, b, text, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatch(string s, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MisMatchEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.STRING, 0, text, s, guessing, false, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatchNot(char v, char c, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MisMatchNotEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.CHAR, v, c, null, guessing, true, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireMismatchNot(int i, int n, string text, int guessing)
		{
			MatchEventHandler eventDelegate = (MatchEventHandler)((CharScanner)source).Events[Parser.MisMatchNotEventKey];
			if (eventDelegate != null) 
			{
				matchEvent.setValues(MatchEventArgs.TOKEN, i, n, text, guessing, true, true);
				eventDelegate(source, matchEvent);
			}
			checkController();
		}
		public virtual void  fireNewLine(int line)
		{
			NewLineEventHandler eventDelegate = (NewLineEventHandler)((CharScanner)source).Events[Parser.NewLineEventKey];
			if (eventDelegate != null) 
			{
				newLineEvent.Line = line;
				eventDelegate(source, newLineEvent);
			}
			checkController();
		}
		public virtual void  fireReportError(System.Exception e)
		{
			MessageEventHandler eventDelegate = (MessageEventHandler)((CharScanner)source).Events[Parser.ReportErrorEventKey];
			if (eventDelegate != null) 
			{
				messageEvent.setValues(MessageEventArgs.ERROR, e.ToString());
				eventDelegate(source, messageEvent);
			}
			checkController();
		}
		public virtual void  fireReportError(string s)
		{
			MessageEventHandler eventDelegate = (MessageEventHandler)((CharScanner)source).Events[Parser.ReportErrorEventKey];
			if (eventDelegate != null) 
			{
				messageEvent.setValues(MessageEventArgs.ERROR, s);
				eventDelegate(source, messageEvent);
			}
			checkController();
		}
		public virtual void  fireReportWarning(string s)
		{
			MessageEventHandler eventDelegate = (MessageEventHandler)((CharScanner)source).Events[Parser.ReportWarningEventKey];
			if (eventDelegate != null) 
			{
				messageEvent.setValues(MessageEventArgs.WARNING, s);
				eventDelegate(source, messageEvent);
			}
			checkController();
		}
		public virtual bool fireSemanticPredicateEvaluated(int type, int condition, bool result, int guessing)
		{
			SemanticPredicateEventHandler eventDelegate = (SemanticPredicateEventHandler)((CharScanner)source).Events[Parser.SemPredEvaluatedEventKey];
			if (eventDelegate != null) 
			{
				semPredEvent.setValues(type, condition, result, guessing);
				eventDelegate(source, semPredEvent);
			}
			checkController();

			return result;
		}
		public virtual void  fireSyntacticPredicateFailed(int guessing)
		{
			SyntacticPredicateEventHandler eventDelegate = (SyntacticPredicateEventHandler)((CharScanner)source).Events[Parser.SynPredFailedEventKey];
			if (eventDelegate != null) 
			{
				synPredEvent.setValues(0, guessing);
				eventDelegate(source, synPredEvent);
			}
			checkController();
		}
		public virtual void  fireSyntacticPredicateStarted(int guessing)
		{
			SyntacticPredicateEventHandler eventDelegate = (SyntacticPredicateEventHandler)((CharScanner)source).Events[Parser.SynPredStartedEventKey];
			if (eventDelegate != null) 
			{
				synPredEvent.setValues(0, guessing);
				eventDelegate(source, synPredEvent);
			}
			checkController();
		}
		public virtual void  fireSyntacticPredicateSucceeded(int guessing)
		{
			SyntacticPredicateEventHandler eventDelegate = (SyntacticPredicateEventHandler)((CharScanner)source).Events[Parser.SynPredSucceededEventKey];
			if (eventDelegate != null) 
			{
				synPredEvent.setValues(0, guessing);
				eventDelegate(source, synPredEvent);
			}
			checkController();
		}
		public virtual void  refreshListeners()
		{
			Hashtable clonedTable;

			lock(listeners.SyncRoot)
			{
				clonedTable = (Hashtable)listeners.Clone();
			}
			foreach (Listener l in clonedTable)
			{
				l.refresh();
			}
		}
		public virtual void  removeDoneListener(Listener l)
		{
			((CharScanner)source).Done -= new TraceEventHandler(l.doneParsing);
			listeners.Remove(l);
		}
		public virtual void  removeMessageListener(MessageListener l)
		{
			((CharScanner)source).ErrorReported   -= new MessageEventHandler(l.reportError);
			((CharScanner)source).WarningReported -= new MessageEventHandler(l.reportWarning);
			removeDoneListener(l);
		}
		public virtual void  removeNewLineListener(NewLineListener l)
		{
			((CharScanner)source).HitNewLine   -= new NewLineEventHandler(l.hitNewLine);
			removeDoneListener(l);
		}
		public virtual void  removeParserListener(ParserListener l)
		{
			removeParserMatchListener(l);
			removeMessageListener(l);
			removeParserTokenListener(l);
			removeTraceListener(l);
			removeSemanticPredicateListener(l);
			removeSyntacticPredicateListener(l);
		}
		public virtual void  removeParserMatchListener(ParserMatchListener l)
		{
			((CharScanner)source).MatchedChar		-= new MatchEventHandler(l.parserMatch);
			((CharScanner)source).MatchedNotChar	-= new MatchEventHandler(l.parserMatchNot);
			((CharScanner)source).MisMatchedChar	-= new MatchEventHandler(l.parserMismatch);
			((CharScanner)source).MisMatchedNotChar	-= new MatchEventHandler(l.parserMismatchNot);
			removeDoneListener(l);
		}
		public virtual void  removeParserTokenListener(ParserTokenListener l)
		{
			((CharScanner)source).ConsumedChar	-= new TokenEventHandler(l.parserConsume);
			((CharScanner)source).CharLA		-= new TokenEventHandler(l.parserLA);
			removeDoneListener(l);
		}
		public virtual void  removeSemanticPredicateListener(SemanticPredicateListener l)
		{
			((CharScanner)source).SemPredEvaluated	-= new SemanticPredicateEventHandler(l.semanticPredicateEvaluated);
			removeDoneListener(l);
		}
		public virtual void  removeSyntacticPredicateListener(SyntacticPredicateListener l)
		{
			((CharScanner)source).SynPredStarted	-= new SyntacticPredicateEventHandler(l.syntacticPredicateStarted);
			((CharScanner)source).SynPredFailed		-= new SyntacticPredicateEventHandler(l.syntacticPredicateFailed);
			((CharScanner)source).SynPredSucceeded	-= new SyntacticPredicateEventHandler(l.syntacticPredicateSucceeded);
			removeDoneListener(l);
		}
		public virtual void  removeTraceListener(TraceListener l)
		{
			((CharScanner)source).EnterRule	-= new TraceEventHandler(l.enterRule);
			((CharScanner)source).ExitRule	-= new TraceEventHandler(l.exitRule);
			removeDoneListener(l);
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/InputBufferListener.cs0000755000175000017500000000055410522211615026132 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public interface InputBufferListener : Listener
	{
		void  inputBufferConsume	(object source, InputBufferEventArgs e);
		void  inputBufferLA			(object source, InputBufferEventArgs e);
		void  inputBufferMark		(object source, InputBufferEventArgs e);
		void  inputBufferRewind		(object source, InputBufferEventArgs e);
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/SemanticPredicateEventArgs.cs0000755000175000017500000000172210522211615027374 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public class SemanticPredicateEventArgs : GuessingEventArgs
	{
		public SemanticPredicateEventArgs()
		{
		}
		public SemanticPredicateEventArgs(int type) : base(type)
		{
		}

		public virtual int Condition
		{
			get	{ return this.condition_;	}
			set	{ this.condition_ = value;	}
		}

		public virtual bool Result
		{
			get	{ return this.result_;	}
			set	{ this.result_ = value;	}
		}

		public const int VALIDATING = 0;
		public const int PREDICTING = 1;

		private int condition_;
		private bool result_;
		
		
		/// This should NOT be called from anyone other than ParserEventSupport! 
		/// 
		internal void  setValues(int type, int condition, bool result, int guessing)
		{
			base.setValues(type, guessing);
			this.Condition	= condition;
			this.Result		= result;
		}

		public override string ToString()
		{
			return "SemanticPredicateEvent [" + Condition + "," + Result + "," + Guessing + "]";
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ParserMatchListener.cs0000755000175000017500000000051210522211615026104 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public interface ParserMatchListener : Listener
	{
		void  parserMatch		(object source, MatchEventArgs e);
		void  parserMatchNot	(object source, MatchEventArgs e);
		void  parserMismatch	(object source, MatchEventArgs e);
		void  parserMismatchNot	(object source, MatchEventArgs e);
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ParserMatchListenerBase.cs0000755000175000017500000000335110522211615026703 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	/// 
	/// Provides an abstract base for implementing  subclasses.
	/// 
	/// 
	///		
	///		This abstract class is provided to make it easier to create s. 
	///		You should extend this base class rather than creating your own.
	///		
	/// 
	public abstract class ParserMatchListenerBase : ParserMatchListener
	{
		/// 
		/// Handle the "Done" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  doneParsing(object source, TraceEventArgs e)
		{
		}

		/// 
		/// Handle the "Match" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  parserMatch(object source, MatchEventArgs e)
		{
		}

		/// 
		/// Handle the "MatchNot" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  parserMatchNot(object source, MatchEventArgs e)
		{
		}
		
		/// 
		/// Handle the "MisMatch" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  parserMismatch(object source, MatchEventArgs e)
		{
		}
		
		/// 
		/// Handle the "MisMatchNot" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  parserMismatchNot(object source, MatchEventArgs e)
		{
		}

		public virtual void  refresh()
		{
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ParserTokenListener.cs0000755000175000017500000000031710522211615026133 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public interface ParserTokenListener : Listener
	{
		void  parserConsume	(object source, TokenEventArgs e);
		void  parserLA		(object source, TokenEventArgs e);
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ParserListenerBase.cs0000755000175000017500000001041710522211615025727 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	/// 
	/// Provides an abstract base for implementing  subclasses.
	/// 
	/// 
	///		
	///		This abstract class is provided to make it easier to create s. 
	///		You should extend this base class rather than creating your own.
	///		
	/// 
	public class ParserListenerBase : ParserListener
	{
		/// 
		/// Handle the "Done" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  doneParsing(object source, TraceEventArgs e)
		{
		}

		/// 
		/// Handle the "EnterRule" event
		/// 
		/// Event source object
		/// Event data object
		public virtual void  enterRule(object source, TraceEventArgs e)
		{
		}

		/// 
		/// Handle the "ExitRule" event
		/// 
		/// Event source object
		/// Event data object
		public virtual void  exitRule(object source, TraceEventArgs e)
		{
		}

		/// 
		/// Handle the "Consume" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  parserConsume(object source, TokenEventArgs e)
		{
		}

		/// 
		/// Handle the "ParserLA" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  parserLA(object source, TokenEventArgs e)
		{
		}

		/// 
		/// Handle the "Match" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  parserMatch(object source, MatchEventArgs e)
		{
		}

		/// 
		/// Handle the "MatchNot" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  parserMatchNot(object source, MatchEventArgs e)
		{
		}
		
		/// 
		/// Handle the "MisMatch" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  parserMismatch(object source, MatchEventArgs e)
		{
		}
		
		/// 
		/// Handle the "MisMatchNot" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  parserMismatchNot(object source, MatchEventArgs e)
		{
		}

		/// 
		/// Handle the "ReportError" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  reportError(object source, MessageEventArgs e)
		{
		}
		
		/// 
		/// Handle the "ReportWarning" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  reportWarning(object source, MessageEventArgs e)
		{
		}
		
		/// 
		/// Handle the "SemPreEvaluated" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  semanticPredicateEvaluated(object source, SemanticPredicateEventArgs e)
		{
		}

		/// 
		/// Handle the "SynPredFailed" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  syntacticPredicateFailed(object source, SyntacticPredicateEventArgs e)
		{
		}

		/// 
		/// Handle the "SynPredStarted" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  syntacticPredicateStarted(object source, SyntacticPredicateEventArgs e)
		{
		}
		
		/// 
		/// Handle the "SynPredSucceeded" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  syntacticPredicateSucceeded(object source, SyntacticPredicateEventArgs e)
		{
		}

		public virtual void  refresh()
		{
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/SyntacticPredicateEventArgs.cs0000755000175000017500000000051410522211615027570 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public class SyntacticPredicateEventArgs : GuessingEventArgs
	{
		
		
		public SyntacticPredicateEventArgs()
		{
		}
		public SyntacticPredicateEventArgs(int type) : base(type)
		{
		}

		public override string ToString()
		{
			return "SyntacticPredicateEvent [" + Guessing + "]";
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/InputBufferListenerBase.cs0000755000175000017500000000340010522211615026716 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	/// 
	/// Provides an abstract base for implementing  subclasses.
	/// 
	/// 
	///		
	///		This abstract class is provided to make it easier to create s. 
	///		You should extend this base class rather than creating your own.
	///		
	/// 
	public abstract class InputBufferListenerBase : InputBufferListener
	{
		/// 
		/// Handle the "Done" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  doneParsing(object source, TraceEventArgs e)
		{
		}

		/// 
		/// Handle the "CharConsumed" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  inputBufferConsume(object source, InputBufferEventArgs e)
		{
		}

		/// 
		/// Handle the "CharLA" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  inputBufferLA(object source, InputBufferEventArgs e)
		{
		}

		/// 
		/// Handle the "Mark" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  inputBufferMark(object source, InputBufferEventArgs e)
		{
		}

		/// 
		/// Handle the "Rewind" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  inputBufferRewind(object source, InputBufferEventArgs e)
		{
		}

		public virtual void  refresh()
		{
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/NewLineListener.cs0000755000175000017500000000022310522211615025233 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public interface NewLineListener : Listener
	{
		void hitNewLine(object source, NewLineEventArgs e);
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/InputBufferEventSupport.cs0000755000175000017500000000611110522211615027016 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	using ArrayList	= System.Collections.ArrayList;

	public class InputBufferEventSupport
	{
		public virtual ArrayList InputBufferListeners
		{
			get
			{
				return inputBufferListeners;
			}
			
		}
		private object source;
		private ArrayList inputBufferListeners;
		private InputBufferEventArgs inputBufferEvent;
		protected internal const int CONSUME = 0;
		protected internal const int LA = 1;
		protected internal const int MARK = 2;
		protected internal const int REWIND = 3;
		
		
		public InputBufferEventSupport(object source)
		{
			inputBufferEvent = new InputBufferEventArgs();
			this.source = source;
		}
		public virtual void  addInputBufferListener(InputBufferListener l)
		{
			if (inputBufferListeners == null)
				inputBufferListeners = new ArrayList();
			inputBufferListeners.Add(l);
		}
		public virtual void  fireConsume(char c)
		{
			inputBufferEvent.setValues(InputBufferEventArgs.CONSUME, c, 0);
			fireEvents(CONSUME, inputBufferListeners);
		}
		public virtual void  fireEvent(int type, Listener l)
		{
			switch (type)
			{
				case CONSUME: 
					((InputBufferListener) l).inputBufferConsume(source, inputBufferEvent); break;
				
				case LA: 
					((InputBufferListener) l).inputBufferLA(source, inputBufferEvent); break;
				
				case MARK: 
					((InputBufferListener) l).inputBufferMark(source, inputBufferEvent); break;
				
				case REWIND: 
					((InputBufferListener) l).inputBufferRewind(source, inputBufferEvent); break;
				
				default: 
					throw new System.ArgumentException("bad type " + type + " for fireEvent()");
				
			}
		}
		public virtual void  fireEvents(int type, ArrayList listeners)
		{
			ArrayList targets = null;
			Listener l = null;
			
			lock(this)
			{
				if (listeners == null)
					return ;
				targets = (ArrayList) listeners.Clone();
			}
			
			if (targets != null)
				 for (int i = 0; i < targets.Count; i++)
				{
					l = (Listener) targets[i];
					fireEvent(type, l);
				}
		}
		public virtual void  fireLA(char c, int la)
		{
			inputBufferEvent.setValues(InputBufferEventArgs.LA, c, la);
			fireEvents(LA, inputBufferListeners);
		}
		public virtual void  fireMark(int pos)
		{
			inputBufferEvent.setValues(InputBufferEventArgs.MARK, ' ', pos);
			fireEvents(MARK, inputBufferListeners);
		}
		public virtual void  fireRewind(int pos)
		{
			inputBufferEvent.setValues(InputBufferEventArgs.REWIND, ' ', pos);
			fireEvents(REWIND, inputBufferListeners);
		}
		protected internal virtual void  refresh(ArrayList listeners)
		{
			ArrayList v;
			lock(listeners)
			{
				v = (ArrayList) listeners.Clone();
			}
			if (v != null)
				 for (int i = 0; i < v.Count; i++)
					((Listener) v[i]).refresh();
		}
		public virtual void  refreshListeners()
		{
			refresh(inputBufferListeners);
		}
		public virtual void  removeInputBufferListener(InputBufferListener l)
		{
			if (inputBufferListeners != null)
			{
				ArrayList temp_arraylist;
				object temp_object;
				temp_arraylist = inputBufferListeners;
				temp_object = l;
				temp_arraylist.Contains(temp_object);
				temp_arraylist.Remove(temp_object);
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/SyntacticPredicateListenerBase.cs0000755000175000017500000000314410522211615030254 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	/// 
	/// Provides an abstract base for implementing  subclasses.
	/// 
	/// 
	///		
	///		This abstract class is provided to make it easier to create s. 
	///		You should extend this base class rather than creating your own.
	///		
	/// 
	public abstract class SyntacticPredicateListenerBase : SyntacticPredicateListener
	{
		/// 
		/// Handle the "Done" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  doneParsing(object source, TraceEventArgs e)
		{
		}

		public virtual void  refresh()
		{
		}

		/// 
		/// Handle the "SynPredFailed" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  syntacticPredicateFailed(object source, SyntacticPredicateEventArgs e)
		{
		}

		/// 
		/// Handle the "SynPredStarted" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  syntacticPredicateStarted(object source, SyntacticPredicateEventArgs e)
		{
		}
		
		/// 
		/// Handle the "SynPredSucceeded" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  syntacticPredicateSucceeded(object source, SyntacticPredicateEventArgs e)
		{
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/SyntacticPredicateListener.cs0000755000175000017500000000054110522211615027457 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public interface SyntacticPredicateListener : Listener
	{
		void  syntacticPredicateFailed		(object source, SyntacticPredicateEventArgs e);
		void  syntacticPredicateStarted		(object source, SyntacticPredicateEventArgs e);
		void  syntacticPredicateSucceeded	(object source, SyntacticPredicateEventArgs e);
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/ParserTokenListenerBase.cs0000755000175000017500000000234710522211615026733 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	/// 
	/// Provides an abstract base for implementing  subclasses.
	/// 
	/// 
	///		
	///		This abstract class is provided to make it easier to create s. 
	///		You should extend this base class rather than creating your own.
	///		
	/// 
	public abstract class ParserTokenListenerBase : ParserTokenListener
	{
		/// 
		/// Handle the "Done" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  doneParsing(object source, TraceEventArgs e)
		{
		}

		public virtual void  refresh()
		{
		}

		/// 
		/// Handle the "Consume" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  parserConsume(object source, TokenEventArgs e)
		{
		}

		/// 
		/// Handle the "ParserLA" event.
		/// 
		/// Event source object
		/// Event data object
		public virtual void  parserLA(object source, TokenEventArgs e)
		{
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/Tracer.cs0000755000175000017500000000127010522211615023407 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public class Tracer : TraceListenerBase, TraceListener
	{
		protected string indentString = "";
		// TBD: should be StringBuffer
		
		
		protected internal virtual void  dedent()
		{
			if (indentString.Length < 2)
				indentString = "";
			else
				indentString = indentString.Substring(2);
		}
		public override void  enterRule(object source, TraceEventArgs e)
		{
			System.Console.Out.WriteLine(indentString + e);
			indent();
		}
		public override void  exitRule(object source, TraceEventArgs e)
		{
			dedent();
			System.Console.Out.WriteLine(indentString + e);
		}
		protected internal virtual void  indent()
		{
			indentString += "  ";
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.debug/TraceListener.cs0000755000175000017500000000030410522211615024730 0ustar  twernertwernernamespace antlr.debug
{
	using System;
	
	public interface TraceListener : Listener
	{
		void  enterRule	(object source, TraceEventArgs e);
		void  exitRule	(object source, TraceEventArgs e);
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/Makefile.in0000755000175000017500000002062210522211615021502 0ustar  twernertwerner##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
@stdvars@
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx

## do not change this value 
subdir=lib/csharp/antlr.runtime

all :: lib

lib: @ANTLR_NET@

antlr_cs_FILES = \
  @abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/ANTLRException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/ANTLRPanicException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/ASTFactory.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/ASTNodeCreator.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/ASTNULLType.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/ASTPair.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/ASTVisitor.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/BaseAST.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/ByteBuffer.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/CharBuffer.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/CharQueue.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/CharScanner.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/CharStreamException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/CharStreamIOException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/CommonAST.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/CommonASTWithHiddenTokens.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/CommonHiddenStreamToken.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/CommonToken.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/DefaultFileLineFormatter.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/DumpASTVisitor.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/FileLineFormatter.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/IHiddenStreamToken.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/InputBuffer.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/IToken.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/LexerSharedInputState.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/LLkParser.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/MismatchedCharException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/MismatchedTokenException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/NoViableAltException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/NoViableAltForCharException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/Parser.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/ParserSharedInputState.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/ParseTree.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/ParseTreeRule.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/ParseTreeToken.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/RecognitionException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/SemanticException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/StringUtils.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenBuffer.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/Token.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenCreator.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenQueue.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenStreamBasicFilter.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenStream.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenStreamException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenStreamHiddenTokenFilter.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenStreamIOException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenStreamRecognitionException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenStreamRetryException.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenStreamRewriteEngine.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenStreamSelector.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TokenWithIndex.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TreeParser.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr/TreeParserSharedInputState.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.collections/AST.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.collections.impl/ASTArray.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.collections.impl/BitSet.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ANTLREventArgs.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/DebuggingCharScanner.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/DebuggingInputBuffer.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/DebuggingParser.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/GuessingEventArgs.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ICharScannerDebugSubject.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/IDebugSubject.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/InputBufferEventArgs.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/InputBufferEventSupport.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/InputBufferListenerBase.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/InputBufferListener.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/InputBufferReporter.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/IParserDebugSubject.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/Listener.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/LLkDebuggingParser.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/MessageEventArgs.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/MessageListenerBase.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/MessageListener.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/NewLineEventArgs.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/NewLineListener.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ParserController.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ParserEventSupport.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ParserListenerBase.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ParserListener.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ParserMatchEventArgs.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ParserMatchListenerBase.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ParserMatchListener.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ParserReporter.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ParserTokenEventArgs.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ParserTokenListenerBase.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ParserTokenListener.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ParseTreeDebugParser.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/ScannerEventSupport.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/SemanticPredicateEventArgs.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/SemanticPredicateListenerBase.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/SemanticPredicateListener.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/SyntacticPredicateEventArgs.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/SyntacticPredicateListenerBase.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/SyntacticPredicateListener.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/TraceEventArgs.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/TraceListenerBase.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/TraceListener.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/antlr.debug/Tracer.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/SupportClass.cs\
	@abs_top_srcdir@/lib/csharp/antlr.runtime/AssemblyInfo.cs\
  $(eof)


clean-target ::
	@ @RMF@ @ANTLR_NET@

@ANTLR_NET@ :: $(antlr_cs_FILES) 
	 @- @RMF@ $@
	 @  @CSHARP_COMPILE_CMD@  $@ $(antlr_cs_FILES)
	 @  test -f  $@ || exit 1

clean ::
	@RMF@ *.obj *.o *.a  *.lib *.so *.dll *~ @ANTLR_NET@

## use this target if you just want to rebuild the lib without
## compiling again.
clean-lib :
	@RMF@ @ANTLR_NET@

distclean :: clean
	@RMF@ Makefile

install :: @ANTLR_NET@ 
	@$(MKDIR) -p "$(libdir)"
	@@ECHO@ "install C# core files .. "
	@for f in @ANTLR_NET@  ; do \
		@ECHO@ "install $${f}" ; \
		if test -f "$${f}" ; then \
			$(INSTALL) -m 444 "$${f}" "$(libdir)" ; \
			$(INSTALL) -m 444 "$${f}" "$(datadir)/$(versioneddir)" ; \
		fi ;\
	done

## dependencies
@ANTLR_NET@        :: Makefile
@ANTLR_NET@        :: @abs_this_builddir@/scripts/csc.sh

## other dependencies to be listed below
@stddeps@
antlr-2.7.7/lib/csharp/antlr.runtime/antlr/0000755000175000017500000000000010522211615020550 5ustar  twernertwernerantlr-2.7.7/lib/csharp/antlr.runtime/antlr/CharStreamException.cs0000755000175000017500000000131610522211615025013 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*
	* Anything that goes wrong while generating a stream of characters
	*/

	[Serializable]
	public class CharStreamException : ANTLRException
	{
		/*
		* CharStreamException constructor comment.
		*/
		public CharStreamException(string s) : base(s)
		{
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/ByteBuffer.cs0000755000175000017500000000450710522211615023145 0ustar  twernertwernerusing System;
using System.Runtime.InteropServices;
using Stream		= System.IO.Stream;
using BinaryReader	= System.IO.BinaryReader;
using IOException	= System.IO.IOException;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*A Stream of characters fed to the lexer from a InputStream that can
	* be rewound via mark()/rewind() methods.
	* 

	* A dynamic array is used to buffer up all the input characters.  Normally,
	* "k" characters are stored in the buffer.  More characters may be stored during
	* guess mode (testing syntactic predicate), or when LT(i>k) is referenced.
	* Consumption of characters is deferred.  In other words, reading the next
	* character is not done by conume(), but deferred until needed by LA or LT.
	* 

	*/

	// SAS: added this class to handle Binary input w/ FileInputStream
	
	public class ByteBuffer:InputBuffer
	{
		
		// char source
		[NonSerialized()]
		internal Stream input;
		
		private const int BUF_SIZE = 16;
		/// 

		/// Small buffer used to avoid reading individual chars
		/// 
		private byte[] buf = new byte[BUF_SIZE];

		
		/*Create a character buffer */
		public ByteBuffer(Stream input_) : base()
		{
			input = input_;
		}
		
		/*Ensure that the character buffer is sufficiently full */
		override public void  fill(int amount)
		{
//			try
//			{
			syncConsume();
			// Fill the buffer sufficiently to hold needed characters
			int bytesToRead = (amount + markerOffset) - queue.Count;
			int c;

			while (bytesToRead > 0)
			{
				// Read a few characters
				c = input.Read(buf, 0, BUF_SIZE);
				for (int i = 0; i < c; i++)
				{
					// Append the next character
					queue.Add(unchecked((char) buf[i]));
				}
				if (c < BUF_SIZE)
				{
					while ((bytesToRead-- > 0) && (queue.Count < BUF_SIZE))
					{
						queue.Add(CharScanner.EOF_CHAR);
					}
					break;
				}
				bytesToRead -= c;
			}
			//			}
//			catch (IOException io)
//			{
//				throw new CharStreamIOException(io);
//			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/IHiddenStreamToken.cs0000644000175000017500000000125610522211615024564 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	public interface IHiddenStreamToken : IToken
	{
		IHiddenStreamToken	getHiddenAfter();
		void				setHiddenAfter(IHiddenStreamToken t);

		IHiddenStreamToken	getHiddenBefore();
		void				setHiddenBefore(IHiddenStreamToken t);
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/CharStreamIOException.cs0000755000175000017500000000136310522211615025245 0ustar  twernertwernerusing System;
using IOException = System.IO.IOException;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	/*
	* Wrap an IOException in a CharStreamException
	*/
	[Serializable]
	public class CharStreamIOException : CharStreamException
	{
		public IOException io;
		
		public CharStreamIOException(IOException io) : base(io.Message)
		{
			this.io = io;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/InputBuffer.cs0000755000175000017500000001037210522211615023336 0ustar  twernertwernernamespace antlr
{
	using System;
	using ArrayList		= System.Collections.ArrayList;
	using StringBuilder	= System.Text.StringBuilder;

	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	// SAS: Added this class to genericise the input buffers for scanners
	//      This allows a scanner to use a binary (FileInputStream) or
	//      text (FileReader) stream of data; the generated scanner
	//      subclass will define the input stream
	//      There are two subclasses to this: CharBuffer and ByteBuffer
	
	/// 
	/// Represents a stream of characters fed to the lexer from that can be rewound 
	/// via mark()/rewind() methods.
	/// 
	/// 
	/// 
	/// A dynamic array is used to buffer up all the input characters.  Normally,
	/// "k" characters are stored in the buffer.  More characters may be stored 
	/// during guess mode (testing syntactic predicate), or when LT(i>k) is referenced.
	/// Consumption of characters is deferred.  In other words, reading the next
	/// character is not done by conume(), but deferred until needed by LA or LT.
	/// 
	/// 
	public abstract class InputBuffer
	{
		// Number of active markers
		protected internal int nMarkers = 0;
		
		// Additional offset used when markers are active
		protected internal int markerOffset = 0;
		
		// Number of calls to consume() since last LA() or LT() call
		protected internal int numToConsume = 0;
		
		// Circular queue
		protected ArrayList	queue;
		
		/*Create an input buffer */
		public InputBuffer()
		{
			queue = new ArrayList();
		}
		
		/*This method updates the state of the input buffer so that
		*  the text matched since the most recent mark() is no longer
		*  held by the buffer.  So, you either do a mark/rewind for
		*  failed predicate or mark/commit to keep on parsing without
		*  rewinding the input.
		*/
		public virtual void  commit()
		{
			nMarkers--;
		}
		
		/*Mark another character for deferred consumption */
		public virtual char consume()
		{
			numToConsume++;
			return LA(1);
		}
		
		/*Ensure that the input buffer is sufficiently full */
		public abstract void  fill(int amount);
		
		public virtual string getLAChars()
		{
			StringBuilder la = new StringBuilder();

			// copy buffer contents to array before looping thru contents (it's usually faster)
			char[] fastBuf = new char[queue.Count-markerOffset];
			queue.CopyTo(fastBuf, markerOffset);

			la.Append(fastBuf);
			return la.ToString();
		}
		
		public virtual string getMarkedChars()
		{
			StringBuilder marked = new StringBuilder();

			// copy buffer contents to array before looping thru contents (it's usually faster)
			char[] fastBuf = new char[queue.Count-markerOffset];
			queue.CopyTo(fastBuf, markerOffset);

			marked.Append(fastBuf);
			return marked.ToString();
		}
		
		public virtual bool isMarked()
		{
			return (nMarkers != 0);
		}
		
		/*Get a lookahead character */
		public virtual char LA(int i)
		{
			fill(i);
			return (char) queue[markerOffset + i - 1];
		}
		
		/*Return an integer marker that can be used to rewind the buffer to
		* its current state.
		*/
		public virtual int mark()
		{
			syncConsume();
			nMarkers++;
			return markerOffset;
		}
		
		/*Rewind the character buffer to a marker.
		* @param mark Marker returned previously from mark()
		*/
		public virtual void  rewind(int mark)
		{
			syncConsume();
			markerOffset = mark;
			nMarkers--;
		}
		
		/*Reset the input buffer
		*/
		public virtual void  reset()
		{
			nMarkers = 0;
			markerOffset = 0;
			numToConsume = 0;
			queue.Clear();
		}
		
		/*Sync up deferred consumption */
		protected internal virtual void  syncConsume()
		{
			if (numToConsume > 0)
			{
				if (nMarkers > 0)
				{
					// guess mode -- leave leading characters and bump offset.
					markerOffset += numToConsume;
				}
				else
				{
					// normal mode -- remove "consumed" characters from buffer
					queue.RemoveRange(0, numToConsume);
				}
				numToConsume = 0;
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/ANTLRException.cs0000755000175000017500000000127210522211615023643 0ustar  twernertwernernamespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	using System;
	
	[Serializable]
	public class ANTLRException : Exception
	{
		public ANTLRException() : base() 
		{
		}

		public ANTLRException(string s) : base(s) 
		{
		}

		public ANTLRException(string s, Exception inner) : base(s, inner)
		{
		}
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenStreamHiddenTokenFilter.cs0000755000175000017500000001125010522211615026620 0ustar  twernertwernerusing System;
using BitSet = antlr.collections.impl.BitSet;
	
namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*This object filters a token stream coming from a lexer
	* or another TokenStream so that only certain token channels
	* get transmitted to the parser.
	*
	* Any of the channels can be filtered off as "hidden" channels whose
	* tokens can be accessed from the parser.
	*/
	public class TokenStreamHiddenTokenFilter : TokenStreamBasicFilter, TokenStream
	{
		// protected BitSet discardMask;
		protected internal BitSet hideMask;
		
		private IHiddenStreamToken nextMonitoredToken;
		
		/*track tail of hidden list emanating from previous
		*  monitored token
		*/
		protected internal IHiddenStreamToken lastHiddenToken;
		
		protected internal IHiddenStreamToken firstHidden = null;
		
		public TokenStreamHiddenTokenFilter(TokenStream input) : base(input)
		{
			hideMask = new BitSet();
		}
		protected internal virtual void  consume()
		{
			nextMonitoredToken = (IHiddenStreamToken) input.nextToken();
		}
		private void  consumeFirst()
		{
			consume(); // get first token of input stream
			
			// Handle situation where hidden or discarded tokens
			// appear first in input stream
			IHiddenStreamToken p = null;
			// while hidden or discarded scarf tokens
			while (hideMask.member(LA(1).Type) || discardMask.member(LA(1).Type))
			{
				if (hideMask.member(LA(1).Type))
				{
					if (p == null)
					{
						p = LA(1);
					}
					else
					{
						p.setHiddenAfter(LA(1));
						LA(1).setHiddenBefore(p); // double-link
						p = LA(1);
					}
					lastHiddenToken = p;
					if (firstHidden == null)
					{
						firstHidden = p; // record hidden token if first
					}
				}
				consume();
			}
		}
		public virtual BitSet getDiscardMask()
		{
			return discardMask;
		}
		/*Return a ptr to the hidden token appearing immediately after
		*  token t in the input stream.
		*/
		public virtual IHiddenStreamToken getHiddenAfter(IHiddenStreamToken t)
		{
			return t.getHiddenAfter();
		}
		/*Return a ptr to the hidden token appearing immediately before
		*  token t in the input stream.
		*/
		public virtual IHiddenStreamToken getHiddenBefore(IHiddenStreamToken t)
		{
			return t.getHiddenBefore();
		}
		public virtual BitSet getHideMask()
		{
			return hideMask;
		}
		/*Return the first hidden token if one appears
		*  before any monitored token.
		*/
		public virtual IHiddenStreamToken getInitialHiddenToken()
		{
			return firstHidden;
		}
		public virtual void  hide(int m)
		{
			hideMask.add(m);
		}
		public virtual void  hide(BitSet mask)
		{
			hideMask = mask;
		}
		protected internal virtual IHiddenStreamToken LA(int i)
		{
			return nextMonitoredToken;
		}
		/*Return the next monitored token.
		*  Test the token following the monitored token.
		*  If following is another monitored token, save it
		*  for the next invocation of nextToken (like a single
		*  lookahead token) and return it then.
		*  If following is unmonitored, nondiscarded (hidden)
		*  channel token, add it to the monitored token.
		*
		*  Note: EOF must be a monitored Token.
		*/
		override public IToken nextToken()
		{
			// handle an initial condition; don't want to get lookahead
			// token of this splitter until first call to nextToken
			if (LA(1) == null)
			{
				consumeFirst();
			}
			
			// we always consume hidden tokens after monitored, thus,
			// upon entry LA(1) is a monitored token.
			IHiddenStreamToken monitored = LA(1);
			// point to hidden tokens found during last invocation
			monitored.setHiddenBefore(lastHiddenToken);
			lastHiddenToken = null;
			
			// Look for hidden tokens, hook them into list emanating
			// from the monitored tokens.
			consume();
			IHiddenStreamToken p = monitored;
			// while hidden or discarded scarf tokens
			while (hideMask.member(LA(1).Type) || discardMask.member(LA(1).Type))
			{
				if (hideMask.member(LA(1).Type))
				{
					// attach the hidden token to the monitored in a chain
					// link forwards
					p.setHiddenAfter(LA(1));
					// link backwards
					if (p != monitored)
					{
						//hidden cannot point to monitored tokens
						LA(1).setHiddenBefore(p);
					}
					p = (lastHiddenToken = LA(1));
				}
				consume();
			}
			return monitored;
		}
		public virtual void resetState()
		{
			firstHidden			= null;
			lastHiddenToken		= null;
			nextMonitoredToken	= null;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/BaseAST.cs0000755000175000017500000003346310522211615022335 0ustar  twernertwernerusing System;
using StringBuilder		= System.Text.StringBuilder;
using ISerializable		= System.Runtime.Serialization.ISerializable;
using TextWriter		= System.IO.TextWriter;
using ArrayList			= System.Collections.ArrayList;
using IEnumerator		= System.Collections.IEnumerator;

using AST				= antlr.collections.AST;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/
	
	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*
	* A Child-Sibling Tree.
	*
	* A tree with PLUS at the root and with two children 3 and 4 is
	* structured as:
	*
	*		PLUS
	*		  |
	*		  3 -- 4
	*
	* and can be specified easily in LISP notation as
	*
	* (PLUS 3 4)
	*
	* where every '(' starts a new subtree.
	*
	* These trees are particular useful for translators because of
	* the flexibility of the children lists.  They are also very easy
	* to walk automatically, whereas trees with specific children
	* reference fields can't easily be walked automatically.
	*
	* This class contains the basic support for an AST.
	* Most people will create ASTs that are subclasses of
	* BaseAST or of CommonAST.
	*/
	[Serializable()] 
	public abstract class BaseAST : AST
	{
		protected internal BaseAST down;
		protected internal BaseAST right;
		
		private static bool verboseStringConversion = false;
		private static string[] tokenNames = null;

		/*Add a node to the end of the child list for this node */
		public virtual void  addChild(AST node)
		{
			if (node == null)
				return ;
			BaseAST t = this.down;
			if (t != null)
			{
				while (t.right != null)
				{
					t = t.right;
				}
				t.right = (BaseAST) node;
			}
			else
			{
				this.down = (BaseAST) node;
			}
		}
		
		private void  doWorkForFindAll(ArrayList v, AST target, bool partialMatch)
		{
			AST sibling;
			
			// Start walking sibling lists, looking for matches.
//siblingWalk: 
			 for (sibling = this; sibling != null; sibling = sibling.getNextSibling())
			{
				if ((partialMatch && sibling.EqualsTreePartial(target)) || (!partialMatch && sibling.EqualsTree(target)))
				{
					v.Add(sibling);
				}
				// regardless of match or not, check any children for matches
				if (sibling.getFirstChild() != null)
				{
					((BaseAST) sibling.getFirstChild()).doWorkForFindAll(v, target, partialMatch);
				}
			}
		}
		
		public override bool Equals(object obj) 
		{      
			if (obj == null) 
				return false;       			
			if (this.GetType() != obj.GetType()) 
				return false;       			
			return Equals((AST)obj);       
		}    
		
		/*Is node t equal to this in terms of token type and text? */
		public virtual bool Equals(AST t)
		{
			if (t == null)
				return false;

			return	(Object.Equals(this.getText(), t.getText())) && 
					(this.Type == t.Type);
		}
		
		/*Is t an exact structural and equals() match of this tree.  The
		*  'this' reference is considered the start of a sibling list.
		*/
		public virtual bool EqualsList(AST t)
		{
			AST sibling;
			
			// the empty tree is not a match of any non-null tree.
			if (t == null)
			{
				return false;
			}
			
			// Otherwise, start walking sibling lists.  First mismatch, return false.
			 for (sibling = this; sibling != null && t != null; sibling = sibling.getNextSibling(), t = t.getNextSibling())
			{
				// as a quick optimization, check roots first.
				if (!sibling.Equals(t))
				{
					return false;
				}
				// if roots match, do full list match test on children.
				if (sibling.getFirstChild() != null)
				{
					if (!sibling.getFirstChild().EqualsList(t.getFirstChild()))
					{
						return false;
					}
				}
				else if (t.getFirstChild() != null)
				{
					return false;
				}
			}
			if (sibling == null && t == null)
			{
				return true;
			}
			// one sibling list has more than the other
			return false;
		}
		
		/*Is 'sub' a subtree of this list?
		*  The siblings of the root are NOT ignored.
		*/
		public virtual bool EqualsListPartial(AST sub)
		{
			AST sibling;
			
			// the empty tree is always a subset of any tree.
			if (sub == null)
			{
				return true;
			}
			
			// Otherwise, start walking sibling lists.  First mismatch, return false.
			 for (sibling = this; sibling != null && sub != null; sibling = sibling.getNextSibling(), sub = sub.getNextSibling())
			{
				// as a quick optimization, check roots first.
				if (!sibling.Equals(sub))
					return false;
				// if roots match, do partial list match test on children.
				if (sibling.getFirstChild() != null)
				{
					if (!sibling.getFirstChild().EqualsListPartial(sub.getFirstChild()))
						return false;
				}
			}
			if (sibling == null && sub != null)
			{
				// nothing left to match in this tree, but subtree has more
				return false;
			}
			// either both are null or sibling has more, but subtree doesn't
			return true;
		}
		
		/*Is tree rooted at 'this' equal to 't'?  The siblings
		*  of 'this' are ignored.
		*/
		public virtual bool EqualsTree(AST t)
		{
			// check roots first.
			if (!this.Equals(t))
				return false;
			// if roots match, do full list match test on children.
			if (this.getFirstChild() != null)
			{
				if (!this.getFirstChild().EqualsList(t.getFirstChild()))
					return false;
			}
			else if (t.getFirstChild() != null)
			{
				return false;
			}
			return true;
		}
		
		/*Is 't' a subtree of the tree rooted at 'this'?  The siblings
		*  of 'this' are ignored.
		*/
		public virtual bool EqualsTreePartial(AST sub)
		{
			// the empty tree is always a subset of any tree.
			if (sub == null)
			{
				return true;
			}
			
			// check roots first.
			if (!this.Equals(sub))
				return false;
			// if roots match, do full list partial match test on children.
			if (this.getFirstChild() != null)
			{
				if (!this.getFirstChild().EqualsListPartial(sub.getFirstChild()))
					return false;
			}
			return true;
		}
		
		/*Walk the tree looking for all exact subtree matches.  Return
		*  an IEnumerator that lets the caller walk the list
		*  of subtree roots found herein.
		*/
		public virtual IEnumerator findAll(AST target)
		{
			ArrayList roots = new ArrayList(10);
			//AST sibling;
			
			// the empty tree cannot result in an enumeration
			if (target == null)
			{
				return null;
			}
			
			doWorkForFindAll(roots, target, false); // find all matches recursively
			
			return roots.GetEnumerator();
		}
		
		/*Walk the tree looking for all subtrees.  Return
		*  an IEnumerator that lets the caller walk the list
		*  of subtree roots found herein.
		*/
		public virtual IEnumerator findAllPartial(AST sub)
		{
			ArrayList roots = new ArrayList(10);
			//AST sibling;
			
			// the empty tree cannot result in an enumeration
			if (sub == null)
			{
				return null;
			}
			
			doWorkForFindAll(roots, sub, true); // find all matches recursively
			
			return roots.GetEnumerator();
		}
		
		/*Get the first child of this node; null if not children */
		public virtual AST getFirstChild()
		{
			return down;
		}
		
		/*Get the next sibling in line after this one */
		public virtual AST getNextSibling()
		{
			return right;
		}
		
		/*Get the token text for this node */
		public virtual string getText()
		{
			return "";
		}
		
		/*Get the token type for this node */
		public virtual int Type
		{
			get { return 0; }
			set { ; }
		}
		
		/// 
		/// Get number of children of this node; if leaf, returns 0
		/// 
		/// Number of children
		public int getNumberOfChildren() 
		{
			BaseAST t = this.down;
			int n = 0;
			if (t != null) 
			{
				n = 1;
				while (t.right != null) 
				{
					t = t.right;
					n++;
				}
			}
			return n;
		}

		public abstract void  initialize(int t, string txt);
		
		public abstract void  initialize(AST t);
		
		public abstract void  initialize(IToken t);
		
		/*Remove all children */
		public virtual void  removeChildren()
		{
			down = null;
		}
		
		public virtual void  setFirstChild(AST c)
		{
			down = (BaseAST) c;
		}
		
		public virtual void  setNextSibling(AST n)
		{
			right = (BaseAST) n;
		}
		
		/*Set the token text for this node */
		public virtual void  setText(string text)
		{
			;
		}
		
		/*Set the token type for this node */
		public virtual void  setType(int ttype)
		{
			this.Type = ttype;
		}
		
		public static void  setVerboseStringConversion(bool verbose, string[] names)
		{
			verboseStringConversion = verbose;
			tokenNames = names;
		}
		
		override public string ToString()
		{
			StringBuilder b = new StringBuilder();
			// if verbose and type name not same as text (keyword probably)
			if (verboseStringConversion && 
					(0 != String.Compare(getText(), (tokenNames[Type]), true)) &&
					(0 != String.Compare(getText(), StringUtils.stripFrontBack(tokenNames[Type], @"""", @""""), true)))
			{
				b.Append('[');
				b.Append(getText());
				b.Append(",<");
				b.Append(tokenNames[Type]);
				b.Append(">]");
				return b.ToString();
			}
			return getText();
		}
		
		/*Print out a child-sibling tree in LISP notation */
		public virtual string ToStringList()
		{
			AST t = this;
			string ts = "";
			if (t.getFirstChild() != null)
				ts += " (";
			ts += " " + this.ToString();
			if (t.getFirstChild() != null)
			{
				ts += ((BaseAST) t.getFirstChild()).ToStringList();
			}
			if (t.getFirstChild() != null)
				ts += " )";
			if (t.getNextSibling() != null)
			{
				ts += ((BaseAST) t.getNextSibling()).ToStringList();
			}
			return ts;
		}
		
		public virtual string ToStringTree() 
		{
			AST t = this;
			string ts = "";
			if (t.getFirstChild() != null) 
			{
				ts += " (";
			}
			ts += " " + this.ToString();
			if (t.getFirstChild() != null)
			{
				ts += ((BaseAST) t.getFirstChild()).ToStringList();
			}
			if (t.getFirstChild() != null)
			{
				ts += " )";
			}
			return ts;
		 }

		public virtual string ToTree()
		{
			return ToTree(string.Empty);
		}
		
		public virtual string ToTree(string prefix) 
		{
			StringBuilder sb = new StringBuilder(prefix);
		
			// Replace vertical bar if there is no next sibling.
			if ( (getNextSibling() == null) )
				sb.Append("+--");
			else
				sb.Append("|--");
		
			sb.Append( ToString() );
			sb.Append( Environment.NewLine );

			if ( getFirstChild() != null ) 
			{
				// Replace vertical bar if there is no next sibling.
				if ( getNextSibling() == null )
					sb.Append( ((BaseAST) getFirstChild()).ToTree(prefix + "   ") );
				else
					sb.Append( ((BaseAST) getFirstChild()).ToTree(prefix + "|  ") );
			}

			if ( getNextSibling() != null )
				sb.Append( ((BaseAST) getNextSibling()).ToTree(prefix) );

			return sb.ToString();
		}

		public static string decode(string text)
		{
			char c, c1, c2, c3, c4, c5;
			StringBuilder n = new StringBuilder();
			 for (int i = 0; i < text.Length; i++)
			{
				c = text[i];
				if (c == '&')
				{
					c1 = text[i + 1];
					c2 = text[i + 2];
					c3 = text[i + 3];
					c4 = text[i + 4];
					c5 = text[i + 5];
					
					if (c1 == 'a' && c2 == 'm' && c3 == 'p' && c4 == ';')
					{
						n.Append("&");
						i += 5;
					}
					else if (c1 == 'l' && c2 == 't' && c3 == ';')
					{
						n.Append("<");
						i += 4;
					}
					else if (c1 == 'g' && c2 == 't' && c3 == ';')
					{
						n.Append(">");
						i += 4;
					}
					else if (c1 == 'q' && c2 == 'u' && c3 == 'o' && c4 == 't' && c5 == ';')
					{
						n.Append("\"");
						i += 6;
					}
					else if (c1 == 'a' && c2 == 'p' && c3 == 'o' && c4 == 's' && c5 == ';')
					{
						n.Append("'");
						i += 6;
					}
					else
						n.Append("&");
				}
				else
					n.Append(c);
			}
			return n.ToString();
		}
		
		public static string encode(string text)
		{
			char c;
			StringBuilder n = new StringBuilder();
			 for (int i = 0; i < text.Length; i++)
			{
				c = text[i];
				switch (c)
				{
					case '&': 
					{
						n.Append("&");
						break;
					}
					
					case '<': 
					{
						n.Append("<");
						break;
					}
					
					case '>': 
					{
						n.Append(">");
						break;
					}
					
					case '"': 
					{
						n.Append(""");
						break;
					}
					
					case '\'': 
					{
						n.Append("'");
						break;
					}
					
					default: 
					{
						n.Append(c);
						break;
					}
					
				}
			}
			return n.ToString();
		}
		
		public virtual void  xmlSerializeNode(TextWriter outWriter)
		{
			StringBuilder buf = new StringBuilder(100);
			buf.Append("<");
			buf.Append(GetType().FullName + " ");
			buf.Append("text=\"" + encode(getText()) + "\" type=\"" + Type + "\"/>");
			outWriter.Write(buf.ToString());
		}
		
		public virtual void  xmlSerializeRootOpen(TextWriter outWriter)
		{
			StringBuilder buf = new StringBuilder(100);
			buf.Append("<");
			buf.Append(GetType().FullName + " ");
			buf.Append("text=\"" + encode(getText()) + "\" type=\"" + Type + "\">\n");
			outWriter.Write(buf.ToString());
		}
		
		public virtual void  xmlSerializeRootClose(TextWriter outWriter)
		{
			outWriter.Write("\n");
		}
		
		public virtual void  xmlSerialize(TextWriter outWriter)
		{
			// print out this node and all siblings
			 for (AST node = this; node != null; node = node.getNextSibling())
			{
				if (node.getFirstChild() == null)
				{
					// print guts (class name, attributes)
					((BaseAST) node).xmlSerializeNode(outWriter);
				}
				else
				{
					((BaseAST) node).xmlSerializeRootOpen(outWriter);
					
					// print children
					((BaseAST) node.getFirstChild()).xmlSerialize(outWriter);
					
					// print end tag
					((BaseAST) node).xmlSerializeRootClose(outWriter);
				}
			}
		}

		#region Implementation of ICloneable
		[Obsolete("Deprecated since version 2.7.2. Use ASTFactory.dup() instead.", false)]
		public virtual object Clone()
		{
			return MemberwiseClone();
		}
		#endregion

		public override Int32 GetHashCode() 
		{
			return base.GetHashCode();
		}	
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/ParseTree.cs0000644000175000017500000000365110522211615022776 0ustar  twernertwernernamespace antlr
{
	/* ANTLR Translator Generator
	 * Project led by Terence Parr at http://www.jGuru.com
	 * Software rights: http://www.antlr.org/license.html
	 */

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//

	using System;
	using StringBuilder 	= System.Text.StringBuilder;
	using AST 				= antlr.collections.AST;

	public abstract class ParseTree : BaseAST
	{
		/// 
		/// Walk parse tree and return requested number of derivation steps.
		/// If steps less-than 0, return node text.  If steps equals 1, return derivation
		/// string at step.
		/// 
		/// derivation steps
		/// 
		public string getLeftmostDerivationStep(int step) 
		{
			if ( step <= 0 ) 
			{
				return ToString();
			}
			StringBuilder buf = new StringBuilder (2000);
			getLeftmostDerivation(buf, step);
			return buf.ToString();
		}

		public string getLeftmostDerivation(int maxSteps)
		{
			StringBuilder buf = new StringBuilder(2000);
			buf.Append("    " + this.ToString());
			buf.Append("\n");
			for (int d=1; d < maxSteps; d++) 
			{
				buf.Append(" =>");
				buf.Append(getLeftmostDerivationStep(d));
				buf.Append("\n");
			}
			return buf.ToString();
		}

		/// 
		/// Get derivation and return how many you did (less than requested for
		/// subtree roots.
		/// 
		/// string buffer
		/// derivation steps
		/// 
		protected internal abstract int getLeftmostDerivation(StringBuilder buf, int step);

		// just satisfy BaseAST interface; unused as we manually create nodes

		public override void initialize(int i, string s) 
		{
		}
		
		public override void initialize(AST ast) 
		{
		}
		
		public override void initialize(IToken token) 
		{
		}
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/antlr/LLkParser.cs0000755000175000017500000000425710522211615022751 0ustar  twernertwernerusing System;
	
namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*An LL(k) parser.
	*
	* @see antlr.Token
	* @see antlr.TokenBuffer
	* @see antlr.LL1Parser
	*/
	public class LLkParser : Parser
	{
		internal int k;
		
		public LLkParser(int k_)
		{
			k = k_;
		}
		public LLkParser(ParserSharedInputState state, int k_)
		{
			k = k_;
			inputState = state;
		}
		public LLkParser(TokenBuffer tokenBuf, int k_)
		{
			k = k_;
			setTokenBuffer(tokenBuf);
		}
		public LLkParser(TokenStream lexer, int k_)
		{
			k = k_;
			TokenBuffer tokenBuf = new TokenBuffer(lexer);
			setTokenBuffer(tokenBuf);
		}
		/*Consume another token from the input stream.  Can only write sequentially!
		* If you need 3 tokens ahead, you must consume() 3 times.
		* 

		* Note that it is possible to overwrite tokens that have not been matched.
		* For example, calling consume() 3 times when k=2, means that the first token
		* consumed will be overwritten with the 3rd.
		*/
		override public void  consume()
		{
			inputState.input.consume();
		}
		override public int LA(int i)
		{
			return inputState.input.LA(i);
		}
		override public IToken LT(int i)
		{
			return inputState.input.LT(i);
		}
		private void  trace(string ee, string rname)
		{
			traceIndent();
			Console.Out.Write(ee + rname + ((inputState.guessing > 0)?"; [guessing]":"; "));
			 for (int i = 1; i <= k; i++)
			{
				if (i != 1)
				{
					Console.Out.Write(", ");
				}
				if ( LT(i)!=null ) {
					Console.Out.Write("LA(" + i + ")==" + LT(i).getText());
				}
				else 
				{
					Console.Out.Write("LA(" + i + ")==ull");
				}
			}
			Console.Out.WriteLine("");
		}
		override public void  traceIn(string rname)
		{
			traceDepth += 1;
			trace("> ", rname);
		}
		override public void  traceOut(string rname)
		{
			trace("< ", rname);
			traceDepth -= 1;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TreeParserSharedInputState.cs0000755000175000017500000000150110522211615026323 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*This object contains the data associated with an
	*  input AST.  Multiple parsers
	*  share a single TreeParserSharedInputState to parse
	*  the same tree or to have the parser walk multiple
	*  trees.
	*/

	public class TreeParserSharedInputState
	{
		/*Are we guessing (guessing>0)? */
		public int guessing = 0;

		public virtual void reset()
		{
			guessing = 0;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/ASTPair.cs0000755000175000017500000000303710522211615022350 0ustar  twernertwernernamespace antlr
{
	using System;
	using Queue = System.Collections.Queue;
	using AST	= antlr.collections.AST;

	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//


	/*ASTPair:  utility class used for manipulating a pair of ASTs
	* representing the current AST root and current AST sibling.
	* This exists to compensate for the lack of pointers or 'var'
	* arguments in Java.
	*/

	public struct ASTPair
	{
		public AST root; // current root of tree
		public AST child; // current child to which siblings are added
		
		/*Make sure that child is the last sibling */
		public void  advanceChildToEnd()
		{
			if (child != null)
			{
				while (child.getNextSibling() != null)
				{
					child = child.getNextSibling();
				}
			}
		}
		
		/*Copy an ASTPair.  Don't call it clone() because we want type-safety */
		public ASTPair copy()
		{
			ASTPair tmp = new ASTPair();
			tmp.root = root;
			tmp.child = child;
			return tmp;
		}

		private void reset()
		{
			root  = null;
			child = null;
		}
		
		override public string ToString()
		{
			string r = (root == null) ? "null" : root.getText();
			string c = (child == null) ? "null" : child.getText();
			return "[" + r + "," + c + "]";
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/Parser.cs0000755000175000017500000003665110522211615022351 0ustar  twernertwernerusing System;
using EventHandlerList			= System.ComponentModel.EventHandlerList;

using BitSet					= antlr.collections.impl.BitSet;
using AST						= antlr.collections.AST;
using ASTArray					= antlr.collections.impl.ASTArray;
using antlr.debug;

using MessageListener				= antlr.debug.MessageListener;
using ParserListener				= antlr.debug.ParserListener;
using ParserMatchListener			= antlr.debug.ParserMatchListener;
using ParserTokenListener			= antlr.debug.ParserTokenListener;
using SemanticPredicateListener		= antlr.debug.SemanticPredicateListener;
using SyntacticPredicateListener	= antlr.debug.SyntacticPredicateListener;
using TraceListener					= antlr.debug.TraceListener;

/*
	private Vector messageListeners;
	private Vector newLineListeners;
	private Vector matchListeners;
	private Vector tokenListeners;
	private Vector semPredListeners;
	private Vector synPredListeners;
	private Vector traceListeners;
*/
	
namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	public abstract class Parser : IParserDebugSubject
	{
		// Used to store event delegates
		private EventHandlerList events_ = new EventHandlerList();

		protected internal EventHandlerList Events 
		{
			get	{ return events_;	}
		}

		// The unique keys for each event that Parser [objects] can generate
		internal static readonly object EnterRuleEventKey		= new object();
		internal static readonly object ExitRuleEventKey			= new object();
		internal static readonly object DoneEventKey				= new object();
		internal static readonly object ReportErrorEventKey		= new object();
		internal static readonly object ReportWarningEventKey	= new object();
		internal static readonly object NewLineEventKey			= new object();
		internal static readonly object MatchEventKey			= new object();
		internal static readonly object MatchNotEventKey			= new object();
		internal static readonly object MisMatchEventKey			= new object();
		internal static readonly object MisMatchNotEventKey		= new object();
		internal static readonly object ConsumeEventKey			= new object();
		internal static readonly object LAEventKey				= new object();
		internal static readonly object SemPredEvaluatedEventKey	= new object();
		internal static readonly object SynPredStartedEventKey	= new object();
		internal static readonly object SynPredFailedEventKey	= new object();
		internal static readonly object SynPredSucceededEventKey	= new object();

		protected internal ParserSharedInputState inputState;
		
		/*Nesting level of registered handlers */
		// protected int exceptionLevel = 0;
		
		/*Table of token type to token names */
		protected internal string[] tokenNames;
		
		/*AST return value for a rule is squirreled away here */
		protected internal AST returnAST;
		
		/*AST support code; parser and treeparser delegate to this object */
		protected internal ASTFactory astFactory = new ASTFactory();
		
		private bool ignoreInvalidDebugCalls = false;
		
		/*Used to keep track of indentdepth for traceIn/Out */
		protected internal int traceDepth = 0;
		
		public Parser()
		{
			inputState = new ParserSharedInputState();
		}
		
		public Parser(ParserSharedInputState state)
		{
			inputState = state;
		}
		
		/// 

		/// 
		/// 

		public event TraceEventHandler EnterRule
		{
			add		{	Events.AddHandler(EnterRuleEventKey, value);	}
			remove	{	Events.RemoveHandler(EnterRuleEventKey, value);	}
		}

		public event TraceEventHandler ExitRule
		{
			add		{	Events.AddHandler(ExitRuleEventKey, value);		}
			remove	{	Events.RemoveHandler(ExitRuleEventKey, value);	}
		}

		public event TraceEventHandler Done
		{
			add		{	Events.AddHandler(DoneEventKey, value);		}
			remove	{	Events.RemoveHandler(DoneEventKey, value);	}
		}

		public event MessageEventHandler ErrorReported
		{
			add		{	Events.AddHandler(ReportErrorEventKey, value);		}
			remove	{	Events.RemoveHandler(ReportErrorEventKey, value);	}
		}

		public event MessageEventHandler WarningReported
		{
			add		{	Events.AddHandler(ReportWarningEventKey, value);	}
			remove	{	Events.RemoveHandler(ReportWarningEventKey, value);	}
		}

		public event MatchEventHandler MatchedToken
		{
			add		{	Events.AddHandler(MatchEventKey, value);	}
			remove	{	Events.RemoveHandler(MatchEventKey, value);	}
		}

		public event MatchEventHandler MatchedNotToken
		{
			add		{	Events.AddHandler(MatchNotEventKey, value);		}
			remove	{	Events.RemoveHandler(MatchNotEventKey, value);	}
		}

		public event MatchEventHandler MisMatchedToken
		{
			add		{	Events.AddHandler(MisMatchEventKey, value);		}
			remove	{	Events.RemoveHandler(MisMatchEventKey, value);	}
		}

		public event MatchEventHandler MisMatchedNotToken
		{
			add		{	Events.AddHandler(MisMatchNotEventKey, value);		}
			remove	{	Events.RemoveHandler(MisMatchNotEventKey, value);	}
		}

		public event TokenEventHandler ConsumedToken
		{
			add		{	Events.AddHandler(ConsumeEventKey, value);		}
			remove	{	Events.RemoveHandler(ConsumeEventKey, value);	}
		}

		public event TokenEventHandler TokenLA
		{
			add		{	Events.AddHandler(LAEventKey, value);		}
			remove	{	Events.RemoveHandler(LAEventKey, value);	}
		}

		public event SemanticPredicateEventHandler SemPredEvaluated
		{
			add		{	Events.AddHandler(SemPredEvaluatedEventKey, value);		}
			remove	{	Events.RemoveHandler(SemPredEvaluatedEventKey, value);	}
		}

		public event SyntacticPredicateEventHandler SynPredStarted
		{
			add		{	Events.AddHandler(SynPredStartedEventKey, value);		}
			remove	{	Events.RemoveHandler(SynPredStartedEventKey, value);	}
		}

		public event SyntacticPredicateEventHandler SynPredFailed
		{
			add		{	Events.AddHandler(SynPredFailedEventKey, value);	}
			remove	{	Events.RemoveHandler(SynPredFailedEventKey, value);	}
		}

		public event SyntacticPredicateEventHandler SynPredSucceeded
		{
			add		{	Events.AddHandler(SynPredSucceededEventKey, value);		}
			remove	{	Events.RemoveHandler(SynPredSucceededEventKey, value);	}
		}

		
		public virtual void  addMessageListener(MessageListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.ArgumentException("addMessageListener() is only valid if parser built for debugging");
		}
		
		public virtual void  addParserListener(ParserListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.ArgumentException("addParserListener() is only valid if parser built for debugging");
		}
		
		public virtual void  addParserMatchListener(ParserMatchListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.ArgumentException("addParserMatchListener() is only valid if parser built for debugging");
		}
		
		public virtual void  addParserTokenListener(ParserTokenListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.ArgumentException("addParserTokenListener() is only valid if parser built for debugging");
		}
		
		public virtual void  addSemanticPredicateListener(SemanticPredicateListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.ArgumentException("addSemanticPredicateListener() is only valid if parser built for debugging");
		}
		
		public virtual void  addSyntacticPredicateListener(SyntacticPredicateListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.ArgumentException("addSyntacticPredicateListener() is only valid if parser built for debugging");
		}
		
		public virtual void  addTraceListener(TraceListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.ArgumentException("addTraceListener() is only valid if parser built for debugging");
		}
		
		/*Get another token object from the token stream */
		public abstract void  consume();
		/*Consume tokens until one matches the given token */
		public virtual void  consumeUntil(int tokenType)
		{
			while (LA(1) != Token.EOF_TYPE && LA(1) != tokenType)
			{
				consume();
			}
		}
		/*Consume tokens until one matches the given token set */
		public virtual void  consumeUntil(BitSet bset)
		{
			while (LA(1) != Token.EOF_TYPE && !bset.member(LA(1)))
			{
				consume();
			}
		}
		protected internal virtual void  defaultDebuggingSetup(TokenStream lexer, TokenBuffer tokBuf)
		{
			// by default, do nothing -- we're not debugging
		}
		/*Get the AST return value squirreled away in the parser */
		public virtual AST getAST()
		{
			return returnAST;
		}
		public virtual ASTFactory getASTFactory()
		{
			return astFactory;
		}
		public virtual string getFilename()
		{
			return inputState.filename;
		}
		
		public virtual ParserSharedInputState getInputState()
		{
			return inputState;
		}
		
		public virtual void  setInputState(ParserSharedInputState state)
		{
			inputState = state;
		}
		
		public virtual void resetState()
		{
			traceDepth = 0;
			inputState.reset();
		}

		public virtual string getTokenName(int num)
		{
			return tokenNames[num];
		}
		public virtual string[] getTokenNames()
		{
			return tokenNames;
		}
		public virtual bool isDebugMode()
		{
			return false;
		}
		/*Return the token type of the ith token of lookahead where i=1
		* is the current token being examined by the parser (i.e., it
		* has not been matched yet).
		*/
		public abstract int LA(int i);
		/*Return the ith token of lookahead */
		public abstract IToken LT(int i);
		// Forwarded to TokenBuffer
		public virtual int mark()
		{
			return inputState.input.mark();
		}
		/*Make sure current lookahead symbol matches token type t.
		* Throw an exception upon mismatch, which is catch by either the
		* error handler or by the syntactic predicate.
		*/
		public virtual void  match(int t)
		{
			if (LA(1) != t)
				throw new MismatchedTokenException(tokenNames, LT(1), t, false, getFilename());
			else
				consume();
		}
		/*Make sure current lookahead symbol matches the given set
		* Throw an exception upon mismatch, which is catch by either the
		* error handler or by the syntactic predicate.
		*/
		public virtual void  match(BitSet b)
		{
			if (!b.member(LA(1)))
				throw new MismatchedTokenException(tokenNames, LT(1), b, false, getFilename());
			else
				consume();
		}
		public virtual void  matchNot(int t)
		{
			if (LA(1) == t)
				throw new MismatchedTokenException(tokenNames, LT(1), t, true, getFilename());
			else
				consume();
		}

		/// 
		/// @deprecated as of 2.7.2. This method calls System.exit() and writes
		/// directly to stderr, which is usually not appropriate when
		/// a parser is embedded into a larger application. Since the method is
		/// static, it cannot be overridden to avoid these problems.
		/// ANTLR no longer uses this method internally or in generated code.
		/// 
		/// 
		[Obsolete("De-activated since version 2.7.2.6 as it cannot be overidden.", true)]
		public static void  panic()
		{
			System.Console.Error.WriteLine("Parser: panic");
			System.Environment.Exit(1);
		}

		public virtual void  removeMessageListener(MessageListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.SystemException("removeMessageListener() is only valid if parser built for debugging");
		}
		public virtual void  removeParserListener(ParserListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.SystemException("removeParserListener() is only valid if parser built for debugging");
		}
		public virtual void  removeParserMatchListener(ParserMatchListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.SystemException("removeParserMatchListener() is only valid if parser built for debugging");
		}
		public virtual void  removeParserTokenListener(ParserTokenListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.SystemException("removeParserTokenListener() is only valid if parser built for debugging");
		}
		public virtual void  removeSemanticPredicateListener(SemanticPredicateListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.ArgumentException("removeSemanticPredicateListener() is only valid if parser built for debugging");
		}
		public virtual void  removeSyntacticPredicateListener(SyntacticPredicateListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.ArgumentException("removeSyntacticPredicateListener() is only valid if parser built for debugging");
		}
		public virtual void  removeTraceListener(TraceListener l)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.SystemException("removeTraceListener() is only valid if parser built for debugging");
		}
		
		/*Parser error-reporting function can be overridden in subclass */
		public virtual void reportError(RecognitionException ex)
		{
			Console.Error.WriteLine(ex);
		}
		
		/*Parser error-reporting function can be overridden in subclass */
		public virtual void reportError(string s)
		{
			if (getFilename() == null)
			{
				Console.Error.WriteLine("error: " + s);
			}
			else
			{
				Console.Error.WriteLine(getFilename() + ": error: " + s);
			}
		}
		
		/*Parser warning-reporting function can be overridden in subclass */
		public virtual void  reportWarning(string s)
		{
			if (getFilename() == null)
			{
				Console.Error.WriteLine("warning: " + s);
			}
			else
			{
				Console.Error.WriteLine(getFilename() + ": warning: " + s);
			}
		}
		
		public virtual void recover(RecognitionException ex, BitSet tokenSet)
		{
			consume();
			consumeUntil(tokenSet);
		}
		
		public virtual void  rewind(int pos)
		{
			inputState.input.rewind(pos);
		}

		/// 
		/// Specify an object with support code (shared by Parser and TreeParser.
		/// Normally, the programmer does not play with this, using 
		///  instead.
		/// 
		/// 
		public virtual void  setASTFactory(ASTFactory f)
		{
			astFactory = f;
		}

		/// 
		/// Specify the type of node to create during tree building. 
		/// 
		/// Fully qualified AST Node type name.
		public virtual void  setASTNodeClass(string cl)
		{
			astFactory.setASTNodeType(cl);
		}

		/// 
		/// Specify the type of node to create during tree building. 
		/// use  now to be consistent with 
		/// Token Object Type accessor.
		/// 
		/// Fully qualified AST Node type name.
		[Obsolete("Replaced by setASTNodeClass(string) since version 2.7.1", true)]
		public virtual void  setASTNodeType(string nodeType)
		{
			setASTNodeClass(nodeType);
		}

		public virtual void  setDebugMode(bool debugMode)
		{
			if (!ignoreInvalidDebugCalls)
				throw new System.SystemException("setDebugMode() only valid if parser built for debugging");
		}
		public virtual void  setFilename(string f)
		{
			inputState.filename = f;
		}
		public virtual void  setIgnoreInvalidDebugCalls(bool Value)
		{
			ignoreInvalidDebugCalls = Value;
		}
		/*Set or change the input token buffer */
		public virtual void  setTokenBuffer(TokenBuffer t)
		{
			inputState.input = t;
		}
		
		public virtual void  traceIndent()
		{
			 for (int i = 0; i < traceDepth; i++)
				Console.Out.Write(" ");
		}
		public virtual void  traceIn(string rname)
		{
			traceDepth += 1;
			traceIndent();
			Console.Out.WriteLine("> " + rname + "; LA(1)==" + LT(1).getText() + ((inputState.guessing > 0)?" [guessing]":""));
		}
		public virtual void  traceOut(string rname)
		{
			traceIndent();
			Console.Out.WriteLine("< " + rname + "; LA(1)==" + LT(1).getText() + ((inputState.guessing > 0)?" [guessing]":""));
			traceDepth -= 1;
		}
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/antlr/ANTLRPanicException.cs0000755000175000017500000000132310522211615024613 0ustar  twernertwernernamespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	using System;
	
	[Serializable]
	public class ANTLRPanicException : ANTLRException 
	{
		public ANTLRPanicException() : base() 
		{
		}

		public ANTLRPanicException(string s) : base(s)
		{
		}

		public ANTLRPanicException(string s, Exception inner) : base(s, inner)
		{
		}
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/antlr/ASTNULLType.cs0000755000175000017500000000431510522211615023071 0ustar  twernertwernerusing System;
using IEnumerator		= System.Collections.IEnumerator;

using AST				= antlr.collections.AST;
using Token				= antlr.Token;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/
	
	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*There is only one instance of this class **/
	public class ASTNULLType : AST
	{
		public virtual void  addChild(AST c) {}

		public virtual bool Equals(AST t)
		{
			return false;
		}
		public virtual bool EqualsList(AST t)
		{
			return false;
		}
		public virtual bool EqualsListPartial(AST t)
		{
			return false;
		}
		public virtual bool EqualsTree(AST t)
		{
			return false;
		}
		public virtual bool EqualsTreePartial(AST t)
		{
			return false;
		}
		public virtual IEnumerator findAll(AST tree)
		{
			return null;
		}
		public virtual IEnumerator findAllPartial(AST subtree)
		{
			return null;
		}
		public virtual AST getFirstChild()
		{
			return this;
		}
		public virtual AST getNextSibling()
		{
			return this;
		}
		public virtual string getText()
		{
			return "";
		}
		public virtual int Type
		{
			get { return Token.NULL_TREE_LOOKAHEAD; }
			set { ; }
		}
		public int getNumberOfChildren() 
		{
			return 0;
		}
		public virtual void  initialize(int t, string txt)
		{
		}
		public virtual void  initialize(AST t)
		{
		}
		public virtual void  initialize(IToken t)
		{
		}
		public virtual void  setFirstChild(AST c)
		{
			;
		}
		public virtual void  setNextSibling(AST n)
		{
			;
		}
		public virtual void  setText(string text)
		{
			;
		}
		public virtual void  setType(int ttype)
		{
			this.Type = ttype;
		}
		override public string ToString()
		{
			return getText();
		}
		public virtual string ToStringList()
		{
			return getText();
		}
		public virtual string ToStringTree()
		{
			return getText();
		}

		#region Implementation of ICloneable
		public object Clone()
		{
			return MemberwiseClone();
		}
		#endregion
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenCreator.cs0000644000175000017500000000231510522211615023500 0ustar  twernertwernernamespace antlr
{
	using System;

	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/
	
	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//

	/// 
	/// A creator of Token object instances.
	/// 
	/// 
	/// 
	/// This class and it's sub-classes exists primarily as an optimization
	/// of the reflection-based mechanism(s) previously used exclusively to 
	/// create instances of Token objects.
	/// 
	/// 
	/// Since Lexers in ANTLR use a single Token type, each TokenCreator can 
	/// create one class of Token objects (that's why it's not called TokenFactory).
	/// 
	/// 
	public abstract class TokenCreator
	{
		/// 
		/// Returns the fully qualified name of the Token type that this
		/// class creates.
		/// 
		public abstract string TokenTypeName
		{
			get;
		}

		/// 
		/// Constructs a  instance.
		/// 
		public abstract IToken Create();
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenStreamRetryException.cs0000755000175000017500000000135510522211615026247 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*
	* Aborted recognition of current token. Try to get one again.
	* Used by TokenStreamSelector.retry() to force nextToken()
	* of stream to re-enter and retry.
	*/

	[Serializable]
	public class TokenStreamRetryException : TokenStreamException
	{
		public TokenStreamRetryException() {}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/DumpASTVisitor.cs0000755000175000017500000000334710522211615023746 0ustar  twernertwernerusing System;

using AST			= antlr.collections.AST;

namespace antlr
{
	/* ANTLR Translator Generator
	 * Project led by Terence Parr at http://www.jGuru.com
	 * Software rights: http://www.antlr.org/license.html
	 *
	 * $Id:$
	 */

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	/// 
	/// Summary description for DumpASTVisitor.
	/// 
	/** Simple class to dump the contents of an AST to the output */
	public class DumpASTVisitor : ASTVisitor 
	{
		protected int level = 0;


		private void tabs() 
		{
			for (int i = 0; i < level; i++) 
			{
				Console.Out.Write("   ");
			}
		}

		public void visit(AST node) 
		{
			// Flatten this level of the tree if it has no children
			bool flatten = /*true*/ false;
			AST node2;
			for (node2 = node; node2 != null; node2 = node2.getNextSibling()) 
			{
				if (node2.getFirstChild() != null) 
				{
					flatten = false;
					break;
				}
			}

			for (node2 = node; node2 != null; node2 = node2.getNextSibling()) 
			{
				if (!flatten || node2 == node) 
				{
					tabs();
				}
				if (node2.getText() == null) 
				{
					Console.Out.Write("nil");
				}
				else 
				{
					Console.Out.Write(node2.getText());
				}

				Console.Out.Write(" [" + node2.Type + "] ");

				if (flatten) 
				{
					Console.Out.Write(" ");
				}
				else 
				{
					Console.Out.WriteLine("");
				}

				if (node2.getFirstChild() != null) 
				{
					level++;
					visit(node2.getFirstChild());
					level--;
				}
			}

			if (flatten) 
			{
				Console.Out.WriteLine("");
			}
		}
	}  
}


antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenStreamBasicFilter.cs0000755000175000017500000000245310522211615025452 0ustar  twernertwernerusing System;
using BitSet = antlr.collections.impl.BitSet;
	
namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*This object is a TokenStream that passes through all
	*  tokens except for those that you tell it to discard.
	*  There is no buffering of the tokens.
	*/
	public class TokenStreamBasicFilter : TokenStream
	{
		/*The set of token types to discard */
		protected internal BitSet discardMask;
		
		/*The input stream */
		protected internal TokenStream input;
		
		public TokenStreamBasicFilter(TokenStream input)
		{
			this.input = input;
			discardMask = new BitSet();
		}
		public virtual void  discard(int ttype)
		{
			discardMask.add(ttype);
		}
		public virtual void  discard(BitSet mask)
		{
			discardMask = mask;
		}
		public virtual IToken nextToken()
		{
			IToken tok = input.nextToken();
			while (tok != null && discardMask.member(tok.Type))
			{
				tok = input.nextToken();
			}
			return tok;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/DefaultFileLineFormatter.cs0000755000175000017500000000177210522211615025771 0ustar  twernertwernerusing System;
using StringBuilder			= System.Text.StringBuilder;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/
	
	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	public class DefaultFileLineFormatter : FileLineFormatter
	{
		public override string getFormatString(string fileName, int line, int column)
		{
			StringBuilder buf = new StringBuilder();
			
			if (fileName != null)
				buf.Append(fileName + ":");
			
			if (line != - 1)
			{
				if (fileName == null)
					buf.Append("line ");
				
				buf.Append(line);
				
				if (column != - 1)
					buf.Append(":" + column);
				
				buf.Append(":");
			}
			
			buf.Append(" ");
			
			return buf.ToString();
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/CharQueue.cs0000755000175000017500000000525210522211615022770 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	/*A circular buffer object used by CharBuffer */
	public class CharQueue
	{
		/*Physical circular buffer of tokens */
		protected internal char[] buffer;
		/*buffer.length-1 for quick modulos */
		private int sizeLessOne;
		/*physical index of front token */
		private int offset;
		/*number of tokens in the queue */
		protected internal int nbrEntries;
		
		public CharQueue(int minSize)
		{
			// Find first power of 2 >= to requested size
			int size;
			if (minSize < 0)
			{
				init(16); // pick some value for them
				return ;
			}
			// check for overflow
			if (minSize >= (Int32.MaxValue / 2))
			{
				init(Int32.MaxValue); // wow that's big.
				return ;
			}
			for (size = 2; size < minSize; size *= 2) 
			{ 
				;
			}
			init(size);
		}
		
		/*Add token to end of the queue
		* @param tok The token to add
		*/
		public void append(char tok)
		{
			if (nbrEntries == buffer.Length)
			{
				expand();
			}
			buffer[(offset + nbrEntries) & sizeLessOne] = tok;
			nbrEntries++;
		}
		
		/*Fetch a token from the queue by index
		* @param idx The index of the token to fetch, where zero is the token at the front of the queue
		*/
		public char elementAt(int idx)
		{
			return buffer[(offset + idx) & sizeLessOne];
		}
		
		/*Expand the token buffer by doubling its capacity */
		private void  expand()
		{
			char[] newBuffer = new char[buffer.Length * 2];
			// Copy the contents to the new buffer
			// Note that this will store the first logical item in the
			// first physical array element.
			 for (int i = 0; i < buffer.Length; i++)
			{
				newBuffer[i] = elementAt(i);
			}
			// Re-initialize with new contents, keep old nbrEntries
			buffer = newBuffer;
			sizeLessOne = buffer.Length - 1;
			offset = 0;
		}
		
		/*Initialize the queue.
		* @param size The initial size of the queue
		*/
		public virtual void  init(int size)
		{
			// Allocate buffer
			buffer = new char[size];
			// Other initialization
			sizeLessOne = size - 1;
			offset = 0;
			nbrEntries = 0;
		}
		
		/*Clear the queue. Leaving the previous buffer alone.
		*/
		public void  reset()
		{
			offset = 0;
			nbrEntries = 0;
		}
		
		/*Remove char from front of queue */
		public void  removeFirst()
		{
			offset = (offset + 1) & sizeLessOne;
			nbrEntries--;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenStreamRewriteEngine.cs0000644000175000017500000003513210522211615026027 0ustar  twernertwernernamespace antlr
{
	/* ANTLR Translator Generator
	 * Project led by Terence Parr at http://www.jGuru.com
	 * Software rights: http://www.antlr.org/license.html
	 */

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//

	using System;
	using IList 		= System.Collections.IList;
	using IDictionary 	= System.Collections.IDictionary;
	using ArrayList 	= System.Collections.ArrayList;
	using Hashtable		= System.Collections.Hashtable;
	using IComparer		= System.Collections.IComparer;
	using StringBuilder = System.Text.StringBuilder;
	using BitSet 		= antlr.collections.impl.BitSet;

	/// 
	/// This token stream tracks the *entire* token stream coming from
	/// a lexer, but does not pass on the whitespace (or whatever else
	/// you want to discard) to the parser.
	/// 
	/// 
	/// 
	/// This class can then be asked for the ith token in the input stream.
	/// Useful for dumping out the input stream exactly after doing some
	/// augmentation or other manipulations.  Tokens are index from 0..n-1
	/// 
	/// 
	/// You can insert stuff, replace, and delete chunks.  Note that the
	/// operations are done lazily--only if you convert the buffer to a
	/// string.  This is very efficient because you are not moving data around
	/// all the time.  As the buffer of tokens is converted to strings, the
	/// toString() method(s) check to see if there is an operation at the
	/// current index.  If so, the operation is done and then normal string
	/// rendering continues on the buffer.  This is like having multiple Turing
	/// machine instruction streams (programs) operating on a single input tape. :)
	/// 
	/// 
	/// Since the operations are done lazily at toString-time, operations do not
	/// screw up the token index values.  That is, an insert operation at token
	/// index i does not change the index values for tokens i+1..n-1.
	/// 
	/// 
	/// Because operations never actually alter the buffer, you may always get
	/// the original token stream back without undoing anything.  Since
	/// the instructions are queued up, you can easily simulate transactions and
	/// roll back any changes if there is an error just by removing instructions.
	/// For example,
	/// 
	/// For example:
	/// 
	/// TokenStreamRewriteEngine rewriteEngine = new TokenStreamRewriteEngine(lexer);
	/// JavaRecognizer           parser        = new JavaRecognizer(rewriteEngine);
	/// ...
	/// rewriteEngine.insertAfter("pass1", t, "foobar");}
	/// rewriteEngine.insertAfter("pass2", u, "start");}
	/// System.Console.Out.WriteLine(rewriteEngine.ToString("pass1"));
	/// System.Console.Out.WriteLine(rewriteEngine.ToString("pass2"));
	/// 
	/// 
	/// 
	/// You can also have multiple "instruction streams" and get multiple
	/// rewrites from a single pass over the input.  Just name the instruction
	/// streams and use that name again when printing the buffer.  This could be
	/// useful for generating a C file and also its header file--all from the
	/// same buffer.
	/// 
	/// 
	/// If you don't use named rewrite streams, a "default" stream is used.
	/// 
	/// 
	/// Terence Parr, parrt@cs.usfca.edu
	/// University of San Francisco
	/// February 2004
	/// 
	/// 
	public class TokenStreamRewriteEngine : TokenStream
	{
		public const int MIN_TOKEN_INDEX = 0;

		protected class RewriteOperation 
		{
			protected internal int 		index;
			protected internal string 	text;
			
			protected RewriteOperation(int index, string text) 
			{
				this.index = index;
				this.text  = text;
			}
			
			/// 
			/// Execute the rewrite operation by possibly adding to the buffer.
			/// 
			/// rewrite buffer
			/// The index of the next token to operate on.
			public virtual int execute(StringBuilder buf) 
			{
				return index;
			}
		}

		protected class InsertBeforeOp : RewriteOperation 
		{
			public InsertBeforeOp(int index, string text) : base(index, text)
			{
			}
			
			public override int execute(StringBuilder buf) 
			{
				buf.Append(text);
				return index;
			}
		}

		protected class ReplaceOp : RewriteOperation 
		{
			protected int lastIndex;
			
			public ReplaceOp(int from, int to, string text) : base(from, text)
			{
				lastIndex = to;
			}
			
			public override int execute(StringBuilder buf) 
			{
				if ( text != null ) 
				{
					buf.Append(text);
				}
				return lastIndex+1;
			}
		}

		protected class DeleteOp : ReplaceOp 
		{
			public DeleteOp(int from, int to) : base(from, to, null)
			{
			}
		}

		public const string 	DEFAULT_PROGRAM_NAME = "default";
		public const int 		PROGRAM_INIT_SIZE 	= 100;

		/// 
		/// Track the incoming list of tokens
		/// 
		protected IList tokens;

		/// 
		/// You may have multiple, named streams of rewrite operations.
		/// I'm calling these things "programs."
		/// Maps string (name) -> rewrite (List)
		/// 
		protected IDictionary programs = null;

		/// 
		/// Map string (program name) -> Integer index
		/// 
		protected IDictionary lastRewriteTokenIndexes = null;

		/// 
		/// track index of tokens
		/// 
		protected int index = MIN_TOKEN_INDEX;

		/// 
		/// Who do we suck tokens from?
		/// 
		protected TokenStream stream;

		/// 
		/// Which (whitespace) token(s) to throw out
		/// 
		protected BitSet discardMask = new BitSet();

		public TokenStreamRewriteEngine(TokenStream upstream) : this(upstream, 1000)
		{
		}

		public TokenStreamRewriteEngine(TokenStream upstream, int initialSize) 
		{
			stream   = upstream;
			tokens   = new ArrayList(initialSize);
			programs = new Hashtable();
			programs[DEFAULT_PROGRAM_NAME]	= new ArrayList(PROGRAM_INIT_SIZE);
			lastRewriteTokenIndexes			= new Hashtable();
		}

		public IToken nextToken() 				// throws TokenStreamException 
		{
			TokenWithIndex t;

			// suck tokens until end of stream or we find a non-discarded token
			do 
			{
				t = (TokenWithIndex) stream.nextToken();
				if ( t != null ) 
				{
					t.setIndex(index);  // what is t's index in list?
					if ( t.Type != Token.EOF_TYPE ) 
					{
						tokens.Add(t);  // track all tokens except EOF
					}
					index++;			// move to next position
				}
			} while ( (t != null) && (discardMask.member(t.Type)) );

			return t;
		}

		public void rollback(int instructionIndex) 
		{
			rollback(DEFAULT_PROGRAM_NAME, instructionIndex);
		}

		/// 
		/// Rollback the instruction stream for a program so that
		/// the indicated instruction (via instructionIndex) is no
		/// longer in the stream.
		/// 
		/// 
		/// UNTESTED!
		/// 
		/// 
		/// 
		public void rollback(string programName, int instructionIndex) 
		{
			ArrayList il = (ArrayList) programs[programName];
			if ( il != null ) 
			{
				programs[programName] = il.GetRange(MIN_TOKEN_INDEX, (instructionIndex - MIN_TOKEN_INDEX));
			}
		}

		public void deleteProgram() 
		{
			deleteProgram(DEFAULT_PROGRAM_NAME);
		}

		/// 
		/// Reset the program so that no instructions exist
		/// 
		/// 
		public void deleteProgram(string programName) 
		{
			rollback(programName, MIN_TOKEN_INDEX);
		}

		/// 
		/// If op.index > lastRewriteTokenIndexes, just add to the end.
		/// Otherwise, do linear
		/// 
		/// 
		protected void addToSortedRewriteList(RewriteOperation op) 
		{
			addToSortedRewriteList(DEFAULT_PROGRAM_NAME, op);
		}

		protected void addToSortedRewriteList(string programName, RewriteOperation op) 
		{
			ArrayList rewrites = (ArrayList) getProgram(programName);
			// if at or beyond last op's index, just append
			if ( op.index >= getLastRewriteTokenIndex(programName) ) 
			{
				rewrites.Add(op); // append to list of operations
				// record the index of this operation for next time through
				setLastRewriteTokenIndex(programName, op.index);
				return;
			}
			// not after the last one, so must insert to ordered list
			int pos = rewrites.BinarySearch(op, RewriteOperationComparer.Default);
			if (pos < 0) 
			{
				rewrites.Insert(-pos-1, op);
			}
		}

		public void insertAfter(IToken t, string text) 
		{
			insertAfter(DEFAULT_PROGRAM_NAME, t, text);
		}

		public void insertAfter(int index, string text) 
		{
			insertAfter(DEFAULT_PROGRAM_NAME, index, text);
		}

		public void insertAfter(string programName, IToken t, string text) 
		{
			insertAfter(programName,((TokenWithIndex) t).getIndex(), text); 
		}

		public void insertAfter(string programName, int index, string text) 
		{
			// to insert after, just insert before next index (even if past end)
			insertBefore(programName, index+1, text); 
		}

		public void insertBefore(IToken t, string text) 
		{
			insertBefore(DEFAULT_PROGRAM_NAME, t, text);
		}

		public void insertBefore(int index, string text) 
		{
			insertBefore(DEFAULT_PROGRAM_NAME, index, text);
		}

		public void insertBefore(string programName, IToken t, string text) 
		{
			insertBefore(programName, ((TokenWithIndex) t).getIndex(), text);
		}

		public void insertBefore(string programName, int index, string text) 
		{
			addToSortedRewriteList(programName, new InsertBeforeOp(index, text));
		}

		public void replace(int index, string text) 
		{
			replace(DEFAULT_PROGRAM_NAME, index, index, text);
		}

		public void replace(int from, int to, string text) 
		{
			replace(DEFAULT_PROGRAM_NAME, from, to, text);
		}

		public void replace(IToken indexT, string text) 
		{
			replace(DEFAULT_PROGRAM_NAME, indexT, indexT, text);
		}

		public void replace(IToken from, IToken to, string text) 
		{
			replace(DEFAULT_PROGRAM_NAME, from, to, text);
		}

		public void replace(string programName, int from, int to, string text) 
		{
			addToSortedRewriteList(new ReplaceOp(from, to, text));
		}

		public void replace(string programName, IToken from, IToken to, string text) 
		{
			replace(programName,
				((TokenWithIndex) from).getIndex(),
				((TokenWithIndex) to).getIndex(),
				text);
		}

		public void delete(int index) 
		{
			delete(DEFAULT_PROGRAM_NAME, index, index);
		}

		public void delete(int from, int to) 
		{
			delete(DEFAULT_PROGRAM_NAME, from, to);
		}

		public void delete(IToken indexT) 
		{
			delete(DEFAULT_PROGRAM_NAME, indexT, indexT);
		}

		public void delete(IToken from, IToken to) 
		{
			delete(DEFAULT_PROGRAM_NAME, from, to);
		}

		public void delete(string programName, int from, int to) 
		{
			replace(programName, from, to, null);
		}

		public void delete(string programName, IToken from, IToken to) 
		{
			replace(programName, from, to, null);
		}

		public void discard(int ttype) 
		{
			discardMask.add(ttype);
		}

		public TokenWithIndex getToken(int i) 
		{
			return (TokenWithIndex) tokens[i];
		}

		public int getTokenStreamSize() 
		{
			return tokens.Count;
		}

		public string ToOriginalString() 
		{
			return ToOriginalString(MIN_TOKEN_INDEX, getTokenStreamSize()-1);
		}

		public string ToOriginalString(int start, int end) 
		{
			StringBuilder buf = new StringBuilder();
			for (int i = start; (i >= MIN_TOKEN_INDEX) && (i <= end) && (i < tokens.Count); i++) 
			{
				buf.Append(getToken(i).getText());
			}
			return buf.ToString();
		}

		public override string ToString() 
		{
			return ToString(MIN_TOKEN_INDEX, getTokenStreamSize());
		}

		public string ToString(string programName) 
		{
			return ToString(programName, MIN_TOKEN_INDEX, getTokenStreamSize());
		}

		public string ToString(int start, int end) 
		{
			return ToString(DEFAULT_PROGRAM_NAME, start, end);
		}

		public string ToString(string programName, int start, int end) 
		{
			IList rewrites = (IList) programs[programName];
			if (rewrites == null) 
			{
				return null; // invalid program
			}
			StringBuilder buf = new StringBuilder();

			// Index of first rewrite we have not done
			int rewriteOpIndex = 0;

			int tokenCursor = start;
			while ( (tokenCursor >= MIN_TOKEN_INDEX) &&
				(tokenCursor <= end) &&
				(tokenCursor < tokens.Count) )
			{
				if (rewriteOpIndex < rewrites.Count) 
				{
					RewriteOperation op = (RewriteOperation) rewrites[rewriteOpIndex];
					while ( (tokenCursor == op.index) && (rewriteOpIndex < rewrites.Count) ) 
					{
						/*
						Console.Out.WriteLine("execute op "+rewriteOpIndex+
											" (type "+op.GetType().FullName+")"
											+" at index "+op.index);
						*/
						tokenCursor = op.execute(buf);
						rewriteOpIndex++;
						if (rewriteOpIndex < rewrites.Count) 
						{
							op = (RewriteOperation) rewrites[rewriteOpIndex];
						}
					}
				}
				if ( tokenCursor < end ) 
				{
					buf.Append(getToken(tokenCursor).getText());
					tokenCursor++;
				}
			}
			// now see if there are operations (append) beyond last token index
			for (int opi = rewriteOpIndex; opi < rewrites.Count; opi++) 
			{
				RewriteOperation op = (RewriteOperation) rewrites[opi];
				op.execute(buf); // must be insertions if after last token
			}

			return buf.ToString();
		}

		public string ToDebugString() 
		{
			return ToDebugString(MIN_TOKEN_INDEX, getTokenStreamSize());
		}

		public string ToDebugString(int start, int end) 
		{
			StringBuilder buf = new StringBuilder();
			for (int i = start; (i >= MIN_TOKEN_INDEX) && (i <= end) && (i < tokens.Count); i++) 
			{
				buf.Append(getToken(i));
			}
			return buf.ToString();
		}

		public int getLastRewriteTokenIndex() 
		{
			return getLastRewriteTokenIndex(DEFAULT_PROGRAM_NAME);
		}

		protected int getLastRewriteTokenIndex(string programName) 
		{
			object i = lastRewriteTokenIndexes[programName];
			if (i == null)
			{
				return -1;
			}
			return (int) i;
		}

		protected void setLastRewriteTokenIndex(string programName, int i) 
		{
			lastRewriteTokenIndexes[programName] = (object) i;
		}

		protected IList getProgram(string name) 
		{
			IList il = (IList) programs[name];
			if ( il == null ) 
			{
				il = initializeProgram(name);
			}
			return il;
		}

		private IList initializeProgram(string name) 
		{
			IList il = new ArrayList(PROGRAM_INIT_SIZE);
			programs[name] = il;
			return il;
		}

		public class RewriteOperationComparer : IComparer
		{
			public static readonly RewriteOperationComparer Default = new RewriteOperationComparer();
		
			public virtual int Compare(object o1, object o2)
			{
				RewriteOperation rop1 = (RewriteOperation) o1;
				RewriteOperation rop2 = (RewriteOperation) o2;

				if (rop1.index < rop2.index) return -1;
				if (rop1.index > rop2.index) return 1;
				return 0;
			}
		}
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/antlr/CommonAST.cs0000755000175000017500000000507110522211615022705 0ustar  twernertwernerusing System;
using AST = antlr.collections.AST;
	
namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*Common AST node implementation */
	public class CommonAST : BaseAST
	{
		public static readonly CommonAST.CommonASTCreator Creator = new CommonASTCreator();

		internal int ttype = Token.INVALID_TYPE;
		internal string text;
		
		
		[Obsolete("Deprecated since version 2.7.2. Use ASTFactory.dup() instead.", false)]
		protected CommonAST(CommonAST another)
		{
			// don't include child/sibling pointers in Clone()/dup()
			//down	= another.down;
			//right	= another.right;
			ttype	= another.ttype;
			text	= (another.text==null) ? null : String.Copy(another.text);
		}

		/*Get the token text for this node */
		override public string getText()
		{
			return text;
		}
		
		/*Get the token type for this node */
		override public int Type
		{
			get { return ttype;   }
			set { ttype = value; }
		}
		
		override public void  initialize(int t, string txt)
		{
			Type = t;
			setText(txt);
		}
		
		override public void  initialize(AST t)
		{
			setText(t.getText());
			Type = t.Type;
		}
		
		public CommonAST()
		{
		}
		
		public CommonAST(IToken tok)
		{
			initialize(tok);
		}
		
		override public void  initialize(IToken tok)
		{
			setText(tok.getText());
			Type = tok.Type;
		}
		/*Set the token text for this node */
		override public void  setText(string text_)
		{
			text = text_;
		}
		/*Set the token type for this node */
		override public void  setType(int ttype_)
		{
			this.Type = ttype_;
		}

		#region Implementation of ICloneable
		[Obsolete("Deprecated since version 2.7.2. Use ASTFactory.dup() instead.", false)]
		override public object Clone()
		{
			return new CommonAST(this);
		}
		#endregion

		public class CommonASTCreator : ASTNodeCreator
		{
			public CommonASTCreator() {}

			/// 
			/// Returns the fully qualified name of the AST type that this
			/// class creates.
			/// 
			public override string ASTNodeTypeName
			{
				get 
				{ 
					return typeof(antlr.CommonAST).FullName;; 
				}
			}

			/// 
			/// Constructs a  instance.
			/// 
			public override AST Create()
			{
				return new CommonAST();
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/ParserSharedInputState.cs0000755000175000017500000000176410522211615025516 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	/*This object contains the data associated with an
	*  input stream of tokens.  Multiple parsers
	*  share a single ParserSharedInputState to parse
	*  the same stream of tokens.
	*/

	public class ParserSharedInputState
	{
		/*Where to get token objects */
		protected internal TokenBuffer input;
		
		/*Are we guessing (guessing>0)? */
		public int guessing = 0;
		
		/*What file (if known) caused the problem? */
		protected internal string filename;
		
		public virtual void  reset()
		{
			guessing = 0;
			filename = null;
			input.reset();
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenStreamException.cs0000755000175000017500000000127610522211615025223 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*
	* Anything that goes wrong while generating a stream of tokens.
	*/

	[Serializable]
	public class TokenStreamException : ANTLRException
	{
		public TokenStreamException()
		{
		}
		public TokenStreamException(string s) : base(s)
		{
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenWithIndex.cs0000644000175000017500000000220310522211615024000 0ustar  twernertwernernamespace antlr
{
	/* ANTLR Translator Generator
	 * Project led by Terence Parr at http://www.jGuru.com
	 * Software rights: http://www.antlr.org/license.html
	 */

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//

	using System;

	 /// 
	 /// This token tracks it's own index 0..n-1 relative to the beginning 
	 /// of the stream. It is designed to work with 
	 ///  in TokenStreamRewriteEngine.cs
	 ///  
	public class TokenWithIndex : CommonToken 
	{
		/// 
		/// Index into token array indicating position in input stream
		/// 
	    int index;

	    public TokenWithIndex() : base()
	    {
	    }

	    public TokenWithIndex(int i, string t) : base(i, t)
	    {
	    }

		public void setIndex(int i)
		{
			index = i;
		}

		public int getIndex() 
		{
			return index;
		}

		public override string ToString()
		{
			return "["+index+":\"" + getText() + "\",<" + Type + ">,line=" + line + ",col=" + col + "]\n";
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/NoViableAltException.cs0000755000175000017500000000257210522211615025127 0ustar  twernertwernerusing System;

using AST					= antlr.collections.AST;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	[Serializable]
	public class NoViableAltException : RecognitionException
	{
		public IToken token;
		public AST node; // handles parsing and treeparsing
		
		public NoViableAltException(AST t) : base("NoViableAlt", "", - 1, - 1)
		{
			node = t;
		}
		
		public NoViableAltException(IToken t, string fileName_) : 
					base("NoViableAlt", fileName_, t.getLine(), t.getColumn())
		{
			token = t;
		}
		
		/*
		* Returns a clean error message (no line number/column information)
		*/
		override public string Message
		{
			get 
			{
				if (token != null)
				{
					//return "unexpected token: " + token.getText();
					return "unexpected token: " + token.ToString();
				}
			
				// must a tree parser error if token==null
				if ( (node==null) || (node==TreeParser.ASTNULL) )
				{
					return "unexpected end of subtree";
				}
				return "unexpected AST node: " + node.ToString();
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenQueue.cs0000755000175000017500000000525310522211615023174 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	/*A private circular buffer object used by the token buffer */

	class TokenQueue
	{
		/*Physical circular buffer of tokens */
		private IToken[] buffer;
		/*buffer.length-1 for quick modulos */
		private int sizeLessOne;
		/*physical index of front token */
		private int offset;
		/*number of tokens in the queue */
		protected internal int nbrEntries;
		
		public TokenQueue(int minSize)
		{
			// Find first power of 2 >= to requested size
			int size;
			if (minSize < 0)
			{
				init(16); // pick some value for them
				return ;
			}
			// check for overflow
			if (minSize >= (int.MaxValue / 2))
			{
				init(int.MaxValue); // wow that's big.
				return ;
			}
			 for (size = 2; size < minSize; size *= 2)
			{
				;
			}
			init(size);
		}
		
		/*Add token to end of the queue
		* @param tok The token to add
		*/
		public void  append(IToken tok)
		{
			if (nbrEntries == buffer.Length)
			{
				expand();
			}
			buffer[(offset + nbrEntries) & sizeLessOne] = tok;
			nbrEntries++;
		}
		
		/*Fetch a token from the queue by index
		* @param idx The index of the token to fetch, where zero is the token at the front of the queue
		*/
		public IToken elementAt(int idx)
		{
			return buffer[(offset + idx) & sizeLessOne];
		}
		
		/*Expand the token buffer by doubling its capacity */
		private void  expand()
		{
			IToken[] newBuffer = new IToken[buffer.Length * 2];
			// Copy the contents to the new buffer
			// Note that this will store the first logical item in the
			// first physical array element.
			 for (int i = 0; i < buffer.Length; i++)
			{
				newBuffer[i] = elementAt(i);
			}
			// Re-initialize with new contents, keep old nbrEntries
			buffer = newBuffer;
			sizeLessOne = buffer.Length - 1;
			offset = 0;
		}
		
		/*Initialize the queue.
		* @param size The initial size of the queue
		*/
		private void  init(int size)
		{
			// Allocate buffer
			buffer = new IToken[size];
			// Other initialization
			sizeLessOne = size - 1;
			offset = 0;
			nbrEntries = 0;
		}
		
		/*Clear the queue. Leaving the previous buffer alone.
		*/
		public void  reset()
		{
			offset = 0;
			nbrEntries = 0;
		}
		
		/*Remove token from front of queue */
		public void  removeFirst()
		{
			offset = (offset + 1) & sizeLessOne;
			nbrEntries--;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/ASTFactory.cs0000755000175000017500000005273710522211615023077 0ustar  twernertwernerusing System;
using System.Collections;
using Assembly			= System.Reflection.Assembly;
using ArrayList			= System.Collections.ArrayList;
using Debug				= System.Diagnostics.Debug;
using AST				= antlr.collections.AST;
using ASTArray			= antlr.collections.impl.ASTArray;
using ANTLRException	= antlr.ANTLRException;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/
	
	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//


	// HISTORY:
	//
	// 19-Aug-2002 kunle    Augmented the basic flexibility of the default ASTFactory with a map
	//                      of TokenID-to-NodeTypeName. It's now a proper GoF-style Factory ;-)
	//

	/// 
	/// AST Support code shared by TreeParser and Parser.
	/// 
	/// 
	/// 
	/// We use delegation to share code (and have only one 
	/// bit of code to maintain) rather than subclassing
	/// or superclassing (forces AST support code to be
	/// loaded even when you don't want to do AST stuff).
	/// 
	/// 
	/// Typically,   is used to specify the
	/// homogeneous type of node to create, but you can override
	///   to make heterogeneous nodes etc...
	/// 
	/// 
	public class ASTFactory
	{
		//---------------------------------------------------------------------
		// CONSTRUCTORS
		//---------------------------------------------------------------------

		/// 
		/// Constructs an ASTFactory with the default AST node type of
		/// .
		/// 
		public ASTFactory() : this(typeof(antlr.CommonAST))
		{
		}

		/// 
		/// Constructs an ASTFactory and use the specified AST node type
		/// as the default.
		/// 
		/// 
		///		Name of default AST node type for this factory.
		/// 
		public ASTFactory(string nodeTypeName)
			: this( loadNodeTypeObject(nodeTypeName) )
		{	
		}
		
		/// 
		/// Constructs an ASTFactory and use the specified AST node type
		/// as the default.
		/// 
		/// 
		///		MetaType of default AST node type for this factory.
		/// 
		public ASTFactory(Type nodeType)
		{
			heteroList_					= new FactoryEntry[Token.MIN_USER_TYPE+1];
			defaultASTNodeTypeObject_	= nodeType;
			defaultCreator_				= null;
			typename2creator_			= new Hashtable(32, (float) 0.3);
			typename2creator_["antlr.CommonAST"]					= CommonAST.Creator;
			typename2creator_["antlr.CommonASTWithHiddenTokens"]	= CommonASTWithHiddenTokens.Creator;

		}
		
		//---------------------------------------------------------------------
		// DATA MEMBERS
		//---------------------------------------------------------------------

		/// 
		/// Stores the Type of the default AST node class to be used during tree construction.
		/// 
		protected Type				defaultASTNodeTypeObject_;
		protected ASTNodeCreator	defaultCreator_;

		/// 
		/// Stores the mapping between custom AST NodeTypes and their NodeTypeName/NodeTypeClass
		/// and ASTNodeCreator.
		/// 
		protected FactoryEntry[]	heteroList_;

		/// 
		/// Stores the mapping between AST node typenames and their token ID.
		/// 
		protected Hashtable			typename2creator_;

		//---------------------------------------------------------------------
		// FUNCTION MEMBERS
		//---------------------------------------------------------------------

		/// 
		/// Specify an "override" for the  type created for
		/// the specified Token type.
		/// 
		/// 
		/// This method is useful for situations that ANTLR cannot oridinarily deal 
		/// with (i.e., when you  create a token based upon a nonliteral token symbol 
		/// like #[LT(1)].  This is a runtime value and ANTLR cannot determine the token 
		/// type (and hence the AST) statically.
		/// 
		/// Token type to override.
		/// 
		///		Fully qualified AST typename (or null to specify 
		///		the factory's default AST type).
		/// 
		public void setTokenTypeASTNodeType(int tokenType, string NodeTypeName)
		{
			// check validity of arguments...
			if( tokenType < Token.MIN_USER_TYPE )
				throw new ANTLRException("Internal parser error: Cannot change AST Node Type for Token ID '" + tokenType + "'");

			// resize up to and including 'type' and initialize any gaps to default
			// factory.
			if (tokenType > (heteroList_.Length+1))
				setMaxNodeType(tokenType);
			// And add new thing..
			if (heteroList_[tokenType] == null)
                heteroList_[tokenType] = new FactoryEntry(loadNodeTypeObject(NodeTypeName));
			else
				heteroList_[tokenType].NodeTypeObject = loadNodeTypeObject(NodeTypeName);
		}

		/// 
		/// Register an AST Node Type for a given Token type ID.
		/// 
		/// The Token type ID.
		/// The AST Node Type to register.
		[Obsolete("Replaced by setTokenTypeASTNodeType(int, string) since version 2.7.2.6", true)]
		public void registerFactory(int NodeType, string NodeTypeName)
		{
			setTokenTypeASTNodeType(NodeType, NodeTypeName);
		}

		/// 
		/// Register an ASTNodeCreator for a given Token type ID.
		/// 
		/// The Token type ID.
		/// The creater to register.
		public void setTokenTypeASTNodeCreator(int NodeType, ASTNodeCreator creator)
		{
			// check validity of arguments...
			if( NodeType < Token.MIN_USER_TYPE )
				throw new ANTLRException("Internal parser error: Cannot change AST Node Type for Token ID '" + NodeType + "'");

			// resize up to and including 'type' and initialize any gaps to default
			// factory.
			if (NodeType > (heteroList_.Length+1))
				setMaxNodeType(NodeType);
			// And add new thing..
			if (heteroList_[NodeType] == null)
				heteroList_[NodeType] = new FactoryEntry(creator);
			else
				heteroList_[NodeType].Creator = creator;

			//typename2creator_[NodeType.ToString()]		= creator;
			typename2creator_[creator.ASTNodeTypeName]	= creator;
		}

		/// 
		/// Register an ASTNodeCreator to be used for creating node by default.
		/// 
		/// The ASTNodeCreator.
		public void setASTNodeCreator(ASTNodeCreator creator)
		{
			defaultCreator_ = creator;
		}

		/// 
		/// Pre-expands the internal list of TokenTypeID-to-ASTNodeType mappings
		/// to the specified size.
		/// This is primarily a convenience method that can be used to prevent 
		/// unnecessary and costly re-org of the mappings list.
		/// 
		/// Maximum Token Type ID.
		public void setMaxNodeType( int NodeType )
		{
			//Debug.WriteLine(this, "NodeType = " + NodeType + " and NodeList.Length = " + nodeTypeList_.Length);
			if (heteroList_ == null)
			{
				heteroList_ = new FactoryEntry[NodeType+1];
			}
			else
			{
				int length = heteroList_.Length;

				if ( NodeType >= length )
				{
					FactoryEntry[] newList = new FactoryEntry[NodeType+1];
					Array.Copy(heteroList_, 0, newList, 0, length);
					heteroList_ = newList;
				}
				else if ( NodeType < length )
				{
					FactoryEntry[] newList = new FactoryEntry[NodeType+1];
					Array.Copy(heteroList_, 0, newList, 0, (NodeType+1));
					heteroList_ = newList;
				}
			}
			//Debug.WriteLine(this, "NodeType = " + NodeType + " and NodeList.Length = " + nodeTypeList_.Length);
		}

		/// 
		/// Add a child to the current AST
		/// 
		/// The AST to add a child to
		/// The child AST to be added
		public virtual void  addASTChild(ref ASTPair currentAST, AST child)
		{
			if (child != null)
			{
				if (currentAST.root == null)
				{
					// Make new child the current root
					currentAST.root = child;
				}
				else
				{
					if (currentAST.child == null)
					{
						// Add new child to current root
						currentAST.root.setFirstChild(child);
					}
					else
					{
						currentAST.child.setNextSibling(child);
					}
				}
				// Make new child the current child
				currentAST.child = child;
				currentAST.advanceChildToEnd();
			}
		}
		
		/// 
		/// Creates a new uninitialized AST node. Since a specific AST Node Type
		/// wasn't indicated, the new AST node is created using the current default
		/// AST Node type - 
		/// 
		/// An uninitialized AST node object.
		public virtual AST create()
		{
			AST newNode;
			
			if (defaultCreator_ == null)
				newNode = createFromNodeTypeObject(defaultASTNodeTypeObject_);
			else
				newNode = defaultCreator_.Create();

			return newNode;
		}
		
		/// 
		/// Creates and initializes a new AST node using the specified Token Type ID.
		/// The  used for creating this new AST node is 
		/// determined by the following:
		/// 
		///		the current TokenTypeID-to-ASTNodeType mapping (if any) or,
		///		the  otherwise
		/// 
		/// 
		/// Token type ID to be used to create new AST Node.
		/// An initialized AST node object.
		public virtual AST create(int type)
		{
			AST newNode = createFromNodeType(type);
			newNode.initialize(type, "");
			return newNode;
		}
		
		/// 
		/// Creates and initializes a new AST node using the specified Token Type ID.
		/// The  used for creating this new AST node is 
		/// determined by the following:
		/// 
		///		the current TokenTypeID-to-ASTNodeType mapping (if any) or,
		///		the  otherwise
		/// 
		/// 
		/// Token type ID to be used to create new AST Node.
		/// Text for initializing the new AST Node.
		/// An initialized AST node object.
		public virtual AST create(int type, string txt)
		{
			AST newNode = createFromNodeType(type);
			newNode.initialize(type, txt);
			return newNode;
		}
		
		/// 
		/// Creates a new AST node using the specified AST Node Type name. Once created,
		/// the new AST node is initialized with the specified Token type ID and string.
		/// The  used for creating this new AST node is 
		/// determined solely by ASTNodeTypeName.
		/// The AST Node type must have a default/parameterless constructor.
		/// 
		/// Token type ID to be used to create new AST Node.
		/// Text for initializing the new AST Node.
		/// Fully qualified name of the Type to be used for creating the new AST Node.
		/// An initialized AST node object.
		public virtual AST create(int type, string txt, string ASTNodeTypeName)
		{
			AST newNode = createFromNodeName(ASTNodeTypeName);
			newNode.initialize(type, txt);
			return newNode;
		}
		
		/// 
		/// Creates a new AST node using the specified AST Node Type name.
		/// 
		/// Token instance to be used to initialize the new AST Node.
		/// 
		///		Fully qualified name of the Type to be used for creating the new AST Node.
		///	
		/// A newly created and initialized AST node object.
		/// 
		/// Once created, the new AST node is initialized with the specified Token 
		/// instance. The  used for creating this new AST 
		/// node is  determined solely by ASTNodeTypeName.
		/// The AST Node type must have a default/parameterless constructor.
		/// 
		public virtual AST create(IToken tok, string ASTNodeTypeName)
		{
			AST newNode = createFromNodeName(ASTNodeTypeName);
			newNode.initialize(tok);
			return newNode;
		}
		
		/// 
		/// Creates and initializes a new AST node using the specified AST Node instance.
		/// the new AST node is initialized with the specified Token type ID and string.
		/// The  used for creating this new AST node is 
		/// determined solely by aNode.
		/// The AST Node type must have a default/parameterless constructor.
		/// 
		/// AST Node instance to be used for creating the new AST Node.
		/// An initialized AST node object.
		public virtual AST create(AST aNode)
		{
			AST	newNode;

			if (aNode == null)
				newNode = null;
			else
			{			
				newNode = createFromAST(aNode);
				newNode.initialize(aNode);
			}
			return newNode;
		}
		
		/// 
		/// Creates and initializes a new AST node using the specified Token instance.
		/// The  used for creating this new AST node is 
		/// determined by the following:
		/// 
		///		the current TokenTypeID-to-ASTNodeType mapping (if any) or,
		///		the  otherwise
		/// 
		/// 
		/// Token instance to be used to create new AST Node.
		/// An initialized AST node object.
		public virtual AST create(IToken tok)
		{
			AST newNode;

			if (tok == null)
				newNode = null;
			else
			{
				newNode = createFromNodeType(tok.Type);
				newNode.initialize(tok);
			}
			return newNode;
		}
		
		/// 
		/// Returns a copy of the specified AST Node instance. The copy is obtained by
		/// using the  method Clone().
		/// 
		/// AST Node to copy.
		/// An AST Node (or null if t is null).
		public virtual AST dup(AST t)
		{
			// The Java version is implemented using code like this:
			if (t == null)
				return null;

			AST dup_edNode = createFromAST(t);
			dup_edNode.initialize(t);
			return dup_edNode;
		}
		
		/// 
		/// Duplicate AST Node tree rooted at specified AST node and all of it's siblings.
		/// 
		/// Root of AST Node tree.
		/// Root node of new AST Node tree (or null if t is null).
		public virtual AST dupList(AST t)
		{
			AST result = dupTree(t); // if t == null, then result==null
			AST nt = result;
			while (t != null)
			{
				// for each sibling of the root
				t = t.getNextSibling();
				nt.setNextSibling(dupTree(t)); // dup each subtree, building new tree
				nt = nt.getNextSibling();
			}
			return result;
		}
		
		/// 
		/// Duplicate AST Node tree rooted at specified AST node. Ignore it's siblings.
		/// 
		/// Root of AST Node tree.
		/// Root node of new AST Node tree (or null if t is null).
		public virtual AST dupTree(AST t)
		{
			AST result = dup(t); // make copy of root
			// copy all children of root.
			if (t != null)
			{
				result.setFirstChild(dupList(t.getFirstChild()));
			}
			return result;
		}
		
		/// 
		/// Make a tree from a list of nodes.  The first element in the
		/// array is the root.  If the root is null, then the tree is
		/// a simple list not a tree.  Handles null children nodes correctly.
		/// For example, build(a, b, null, c) yields tree (a b c).  build(null,a,b)
		/// yields tree (nil a b).
		/// 
		/// List of Nodes.
		/// AST Node tree.
		public virtual AST make(params AST[] nodes)
		{
			if (nodes == null || nodes.Length == 0)
				return null;
			AST root = nodes[0];
			AST tail = null;
			if (root != null)
			{
				root.setFirstChild(null); // don't leave any old pointers set
			}
			// link in children;
			for (int i = 1; i < nodes.Length; i++)
			{
				if (nodes[i] == null)
					continue;
				// ignore null nodes
				if (root == null)
				{
					// Set the root and set it up for a flat list
					root = (tail = nodes[i]);
				}
				else if (tail == null)
				{
					root.setFirstChild(nodes[i]);
					tail = root.getFirstChild();
				}
				else
				{
					tail.setNextSibling(nodes[i]);
					tail = tail.getNextSibling();
				}
				// Chase tail to last sibling
				while (tail.getNextSibling() != null)
				{
					tail = tail.getNextSibling();
				}
			}
			return root;
		}
		
		/// 
		/// Make a tree from a list of nodes, where the nodes are contained
		/// in an ASTArray object.
		/// 
		/// List of Nodes.
		/// AST Node tree.
		public virtual AST make(ASTArray nodes)
		{
			return make(nodes.array);
		}
		
		/// 
		/// Make an AST the root of current AST.
		/// 
		/// 
		/// 
		public virtual void  makeASTRoot(ref ASTPair currentAST, AST root)
		{
			if (root != null)
			{
				// Add the current root as a child of new root
				root.addChild(currentAST.root);
				// The new current child is the last sibling of the old root
				currentAST.child = currentAST.root;
				currentAST.advanceChildToEnd();
				// Set the new root
				currentAST.root = root;
			}
		}

		/// 
		/// Sets the global default AST Node Type for this ASTFactory instance.
		/// This method also attempts to load the  instance
		/// for the specified typename.
		/// 
		/// Fully qualified AST Node Type name.
		public virtual void  setASTNodeType(string t)
		{
			if (defaultCreator_ != null)
			{
				if (t != defaultCreator_.ASTNodeTypeName)
				{
					defaultCreator_ = null;
				}
			}
			defaultASTNodeTypeObject_ = loadNodeTypeObject(t);
		}
		
		/// 
		/// To change where error messages go, can subclass/override this method
		/// and then setASTFactory in Parser and TreeParser.  This method removes
		/// a prior dependency on class antlr.Tool.
		/// 
		/// 
		public virtual void  error(string e)
		{
			Console.Error.WriteLine(e);
		}

		//---------------------------------------------------------------------
		// PRIVATE FUNCTION MEMBERS
		//---------------------------------------------------------------------

		private static Type loadNodeTypeObject(string nodeTypeName)
		{
			Type	nodeTypeObject	= null;
			bool	typeCreated		= false;

			if (nodeTypeName != null)
			{
				foreach (Assembly assem in AppDomain.CurrentDomain.GetAssemblies())
				{
					try
					{
						nodeTypeObject = assem.GetType(nodeTypeName);
						if (nodeTypeObject != null)
						{
							typeCreated = true;
							break;
						}
					}
					catch
					{
						typeCreated = false;
					}
				}
			}
			if (!typeCreated)
			{
				throw new TypeLoadException("Unable to load AST Node Type: '" + nodeTypeName + "'");
			}
			return nodeTypeObject;
		}

		private AST createFromAST(AST node)
		{
			AST		newNode			= null;
			Type	nodeAsTypeObj	= node.GetType();

			ASTNodeCreator creator = (ASTNodeCreator) typename2creator_[nodeAsTypeObj.FullName];
			if (creator != null)
			{
				newNode = creator.Create();
				if (newNode == null)
				{
					throw new ArgumentException("Unable to create AST Node Type: '" + nodeAsTypeObj.FullName + "'");
				}
			}
			else
			{
				newNode = createFromNodeTypeObject(nodeAsTypeObj);
			}
			return newNode;
		}

		private AST createFromNodeName(string nodeTypeName)
		{
			AST		newNode			= null;

			ASTNodeCreator creator = (ASTNodeCreator) typename2creator_[nodeTypeName];
			if (creator != null)
			{
				newNode = creator.Create();
				if (newNode == null)
				{
					throw new ArgumentException("Unable to create AST Node Type: '" + nodeTypeName + "'");
				}
			}
			else
			{
				newNode = createFromNodeTypeObject( loadNodeTypeObject(nodeTypeName) );
			}
			return newNode;
		}

		private AST createFromNodeType(int nodeTypeIndex)
		{
			Debug.Assert((nodeTypeIndex >= 0) && (nodeTypeIndex <= heteroList_.Length), "Invalid AST node type!");
			AST newNode = null;

			FactoryEntry	entry = heteroList_[nodeTypeIndex];
			if ((entry != null) && (entry.Creator != null))
			{
				newNode = entry.Creator.Create();
			}
			else
			{
				if ((entry == null) || (entry.NodeTypeObject == null))
				{
					if (defaultCreator_ == null)
					{
						newNode = createFromNodeTypeObject(defaultASTNodeTypeObject_);
					}
					else
						newNode = defaultCreator_.Create();
				}
				else
                    newNode = createFromNodeTypeObject( entry.NodeTypeObject );
			}
			return newNode;
		}

		private AST createFromNodeTypeObject(Type nodeTypeObject)
		{
			AST		newNode			= null;

			try
			{
				newNode = (AST) Activator.CreateInstance(nodeTypeObject);
				if (newNode == null)
				{
					throw new ArgumentException("Unable to create AST Node Type: '" + nodeTypeObject.FullName + "'");
				}
			}
			catch(Exception ex)
			{
				throw new ArgumentException("Unable to create AST Node Type: '" + nodeTypeObject.FullName + "'", ex);
			}
			return newNode;
		}

		protected class FactoryEntry
		{
			public FactoryEntry(Type typeObj, ASTNodeCreator creator)
			{
				NodeTypeObject	= typeObj;
				Creator			= creator;
			}

			public FactoryEntry(Type typeObj)
			{
				NodeTypeObject	= typeObj;
			}

			public FactoryEntry(ASTNodeCreator creator)
			{
				Creator			= creator;
			}

			public Type				NodeTypeObject;
			public ASTNodeCreator	Creator;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenBuffer.cs0000755000175000017500000000640210522211615023316 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/
	
	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	/*A Stream of Token objects fed to the parser from a Tokenizer that can
	* be rewound via mark()/rewind() methods.
	* 

	* A dynamic array is used to buffer up all the input tokens.  Normally,
	* "k" tokens are stored in the buffer.  More tokens may be stored during
	* guess mode (testing syntactic predicate), or when LT(i>k) is referenced.
	* Consumption of tokens is deferred.  In other words, reading the next
	* token is not done by conume(), but deferred until needed by LA or LT.
	* 

	*
	* @see antlr.Token
	* @see antlr.Tokenizer
	* @see antlr.TokenQueue
	*/
	
	public class TokenBuffer
	{
		
		// Token source
		protected internal TokenStream input;
		
		// Number of active markers
		protected internal int nMarkers = 0;
		
		// Additional offset used when markers are active
		protected internal int markerOffset = 0;
		
		// Number of calls to consume() since last LA() or LT() call
		protected internal int numToConsume = 0;
		
		// Circular queue
		internal TokenQueue queue;
		
		/*Create a token buffer */
		public TokenBuffer(TokenStream input_)
		{
			input = input_;
			queue = new TokenQueue(1);
		}
		
		/*Reset the input buffer to empty state */
		public virtual void  reset()
		{
			nMarkers = 0;
			markerOffset = 0;
			numToConsume = 0;
			queue.reset();
		}
		
		/*Mark another token for deferred consumption */
		public virtual void  consume()
		{
			numToConsume++;
		}
		
		/*Ensure that the token buffer is sufficiently full */
		protected virtual void  fill(int amount)
		{
			syncConsume();
			// Fill the buffer sufficiently to hold needed tokens
			while (queue.nbrEntries < (amount + markerOffset))
			{
				// Append the next token
				queue.append(input.nextToken());
			}
		}
		
		/*return the Tokenizer (needed by ParseView) */
		public virtual TokenStream getInput()
		{
			return input;
		}
		
		/*Get a lookahead token value */
		public virtual int LA(int i)
		{
			fill(i);
			return queue.elementAt(markerOffset + i - 1).Type;
		}
		
		/*Get a lookahead token */
		public virtual IToken LT(int i)
		{
			fill(i);
			return queue.elementAt(markerOffset + i - 1);
		}
		
		/*Return an integer marker that can be used to rewind the buffer to
		* its current state.
		*/
		public virtual int mark()
		{
			syncConsume();
			nMarkers++;
			return markerOffset;
		}
		
		/*Rewind the token buffer to a marker.
		* @param mark Marker returned previously from mark()
		*/
		public virtual void  rewind(int mark)
		{
			syncConsume();
			markerOffset = mark;
			nMarkers--;
		}
		
		/*Sync up deferred consumption */
		protected virtual void  syncConsume()
		{
			while (numToConsume > 0)
			{
				if (nMarkers > 0)
				{
					// guess mode -- leave leading tokens and bump offset.
					markerOffset++;
				}
				else
				{
					// normal mode -- remove first token
					queue.removeFirst();
				}
				numToConsume--;
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/CharScanner.cs0000755000175000017500000004664010522211615023303 0ustar  twernertwernerusing System;
using Stream			= System.IO.Stream;
using TextReader		= System.IO.TextReader;
using StringBuilder		= System.Text.StringBuilder;
using Hashtable			= System.Collections.Hashtable;
using Assembly			= System.Reflection.Assembly;
using EventHandlerList	= System.ComponentModel.EventHandlerList;

using BitSet			= antlr.collections.impl.BitSet;
using antlr.debug;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	public abstract class CharScanner : TokenStream, ICharScannerDebugSubject
	{
		internal const char NO_CHAR = (char) (0);
		public static readonly char EOF_CHAR = Char.MaxValue;

		// Used to store event delegates
		private EventHandlerList events_ = new EventHandlerList();

		protected internal EventHandlerList Events 
		{
			get	{ return events_;	}
		}

		// The unique keys for each event that CharScanner [objects] can generate
		internal static readonly object EnterRuleEventKey			= new object();
		internal static readonly object ExitRuleEventKey			= new object();
		internal static readonly object DoneEventKey				= new object();
		internal static readonly object ReportErrorEventKey			= new object();
		internal static readonly object ReportWarningEventKey		= new object();
		internal static readonly object NewLineEventKey				= new object();
		internal static readonly object MatchEventKey				= new object();
		internal static readonly object MatchNotEventKey			= new object();
		internal static readonly object MisMatchEventKey			= new object();
		internal static readonly object MisMatchNotEventKey			= new object();
		internal static readonly object ConsumeEventKey				= new object();
		internal static readonly object LAEventKey					= new object();
		internal static readonly object SemPredEvaluatedEventKey	= new object();
		internal static readonly object SynPredStartedEventKey		= new object();
		internal static readonly object SynPredFailedEventKey		= new object();
		internal static readonly object SynPredSucceededEventKey	= new object();

		protected internal StringBuilder text;				// text of current token
		
		protected bool saveConsumedInput = true;	// does consume() save characters?

		/// 
Used for creating Token instances.
		protected TokenCreator	tokenCreator;

		/// Used for caching lookahead characters.
		protected char			cached_LA1;
		protected char			cached_LA2;

		protected bool caseSensitive = true;
		protected bool caseSensitiveLiterals = true;
		protected Hashtable literals; // set by subclass
		
		/*Tab chars are handled by tab() according to this value; override
		*  method to do anything weird with tabs.
		*/
		protected internal int tabsize = 8;
		
		protected internal IToken returnToken_ = null; // used to return tokens w/o using return val.
		
		protected internal LexerSharedInputState inputState;
		
		/*Used during filter mode to indicate that path is desired.
		*  A subsequent scan error will report an error as usual if
		*  acceptPath=true;
		*/
		protected internal bool commitToPath = false;
		
		/*Used to keep track of indentdepth for traceIn/Out */
		protected internal int traceDepth = 0;
		
		public CharScanner()
		{
			text = new StringBuilder();
			setTokenCreator(new CommonToken.CommonTokenCreator());
		}
		
		public CharScanner(InputBuffer cb) : this()
		{
			inputState = new LexerSharedInputState(cb);
			cached_LA2 = inputState.input.LA(2);
			cached_LA1 = inputState.input.LA(1);
		}
		
		public CharScanner(LexerSharedInputState sharedState) : this()
		{
			inputState = sharedState;
			if (inputState != null)
			{
				cached_LA2 = inputState.input.LA(2);
				cached_LA1 = inputState.input.LA(1);
		}
	}
		

		public event TraceEventHandler EnterRule
		{
			add		{	Events.AddHandler(EnterRuleEventKey, value);	}
			remove	{	Events.RemoveHandler(EnterRuleEventKey, value);	}
		}

		public event TraceEventHandler ExitRule
		{
			add		{	Events.AddHandler(ExitRuleEventKey, value);		}
			remove	{	Events.RemoveHandler(ExitRuleEventKey, value);	}
		}

		public event TraceEventHandler Done
		{
			add		{	Events.AddHandler(DoneEventKey, value);		}
			remove	{	Events.RemoveHandler(DoneEventKey, value);	}
		}

		public event MessageEventHandler ErrorReported
		{
			add		{	Events.AddHandler(ReportErrorEventKey, value);		}
			remove	{	Events.RemoveHandler(ReportErrorEventKey, value);	}
		}

		public event MessageEventHandler WarningReported
		{
			add		{	Events.AddHandler(ReportWarningEventKey, value);	}
			remove	{	Events.RemoveHandler(ReportWarningEventKey, value);	}
		}

		public event NewLineEventHandler HitNewLine
		{
			add		{	Events.AddHandler(NewLineEventKey, value);		}
			remove	{	Events.RemoveHandler(NewLineEventKey, value);	}
		}

		public event MatchEventHandler MatchedChar
		{
			add		{	Events.AddHandler(MatchEventKey, value);	}
			remove	{	Events.RemoveHandler(MatchEventKey, value);	}
		}

		public event MatchEventHandler MatchedNotChar
		{
			add		{	Events.AddHandler(MatchNotEventKey, value);		}
			remove	{	Events.RemoveHandler(MatchNotEventKey, value);	}
		}

		public event MatchEventHandler MisMatchedChar
		{
			add		{	Events.AddHandler(MisMatchEventKey, value);		}
			remove	{	Events.RemoveHandler(MisMatchEventKey, value);	}
		}

		public event MatchEventHandler MisMatchedNotChar
		{
			add		{	Events.AddHandler(MisMatchNotEventKey, value);		}
			remove	{	Events.RemoveHandler(MisMatchNotEventKey, value);	}
		}

		public event TokenEventHandler ConsumedChar
		{
			add		{	Events.AddHandler(ConsumeEventKey, value);		}
			remove	{	Events.RemoveHandler(ConsumeEventKey, value);	}
		}

		public event TokenEventHandler CharLA
		{
			add		{	Events.AddHandler(LAEventKey, value);		}
			remove	{	Events.RemoveHandler(LAEventKey, value);	}
		}

		public event SemanticPredicateEventHandler SemPredEvaluated
		{
			add		{	Events.AddHandler(SemPredEvaluatedEventKey, value);		}
			remove	{	Events.RemoveHandler(SemPredEvaluatedEventKey, value);	}
		}

		public event SyntacticPredicateEventHandler SynPredStarted
		{
			add		{	Events.AddHandler(SynPredStartedEventKey, value);		}
			remove	{	Events.RemoveHandler(SynPredStartedEventKey, value);	}
		}

		public event SyntacticPredicateEventHandler SynPredFailed
		{
			add		{	Events.AddHandler(SynPredFailedEventKey, value);	}
			remove	{	Events.RemoveHandler(SynPredFailedEventKey, value);	}
		}

		public event SyntacticPredicateEventHandler SynPredSucceeded
		{
			add		{	Events.AddHandler(SynPredSucceededEventKey, value);		}
			remove	{	Events.RemoveHandler(SynPredSucceededEventKey, value);	}
		}

		// From interface TokenStream
		public virtual IToken nextToken() { return null; }

		public virtual void  append(char c)
		{
			if (saveConsumedInput)
			{
				text.Append(c);
			}
		}
		
		public virtual void  append(string s)
		{
			if (saveConsumedInput)
			{
				text.Append(s);
			}
		}
		
		public virtual void  commit()
		{
			inputState.input.commit();
		}
		
		public virtual void recover(RecognitionException ex, BitSet tokenSet)
		{
			consume();
			consumeUntil(tokenSet);
		}
		
		public virtual void  consume()
		{
			if (inputState.guessing == 0)
			{
				if (caseSensitive)
				{
					append(cached_LA1);
				}
				else
				{
					// use input.LA(), not LA(), to get original case
					// CharScanner.LA() would toLower it.
					append(inputState.input.LA(1));
				}
				if (cached_LA1 == '\t')
				{
					tab();
				}
				else
				{
					inputState.column++;
				}
			}
			if (caseSensitive)
			{
				cached_LA1 = inputState.input.consume();
				cached_LA2 = inputState.input.LA(2);
			}
			else
			{
				cached_LA1 = toLower(inputState.input.consume());
				cached_LA2 = toLower(inputState.input.LA(2));
			}
		}
		
		/*Consume chars until one matches the given char */
		public virtual void  consumeUntil(int c)
		{
			while ((EOF_CHAR != cached_LA1) && (c != cached_LA1))
			{
				consume();
			}
		}
		
		/*Consume chars until one matches the given set */
		public virtual void  consumeUntil(BitSet bset)
		{
			while (cached_LA1 != EOF_CHAR && !bset.member(cached_LA1))
			{
				consume();
			}
		}
		
		public virtual bool getCaseSensitive()
		{
			return caseSensitive;
		}
		
		public bool getCaseSensitiveLiterals()
		{
			return caseSensitiveLiterals;
		}
		
		public virtual int getColumn()
		{
			return inputState.column;
		}
		
		public virtual void  setColumn(int c)
		{
			inputState.column = c;
		}
		
		public virtual bool getCommitToPath()
		{
			return commitToPath;
		}
		
		public virtual string getFilename()
		{
			return inputState.filename;
		}
		
		public virtual InputBuffer getInputBuffer()
		{
			return inputState.input;
		}
		
		public virtual LexerSharedInputState getInputState()
		{
			return inputState;
		}
		
		public virtual void  setInputState(LexerSharedInputState state)
		{
			inputState = state;
		}
		
		public virtual int getLine()
		{
			return inputState.line;
		}
		
		/*return a copy of the current text buffer */
		public virtual string getText()
		{
			return text.ToString();
		}
		
		public virtual IToken getTokenObject()
		{
			return returnToken_;
		}
		
		public virtual char LA(int i)
		{
			if (i == 1)
			{
				return cached_LA1;
			}
			if (i == 2)
			{
				return cached_LA2;
			}
			if (caseSensitive)
			{
				return inputState.input.LA(i);
			}
			else
			{
				return toLower(inputState.input.LA(i));
			}
		}
		
		protected internal virtual IToken makeToken(int t)
		{
			IToken	newToken	= null;
			bool	typeCreated;

			try
			{
				newToken = tokenCreator.Create();
				if (newToken != null)
				{
					newToken.Type = t;
					newToken.setColumn(inputState.tokenStartColumn);
					newToken.setLine(inputState.tokenStartLine);
					// tracking real start line now: newToken.setLine(inputState.line);
					newToken.setFilename(inputState.filename);
				}
				typeCreated	= true;
			}
			catch
			{
				typeCreated = false;
			}

			if (!typeCreated)
			{
				panic("Can't create Token object '" + tokenCreator.TokenTypeName + "'");
				newToken = Token.badToken;
			}
			return newToken;
		}
		
		public virtual int mark()
		{
			return inputState.input.mark();
		}
		
		public virtual void  match(char c)
		{
			match((int) c);
		}

		public virtual void  match(int c)
		{
			if (cached_LA1 != c)
			{
				throw new MismatchedCharException(cached_LA1, Convert.ToChar(c), false, this);
			}
			consume();
		}
		
		public virtual void  match(BitSet b)
		{
			if (!b.member(cached_LA1))
			{
				throw new MismatchedCharException(cached_LA1, b, false, this);
			}
			consume();
		}
		
		public virtual void  match(string s)
		{
			int len = s.Length;
			 for (int i = 0; i < len; i++)
			{
				if (cached_LA1 != s[i])
				{
					throw new MismatchedCharException(cached_LA1, s[i], false, this);
				}
				consume();
			}
		}
		
		public virtual void  matchNot(char c)
		{
			matchNot((int) c);
		}
		
		public virtual void  matchNot(int c)
		{
			if (cached_LA1 == c)
			{
				throw new MismatchedCharException(cached_LA1, Convert.ToChar(c), true, this);
			}
			consume();
		}
		
		public virtual void  matchRange(int c1, int c2)
		{
			if (cached_LA1 < c1 || cached_LA1 > c2)
			{
				throw new MismatchedCharException(cached_LA1, Convert.ToChar(c1), Convert.ToChar(c2), false, this);
			}
			consume();
		}
		
		public virtual void  matchRange(char c1, char c2)
		{
			matchRange((int) c1, (int) c2);
		}
		
		public virtual void  newline()
		{
			inputState.line++;
			inputState.column = 1;
		}
		
		/*advance the current column number by an appropriate amount
		*  according to tab size. This method is called from consume().
		*/
		public virtual void  tab()
		{
			int c = getColumn();
			int nc = (((c - 1) / tabsize) + 1) * tabsize + 1; // calculate tab stop
			setColumn(nc);
		}
		
		public virtual void  setTabSize(int size)
		{
			tabsize = size;
		}
		
		public virtual int getTabSize()
		{
			return tabsize;
		}
		
		public virtual void panic()
		{
			//Console.Error.WriteLine("CharScanner: panic");
			//Environment.Exit(1);
			panic("");

		}
		
		/// 
		/// This method is executed by ANTLR internally when it detected an illegal
		/// state that cannot be recovered from.
		/// The previous implementation of this method called 
		/// and writes directly to , which is usually not 
		/// appropriate when a translator is embedded into a larger application.
		/// 
		/// Error message.
		public virtual void panic(string s)
		{
			//Console.Error.WriteLine("CharScanner; panic: " + s);
			//Environment.Exit(1);
			throw new ANTLRPanicException("CharScanner::panic: " + s);
		}
		
		/*Parser error-reporting function can be overridden in subclass */
		public virtual void  reportError(RecognitionException ex)
		{
			Console.Error.WriteLine(ex);
		}
		
		/*Parser error-reporting function can be overridden in subclass */
		public virtual void  reportError(string s)
		{
			if (getFilename() == null)
			{
				Console.Error.WriteLine("error: " + s);
			}
			else
			{
				Console.Error.WriteLine(getFilename() + ": error: " + s);
			}
		}
		
		/*Parser warning-reporting function can be overridden in subclass */
		public virtual void  reportWarning(string s)
		{
			if (getFilename() == null)
			{
				Console.Error.WriteLine("warning: " + s);
			}
			else
			{
				Console.Error.WriteLine(getFilename() + ": warning: " + s);
			}
		}
		
		public virtual void refresh()
		{
			if (caseSensitive)
			{
				cached_LA2 = inputState.input.LA(2);
				cached_LA1 = inputState.input.LA(1);
			}
			else
			{
				cached_LA2 = toLower(inputState.input.LA(2));
				cached_LA1 = toLower(inputState.input.LA(1));
			}
		}

		public virtual void resetState(InputBuffer ib)
		{
			text.Length = 0;
			traceDepth = 0;
			inputState.resetInput(ib);
			refresh();
		}

		public void resetState(Stream s)
		{
			resetState(new ByteBuffer(s));
		}

		public void resetState(TextReader tr)
		{
			resetState(new CharBuffer(tr));
		}

		public virtual void  resetText()
		{
			text.Length = 0;
			inputState.tokenStartColumn = inputState.column;
			inputState.tokenStartLine = inputState.line;
		}
		
		public virtual void  rewind(int pos)
		{
			inputState.input.rewind(pos);
			//setColumn(inputState.tokenStartColumn);
			if (caseSensitive)
			{
				cached_LA2 = inputState.input.LA(2);
				cached_LA1 = inputState.input.LA(1);
			}
			else
			{
				cached_LA2 = toLower(inputState.input.LA(2));
				cached_LA1 = toLower(inputState.input.LA(1));
			}
		}
		
		public virtual void  setCaseSensitive(bool t)
		{
			caseSensitive = t;
			if (caseSensitive)
			{
				cached_LA2 = inputState.input.LA(2);
				cached_LA1 = inputState.input.LA(1);
			}
			else
			{
				cached_LA2 = toLower(inputState.input.LA(2));
				cached_LA1 = toLower(inputState.input.LA(1));
			}
		}
		
		public virtual void  setCommitToPath(bool commit)
		{
			commitToPath = commit;
		}
		
		public virtual void  setFilename(string f)
		{
			inputState.filename = f;
		}
		
		public virtual void  setLine(int line)
		{
			inputState.line = line;
		}
		
		public virtual void  setText(string s)
		{
			resetText();
			text.Append(s);
		}
		
		public virtual void  setTokenObjectClass(string cl)
		{
			this.tokenCreator = new ReflectionBasedTokenCreator(this, cl);
		}
		
		public virtual void  setTokenCreator(TokenCreator tokenCreator)
		{
			this.tokenCreator = tokenCreator;
		}
		
		// Test the token text against the literals table
		// Override this method to perform a different literals test
		public virtual int testLiteralsTable(int ttype)
		{
			string tokenText = text.ToString();

			if ( (tokenText == null) || (tokenText == string.Empty) )
				return ttype;
			else
			{
				object typeAsObject = literals[tokenText];
				return (typeAsObject == null) ? ttype : ((int) typeAsObject);
			}
		}
		
		/*Test the text passed in against the literals table
		* Override this method to perform a different literals test
		* This is used primarily when you want to test a portion of
		* a token.
		*/
		public virtual int testLiteralsTable(string someText, int ttype)
		{
			if ( (someText == null) || (someText == string.Empty) )
				return ttype;
			else
			{
				object typeAsObject = literals[someText];
				return (typeAsObject == null) ? ttype : ((int) typeAsObject);
			}
		}
		
		// Override this method to get more specific case handling
		public virtual char toLower(int c)
		{
			return Char.ToLower(Convert.ToChar(c), System.Globalization.CultureInfo.InvariantCulture);
		}
		
		public virtual void  traceIndent()
		{
			 for (int i = 0; i < traceDepth; i++)
				Console.Out.Write(" ");
		}
		
		public virtual void  traceIn(string rname)
		{
			traceDepth += 1;
			traceIndent();
			Console.Out.WriteLine("> lexer " + rname + "; c==" + LA(1));
		}
		
		public virtual void  traceOut(string rname)
		{
			traceIndent();
			Console.Out.WriteLine("< lexer " + rname + "; c==" + LA(1));
			traceDepth -= 1;
		}
		
		/*This method is called by YourLexer.nextToken() when the lexer has
		*  hit EOF condition.  EOF is NOT a character.
		*  This method is not called if EOF is reached during
		*  syntactic predicate evaluation or during evaluation
		*  of normal lexical rules, which presumably would be
		*  an IOException.  This traps the "normal" EOF condition.
		*
		*  uponEOF() is called after the complete evaluation of
		*  the previous token and only if your parser asks
		*  for another token beyond that last non-EOF token.
		*
		*  You might want to throw token or char stream exceptions
		*  like: "Heh, premature eof" or a retry stream exception
		*  ("I found the end of this file, go back to referencing file").
		*/
		public virtual void  uponEOF()
		{
		}

		private class ReflectionBasedTokenCreator : TokenCreator
		{
			protected ReflectionBasedTokenCreator() {}

			public ReflectionBasedTokenCreator(CharScanner owner, string tokenTypeName)
			{
				this.owner = owner;
				SetTokenType(tokenTypeName);
			}

			private CharScanner owner;

			/// 
			/// The fully qualified name of the Token type to create.
			/// 
			private string tokenTypeName;

			/// 
			/// Type object used as a template for creating tokens by reflection.
			/// 
			private Type tokenTypeObject;

			/// 
			/// Returns the fully qualified name of the Token type that this
			/// class creates.
			/// 
			private void SetTokenType(string tokenTypeName)
			{
				this.tokenTypeName = tokenTypeName;
				foreach (Assembly assem in AppDomain.CurrentDomain.GetAssemblies())
				{
					try
					{
						tokenTypeObject = assem.GetType(tokenTypeName);
						if (tokenTypeObject != null)
						{
							break;
						}
					}
					catch
					{
						throw new TypeLoadException("Unable to load Type for Token class '" + tokenTypeName + "'");
					}
				}
				if (tokenTypeObject==null)
					throw new TypeLoadException("Unable to load Type for Token class '" + tokenTypeName + "'");
			}

			/// 
			/// Returns the fully qualified name of the Token type that this
			/// class creates.
			/// 
			public override string TokenTypeName
			{
				get
				{ 
					return tokenTypeName; 
				}
			}

			/// 
			/// Constructs a  instance.
			/// 
			public override IToken Create()
			{
				IToken newToken = null;

				try
				{
					newToken = (Token) Activator.CreateInstance(tokenTypeObject);
				}
				catch
				{
					// supress exception
				}
				return newToken;
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/ASTVisitor.cs0000755000175000017500000000116710522211615023116 0ustar  twernertwernerusing System;

using AST		= antlr.collections.AST;

namespace antlr
{
	/* ANTLR Translator Generator
	 * Project led by Terence Parr at http://www.jGuru.com
	 * Software rights: http://www.antlr.org/license.html
	 *
	 * $Id:$
	 */

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/// 
	/// Summary description for ASTVisitor.
	/// 
	public interface ASTVisitor
	{
		void visit(AST node);
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/antlr/RecognitionException.cs0000755000175000017500000000327110522211615025244 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	[Serializable]
	public class RecognitionException : ANTLRException
	{
		public string fileName; // not used by treeparsers
		public int line; // not used by treeparsers
		public int column; // not used by treeparsers
		
		public RecognitionException() : base("parsing error")
		{
			fileName = null;
			line = - 1;
			column = - 1;
		}
		
		/*
		* RecognitionException constructor comment.
		* @param s java.lang.String
		*/
		public RecognitionException(string s) : base(s)
		{
			fileName = null;
			line = - 1;
			column = - 1;
		}
		
		/*
		* RecognitionException constructor comment.
		* @param s java.lang.String
		*/
		public RecognitionException(string s, string fileName_, int line_, int column_) : base(s)
		{
			fileName = fileName_;
			line = line_;
			column = column_;
		}
		
		public virtual string getFilename()
		{
			return fileName;
		}
		
		public virtual int getLine()
		{
			return line;
		}
		
		public virtual int getColumn()
		{
			return column;
		}
		
		[Obsolete("Replaced by Message property since version 2.7.0", true)]
		public virtual string getErrorMessage()
		{
			return Message;
		}
		
		override public string ToString()
		{
			return FileLineFormatter.getFormatter().getFormatString(fileName, line, column) + Message;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/CommonToken.cs0000755000175000017500000000365010522211615023337 0ustar  twernertwernerusing System;
	
namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	public class CommonToken : Token
	{
		public static readonly CommonToken.CommonTokenCreator Creator = new CommonTokenCreator();

		// most tokens will want line and text information
		protected internal int line;
		protected internal string text = null;
		protected internal int col;
		
		public CommonToken()
		{
		}
		
		public CommonToken(int t, string txt)
		{
			type_ = t;
			setText(txt);
		}
		
		public CommonToken(string s)
		{
			text = s;
		}
		
		override public int getLine()
		{
			return line;
		}
		
		override public string getText()
		{
			return text;
		}
		
		override public void  setLine(int l)
		{
			line = l;
		}
		
		override public void  setText(string s)
		{
			text = s;
		}
		
		override public string ToString()
		{
			return "[\"" + getText() + "\",<" + type_ + ">,line=" + line + ",col=" + col + "]";
		}
		
		/*Return token's start column */
		override public int getColumn()
		{
			return col;
		}
		
		override public void  setColumn(int c)
		{
			col = c;
		}

		public class CommonTokenCreator : TokenCreator
		{
			public CommonTokenCreator() {}

			/// 
			/// Returns the fully qualified name of the Token type that this
			/// class creates.
			/// 
			public override string TokenTypeName
			{
				get 
				{ 
					return typeof(antlr.CommonToken).FullName;; 
				}
			}

			/// 
			/// Constructs a  instance.
			/// 
			public override IToken Create()
			{
				return new CommonToken();
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/CharBuffer.cs0000755000175000017500000000447710522211615023125 0ustar  twernertwernerusing System;
using System.Runtime.InteropServices;
using TextReader		= System.IO.TextReader;
using IOException		= System.IO.IOException;


namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*A Stream of characters fed to the lexer from a InputStream that can
	* be rewound via mark()/rewind() methods.
	* 

	* A dynamic array is used to buffer up all the input characters.  Normally,
	* "k" characters are stored in the buffer.  More characters may be stored during
	* guess mode (testing syntactic predicate), or when LT(i>k) is referenced.
	* Consumption of characters is deferred.  In other words, reading the next
	* character is not done by conume(), but deferred until needed by LA or LT.
	* 

	*/
	
	// SAS: Move most functionality into InputBuffer -- just the file-specific
	//      stuff is in here
	public class CharBuffer : InputBuffer
	{
		// char source
		[NonSerialized()]
		internal TextReader input;

		private const int BUF_SIZE = 16;
		/// 

		/// Small buffer used to avoid reading individual chars
		/// 
		private char[] buf = new char[BUF_SIZE];

		
		/*Create a character buffer */
		public CharBuffer(TextReader input_) : base()
		{ 
			input = input_;
		}
		
		/*Ensure that the character buffer is sufficiently full */
		override public void  fill(int amount)
		{
			try
			{
				syncConsume();
				// Fill the buffer sufficiently to hold needed characters
				int charsToRead = (amount + markerOffset) - queue.Count;
				int c;

				while (charsToRead > 0)
				{
					// Read a few characters
					c = input.Read(buf, 0, BUF_SIZE);
					for (int i = 0; i < c; i++)
					{
						// Append the next character
						queue.Add(buf[i]);
					}
					if (c < BUF_SIZE)
					{
						while ((charsToRead-- > 0) && (queue.Count < BUF_SIZE))
						{
							queue.Add(CharScanner.EOF_CHAR);
						}
						break;
					}
					charsToRead -= c;
				}
			}
			catch (IOException io)
			{
				throw new CharStreamIOException(io);
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/LexerSharedInputState.cs0000755000175000017500000000347210522211615025337 0ustar  twernertwernerusing System;
using Stream			= System.IO.Stream;
using TextReader		= System.IO.TextReader;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/
	
	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*This object contains the data associated with an
	*  input stream of characters.  Multiple lexers
	*  share a single LexerSharedInputState to lex
	*  the same input stream.
	*/
	public class LexerSharedInputState
	{
		protected internal int column;
		protected internal int line;
		protected internal int tokenStartColumn;
		protected internal int tokenStartLine;
		protected internal InputBuffer input;
		
		/*What file (if known) caused the problem? */
		protected internal string filename;
		
		public int guessing;
		
		public LexerSharedInputState(InputBuffer inbuf)
		{
			initialize();
			input = inbuf;
		}
		
		public LexerSharedInputState(Stream inStream) : this(new ByteBuffer(inStream))
		{
		}
		
		public LexerSharedInputState(TextReader inReader) : this(new CharBuffer(inReader))
		{
		}
		
		private void initialize()
		{
			column = 1;
			line = 1;
			tokenStartColumn = 1;
			tokenStartLine = 1;
			guessing = 0;
			filename = null;
		}
		
		public virtual void reset()
		{
			initialize();
			input.reset();
		}

		public virtual void resetInput(InputBuffer ib)
		{
			reset();
			input = ib;
		}

		public virtual void resetInput(Stream s)
		{
			reset();
			input = new ByteBuffer(s);
		}

		public virtual void resetInput(TextReader tr)
		{
			reset();
			input = new CharBuffer(tr);
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenStreamRecognitionException.cs0000755000175000017500000000155410522211615027423 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/
	
	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*
	* Wraps a RecognitionException in a TokenStreamException so you
	* can pass it along.
	*/

	[Serializable]
	public class TokenStreamRecognitionException : TokenStreamException
	{
		public RecognitionException recog;
		
		public TokenStreamRecognitionException(RecognitionException re) :
				base(re.Message)
		{
			this.recog = re;
		}
		
		override public string ToString()
		{
			return recog.ToString();
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenStreamSelector.cs0000755000175000017500000000636010522211615025044 0ustar  twernertwernerusing System;
using Hashtable		= System.Collections.Hashtable;
using Stack    		= System.Collections.Stack;
	
namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*A token stream MUX (multiplexor) knows about n token streams
	*  and can multiplex them onto the same channel for use by token
	*  stream consumer like a parser.  This is a way to have multiple
	*  lexers break up the same input stream for a single parser.
	*	Or, you can have multiple instances of the same lexer handle
	*  multiple input streams; this works great for includes.
	*/
	public class TokenStreamSelector : TokenStream
	{
		/*The set of inputs to the MUX */
		protected internal Hashtable inputStreamNames;
		
		/*The currently-selected token stream input */
		protected internal TokenStream input;
		
		/*Used to track stack of input streams */
		protected internal Stack streamStack = new Stack();
		
		public TokenStreamSelector() : base()
		{
			inputStreamNames = new Hashtable();
		}
		public virtual void  addInputStream(TokenStream stream, string key)
		{
			inputStreamNames[key] = stream;
		}
		/*Return the stream from tokens are being pulled at
		*  the moment.
		*/
		public virtual TokenStream getCurrentStream()
		{
			return input;
		}
		public virtual TokenStream getStream(string sname)
		{
			TokenStream stream = (TokenStream) inputStreamNames[sname];
			if (stream == null)
			{
				throw new System.ArgumentException("TokenStream " + sname + " not found");
			}
			return stream;
		}
		public virtual IToken nextToken()
		{
			// return input.nextToken();
			// keep looking for a token until you don't
			// get a retry exception.
			 for (; ; )
			{
				try
				{
					return input.nextToken();
				}
				catch (TokenStreamRetryException)
				{
					// just retry "forever"
				}
			}
		}
		public virtual TokenStream pop()
		{
			TokenStream stream = (TokenStream) streamStack.Pop();
			select(stream);
			return stream;
		}
		public virtual void  push(TokenStream stream)
		{
			streamStack.Push(input); // save current stream
			select(stream);
		}
		public virtual void  push(string sname)
		{
			streamStack.Push(input);
			select(sname);
		}
		/*Abort recognition of current Token and try again.
		*  A stream can push a new stream (for include files
		*  for example, and then retry(), which will cause
		*  the current stream to abort back to this.nextToken().
		*  this.nextToken() then asks for a token from the
		*  current stream, which is the new "substream."
		*/
		public virtual void  retry()
		{
			throw new TokenStreamRetryException();
		}
		/*Set the stream without pushing old stream */
		public virtual void  select(TokenStream stream)
		{
			input = stream;
			if (input is CharScanner)
			{
				((CharScanner) input).refresh();
			}
		}
		public virtual void  select(string sname)
		{
			input = getStream(sname);
			if (input is CharScanner)
			{
				((CharScanner) input).refresh();
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/CommonASTWithHiddenTokens.cs0000755000175000017500000000515110522211615026040 0ustar  twernertwernerusing System;
using AST		= antlr.collections.AST;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*A CommonAST whose initialization copies hidden token
	*  information from the Token used to create a node.
	*/

	public class CommonASTWithHiddenTokens : CommonAST
	{
		new public static readonly CommonASTWithHiddenTokens.CommonASTWithHiddenTokensCreator Creator = new CommonASTWithHiddenTokensCreator();

		protected internal IHiddenStreamToken hiddenBefore, hiddenAfter; // references to hidden tokens
		
		public CommonASTWithHiddenTokens() : base()
		{
		}
		
		public CommonASTWithHiddenTokens(IToken tok) : base(tok)
		{
		}
		
		[Obsolete("Deprecated since version 2.7.2. Use ASTFactory.dup() instead.", false)]
		protected CommonASTWithHiddenTokens(CommonASTWithHiddenTokens another) : base(another)
		{
			hiddenBefore	= another.hiddenBefore;
			hiddenAfter	= another.hiddenAfter;
		}

		public virtual IHiddenStreamToken getHiddenAfter()
		{
			return hiddenAfter;
		}
		
		public virtual IHiddenStreamToken getHiddenBefore()
		{
			return hiddenBefore;
		}
		
		override public void initialize(AST t)
		{
			hiddenBefore = ((CommonASTWithHiddenTokens) t).getHiddenBefore();
			hiddenAfter  = ((CommonASTWithHiddenTokens) t).getHiddenAfter();
			base.initialize(t);
		}

		override public void initialize(IToken tok)
		{
			IHiddenStreamToken t = (IHiddenStreamToken) tok;
			base.initialize(t);
			hiddenBefore = t.getHiddenBefore();
			hiddenAfter  = t.getHiddenAfter();
		}

		#region Implementation of ICloneable
		[Obsolete("Deprecated since version 2.7.2. Use ASTFactory.dup() instead.", false)]
		override public object Clone()
		{
			return new CommonASTWithHiddenTokens(this);
		}
		#endregion

		public class CommonASTWithHiddenTokensCreator : ASTNodeCreator
		{
			public CommonASTWithHiddenTokensCreator() {}

			/// 
			/// Returns the fully qualified name of the AST type that this
			/// class creates.
			/// 
			public override string ASTNodeTypeName
			{
				get 
				{ 
					return typeof(antlr.CommonASTWithHiddenTokens).FullName;; 
				}
			}

			/// 
			/// Constructs a  instance.
			/// 
			public override AST Create()
			{
				return new CommonASTWithHiddenTokens();
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/SemanticException.cs0000755000175000017500000000164010522211615024525 0ustar  twernertwernerusing System;
	
namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	[Serializable]
	public class SemanticException : RecognitionException
	{
		public SemanticException(string s) : base(s)
		{
		}
		
		[Obsolete("Replaced by SemanticException(string, string, int, int) since version 2.7.2.6", false)]
		public SemanticException(String s, String fileName, int line) :
					this(s, fileName, line, -1)
		{
			
		}

		public SemanticException(string s, string fileName, int line, int column) :
					base(s, fileName, line, column)
		{
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/MismatchedCharException.cs0000755000175000017500000001100510522211615025632 0ustar  twernertwernerusing System;
using StringBuilder			= System.Text.StringBuilder;

using BitSet				= antlr.collections.impl.BitSet;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	[Serializable]
	public class MismatchedCharException : RecognitionException
	{
		/*
		* Returns a clean error message (no line number/column information)
		*/
		override public string Message
		{
			get 
			{
				StringBuilder sb = new StringBuilder();
			
				switch (mismatchType)
				{
					case CharTypeEnum.CharType: 
						sb.Append("expecting ");   appendCharName(sb, expecting);
						sb.Append(", found ");     appendCharName(sb, foundChar);
						break;
				
					case CharTypeEnum.NotCharType: 
						sb.Append("expecting anything but '");
						appendCharName(sb, expecting);
						sb.Append("'; got it anyway");
						break;
				
					case CharTypeEnum.RangeType: 				
					case CharTypeEnum.NotRangeType: 
						sb.Append("expecting token ");
						if (mismatchType == CharTypeEnum.NotRangeType)
							sb.Append("NOT ");
						sb.Append("in range: ");
						appendCharName(sb, expecting);
						sb.Append("..");
						appendCharName(sb, upper);
						sb.Append(", found ");
						appendCharName(sb, foundChar);
						break;
				
					case CharTypeEnum.SetType: 
					case CharTypeEnum.NotSetType: 
						sb.Append("expecting " + (mismatchType == CharTypeEnum.NotSetType ? "NOT " : "") + "one of (");
						int[] elems = bset.toArray();
						for (int i = 0; i < elems.Length; i++) 
						{
							appendCharName(sb, elems[i]);
						}
						sb.Append("), found ");
						appendCharName(sb, foundChar);
						break;
				
					default: 
						sb.Append(base.Message);
						break;				
				}			
				return sb.ToString();
			}
		}

		// Types of chars

		public enum CharTypeEnum
		{
			CharType = 1,
			NotCharType = 2,
			RangeType = 3,
			NotRangeType = 4,
			SetType = 5,
			NotSetType = 6
		}
		
		// One of the above
		public CharTypeEnum mismatchType;
		
		// what was found on the input stream
		public int foundChar;
		
		// For CHAR/NOT_CHAR and RANGE/NOT_RANGE
		public int expecting;
		
		// For RANGE/NOT_RANGE (expecting is lower bound of range)
		public int upper;
		
		// For SET/NOT_SET
		public BitSet bset;
		
		// who knows...they may want to ask scanner questions
		public CharScanner scanner;
		
		/*
		* MismatchedCharException constructor comment.
		*/
		public MismatchedCharException() : base("Mismatched char")
		{
		}
		
		// Expected range / not range
		public MismatchedCharException(char c, char lower, char upper_, bool matchNot, CharScanner scanner_) : 
					base("Mismatched char", scanner_.getFilename(), scanner_.getLine(), scanner_.getColumn())
		{
			mismatchType = matchNot ? CharTypeEnum.NotRangeType : CharTypeEnum.RangeType;
			foundChar = c;
			expecting = lower;
			upper = upper_;
			scanner = scanner_;
		}
		
		// Expected token / not token
		public MismatchedCharException(char c, char expecting_, bool matchNot, CharScanner scanner_) : 
					base("Mismatched char", scanner_.getFilename(), scanner_.getLine(), scanner_.getColumn())
		{
			mismatchType = matchNot ? CharTypeEnum.NotCharType : CharTypeEnum.CharType;
			foundChar = c;
			expecting = expecting_;
			scanner = scanner_;
		}
		
		// Expected BitSet / not BitSet
		public MismatchedCharException(char c, BitSet set_, bool matchNot, CharScanner scanner_) :
					base("Mismatched char", scanner_.getFilename(), scanner_.getLine(), scanner_.getColumn())
		{
			mismatchType = matchNot ? CharTypeEnum.NotSetType : CharTypeEnum.SetType;
			foundChar = c;
			bset = set_;
			scanner = scanner_;
		}		

		/// 
		/// Append a char to the msg buffer.  If special, then show escaped version
		/// 
		/// Message buffer
		/// Char to append
		private void appendCharName(StringBuilder sb, int c) 
		{
			switch (c) 
			{
				case 65535 :
					// 65535 = (char) -1 = EOF
					sb.Append("''");
					break;
				case '\n' :
					sb.Append(@"'\n'");
					break;
				case '\r' :
					sb.Append(@"'\r'");
					break;
				case '\t' :
					sb.Append(@"'\t'");
					break;
				default :
					sb.Append('\'');
					sb.Append((char) c);
					sb.Append('\'');
					break;
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/Token.cs0000755000175000017500000000351210522211615022163 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*A token is minimally a token type.  Subclasses can add the text matched
	*  for the token and line info. 
	*/

	public class Token : IToken //, ICloneable
	{
		// constants
		public const int MIN_USER_TYPE = 4;
		public const int NULL_TREE_LOOKAHEAD = 3;
		public const int INVALID_TYPE = 0;
		public const int EOF_TYPE = 1;
		public static readonly int SKIP = - 1;
		
		// each Token has at least a token type
		protected int type_;
		
		// the illegal token object
		public static Token badToken = new Token(INVALID_TYPE, "");
		
		public Token()
		{
			type_ = INVALID_TYPE;
		}
		public Token(int t)
		{
			type_ = t;
		}
		public Token(int t, string txt)
		{
			type_ = t;
			setText(txt);
		}
		public virtual int getColumn()
		{
			return 0;
		}
		public virtual int getLine()
		{
			return 0;
		}
		public virtual string getFilename() 
		{
			return null;
		}

		public virtual void setFilename(string name) 
		{
		}

		public virtual string getText()
		{
			return "";
		}

		public int Type
		{
			get { return type_;  }
			set { type_ = value; }
		}

		public virtual void setType(int newType)	{ this.Type = newType; }

		public virtual void  setColumn(int c)
		{
			;
		}
		public virtual void  setLine(int l)
		{
			;
		}
		public virtual void  setText(string t)
		{
			;
		}
		override public string ToString()
		{
			return "[\"" + getText() + "\",<" + type_ + ">]";
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/NoViableAltForCharException.cs0000755000175000017500000000312310522211615026365 0ustar  twernertwernerusing System;
using StringBuilder				= System.Text.StringBuilder;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	[Serializable]
	public class NoViableAltForCharException : RecognitionException
	{
		public char foundChar;
		
		public NoViableAltForCharException(char c, CharScanner scanner) :
					base("NoViableAlt", scanner.getFilename(), scanner.getLine(), scanner.getColumn())
		{
			foundChar = c;
		}
		
		public NoViableAltForCharException(char c, string fileName, int line, int column) : 
					base("NoViableAlt", fileName, line, column)
		{
			foundChar = c;
		}
		
		/*
		* Returns a clean error message (no line number/column information)
		*/
		override public string Message
		{
			get
			{
				StringBuilder mesg = new StringBuilder("unexpected char: ");
			
				// I'm trying to mirror a change in the C++ stuff.
				// But java seems to lack something isprint-ish..
				// so we do it manually. This is probably too restrictive.
			
				if ((foundChar >= ' ') && (foundChar <= '~'))
				{
					mesg.Append('\'');
					mesg.Append(foundChar);
					mesg.Append('\'');
				}
				else
				{
					mesg.Append("0x");
					mesg.Append(((int)foundChar).ToString("X"));
				}
				return mesg.ToString();
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenStream.cs0000755000175000017500000000100710522211615023334 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	
	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	public interface TokenStream
	{
		IToken nextToken();
	}
	
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TokenStreamIOException.cs0000755000175000017500000000151510522211615025447 0ustar  twernertwernerusing System;
using IOException = System.IO.IOException;
	
namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*
	* Wraps an IOException in a TokenStreamException
	*/
	[Serializable]
	public class TokenStreamIOException : TokenStreamException
	{
		public IOException io;
		/*
		* TokenStreamIOException constructor comment.
		* @param s java.lang.String
		*/
		public TokenStreamIOException(IOException io) : base(io.Message)
		{
			this.io = io;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/IToken.cs0000644000175000017500000000152110522211615022267 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/// 
	/// A token is minimally a token type.  Subclasses can add the text matched
	/// for the token and line info. 
	/// 
	public interface IToken
	{
		int		getColumn();
		void	setColumn(int c);

		int		getLine();
		void	setLine(int l);

		string	getFilename();
		void	setFilename(string name);

		string	getText();
		void	setText(string t);

		int		Type { get; set; }
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/ParseTreeToken.cs0000644000175000017500000000165510522211615024001 0ustar  twernertwernernamespace antlr
{

	/* ANTLR Translator Generator
	 * Project led by Terence Parr at http://www.jGuru.com
	 * Software rights: http://www.antlr.org/license.html
	 */

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//

	using System;
	using StringBuilder 	= System.Text.StringBuilder;
	using AST 				= antlr.collections.AST;

	public class ParseTreeToken : ParseTree
	{
		protected IToken token;

		public ParseTreeToken(IToken token) 
		{
			this.token = token;
		}

		protected override internal int getLeftmostDerivation(StringBuilder buf, int step) 
		{
			buf.Append(' ');
			buf.Append(ToString());
			return step; // did on replacements
		}

		public override string ToString()
		{
			if ( token != null ) 
			{
				return token.getText();
			}
			return "";
		}
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/antlr/FileLineFormatter.cs0000755000175000017500000000173010522211615024456 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/
	
	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	public abstract class FileLineFormatter
	{
		
		private static FileLineFormatter formatter = new DefaultFileLineFormatter();
		
		public static FileLineFormatter getFormatter()
		{
			return formatter;
		}
		
		public static void  setFormatter(FileLineFormatter f)
		{
			formatter = f;
		}
		
		/*@param fileName the file that should appear in the prefix. (or null)
		* @param line the line (or -1)
		* @param column the column (or -1)
		*/
		public abstract string getFormatString(string fileName, int line, int column);
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/ASTNodeCreator.cs0000644000175000017500000000265610522211615023665 0ustar  twernertwernernamespace antlr
{
	using System;
	using AST		= antlr.collections.AST;

	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/
	
	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//

	/// 
	/// A creator of AST node instances.
	/// 
	/// 
	/// 
	/// This class and it's sub-classes exists primarily as an optimization
	/// of the reflection-based mechanism(s) previously used exclusively to 
	/// create instances of AST node objects.
	/// 
	/// 
	/// Parsers and TreeParsers already use the ASTFactory class in ANTLR whenever
	/// they need to create an AST node objeect. What this class does is to support
	/// performant extensibility of the basic ASTFactory. The ASTFactory can now be
	/// extnded as run-time to support more new AST node types without using needing
	/// to use reflection.
	/// 
	/// 
	public abstract class ASTNodeCreator
	{
		/// 
		/// Returns the fully qualified name of the AST type that this
		/// class creates.
		/// 
		public abstract string ASTNodeTypeName
		{
			get;
		}

		/// 
		/// Constructs an  instance.
		/// 
		public abstract AST Create();
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/TreeParser.cs0000755000175000017500000001236310522211615023163 0ustar  twernertwernerusing System;
using AST = antlr.collections.AST;
using BitSet = antlr.collections.impl.BitSet;
	
namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	public class TreeParser
	{
		/*The AST Null object; the parsing cursor is set to this when
		*  it is found to be null.  This way, we can test the
		*  token type of a node without having to have tests for null
		*  everywhere.
		*/
		public static ASTNULLType ASTNULL = new ASTNULLType();
		
		/*Where did this rule leave off parsing; avoids a return parameter */
		protected internal AST retTree_;
		
		/*guessing nesting level; guessing==0 implies not guessing */
		// protected int guessing = 0;
		
		/*Nesting level of registered handlers */
		// protected int exceptionLevel = 0;
		
		protected internal TreeParserSharedInputState inputState;
		
		/*Table of token type to token names */
		protected internal string[] tokenNames;
		
		/*AST return value for a rule is squirreled away here */
		protected internal AST returnAST;
		
		/*AST support code; parser and treeparser delegate to this object */
		protected internal ASTFactory astFactory = new ASTFactory();
		
		/*Used to keep track of indentdepth for traceIn/Out */
		protected internal int traceDepth = 0;
		
		public TreeParser()
		{
			inputState = new TreeParserSharedInputState();
		}
		/*Get the AST return value squirreled away in the parser */
		public virtual AST getAST()
		{
			return returnAST;
		}
		public virtual ASTFactory getASTFactory()
		{
			return astFactory;
		}
		public virtual void resetState()
		{
			traceDepth  = 0;
			returnAST	= null;
			retTree_	= null;
			inputState.reset();
		}
		public virtual string getTokenName(int num)
		{
			return tokenNames[num];
		}
		public virtual string[] getTokenNames()
		{
			return tokenNames;
		}
		protected internal virtual void  match(AST t, int ttype)
		{
			//System.out.println("match("+ttype+"); cursor is "+t);
			if (t == null || t == ASTNULL || t.Type != ttype)
			{
				throw new MismatchedTokenException(getTokenNames(), t, ttype, false);
			}
		}
		/*Make sure current lookahead symbol matches the given set
		* Throw an exception upon mismatch, which is catch by either the
		* error handler or by the syntactic predicate.
		*/
		public virtual void  match(AST t, BitSet b)
		{
			if (t == null || t == ASTNULL || !b.member(t.Type))
			{
				throw new MismatchedTokenException(getTokenNames(), t, b, false);
			}
		}
		protected internal virtual void  matchNot(AST t, int ttype)
		{
			//System.out.println("match("+ttype+"); cursor is "+t);
			if (t == null || t == ASTNULL || t.Type == ttype)
			{
				throw new MismatchedTokenException(getTokenNames(), t, ttype, true);
			}
		}

		/// 
		/// @deprecated as of 2.7.2. This method calls System.exit() and writes
		/// directly to stderr, which is usually not appropriate when
		/// a parser is embedded into a larger application. Since the method is
		/// static, it cannot be overridden to avoid these problems.
		/// ANTLR no longer uses this method internally or in generated code.
		/// 
		/// 
		[Obsolete("De-activated since version 2.7.2.6 as it cannot be overidden.", true)]
		public static void panic()
		{
			Console.Error.WriteLine("TreeWalker: panic");
			System.Environment.Exit(1);
		}
		/*Parser error-reporting function can be overridden in subclass */
		public virtual void  reportError(RecognitionException ex)
		{
			Console.Error.WriteLine(ex.ToString());
		}
		/*Parser error-reporting function can be overridden in subclass */
		public virtual void  reportError(string s)
		{
			Console.Error.WriteLine("error: " + s);
		}
		/*Parser warning-reporting function can be overridden in subclass */
		public virtual void  reportWarning(string s)
		{
			Console.Error.WriteLine("warning: " + s);
		}
		/*Specify an object with support code (shared by
		*  Parser and TreeParser.  Normally, the programmer
		*  does not play with this, using setASTNodeType instead.
		*/
		public virtual void  setASTFactory(ASTFactory f)
		{
			astFactory = f;
		}
		
		/*Specify the type of node to create during tree building */
		public virtual void  setASTNodeType(string nodeType)
		{
			setASTNodeClass(nodeType);
		}
		
		/*Specify the type of node to create during tree building */
		public virtual void  setASTNodeClass(string nodeType)
		{
			astFactory.setASTNodeType(nodeType);
		}
		
		public virtual void  traceIndent()
		{
			 for (int i = 0; i < traceDepth; i++)
				Console.Out.Write(" ");
		}
		public virtual void  traceIn(string rname, AST t)
		{
			traceDepth += 1;
			traceIndent();
			Console.Out.WriteLine("> " + rname + "(" + ((t != null) ? t.ToString() : "null") + ")" + ((inputState.guessing > 0) ? " [guessing]" : ""));
		}
		public virtual void  traceOut(string rname, AST t)
		{
			traceIndent();
			Console.Out.WriteLine("< " + rname + "(" + ((t != null) ? t.ToString() : "null") + ")" + ((inputState.guessing > 0) ? " [guessing]" : ""));
			traceDepth--;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/StringUtils.cs0000755000175000017500000000551210522211615023374 0ustar  twernertwernerusing System;

namespace antlr
{
	/* ANTLR Translator Generator
	 * Project led by Terence Parr at http://www.jGuru.com
	 * Software rights: http://www.antlr.org/license.html
	 *
	 * $Id:$
	 */
	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	public class StringUtils
	{
		/*General-purpose utility function for removing
		* characters from back of string
		* @param s The string to process
		* @param c The character to remove
		* @return The resulting string
		*/
		static public string stripBack(string s, char c)
		{
			while (s.Length > 0 && s[s.Length - 1] == c)
			{
				s = s.Substring(0, (s.Length - 1) - (0));
			}
			return s;
		}
		
		/*General-purpose utility function for removing
		* characters from back of string
		* @param s The string to process
		* @param remove A string containing the set of characters to remove
		* @return The resulting string
		*/
		static public string stripBack(string s, string remove)
		{
			bool changed;
			do 
			{
				changed = false;
				 for (int i = 0; i < remove.Length; i++)
				{
					char c = remove[i];
					while (s.Length > 0 && s[s.Length - 1] == c)
					{
						changed = true;
						s = s.Substring(0, (s.Length - 1) - (0));
					}
				}
			}
			while (changed);
			return s;
		}
		
		/*General-purpose utility function for removing
		* characters from front of string
		* @param s The string to process
		* @param c The character to remove
		* @return The resulting string
		*/
		static public string stripFront(string s, char c)
		{
			while (s.Length > 0 && s[0] == c)
			{
				s = s.Substring(1);
			}
			return s;
		}
		
		/*General-purpose utility function for removing
		* characters from front of string
		* @param s The string to process
		* @param remove A string containing the set of characters to remove
		* @return The resulting string
		*/
		static public string stripFront(string s, string remove)
		{
			bool changed;
			do 
			{
				changed = false;
				 for (int i = 0; i < remove.Length; i++)
				{
					char c = remove[i];
					while (s.Length > 0 && s[0] == c)
					{
						changed = true;
						s = s.Substring(1);
					}
				}
			}
			while (changed);
			return s;
		}
		
		/*General-purpose utility function for removing
		* characters from the front and back of string
		* @param s The string to process
		* @param head exact string to strip from head
		* @param tail exact string to strip from tail
		* @return The resulting string
		*/
		public static string stripFrontBack(string src, string head, string tail)
		{
			int h = src.IndexOf(head);
			int t = src.LastIndexOf(tail);
			if (h == - 1 || t == - 1)
				return src;
			return src.Substring(h + 1, (t) - (h + 1));
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/MismatchedTokenException.cs0000755000175000017500000001344410522211615026046 0ustar  twernertwernerusing System;
using StringBuilder			= System.Text.StringBuilder;

using BitSet				= antlr.collections.impl.BitSet;
using AST					= antlr.collections.AST;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	[Serializable]
	public class MismatchedTokenException : RecognitionException
	{
		// Token names array for formatting
		internal string[] tokenNames;
		// The token that was encountered
		public IToken token;
		// The offending AST node if tree walking
		public AST node;
		
		internal string tokenText = null; // taken from node or token object
		
		// Types of tokens
		public enum TokenTypeEnum
		{
			TokenType = 1,
			NotTokenType = 2,
			RangeType = 3,
			NotRangeType = 4,
			SetType = 5,
			NotSetType = 6
		}
		// One of the above
		public TokenTypeEnum mismatchType;
		
		// For TOKEN/NOT_TOKEN and RANGE/NOT_RANGE
		public int expecting;
		
		// For RANGE/NOT_RANGE (expecting is lower bound of range)
		public int upper;
		
		// For SET/NOT_SET
		public BitSet bset;
		
		/*Looking for AST wildcard, didn't find it */
		public MismatchedTokenException() : base("Mismatched Token: expecting any AST node", "", - 1, - 1)
		{
		}
		
		// Expected range / not range
		public MismatchedTokenException(string[] tokenNames_, AST node_, int lower, int upper_, bool matchNot) : 
					base("Mismatched Token", "", - 1, - 1)
		{
			tokenNames = tokenNames_;
			node = node_;
			if (node_ == null)
			{
				tokenText = "";
			}
			else
			{
				tokenText = node_.ToString();
			}
			mismatchType = matchNot ? TokenTypeEnum.NotRangeType : TokenTypeEnum.RangeType;
			expecting = lower;
			upper = upper_;
		}
		
		// Expected token / not token
		public MismatchedTokenException(string[] tokenNames_, AST node_, int expecting_, bool matchNot) :
					base("Mismatched Token", "", - 1, - 1)
		{
			tokenNames = tokenNames_;
			node = node_;
			if (node_ == null)
			{
				tokenText = "";
			}
			else
			{
				tokenText = node_.ToString();
			}
			mismatchType = matchNot ? TokenTypeEnum.NotTokenType : TokenTypeEnum.TokenType;
			expecting = expecting_;
		}
		
		// Expected BitSet / not BitSet
		public MismatchedTokenException(string[] tokenNames_, AST node_, BitSet set_, bool matchNot) :
					base("Mismatched Token", "", - 1, - 1)
		{
			tokenNames = tokenNames_;
			node = node_;
			if (node_ == null)
			{
				tokenText = "";
			}
			else
			{
				tokenText = node_.ToString();
			}
			mismatchType = matchNot ? TokenTypeEnum.NotSetType : TokenTypeEnum.SetType;
			bset = set_;
		}
		
		// Expected range / not range
		public MismatchedTokenException(string[] tokenNames_, IToken token_, int lower, int upper_, bool matchNot, string fileName_) : 
					base("Mismatched Token", fileName_, token_.getLine(), token_.getColumn())
		{
			tokenNames = tokenNames_;
			token = token_;
			tokenText = token_.getText();
			mismatchType = matchNot ? TokenTypeEnum.NotRangeType : TokenTypeEnum.RangeType;
			expecting = lower;
			upper = upper_;
		}
		
		// Expected token / not token
		public MismatchedTokenException(string[] tokenNames_, IToken token_, int expecting_, bool matchNot, string fileName_) :
					base("Mismatched Token", fileName_, token_.getLine(), token_.getColumn())
		{
			tokenNames = tokenNames_;
			token = token_;
			tokenText = token_.getText();
			mismatchType = matchNot ? TokenTypeEnum.NotTokenType : TokenTypeEnum.TokenType;
			expecting = expecting_;
		}
		
		// Expected BitSet / not BitSet
		public MismatchedTokenException(string[] tokenNames_, IToken token_, BitSet set_, bool matchNot, string fileName_) :
					base("Mismatched Token", fileName_, token_.getLine(), token_.getColumn())
		{
			tokenNames = tokenNames_;
			token = token_;
			tokenText = token_.getText();
			mismatchType = matchNot ? TokenTypeEnum.NotSetType : TokenTypeEnum.SetType;
			bset = set_;
		}
		
		/*
		* Returns a clean error message (no line number/column information)
		*/
		override public string Message
		{
			get 
			{
				StringBuilder sb = new StringBuilder();
			
				switch (mismatchType)
				{
					case TokenTypeEnum.TokenType: 
						sb.Append("expecting " + tokenName(expecting) + ", found '" + tokenText + "'");
						break;
				
					case TokenTypeEnum.NotTokenType: 
						sb.Append("expecting anything but " + tokenName(expecting) + "; got it anyway");
						break;
				
					case TokenTypeEnum.RangeType: 
						sb.Append("expecting token in range: " + tokenName(expecting) + ".." + tokenName(upper) + ", found '" + tokenText + "'");
						break;
				
					case TokenTypeEnum.NotRangeType: 
						sb.Append("expecting token NOT in range: " + tokenName(expecting) + ".." + tokenName(upper) + ", found '" + tokenText + "'");
						break;
				
					case TokenTypeEnum.SetType: case TokenTypeEnum.NotSetType: 
						sb.Append("expecting " + (mismatchType == TokenTypeEnum.NotSetType ? "NOT " : "") + "one of (");
						int[] elems = bset.toArray();
						for (int i = 0; i < elems.Length; i++)
						{
							sb.Append(" ");
							sb.Append(tokenName(elems[i]));
						}
						sb.Append("), found '" + tokenText + "'");
						break;
				
					default: 
						sb.Append(base.Message);
						break;				
				}			
				return sb.ToString();
			}
		}
		
		private string tokenName(int tokenType)
		{
			if (tokenType == Token.INVALID_TYPE)
			{
				return "";
			}
			else if (tokenType < 0 || tokenType >= tokenNames.Length)
			{
				return "<" + tokenType.ToString() + ">";
			}
			else
			{
				return tokenNames[tokenType];
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/CommonHiddenStreamToken.cs0000755000175000017500000000353110522211615025625 0ustar  twernertwernerusing System;

namespace antlr
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	public class CommonHiddenStreamToken : CommonToken, IHiddenStreamToken
	{
		new public static readonly CommonHiddenStreamToken.CommonHiddenStreamTokenCreator Creator = new CommonHiddenStreamTokenCreator();

		protected internal IHiddenStreamToken hiddenBefore;
		protected internal IHiddenStreamToken hiddenAfter;
		
		public CommonHiddenStreamToken() : base()
		{
		}
		
		public CommonHiddenStreamToken(int t, string txt) : base(t, txt)
		{
		}
		
		public CommonHiddenStreamToken(string s) : base(s)
		{
		}
		
		public virtual IHiddenStreamToken getHiddenAfter()
		{
			return hiddenAfter;
		}
		
		public virtual IHiddenStreamToken getHiddenBefore()
		{
			return hiddenBefore;
		}
		
		public virtual void  setHiddenAfter(IHiddenStreamToken t)
		{
			hiddenAfter = t;
		}
		
		public virtual void  setHiddenBefore(IHiddenStreamToken t)
		{
			hiddenBefore = t;
		}

		public class CommonHiddenStreamTokenCreator : TokenCreator
		{
			public CommonHiddenStreamTokenCreator() {}

			/// 
			/// Returns the fully qualified name of the Token type that this
			/// class creates.
			/// 
			public override string TokenTypeName
			{
				get 
				{ 
					return typeof(antlr.CommonHiddenStreamToken).FullName;; 
				}
			}

			/// 
			/// Constructs a  instance.
			/// 
			public override IToken Create()
			{
				return new CommonHiddenStreamToken();
			}
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr/ParseTreeRule.cs0000644000175000017500000000435010522211615023623 0ustar  twernertwernernamespace antlr
{

	/* ANTLR Translator Generator
	 * Project led by Terence Parr at http://www.jGuru.com
	 * Software rights: http://www.antlr.org/license.html
	 */

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//

	using System;
	using StringBuilder 	= System.Text.StringBuilder;
	using AST 				= antlr.collections.AST;

	public class ParseTreeRule : ParseTree 
	{
		public const int INVALID_ALT = -1;

		protected string ruleName;
		protected int altNumber;  // unused until I modify antlr to record this

		public ParseTreeRule(string ruleName) : this(ruleName, INVALID_ALT)
		{
		}

		public ParseTreeRule(string ruleName, int altNumber) 
		{
			this.ruleName  = ruleName;
			this.altNumber = altNumber;
		}

		public string getRuleName() 
		{
			return ruleName;
		}

		/// 
		/// Do a step-first walk, building up a buffer of tokens until
		/// you've reached a particular step and print out any rule subroots
		/// insteads of descending.
		/// 
		/// derivation buffer
		/// derivation steps
		/// 
		protected internal override int getLeftmostDerivation(StringBuilder buf, int step) 
		{
			int numReplacements = 0;
			if ( step <= 0 ) 
			{
				buf.Append(' ');
				buf.Append(ToString());
				return numReplacements;
			}
			AST child = getFirstChild();
			numReplacements = 1;
			// walk child printing them out, descending into at most one
			while ( child != null ) 
			{
				if ( (numReplacements >= step) || (child is ParseTreeToken) )
				{
					buf.Append(' ');
					buf.Append(child.ToString());
				}
				else 
				{
					// descend for at least one more derivation; update count
					int remainingReplacements = step - numReplacements;
					int n = ((ParseTree) child).getLeftmostDerivation(buf, remainingReplacements);
					numReplacements += n;
				}
				child = child.getNextSibling();
			}
			return numReplacements;
		}

		public override string ToString()
		{
			if ( altNumber == INVALID_ALT ) 
			{
				return '<'+ruleName+'>';
			}
			else 
			{
				return '<'+ruleName+"["+altNumber+"]>";
			}
		}
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/antlr.collections.impl/0000755000175000017500000000000010522211615024025 5ustar  twernertwernerantlr-2.7.7/lib/csharp/antlr.runtime/antlr.collections.impl/BitSet.cs0000755000175000017500000002761210522211615025561 0ustar  twernertwernerusing System;
using ArrayList					= System.Collections.ArrayList;

//using CharFormatter				= antlr.CharFormatter;

namespace antlr.collections.impl
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//
	
	/*A BitSet to replace java.util.BitSet.
	* Primary differences are that most set operators return new sets
	* as opposed to oring and anding "in place".  Further, a number of
	* operations were added.  I cannot contain a BitSet because there
	* is no way to access the internal bits (which I need for speed)
	* and, because it is final, I cannot subclass to add functionality.
	* Consider defining set degree.  Without access to the bits, I must
	* call a method n times to test the ith bit...ack!
	*
	* Also seems like or() from util is wrong when size of incoming set is bigger
	* than this.bits.length.
	*
	* @author Terence Parr
	* @author 
Pete Wells
	*/

	public class BitSet : ICloneable
	{
		protected internal const int BITS = 64; // number of bits / long
		protected internal const int NIBBLE = 4;
		protected internal const int LOG_BITS = 6; // 2^6 == 64
		
		/*We will often need to do a mod operator (i mod nbits).  Its
		* turns out that, for powers of two, this mod operation is
		* same as (i & (nbits-1)).  Since mod is slow, we use a
		* precomputed mod mask to do the mod instead.
		*/
		protected internal static readonly int MOD_MASK = BITS - 1;
		
		/*The actual data bits */
		protected internal long[] dataBits;
		
		/*Construct a bitset of size one word (64 bits) */
		public BitSet() : this(BITS)
		{
		}
		
		/*Construction from a static array of longs */
		public BitSet(long[] bits_)
		{
			dataBits = bits_;
		}
		
		/*Construct a bitset given the size
		* @param nbits The size of the bitset in bits
		*/
		public BitSet(int nbits)
		{
			dataBits = new long[((nbits - 1) >> LOG_BITS) + 1];
		}
		
		/*or this element into this set (grow as necessary to accommodate) */
		public virtual void  add(int el)
		{
			int n = wordNumber(el);
			if (n >= dataBits.Length)
			{
				growToInclude(el);
			}
			dataBits[n] |= bitMask(el);
		}
		
		public virtual BitSet and(BitSet a)
		{
			BitSet s = (BitSet) this.Clone();
			s.andInPlace(a);
			return s;
		}
		
		public virtual void  andInPlace(BitSet a)
		{
			int min = (int) (Math.Min(dataBits.Length, a.dataBits.Length));
			 for (int i = min - 1; i >= 0; i--)
			{
				dataBits[i] &= a.dataBits[i];
			}
			// clear all bits in this not present in a (if this bigger than a).
			 for (int i = min; i < dataBits.Length; i++)
			{
				dataBits[i] = 0;
			}
		}
		
		private static long bitMask(int bitNumber)
		{
			int bitPosition = bitNumber & MOD_MASK; // bitNumber mod BITS
			return 1L << bitPosition;
		}
		
		public virtual void  clear()
		{
			 for (int i = dataBits.Length - 1; i >= 0; i--)
			{
				dataBits[i] = 0;
			}
		}
		
		public virtual void  clear(int el)
		{
			int n = wordNumber(el);
			if (n >= dataBits.Length)
			{
				// grow as necessary to accommodate
				growToInclude(el);
			}
			dataBits[n] &= ~ bitMask(el);
		}
		
		public virtual object Clone()
		{
			BitSet s;
			try
			{
				s = new BitSet();
				s.dataBits = new long[dataBits.Length];
				Array.Copy(dataBits, 0, s.dataBits, 0, dataBits.Length);
			}
			catch //(System.Exception e)
			{
				throw new System.ApplicationException();
			}
			return s;
		}
		
		public virtual int degree()
		{
			int deg = 0;
			 for (int i = dataBits.Length - 1; i >= 0; i--)
			{
				long word = dataBits[i];
				if (word != 0L)
				{
					 for (int bit = BITS - 1; bit >= 0; bit--)
					{
						if ((word & (1L << bit)) != 0)
						{
							deg++;
						}
					}
				}
			}
			return deg;
		}
		
		override public int GetHashCode()
		{
			return dataBits.GetHashCode();
		}

		/*code "inherited" from java.util.BitSet */
		override public bool Equals(object obj)
		{
			if ((obj != null) && (obj is BitSet))
			{
				BitSet bset = (BitSet) obj;
				
				int n = (int) (System.Math.Min(dataBits.Length, bset.dataBits.Length));
				 for (int i = n; i-- > 0; )
				{
					if (dataBits[i] != bset.dataBits[i])
					{
						return false;
					}
				}
				if (dataBits.Length > n)
				{
					 for (int i = (int) (dataBits.Length); i-- > n; )
					{
						if (dataBits[i] != 0)
						{
							return false;
						}
					}
				}
				else if (bset.dataBits.Length > n)
				{
					 for (int i = (int) (bset.dataBits.Length); i-- > n; )
					{
						if (bset.dataBits[i] != 0)
						{
							return false;
						}
					}
				}
				return true;
			}
			return false;
		}
		
		/*
		* Grows the set to a larger number of bits.
		* @param bit element that must fit in set
		*/
		public virtual void  growToInclude(int bit)
		{
			int newSize = (int) (System.Math.Max(dataBits.Length << 1, numWordsToHold(bit)));
			long[] newbits = new long[newSize];
			Array.Copy(dataBits, 0, newbits, 0, dataBits.Length);
			dataBits = newbits;
		}
		
		public virtual bool member(int el)
		{
			int n = wordNumber(el);
			if (n >= dataBits.Length)
				return false;
			return (dataBits[n] & bitMask(el)) != 0;
		}
		
		public virtual bool nil()
		{
			 for (int i = dataBits.Length - 1; i >= 0; i--)
			{
				if (dataBits[i] != 0)
					return false;
			}
			return true;
		}
		
		public virtual BitSet not()
		{
			BitSet s = (BitSet) this.Clone();
			s.notInPlace();
			return s;
		}
		
		public virtual void  notInPlace()
		{
			 for (int i = dataBits.Length - 1; i >= 0; i--)
			{
				dataBits[i] = ~ dataBits[i];
			}
		}
		
		/*complement bits in the range 0..maxBit. */
		public virtual void  notInPlace(int maxBit)
		{
			notInPlace(0, maxBit);
		}
		
		/*complement bits in the range minBit..maxBit.*/
		public virtual void  notInPlace(int minBit, int maxBit)
		{
			// make sure that we have room for maxBit
			growToInclude(maxBit);
			 for (int i = minBit; i <= maxBit; i++)
			{
				int n = wordNumber(i);
				dataBits[n] ^= bitMask(i);
			}
		}
		
		private int numWordsToHold(int el)
		{
			return (el >> LOG_BITS) + 1;
		}
		
		public static BitSet of(int el)
		{
			BitSet s = new BitSet(el + 1);
			s.add(el);
			return s;
		}
		
		/*return this | a in a new set */
		public virtual BitSet or(BitSet a)
		{
			BitSet s = (BitSet) this.Clone();
			s.orInPlace(a);
			return s;
		}
		
		public virtual void  orInPlace(BitSet a)
		{
			// If this is smaller than a, grow this first
			if (a.dataBits.Length > dataBits.Length)
			{
				setSize((int) (a.dataBits.Length));
			}
			int min = (int) (System.Math.Min(dataBits.Length, a.dataBits.Length));
			 for (int i = min - 1; i >= 0; i--)
			{
				dataBits[i] |= a.dataBits[i];
			}
		}
		
		// remove this element from this set
		public virtual void  remove(int el)
		{
			int n = wordNumber(el);
			if (n >= dataBits.Length)
			{
				growToInclude(el);
			}
			dataBits[n] &= ~ bitMask(el);
		}
		
		/*
		* Sets the size of a set.
		* @param nwords how many words the new set should be
		*/
		private void  setSize(int nwords)
		{
			long[] newbits = new long[nwords];
			int n = (int) (System.Math.Min(nwords, dataBits.Length));
			Array.Copy(dataBits, 0, newbits, 0, n);
			dataBits = newbits;
		}
		
		public virtual int size()
		{
			return dataBits.Length << LOG_BITS; // num words * bits per word
		}
		
		/*return how much space is being used by the dataBits array not
		*  how many actually have member bits on.
		*/
		public virtual int lengthInLongWords()
		{
			return dataBits.Length;
		}
		
		/*Is this contained within a? */
		public virtual bool subset(BitSet a)
		{
			if (a == null) //(a == null || !(a is BitSet))
				return false;
			return this.and(a).Equals(this);
		}
		
		/*Subtract the elements of 'a' from 'this' in-place.
		* Basically, just turn off all bits of 'this' that are in 'a'.
		*/
		public virtual void  subtractInPlace(BitSet a)
		{
			if (a == null)
				return ;
			// for all words of 'a', turn off corresponding bits of 'this'
			 for (int i = 0; i < dataBits.Length && i < a.dataBits.Length; i++)
			{
				dataBits[i] &= ~ a.dataBits[i];
			}
		}
		
		public virtual int[] toArray()
		{
			int[] elems = new int[degree()];
			int en = 0;
			 for (int i = 0; i < (dataBits.Length << LOG_BITS); i++)
			{
				if (member(i))
				{
					elems[en++] = i;
				}
			}
			return elems;
		}
		
		public virtual long[] toPackedArray()
		{
			return dataBits;
		}
		
		override public string ToString()
		{
			return ToString(",");
		}
		
		/*Transform a bit set into a string by formatting each element as an integer
		* @separator The string to put in between elements
		* @return A commma-separated list of values
		*/
		public virtual string ToString(string separator)
		{
			string str = "";
			 for (int i = 0; i < (dataBits.Length << LOG_BITS); i++)
			{
				if (member(i))
				{
					if (str.Length > 0)
					{
						str += separator;
					}
					str = str + i;
				}
			}
			return str;
		}
		
		/*Create a string representation where instead of integer elements, the
		* ith element of vocabulary is displayed instead.  Vocabulary is a Vector
		* of Strings.
		* @separator The string to put in between elements
		* @return A commma-separated list of character constants.
		*/
		public virtual string ToString(string separator, ArrayList vocabulary)
		{
			if (vocabulary == null)
			{
				return ToString(separator);
			}
			string str = "";
			 for (int i = 0; i < (dataBits.Length << LOG_BITS); i++)
			{
				if (member(i))
				{
					if (str.Length > 0)
					{
						str += separator;
					}
					if (i >= vocabulary.Count)
					{
						str += "";
					}
					else if (vocabulary[i] == null)
					{
						str += "<" + i + ">";
					}
					else
					{
						str += (string) vocabulary[i];
					}
				}
			}
			return str;
		}
		
		/*
		* Dump a comma-separated list of the words making up the bit set.
		* Split each 64 bit number into two more manageable 32 bit numbers.
		* This generates a comma-separated list of C++-like unsigned long constants.
		*/
		public virtual string toStringOfHalfWords()
		{
			string s = new string("".ToCharArray());
			 for (int i = 0; i < dataBits.Length; i++)
			{
				if (i != 0)
					s += ", ";
				long tmp = dataBits[i];
				tmp &= 0xFFFFFFFFL;
				s += (tmp + "UL");
				s += ", ";
				tmp = SupportClass.URShift(dataBits[i], 32);
				tmp &= 0xFFFFFFFFL;
				s += (tmp + "UL");
			}
			return s;
		}
		
		/*
		* Dump a comma-separated list of the words making up the bit set.
		* This generates a comma-separated list of Java-like long int constants.
		*/
		public virtual string toStringOfWords()
		{
			string s = new string("".ToCharArray());
			 for (int i = 0; i < dataBits.Length; i++)
			{
				if (i != 0)
					s += ", ";
				s += (dataBits[i] + "L");
			}
			return s;
		}
		
		/*Print out the bit set but collapse char ranges. */
/*		public virtual string toStringWithRanges(string separator, CharFormatter formatter)
		{
			string str = "";
			int[] elems = this.toArray();
			if (elems.Length == 0)
			{
				return "";
			}
			// look for ranges
			int i = 0;
			while (i < elems.Length)
			{
				int lastInRange;
				lastInRange = 0;
				 for (int j = i + 1; j < elems.Length; j++)
				{
					if (elems[j] != elems[j - 1] + 1)
					{
						break;
					}
					lastInRange = j;
				}
				// found a range
				if (str.Length > 0)
				{
					str += separator;
				}
				if (lastInRange - i >= 2)
				{
					str += formatter.literalChar(elems[i]);
					str += "..";
					str += formatter.literalChar(elems[lastInRange]);
					i = lastInRange; // skip past end of range for next range
				}
				else
				{
					// no range, just print current char and move on
					str += formatter.literalChar(elems[i]);
				}
				i++;
			}
			return str;
		}
*/		
		private static int wordNumber(int bit)
		{
			return bit >> LOG_BITS; // bit / BITS
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.collections.impl/ASTArray.cs0000755000175000017500000000163610522211615026013 0ustar  twernertwernerusing System;
using AST = antlr.collections.AST;
	
namespace antlr.collections.impl
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/*ASTArray is a class that allows ANTLR to
	* generate code that can create and initialize an array
	* in one expression, like:
	*    (new ASTArray(3)).add(x).add(y).add(z)
	*/
	public class ASTArray
	{
		public int size = 0;
		public AST[] array;
		
		
		public ASTArray(int capacity)
		{
			array = new AST[capacity];
		}
		public virtual ASTArray add(AST node)
		{
			array[size++] = node;
			return this;
		}
	}
}antlr-2.7.7/lib/csharp/antlr.runtime/antlr.runtime.csproj0000644000175000017500000005151610522211615023464 0ustar  twernertwerner
    
        
            
                
                
            
            
                
            
        
        
            
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
                
            
        
    


antlr-2.7.7/lib/csharp/antlr.runtime/SupportClass.cs0000755000175000017500000000103610522211615022424 0ustar  twernertwernerusing System;
internal class SupportClass
{
	public static int URShift(int number, int bits)
	{
		if ( number >= 0)
			return number >> bits;
		else
			return (number >> bits) + (2 << ~bits);
	}

	public static int URShift(int number, long bits)
	{
		return URShift(number, (int)bits);
	}

	public static long URShift(long number, int bits)
	{
		if ( number >= 0)
			return number >> bits;
		else
			return (number >> bits) + (2L << ~bits);
	}

	public static long URShift(long number, long bits)
	{
		return URShift(number, (int)bits);
	}
}
antlr-2.7.7/lib/csharp/antlr.runtime/AssemblyInfo.cs0000755000175000017500000000226710522211615022364 0ustar  twernertwernerusing System;
using System.Reflection;
using System.Runtime.CompilerServices;


// General Information about an assembly is controlled through the following
// set of attributes. Change these attribute values to modify the information
// associated with an assembly.

// TODO: Review the values of the assembly attributes

[assembly: AssemblyTitle("antlr.runtime")]
[assembly: AssemblyDescription("ANTLR Runtime for .NET")]
[assembly: AssemblyCompany("www.antlr.org")]
[assembly: AssemblyProduct("")]
[assembly: AssemblyCopyright("")]
[assembly: AssemblyTrademark("")]
[assembly: AssemblyCulture("")]

[assembly: AssemblyVersion("2.7.7.01")]


// Version information for an assembly consists of the following four values:
//
//      Major Version
//      Minor Version
//      Revision
//      Build Number
//
// You can specify all the values or you can default the Revision and Build Numbers
// by using the '*' as shown below:

[assembly: CLSCompliantAttribute(true)]

#if STRONGNAME
#pragma warning disable 1699
[assembly: AssemblyDelaySign(false)]
[assembly: AssemblyKeyFile("org.antlr.snk")]
#pragma warning restore 1699
#endif

#if APTC
[assembly: System.Security.AllowPartiallyTrustedCallers]
#endifantlr-2.7.7/lib/csharp/antlr.runtime/antlr.collections/0000755000175000017500000000000010522211615023065 5ustar  twernertwernerantlr-2.7.7/lib/csharp/antlr.runtime/antlr.collections/AST.cs0000755000175000017500000000447110522211615024054 0ustar  twernertwernerusing System;
using IEnumerator = System.Collections.IEnumerator;

using IToken = antlr.IToken;
	
namespace antlr.collections
{
	/*ANTLR Translator Generator
	* Project led by Terence Parr at http://www.jGuru.com
	* Software rights: http://www.antlr.org/license.html
	*
	* $Id:$
	*/

	//
	// ANTLR C# Code Generator by Micheal Jordan
	//                            Kunle Odutola       : kunle UNDERSCORE odutola AT hotmail DOT com
	//                            Anthony Oguntimehin
	//
	// With many thanks to Eric V. Smith from the ANTLR list.
	//

	/// 
	/// Minimal AST node interface used by ANTLR AST generation and tree-walker.
	/// 
	public interface AST : ICloneable
	{
		/// 
		/// Add a (rightmost) child to this node
		/// 
		/// 
		void  addChild(AST c);
		bool Equals(AST t);
		bool EqualsList(AST t);
		bool EqualsListPartial(AST t);
		bool EqualsTree(AST t);
		bool EqualsTreePartial(AST t);
		IEnumerator findAll(AST tree);
		IEnumerator findAllPartial(AST subtree);
		/// 
		/// Get the first child of this node; null if no children
		/// 
		AST getFirstChild();
		/// 
		/// Get	the next sibling in line after this one
		/// 
		AST getNextSibling();
		/// 
		/// Get the token text for this node
		/// 
		/// 
		string getText();
		/// 
		/// Get the token type for this node
		/// 
		int Type	{ get; set;}
		/// 
		/// Get number of children of this node; if leaf, returns 0
		/// 
		/// Number of children
		int getNumberOfChildren();
		void  initialize(int t, string txt);
		void  initialize(AST t);
		void  initialize(IToken t);
		/// 
		/// Set the first child of a node.
		/// 
		/// 
		void  setFirstChild(AST c);
		/// 
		/// Set the next sibling after this one.
		/// 
		/// 
		void  setNextSibling(AST n);
		/// 
		/// Set the token text for this node
		/// 
		/// 
		void  setText(string text);
		/// 
		/// Set the token type for this node
		/// 
		/// 
		void  setType(int ttype);
		string ToString();
		string ToStringList();
		string ToStringTree();
	}
}antlr-2.7.7/lib/cpp/0000755000175000017500000000000010522211615014130 5ustar  twernertwernerantlr-2.7.7/lib/cpp/doxygen.cfg0000644000175000017500000000715310522211615016274 0ustar  twernertwerner# 
# Doxygen config file for ANTLR's C++ support libraries.
#
# Thanks to Bill Zheng for parts of this.
#
PROJECT_NAME       = "ANTLR Support Libraries 2.7.1+"
# Input files:
INPUT              = antlr src
RECURSIVE          = YES
FILE_PATTERNS      = *.cpp *.h *.hpp
JAVADOC_AUTOBRIEF  = NO

#---------------------------------------------------------------------------
# Configuration options related to the preprocessor 
#---------------------------------------------------------------------------
# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will
# evaluate all C-preprocessor directives found in the sources and include
# files.
ENABLE_PREPROCESSING = YES

# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro
# names in the source code. If set to NO (the default) only conditional 
# compilation will be performed.
MACRO_EXPANSION      = YES

# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files
# in the INCLUDE_PATH (see below) will be search if a #include is found.
SEARCH_INCLUDES      = YES

# The INCLUDE_PATH tag can be used to specify one or more directories that
# contain include files that are not input files but should be processed by
# the preprocessor.
INCLUDE_PATH         =

# The PREDEFINED tag can be used to specify one or more macro names that
# are defined before the preprocessor is started (similar to the -D option of
# gcc). The argument of the tag is a list of macros of the form: name
# or name=definition (no spaces). If the definition and the = are 
# omitted =1 is assumed.
PREDEFINED           =  "ANTLR_USE_NAMESPACE(_x_)=_x_::" \
			"ANTLR_USING_NAMESPACE(_x_)=using namespace _x_;" \
			"ANTLR_C_USING(_x_)=" \
			"ANTLR_API="

# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES
# then the macro expansion is limited to the macros specified with the
# PREDEFINED tag.
EXPAND_ONLY_PREDEF   = YES

# Output options
OUTPUT_DIRECTORY   = gen_doc
PAPER_TYPE         = a4wide
#PAPER_TYPE        = a4
TAB_SIZE           = 3
CASE_SENSE_NAMES   = YES

# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend
# the brief description of a member or function before the detailed description.
# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the 
# brief descriptions will be completely suppressed.
REPEAT_BRIEF         = YES

# The INTERNAL_DOCS tag determines if documentation
# that is typed after a \internal command is included. If the tag is set 
# to NO (the default) then the documentation will be excluded.
# Set it to YES to include the internal documentation.
INTERNAL_DOCS        = NO

# if the INHERIT_DOCS tag is set to YES (the default) then an undocumented
# member inherits the documentation from any documented member that it
# reimplements.
INHERIT_DOCS         = YES

# if the INLINE_INFO tag is set to YES (the default) then a tag [inline]
# is inserted in the documentation for inline members.
INLINE_INFO          = YES

# Dot and friends...
HAVE_DOT           = YES
CLASS_GRAPH        = YES
COLLABORATION_GRAPH = YES
INCLUDE_GRAPH      = YES
INCLUDED_BY_GRAPH  = YES
EXTRACT_ALL        = YES
EXTRACT_STATIC     = YES
EXTRACT_PRIVATE    = YES
# HTML output and friends...
GENERATE_HTML      = YES
# Tree view gives too much trouble with various browsers.
GENERATE_TREEVIEW  = NO
# Latex output and friends...
GENERATE_LATEX     = NO
PDF_HYPERLINKS     = YES
GENERATE_MAN       = NO
GENERATE_RTF       = NO
# Control of convenience stuff
GENERATE_TODOLIST = YES
# Control over warnings etc. Unset EXTRACT_ALL to get this to work
WARN_IF_UNDOCUMENTED = YES
WARNINGS             = YES
QUIET                = YES
antlr-2.7.7/lib/cpp/Makefile.in0000644000175000017500000000057310522211615016202 0ustar  twernertwerner###############################################################################
# $Id:$
###############################################################################
## do not change this value 
subdir=lib/cpp

## get configured autoconf variables
@stdvars@

## Your own variables shall go here ..

# Docs
DOXY_TARGET=doxygen.cfg
DOXY_GENDIR=gendoc/html

@stdmake@


@stddeps@
antlr-2.7.7/lib/cpp/antlr/0000755000175000017500000000000010522211615015250 5ustar  twernertwernerantlr-2.7.7/lib/cpp/antlr/TokenStreamSelector.hpp0000644000175000017500000000531710522211615021724 0ustar  twernertwerner#ifndef INC_TokenStreamSelector_hpp__
#define INC_TokenStreamSelector_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/TokenStreamSelector.hpp#2 $
 */

#include 
#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** A token stream MUX (multiplexor) knows about n token streams
 *  and can multiplex them onto the same channel for use by token
 *  stream consumer like a parser.  This is a way to have multiple
 *  lexers break up the same input stream for a single parser.
 * Or, you can have multiple instances of the same lexer handle
 *  multiple input streams; this works great for includes.
 */
class ANTLR_API TokenStreamSelector : public TokenStream {
protected:
	/** The set of inputs to the MUX */
#ifdef OS_NO_ALLOCATOR
	typedef ANTLR_USE_NAMESPACE(std)less lessp;
	typedef ANTLR_USE_NAMESPACE(std)map inputStreamNames_coll;
#else
	typedef ANTLR_USE_NAMESPACE(std)map inputStreamNames_coll;
#endif
	inputStreamNames_coll inputStreamNames;

	/** The currently-selected token stream input */
	TokenStream* input;

	/** Used to track stack of input streams */
#ifdef OS_NO_ALLOCATOR
	typedef ANTLR_USE_NAMESPACE(std)stack > streamStack_coll;
#else
	typedef ANTLR_USE_NAMESPACE(std)stack streamStack_coll;
#endif
	streamStack_coll streamStack;

public:
	TokenStreamSelector();
	~TokenStreamSelector();

	void addInputStream(TokenStream* stream, const ANTLR_USE_NAMESPACE(std)string& key);

	/// Return the stream from which tokens are being pulled at the moment.
	TokenStream* getCurrentStream() const;

	TokenStream* getStream(const ANTLR_USE_NAMESPACE(std)string& sname) const;

	RefToken nextToken();

	TokenStream* pop();

	void push(TokenStream* stream);

	void push(const ANTLR_USE_NAMESPACE(std)string& sname);

	/** Abort recognition of current Token and try again.
	 *  A stream can push a new stream (for include files
	 *  for example, and then retry(), which will cause
	 *  the current stream to abort back to this.nextToken().
	 *  this.nextToken() then asks for a token from the
	 *  current stream, which is the new "substream."
	 */
	void retry();

	/** Set the stream without pushing old stream */
	void select(TokenStream* stream);

	void select(const ANTLR_USE_NAMESPACE(std)string& sname);
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_TokenStreamSelector_hpp__
antlr-2.7.7/lib/cpp/antlr/TreeParser.hpp0000644000175000017500000001035110522211615020035 0ustar  twernertwerner#ifndef INC_TreeParser_hpp__
#define INC_TreeParser_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/TreeParser.hpp#2 $
 */

#include 
#include 
#include 
#include 
#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API TreeParser {
public:
	TreeParser()
	: astFactory(0)
	, inputState(new TreeParserInputState())
	, traceDepth(0)
	{
	}

	TreeParser(const TreeParserSharedInputState& state)
	: astFactory(0)
	, inputState(state)
	, traceDepth(0)
	{
	}

	virtual ~TreeParser()
	{
	}

	/// Get the AST return value squirreled away in the parser
	virtual RefAST getAST() = 0;

	/** Make sure current lookahead symbol matches the given set
	 * Throw an exception upon mismatch, which is caught by either the
	 * error handler or by a syntactic predicate.
	 */
	virtual void match(RefAST t, const BitSet& b)
	{
		if ( !t || t==ASTNULL || !b.member(t->getType()) )
			throw MismatchedTokenException( getTokenNames(), getNumTokens(),
													  t, b, false );
	}

	/** Specify the AST factory to be used during tree building. (Compulsory)
	 * Setting the factory is compulsory (if you intend to modify
	 * the tree in the treeparser). The AST Factory is shared between
	 * parser (who builds the initial AST) and treeparser.
	 * @see Parser::getASTFactory()
	 */
	virtual void setASTFactory(ASTFactory* factory)
	{
		astFactory = factory;
	}
	/// Return pointer to ASTFactory
	virtual ASTFactory* getASTFactory() const
	{
		return astFactory;
	}
	/// Get the name for token 'num'
	virtual const char* getTokenName(int num) const = 0;
	/// Return the number of tokens defined
	virtual int getNumTokens() const = 0;
	/// Return an array of getNumTokens() token names
	virtual const char* const* getTokenNames() const = 0;

	/// Parser error-reporting function can be overridden in subclass
	virtual void reportError(const RecognitionException& ex);
	/// Parser error-reporting function can be overridden in subclass
	virtual void reportError(const ANTLR_USE_NAMESPACE(std)string& s);
	/// Parser warning-reporting function can be overridden in subclass
	virtual void reportWarning(const ANTLR_USE_NAMESPACE(std)string& s);

	/// These are used during when traceTreeParser commandline option is passed.
	virtual void traceIndent();
	virtual void traceIn(const char* rname, RefAST t);
	virtual void traceOut(const char* rname, RefAST t);

	/** The AST Null object; the parsing cursor is set to this when
	 * it is found to be null.  This way, we can test the
	 * token type of a node without having to have tests for 0
	 * everywhere.
	 */
	static RefAST ASTNULL;

protected:
	virtual void match(RefAST t, int ttype)
	{
		if (!t || t == ASTNULL || t->getType() != ttype )
			throw MismatchedTokenException( getTokenNames(), getNumTokens(),
													  t, ttype, false );
	}

	virtual void matchNot(RefAST t, int ttype)
	{
		if ( !t || t == ASTNULL || t->getType() == ttype )
			throw MismatchedTokenException( getTokenNames(), getNumTokens(),
													  t, ttype, true );
	}

	/** AST support code; parser and treeparser delegate to this object */
	ASTFactory* astFactory;

	/// The input state of this tree parser.
	TreeParserSharedInputState inputState;

	/** Used to keep track of indent depth with -traceTreeParser */
	int traceDepth;

	/** Utility class which allows tracing to work even when exceptions are
	 * thrown.
	 */
	class Tracer {
	private:
		TreeParser* parser;
		const char* text;
		RefAST tree;
	public:
		Tracer(TreeParser* p, const char* t, RefAST a)
		: parser(p), text(t), tree(a)
		{
			parser->traceIn(text,tree);
		}
		~Tracer()
		{
			parser->traceOut(text,tree);
		}
	private:
		Tracer(const Tracer&);							// undefined
		const Tracer& operator=(const Tracer&);	// undefined
	};

private:
	// no copying of treeparser instantiations...
	TreeParser(const TreeParser& other);
	TreeParser& operator=(const TreeParser& other);
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_TreeParser_hpp__
antlr-2.7.7/lib/cpp/antlr/ASTPair.hpp0000644000175000017500000000307510522211615017231 0ustar  twernertwerner#ifndef INC_ASTPair_hpp__
#define INC_ASTPair_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/ASTPair.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** ASTPair:  utility class used for manipulating a pair of ASTs
  * representing the current AST root and current AST sibling.
  * This exists to compensate for the lack of pointers or 'var'
  * arguments in Java.
  *
  * OK, so we can do those things in C++, but it seems easier
  * to stick with the Java way for now.
  */
class ANTLR_API ASTPair {
public:
	RefAST root;		// current root of tree
	RefAST child;		// current child to which siblings are added

	/** Make sure that child is the last sibling */
	void advanceChildToEnd() {
		if (child) {
			while (child->getNextSibling()) {
				child = child->getNextSibling();
			}
		}
	}
//	/** Copy an ASTPair.  Don't call it clone() because we want type-safety */
//	ASTPair copy() {
//		ASTPair tmp = new ASTPair();
//		tmp.root = root;
//		tmp.child = child;
//		return tmp;
//	}
	ANTLR_USE_NAMESPACE(std)string toString() const {
		ANTLR_USE_NAMESPACE(std)string r = !root ? ANTLR_USE_NAMESPACE(std)string("null") : root->getText();
		ANTLR_USE_NAMESPACE(std)string c = !child ? ANTLR_USE_NAMESPACE(std)string("null") : child->getText();
		return "["+r+","+c+"]";
	}
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_ASTPair_hpp__
antlr-2.7.7/lib/cpp/antlr/ParserSharedInputState.hpp0000644000175000017500000000407010522211615022366 0ustar  twernertwerner#ifndef INC_ParserSharedInputState_hpp__
#define INC_ParserSharedInputState_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/ParserSharedInputState.hpp#2 $
 */

#include 
#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** This object contains the data associated with an
 * input stream of tokens.  Multiple parsers
 * share a single ParserSharedInputState to parse
 * the same stream of tokens.
 */
class ANTLR_API ParserInputState {
public:
	/** Construct a new ParserInputState
	 * @param in the TokenBuffer to read from. The object is deleted together
	 * with the ParserInputState object.
	 */
	ParserInputState( TokenBuffer* in )
	: guessing(0)
	, filename()
	, input(in)
	, inputResponsible(true)
	{
	}
	/** Construct a new ParserInputState
	 * @param in the TokenBuffer to read from.
	 */
	ParserInputState( TokenBuffer& in )
	: guessing(0)
	, filename("")
	, input(&in)
	, inputResponsible(false)
	{
	}

	virtual ~ParserInputState()
	{
		if (inputResponsible)
			delete input;
	}

	TokenBuffer& getInput( void )
	{
		return *input;
	}

	/// Reset the ParserInputState and the underlying TokenBuffer
	void reset( void )
	{
		input->reset();
		guessing = 0;
	}

public:
	/** Are we guessing (guessing>0)? */
	int guessing;
	/** What file (if known) caused the problem?
	 * @todo wrap this one..
	 */
	ANTLR_USE_NAMESPACE(std)string filename;
private:
	/** Where to get token objects */
	TokenBuffer* input;
	/// Do we need to free the TokenBuffer or is it owned by another..
	bool inputResponsible;

	// we don't want these:
	ParserInputState(const ParserInputState&);
	ParserInputState& operator=(const ParserInputState&);
};

/// A reference counted ParserInputState
typedef RefCount ParserSharedInputState;

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_ParserSharedInputState_hpp__
antlr-2.7.7/lib/cpp/antlr/Makefile.in0000644000175000017500000000711510522211615017321 0ustar  twernertwerner###############################################################################
# $Id:$
###############################################################################

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
@stdvars@
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx

## do not change this value 
subdir=lib/cpp/antlr

antlr_hpp_FILES = \
  @abs_top_srcdir@/lib/cpp/antlr/ANTLRException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/ANTLRUtil.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/ASTArray.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/ASTFactory.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/AST.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/ASTNULLType.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/ASTPair.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/ASTRefCount.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/BaseAST.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/BitSet.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/CharBuffer.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/CharInputBuffer.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/CharScanner.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/CharStreamException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/CharStreamIOException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/CircularQueue.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/CommonAST.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/CommonASTWithHiddenTokens.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/CommonHiddenStreamToken.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/CommonToken.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/config.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/Countable.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/InputBuffer.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/IOException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/LexerSharedInputState.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/LLkParser.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/MismatchedCharException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/MismatchedTokenException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/NoViableAltException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/NoViableAltForCharException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/Parser.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/ParserSharedInputState.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/RecognitionException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/RefCount.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/SemanticException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/String.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TokenBuffer.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/Token.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TokenRefCount.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TokenStreamBasicFilter.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TokenStreamException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TokenStreamHiddenTokenFilter.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TokenStream.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TokenStreamIOException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TokenStreamRecognitionException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TokenStreamRetryException.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TokenStreamRewriteEngine.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TokenStreamSelector.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TokenWithIndex.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TreeParser.hpp \
  @abs_top_srcdir@/lib/cpp/antlr/TreeParserSharedInputState.hpp \
	$(eol)


all : 

clean:

distclean: clean
	@RMF@ Makefile

test:

install:
	@@ECHO@ "install hpp files .. "
	@$(MKDIR) -p "$(includedir)/antlr"
	@for f in $(antlr_hpp_FILES) ; do \
		@ECHO@ "install $${f}" ; \
		if test -f "$${f}" ; then \
			$(INSTALL) -m 444 "$${f}" "$(includedir)/antlr" ; \
		fi ;\
	done

.PHONY: all clean distclean install test
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
@stddeps@
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
antlr-2.7.7/lib/cpp/antlr/ASTNULLType.hpp0000644000175000017500000000343410522211615017751 0ustar  twernertwerner#ifndef INC_ASTNULLType_hpp__
#define INC_ASTNULLType_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/ASTNULLType.hpp#2 $
 */

#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** There is only one instance of this class **/
class ANTLR_API ASTNULLType : public AST {
public:
	const char* typeName( void ) const;
	RefAST clone( void ) const;

	void addChild(RefAST c);
	size_t getNumberOfChildren() const;
	void setFirstChild(RefAST c);
	void setNextSibling(RefAST n);

	bool equals(RefAST t) const;
	bool equalsList(RefAST t) const;
	bool equalsListPartial(RefAST t) const;
	bool equalsTree(RefAST t) const;
	bool equalsTreePartial(RefAST t) const;

	ANTLR_USE_NAMESPACE(std)vector findAll(RefAST tree);
	ANTLR_USE_NAMESPACE(std)vector findAllPartial(RefAST subtree);

	RefAST getFirstChild() const;
	RefAST getNextSibling() const;

	ANTLR_USE_NAMESPACE(std)string getText() const;
	int getType() const;

	void initialize(int t, const ANTLR_USE_NAMESPACE(std)string& txt);
	void initialize(RefAST t);
	void initialize(RefToken t);
	void initialize(ANTLR_USE_NAMESPACE(std)istream& infile);

	void setText(const ANTLR_USE_NAMESPACE(std)string& text);
	void setType(int ttype);
	ANTLR_USE_NAMESPACE(std)string toString() const;
	ANTLR_USE_NAMESPACE(std)string toStringList() const;
	ANTLR_USE_NAMESPACE(std)string toStringTree() const;

	bool attributesToStream( ANTLR_USE_NAMESPACE(std)ostream &out ) const;
	void toStream( ANTLR_USE_NAMESPACE(std)ostream &out ) const;
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_ASTNULLType_hpp__
antlr-2.7.7/lib/cpp/antlr/AST.hpp0000644000175000017500000001230210522211615016406 0ustar  twernertwerner#ifndef INC_AST_hpp__
#define INC_AST_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/AST.hpp#2 $
 */

#include 
#include 
#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

struct ASTRef;

class ANTLR_API AST {
public:
	AST() : ref(0) {}
	AST(const AST&) : ref(0) {}
	virtual ~AST() {}

	/// Return the type name for this AST node. (for XML output)
	virtual const char* typeName( void ) const = 0;
	/// Clone this AST node.
	virtual RefAST clone( void ) const = 0;
   /// Is node t equal to this in terms of token type and text?
	virtual bool equals(RefAST t) const = 0;
   /** Is t an exact structural and equals() match of this tree. The
	 * 'this' reference is considered the start of a sibling list.
	 */
	virtual bool equalsList(RefAST t) const = 0;

	/** Is 't' a subtree of this list? The siblings of the root are NOT ignored.
    */
	virtual bool equalsListPartial(RefAST t) const = 0;
	/** Is tree rooted at 'this' equal to 't'?  The siblings of 'this' are
	 * ignored.
	 */
	virtual bool equalsTree(RefAST t) const = 0;
	/** Is 't' a subtree of the tree rooted at 'this'? The siblings of
	 * 'this' are ignored.
	 */
	virtual bool equalsTreePartial(RefAST t) const = 0;

	/** Walk the tree looking for all exact subtree matches.  Return
	 *  a vector of RefAST that lets the caller walk the list
	 *  of subtree roots found herein.
	 */
	virtual ANTLR_USE_NAMESPACE(std)vector findAll(RefAST t) = 0;

   /** Walk the tree looking for all subtrees.  Return
    *  a vector of RefAST that lets the caller walk the list
    *  of subtree roots found herein.
    */
	virtual ANTLR_USE_NAMESPACE(std)vector findAllPartial(RefAST t) = 0;

   /// Add a node to the end of the child list for this node
	virtual void addChild(RefAST c) = 0;
	/// Get the number of children. Returns 0 if the node is a leaf
	virtual size_t getNumberOfChildren() const = 0;

	/// Get the first child of this node; null if no children
	virtual RefAST getFirstChild() const = 0;
	/// Get  the next sibling in line after this one
	virtual RefAST getNextSibling() const = 0;

	/// Get the token text for this node
	virtual ANTLR_USE_NAMESPACE(std)string getText() const = 0;
	/// Get the token type for this node
	virtual int getType() const = 0;

	/** Various initialization routines. Used by several factories to initialize
	 * an AST element.
	 */
	virtual void initialize(int t, const ANTLR_USE_NAMESPACE(std)string& txt) = 0;
	virtual void initialize(RefAST t) = 0;
	virtual void initialize(RefToken t) = 0;

#ifdef ANTLR_SUPPORT_XML
	/** initialize this node from the contents of a stream.
	 * @param in the stream to read the AST attributes from.
	 */
	virtual void initialize( ANTLR_USE_NAMESPACE(std)istream& in ) = 0;
#endif

	/// Set the first child of a node.
	virtual void setFirstChild(RefAST c) = 0;
	/// Set the next sibling after this one.
	virtual void setNextSibling(RefAST n) = 0;

	/// Set the token text for this node
	virtual void setText(const ANTLR_USE_NAMESPACE(std)string& txt) = 0;
	/// Set the token type for this node
	virtual void setType(int type) = 0;

	/// Return this AST node as a string
	virtual ANTLR_USE_NAMESPACE(std)string toString() const = 0;

	/// Print out a child-sibling tree in LISP notation
	virtual ANTLR_USE_NAMESPACE(std)string toStringList() const = 0;
	virtual ANTLR_USE_NAMESPACE(std)string toStringTree() const = 0;

#ifdef ANTLR_SUPPORT_XML
	/** get attributes of this node to 'out'. Override to customize XML
	 * output.
	 * @param out the stream to write the AST attributes to.
	 * @returns if a explicit closetag should be written
	 */
	virtual bool attributesToStream( ANTLR_USE_NAMESPACE(std)ostream& out ) const = 0;

	/** Print a symbol over ostream. Overload this one to customize the XML
	 * output for AST derived AST-types
	 * @param output stream
	 */
	virtual void toStream( ANTLR_USE_NAMESPACE(std)ostream &out ) const = 0;

	/** Dump AST contents in XML format to output stream.
	 * Works in conjunction with to_stream method. Overload that one is
	 * derived classes to customize behaviour.
	 * @param output stream to write to string to put the stuff in.
	 * @param ast RefAST object to write.
	 */
	friend ANTLR_USE_NAMESPACE(std)ostream& operator<<( ANTLR_USE_NAMESPACE(std)ostream& output, const RefAST& ast );
#endif

private:
	friend struct ASTRef;
	ASTRef* ref;

	AST(RefAST other);
	AST& operator=(const AST& other);
	AST& operator=(RefAST other);
};

#ifdef ANTLR_SUPPORT_XML
inline ANTLR_USE_NAMESPACE(std)ostream& operator<<( ANTLR_USE_NAMESPACE(std)ostream& output, const RefAST& ast )
{
	ast->toStream(output);
	return output;
}
#endif

extern ANTLR_API RefAST nullAST;
extern ANTLR_API AST* const nullASTptr;

#ifdef NEEDS_OPERATOR_LESS_THAN
// RK: apparently needed by MSVC and a SUN CC, up to and including
// 2.7.2 this was undefined ?
inline bool operator<( RefAST l, RefAST r )
{
	return nullAST == l ? ( nullAST == r ? false : true ) : l->getType() < r->getType();
}
#endif

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_AST_hpp__
antlr-2.7.7/lib/cpp/antlr/TokenStreamException.hpp0000644000175000017500000000161710522211615022101 0ustar  twernertwerner#ifndef INC_TokenStreamException_hpp__
#define INC_TokenStreamException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/TokenStreamException.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** Baseclass for exceptions thrown by classes implementing the TokenStream
 * interface.
 * @see TokenStream
 */
class ANTLR_API TokenStreamException : public ANTLRException {
public:
	TokenStreamException() 
	: ANTLRException()	
	{
	}
	TokenStreamException(const ANTLR_USE_NAMESPACE(std)string& s)
	: ANTLRException(s)
	{
	}
	virtual ~TokenStreamException() throw()
	{
	}
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_TokenStreamException_hpp__
antlr-2.7.7/lib/cpp/antlr/NoViableAltForCharException.hpp0000644000175000017500000000207210522211615023246 0ustar  twernertwerner#ifndef INC_NoViableAltForCharException_hpp__
# define INC_NoViableAltForCharException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/NoViableAltForCharException.hpp#2 $
 */

# include 
# include 
# include 

# ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr
{
# endif

class ANTLR_API NoViableAltForCharException : public RecognitionException
{
public:
	NoViableAltForCharException(int c, CharScanner* scanner);
	NoViableAltForCharException(int c, const ANTLR_USE_NAMESPACE(std)string& fileName_,
										 int line_, int column_);

	virtual ~NoViableAltForCharException() throw()
	{
	}

	/// Returns a clean error message (no line number/column information)
	ANTLR_USE_NAMESPACE(std)string getMessage() const;
protected:
	int foundChar;
};

# ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
# endif

#endif //INC_NoViableAltForCharException_hpp__
antlr-2.7.7/lib/cpp/antlr/TokenWithIndex.hpp0000644000175000017500000000314510522211615020670 0ustar  twernertwerner#ifndef INC_TokenWithIndex_hpp__
#define INC_TokenWithIndex_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id:$
 */

#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API TokenWithIndex : public ANTLR_USE_NAMESPACE(antlr)CommonToken {
public:
	// static size_t count;
	TokenWithIndex() : CommonToken(), index(0)
	{
		// std::cout << __PRETTY_FUNCTION__ << std::endl;
		// count++;
	}
	TokenWithIndex(int t, const ANTLR_USE_NAMESPACE(std)string& txt)
	: CommonToken(t,txt)
	, index(0)
	{
		// std::cout << __PRETTY_FUNCTION__ << std::endl;
		// count++;
	}
	TokenWithIndex(const ANTLR_USE_NAMESPACE(std)string& s)
	: CommonToken(s)
	, index(0)
	{
		// std::cout << __PRETTY_FUNCTION__ << std::endl;
		// count++;
	}
	~TokenWithIndex()
	{
		// count--;
	}
	void setIndex( size_t idx )
	{
		index = idx;
	}
	size_t getIndex( void ) const
	{
		return index;
	}

	ANTLR_USE_NAMESPACE(std)string toString() const
	{
		return ANTLR_USE_NAMESPACE(std)string("[")+
			index+
			":\""+
			getText()+"\",<"+
			getType()+">,line="+
			getLine()+",column="+
			getColumn()+"]";
	}

	static RefToken factory()
	{
		return RefToken(new TokenWithIndex());
	}

protected:
	size_t index;

private:
	TokenWithIndex(const TokenWithIndex&);
	const TokenWithIndex& operator=(const TokenWithIndex&);
};

typedef TokenRefCount RefTokenWithIndex;

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_CommonToken_hpp__
antlr-2.7.7/lib/cpp/antlr/IOException.hpp0000644000175000017500000000166210522211615020154 0ustar  twernertwerner#ifndef INC_IOException_hpp__
#define INC_IOException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id:$
 */

#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** Generic IOException used inside support code. (thrown by XML I/O routs)
 * basically this is something I'm using since a lot of compilers don't
 * support ios_base::failure.
 */
class ANTLR_API IOException : public ANTLRException
{
public:
	ANTLR_USE_NAMESPACE(std)exception io;

	IOException( ANTLR_USE_NAMESPACE(std)exception& e )
		: ANTLRException(e.what())
	{
	}
	IOException( const ANTLR_USE_NAMESPACE(std)string& mesg )
		: ANTLRException(mesg)
	{
	}
	virtual ~IOException() throw()
	{
	}
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_IOException_hpp__
antlr-2.7.7/lib/cpp/antlr/CommonASTWithHiddenTokens.hpp0000644000175000017500000000301510522211615022714 0ustar  twernertwerner#ifndef INC_CommonASTWithHiddenTokens_hpp__
#define INC_CommonASTWithHiddenTokens_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/CommonASTWithHiddenTokens.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** A CommonAST whose initialization copies hidden token
 *  information from the Token used to create a node.
 */
class ANTLR_API CommonASTWithHiddenTokens : public CommonAST {
public:
	CommonASTWithHiddenTokens();
	virtual ~CommonASTWithHiddenTokens();
	virtual const char* typeName( void ) const
	{
		return CommonASTWithHiddenTokens::TYPE_NAME;
	}
	/// Clone this AST node.
	virtual RefAST clone( void ) const;

	// Borland C++ builder seems to need the decl's of the first two...
	virtual void initialize(int t,const ANTLR_USE_NAMESPACE(std)string& txt);
	virtual void initialize(RefAST t);
	virtual void initialize(RefToken t);

	virtual RefToken getHiddenAfter() const
	{
		return hiddenAfter;
	}

	virtual RefToken getHiddenBefore() const
	{
		return hiddenBefore;
	}

	static RefAST factory();

	static const char* const TYPE_NAME;
protected:
	RefToken hiddenBefore,hiddenAfter; // references to hidden tokens
};

typedef ASTRefCount RefCommonASTWithHiddenTokens;

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_CommonASTWithHiddenTokens_hpp__
antlr-2.7.7/lib/cpp/antlr/BitSet.hpp0000644000175000017500000000347610522211615017165 0ustar  twernertwerner#ifndef INC_BitSet_hpp__
#define INC_BitSet_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/BitSet.hpp#2 $
 */

#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** A BitSet to replace java.util.BitSet.
 * Primary differences are that most set operators return new sets
 * as opposed to oring and anding "in place".  Further, a number of
 * operations were added.  I cannot contain a BitSet because there
 * is no way to access the internal bits (which I need for speed)
 * and, because it is final, I cannot subclass to add functionality.
 * Consider defining set degree.  Without access to the bits, I must
 * call a method n times to test the ith bit...ack!
 *
 * Also seems like or() from util is wrong when size of incoming set is bigger
 * than this.length.
 *
 * This is a C++ version of the Java class described above, with only
 * a handful of the methods implemented, because we don't need the
 * others at runtime. It's really just a wrapper around vector,
 * which should probably be changed to a wrapper around bitset, once
 * bitset is more widely available.
 *
 * @author Terence Parr, MageLang Institute
 * @author 
Pete Wells
 */
class ANTLR_API BitSet {
private:
	ANTLR_USE_NAMESPACE(std)vector storage;

public:
	BitSet( unsigned int nbits=64 );
	BitSet( const unsigned long* bits_, unsigned int nlongs);
	~BitSet();

	void add( unsigned int el );

	bool member( unsigned int el ) const;

	ANTLR_USE_NAMESPACE(std)vector toArray() const;
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_BitSet_hpp__
antlr-2.7.7/lib/cpp/antlr/BaseAST.hpp0000644000175000017500000001101710522211615017203 0ustar  twernertwerner#ifndef INC_BaseAST_hpp__
#define INC_BaseAST_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/BaseAST.hpp#2 $
 */

#include 
#include 

#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API BaseAST;
typedef ASTRefCount RefBaseAST;

class ANTLR_API BaseAST : public AST {
public:
	BaseAST() : AST()
	{
	}
	BaseAST(const BaseAST& other)
	: AST(other)
	{
	}
	virtual ~BaseAST()
	{
	}

	/// Return the class name
	virtual const char* typeName( void ) const = 0;

	/// Clone this AST node.
	virtual RefAST clone( void ) const = 0;

   /// Is node t equal to this in terms of token type and text?
	virtual bool equals(RefAST t) const;

   /** Is t an exact structural and equals() match of this tree. The
	 * 'this' reference is considered the start of a sibling list.
	 */
	virtual bool equalsList(RefAST t) const;

   /** Is 't' a subtree of this list? The siblings of the root are NOT ignored.
    */
	virtual bool equalsListPartial(RefAST t) const;

	/** Is tree rooted at 'this' equal to 't'?  The siblings of 'this' are
	 * ignored.
	 */
	virtual bool equalsTree(RefAST t) const;

	/** Is 't' a subtree of the tree rooted at 'this'? The siblings of
	 * 'this' are ignored.
	 */
	virtual bool equalsTreePartial(RefAST t) const;

	/** Walk the tree looking for all exact subtree matches.  Return
	 *  an ASTEnumerator that lets the caller walk the list
	 *  of subtree roots found herein.
	 */
	virtual ANTLR_USE_NAMESPACE(std)vector findAll(RefAST t);

   /** Walk the tree looking for all subtrees.  Return
    *  an ASTEnumerator that lets the caller walk the list
    *  of subtree roots found herein.
    */
	virtual ANTLR_USE_NAMESPACE(std)vector findAllPartial(RefAST t);

   /// Add a node to the end of the child list for this node
	virtual void addChild(RefAST c)
	{
		if( !c )
			return;

		RefBaseAST tmp = down;

		if (tmp)
		{
			while (tmp->right)
				tmp = tmp->right;
			tmp->right = c;
		}
		else
			down = c;
	}

	/** Get the number of child nodes of this node (shallow e.g. not of the
	 * whole tree it spans).
	 */
	virtual size_t getNumberOfChildren() const;

	/// Get the first child of this node; null if no children
	virtual RefAST getFirstChild() const
	{
		return RefAST(down);
	}
	/// Get  the next sibling in line after this one
	virtual RefAST getNextSibling() const
	{
		return RefAST(right);
	}

	/// Get the token text for this node
	virtual ANTLR_USE_NAMESPACE(std)string getText() const
	{
		return "";
	}
	/// Get the token type for this node
	virtual int getType() const
	{
		return 0;
	}

	/// Remove all children
	virtual void removeChildren()
	{
		down = static_cast(static_cast(nullAST));
	}

	/// Set the first child of a node.
	virtual void setFirstChild(RefAST c)
	{
		down = static_cast(static_cast(c));
	}

	/// Set the next sibling after this one.
	virtual void setNextSibling(RefAST n)
	{
		right = static_cast(static_cast(n));
	}

	/// Set the token text for this node
	virtual void setText(const ANTLR_USE_NAMESPACE(std)string& txt)
	{
	}

	/// Set the token type for this node
	virtual void setType(int type)
	{
	}

#ifdef ANTLR_SUPPORT_XML
	/** print attributes of this node to 'out'. Override to customize XML
	 * output.
	 * @param out the stream to write the AST attributes to.
	 */
	virtual bool attributesToStream( ANTLR_USE_NAMESPACE(std)ostream& out ) const;
	/** Write this subtree to a stream. Overload this one to customize the XML
	 * output for AST derived AST-types
	 * @param output stream
	 */
	virtual void toStream( ANTLR_USE_NAMESPACE(std)ostream &out ) const;
#endif

	/// Return string representation for the AST
	virtual ANTLR_USE_NAMESPACE(std)string toString() const
	{
		return getText();
	}

	/// Print out a child sibling tree in LISP notation
	virtual ANTLR_USE_NAMESPACE(std)string toStringList() const;
	virtual ANTLR_USE_NAMESPACE(std)string toStringTree() const;
protected:
	RefBaseAST down;
	RefBaseAST right;
private:
	void doWorkForFindAll(ANTLR_USE_NAMESPACE(std)vector& v,
								 RefAST target,
								 bool partialMatch);
};

/** Is node t equal to this in terms of token type and text?
 */
inline bool BaseAST::equals(RefAST t) const
{
	if (!t)
		return false;
	return ((getType() == t->getType()) && (getText() == t->getText()));
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_BaseAST_hpp__
antlr-2.7.7/lib/cpp/antlr/CommonAST.hpp0000644000175000017500000000355610522211615017572 0ustar  twernertwerner#ifndef INC_CommonAST_hpp__
#define INC_CommonAST_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/CommonAST.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API CommonAST : public BaseAST {
public:
	CommonAST()
	: BaseAST()
	, ttype( Token::INVALID_TYPE )
	, text()
	{
	}

	CommonAST( RefToken t )
	: BaseAST()
	, ttype( t->getType() )
	, text( t->getText() )
	{
	}

	CommonAST( const CommonAST& other )
	: BaseAST(other)
	, ttype(other.ttype)
	, text(other.text)
	{
	}

	virtual ~CommonAST()
	{
	}

	virtual const char* typeName( void ) const
	{
		return CommonAST::TYPE_NAME;
	}

	/// Clone this AST node.
	virtual RefAST clone( void ) const
	{
		CommonAST *ast = new CommonAST( *this );
		return RefAST(ast);
	}

	virtual ANTLR_USE_NAMESPACE(std)string getText() const
	{
		return text;
	}
	virtual int getType() const
	{
		return ttype;
	}

	virtual void initialize( int t, const ANTLR_USE_NAMESPACE(std)string& txt )
	{
		setType(t);
		setText(txt);
	}

	virtual void initialize( RefAST t )
	{
		setType(t->getType());
		setText(t->getText());
	}
	virtual void initialize( RefToken t )
	{
		setType(t->getType());
		setText(t->getText());
	}

#ifdef ANTLR_SUPPORT_XML
	virtual void initialize( ANTLR_USE_NAMESPACE(std)istream& in );
#endif

	virtual void setText( const ANTLR_USE_NAMESPACE(std)string& txt )
	{
		text = txt;
	}
	virtual void setType( int type )
	{
		ttype = type;
	}

	static RefAST factory();

	static const char* const TYPE_NAME;
protected:
	int ttype;
	ANTLR_USE_NAMESPACE(std)string text;
};

typedef ASTRefCount RefCommonAST;

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_CommonAST_hpp__
antlr-2.7.7/lib/cpp/antlr/RecognitionException.hpp0000644000175000017500000000337010522211615022123 0ustar  twernertwerner#ifndef INC_RecognitionException_hpp__
# define INC_RecognitionException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/RecognitionException.hpp#2 $
 */

# include 
# include 

# ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr
{
# endif
	class ANTLR_API RecognitionException : public ANTLRException
	{
	public:
		RecognitionException();
		RecognitionException(const ANTLR_USE_NAMESPACE(std)string& s);
		RecognitionException(const ANTLR_USE_NAMESPACE(std)string& s,
									const ANTLR_USE_NAMESPACE(std)string& fileName,
									int line, int column );

		virtual ~RecognitionException() throw()
		{
		}

		/// Return file where mishap occurred.
		virtual ANTLR_USE_NAMESPACE(std)string getFilename() const throw()
		{
			return fileName;
		}
		/**
		 * @return the line number that this exception happened on.
		 */
		virtual int getLine() const throw()
		{
			return line;
		}
		/**
		 * @return the column number that this exception happened on.
		 */
		virtual int getColumn() const throw()
		{
			return column;
		}

		/// Return complete error message with line/column number info (if present)
		virtual ANTLR_USE_NAMESPACE(std)string toString() const;

		/// See what file/line/column info is present and return it as a string
		virtual ANTLR_USE_NAMESPACE(std)string getFileLineColumnString() const;
	protected:
		ANTLR_USE_NAMESPACE(std)string fileName; // not used by treeparsers
		int line;    // not used by treeparsers
		int column;  // not used by treeparsers
	};

# ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
# endif

#endif //INC_RecognitionException_hpp__
antlr-2.7.7/lib/cpp/antlr/CharBuffer.hpp0000644000175000017500000000267210522211615017777 0ustar  twernertwerner#ifndef INC_CharBuffer_hpp__
#define INC_CharBuffer_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/CharBuffer.hpp#2 $
 */

#include 

#include 

#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/**A Stream of characters fed to the lexer from a InputStream that can
 * be rewound via mark()/rewind() methods.
 * 

 * A dynamic array is used to buffer up all the input characters.  Normally,
 * "k" characters are stored in the buffer.  More characters may be stored
 * during guess mode (testing syntactic predicate), or when LT(i>k) is
 * referenced.
 * Consumption of characters is deferred.  In other words, reading the next
 * character is not done by consume(), but deferred until needed by LA or LT.
 * 

 *
 * @see antlr.CharQueue
 */

class ANTLR_API CharBuffer : public InputBuffer {
public:
	/// Create a character buffer
	CharBuffer( ANTLR_USE_NAMESPACE(std)istream& input );
	/// Get the next character from the stream
	int getChar();

protected:
	// character source
	ANTLR_USE_NAMESPACE(std)istream& input;

private:
	// NOTE: Unimplemented
	CharBuffer(const CharBuffer& other);
	CharBuffer& operator=(const CharBuffer& other);
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_CharBuffer_hpp__
antlr-2.7.7/lib/cpp/antlr/MismatchedCharException.hpp0000644000175000017500000000370010522211615022514 0ustar  twernertwerner#ifndef INC_MismatchedCharException_hpp__
#define INC_MismatchedCharException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/MismatchedCharException.hpp#2 $
 */

#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class CharScanner;

class ANTLR_API MismatchedCharException : public RecognitionException {
public:
	// Types of chars
#ifndef NO_STATIC_CONSTS
	static const int CHAR = 1;
	static const int NOT_CHAR = 2;
	static const int RANGE = 3;
	static const int NOT_RANGE = 4;
	static const int SET = 5;
	static const int NOT_SET = 6;
#else
	enum {
		CHAR = 1,
		NOT_CHAR = 2,
		RANGE = 3,
		NOT_RANGE = 4,
		SET = 5,
		NOT_SET = 6
	};
#endif

public:
	// One of the above
	int mismatchType;

	// what was found on the input stream
	int foundChar;

	// For CHAR/NOT_CHAR and RANGE/NOT_RANGE
	int expecting;

	// For RANGE/NOT_RANGE (expecting is lower bound of range)
	int upper;

	// For SET/NOT_SET
	BitSet set;

protected:
	// who knows...they may want to ask scanner questions
	CharScanner* scanner;

public:
	MismatchedCharException();

	// Expected range / not range
	MismatchedCharException(
		int c,
		int lower,
		int upper_,
		bool matchNot,
		CharScanner* scanner_
	);

	// Expected token / not token
	MismatchedCharException(
		int c,
		int expecting_,
		bool matchNot,
		CharScanner* scanner_
	);

	// Expected BitSet / not BitSet
	MismatchedCharException(
		int c,
		BitSet set_,
		bool matchNot,
		CharScanner* scanner_
	);

	~MismatchedCharException() throw() {}

	/**
	 * Returns a clean error message (no line number/column information)
	 */
	ANTLR_USE_NAMESPACE(std)string getMessage() const;
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_MismatchedCharException_hpp__
antlr-2.7.7/lib/cpp/antlr/CharStreamIOException.hpp0000644000175000017500000000144510522211615022125 0ustar  twernertwerner#ifndef INC_CharStreamIOException_hpp__
#define INC_CharStreamIOException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/CharStreamIOException.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API CharStreamIOException : public CharStreamException {
public:
	ANTLR_USE_NAMESPACE(std)exception io;

	CharStreamIOException(ANTLR_USE_NAMESPACE(std)exception& e)
		: CharStreamException(e.what()), io(e) {}
	~CharStreamIOException() throw() {}
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_CharStreamIOException_hpp__
antlr-2.7.7/lib/cpp/antlr/ASTRefCount.hpp0000644000175000017500000000331410522211615020057 0ustar  twernertwerner#ifndef INC_ASTRefCount_hpp__
# define INC_ASTRefCount_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/ASTRefCount.hpp#2 $
 */

# include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

	class AST;

struct ANTLR_API ASTRef
{
	AST* const ptr;
	unsigned int count;

	ASTRef(AST* p);
	~ASTRef();
	ASTRef* increment()
	{
		++count;
		return this;
	}
	bool decrement()
	{
		return (--count==0);
	}

	static ASTRef* getRef(const AST* p);
private:
	ASTRef( const ASTRef& );
	ASTRef& operator=( const ASTRef& );
};

template
	class ANTLR_API ASTRefCount
{
private:
	ASTRef* ref;

public:
	ASTRefCount(const AST* p=0)
	: ref(p ? ASTRef::getRef(p) : 0)
	{
	}
	ASTRefCount(const ASTRefCount& other)
	: ref(other.ref ? other.ref->increment() : 0)
	{
	}
	~ASTRefCount()
	{
		if (ref && ref->decrement())
			delete ref;
	}
	ASTRefCount& operator=(AST* other)
	{
		ASTRef* tmp = ASTRef::getRef(other);

		if (ref && ref->decrement())
			delete ref;

		ref=tmp;

		return *this;
	}
	ASTRefCount& operator=(const ASTRefCount& other)
	{
		if( other.ref != ref )
		{
			ASTRef* tmp = other.ref ? other.ref->increment() : 0;

			if (ref && ref->decrement())
				delete ref;

			ref=tmp;
		}
		return *this;
	}

	operator T* ()  const { return ref ? static_cast(ref->ptr) : 0; }
	T* operator->() const { return ref ? static_cast(ref->ptr) : 0; }
	T* get()        const { return ref ? static_cast(ref->ptr) : 0; }
};

typedef ASTRefCount RefAST;

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_ASTRefCount_hpp__
antlr-2.7.7/lib/cpp/antlr/TokenStreamBasicFilter.hpp0000644000175000017500000000205110522211615022323 0ustar  twernertwerner#ifndef INC_TokenStreamBasicFilter_hpp__
#define INC_TokenStreamBasicFilter_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/TokenStreamBasicFilter.hpp#2 $
 */

#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** This object is a TokenStream that passes through all
 *  tokens except for those that you tell it to discard.
 *  There is no buffering of the tokens.
 */
class ANTLR_API TokenStreamBasicFilter : public TokenStream {
	/** The set of token types to discard */
protected:
	BitSet discardMask;

	/** The input stream */
protected:
	TokenStream* input;

public:
	TokenStreamBasicFilter(TokenStream& input_);

	void discard(int ttype);

	void discard(const BitSet& mask);

	RefToken nextToken();
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_TokenStreamBasicFilter_hpp__
antlr-2.7.7/lib/cpp/antlr/LexerSharedInputState.hpp0000644000175000017500000000662710522211615022223 0ustar  twernertwerner#ifndef INC_LexerSharedInputState_hpp__
#define INC_LexerSharedInputState_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/LexerSharedInputState.hpp#2 $
 */

#include 
#include 
#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** This object contains the data associated with an
 *  input stream of characters.  Multiple lexers
 *  share a single LexerSharedInputState to lex
 *  the same input stream.
 */
class ANTLR_API LexerInputState {
public:
	/** Construct a new LexerInputState
	 * @param inbuf the InputBuffer to read from. The object is deleted together
	 * with the LexerInputState object.
	 */
	LexerInputState(InputBuffer* inbuf)
	: column(1)
	, line(1)
	, tokenStartColumn(1)
	, tokenStartLine(1)
	, guessing(0)
	, filename("")
	, input(inbuf)
	, inputResponsible(true)
	{
	}

	/** Construct a new LexerInputState
	 * @param inbuf the InputBuffer to read from.
	 */
	LexerInputState(InputBuffer& inbuf)
	: column(1)
	, line(1)
	, tokenStartColumn(1)
	, tokenStartLine(1)
	, guessing(0)
	, filename("")
	, input(&inbuf)
	, inputResponsible(false)
	{
	}

	/** Construct a new LexerInputState
	 * @param in an istream to read from.
	 * @see antlr.CharBuffer
	 */
	LexerInputState(ANTLR_USE_NAMESPACE(std)istream& in)
	: column(1)
	, line(1)
	, tokenStartColumn(1)
	, tokenStartLine(1)
	, guessing(0)
	, filename("")
	, input(new CharBuffer(in))
	, inputResponsible(true)
	{
	}

	/** Reset the LexerInputState with a specified stream and filename.
	 * This method is a hack, dunno what I was thinking when I added it.
	 * This should actually be done in a subclass.
	 * @deprecated
	 */
	virtual void initialize( ANTLR_USE_NAMESPACE(std)istream& in, const char* file = "" )
	{
		column = 1;
		line = 1;
		tokenStartColumn = 1;
		tokenStartLine = 1;
		guessing = 0;
		filename = file;

		if( input && inputResponsible )
			delete input;

		input = new CharBuffer(in);
		inputResponsible = true;
	}

	/** Reset the LexerInputState to initial state.
	 * The underlying InputBuffer is also reset.
	 */
	virtual void reset( void )
	{
		column = 1;
		line = 1;
		tokenStartColumn = 1;
		tokenStartLine = 1;
		guessing = 0;
		input->reset();
	}

	/** Set the file position of the SharedLexerInputState.
	 * @param line_ line number to be set
	 * @param column_ column number to be set
	 */
	void setPosition( int line_, int column_ )
	{
		line = line_;
		column = column_;
	}

	virtual ~LexerInputState()
	{
		if (inputResponsible)
			delete input;
	}

	int column;
	int line;
	int tokenStartColumn;
	int tokenStartLine;
	int guessing;
	/** What file (if known) caused the problem? */
	ANTLR_USE_NAMESPACE(std)string filename;
	InputBuffer& getInput();
private:
	/// Input buffer we use
	InputBuffer* input;
	/// Who is responsible for cleaning up the InputBuffer?
	bool inputResponsible;

	// we don't want these:
	LexerInputState(const LexerInputState&);
	LexerInputState& operator=(const LexerInputState&);
};

inline InputBuffer& LexerInputState::getInput()
{
	return *input;
}

/// A reference counted LexerInputState object
typedef RefCount LexerSharedInputState;

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_LexerSharedInputState_hpp__
antlr-2.7.7/lib/cpp/antlr/CharScanner.hpp0000644000175000017500000003265210522211615020160 0ustar  twernertwerner#ifndef INC_CharScanner_hpp__
#define INC_CharScanner_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/CharScanner.hpp#2 $
 */

#include 

#include 

#ifdef HAS_NOT_CCTYPE_H
#include 
#else
#include 
#endif

#if ( _MSC_VER == 1200 )
// VC6 seems to need this
// note that this is not a standard C++ include file.
# include 
#endif

#include 
#include 
#include 
#include 
#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API CharScanner;

ANTLR_C_USING(tolower)

#ifdef ANTLR_REALLY_NO_STRCASECMP
// Apparently, neither strcasecmp nor stricmp is standard, and Codewarrior
// on the mac has neither...
inline int strcasecmp(const char *s1, const char *s2)
{
	while (true)
	{
		char  c1 = tolower(*s1++),
				c2 = tolower(*s2++);
		if (c1 < c2) return -1;
		if (c1 > c2) return 1;
		if (c1 == 0) return 0;
	}
}
#else
#ifdef NO_STRCASECMP
ANTLR_C_USING(stricmp)
#else
ANTLR_C_USING(strcasecmp)
#endif
#endif

/** Functor for the literals map
 */
class ANTLR_API CharScannerLiteralsLess : public ANTLR_USE_NAMESPACE(std)binary_function {
private:
	const CharScanner* scanner;
public:
#ifdef NO_TEMPLATE_PARTS
	CharScannerLiteralsLess() {} // not really used, definition to appease MSVC
#endif
	CharScannerLiteralsLess(const CharScanner* theScanner)
	: scanner(theScanner)
	{
	}
	bool operator() (const ANTLR_USE_NAMESPACE(std)string& x,const ANTLR_USE_NAMESPACE(std)string& y) const;
// defaults are good enough..
	//	CharScannerLiteralsLess(const CharScannerLiteralsLess&);
	//	CharScannerLiteralsLess& operator=(const CharScannerLiteralsLess&);
};

/** Superclass of generated lexers
 */
class ANTLR_API CharScanner : public TokenStream {
protected:
	typedef RefToken (*factory_type)();
public:
	CharScanner(InputBuffer& cb, bool case_sensitive );
	CharScanner(InputBuffer* cb, bool case_sensitive );
	CharScanner(const LexerSharedInputState& state, bool case_sensitive );

	virtual ~CharScanner()
	{
	}

	virtual int LA(unsigned int i);

	virtual void append(char c)
	{
		if (saveConsumedInput)
		{
			size_t l = text.length();

			if ((l%256) == 0)
				text.reserve(l+256);

			text.replace(l,0,&c,1);
		}
	}

	virtual void append(const ANTLR_USE_NAMESPACE(std)string& s)
	{
		if( saveConsumedInput )
			text += s;
	}

	virtual void commit()
	{
		inputState->getInput().commit();
	}

	/** called by the generated lexer to do error recovery, override to
	 * customize the behaviour.
	 */
	virtual void recover(const RecognitionException& ex, const BitSet& tokenSet)
	{
		consume();
		consumeUntil(tokenSet);
	}

	virtual void consume()
	{
		if (inputState->guessing == 0)
		{
			int c = LA(1);
			if (caseSensitive)
			{
				append(c);
			}
			else
			{
				// use input.LA(), not LA(), to get original case
				// CharScanner.LA() would toLower it.
				append(inputState->getInput().LA(1));
			}

			// RK: in a sense I don't like this automatic handling.
			if (c == '\t')
				tab();
			else
				inputState->column++;
		}
		inputState->getInput().consume();
	}

	/** Consume chars until one matches the given char */
	virtual void consumeUntil(int c)
	{
		for(;;)
		{
			int la_1 = LA(1);
			if( la_1 == EOF_CHAR || la_1 == c )
				break;
			consume();
		}
	}

	/** Consume chars until one matches the given set */
	virtual void consumeUntil(const BitSet& set)
	{
		for(;;)
		{
			int la_1 = LA(1);
			if( la_1 == EOF_CHAR || set.member(la_1) )
				break;
			consume();
		}
	}

	/// Mark the current position and return a id for it
	virtual unsigned int mark()
	{
		return inputState->getInput().mark();
	}
	/// Rewind the scanner to a previously marked position
	virtual void rewind(unsigned int pos)
	{
		inputState->getInput().rewind(pos);
	}

	/// See if input contains character 'c' throw MismatchedCharException if not
	virtual void match(int c)
	{
		int la_1 = LA(1);
		if ( la_1 != c )
			throw MismatchedCharException(la_1, c, false, this);
		consume();
	}

	/** See if input contains element from bitset b
	 * throw MismatchedCharException if not
	 */
	virtual void match(const BitSet& b)
	{
		int la_1 = LA(1);

		if ( !b.member(la_1) )
			throw MismatchedCharException( la_1, b, false, this );
		consume();
	}

	/** See if input contains string 's' throw MismatchedCharException if not
	 * @note the string cannot match EOF
	 */
	virtual void match( const char* s )
	{
		while( *s != '\0' )
		{
			// the & 0xFF is here to prevent sign extension lateron
			int la_1 = LA(1), c = (*s++ & 0xFF);

			if ( la_1 != c )
				throw MismatchedCharException(la_1, c, false, this);

			consume();
		}
	}
	/** See if input contains string 's' throw MismatchedCharException if not
	 * @note the string cannot match EOF
	 */
	virtual void match(const ANTLR_USE_NAMESPACE(std)string& s)
	{
		size_t len = s.length();

		for (size_t i = 0; i < len; i++)
		{
			// the & 0xFF is here to prevent sign extension lateron
			int la_1 = LA(1), c = (s[i] & 0xFF);

			if ( la_1 != c )
				throw MismatchedCharException(la_1, c, false, this);

			consume();
		}
	}
	/** See if input does not contain character 'c'
	 * throw MismatchedCharException if not
	 */
	virtual void matchNot(int c)
	{
		int la_1 = LA(1);

		if ( la_1 == c )
			throw MismatchedCharException(la_1, c, true, this);

		consume();
	}
	/** See if input contains character in range c1-c2
	 * throw MismatchedCharException if not
	 */
	virtual void matchRange(int c1, int c2)
	{
		int la_1 = LA(1);

		if ( la_1 < c1 || la_1 > c2 )
			throw MismatchedCharException(la_1, c1, c2, false, this);

		consume();
	}

	virtual bool getCaseSensitive() const
	{
		return caseSensitive;
	}

	virtual void setCaseSensitive(bool t)
	{
		caseSensitive = t;
	}

	virtual bool getCaseSensitiveLiterals() const=0;

	/// Get the line the scanner currently is in (starts at 1)
	virtual int getLine() const
	{
		return inputState->line;
	}

	/// set the line number
	virtual void setLine(int l)
	{
		inputState->line = l;
	}

	/// Get the column the scanner currently is in (starts at 1)
	virtual int getColumn() const
	{
		return inputState->column;
	}
	/// set the column number
	virtual void setColumn(int c)
	{
		inputState->column = c;
	}

	/// get the filename for the file currently used
	virtual const ANTLR_USE_NAMESPACE(std)string& getFilename() const
	{
		return inputState->filename;
	}
	/// Set the filename the scanner is using (used in error messages)
	virtual void setFilename(const ANTLR_USE_NAMESPACE(std)string& f)
	{
		inputState->filename = f;
	}

	virtual bool getCommitToPath() const
	{
		return commitToPath;
	}

	virtual void setCommitToPath(bool commit)
	{
		commitToPath = commit;
	}

	/** return a copy of the current text buffer */
	virtual const ANTLR_USE_NAMESPACE(std)string& getText() const
	{
		return text;
	}

	virtual void setText(const ANTLR_USE_NAMESPACE(std)string& s)
	{
		text = s;
	}

	virtual void resetText()
	{
		text = "";
		inputState->tokenStartColumn = inputState->column;
		inputState->tokenStartLine = inputState->line;
	}

	virtual RefToken getTokenObject() const
	{
		return _returnToken;
	}

	/** Used to keep track of line breaks, needs to be called from
	 * within generated lexers when a \n \r is encountered.
	 */
	virtual void newline()
	{
		++inputState->line;
		inputState->column = 1;
	}

	/** Advance the current column number by an appropriate amount according
	 * to the tabsize. This method needs to be explicitly called from the
	 * lexer rules encountering tabs.
	 */
	virtual void tab()
	{
		int c = getColumn();
		int nc = ( ((c-1)/tabsize) + 1) * tabsize + 1;      // calculate tab stop
		setColumn( nc );
	}
	/// set the tabsize. Returns the old tabsize
	int setTabsize( int size )
	{
		int oldsize = tabsize;
		tabsize = size;
		return oldsize;
	}
	/// Return the tabsize used by the scanner
	int getTabSize() const
	{
		return tabsize;
	}

	/** Report exception errors caught in nextToken() */
	virtual void reportError(const RecognitionException& e);

	/** Parser error-reporting function can be overridden in subclass */
	virtual void reportError(const ANTLR_USE_NAMESPACE(std)string& s);

	/** Parser warning-reporting function can be overridden in subclass */
	virtual void reportWarning(const ANTLR_USE_NAMESPACE(std)string& s);

	virtual InputBuffer& getInputBuffer()
	{
		return inputState->getInput();
	}

	virtual LexerSharedInputState getInputState()
	{
		return inputState;
	}

	/** set the input state for the lexer.
	 * @note state is a reference counted object, hence no reference */
	virtual void setInputState(LexerSharedInputState state)
	{
		inputState = state;
	}

	/// Set the factory for created tokens
	virtual void setTokenObjectFactory(factory_type factory)
	{
		tokenFactory = factory;
	}

	/** Test the token text against the literals table
	 * Override this method to perform a different literals test
	 */
	virtual int testLiteralsTable(int ttype) const
	{
		ANTLR_USE_NAMESPACE(std)map::const_iterator i = literals.find(text);
		if (i != literals.end())
			ttype = (*i).second;
		return ttype;
	}

	/** Test the text passed in against the literals table
	 * Override this method to perform a different literals test
	 * This is used primarily when you want to test a portion of
	 * a token
	 */
	virtual int testLiteralsTable(const ANTLR_USE_NAMESPACE(std)string& txt,int ttype) const
	{
		ANTLR_USE_NAMESPACE(std)map::const_iterator i = literals.find(txt);
		if (i != literals.end())
			ttype = (*i).second;
		return ttype;
	}

	/// Override this method to get more specific case handling
	virtual int toLower(int c) const
	{
		// test on EOF_CHAR for buggy (?) STLPort tolower (or HPUX tolower?)
		// also VC++ 6.0 does this. (see fix 422 (is reverted by this fix)
		// this one is more structural. Maybe make this configurable.
		return (c == EOF_CHAR ? EOF_CHAR : tolower(c));
	}

	/** This method is called by YourLexer::nextToken() when the lexer has
	 *  hit EOF condition.  EOF is NOT a character.
	 *  This method is not called if EOF is reached during
	 *  syntactic predicate evaluation or during evaluation
	 *  of normal lexical rules, which presumably would be
	 *  an IOException.  This traps the "normal" EOF condition.
	 *
	 *  uponEOF() is called after the complete evaluation of
	 *  the previous token and only if your parser asks
	 *  for another token beyond that last non-EOF token.
	 *
	 *  You might want to throw token or char stream exceptions
	 *  like: "Heh, premature eof" or a retry stream exception
	 *  ("I found the end of this file, go back to referencing file").
	 */
	virtual void uponEOF()
	{
	}

	/// Methods used to change tracing behavior
	virtual void traceIndent();
	virtual void traceIn(const char* rname);
	virtual void traceOut(const char* rname);

#ifndef NO_STATIC_CONSTS
	static const int EOF_CHAR = EOF;
#else
	enum {
		EOF_CHAR = EOF
	};
#endif
protected:
	ANTLR_USE_NAMESPACE(std)string text; ///< Text of current token
 	/// flag indicating wether consume saves characters
	bool saveConsumedInput;
	factory_type tokenFactory;				///< Factory for tokens
	bool caseSensitive; 						///< Is this lexer case sensitive
	ANTLR_USE_NAMESPACE(std)map literals; // set by subclass

	RefToken _returnToken;		///< used to return tokens w/o using return val

	/// Input state, gives access to input stream, shared among different lexers
	LexerSharedInputState inputState;

	/** Used during filter mode to indicate that path is desired.
	 * A subsequent scan error will report an error as usual
	 * if acceptPath=true;
	 */
	bool commitToPath;

	int tabsize; 	///< tab size the scanner uses.

	/// Create a new RefToken of type t
	virtual RefToken makeToken(int t)
	{
		RefToken tok = tokenFactory();
		tok->setType(t);
		tok->setColumn(inputState->tokenStartColumn);
		tok->setLine(inputState->tokenStartLine);
		return tok;
	}

	/** Tracer class, used when -traceLexer is passed to antlr
	 */
	class Tracer {
	private:
		CharScanner* parser;
		const char* text;

		Tracer(const Tracer& other); 					// undefined
		Tracer& operator=(const Tracer& other); 	// undefined
	public:
		Tracer( CharScanner* p,const char* t )
		: parser(p), text(t)
		{
			parser->traceIn(text);
		}
		~Tracer()
		{
			parser->traceOut(text);
		}
	};

	int traceDepth;
private:
	CharScanner( const CharScanner& other ); 			  		// undefined
	CharScanner& operator=( const CharScanner& other );	// undefined

#ifndef NO_STATIC_CONSTS
	static const int NO_CHAR = 0;
#else
	enum {
		NO_CHAR = 0
	};
#endif
};

inline int CharScanner::LA(unsigned int i)
{
	int c = inputState->getInput().LA(i);

	if ( caseSensitive )
		return c;
	else
		return toLower(c);	// VC 6 tolower bug caught in toLower.
}

inline bool CharScannerLiteralsLess::operator() (const ANTLR_USE_NAMESPACE(std)string& x,const ANTLR_USE_NAMESPACE(std)string& y) const
{
	if (scanner->getCaseSensitiveLiterals())
		return ANTLR_USE_NAMESPACE(std)less()(x,y);
	else
	{
#ifdef NO_STRCASECMP
		return (stricmp(x.c_str(),y.c_str())<0);
#else
		return (strcasecmp(x.c_str(),y.c_str())<0);
#endif
	}
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_CharScanner_hpp__
antlr-2.7.7/lib/cpp/antlr/CommonToken.hpp0000644000175000017500000000324310522211615020214 0ustar  twernertwerner#ifndef INC_CommonToken_hpp__
#define INC_CommonToken_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/CommonToken.hpp#2 $
 */

#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API CommonToken : public Token {
public:
	CommonToken();
	CommonToken(int t, const ANTLR_USE_NAMESPACE(std)string& txt);
	CommonToken(const ANTLR_USE_NAMESPACE(std)string& s);

	/// return contents of token
	virtual ANTLR_USE_NAMESPACE(std)string getText() const
	{
		return text;
	}

	/// set contents of token
	virtual void setText(const ANTLR_USE_NAMESPACE(std)string& s)
	{
		text = s;
	}

	/** get the line the token is at (starting at 1)
	 * @see CharScanner::newline()
	 * @see CharScanner::tab()
	 */
	virtual int getLine() const
	{
		return line;
	}
	/** gt the column the token is at (starting at 1)
	 * @see CharScanner::newline()
	 * @see CharScanner::tab()
	 */
	virtual int getColumn() const
	{
		return col;
	}

	/// set line for token
	virtual void setLine(int l)
	{
		line = l;
	}
	/// set column for token
	virtual void setColumn(int c)
	{
		col = c;
	}

	virtual ANTLR_USE_NAMESPACE(std)string toString() const;
	static RefToken factory();

protected:
	// most tokens will want line and text information
	int line;
	int col;
	ANTLR_USE_NAMESPACE(std)string text;

private:
	CommonToken(const CommonToken&);
	const CommonToken& operator=(const CommonToken&);
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_CommonToken_hpp__
antlr-2.7.7/lib/cpp/antlr/TokenStreamRetryException.hpp0000644000175000017500000000130410522211615023120 0ustar  twernertwerner#ifndef INC_TokenStreamRetryException_hpp__
#define INC_TokenStreamRetryException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/TokenStreamRetryException.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class TokenStreamRetryException : public TokenStreamException {
public:
	TokenStreamRetryException() {}
	~TokenStreamRetryException() throw() {}
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_TokenStreamRetryException_hpp__
antlr-2.7.7/lib/cpp/antlr/ASTArray.hpp0000644000175000017500000000160410522211615017410 0ustar  twernertwerner#ifndef INC_ASTArray_hpp__
#define INC_ASTArray_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/ASTArray.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** ASTArray is a class that allows ANTLR to
  * generate code that can create and initialize an array
  * in one expression, like:
  *    (new ASTArray(3))->add(x)->add(y)->add(z)
  */
class ANTLR_API ASTArray {
public:
	int size; // = 0;
	ANTLR_USE_NAMESPACE(std)vector array;

	ASTArray(int capacity)
	: size(0)
	, array(capacity)
	{
	}

	ASTArray* add(RefAST node)
	{
		array[size++] = node;
		return this;
	}
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_ASTArray_hpp__
antlr-2.7.7/lib/cpp/antlr/TokenStream.hpp0000644000175000017500000000131610522211615020216 0ustar  twernertwerner#ifndef INC_TokenStream_hpp__
#define INC_TokenStream_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/TokenStream.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** This interface allows any object to pretend it is a stream
 * of tokens.
 * @author Terence Parr, MageLang Institute
 */
class ANTLR_API TokenStream {
public:
	virtual RefToken nextToken()=0;
	virtual ~TokenStream()
	{
	}
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_TokenStream_hpp__
antlr-2.7.7/lib/cpp/antlr/CircularQueue.hpp0000644000175000017500000000414710522211615020540 0ustar  twernertwerner#ifndef INC_CircularQueue_hpp__
#define INC_CircularQueue_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/CircularQueue.hpp#2 $
 */

#include 
#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

// Resize every 5000 items
#define OFFSET_MAX_RESIZE 5000

template 
class ANTLR_API CircularQueue {
public:
	CircularQueue()
	: storage()
	, m_offset(0)
	{
	}
	~CircularQueue()
	{
	}

	/// Clear the queue
	inline void clear( void )
	{
		m_offset = 0;
		storage.clear();
	}

	/// @todo this should use at or should have a check
	inline T elementAt( size_t idx ) const
	{
		return storage[idx+m_offset];
	}
	void removeFirst()
	{
		if (m_offset >= OFFSET_MAX_RESIZE)
		{
			storage.erase( storage.begin(), storage.begin() + m_offset + 1 );
			m_offset = 0;
		}
		else
			++m_offset;
	}
	inline void removeItems( size_t nb )
	{
		// it would be nice if we would not get called with nb > entries
		// (or to be precise when entries() == 0)
		// This case is possible when lexer/parser::recover() calls
		// consume+consumeUntil when the queue is empty.
		// In recover the consume says to prepare to read another
		// character/token. Then in the subsequent consumeUntil the
		// LA() call will trigger
		// syncConsume which calls this method *before* the same queue
		// has been sufficiently filled.
		if( nb > entries() )
			nb = entries();

		if (m_offset >= OFFSET_MAX_RESIZE)
		{
			storage.erase( storage.begin(), storage.begin() + m_offset + nb );
			m_offset = 0;
		}
		else
			m_offset += nb;
	}
	inline void append(const T& t)
	{
		storage.push_back(t);
	}
	inline size_t entries() const
	{
		return storage.size() - m_offset;
	}

private:
	ANTLR_USE_NAMESPACE(std)vector storage;
	size_t m_offset;

	CircularQueue(const CircularQueue&);
	const CircularQueue& operator=(const CircularQueue&);
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_CircularQueue_hpp__
antlr-2.7.7/lib/cpp/antlr/TreeParserSharedInputState.hpp0000644000175000017500000000223010522211615023202 0ustar  twernertwerner#ifndef INC_TreeParserSharedInputState_hpp__
#define INC_TreeParserSharedInputState_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/TreeParserSharedInputState.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** This object contains the data associated with an
 *  input AST.  Multiple parsers
 *  share a single TreeParserSharedInputState to parse
 *  the same tree or to have the parser walk multiple
 *  trees.
 */
class ANTLR_API TreeParserInputState {
public:
	TreeParserInputState() : guessing(0) {}
	virtual ~TreeParserInputState() {}

public:
	/** Are we guessing (guessing>0)? */
	int guessing; //= 0;

private:
	// we don't want these:
	TreeParserInputState(const TreeParserInputState&);
	TreeParserInputState& operator=(const TreeParserInputState&);
};

typedef RefCount TreeParserSharedInputState;

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_TreeParserSharedInputState_hpp__
antlr-2.7.7/lib/cpp/antlr/TokenBuffer.hpp0000644000175000017500000000551710522211615020203 0ustar  twernertwerner#ifndef INC_TokenBuffer_hpp__
#define INC_TokenBuffer_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/TokenBuffer.hpp#2 $
 */

#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/**A Stream of Token objects fed to the parser from a TokenStream that can
 * be rewound via mark()/rewind() methods.
 * 

 * A dynamic array is used to buffer up all the input tokens.  Normally,
 * "k" tokens are stored in the buffer.  More tokens may be stored during
 * guess mode (testing syntactic predicate), or when LT(i>k) is referenced.
 * Consumption of tokens is deferred.  In other words, reading the next
 * token is not done by conume(), but deferred until needed by LA or LT.
 * 

 *
 * @todo: see if we can integrate this one with InputBuffer into one template
 * or so.
 *
 * @see antlr.Token
 * @see antlr.TokenStream
 * @see antlr.TokenQueue
 */
class ANTLR_API TokenBuffer {
public:
	/** Create a token buffer */
	TokenBuffer(TokenStream& input_);
	virtual ~TokenBuffer();

	/// Reset the input buffer to empty state
	inline void reset( void )
	{
		nMarkers = 0;
		markerOffset = 0;
		numToConsume = 0;
		queue.clear();
	}

	/** Get a lookahead token value */
	int LA( unsigned int i );

	/** Get a lookahead token */
	RefToken LT( unsigned int i );

	/** Return an integer marker that can be used to rewind the buffer to
	 * its current state.
	 */
	unsigned int mark();

	/**Rewind the token buffer to a marker.
	 * @param mark Marker returned previously from mark()
	 */
	void rewind(unsigned int mark);

	/** Mark another token for deferred consumption */
	inline void consume()
	{
		numToConsume++;
	}

	/// Return the number of entries in the TokenBuffer
	virtual unsigned int entries() const;

private:
	/** Ensure that the token buffer is sufficiently full */
	void fill(unsigned int amount);
	/** Sync up deferred consumption */
	void syncConsume();

protected:
	/// Token source
	TokenStream& input;

	/// Number of active markers
	unsigned int nMarkers;

	/// Additional offset used when markers are active
	unsigned int markerOffset;

	/// Number of calls to consume() since last LA() or LT() call
	unsigned int numToConsume;

	/// Circular queue with Tokens
	CircularQueue queue;

private:
	TokenBuffer(const TokenBuffer& other);
	const TokenBuffer& operator=(const TokenBuffer& other);
};

/** Sync up deferred consumption */
inline void TokenBuffer::syncConsume()
{
	if (numToConsume > 0)
	{
		if (nMarkers > 0)
			markerOffset += numToConsume;
		else
			queue.removeItems( numToConsume );

		numToConsume = 0;
	}
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_TokenBuffer_hpp__
antlr-2.7.7/lib/cpp/antlr/Parser.hpp0000644000175000017500000002125210522211615017217 0ustar  twernertwerner#ifndef INC_Parser_hpp__
#define INC_Parser_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/Parser.hpp#2 $
 */

#include 

#include 
#include 

#include 
#include 
#include 
#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

extern bool DEBUG_PARSER;

/** A generic ANTLR parser (LL(k) for k>=1) containing a bunch of
 * utility routines useful at any lookahead depth.  We distinguish between
 * the LL(1) and LL(k) parsers because of efficiency.  This may not be
 * necessary in the near future.
 *
 * Each parser object contains the state of the parse including a lookahead
 * cache (the form of which is determined by the subclass), whether or
 * not the parser is in guess mode, where tokens come from, etc...
 *
 * 

 * During guess mode, the current lookahead token(s) and token type(s)
 * cache must be saved because the token stream may not have been informed
 * to save the token (via mark) before the try block.
 * Guessing is started by:
 * 
    
 * 
  1. saving the lookahead cache.
 * 
  2. marking the current position in the TokenBuffer.
 * 
  3. increasing the guessing level.
 * 

 *
 * After guessing, the parser state is restored by:
 * 
    
 * 
  1. restoring the lookahead cache.
 * 
  2. rewinding the TokenBuffer.
 * 
  3. decreasing the guessing level.
 * 

 *
 * @see antlr.Token
 * @see antlr.TokenBuffer
 * @see antlr.TokenStream
 * @see antlr.LL1Parser
 * @see antlr.LLkParser
 *
 * @todo add constructors with ASTFactory.
 */
class ANTLR_API Parser {
protected:
	Parser(TokenBuffer& input)
	: inputState(new ParserInputState(input)), astFactory(0), traceDepth(0)
	{
	}
	Parser(TokenBuffer* input)
	: inputState(new ParserInputState(input)), astFactory(0), traceDepth(0)
	{
	}
	Parser(const ParserSharedInputState& state)
	: inputState(state), astFactory(0), traceDepth(0)
	{
	}
public:
	virtual ~Parser()
	{
	}

	/** Return the token type of the ith token of lookahead where i=1
	 * is the current token being examined by the parser (i.e., it
	 * has not been matched yet).
	 */
	virtual int LA(unsigned int i)=0;

	/// Return the i-th token of lookahead
	virtual RefToken LT(unsigned int i)=0;

	/** DEPRECATED! Specify the factory to be used during tree building. (Compulsory)
	 * Setting the factory is nowadays compulsory.
	 * @see setASTFactory
	 */
	virtual void setASTNodeFactory( ASTFactory *factory )
	{
		astFactory = factory;
	}
	/** Specify the factory to be used during tree building. (Compulsory)
	 * Setting the factory is nowadays compulsory.
	 */
	virtual void setASTFactory( ASTFactory *factory )
	{
		astFactory = factory;
	}
	/** Return a pointer to the ASTFactory used.
	 * So you might use it in subsequent treewalkers or to reload AST's
	 * from disk.
	 */
	virtual ASTFactory* getASTFactory()
	{
		return astFactory;
	}
	/** Get the root AST node of the generated AST. When using a custom AST type
	 * or heterogenous AST's, you'll have to convert it to the right type
	 * yourself.
	 */
	virtual RefAST getAST() = 0;

	/// Return the filename of the input file.
	virtual inline ANTLR_USE_NAMESPACE(std)string getFilename() const
	{
		return inputState->filename;
	}
	/// Set the filename of the input file (used for error reporting).
	virtual void setFilename(const ANTLR_USE_NAMESPACE(std)string& f)
	{
		inputState->filename = f;
	}

	virtual void setInputState(ParserSharedInputState state)
	{
		inputState = state;
	}
	virtual inline ParserSharedInputState getInputState() const
	{
		return inputState;
	}

	/// Get another token object from the token stream
	virtual void consume()=0;
	/// Consume tokens until one matches the given token
	virtual void consumeUntil(int tokenType)
	{
		while (LA(1) != Token::EOF_TYPE && LA(1) != tokenType)
			consume();
	}

	/// Consume tokens until one matches the given token set
	virtual void consumeUntil(const BitSet& set)
	{
		while (LA(1) != Token::EOF_TYPE && !set.member(LA(1)))
			consume();
	}

	/** Make sure current lookahead symbol matches token type t.
	 * Throw an exception upon mismatch, which is catch by either the
	 * error handler or by the syntactic predicate.
	 */
	virtual void match(int t)
	{
		if ( DEBUG_PARSER )
		{
			traceIndent();
			ANTLR_USE_NAMESPACE(std)cout << "enter match(" << t << ") with LA(1)=" << LA(1) << ANTLR_USE_NAMESPACE(std)endl;
		}
		if ( LA(1) != t )
		{
			if ( DEBUG_PARSER )
			{
				traceIndent();
				ANTLR_USE_NAMESPACE(std)cout << "token mismatch: " << LA(1) << "!=" << t << ANTLR_USE_NAMESPACE(std)endl;
			}
			throw MismatchedTokenException(getTokenNames(), getNumTokens(), LT(1), t, false, getFilename());
		}
		else
		{
			// mark token as consumed -- fetch next token deferred until LA/LT
			consume();
		}
	}

	virtual void matchNot(int t)
	{
		if ( LA(1)==t )
		{
			// Throws inverted-sense exception
			throw MismatchedTokenException(getTokenNames(), getNumTokens(), LT(1), t, true, getFilename());
		}
		else
		{
			// mark token as consumed -- fetch next token deferred until LA/LT
			consume();
		}
	}

	/** Make sure current lookahead symbol matches the given set
	 * Throw an exception upon mismatch, which is catch by either the
	 * error handler or by the syntactic predicate.
	 */
	virtual void match(const BitSet& b)
	{
		if ( DEBUG_PARSER )
		{
			traceIndent();
			ANTLR_USE_NAMESPACE(std)cout << "enter match(" << "bitset" /*b.toString()*/
				<< ") with LA(1)=" << LA(1) << ANTLR_USE_NAMESPACE(std)endl;
		}
		if ( !b.member(LA(1)) )
		{
			if ( DEBUG_PARSER )
			{
				traceIndent();
				ANTLR_USE_NAMESPACE(std)cout << "token mismatch: " << LA(1) << " not member of "
					<< "bitset" /*b.toString()*/ << ANTLR_USE_NAMESPACE(std)endl;
			}
			throw MismatchedTokenException(getTokenNames(), getNumTokens(), LT(1), b, false, getFilename());
		}
		else
		{
			// mark token as consumed -- fetch next token deferred until LA/LT
			consume();
		}
	}

	/** Mark a spot in the input and return the position.
	 * Forwarded to TokenBuffer.
	 */
	virtual inline unsigned int mark()
	{
		return inputState->getInput().mark();
	}
	/// rewind to a previously marked position
	virtual inline void rewind(unsigned int pos)
	{
		inputState->getInput().rewind(pos);
	}
	/** called by the generated parser to do error recovery, override to
	 * customize the behaviour.
	 */
	virtual void recover(const RecognitionException& ex, const BitSet& tokenSet)
	{
		consume();
		consumeUntil(tokenSet);
	}

	/// Parser error-reporting function can be overridden in subclass
	virtual void reportError(const RecognitionException& ex);
	/// Parser error-reporting function can be overridden in subclass
	virtual void reportError(const ANTLR_USE_NAMESPACE(std)string& s);
	/// Parser warning-reporting function can be overridden in subclass
	virtual void reportWarning(const ANTLR_USE_NAMESPACE(std)string& s);

	/// get the token name for the token number 'num'
	virtual const char* getTokenName(int num) const = 0;
	/// get a vector with all token names
	virtual const char* const* getTokenNames() const = 0;
	/** Get the number of tokens defined.
	 * This one should be overridden in subclasses.
	 */
	virtual int getNumTokens(void) const = 0;

	/** Set or change the input token buffer */
//	void setTokenBuffer(TokenBuffer* t);

	virtual void traceIndent();
	virtual void traceIn(const char* rname);
	virtual void traceOut(const char* rname);
protected:
//	void setTokenNames(const char** tokenNames_);

	ParserSharedInputState inputState;

//	/// AST return value for a rule is squirreled away here
//	RefAST returnAST;

	/// AST support code; parser and treeparser delegate to this object
	ASTFactory *astFactory;

	// used to keep track of the indentation for the trace
	int traceDepth;

	/** Utility class which allows tracing to work even when exceptions are
	 * thrown.
	 */
	class Tracer { /*{{{*/
	private:
		Parser* parser;
		const char* text;
	public:
		Tracer(Parser* p,const char * t)
		: parser(p), text(t)
		{
			parser->traceIn(text);
		}
		~Tracer()
		{
#ifdef ANTLR_CXX_SUPPORTS_UNCAUGHT_EXCEPTION
			// Only give trace if there's no uncaught exception..
			if(!ANTLR_USE_NAMESPACE(std)uncaught_exception())
#endif
				parser->traceOut(text);
		}
	private:
		Tracer(const Tracer&);							// undefined
		const Tracer& operator=(const Tracer&);	// undefined
		/*}}}*/
	};
private:
	Parser(const Parser&);								// undefined
	const Parser& operator=(const Parser&);		// undefined
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_Parser_hpp__
antlr-2.7.7/lib/cpp/antlr/CharStreamException.hpp0000644000175000017500000000132510522211615021672 0ustar  twernertwerner#ifndef INC_CharStreamException_hpp__
#define INC_CharStreamException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/CharStreamException.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API CharStreamException : public ANTLRException {
public:
	CharStreamException(const ANTLR_USE_NAMESPACE(std)string& s)
		: ANTLRException(s) {}
	~CharStreamException() throw() {}
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_CharStreamException_hpp__
antlr-2.7.7/lib/cpp/antlr/SemanticException.hpp0000644000175000017500000000165210522211615021407 0ustar  twernertwerner#ifndef INC_SemanticException_hpp__
#define INC_SemanticException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/SemanticException.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API SemanticException : public RecognitionException {
public:
	SemanticException(const ANTLR_USE_NAMESPACE(std)string& s)
	: RecognitionException(s)
	{
	}
	SemanticException(const ANTLR_USE_NAMESPACE(std)string& s,
							const ANTLR_USE_NAMESPACE(std)string& fileName_,
							int line_,int column_)
	: RecognitionException(s,fileName_,line_,column_)
	{
	}

	~SemanticException() throw()
	{
	}
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_SemanticException_hpp__
antlr-2.7.7/lib/cpp/antlr/CharInputBuffer.hpp0000644000175000017500000000334410522211615021014 0ustar  twernertwerner#ifndef INC_CharInputBuffer_hpp__
# define INC_CharInputBuffer_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id:$
 */

# include 
# include 

# ifdef HAS_NOT_CCTYPE_H
#	include 
# else
#	include 
# endif

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** CharInputBuffer.hpp provides an InputBuffer for plain character arrays (buffers).
 */
class CharInputBuffer : public InputBuffer
{
public:
	/** Construct a CharInputBuffer.hpp object with a char* buffer of 'size'
	 * if 'owner' is true, then the buffer will be delete[]-ed on destruction.
	 * @note it is assumed the buffer was allocated with new[]!
	 */
	CharInputBuffer( unsigned char* buf, size_t size, bool owner = false )
	: buffer(buf)
	, ptr(buf)
	, end(buf + size)
	, delete_buffer(owner)
	{
	}

	/** Destructor
	 * @note If you're using malloced data, then you probably need to change
	 * this destructor. Or better use this class as template for your own.
	 */
	~CharInputBuffer( void )
	{
		if( delete_buffer && buffer )
			delete [] buffer;
	}

	/** Reset the CharInputBuffer to initial state
	 * Called from LexerInputState::reset.
	 * @see LexerInputState
	 */
	virtual inline void reset( void )
	{
		InputBuffer::reset();
		ptr = buffer;
	}

	virtual int getChar( void )
	{
		return (ptr < end) ? *ptr++ : EOF;
	}

protected:
	unsigned char* buffer;	///< the buffer with data
	unsigned char* ptr;		///< position ptr into the buffer
	unsigned char* end;		///< end sentry for buffer
	bool delete_buffer;		///< flag signifying if we have to delete the buffer
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif
antlr-2.7.7/lib/cpp/antlr/String.hpp0000644000175000017500000000134710522211615017234 0ustar  twernertwerner#ifndef INC_String_hpp__
#define INC_String_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/String.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

ANTLR_API ANTLR_USE_NAMESPACE(std)string operator+( const ANTLR_USE_NAMESPACE(std)string& lhs, const int rhs );
ANTLR_API ANTLR_USE_NAMESPACE(std)string operator+( const ANTLR_USE_NAMESPACE(std)string& lhs, size_t rhs );

ANTLR_API ANTLR_USE_NAMESPACE(std)string charName( int ch );

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_String_hpp__
antlr-2.7.7/lib/cpp/antlr/InputBuffer.hpp0000644000175000017500000000666510522211615020227 0ustar  twernertwerner#ifndef INC_InputBuffer_hpp__
#define INC_InputBuffer_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/InputBuffer.hpp#2 $
 */

#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** A Stream of characters fed to the lexer from a InputStream that can
 * be rewound via mark()/rewind() methods.
 * 

 * A dynamic array is used to buffer up all the input characters.  Normally,
 * "k" characters are stored in the buffer.  More characters may be stored during
 * guess mode (testing syntactic predicate), or when LT(i>k) is referenced.
 * Consumption of characters is deferred.  In other words, reading the next
 * character is not done by conume(), but deferred until needed by LA or LT.
 * 

 *
 * @see antlr.CharQueue
 */
class ANTLR_API InputBuffer {
public:
	/** Create a character buffer */
	InputBuffer()
	: nMarkers(0)
	, markerOffset(0)
	, numToConsume(0)
	{
	}

	virtual ~InputBuffer()
	{
	}

	/// Reset the input buffer to empty state
	virtual inline void reset( void )
	{
		nMarkers = 0;
		markerOffset = 0;
		numToConsume = 0;
		queue.clear();
	}

	/** This method updates the state of the input buffer so that
	 * the text matched since the most recent mark() is no longer
	 * held by the buffer.  So, you either do a mark/rewind for
	 * failed predicate or mark/commit to keep on parsing without
	 * rewinding the input.
	 */
	inline void commit( void )
	{
		nMarkers--;
	}

	/** Mark another character for deferred consumption */
	virtual inline void consume()
	{
		numToConsume++;
	}

	/** Ensure that the character buffer is sufficiently full */
	virtual void fill(unsigned int amount);

	/** Override this in subclasses to get the next character */
	virtual int getChar()=0;

	/** Get a lookahead character */
	virtual inline int LA(unsigned int i)
	{
		fill(i);
		return queue.elementAt(markerOffset + i - 1);
	}

	/** Return an integer marker that can be used to rewind the buffer to
	 * its current state.
	 */
	virtual unsigned int mark();
	/// Are there any marks active in the InputBuffer
	virtual inline bool isMarked() const
	{
		return (nMarkers != 0);
	}
	/** Rewind the character buffer to a marker.
	 * @param mark Marker returned previously from mark()
	 */
	virtual void rewind(unsigned int mark);

	/** Get the number of non-consumed characters
	 */
	virtual unsigned int entries() const;

	ANTLR_USE_NAMESPACE(std)string getLAChars() const;

	ANTLR_USE_NAMESPACE(std)string getMarkedChars() const;

protected:
	// char source
	// leave to subclasses

	// Number of active markers
	unsigned int nMarkers; // = 0;

	// Additional offset used when markers are active
	unsigned int markerOffset; // = 0;

	// Number of calls to consume() since last LA() or LT() call
	unsigned int numToConsume; // = 0;

	// Circular queue
	CircularQueue queue;

	/** Sync up deferred consumption */
	void syncConsume();

private:
	InputBuffer(const InputBuffer& other);
	InputBuffer& operator=(const InputBuffer& other);
};

/** Sync up deferred consumption */
inline void InputBuffer::syncConsume() {
	if (numToConsume > 0)
	{
		if (nMarkers > 0)
			markerOffset += numToConsume;
		else
			queue.removeItems( numToConsume );
		numToConsume = 0;
	}
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_InputBuffer_hpp__
antlr-2.7.7/lib/cpp/antlr/MismatchedTokenException.hpp0000644000175000017500000000613010522211615022717 0ustar  twernertwerner#ifndef INC_MismatchedTokenException_hpp__
#define INC_MismatchedTokenException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/MismatchedTokenException.hpp#2 $
 */

#include 
#include 
#include 
#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API MismatchedTokenException : public RecognitionException {
public:
	MismatchedTokenException();

	/// Expected range / not range
	MismatchedTokenException(
		const char* const* tokenNames_,
		const int numTokens_,
		RefAST node_,
		int lower,
		int upper_,
		bool matchNot
	);

	// Expected token / not token
	MismatchedTokenException(
		const char* const* tokenNames_,
		const int numTokens_,
		RefAST node_,
		int expecting_,
		bool matchNot
	);

	// Expected BitSet / not BitSet
	MismatchedTokenException(
		const char* const* tokenNames_,
		const int numTokens_,
		RefAST node_,
		BitSet set_,
		bool matchNot
	);

	// Expected range / not range
	MismatchedTokenException(
		const char* const* tokenNames_,
		const int numTokens_,
		RefToken token_,
		int lower,
		int upper_,
		bool matchNot,
		const ANTLR_USE_NAMESPACE(std)string& fileName_
	);

	// Expected token / not token
	MismatchedTokenException(
		const char* const* tokenNames_,
		const int numTokens_,
		RefToken token_,
		int expecting_,
		bool matchNot,
		const ANTLR_USE_NAMESPACE(std)string& fileName_
	);

	// Expected BitSet / not BitSet
	MismatchedTokenException(
		const char* const* tokenNames_,
		const int numTokens_,
		RefToken token_,
		BitSet set_,
		bool matchNot,
		const ANTLR_USE_NAMESPACE(std)string& fileName_
	);
	~MismatchedTokenException() throw() {}

	/**
	 * Returns a clean error message (no line number/column information)
	 */
	ANTLR_USE_NAMESPACE(std)string getMessage() const;

public:
	/// The token that was encountered
	const RefToken token;
	/// The offending AST node if tree walking
	const RefAST node;
	/// taken from node or token object
	ANTLR_USE_NAMESPACE(std)string tokenText;

	/// Types of tokens
#ifndef NO_STATIC_CONSTS
	static const int TOKEN = 1;
	static const int NOT_TOKEN = 2;
	static const int RANGE = 3;
	static const int NOT_RANGE = 4;
	static const int SET = 5;
	static const int NOT_SET = 6;
#else
	enum {
		TOKEN = 1,
		NOT_TOKEN = 2,
		RANGE = 3,
		NOT_RANGE = 4,
		SET = 5,
		NOT_SET = 6
	};
#endif

public:
	/// One of the above
	int mismatchType;

	/// For TOKEN/NOT_TOKEN and RANGE/NOT_RANGE
	int expecting;

	/// For RANGE/NOT_RANGE (expecting is lower bound of range)
	int upper;

	/// For SET/NOT_SET
	BitSet set;

private:
	/// Token names array for formatting
	const char* const* tokenNames;
	/// Max number of tokens in tokenNames
	const int numTokens;
	/// Return token name for tokenType
	ANTLR_USE_NAMESPACE(std)string tokenName(int tokenType) const;
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_MismatchedTokenException_hpp__
antlr-2.7.7/lib/cpp/antlr/TokenStreamIOException.hpp0000644000175000017500000000156510522211615022333 0ustar  twernertwerner#ifndef INC_TokenStreamIOException_hpp__
#define INC_TokenStreamIOException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/TokenStreamIOException.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class TokenStreamIOException : public TokenStreamException {
public:
	TokenStreamIOException()
	: TokenStreamException()	
	{
	}
	TokenStreamIOException(const ANTLR_USE_NAMESPACE(std)exception& e)
	: TokenStreamException(e.what())
	, io(e)
	{
	}
	~TokenStreamIOException() throw()
	{
	}
private:
	ANTLR_USE_NAMESPACE(std)exception io;
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_TokenStreamIOException_hpp__
antlr-2.7.7/lib/cpp/antlr/TokenStreamRecognitionException.hpp0000644000175000017500000000252410522211615024300 0ustar  twernertwerner#ifndef INC_TokenStreamRecognitionException_hpp__
#define INC_TokenStreamRecognitionException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/TokenStreamRecognitionException.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** Exception thrown from generated lexers when there's no default error
 * handler specified.
 * @see TokenStream
 */
class TokenStreamRecognitionException : public TokenStreamException {
public:
	TokenStreamRecognitionException(RecognitionException& re)
	: TokenStreamException(re.getMessage())
	, recog(re)
	{
	}
	virtual ~TokenStreamRecognitionException() throw()
	{
	}
	virtual ANTLR_USE_NAMESPACE(std)string toString() const
	{
		return recog.getFileLineColumnString()+getMessage();
	}

	virtual ANTLR_USE_NAMESPACE(std)string getFilename() const throw()
	{
		return recog.getFilename();
	}
	virtual int getLine() const throw()
	{
		return recog.getLine();
	}
	virtual int getColumn() const throw()
	{
		return recog.getColumn();
	}
private:
	RecognitionException recog;
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_TokenStreamRecognitionException_hpp__
antlr-2.7.7/lib/cpp/antlr/ASTFactory.hpp0000644000175000017500000001317410522211615017746 0ustar  twernertwerner#ifndef INC_ASTFactory_hpp__
#define INC_ASTFactory_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/ASTFactory.hpp#2 $
 */

#include 
#include 
#include 
#include 

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

// Using these extra types to appease MSVC
typedef RefAST (*factory_type_)();
typedef ANTLR_USE_NAMESPACE(std)pair< const char*, factory_type_ >  factory_descriptor_;
typedef ANTLR_USE_NAMESPACE(std)vector< factory_descriptor_* >      factory_descriptor_list_;

/** AST Super Factory shared by TreeParser and Parser.
 * This super factory maintains a map of all AST node types to their respective
 * AST factories. One instance should be shared among a parser/treeparser
 * chain.
 *
 * @todo check all this code for possible use of references in
 * stead of RefAST's.
 */
class ANTLR_API ASTFactory {
public:
	typedef factory_type_             factory_type;
	typedef factory_descriptor_       factory_descriptor;
	typedef factory_descriptor_list_  factory_descriptor_list;
protected:
	/* The mapping of AST node type to factory..
	 */
	factory_descriptor default_factory_descriptor;
	factory_descriptor_list nodeFactories;
public:
	/// Make new factory. Per default (Ref)CommonAST instances are generated.
	ASTFactory();
	/** Initialize factory with a non default node type.
	 * factory_node_name should be the name of the AST node type the factory
	 * generates. (should exist during the existance of this ASTFactory
	 * instance)
	 */
	ASTFactory( const char* factory_node_name, factory_type factory );
	/// Destroy factory
	virtual ~ASTFactory();

	/// Register a node factory for the node type type with name ast_name
	void registerFactory( int type, const char* ast_name, factory_type factory );
	/// Set the maximum node (AST) type this factory may encounter
	void setMaxNodeType( int type );

	/// Add a child to the current AST
	void addASTChild(ASTPair& currentAST, RefAST child);
	/// Create new empty AST node. The right default type shou
	virtual RefAST create();
	/// Create AST node of the right type for 'type'
	RefAST create(int type);
	/// Create AST node of the right type for 'type' and initialize with txt
	RefAST create(int type, const ANTLR_USE_NAMESPACE(std)string& txt);
	/// Create duplicate of tr
	RefAST create(RefAST tr);
	/// Create new AST node and initialize contents from a token.
	RefAST create(RefToken tok);
	/// Create new AST node and initialize contents from a stream.
	RefAST create(const ANTLR_USE_NAMESPACE(std)string& txt, ANTLR_USE_NAMESPACE(std)istream& infile );
	/** Deep copy a single node. This function the new clone() methods in the
	 * AST interface. Returns a new RefAST(nullASTptr) if t is null.
	 */
	RefAST dup(RefAST t);
	/// Duplicate tree including siblings of root.
	RefAST dupList(RefAST t);
	/** Duplicate a tree, assuming this is a root node of a tree--
	 * duplicate that node and what's below; ignore siblings of root node.
	 */
	RefAST dupTree(RefAST t);
	/** Make a tree from a list of nodes. The first element in the
	 * array is the root. If the root is null, then the tree is
	 * a simple list not a tree. Handles null children nodes correctly.
	 * For example, make(a, b, null, c) yields tree (a b c).  make(null,a,b)
	 * yields tree (nil a b).
	 */
	RefAST make(ANTLR_USE_NAMESPACE(std)vector& nodes);
	/** Make a tree from a list of nodes, where the nodes are contained
	 * in an ASTArray object. The ASTArray is deleted after use.
	 * @todo FIXME! I have a feeling we can get rid of this ugly ASTArray thing
	 */
	RefAST make(ASTArray* nodes);
	/// Make an AST the root of current AST
	void makeASTRoot(ASTPair& currentAST, RefAST root);

	/** Set a new default AST type.
	 * factory_node_name should be the name of the AST node type the factory
	 * generates. (should exist during the existance of this ASTFactory
	 * instance).
	 * Only change factory between parser runs. You might get unexpected results
	 * otherwise.
	 */
	void setASTNodeFactory( const char* factory_node_name, factory_type factory );

#ifdef ANTLR_SUPPORT_XML
	/** Load a XML AST from stream. Make sure you have all the factories
	 * registered before use.
	 * @note this 'XML' stuff is quite rough still. YMMV.
	 */
	RefAST LoadAST( ANTLR_USE_NAMESPACE(std)istream& infile );
#endif
protected:
	void loadChildren( ANTLR_USE_NAMESPACE(std)istream& infile, RefAST current );
	void loadSiblings( ANTLR_USE_NAMESPACE(std)istream& infile, RefAST current );
	bool checkCloseTag( ANTLR_USE_NAMESPACE(std)istream& infile );

#ifdef ANTLR_VECTOR_HAS_AT
	/// construct a node of 'type'
	inline RefAST getNodeOfType( unsigned int type )
	{
		return RefAST(nodeFactories.at(type)->second());
	}
	/// get the name of the node 'type'
	const char* getASTNodeType( unsigned int type )
	{
		return nodeFactories.at(type)->first;
	}
	/// get the factory used for node 'type'
	factory_type getASTNodeFactory( unsigned int type )
	{
		return nodeFactories.at(type)->second;
	}
#else
	inline RefAST getNodeOfType( unsigned int type )
	{
		return RefAST(nodeFactories[type]->second());
	}
	/// get the name of the node 'type'
	const char* getASTNodeType( unsigned int type )
	{
		return nodeFactories[type]->first;
	}
	factory_type getASTNodeFactory( unsigned int type )
	{
		return nodeFactories[type]->second;
	}
#endif

private:
	// no copying and such..
	ASTFactory( const ASTFactory& );
	ASTFactory& operator=( const ASTFactory& );
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_ASTFactory_hpp__
antlr-2.7.7/lib/cpp/antlr/TokenStreamHiddenTokenFilter.hpp0000644000175000017500000000437610522211615023512 0ustar  twernertwerner#ifndef INC_TokenStreamHiddenTokenFilter_hpp__
#define INC_TokenStreamHiddenTokenFilter_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/TokenStreamHiddenTokenFilter.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/**This object filters a token stream coming from a lexer
 * or another TokenStream so that only certain token channels
 * get transmitted to the parser.
 *
 * Any of the channels can be filtered off as "hidden" channels whose
 * tokens can be accessed from the parser.
 */
class ANTLR_API TokenStreamHiddenTokenFilter : public TokenStreamBasicFilter {
	// protected BitSet discardMask;
protected:
	BitSet hideMask;

private:
	RefToken nextMonitoredToken;

protected:
	/** track tail of hidden list emanating from previous
	 *  monitored token
	 */
	RefToken lastHiddenToken;

	RefToken firstHidden; // = null;

public:
	TokenStreamHiddenTokenFilter(TokenStream& input);

protected:
	void consume();

private:
	void consumeFirst();

public:
	BitSet getDiscardMask() const;

	/** Return a ptr to the hidden token appearing immediately after
	 *  token t in the input stream.
	 */
	RefToken getHiddenAfter(RefToken t);

	/** Return a ptr to the hidden token appearing immediately before
	 *  token t in the input stream.
	 */
	RefToken getHiddenBefore(RefToken t);

	BitSet getHideMask() const;

	/** Return the first hidden token if one appears
	 *  before any monitored token.
	 */
	RefToken getInitialHiddenToken();

	void hide(int m);

	void hide(const BitSet& mask);

protected:
	RefToken LA(int i);

public:
/** Return the next monitored token.
 *  Test the token following the monitored token.
 *  If following is another monitored token, save it
 *  for the next invocation of nextToken (like a single
 *  lookahead token) and return it then.
 *  If following is unmonitored, nondiscarded (hidden)
 *  channel token, add it to the monitored token.
 *
 *  Note: EOF must be a monitored Token.
 */
	RefToken nextToken();
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_TokenStreamHiddenTokenFilter_hpp__
antlr-2.7.7/lib/cpp/antlr/TokenRefCount.hpp0000644000175000017500000000330310522211615020506 0ustar  twernertwerner#ifndef INC_TokenRefCount_hpp__
# define INC_TokenRefCount_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id:$
 */

# include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class Token;

struct ANTLR_API TokenRef
{
	Token* const ptr;
	unsigned int count;

	TokenRef(Token* p);
	~TokenRef();
	TokenRef* increment()
	{
		++count;
		return this;
	}
	bool decrement()
	{
		return (--count==0);
	}

	static TokenRef* getRef(const Token* p);
private:
	TokenRef( const TokenRef& );
	TokenRef& operator=( const TokenRef& );
};

template
	class ANTLR_API TokenRefCount
{
private:
	TokenRef* ref;

public:
	TokenRefCount(const Token* p=0)
	: ref(p ? TokenRef::getRef(p) : 0)
	{
	}
	TokenRefCount(const TokenRefCount& other)
	: ref(other.ref ? other.ref->increment() : 0)
	{
	}
	~TokenRefCount()
	{
		if (ref && ref->decrement())
			delete ref;
	}
	TokenRefCount& operator=(Token* other)
	{
		TokenRef* tmp = TokenRef::getRef(other);

		if (ref && ref->decrement())
			delete ref;

		ref=tmp;

		return *this;
	}
	TokenRefCount& operator=(const TokenRefCount& other)
	{
		if( other.ref != ref )
		{
			TokenRef* tmp = other.ref ? other.ref->increment() : 0;

			if (ref && ref->decrement())
				delete ref;

			ref=tmp;
		}
		return *this;
	}

	operator T* ()  const { return ref ? static_cast(ref->ptr) : 0; }
	T* operator->() const { return ref ? static_cast(ref->ptr) : 0; }
	T* get()        const { return ref ? static_cast(ref->ptr) : 0; }
};

typedef TokenRefCount RefToken;

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_TokenRefCount_hpp__
antlr-2.7.7/lib/cpp/antlr/CommonHiddenStreamToken.hpp0000644000175000017500000000175610522211615022513 0ustar  twernertwerner#ifndef INC_CommonHiddenStreamToken_hpp__
#define INC_CommonHiddenStreamToken_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/CommonHiddenStreamToken.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API CommonHiddenStreamToken : public CommonToken {
protected:
	RefToken hiddenBefore;
	RefToken hiddenAfter;

public:
	CommonHiddenStreamToken();
	CommonHiddenStreamToken(int t, const ANTLR_USE_NAMESPACE(std)string& txt);
	CommonHiddenStreamToken(const ANTLR_USE_NAMESPACE(std)string& s);

	RefToken getHiddenAfter();
	RefToken getHiddenBefore();

   static RefToken factory();

	void setHiddenAfter(RefToken t);
	void setHiddenBefore(RefToken t);
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_CommonHiddenStreamToken_hpp__
antlr-2.7.7/lib/cpp/antlr/ANTLRException.hpp0000644000175000017500000000264610522211615020530 0ustar  twernertwerner#ifndef INC_ANTLRException_hpp__
#define INC_ANTLRException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/ANTLRException.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API ANTLRException
{
public:
	/// Create ANTLR base exception without error message
	ANTLRException() : text("")
	{
	}
	/// Create ANTLR base exception with error message
	ANTLRException(const ANTLR_USE_NAMESPACE(std)string& s)
	: text(s)
	{
	}
	virtual ~ANTLRException() throw()
	{
	}

	/** Return complete error message with line/column number info (if present)
	 * @note for your own exceptions override this one. Call getMessage from
	 * here to get the 'clean' error message stored in the text attribute.
	 */
	virtual ANTLR_USE_NAMESPACE(std)string toString() const
	{
		return text;
	}

	/** Return error message without additional info (if present)
	 * @note when making your own exceptions classes override toString
	 * and call in toString getMessage which relays the text attribute
	 * from here.
	 */
	virtual ANTLR_USE_NAMESPACE(std)string getMessage() const
	{
		return text;
	}
private:
	ANTLR_USE_NAMESPACE(std)string text;
};
#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_ANTLRException_hpp__
antlr-2.7.7/lib/cpp/antlr/NoViableAltException.hpp0000644000175000017500000000201510522211615021776 0ustar  twernertwerner#ifndef INC_NoViableAltException_hpp__
#define INC_NoViableAltException_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/NoViableAltException.hpp#2 $
 */

#include 
#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

class ANTLR_API NoViableAltException : public RecognitionException {
public:
	const RefToken token;
	const RefAST node; // handles parsing and treeparsing

	NoViableAltException(RefAST t);
	NoViableAltException(RefToken t,const ANTLR_USE_NAMESPACE(std)string& fileName_);

	~NoViableAltException() throw() {}

	/**
	 * Returns a clean error message (no line number/column information)
	 */
	ANTLR_USE_NAMESPACE(std)string getMessage() const;
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_NoViableAltException_hpp__
antlr-2.7.7/lib/cpp/antlr/TokenStreamRewriteEngine.hpp0000644000175000017500000003045410522211615022713 0ustar  twernertwerner#ifndef INC_TokenStreamRewriteEngine_hpp__
#define INC_TokenStreamRewriteEngine_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 */

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

#include 

#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** This token stream tracks the *entire* token stream coming from
 *	 a lexer, but does not pass on the whitespace (or whatever else
 *	 you want to discard) to the parser.
 *
 *	 This class can then be asked for the ith token in the input stream.
 *	 Useful for dumping out the input stream exactly after doing some
 *	 augmentation or other manipulations.	Tokens are index from 0..n-1
 *
 *	 You can insert stuff, replace, and delete chunks.	 Note that the
 *	 operations are done lazily--only if you convert the buffer to a
 *	 String.	 This is very efficient because you are not moving data around
 *	 all the time.	 As the buffer of tokens is converted to strings, the
 *	 toString() method(s) check to see if there is an operation at the
 *	 current index.  If so, the operation is done and then normal String
 *	 rendering continues on the buffer.	 This is like having multiple Turing
 *	 machine instruction streams (programs) operating on a single input tape. :)
 *
 *	 Since the operations are done lazily at toString-time, operations do not
 *	 screw up the token index values.  That is, an insert operation at token
 *	 index i does not change the index values for tokens i+1..n-1.
 *
 *	 Because operations never actually alter the buffer, you may always get
 *	 the original token stream back without undoing anything.  Since
 *	 the instructions are queued up, you can easily simulate transactions and
 *	 roll back any changes if there is an error just by removing instructions.
 *	 For example,
 *
 *			TokenStreamRewriteEngine rewriteEngine =
 *				new TokenStreamRewriteEngine(lexer);
 *		  JavaRecognizer parser = new JavaRecognizer(rewriteEngine);
 *		  ...
 *		  rewriteEngine.insertAfter("pass1", t, "foobar");}
 *			rewriteEngine.insertAfter("pass2", u, "start");}
 *			System.out.println(rewriteEngine.toString("pass1"));
 *			System.out.println(rewriteEngine.toString("pass2"));
 *
 *	 You can also have multiple "instruction streams" and get multiple
 *	 rewrites from a single pass over the input.	 Just name the instruction
 *	 streams and use that name again when printing the buffer.	This could be
 *	 useful for generating a C file and also its header file--all from the
 *	 same buffer.
 *
 *	 If you don't use named rewrite streams, a "default" stream is used.
 *
 *	 Terence Parr, parrt@cs.usfca.edu
 *	 University of San Francisco
 *	 February 2004
 */
class TokenStreamRewriteEngine : public TokenStream
{
public:
	typedef ANTLR_USE_NAMESPACE(std)vector token_list;
	static const char* DEFAULT_PROGRAM_NAME;
#ifndef NO_STATIC_CONSTS
	static const size_t MIN_TOKEN_INDEX;
	static const int PROGRAM_INIT_SIZE;
#else
	enum {
		MIN_TOKEN_INDEX = 0,
		PROGRAM_INIT_SIZE = 100
	};
#endif

	struct tokenToStream {
		tokenToStream( ANTLR_USE_NAMESPACE(std)ostream& o ) : out(o) {}
		template  void operator() ( const T& t ) {
			out << t->getText();
		}
		ANTLR_USE_NAMESPACE(std)ostream& out;
	};

	class RewriteOperation {
	protected:
		RewriteOperation( size_t idx, const ANTLR_USE_NAMESPACE(std)string& txt )
		: index(idx), text(txt)
		{
		}
	public:
		virtual ~RewriteOperation()
		{
		}
		/** Execute the rewrite operation by possibly adding to the buffer.
		 *	 Return the index of the next token to operate on.
		 */
		virtual size_t execute( ANTLR_USE_NAMESPACE(std)ostream& /* out */ ) {
			return index;
		}
		virtual size_t getIndex() const {
			return index;
		}
		virtual const char* type() const {
			return "RewriteOperation";
		}
	protected:
		size_t index;
		ANTLR_USE_NAMESPACE(std)string text;
	};

	struct executeOperation {
		ANTLR_USE_NAMESPACE(std)ostream& out;
		executeOperation( ANTLR_USE_NAMESPACE(std)ostream& s ) : out(s) {}
		void operator () ( RewriteOperation* t ) {
			t->execute(out);
		}
	};

	/// list of rewrite operations
	typedef ANTLR_USE_NAMESPACE(std)list operation_list;
	/// map program name to  tuple
	typedef ANTLR_USE_NAMESPACE(std)map program_map;

	class InsertBeforeOp : public RewriteOperation
	{
	public:
		InsertBeforeOp( size_t index, const ANTLR_USE_NAMESPACE(std)string& text )
		: RewriteOperation(index, text)
		{
		}
		virtual ~InsertBeforeOp() {}
		virtual size_t execute( ANTLR_USE_NAMESPACE(std)ostream& out )
		{
			out << text;
			return index;
		}
		virtual const char* type() const {
			return "InsertBeforeOp";
		}
	};

	class ReplaceOp : public RewriteOperation
	{
	public:
		ReplaceOp(size_t from, size_t to, ANTLR_USE_NAMESPACE(std)string text)
		: RewriteOperation(from,text)
		, lastIndex(to)
		{
		}
		virtual ~ReplaceOp() {}
		virtual size_t execute( ANTLR_USE_NAMESPACE(std)ostream& out ) {
			out << text;
			return lastIndex+1;
		}
		virtual const char* type() const {
			return "ReplaceOp";
		}
	protected:
		size_t lastIndex;
	};

	class DeleteOp : public ReplaceOp {
	public:
		DeleteOp(size_t from, size_t to)
		: ReplaceOp(from,to,"")
		{
		}
		virtual const char* type() const {
			return "DeleteOp";
		}
	};

	TokenStreamRewriteEngine(TokenStream& upstream);

	TokenStreamRewriteEngine(TokenStream& upstream, size_t initialSize);

	RefToken nextToken( void );

	void rollback(size_t instructionIndex) {
		rollback(DEFAULT_PROGRAM_NAME, instructionIndex);
	}

	/** Rollback the instruction stream for a program so that
	 *	 the indicated instruction (via instructionIndex) is no
	 *	 longer in the stream.	UNTESTED!
	 */
	void rollback(const ANTLR_USE_NAMESPACE(std)string& programName,
					  size_t instructionIndex );

	void deleteProgram() {
		deleteProgram(DEFAULT_PROGRAM_NAME);
	}

	/** Reset the program so that no instructions exist */
	void deleteProgram(const ANTLR_USE_NAMESPACE(std)string& programName) {
		rollback(programName, MIN_TOKEN_INDEX);
	}

	void insertAfter( RefTokenWithIndex t,
							const ANTLR_USE_NAMESPACE(std)string& text )
	{
		insertAfter(DEFAULT_PROGRAM_NAME, t, text);
	}

	void insertAfter(size_t index, const ANTLR_USE_NAMESPACE(std)string& text) {
		insertAfter(DEFAULT_PROGRAM_NAME, index, text);
	}

	void insertAfter( const ANTLR_USE_NAMESPACE(std)string& programName,
							RefTokenWithIndex t,
							const ANTLR_USE_NAMESPACE(std)string& text )
	{
		insertAfter(programName, t->getIndex(), text);
	}

	void insertAfter( const ANTLR_USE_NAMESPACE(std)string& programName,
							size_t index,
							const ANTLR_USE_NAMESPACE(std)string& text )
	{
		// to insert after, just insert before next index (even if past end)
		insertBefore(programName,index+1, text);
	}

	void insertBefore( RefTokenWithIndex t,
							 const ANTLR_USE_NAMESPACE(std)string& text )
	{
		// std::cout << "insertBefore index " << t->getIndex() << " " << text << std::endl;
		insertBefore(DEFAULT_PROGRAM_NAME, t, text);
	}

	void insertBefore(size_t index, const ANTLR_USE_NAMESPACE(std)string& text) {
		insertBefore(DEFAULT_PROGRAM_NAME, index, text);
	}

	void insertBefore( const ANTLR_USE_NAMESPACE(std)string& programName,
							 RefTokenWithIndex t,
							 const ANTLR_USE_NAMESPACE(std)string& text )
	{
		insertBefore(programName, t->getIndex(), text);
	}

	void insertBefore( const ANTLR_USE_NAMESPACE(std)string& programName,
							 size_t index,
							 const ANTLR_USE_NAMESPACE(std)string& text )
	{
		addToSortedRewriteList(programName, new InsertBeforeOp(index,text));
	}

	void replace(size_t index, const ANTLR_USE_NAMESPACE(std)string& text)
	{
		replace(DEFAULT_PROGRAM_NAME, index, index, text);
	}

	void replace( size_t from, size_t to,
					  const ANTLR_USE_NAMESPACE(std)string& text)
	{
		replace(DEFAULT_PROGRAM_NAME, from, to, text);
	}

	void replace( RefTokenWithIndex indexT,
					  const ANTLR_USE_NAMESPACE(std)string& text )
	{
		replace(DEFAULT_PROGRAM_NAME, indexT->getIndex(), indexT->getIndex(), text);
	}

	void replace( RefTokenWithIndex from,
					  RefTokenWithIndex to,
					  const ANTLR_USE_NAMESPACE(std)string& text )
	{
		replace(DEFAULT_PROGRAM_NAME, from, to, text);
	}

	void replace(const ANTLR_USE_NAMESPACE(std)string& programName,
					 size_t from, size_t to,
					 const ANTLR_USE_NAMESPACE(std)string& text )
	{
		addToSortedRewriteList(programName,new ReplaceOp(from, to, text));
	}

	void replace( const ANTLR_USE_NAMESPACE(std)string& programName,
					  RefTokenWithIndex from,
					  RefTokenWithIndex to,
					  const ANTLR_USE_NAMESPACE(std)string& text )
	{
		replace(programName,
				  from->getIndex(),
				  to->getIndex(),
				  text);
	}

	void remove(size_t index) {
		remove(DEFAULT_PROGRAM_NAME, index, index);
	}

	void remove(size_t from, size_t to) {
		remove(DEFAULT_PROGRAM_NAME, from, to);
	}

	void remove(RefTokenWithIndex indexT) {
		remove(DEFAULT_PROGRAM_NAME, indexT, indexT);
	}

	void remove(RefTokenWithIndex from, RefTokenWithIndex to) {
		remove(DEFAULT_PROGRAM_NAME, from, to);
	}

	void remove( const ANTLR_USE_NAMESPACE(std)string& programName,
					 size_t from, size_t to)
	{
		replace(programName,from,to,"");
	}

	void remove( const ANTLR_USE_NAMESPACE(std)string& programName,
					 RefTokenWithIndex from, RefTokenWithIndex to )
	{
		replace(programName,from,to,"");
	}

	void discard(int ttype) {
		discardMask.add(ttype);
	}

	RefToken getToken( size_t i )
	{
		return RefToken(tokens.at(i));
	}

	size_t getTokenStreamSize() const {
		return tokens.size();
	}

	void originalToStream( ANTLR_USE_NAMESPACE(std)ostream& out ) const {
		ANTLR_USE_NAMESPACE(std)for_each( tokens.begin(), tokens.end(), tokenToStream(out) );
	}

	void originalToStream( ANTLR_USE_NAMESPACE(std)ostream& out,
								  size_t start, size_t end ) const;

	void toStream( ANTLR_USE_NAMESPACE(std)ostream& out ) const {
		toStream( out, MIN_TOKEN_INDEX, getTokenStreamSize());
	}

	void toStream( ANTLR_USE_NAMESPACE(std)ostream& out,
						const ANTLR_USE_NAMESPACE(std)string& programName ) const
	{
		toStream( out, programName, MIN_TOKEN_INDEX, getTokenStreamSize());
	}

	void toStream( ANTLR_USE_NAMESPACE(std)ostream& out,
						size_t start, size_t end ) const
	{
		toStream(out, DEFAULT_PROGRAM_NAME, start, end);
	}

	void toStream( ANTLR_USE_NAMESPACE(std)ostream& out,
						const ANTLR_USE_NAMESPACE(std)string& programName,
						size_t firstToken, size_t lastToken ) const;

	void toDebugStream( ANTLR_USE_NAMESPACE(std)ostream& out ) const {
		toDebugStream( out, MIN_TOKEN_INDEX, getTokenStreamSize());
	}

	void toDebugStream( ANTLR_USE_NAMESPACE(std)ostream& out,
							  size_t start, size_t end ) const;

	size_t getLastRewriteTokenIndex() const {
		return getLastRewriteTokenIndex(DEFAULT_PROGRAM_NAME);
	}

	/** Return the last index for the program named programName
	 * return 0 if the program does not exist or the program is empty.
	 * (Note this is different from the java implementation that returns -1)
	 */
	size_t getLastRewriteTokenIndex(const ANTLR_USE_NAMESPACE(std)string& programName) const {
		program_map::const_iterator rewrites = programs.find(programName);

		if( rewrites == programs.end() )
			return 0;

		const operation_list& prog = rewrites->second;
		if( !prog.empty() )
		{
			operation_list::const_iterator last = prog.end();
			--last;
			return (*last)->getIndex();
		}
		return 0;
	}

protected:
	/** If op.index > lastRewriteTokenIndexes, just add to the end.
	 *	 Otherwise, do linear */
	void addToSortedRewriteList(RewriteOperation* op) {
		addToSortedRewriteList(DEFAULT_PROGRAM_NAME, op);
	}

	void addToSortedRewriteList( const ANTLR_USE_NAMESPACE(std)string& programName,
										  RewriteOperation* op );

protected:
	/** Who do we suck tokens from? */
	TokenStream& stream;
	/** track index of tokens */
	size_t index;

	/** Track the incoming list of tokens */
	token_list tokens;

	/** You may have multiple, named streams of rewrite operations.
	 *  I'm calling these things "programs."
	 *  Maps String (name) -> rewrite (List)
	 */
	program_map programs;

	/** Which (whitespace) token(s) to throw out */
	BitSet discardMask;
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif
antlr-2.7.7/lib/cpp/antlr/Token.hpp0000644000175000017500000000431010522211615017037 0ustar  twernertwerner#ifndef INC_Token_hpp__
#define INC_Token_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/Token.hpp#2 $
 */

#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

struct TokenRef;

/** A token is minimally a token type.  Subclasses can add the text matched
 *  for the token and line info.
 */
class ANTLR_API Token
{
public:
	// constants
#ifndef NO_STATIC_CONSTS
	static const int MIN_USER_TYPE = 4;
	static const int NULL_TREE_LOOKAHEAD = 3;
	static const int INVALID_TYPE = 0;
	static const int EOF_TYPE = 1;
	static const int SKIP = -1;
#else
	enum {
		MIN_USER_TYPE = 4,
		NULL_TREE_LOOKAHEAD = 3,
		INVALID_TYPE = 0,
		EOF_TYPE = 1,
		SKIP = -1
	};
#endif

	Token()
	: ref(0)
	, type(INVALID_TYPE)
	{
	}
	Token(int t)
	: ref(0)
	, type(t)
	{
	}
	Token(int t, const ANTLR_USE_NAMESPACE(std)string& txt)
	: ref(0)
	, type(t)
	{
		setText(txt);
	}
	virtual ~Token()
	{
	}

	virtual int getColumn() const;
	virtual int getLine() const;
	virtual ANTLR_USE_NAMESPACE(std)string getText() const;
	virtual const ANTLR_USE_NAMESPACE(std)string& getFilename() const;
	virtual int getType() const;

	virtual void setColumn(int c);

	virtual void setLine(int l);
	virtual void setText(const ANTLR_USE_NAMESPACE(std)string& t);
	virtual void setType(int t);

	virtual void setFilename( const std::string& file );

	virtual ANTLR_USE_NAMESPACE(std)string toString() const;

private:
	friend struct TokenRef;
	TokenRef* ref;

	int type; 							///< the type of the token

	Token(RefToken other);
	Token& operator=(const Token& other);
	Token& operator=(RefToken other);

	Token(const Token&);
};

extern ANTLR_API RefToken nullToken;

#ifdef NEEDS_OPERATOR_LESS_THAN
// RK: Added after 2.7.2 previously it was undefined.
// AL: what to return if l and/or r point to nullToken???
inline bool operator<( RefToken l, RefToken r )
{
	return nullToken == l ? ( nullToken == r ? false : true ) : l->getType() < r->getType();
}
#endif

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_Token_hpp__
antlr-2.7.7/lib/cpp/antlr/LLkParser.hpp0000644000175000017500000000307610522211615017626 0ustar  twernertwerner#ifndef INC_LLkParser_hpp__
#define INC_LLkParser_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/LLkParser.hpp#2 $
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/**An LL(k) parser.
 *
 * @see antlr.Token
 * @see antlr.TokenBuffer
 * @see antlr.LL1Parser
 */
class ANTLR_API LLkParser : public Parser {
public:
	LLkParser(const ParserSharedInputState& lexer, int k_);

	LLkParser(TokenBuffer& tokenBuf, int k_);

	LLkParser(TokenStream& lexer, int k_);

	/** Consume another token from the input stream.  Can only write sequentially!
	 * If you need 3 tokens ahead, you must consume() 3 times.
	 * 

	 * Note that it is possible to overwrite tokens that have not been matched.
	 * For example, calling consume() 3 times when k=2, means that the first token
	 * consumed will be overwritten with the 3rd.
	 */
	virtual inline void consume()
	{
		inputState->getInput().consume();
	}

	virtual inline int LA(unsigned int i)
	{
		return inputState->getInput().LA(i);
	}

	virtual inline RefToken LT(unsigned int i)
	{
		return inputState->getInput().LT(i);
	}
protected:
	/// the lookahead this LL(k) parser is using.
	int k;
private:
	void trace(const char* ee, const char* rname);
public:
	virtual void traceIn(const char* rname);
	virtual void traceOut(const char* rname);
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_LLkParser_hpp__
antlr-2.7.7/lib/cpp/antlr/ANTLRUtil.hpp0000644000175000017500000000320710522211615017501 0ustar  twernertwerner#ifndef INC_ANTLRUtil_hpp__
#define INC_ANTLRUtil_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id:$
 */

#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** Eat whitespace from the input stream
 * @param is the stream to read from
 */
ANTLR_USE_NAMESPACE(std)istream& eatwhite( ANTLR_USE_NAMESPACE(std)istream& is );

/** Read a string enclosed by '"' from a stream. Also handles escaping of \".
 * Skips leading whitespace.
 * @param in the istream to read from.
 * @returns the string read from file exclusive the '"'
 * @throws ios_base::failure if string is badly formatted
 */
ANTLR_USE_NAMESPACE(std)string read_string( ANTLR_USE_NAMESPACE(std)istream& in );

/* Read a ([A-Z][0-9][a-z]_)* kindoff thing. Skips leading whitespace.
 * @param in the istream to read from.
 */
ANTLR_USE_NAMESPACE(std)string read_identifier( ANTLR_USE_NAMESPACE(std)istream& in );

/** Read a attribute="value" thing. Leading whitespace is skipped.
 * Between attribute and '=' no whitespace is allowed. After the '=' it is
 * permitted.
 * @param in the istream to read from.
 * @param attribute string the attribute name is put in
 * @param value string the value of the attribute is put in
 * @throws ios_base::failure if something is fishy. E.g. malformed quoting
 * or missing '='
 */
void read_AttributeNValue( ANTLR_USE_NAMESPACE(std)istream& in,
								   ANTLR_USE_NAMESPACE(std)string& attribute,
								   ANTLR_USE_NAMESPACE(std)string& value );

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif
antlr-2.7.7/lib/cpp/antlr/config.hpp0000644000175000017500000002065110522211615017232 0ustar  twernertwerner#ifndef INC_config_hpp__
#define INC_config_hpp__

/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/config.hpp#2 $
 */

/*
 * Just a simple configuration file to differentiate between the
 * various compilers used and reconfigure stuff for any oddities of the
 * compiler in question.
 *
 * These are the defaults. Per compiler these are amended.
 */
#define ANTLR_USE_NAMESPACE(_x_) _x_::
#define ANTLR_USING_NAMESPACE(_x_) using namespace _x_;
#define ANTLR_CXX_SUPPORTS_NAMESPACE 1
#define ANTLR_C_USING(_x_)
#define ANTLR_API
#ifndef CUSTOM_API
# define CUSTOM_API
#endif
#define ANTLR_IOS_BASE ios_base
/** define if cctype functions/macros need a std:: prefix. A lot of compilers
 * define these as macros, in which case something barfs.
 */
#define ANTLR_CCTYPE_NEEDS_STD

/// Define if C++ compiler supports std::uncaught_exception
#define ANTLR_CXX_SUPPORTS_UNCAUGHT_EXCEPTION

#define ANTLR_ATOI_IN_STD

/******************************************************************************/
/*{{{ Microsoft Visual C++ */
// NOTE: If you provide patches for a specific MSVC version guard them for
// the specific version!!!!
// _MSC_VER == 1100 for Microsoft Visual C++ 5.0
// _MSC_VER == 1200 for Microsoft Visual C++ 6.0
// _MSC_VER == 1300 for Microsoft Visual C++ 7.0
#if defined(_MSC_VER)

# if _MSC_VER < 1300
#	define NOMINMAX
#	pragma warning(disable : 4786)
#	define min _cpp_min
# endif

// This warning really gets on my nerves.
// It's the one about symbol longer than 256 chars, and it happens
// all the time with STL.
# pragma warning( disable : 4786 4231 )
// this shuts up some DLL interface warnings for STL
# pragma warning( disable : 4251 )

# ifdef ANTLR_CXX_USE_STLPORT
#	undef ANTLR_CXX_SUPPORTS_UNCAUGHT_EXCEPTION
# endif

# if ( _MSC_VER < 1300 ) && ( defined(ANTLR_EXPORTS) || defined(ANTLR_IMPORTS) )
#	error "DLL Build not supported on these MSVC versions."
// see comment in lib/cpp/src/dll.cpp
# endif

// For the DLL support originally contributed by Stephen Naughton
// If you are building statically leave ANTLR_EXPORTS/ANTLR_IMPORTS undefined
// If you are building the DLL define ANTLR_EXPORTS
// If you are compiling code to be used with the DLL define ANTLR_IMPORTS
# ifdef ANTLR_EXPORTS
#	undef ANTLR_API
#	define ANTLR_API __declspec(dllexport)
# endif

# ifdef ANTLR_IMPORTS
#	undef ANTLR_API
#	define ANTLR_API __declspec(dllimport)
# endif

# if ( _MSC_VER < 1200 )
// supposedly only for MSVC5 and before...
// Using vector requires operator<(X,X) to be defined
#	define NEEDS_OPERATOR_LESS_THAN
# endif

// VC6
# if ( _MSC_VER == 1200 )
#	undef ANTLR_ATOI_IN_STD
# endif

# if ( _MSC_VER < 1310 )
// Supposedly only for MSVC7 and before...
// Not allowed to put 'static const int XXX=20;' in a class definition
#	define NO_STATIC_CONSTS
#	define NO_TEMPLATE_PARTS
# endif

// No strcasecmp in the C library (so use stricmp instead)
// - Anyone know which is in which standard?
# define NO_STRCASECMP
# undef ANTLR_CCTYPE_NEEDS_STD
#	define NO_STATIC_CONSTS
#endif	// End of Microsoft Visual C++

/*}}}*/
/******************************************************************************/
/*{{{ SunPro Compiler (Using OBJECTSPACE STL)
 *****************************************************************************/
#ifdef __SUNPRO_CC

# if (__SUNPRO_CC >= 0x500)

#	define NEEDS_OPERATOR_LESS_THAN
#	define NO_TEMPLATE_PARTS

# else

#	undef namespace
#	define namespace

#	if (__SUNPRO_CC == 0x420)

/* This code is specif to SunWspro Compiler 4.2, and will compile with
 the objectspace 2.1 toolkit for Solaris2.6 */
#	 define HAS_NOT_CASSERT_H
#	 define HAS_NOT_CSTRING_H
#	 define HAS_NOT_CCTYPE_H
#	 define HAS_NOT_CSTDIO_H
#	 define HAS_OSTREAM_H

/* #define OS_SOLARIS_2_6
 #define OS_NO_WSTRING
 #define OS_NO_ALLOCATORS
 #define OS_MULTI_THREADED
 #define OS_SOLARIS_NATIVE
 #define OS_REALTIME
 #define __OSVERSION__=5
 #define SVR4
 */

// ObjectSpace + some specific templates constructions with stl.
/* #define OS_NO_ALLOCATOR */

// This great compiler does not have the namespace feature.
#	 undef  ANTLR_USE_NAMESPACE
#	 define ANTLR_USE_NAMESPACE(_x_)
#	 undef ANTLR_USING_NAMESPACE
#	 define ANTLR_USING_NAMESPACE(_x_)
#	 undef ANTLR_CXX_SUPPORTS_NAMESPACE
#	endif		// End __SUNPRO_CC == 0x420

#	undef explicit
#	define explicit

#	define exception os_exception
#	define bad_exception os_bad_exception

// Not allowed to put 'static const int XXX=20;' in a class definition
#	define NO_STATIC_CONSTS
// Using vector requires operator<(X,X) to be defined
#	define NEEDS_OPERATOR_LESS_THAN

# endif

# undef ANTLR_CCTYPE_NEEDS_STD

#endif	// end __SUNPRO_CC
/*}}}*/
/*****************************************************************************/
/*{{{ Inprise C++ Builder 3.0
 *****************************************************************************/
#ifdef __BCPLUSPLUS__
# define NO_TEMPLATE_PARTS
# define NO_STRCASECMP
# undef ANTLR_CCTYPE_NEEDS_STD
#endif	// End of C++ Builder 3.0
/*}}}*/
/*****************************************************************************/
/*{{{ IBM VisualAge C++ ( which includes the Dinkumware C++ Library )
 *****************************************************************************/
#ifdef __IBMCPP__

// No strcasecmp in the C library (so use stricmp instead)
// - Anyone know which is in which standard?
#if (defined(_AIX) && (__IBMCPP__ >= 600))
# define NO_STATIC_CONSTS
#else
# define NO_STRCASECMP
# undef ANTLR_CCTYPE_NEEDS_STD
#endif

#endif	// end IBM VisualAge C++
/*}}}*/
/*****************************************************************************/
/*{{{ Metrowerks Codewarrior
 *****************************************************************************/
#ifdef __MWERKS__
# if (__MWERKS__ <= 0x2201)
#	define NO_TEMPLATE_PARTS
# endif

// CW 6.0 and 7.0 still do not have it.
# define ANTLR_REALLY_NO_STRCASECMP

# undef ANTLR_C_USING
# define ANTLR_C_USING(_x_)   using std:: ## _x_;

# define ANTLR_CCTYPE_NEEDS_STD
# undef ANTLR_CXX_SUPPORTS_UNCAUGHT_EXCEPTION

#endif	// End of Metrowerks Codewarrior
/*}}}*/
/*****************************************************************************/
/*{{{ SGI Irix 6.5.10 MIPSPro compiler
 *****************************************************************************/
// (contributed by Anna Winkler)
// Note: you can't compile ANTLR with the MIPSPro compiler on
// anything < 6.5.10 because SGI just fixed a big bug dealing with
// namespaces in that release.
#ifdef __sgi
# define HAS_NOT_CCTYPE_H
# define HAS_NOT_CSTRING_H
# define HAS_NOT_CSTDIO_H
# undef ANTLR_CCTYPE_NEEDS_STD
#endif // End IRIX MIPSPro
/*}}}*/
/*****************************************************************************/
/*{{{ G++ in various incarnations
 *****************************************************************************/
// With the gcc-2.95 and 3.0 being in the near future we should start handling
// incompatabilities between the various libstdc++'s.
#if defined(__GNUC__) || defined(__GNUG__)
// gcc 2 branch..
# if (__GNUC__ == 2 )
#	if (__GNUC_MINOR__ <= 8 )
#	 undef ANTLR_USE_NAMESPACE
#	 define ANTLR_USE_NAMESPACE(_x_)
#	 undef ANTLR_USING_NAMESPACE
#	 define ANTLR_USING_NAMESPACE(_x_)
#	 undef ANTLR_CXX_SUPPORTS_NAMESPACE
#	endif
#	if (__GNUC_MINOR__ > 8 && __GNUC_MINOR__ <= 95 )
#	  undef ANTLR_IOS_BASE
#	  define ANTLR_IOS_BASE ios
#	  undef ANTLR_CCTYPE_NEEDS_STD
// compiling with -ansi ?
#	  ifdef __STRICT_ANSI__
#		undef ANTLR_REALLY_NO_STRCASECMP
#		define ANTLR_REALLY_NO_STRCASECMP
#	  endif
#	else
// experimental .96 .97 branches..
#	 undef ANTLR_CCTYPE_NEEDS_STD
#	endif
# endif
#endif // ! __GNUC__
/*}}}*/
/*****************************************************************************/
/*{{{ Digital CXX (Tru64)
 *****************************************************************************/
#ifdef __DECCXX
#define __USE_STD_IOSTREAM
#endif
/*}}}*/
/*****************************************************************************/
#ifdef __BORLANDC__
# if  __BORLANDC__ >= 560
#	include 
#	include 
#	define ANTLR_CCTYPE_NEEDS_STD
# else
#	error "sorry, compiler is too old - consider an update."
# endif
#endif

// Redefine these for backwards compatability..
#undef ANTLR_BEGIN_NAMESPACE
#undef ANTLR_END_NAMESPACE

#if ANTLR_CXX_SUPPORTS_NAMESPACE == 1
# define ANTLR_BEGIN_NAMESPACE(_x_) namespace _x_ {
# define ANTLR_END_NAMESPACE }
#else
# define ANTLR_BEGIN_NAMESPACE(_x_)
# define ANTLR_END_NAMESPACE
#endif

#endif //INC_config_hpp__
antlr-2.7.7/lib/cpp/antlr/RefCount.hpp0000644000175000017500000000264010522211615017510 0ustar  twernertwerner#ifndef INC_RefCount_hpp__
#define INC_RefCount_hpp__
/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/antlr/RefCount.hpp#2 $
 */

#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

template
class ANTLR_API RefCount {
private:
	struct Ref {
		T* const ptr;
		unsigned int count;

		Ref(T* p) : ptr(p), count(1) {}
		~Ref() {delete ptr;}
		Ref* increment() {++count;return this;}
		bool decrement() {return (--count==0);}
	private:
		Ref(const Ref&);
		Ref& operator=(const Ref&);
	}* ref;

public:
	explicit RefCount(T* p = 0)
	: ref(p ? new Ref(p) : 0)
	{
	}
	RefCount(const RefCount& other)
	: ref(other.ref ? other.ref->increment() : 0)
	{
	}
	~RefCount()
	{
		if (ref && ref->decrement())
			delete ref;
	}
	RefCount& operator=(const RefCount& other)
	{
		Ref* tmp = other.ref ? other.ref->increment() : 0;
		if (ref && ref->decrement())
			delete ref;
		ref = tmp;
		return *this;
	}

	operator T* () const
	{
		return ref ? ref->ptr : 0;
	}

	T* operator->() const
	{
		return ref ? ref->ptr : 0;
	}

	T* get() const
	{
		return ref ? ref->ptr : 0;
	}

	template operator RefCount()
	{
		return RefCount(ref);
	}
};

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

#endif //INC_RefCount_hpp__
antlr-2.7.7/lib/cpp/src/0000755000175000017500000000000010522211615014717 5ustar  twernertwernerantlr-2.7.7/lib/cpp/src/TokenStreamHiddenTokenFilter.cpp0000644000175000017500000001030310522211615023137 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/TokenStreamHiddenTokenFilter.cpp#2 $
 */
#include "antlr/TokenStreamHiddenTokenFilter.hpp"
#include "antlr/CommonHiddenStreamToken.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/**This object filters a token stream coming from a lexer
 * or another TokenStream so that only certain token channels
 * get transmitted to the parser.
 *
 * Any of the channels can be filtered off as "hidden" channels whose
 * tokens can be accessed from the parser.
 */

TokenStreamHiddenTokenFilter::TokenStreamHiddenTokenFilter(TokenStream& input)
: TokenStreamBasicFilter(input)
{
}

void TokenStreamHiddenTokenFilter::consume()
{
	nextMonitoredToken = input->nextToken();
}

void TokenStreamHiddenTokenFilter::consumeFirst()
{
	consume();

	// Handle situation where hidden or discarded tokens
	// appear first in input stream
	RefToken p;
	// while hidden or discarded scarf tokens
	while ( hideMask.member(LA(1)->getType()) || discardMask.member(LA(1)->getType()) ) {
		if ( hideMask.member(LA(1)->getType()) ) {
			if ( !p ) {
				p = LA(1);
			}
			else {
				static_cast(p.get())->setHiddenAfter(LA(1));
				static_cast(LA(1).get())->setHiddenBefore(p); // double-link
				p = LA(1);
			}
			lastHiddenToken = p;
			if (!firstHidden)
				firstHidden = p; // record hidden token if first
		}
		consume();
	}
}

BitSet TokenStreamHiddenTokenFilter::getDiscardMask() const
{
	return discardMask;
}

/** Return a ptr to the hidden token appearing immediately after
 *  token t in the input stream.
 */
RefToken TokenStreamHiddenTokenFilter::getHiddenAfter(RefToken t)
{
	return static_cast(t.get())->getHiddenAfter();
}

/** Return a ptr to the hidden token appearing immediately before
 *  token t in the input stream.
 */
RefToken TokenStreamHiddenTokenFilter::getHiddenBefore(RefToken t)
{
	return static_cast(t.get())->getHiddenBefore();
}

BitSet TokenStreamHiddenTokenFilter::getHideMask() const
{
	return hideMask;
}

/** Return the first hidden token if one appears
 *  before any monitored token.
 */
RefToken TokenStreamHiddenTokenFilter::getInitialHiddenToken()
{
	return firstHidden;
}

void TokenStreamHiddenTokenFilter::hide(int m)
{
	hideMask.add(m);
}

void TokenStreamHiddenTokenFilter::hide(const BitSet& mask)
{
	hideMask = mask;
}

RefToken TokenStreamHiddenTokenFilter::LA(int)
{
	return nextMonitoredToken;
}

/** Return the next monitored token.
*  Test the token following the monitored token.
*  If following is another monitored token, save it
*  for the next invocation of nextToken (like a single
*  lookahead token) and return it then.
*  If following is unmonitored, nondiscarded (hidden)
*  channel token, add it to the monitored token.
*
*  Note: EOF must be a monitored Token.
*/
RefToken TokenStreamHiddenTokenFilter::nextToken()
{
	// handle an initial condition; don't want to get lookahead
	// token of this splitter until first call to nextToken
	if ( !LA(1) ) {
		consumeFirst();
	}

	// we always consume hidden tokens after monitored, thus,
	// upon entry LA(1) is a monitored token.
	RefToken monitored = LA(1);
	// point to hidden tokens found during last invocation
	static_cast(monitored.get())->setHiddenBefore(lastHiddenToken);
	lastHiddenToken = nullToken;

	// Look for hidden tokens, hook them into list emanating
	// from the monitored tokens.
	consume();
	RefToken p = monitored;
	// while hidden or discarded scarf tokens
	while ( hideMask.member(LA(1)->getType()) || discardMask.member(LA(1)->getType()) ) {
		if ( hideMask.member(LA(1)->getType()) ) {
			// attach the hidden token to the monitored in a chain
			// link forwards
			static_cast(p.get())->setHiddenAfter(LA(1));
			// link backwards
			if (p != monitored) { //hidden cannot point to monitored tokens
				static_cast(LA(1).get())->setHiddenBefore(p);
			}
			p = lastHiddenToken = LA(1);
		}
		consume();
	}
	return monitored;
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

antlr-2.7.7/lib/cpp/src/LLkParser.cpp0000644000175000017500000000262510522211615017267 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/LLkParser.cpp#2 $
 */

#include "antlr/LLkParser.hpp"
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

ANTLR_USING_NAMESPACE(std)

/**An LL(k) parser.
 *
 * @see antlr.Token
 * @see antlr.TokenBuffer
 * @see antlr.LL1Parser
 */

//	LLkParser(int k_);

LLkParser::LLkParser(const ParserSharedInputState& state, int k_)
: Parser(state), k(k_)
{
}

LLkParser::LLkParser(TokenBuffer& tokenBuf, int k_)
: Parser(tokenBuf), k(k_)
{
}

LLkParser::LLkParser(TokenStream& lexer, int k_)
: Parser(new TokenBuffer(lexer)), k(k_)
{
}

void LLkParser::trace(const char* ee, const char* rname)
{
	traceIndent();

	cout << ee << rname << ((inputState->guessing>0)?"; [guessing]":"; ");

	for (int i = 1; i <= k; i++)
	{
		if (i != 1) {
			cout << ", ";
		}
		cout << "LA(" << i << ")==";

		string temp;

		try {
			temp = LT(i)->getText().c_str();
		}
		catch( ANTLRException& ae )
		{
			temp = "[error: ";
			temp += ae.toString();
			temp += ']';
		}
		cout << temp;
	}

	cout << endl;
}

void LLkParser::traceIn(const char* rname)
{
	traceDepth++;
	trace("> ",rname);
}

void LLkParser::traceOut(const char* rname)
{
	trace("< ",rname);
	traceDepth--;
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/NoViableAltException.cpp0000644000175000017500000000243210522211615021443 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/NoViableAltException.cpp#2 $
 */

#include "antlr/NoViableAltException.hpp"
#include "antlr/String.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

ANTLR_USING_NAMESPACE(std)

NoViableAltException::NoViableAltException(RefAST t)
  : RecognitionException("NoViableAlt","",-1,-1),
    token(0), node(t)
{
}

NoViableAltException::NoViableAltException(
	RefToken t,
	const ANTLR_USE_NAMESPACE(std)string& fileName_
) : RecognitionException("NoViableAlt",fileName_,t->getLine(),t->getColumn()),
    token(t), node(nullASTptr)
{
}

ANTLR_USE_NAMESPACE(std)string NoViableAltException::getMessage() const
{
	if (token)
	{
		if( token->getType() == Token::EOF_TYPE )
			return string("unexpected end of file");
		else if( token->getType() == Token::NULL_TREE_LOOKAHEAD )
			return string("unexpected end of tree");
		else
			return string("unexpected token: ")+token->getText();
	}

	// must a tree parser error if token==null
	if (!node)
		return "unexpected end of subtree";

	return string("unexpected AST node: ")+node->toString();
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/TokenStreamSelector.cpp0000644000175000017500000000500110522211615021354 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/TokenStreamSelector.cpp#2 $
 */
#include "antlr/TokenStreamSelector.hpp"
#include "antlr/TokenStreamRetryException.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** A token stream MUX (multiplexor) knows about n token streams
 *  and can multiplex them onto the same channel for use by token
 *  stream consumer like a parser.  This is a way to have multiple
 *  lexers break up the same input stream for a single parser.
 *	Or, you can have multiple instances of the same lexer handle
 *  multiple input streams; this works great for includes.
 */

TokenStreamSelector::TokenStreamSelector()
: input(0)
{
}

TokenStreamSelector::~TokenStreamSelector()
{
}

void TokenStreamSelector::addInputStream(TokenStream* stream, const ANTLR_USE_NAMESPACE(std)string& key)
{
	inputStreamNames[key] = stream;
}

TokenStream* TokenStreamSelector::getCurrentStream() const
{
	return input;
}

TokenStream* TokenStreamSelector::getStream(const ANTLR_USE_NAMESPACE(std)string& sname) const
{
	inputStreamNames_coll::const_iterator i = inputStreamNames.find(sname);
	if (i == inputStreamNames.end()) {
		throw ANTLR_USE_NAMESPACE(std)string("TokenStream ")+sname+" not found";
	}
	return (*i).second;
}

RefToken TokenStreamSelector::nextToken()
{
	// keep looking for a token until you don't
	// get a retry exception
	for (;;) {
		try {
			return input->nextToken();
		}
		catch (TokenStreamRetryException&) {
			// just retry "forever"
		}
	}
}

TokenStream* TokenStreamSelector::pop()
{
	TokenStream* stream = streamStack.top();
	streamStack.pop();
	select(stream);
	return stream;
}

void TokenStreamSelector::push(TokenStream* stream)
{
	streamStack.push(input);
	select(stream);
}

void TokenStreamSelector::push(const ANTLR_USE_NAMESPACE(std)string& sname)
{
	streamStack.push(input);
	select(sname);
}

void TokenStreamSelector::retry()
{
	throw TokenStreamRetryException();
}

/** Set the stream without pushing old stream */
void TokenStreamSelector::select(TokenStream* stream)
{
	input = stream;
}

void TokenStreamSelector::select(const ANTLR_USE_NAMESPACE(std)string& sname)
{
	inputStreamNames_coll::const_iterator i = inputStreamNames.find(sname);
	if (i == inputStreamNames.end()) {
		throw ANTLR_USE_NAMESPACE(std)string("TokenStream ")+sname+" not found";
	}
	input = (*i).second;
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

antlr-2.7.7/lib/cpp/src/Makefile.in0000755000175000017500000001176210522211615016776 0ustar  twernertwerner##############################################################################
# $Id:$
###############################################################################

##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
@stdvars@
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx

## do not change this value 
subdir=lib/cpp/src

all : lib

lib: @ANTLR_LIB@

compile: $(antlr_obj_FILES)


antlr_cxx_FILES = \
 @abs_top_srcdir@/lib/cpp/src/ANTLRUtil.cpp \
 @abs_top_srcdir@/lib/cpp/src/ASTFactory.cpp \
 @abs_top_srcdir@/lib/cpp/src/ASTNULLType.cpp \
 @abs_top_srcdir@/lib/cpp/src/ASTRefCount.cpp \
 @abs_top_srcdir@/lib/cpp/src/BaseAST.cpp \
 @abs_top_srcdir@/lib/cpp/src/BitSet.cpp \
 @abs_top_srcdir@/lib/cpp/src/CharBuffer.cpp \
 @abs_top_srcdir@/lib/cpp/src/CharScanner.cpp \
 @abs_top_srcdir@/lib/cpp/src/CommonAST.cpp \
 @abs_top_srcdir@/lib/cpp/src/CommonASTWithHiddenTokens.cpp \
 @abs_top_srcdir@/lib/cpp/src/CommonHiddenStreamToken.cpp \
 @abs_top_srcdir@/lib/cpp/src/CommonToken.cpp \
 @abs_top_srcdir@/lib/cpp/src/InputBuffer.cpp \
 @abs_top_srcdir@/lib/cpp/src/LLkParser.cpp \
 @abs_top_srcdir@/lib/cpp/src/MismatchedCharException.cpp \
 @abs_top_srcdir@/lib/cpp/src/MismatchedTokenException.cpp \
 @abs_top_srcdir@/lib/cpp/src/NoViableAltException.cpp \
 @abs_top_srcdir@/lib/cpp/src/NoViableAltForCharException.cpp \
 @abs_top_srcdir@/lib/cpp/src/Parser.cpp \
 @abs_top_srcdir@/lib/cpp/src/RecognitionException.cpp \
 @abs_top_srcdir@/lib/cpp/src/String.cpp \
 @abs_top_srcdir@/lib/cpp/src/Token.cpp \
 @abs_top_srcdir@/lib/cpp/src/TokenBuffer.cpp \
 @abs_top_srcdir@/lib/cpp/src/TokenStreamBasicFilter.cpp \
 @abs_top_srcdir@/lib/cpp/src/TokenStreamHiddenTokenFilter.cpp \
 @abs_top_srcdir@/lib/cpp/src/TokenStreamSelector.cpp \
 @abs_top_srcdir@/lib/cpp/src/TokenStreamRewriteEngine.cpp \
 @abs_top_srcdir@/lib/cpp/src/TreeParser.cpp \
 @abs_top_srcdir@/lib/cpp/src/TokenRefCount.cpp \
 $(eol)

## contents of this varialbe could also be processed  by
## some advanced GNU make 'scripting' features. This may
## simplify maintenance but makes Makefile far less read-
## able and non-portable.
antlr_obj_FILES = \
 @abs_this_builddir@/lib/cpp/src/ANTLRUtil@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/ASTFactory@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/ASTNULLType@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/ASTRefCount@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/BaseAST@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/BitSet@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/CharBuffer@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/CharScanner@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/CommonAST@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/CommonASTWithHiddenTokens@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/CommonHiddenStreamToken@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/CommonToken@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/InputBuffer@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/LLkParser@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/MismatchedCharException@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/MismatchedTokenException@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/NoViableAltException@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/NoViableAltForCharException@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/Parser@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/RecognitionException@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/String@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/Token@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/TokenBuffer@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/TokenStreamBasicFilter@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/TokenStreamHiddenTokenFilter@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/TokenStreamSelector@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/TokenStreamRewriteEngine@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/TreeParser@OBJEXT@ \
 @abs_this_builddir@/lib/cpp/src/TokenRefCount@OBJEXT@ \
 $(eol)


## GNU make - how to make object file
@abs_this_builddir@/lib/cpp/src/%@OBJEXT@ : @abs_top_srcdir@/lib/cpp/src/%.cpp
	@ @CXX_COMPILE_CMD@ $<

## Build static library. How the library is build as well as
## libraries's name is hidden by our script, ie. configured.
@ANTLR_LIB@ :: $(antlr_obj_FILES)
	@ @CXX_LIB_CMD@ $(antlr_obj_FILES)

clean:
	@RMF@ *.obj *.o *.a  *.lib *.so *.dll *~ @ANTLR_LIB@

## use this target if you just want to rebuild the lib without
## compiling again.
clean-lib:
	@RMF@ @ANTLR_LIB@

distclean: clean
	@RMF@ Makefile

test:

install: this-install

antlr_lib_FILES = \
  @ANTLR_LIB@ \
  $(eol)

this-install: @ANTLR_LIB@ 
	@$(MKDIR) -p "$(libdir)"
	@@ECHO@ "install C++ core files .. "
	@for f in $(antlr_lib_FILES) ; do \
		@ECHO@ "install $${f}" ; \
		if test -f "$${f}" ; then \
			$(INSTALL) -m 444 "$${f}" "$(libdir)" ; \
		fi ;\
	done


.PHONY: all clean distclean compile lib install test clean-lib this-install

## dependencies
$(antlr_obj_FILES) : @abs_this_builddir@/scripts/cxx.sh
@ANTLR_LIB@        :: @abs_this_builddir@/scripts/lib.sh

## other dependencies to be listed below
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
@stddeps@
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
antlr-2.7.7/lib/cpp/src/ANTLRUtil.cpp0000644000175000017500000000707410522211615017151 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id:$
 */

#include 
#include 

#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** Eat whitespace from the input stream
 * @param is the stream to read from
 */
ANTLR_USE_NAMESPACE(std)istream& eatwhite( ANTLR_USE_NAMESPACE(std)istream& is )
{
	char c;
	while( is.get(c) )
	{
#ifdef ANTLR_CCTYPE_NEEDS_STD
		if( !ANTLR_USE_NAMESPACE(std)isspace(c) )
#else
		if( !isspace(c) )
#endif
		{
			is.putback(c);
			break;
		}
	}
	return is;
}

/** Read a string enclosed by '"' from a stream. Also handles escaping of \".
 * Skips leading whitespace.
 * @param in the istream to read from.
 * @returns the string read from file exclusive the '"'
 * @throws IOException if string is badly formatted
 */
ANTLR_USE_NAMESPACE(std)string read_string( ANTLR_USE_NAMESPACE(std)istream& in )
{
	char ch;
	ANTLR_USE_NAMESPACE(std)string ret("");
	// States for a simple state machine...
	enum { START, READING, ESCAPE, FINISHED };
	int state = START;

	eatwhite(in);

	while( state != FINISHED && in.get(ch) )
	{
		switch( state )
		{
		case START:
			// start state: check wether starting with " then switch to READING
			if( ch != '"' )
				throw IOException("string must start with '\"'");
			state = READING;
			continue;
		case READING:
			// reading state: look out for escape sequences and closing "
			if( ch == '\\' )		// got escape sequence
			{
				state = ESCAPE;
				continue;
			}
			if( ch == '"' ) 		// close quote -> stop
			{
				state = FINISHED;
				continue;
			}
			ret += ch;				// else append...
			continue;
		case ESCAPE:
			switch(ch)
			{
			case '\\':
				ret += ch;
				state = READING;
				continue;
			case '"':
				ret += ch;
				state = READING;
				continue;
			case '0':
				ret += '\0';
				state = READING;
				continue;
			default:						// unrecognized escape is not mapped
				ret += '\\';
				ret += ch;
				state = READING;
				continue;
			}
		}
	}
	if( state != FINISHED )
		throw IOException("badly formatted string: "+ret);

	return ret;
}

/* Read a ([A-Z][0-9][a-z]_)* kindoff thing. Skips leading whitespace.
 * @param in the istream to read from.
 */
ANTLR_USE_NAMESPACE(std)string read_identifier( ANTLR_USE_NAMESPACE(std)istream& in )
{
	char ch;
	ANTLR_USE_NAMESPACE(std)string ret("");

	eatwhite(in);

	while( in.get(ch) )
	{
#ifdef ANTLR_CCTYPE_NEEDS_STD
		if( ANTLR_USE_NAMESPACE(std)isupper(ch) ||
			 ANTLR_USE_NAMESPACE(std)islower(ch) ||
			 ANTLR_USE_NAMESPACE(std)isdigit(ch) ||
			 ch == '_' )
#else
		if( isupper(ch) || islower(ch) || isdigit(ch) || ch == '_' )
#endif
			ret += ch;
		else
		{
			in.putback(ch);
			break;
		}
	}
	return ret;
}

/** Read a attribute="value" thing. Leading whitespace is skipped.
 * Between attribute and '=' no whitespace is allowed. After the '=' it is
 * permitted.
 * @param in the istream to read from.
 * @param attribute string the attribute name is put in
 * @param value string the value of the attribute is put in
 * @throws IOException if something is fishy. E.g. malformed quoting
 * or missing '='
 */
void read_AttributeNValue( ANTLR_USE_NAMESPACE(std)istream& in,
									ANTLR_USE_NAMESPACE(std)string& attribute,
									ANTLR_USE_NAMESPACE(std)string& value )
{
	attribute = read_identifier(in);

	char ch;
	if( in.get(ch) && ch == '=' )
		value = read_string(in);
	else
		throw IOException("invalid attribute=value thing "+attribute);
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/ASTRefCount.cpp0000644000175000017500000000127410522211615017524 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/ASTRefCount.cpp#2 $
 */
#include "antlr/ASTRefCount.hpp"
#include "antlr/AST.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

ASTRef::ASTRef(AST* p)
: ptr(p), count(1)
{
	if (p && !p->ref)
		p->ref = this;
}

ASTRef::~ASTRef()
{
	delete ptr;
}

ASTRef* ASTRef::getRef(const AST* p)
{
	if (p) {
		AST* pp = const_cast(p);
		if (pp->ref)
			return pp->ref->increment();
		else
			return new ASTRef(pp);
	} else
		return 0;
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

antlr-2.7.7/lib/cpp/src/TokenBuffer.cpp0000644000175000017500000000423210522211615017636 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/TokenBuffer.cpp#2 $
 */

#include "antlr/TokenBuffer.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/**A Stream of Token objects fed to the parser from a TokenStream that can
 * be rewound via mark()/rewind() methods.
 * 

 * A dynamic array is used to buffer up all the input tokens.  Normally,
 * "k" tokens are stored in the buffer.  More tokens may be stored during
 * guess mode (testing syntactic predicate), or when LT(i>k) is referenced.
 * Consumption of tokens is deferred.  In other words, reading the next
 * token is not done by conume(), but deferred until needed by LA or LT.
 * 

 *
 * @see antlr.Token
 * @see antlr.TokenStream
 * @see antlr.TokenQueue
 */

/** Create a token buffer */
TokenBuffer::TokenBuffer( TokenStream& inp )
: input(inp)
, nMarkers(0)
, markerOffset(0)
, numToConsume(0)
{
}

TokenBuffer::~TokenBuffer( void )
{
}

/** Ensure that the token buffer is sufficiently full */
void TokenBuffer::fill(unsigned int amount)
{
	syncConsume();
	// Fill the buffer sufficiently to hold needed tokens
	while (queue.entries() < (amount + markerOffset))
	{
		// Append the next token
		queue.append(input.nextToken());
	}
}

/** Get a lookahead token value */
int TokenBuffer::LA(unsigned int i)
{
	fill(i);
	return queue.elementAt(markerOffset+i-1)->getType();
}

/** Get a lookahead token */
RefToken TokenBuffer::LT(unsigned int i)
{
	fill(i);
	return queue.elementAt(markerOffset+i-1);
}

/** Return an integer marker that can be used to rewind the buffer to
 * its current state.
 */
unsigned int TokenBuffer::mark()
{
	syncConsume();
	nMarkers++;
	return markerOffset;
}

/**Rewind the token buffer to a marker.
 * @param mark Marker returned previously from mark()
 */
void TokenBuffer::rewind(unsigned int mark)
{
	syncConsume();
	markerOffset=mark;
	nMarkers--;
}

/// Get number of non-consumed tokens
unsigned int TokenBuffer::entries() const
{
	return queue.entries() - markerOffset;
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
	}
#endif
antlr-2.7.7/lib/cpp/src/InputBuffer.cpp0000644000175000017500000000346710522211615017666 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/InputBuffer.cpp#2 $
 */

#include "antlr/config.hpp"
#include "antlr/InputBuffer.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** Ensure that the character buffer is sufficiently full */
void InputBuffer::fill(unsigned int amount)
{
	syncConsume();
	// Fill the buffer sufficiently to hold needed characters
	while (queue.entries() < amount + markerOffset)
	{
		// Append the next character
		queue.append(getChar());
	}
}

/** get the current lookahead characters as a string
 * @warning it may treat 0 and EOF values wrong
 */
ANTLR_USE_NAMESPACE(std)string InputBuffer::getLAChars( void ) const
{
	ANTLR_USE_NAMESPACE(std)string ret;

	for(unsigned int i = markerOffset; i < queue.entries(); i++)
		ret += queue.elementAt(i);

	return ret;
}

/** get the current marked characters as a string
 * @warning it may treat 0 and EOF values wrong
 */
ANTLR_USE_NAMESPACE(std)string InputBuffer::getMarkedChars( void ) const
{
	ANTLR_USE_NAMESPACE(std)string ret;

	for(unsigned int i = 0; i < markerOffset; i++)
		ret += queue.elementAt(i);

	return ret;
}

/** Return an integer marker that can be used to rewind the buffer to
 * its current state.
 */
unsigned int InputBuffer::mark()
{
	syncConsume();
	nMarkers++;
	return markerOffset;
}

/** Rewind the character buffer to a marker.
 * @param mark Marker returned previously from mark()
 */
void InputBuffer::rewind(unsigned int mark)
{
	syncConsume();
	markerOffset = mark;
	nMarkers--;
}

unsigned int InputBuffer::entries() const
{
	//assert(queue.entries() >= markerOffset);
	return queue.entries() - markerOffset;
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/CommonAST.cpp0000644000175000017500000000176410522211615017233 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/CommonAST.cpp#2 $
 */
#include "antlr/config.hpp"

#include 
#include 

#include "antlr/CommonAST.hpp"
#include "antlr/ANTLRUtil.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

const char* const CommonAST::TYPE_NAME = "CommonAST";

#ifdef ANTLR_SUPPORT_XML
void CommonAST::initialize( ANTLR_USE_NAMESPACE(std)istream& in )
{
	ANTLR_USE_NAMESPACE(std)string t1, t2, text;

	// text
	read_AttributeNValue( in, t1, text );

	read_AttributeNValue( in, t1, t2 );
#ifdef ANTLR_ATOI_IN_STD
	int type = ANTLR_USE_NAMESPACE(std)atoi(t2.c_str());
#else
	int type = atoi(t2.c_str());
#endif

	// initialize first part of AST.
	this->initialize( type, text );
}
#endif

RefAST CommonAST::factory()
{
	return RefAST(new CommonAST);
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

antlr-2.7.7/lib/cpp/src/BitSet.cpp0000644000175000017500000000227010522211615016616 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/BitSet.cpp#2 $
 */
#include "antlr/BitSet.hpp"
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

BitSet::BitSet(unsigned int nbits)
: storage(nbits)
{
	for (unsigned int i = 0; i < nbits ; i++ )
		storage[i] = false;
}

BitSet::BitSet( const unsigned long* bits_, unsigned int nlongs )
: storage(nlongs*32)
{
	for ( unsigned int i = 0 ; i < (nlongs * 32); i++)
		storage[i] = (bits_[i>>5] & (1UL << (i&31))) ? true : false;
}

BitSet::~BitSet()
{
}

void BitSet::add(unsigned int el)
{
	if( el >= storage.size() )
		storage.resize( el+1, false );

	storage[el] = true;
}

bool BitSet::member(unsigned int el) const
{
	if ( el >= storage.size())
		return false;

	return storage[el];
}

ANTLR_USE_NAMESPACE(std)vector BitSet::toArray() const
{
	ANTLR_USE_NAMESPACE(std)vector elems;
	for (unsigned int i = 0; i < storage.size(); i++)
	{
		if (storage[i])
			elems.push_back(i);
	}

	return elems;
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/TokenRefCount.cpp0000644000175000017500000000121410522211615020147 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id:$
 */
#include "antlr/TokenRefCount.hpp"
#include "antlr/Token.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

TokenRef::TokenRef(Token* p)
: ptr(p), count(1)
{
	if (p && !p->ref)
		p->ref = this;
}

TokenRef::~TokenRef()
{
	delete ptr;
}

TokenRef* TokenRef::getRef(const Token* p)
{
	if (p) {
		Token* pp = const_cast(p);
		if (pp->ref)
			return pp->ref->increment();
		else
			return new TokenRef(pp);
	} else
		return 0;
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

antlr-2.7.7/lib/cpp/src/RecognitionException.cpp0000644000175000017500000000326110522211615021564 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/RecognitionException.cpp#2 $
 */

#include "antlr/RecognitionException.hpp"
#include "antlr/String.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

RecognitionException::RecognitionException()
: ANTLRException("parsing error")
, line(-1)
, column(-1)
{
}

RecognitionException::RecognitionException(const ANTLR_USE_NAMESPACE(std)string& s)
: ANTLRException(s)
, line(-1)
, column(-1)
{
}

RecognitionException::RecognitionException(const ANTLR_USE_NAMESPACE(std)string& s,
                                           const ANTLR_USE_NAMESPACE(std)string& fileName_,
                                           int line_,int column_)
: ANTLRException(s)
, fileName(fileName_)
, line(line_)
, column(column_)
{
}

ANTLR_USE_NAMESPACE(std)string RecognitionException::getFileLineColumnString() const
{
	ANTLR_USE_NAMESPACE(std)string fileLineColumnString;

	if ( fileName.length() > 0 )
		fileLineColumnString = fileName + ":";

	if ( line != -1 )
	{
		if ( fileName.length() == 0 )
			fileLineColumnString = fileLineColumnString + "line ";

		fileLineColumnString = fileLineColumnString + line;

		if ( column != -1 )
			fileLineColumnString = fileLineColumnString + ":" + column;

		fileLineColumnString = fileLineColumnString + ":";
	}

	fileLineColumnString = fileLineColumnString + " ";

	return fileLineColumnString;
}

ANTLR_USE_NAMESPACE(std)string RecognitionException::toString() const
{
	return getFileLineColumnString()+getMessage();
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/TreeParser.cpp0000644000175000017500000000405010522211615017476 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/TreeParser.cpp#2 $
 */

#include "antlr/TreeParser.hpp"
#include "antlr/ASTNULLType.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** The AST Null object; the parsing cursor is set to this when
 *  it is found to be null.  This way, we can test the
 *  token type of a node without having to have tests for null
 *  everywhere.
 */
RefAST TreeParser::ASTNULL(new ASTNULLType);

/** Parser error-reporting function can be overridden in subclass */
void TreeParser::reportError(const RecognitionException& ex)
{
	ANTLR_USE_NAMESPACE(std)cerr << ex.toString().c_str() << ANTLR_USE_NAMESPACE(std)endl;
}

/** Parser error-reporting function can be overridden in subclass */
void TreeParser::reportError(const ANTLR_USE_NAMESPACE(std)string& s)
{
	ANTLR_USE_NAMESPACE(std)cerr << "error: " << s.c_str() << ANTLR_USE_NAMESPACE(std)endl;
}

/** Parser warning-reporting function can be overridden in subclass */
void TreeParser::reportWarning(const ANTLR_USE_NAMESPACE(std)string& s)
{
	ANTLR_USE_NAMESPACE(std)cerr << "warning: " << s.c_str() << ANTLR_USE_NAMESPACE(std)endl;
}

/** Procedure to write out an indent for traceIn and traceOut */
void TreeParser::traceIndent()
{
	for( int i = 0; i < traceDepth; i++ )
		ANTLR_USE_NAMESPACE(std)cout << " ";
}

void TreeParser::traceIn(const char* rname, RefAST t)
{
	traceDepth++;
	traceIndent();

	ANTLR_USE_NAMESPACE(std)cout << "> " << rname
			<< "(" << (t ? t->toString().c_str() : "null") << ")"
			<< ((inputState->guessing>0)?" [guessing]":"")
			<< ANTLR_USE_NAMESPACE(std)endl;
}

void TreeParser::traceOut(const char* rname, RefAST t)
{
	traceIndent();

	ANTLR_USE_NAMESPACE(std)cout << "< " << rname
			<< "(" << (t ? t->toString().c_str() : "null") << ")"
			<< ((inputState->guessing>0)?" [guessing]":"")
			<< ANTLR_USE_NAMESPACE(std)endl;

	traceDepth--;
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/String.cpp0000644000175000017500000000311310522211615016667 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/String.cpp#2 $
 */

#include "antlr/String.hpp"

#include 

#ifdef HAS_NOT_CSTDIO_H
#include 
#else
#include 
#endif

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

// wh: hack for Borland C++ 5.6
#if __BORLANDC__
  using std::sprintf;
#endif


// RK: should be using snprintf actually... (or stringstream)
ANTLR_C_USING(sprintf)

ANTLR_USE_NAMESPACE(std)string operator+( const ANTLR_USE_NAMESPACE(std)string& lhs, const int rhs )
{
	char tmp[100];
	sprintf(tmp,"%d",rhs);
	return lhs+tmp;
}

ANTLR_USE_NAMESPACE(std)string operator+( const ANTLR_USE_NAMESPACE(std)string& lhs, size_t rhs )
{
	char tmp[100];
	sprintf(tmp,"%u",rhs);
	return lhs+tmp;
}

/** Convert character to readable string
 */
ANTLR_USE_NAMESPACE(std)string charName(int ch)
{
	if (ch == EOF)
		return "EOF";
	else
	{
		ANTLR_USE_NAMESPACE(std)string s;

		// when you think you've seen it all.. an isprint that crashes...
		ch = ch & 0xFF;
#ifdef ANTLR_CCTYPE_NEEDS_STD
		if( ANTLR_USE_NAMESPACE(std)isprint( ch ) )
#else
		if( isprint( ch ) )
#endif
		{
			s.append("'");
			s += ch;
			s.append("'");
//			s += "'"+ch+"'";
		}
		else
		{
			s += "0x";

			unsigned int t = ch >> 4;
			if( t < 10 )
				s += t | 0x30;
			else
				s += t + 0x37;
			t = ch & 0xF;
			if( t < 10 )
				s += t | 0x30;
			else
				s += t + 0x37;
		}
		return s;
	}
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

antlr-2.7.7/lib/cpp/src/BaseAST.cpp0000644000175000017500000001510710522211615016651 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/BaseAST.cpp#2 $
 */

#include "antlr/config.hpp"

#include 

#include "antlr/AST.hpp"
#include "antlr/BaseAST.hpp"

ANTLR_USING_NAMESPACE(std)
#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

size_t BaseAST::getNumberOfChildren() const
{
	RefBaseAST t = this->down;
	size_t n = 0;
	if( t )
	{
		n = 1;
		while( t->right )
		{
			t = t->right;
			n++;
		}
		return n;
	}
	return n;
}

void BaseAST::doWorkForFindAll(
		ANTLR_USE_NAMESPACE(std)vector& v,
		RefAST target,bool partialMatch)
{
	// Start walking sibling lists, looking for matches.
	for (RefAST sibling=this;
			sibling;
			sibling=sibling->getNextSibling())
	{
		if ( (partialMatch && sibling->equalsTreePartial(target)) ||
				(!partialMatch && sibling->equalsTree(target)) ) {
			v.push_back(sibling);
		}
		// regardless of match or not, check any children for matches
		if ( sibling->getFirstChild() ) {
			RefBaseAST(sibling->getFirstChild())->doWorkForFindAll(v, target, partialMatch);
		}
	}
}

/** Is t an exact structural and equals() match of this tree.  The
 *  'this' reference is considered the start of a sibling list.
 */
bool BaseAST::equalsList(RefAST t) const
{
	// the empty tree is not a match of any non-null tree.
	if (!t)
		return false;

	// Otherwise, start walking sibling lists.  First mismatch, return false.
	RefAST sibling=this;
	for (;sibling && t;
			sibling=sibling->getNextSibling(), t=t->getNextSibling()) {
		// as a quick optimization, check roots first.
		if (!sibling->equals(t))
			return false;
		// if roots match, do full list match test on children.
		if (sibling->getFirstChild()) {
			if (!sibling->getFirstChild()->equalsList(t->getFirstChild()))
				return false;
		}
		// sibling has no kids, make sure t doesn't either
		else if (t->getFirstChild())
			return false;
	}

	if (!sibling && !t)
		return true;

	// one sibling list has more than the other
	return false;
}

/** Is 'sub' a subtree of this list?
 *  The siblings of the root are NOT ignored.
 */
bool BaseAST::equalsListPartial(RefAST sub) const
{
	// the empty tree is always a subset of any tree.
	if (!sub)
		return true;

	// Otherwise, start walking sibling lists.  First mismatch, return false.
	RefAST sibling=this;
	for (;sibling && sub;
			sibling=sibling->getNextSibling(), sub=sub->getNextSibling()) {
		// as a quick optimization, check roots first.
		if (!sibling->equals(sub))
			return false;
		// if roots match, do partial list match test on children.
		if (sibling->getFirstChild())
			if (!sibling->getFirstChild()->equalsListPartial(sub->getFirstChild()))
				return false;
	}

	if (!sibling && sub)
		// nothing left to match in this tree, but subtree has more
		return false;

	// either both are null or sibling has more, but subtree doesn't
	return true;
}

/** Is tree rooted at 'this' equal to 't'?  The siblings
 *  of 'this' are ignored.
 */
bool BaseAST::equalsTree(RefAST t) const
{
	// check roots first
	if (!equals(t))
		return false;
	// if roots match, do full list match test on children.
	if (getFirstChild()) {
		if (!getFirstChild()->equalsList(t->getFirstChild()))
			return false;
	}
	// sibling has no kids, make sure t doesn't either
	else if (t->getFirstChild())
		return false;

	return true;
}

/** Is 'sub' a subtree of the tree rooted at 'this'?  The siblings
 *  of 'this' are ignored.
 */
bool BaseAST::equalsTreePartial(RefAST sub) const
{
	// the empty tree is always a subset of any tree.
	if (!sub)
		return true;

	// check roots first
	if (!equals(sub))
		return false;
	// if roots match, do full list partial match test on children.
	if (getFirstChild())
		if (!getFirstChild()->equalsListPartial(sub->getFirstChild()))
			return false;

	return true;
}

/** Walk the tree looking for all exact subtree matches.  Return
 *  an ASTEnumerator that lets the caller walk the list
 *  of subtree roots found herein.
 */
ANTLR_USE_NAMESPACE(std)vector BaseAST::findAll(RefAST target)
{
	ANTLR_USE_NAMESPACE(std)vector roots;

	// the empty tree cannot result in an enumeration
	if (target) {
		doWorkForFindAll(roots,target,false); // find all matches recursively
	}

	return roots;
}

/** Walk the tree looking for all subtrees.  Return
 *  an ASTEnumerator that lets the caller walk the list
 *  of subtree roots found herein.
 */
ANTLR_USE_NAMESPACE(std)vector BaseAST::findAllPartial(RefAST target)
{
	ANTLR_USE_NAMESPACE(std)vector roots;

	// the empty tree cannot result in an enumeration
	if (target)
		doWorkForFindAll(roots,target,true); // find all matches recursively

	return roots;
}

ANTLR_USE_NAMESPACE(std)string BaseAST::toStringList() const
{
	ANTLR_USE_NAMESPACE(std)string ts="";

	if (getFirstChild())
	{
		ts+=" ( ";
		ts+=toString();
		ts+=getFirstChild()->toStringList();
		ts+=" )";
	}
	else
	{
		ts+=" ";
		ts+=toString();
	}

	if (getNextSibling())
		ts+=getNextSibling()->toStringList();

	return ts;
}

ANTLR_USE_NAMESPACE(std)string BaseAST::toStringTree() const
{
	ANTLR_USE_NAMESPACE(std)string ts = "";

	if (getFirstChild())
	{
		ts+=" ( ";
		ts+=toString();
		ts+=getFirstChild()->toStringList();
		ts+=" )";
	}
	else
	{
		ts+=" ";
		ts+=toString();
	}
	return ts;
}

#ifdef ANTLR_SUPPORT_XML
/* This whole XML output stuff needs a little bit more thought
 * I'd like to store extra XML data in the node. e.g. for custom ast's
 * with for instance symboltable references. This
 * should be more pluggable..
 * @returns boolean value indicating wether a closetag should be produced.
 */
bool BaseAST::attributesToStream( ANTLR_USE_NAMESPACE(std)ostream& out ) const
{
	out << "text=\"" << this->getText()
		<< "\" type=\"" << this->getType() << "\"";

	return false;
}

void BaseAST::toStream( ANTLR_USE_NAMESPACE(std)ostream& out ) const
{
	for( RefAST node = this; node != 0; node = node->getNextSibling() )
	{
		out << "<" << this->typeName() << " ";

		// Write out attributes and if there is extra data...
		bool need_close_tag = node->attributesToStream( out );

		if( need_close_tag )
		{
			// got children so write them...
			if( node->getFirstChild() != 0 )
				node->getFirstChild()->toStream( out );

			// and a closing tag..
			out << "typeName() << ">" << endl;
		}
	}
}
#endif

// this is nasty, but it makes the code generation easier
ANTLR_API RefAST nullAST;

#if defined(_MSC_VER) && !defined(__ICL) // Microsoft Visual C++
extern ANTLR_API AST* const nullASTptr = 0;
#else
ANTLR_API AST* const nullASTptr = 0;
#endif

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/CommonHiddenStreamToken.cpp0000644000175000017500000000213610522211615022146 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/CommonHiddenStreamToken.cpp#2 $
 */
#include "antlr/CommonHiddenStreamToken.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

CommonHiddenStreamToken::CommonHiddenStreamToken()
: CommonToken()
{
}

CommonHiddenStreamToken::CommonHiddenStreamToken(int t, const ANTLR_USE_NAMESPACE(std)string& txt)
: CommonToken(t,txt)
{
}

CommonHiddenStreamToken::CommonHiddenStreamToken(const ANTLR_USE_NAMESPACE(std)string& s)
: CommonToken(s)
{
}

RefToken CommonHiddenStreamToken::getHiddenAfter()
{
	return hiddenAfter;
}

RefToken CommonHiddenStreamToken::getHiddenBefore()
{
	return hiddenBefore;
}

RefToken CommonHiddenStreamToken::factory()
{
	return RefToken(new CommonHiddenStreamToken);
}

void CommonHiddenStreamToken::setHiddenAfter(RefToken t)
{
	hiddenAfter = t;
}

void CommonHiddenStreamToken::setHiddenBefore(RefToken t)
{
	hiddenBefore = t;
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

antlr-2.7.7/lib/cpp/src/MismatchedCharException.cpp0000644000175000017500000000621510522211615022162 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/MismatchedCharException.cpp#2 $
 */

#include "antlr/CharScanner.hpp"
#include "antlr/MismatchedCharException.hpp"
#include "antlr/String.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

MismatchedCharException::MismatchedCharException()
  : RecognitionException("Mismatched char")
{}

// Expected range / not range
MismatchedCharException::MismatchedCharException(
	int c,
	int lower,
	int upper_,
	bool matchNot,
	CharScanner* scanner_
) : RecognitionException("Mismatched char",
                         scanner_->getFilename(),
								 scanner_->getLine(), scanner_->getColumn())
  , mismatchType(matchNot ? NOT_RANGE : RANGE)
  , foundChar(c)
  , expecting(lower)
  , upper(upper_)
  , scanner(scanner_)
{
}

// Expected token / not token
MismatchedCharException::MismatchedCharException(
	int c,
	int expecting_,
	bool matchNot,
	CharScanner* scanner_
) : RecognitionException("Mismatched char",
                         scanner_->getFilename(),
								 scanner_->getLine(), scanner_->getColumn())
  , mismatchType(matchNot ? NOT_CHAR : CHAR)
  , foundChar(c)
  , expecting(expecting_)
  , scanner(scanner_)
{
}

// Expected BitSet / not BitSet
MismatchedCharException::MismatchedCharException(
	int c,
	BitSet set_,
	bool matchNot,
	CharScanner* scanner_
) : RecognitionException("Mismatched char",
                         scanner_->getFilename(),
								 scanner_->getLine(), scanner_->getColumn())
  , mismatchType(matchNot ? NOT_SET : SET)
  , foundChar(c)
  , set(set_)
  , scanner(scanner_)
{
}

ANTLR_USE_NAMESPACE(std)string MismatchedCharException::getMessage() const
{
	ANTLR_USE_NAMESPACE(std)string s;

	switch (mismatchType) {
	case CHAR :
		s += "expecting '" + charName(expecting) + "', found '" + charName(foundChar) + "'";
		break;
	case NOT_CHAR :
		s += "expecting anything but '" + charName(expecting) + "'; got it anyway";
		break;
	case RANGE :
		s += "expecting token in range: '" + charName(expecting) + "'..'" + charName(upper) + "', found '" + charName(foundChar) + "'";
		break;
	case NOT_RANGE :
		s += "expecting token NOT in range: " + charName(expecting) + "'..'" + charName(upper) + "', found '" + charName(foundChar) + "'";
		break;
	case SET :
	case NOT_SET :
		{
			s += ANTLR_USE_NAMESPACE(std)string("expecting ") + (mismatchType == NOT_SET ? "NOT " : "") + "one of (";
			ANTLR_USE_NAMESPACE(std)vector elems = set.toArray();
			for ( unsigned int i = 0; i < elems.size(); i++ )
			{
				s += " '";
				s += charName(elems[i]);
				s += "'";
			}
			s += "), found '" + charName(foundChar) + "'";
		}
		break;
	default :
		s += RecognitionException::getMessage();
		break;
	}

	return s;
}

#ifndef NO_STATIC_CONSTS
const int MismatchedCharException::CHAR;
const int MismatchedCharException::NOT_CHAR;
const int MismatchedCharException::RANGE;
const int MismatchedCharException::NOT_RANGE;
const int MismatchedCharException::SET;
const int MismatchedCharException::NOT_SET;
#endif

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/Token.cpp0000644000175000017500000000241710522211615016507 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/Token.cpp#2 $
 */

#include "antlr/Token.hpp"
#include "antlr/String.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

int Token::getColumn() const
{
	return 0;
}

int Token::getLine() const
{
	return 0;
}

ANTLR_USE_NAMESPACE(std)string Token::getText() const
{
	return "";
}

int Token::getType() const
{
	return type;
}

void Token::setColumn(int)
{
}

void Token::setLine(int)
{
}

void Token::setText(const ANTLR_USE_NAMESPACE(std)string&)
{
}

void Token::setType(int t)
{
	type = t;
}

void Token::setFilename(const ANTLR_USE_NAMESPACE(std)string&)
{
}

ANTLR_USE_NAMESPACE(std)string emptyString("");

const ANTLR_USE_NAMESPACE(std)string& Token::getFilename() const
{
	return emptyString;
}

ANTLR_USE_NAMESPACE(std)string Token::toString() const
{
	return "[\""+getText()+"\",<"+type+">]";
}

ANTLR_API RefToken nullToken;

#ifndef NO_STATIC_CONSTS
const int Token::MIN_USER_TYPE;
const int Token::NULL_TREE_LOOKAHEAD;
const int Token::INVALID_TYPE;
const int Token::EOF_TYPE;
const int Token::SKIP;
#endif

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/TokenStreamRewriteEngine.cpp0000644000175000017500000001310710522211615022351 0ustar  twernertwerner#include 

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

#include 
#include 
#include 
#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

#ifndef NO_STATIC_CONSTS
const size_t TokenStreamRewriteEngine::MIN_TOKEN_INDEX = 0;
const int TokenStreamRewriteEngine::PROGRAM_INIT_SIZE = 100;
#endif

const char* TokenStreamRewriteEngine::DEFAULT_PROGRAM_NAME = "default";

namespace {

	struct compareOperationIndex {
		typedef TokenStreamRewriteEngine::RewriteOperation RewriteOperation;
		bool operator() ( const RewriteOperation* a, const RewriteOperation* b ) const
		{
			return a->getIndex() < b->getIndex();
		}
	};
	struct dumpTokenWithIndex {
		dumpTokenWithIndex( ANTLR_USE_NAMESPACE(std)ostream& o ) : out(o) {}
		void operator() ( const RefTokenWithIndex& t ) {
			out << "[txt='" << t->getText() << "' tp=" << t->getType() << " idx=" << t->getIndex() << "]\n";
		}
		ANTLR_USE_NAMESPACE(std)ostream& out;
	};
}

TokenStreamRewriteEngine::TokenStreamRewriteEngine(TokenStream& upstream)
: stream(upstream)
, index(MIN_TOKEN_INDEX)
, tokens()
, programs()
, discardMask()
{
}

TokenStreamRewriteEngine::TokenStreamRewriteEngine(TokenStream& upstream, size_t initialSize )
: stream(upstream)
, index(MIN_TOKEN_INDEX)
, tokens(initialSize)
, programs()
, discardMask()
{
}

RefToken TokenStreamRewriteEngine::nextToken( void )
{
	RefTokenWithIndex t;
	// suck tokens until end of stream or we find a non-discarded token
	do {
		t = RefTokenWithIndex(stream.nextToken());
		if ( t )
		{
			t->setIndex(index);  // what is t's index in list?
			if ( t->getType() != Token::EOF_TYPE ) {
				tokens.push_back(t);  // track all tokens except EOF
			}
			index++;			// move to next position
		}
	} while ( t && discardMask.member(t->getType()) );
	return RefToken(t);
}

void TokenStreamRewriteEngine::rollback( const std::string& programName,
													  size_t instructionIndex )
{
	program_map::iterator rewrite = programs.find(programName);
	if( rewrite != programs.end() )
	{
		operation_list& prog = rewrite->second;
		operation_list::iterator
			j = prog.begin(),
			end = prog.end();

		std::advance(j,instructionIndex);
		if( j != end )
			prog.erase(j, end);
	}
}

void TokenStreamRewriteEngine::originalToStream( std::ostream& out,
																 size_t start,
																 size_t end ) const
{
	token_list::const_iterator s = tokens.begin();
	std::advance( s, start );
	token_list::const_iterator e = s;
	std::advance( e, end-start );
	std::for_each( s, e, tokenToStream(out) );
}

void TokenStreamRewriteEngine::toStream( std::ostream& out,
													  const std::string& programName,
													  size_t firstToken,
													  size_t lastToken ) const
{
	if( tokens.size() == 0 )
		return;

	program_map::const_iterator rewriter = programs.find(programName);

	if ( rewriter == programs.end() )
		return;

	// get the prog and some iterators in it...
	const operation_list& prog = rewriter->second;
	operation_list::const_iterator
		rewriteOpIndex = prog.begin(),
		rewriteOpEnd = prog.end();

	size_t tokenCursor = firstToken;
	// make sure we don't run out of the tokens we have...
	if( lastToken > (tokens.size() - 1) )
		lastToken = tokens.size() - 1;

		while ( tokenCursor <= lastToken )
		{
//			std::cout << "tokenCursor = " << tokenCursor << " first prog index = " << (*rewriteOpIndex)->getIndex() << std::endl;

			if( rewriteOpIndex != rewriteOpEnd )
			{
				size_t up_to_here = std::min(lastToken,(*rewriteOpIndex)->getIndex());
				while( tokenCursor < up_to_here )
					out << tokens[tokenCursor++]->getText();
			}
			while ( rewriteOpIndex != rewriteOpEnd &&
					  tokenCursor == (*rewriteOpIndex)->getIndex() &&
					  tokenCursor <= lastToken )
			{
				tokenCursor = (*rewriteOpIndex)->execute(out);
				++rewriteOpIndex;
			}
			if( tokenCursor <= lastToken )
				out << tokens[tokenCursor++]->getText();
		}
	// std::cout << "Handling tail operations # left = " << std::distance(rewriteOpIndex,rewriteOpEnd) << std::endl;
	// now see if there are operations (append) beyond last token index
	std::for_each( rewriteOpIndex, rewriteOpEnd, executeOperation(out) );
	rewriteOpIndex = rewriteOpEnd;
}

void TokenStreamRewriteEngine::toDebugStream( std::ostream& out,
															 size_t start,
															 size_t end ) const
{
	token_list::const_iterator s = tokens.begin();
	std::advance( s, start );
	token_list::const_iterator e = s;
	std::advance( e, end-start );
	std::for_each( s, e, dumpTokenWithIndex(out) );
}

void TokenStreamRewriteEngine::addToSortedRewriteList( const std::string& programName,
																		 RewriteOperation* op )
{
	program_map::iterator rewrites = programs.find(programName);
	// check if we got the program already..
	if ( rewrites == programs.end() )
	{
		// no prog make a new one...
		operation_list ops;
		ops.push_back(op);
		programs.insert(std::make_pair(programName,ops));
		return;
	}
	operation_list& prog = rewrites->second;

	if( prog.empty() )
	{
		prog.push_back(op);
		return;
	}

	operation_list::iterator i, end = prog.end();
	i = end;
	--i;
	// if at or beyond last op's index, just append
	if ( op->getIndex() >= (*i)->getIndex() ) {
		prog.push_back(op); // append to list of operations
		return;
	}
	i = prog.begin();

	if( i != end )
	{
		operation_list::iterator pos = std::upper_bound( i, end, op, compareOperationIndex() );
		prog.insert(pos,op);
	}
	else
		prog.push_back(op);
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/CommonASTWithHiddenTokens.cpp0000644000175000017500000000346610522211615022370 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/CommonASTWithHiddenTokens.cpp#2 $
 */
#include "antlr/config.hpp"
#include "antlr/AST.hpp"
#include "antlr/BaseAST.hpp"
#include "antlr/CommonAST.hpp"
#include "antlr/CommonASTWithHiddenTokens.hpp"
#include "antlr/CommonHiddenStreamToken.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

const char* const CommonASTWithHiddenTokens::TYPE_NAME = "CommonASTWithHiddenTokens";
// RK: Do not put constructor and destructor into the header file here..
// this triggers something very obscure in gcc 2.95.3 (and 3.0)
// missing vtables and stuff.
// Although this may be a problem with with binutils.
CommonASTWithHiddenTokens::CommonASTWithHiddenTokens()
: CommonAST()
{
}

CommonASTWithHiddenTokens::~CommonASTWithHiddenTokens()
{
}

void CommonASTWithHiddenTokens::initialize(int t,const ANTLR_USE_NAMESPACE(std)string& txt)
{
	CommonAST::initialize(t,txt);
}

void CommonASTWithHiddenTokens::initialize(RefAST t)
{
	CommonAST::initialize(t);
	hiddenBefore = RefCommonASTWithHiddenTokens(t)->getHiddenBefore();
	hiddenAfter = RefCommonASTWithHiddenTokens(t)->getHiddenAfter();
}

void CommonASTWithHiddenTokens::initialize(RefToken t)
{
	CommonAST::initialize(t);
	hiddenBefore = static_cast(t.get())->getHiddenBefore();
	hiddenAfter = static_cast(t.get())->getHiddenAfter();
}

RefAST CommonASTWithHiddenTokens::factory()
{
	return RefAST(new CommonASTWithHiddenTokens);
}

RefAST CommonASTWithHiddenTokens::clone( void ) const
{
	CommonASTWithHiddenTokens *ast = new CommonASTWithHiddenTokens( *this );
	return RefAST(ast);
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/CommonToken.cpp0000644000175000017500000000163510522211615017661 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/CommonToken.cpp#2 $
 */

#include "antlr/CommonToken.hpp"
#include "antlr/String.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

CommonToken::CommonToken() : Token(), line(1), col(1), text("")
{}

CommonToken::CommonToken(int t, const ANTLR_USE_NAMESPACE(std)string& txt)
: Token(t)
, line(1)
, col(1)
, text(txt)
{}

CommonToken::CommonToken(const ANTLR_USE_NAMESPACE(std)string& s)
: Token()
, line(1)
, col(1)
, text(s)
{}

ANTLR_USE_NAMESPACE(std)string CommonToken::toString() const
{
	return "[\""+getText()+"\",<"+getType()+">,line="+getLine()+",column="+getColumn()+"]";
}

RefToken CommonToken::factory()
{
	return RefToken(new CommonToken);
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

antlr-2.7.7/lib/cpp/src/MismatchedTokenException.cpp0000644000175000017500000001246510522211615022371 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/MismatchedTokenException.cpp#2 $
 */

#include "antlr/MismatchedTokenException.hpp"
#include "antlr/String.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

MismatchedTokenException::MismatchedTokenException()
  : RecognitionException("Mismatched Token: expecting any AST node","",-1,-1)
  , token(0)
  , node(nullASTptr)
  , tokenNames(0)
  , numTokens(0)
{
}

// Expected range / not range
MismatchedTokenException::MismatchedTokenException(
	const char* const* tokenNames_,
	const int numTokens_,
	RefAST node_,
	int lower,
	int upper_,
	bool matchNot
) : RecognitionException("Mismatched Token","",-1,-1)
  , token(0)
  , node(node_)
  , tokenText( (node_ ? node_->toString(): ANTLR_USE_NAMESPACE(std)string("")) )
  , mismatchType(matchNot ? NOT_RANGE : RANGE)
  , expecting(lower)
  , upper(upper_)
  , tokenNames(tokenNames_)
  , numTokens(numTokens_)
{
}

// Expected token / not token
MismatchedTokenException::MismatchedTokenException(
	const char* const* tokenNames_,
	const int numTokens_,
	RefAST node_,
	int expecting_,
	bool matchNot
) : RecognitionException("Mismatched Token","",-1,-1)
  , token(0)
  , node(node_)
  , tokenText( (node_ ? node_->toString(): ANTLR_USE_NAMESPACE(std)string("")) )
  , mismatchType(matchNot ? NOT_TOKEN : TOKEN)
  , expecting(expecting_)
  , tokenNames(tokenNames_)
  , numTokens(numTokens_)
{
}

// Expected BitSet / not BitSet
MismatchedTokenException::MismatchedTokenException(
	const char* const* tokenNames_,
	const int numTokens_,
	RefAST node_,
	BitSet set_,
	bool matchNot
) : RecognitionException("Mismatched Token","",-1,-1)
  , token(0)
  , node(node_)
  , tokenText( (node_ ? node_->toString(): ANTLR_USE_NAMESPACE(std)string("")) )
  , mismatchType(matchNot ? NOT_SET : SET)
  , set(set_)
  , tokenNames(tokenNames_)
  , numTokens(numTokens_)
{
}

// Expected range / not range
MismatchedTokenException::MismatchedTokenException(
	const char* const* tokenNames_,
	const int numTokens_,
	RefToken token_,
	int lower,
	int upper_,
	bool matchNot,
	const ANTLR_USE_NAMESPACE(std)string& fileName_
) : RecognitionException("Mismatched Token",fileName_,token_->getLine(),token_->getColumn())
  , token(token_)
  , node(nullASTptr)
  , tokenText(token_->getText())
  , mismatchType(matchNot ? NOT_RANGE : RANGE)
  , expecting(lower)
  , upper(upper_)
  , tokenNames(tokenNames_)
  , numTokens(numTokens_)
{
}

// Expected token / not token
MismatchedTokenException::MismatchedTokenException(
	const char* const* tokenNames_,
	const int numTokens_,
	RefToken token_,
	int expecting_,
	bool matchNot,
	const ANTLR_USE_NAMESPACE(std)string& fileName_
) : RecognitionException("Mismatched Token",fileName_,token_->getLine(),token_->getColumn())
  , token(token_)
  , node(nullASTptr)
  , tokenText(token_->getText())
  , mismatchType(matchNot ? NOT_TOKEN : TOKEN)
  , expecting(expecting_)
  , tokenNames(tokenNames_)
  , numTokens(numTokens_)
{
}

// Expected BitSet / not BitSet
MismatchedTokenException::MismatchedTokenException(
	const char* const* tokenNames_,
	const int numTokens_,
	RefToken token_,
	BitSet set_,
	bool matchNot,
	const ANTLR_USE_NAMESPACE(std)string& fileName_
) : RecognitionException("Mismatched Token",fileName_,token_->getLine(),token_->getColumn())
  , token(token_)
  , node(nullASTptr)
  , tokenText(token_->getText())
  , mismatchType(matchNot ? NOT_SET : SET)
  , set(set_)
  , tokenNames(tokenNames_)
  , numTokens(numTokens_)
{
}

ANTLR_USE_NAMESPACE(std)string MismatchedTokenException::getMessage() const
{
	ANTLR_USE_NAMESPACE(std)string s;
	switch (mismatchType) {
	case TOKEN:
		s += "expecting " + tokenName(expecting) + ", found '" + tokenText + "'";
		break;
	case NOT_TOKEN:
		s += "expecting anything but " + tokenName(expecting) + "; got it anyway";
		break;
	case RANGE:
		s += "expecting token in range: " + tokenName(expecting) + ".." + tokenName(upper) + ", found '" + tokenText + "'";
		break;
	case NOT_RANGE:
		s += "expecting token NOT in range: " + tokenName(expecting) + ".." + tokenName(upper) + ", found '" + tokenText + "'";
		break;
	case SET:
	case NOT_SET:
		{
			s += ANTLR_USE_NAMESPACE(std)string("expecting ") + (mismatchType == NOT_SET ? "NOT " : "") + "one of (";
			ANTLR_USE_NAMESPACE(std)vector elems = set.toArray();
			for ( unsigned int i = 0; i < elems.size(); i++ )
			{
				s += " ";
				s += tokenName(elems[i]);
			}
			s += "), found '" + tokenText + "'";
		}
		break;
	default:
		s = RecognitionException::getMessage();
		break;
	}
	return s;
}

ANTLR_USE_NAMESPACE(std)string MismatchedTokenException::tokenName(int tokenType) const
{
	if (tokenType == Token::INVALID_TYPE)
		return "";
	else if (tokenType < 0 || tokenType >= numTokens)
		return ANTLR_USE_NAMESPACE(std)string("<") + tokenType + ">";
	else
		return tokenNames[tokenType];
}

#ifndef NO_STATIC_CONSTS
const int MismatchedTokenException::TOKEN;
const int MismatchedTokenException::NOT_TOKEN;
const int MismatchedTokenException::RANGE;
const int MismatchedTokenException::NOT_RANGE;
const int MismatchedTokenException::SET;
const int MismatchedTokenException::NOT_SET;
#endif

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/Parser.cpp0000644000175000017500000000652210522211615016664 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/Parser.cpp#2 $
 */

#include "antlr/Parser.hpp"

#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** A generic ANTLR parser (LL(k) for k>=1) containing a bunch of
 * utility routines useful at any lookahead depth.  We distinguish between
 * the LL(1) and LL(k) parsers because of efficiency.  This may not be
 * necessary in the near future.
 *
 * Each parser object contains the state of the parse including a lookahead
 * cache (the form of which is determined by the subclass), whether or
 * not the parser is in guess mode, where tokens come from, etc...
 *
 * 

 * During guess mode, the current lookahead token(s) and token type(s)
 * cache must be saved because the token stream may not have been informed
 * to save the token (via mark) before the try block.
 * Guessing is started by:
 * 
    
 * 
  1. saving the lookahead cache.
 * 
  2. marking the current position in the TokenBuffer.
 * 
  3. increasing the guessing level.
 * 

 *
 * After guessing, the parser state is restored by:
 * 
    
 * 
  1. restoring the lookahead cache.
 * 
  2. rewinding the TokenBuffer.
 * 
  3. decreasing the guessing level.
 * 

 *
 * @see antlr.Token
 * @see antlr.TokenBuffer
 * @see antlr.TokenStream
 * @see antlr.LL1Parser
 * @see antlr.LLkParser
 */

bool DEBUG_PARSER = false;

/** Parser error-reporting function can be overridden in subclass */
void Parser::reportError(const RecognitionException& ex)
{
	ANTLR_USE_NAMESPACE(std)cerr << ex.toString().c_str() << ANTLR_USE_NAMESPACE(std)endl;
}

/** Parser error-reporting function can be overridden in subclass */
void Parser::reportError(const ANTLR_USE_NAMESPACE(std)string& s)
{
	if ( getFilename()=="" )
		ANTLR_USE_NAMESPACE(std)cerr << "error: " << s.c_str() << ANTLR_USE_NAMESPACE(std)endl;
	else
		ANTLR_USE_NAMESPACE(std)cerr << getFilename().c_str() << ": error: " << s.c_str() << ANTLR_USE_NAMESPACE(std)endl;
}

/** Parser warning-reporting function can be overridden in subclass */
void Parser::reportWarning(const ANTLR_USE_NAMESPACE(std)string& s)
{
	if ( getFilename()=="" )
		ANTLR_USE_NAMESPACE(std)cerr << "warning: " << s.c_str() << ANTLR_USE_NAMESPACE(std)endl;
	else
		ANTLR_USE_NAMESPACE(std)cerr << getFilename().c_str() << ": warning: " << s.c_str() << ANTLR_USE_NAMESPACE(std)endl;
}

/** Set or change the input token buffer */
//	void setTokenBuffer(TokenBuffer* t);

void Parser::traceIndent()
{
	for( int i = 0; i < traceDepth; i++ )
		ANTLR_USE_NAMESPACE(std)cout << " ";
}

void Parser::traceIn(const char* rname)
{
	traceDepth++;

	for( int i = 0; i < traceDepth; i++ )
		ANTLR_USE_NAMESPACE(std)cout << " ";

	ANTLR_USE_NAMESPACE(std)cout << "> " << rname
		<< "; LA(1)==" << LT(1)->getText().c_str()
		<<	((inputState->guessing>0)?" [guessing]":"")
		<< ANTLR_USE_NAMESPACE(std)endl;
}

void Parser::traceOut(const char* rname)
{
	for( int i = 0; i < traceDepth; i++ )
		ANTLR_USE_NAMESPACE(std)cout << " ";

	ANTLR_USE_NAMESPACE(std)cout << "< " << rname
		<< "; LA(1)==" << LT(1)->getText().c_str()
		<<	((inputState->guessing>0)?" [guessing]":"")
		<< ANTLR_USE_NAMESPACE(std)endl;

	traceDepth--;
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/dll.cpp0000644000175000017500000002370510522211615016205 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id:$
 */

/*
 * DLL stub for MSVC++. Based upon versions of Stephen Naughton and Michael
 * T. Richter
 */

// RK: Uncommented by instruction of Alexander Lenski
//#if _MSC_VER > 1000
//# pragma once
//#endif // _MSC_VER > 1000

// Exclude rarely-used stuff from Windows headers
#define WIN32_LEAN_AND_MEAN

#include 

#if defined( _MSC_VER ) && ( _MSC_VER < 1300 )
# error "DLL Build not supported on old MSVC's"
// Ok it seems to be possible with STLPort in stead of the vanilla MSVC STL
// implementation. This needs some work though. (and don't try it if you're
// not that familiar with compilers/building C++ DLL's in windows)
#endif

#include 
#include "antlr/config.hpp"
#include "antlr/Token.hpp"
#include "antlr/CircularQueue.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

// Take care of necessary implicit instantiations of templates from STL

// This should take care of MSVC 7.0
#if defined( _MSC_VER ) && ( _MSC_VER == 1300 )

// these come from AST.hpp
template class ANTLR_API ASTRefCount< AST >;
template class ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< RefAST >;
template class ANTLR_API ANTLR_USE_NAMESPACE(std)vector< RefAST >;
//template ANTLR_API int operator<( ASTRefCount< AST >, ASTRefCount< AST > );

// ASTFactory.hpp
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< factory_descriptor_* >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const char*, factory_type_ > >;
template struct ANTLR_API ANTLR_USE_NAMESPACE(std)pair< const char*, factory_type_ >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Vector_val< factory_descriptor_*, ANTLR_USE_NAMESPACE(std)allocator< factory_descriptor_* > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)vector< factory_descriptor_* >;

// BitSet.hpp
template class ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< bool >;
template class ANTLR_API ANTLR_USE_NAMESPACE(std)_Vector_val< bool, ANTLR_USE_NAMESPACE(std)allocator< bool > >;
template class ANTLR_API ANTLR_USE_NAMESPACE(std)vector< bool >;

// CharScanner.hpp
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< ANTLR_USE_NAMESPACE(std)string, int > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, int > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)_Tree_nod< ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, int, CharScannerLiteralsLess, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, int > >, false > >::_Node >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)_Tree_ptr< ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, int, CharScannerLiteralsLess, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, int > >, false > >::_Nodeptr >;
template struct ANTLR_API ANTLR_USE_NAMESPACE(std)pair< ANTLR_USE_NAMESPACE(std)string, int >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, int, CharScannerLiteralsLess, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, int > >,false >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Tree_nod< ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, int, CharScannerLiteralsLess, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, int > >,false > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Tree_ptr< ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, int, CharScannerLiteralsLess, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, int > >,false > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Tree_val< ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, int, CharScannerLiteralsLess, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, int > >,false > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Tree< ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, int, CharScannerLiteralsLess, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, int > >,false > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)map< ANTLR_USE_NAMESPACE(std)string, int, CharScannerLiteralsLess >;

// CircularQueue.hpp
// RK: it might well be that a load of these ints need to be unsigned ints
//  (made some more stuff unsigned)
template class ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< int >;
template class ANTLR_API ANTLR_USE_NAMESPACE(std)_Vector_val< int, ANTLR_USE_NAMESPACE(std)allocator< int > >;
template class ANTLR_API ANTLR_USE_NAMESPACE(std)vector< int >;
template class ANTLR_API ANTLR_USE_NAMESPACE(std)vector< int, ANTLR_USE_NAMESPACE(std)allocator< int > >;
//  template ANTLR_API inline int CircularQueue< int >::entries() const;

template class ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< RefToken >;
template class ANTLR_API ANTLR_USE_NAMESPACE(std)_Vector_val< RefToken, ANTLR_USE_NAMESPACE(std)allocator< RefToken > >;
template class ANTLR_API ANTLR_USE_NAMESPACE(std)vector< RefToken >;
template class ANTLR_API ANTLR_USE_NAMESPACE(std)vector< RefToken, ANTLR_USE_NAMESPACE(std)allocator< RefToken > >;
//  template ANTLR_API inline int CircularQueue< RefToken >::entries() const;

// CommonAST.hpp
template class ANTLR_API ASTRefCount< CommonAST >;

// CommonASTWithHiddenTokenTypes.hpp
template class ANTLR_API ASTRefCount< CommonASTWithHiddenTokens >;

// LexerSharedInputState.hpp
template class ANTLR_API RefCount< LexerInputState >;

// ParserSharedInputState.hpp
template class ANTLR_API RefCount< ParserInputState >;

// TokenStreamSelector.hpp
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< ANTLR_USE_NAMESPACE(std)string, TokenStream* > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, TokenStream* > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)_Tree_nod< ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, TokenStream*, ANTLR_USE_NAMESPACE(std)less< ANTLR_USE_NAMESPACE(std)string >, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, TokenStream* > >, false > >::_Node >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)_Tree_ptr< ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, TokenStream*, ANTLR_USE_NAMESPACE(std)less< ANTLR_USE_NAMESPACE(std)string >, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, TokenStream* > >, false > >::_Nodeptr >;
template struct ANTLR_API ANTLR_USE_NAMESPACE(std)pair< ANTLR_USE_NAMESPACE(std)string, TokenStream* >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, TokenStream*, ANTLR_USE_NAMESPACE(std)less< ANTLR_USE_NAMESPACE(std)string >, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, TokenStream* > >,false >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Tree_nod< ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, TokenStream*, ANTLR_USE_NAMESPACE(std)less< ANTLR_USE_NAMESPACE(std)string >, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, TokenStream* > >,false > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Tree_ptr< ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, TokenStream*, ANTLR_USE_NAMESPACE(std)less< ANTLR_USE_NAMESPACE(std)string >, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, TokenStream* > >,false > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Tree_val< ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, TokenStream*, ANTLR_USE_NAMESPACE(std)less< ANTLR_USE_NAMESPACE(std)string >, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, TokenStream* > >,false > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Tree< ANTLR_USE_NAMESPACE(std)_Tmap_traits< ANTLR_USE_NAMESPACE(std)string, TokenStream*, ANTLR_USE_NAMESPACE(std)less< ANTLR_USE_NAMESPACE(std)string >, ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)pair< const ANTLR_USE_NAMESPACE(std)string, TokenStream* > >,false > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)map< ANTLR_USE_NAMESPACE(std)string, TokenStream* >;

template class  ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< TokenStream* >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)allocator< ANTLR_USE_NAMESPACE(std)_Deque_map< TokenStream* , ANTLR_USE_NAMESPACE(std)allocator< TokenStream* > >::_Tptr >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Deque_map< TokenStream*, ANTLR_USE_NAMESPACE(std)allocator< TokenStream* > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)_Deque_val< TokenStream*, ANTLR_USE_NAMESPACE(std)allocator< TokenStream* > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)deque< TokenStream*, ANTLR_USE_NAMESPACE(std)allocator< TokenStream* > >;
template class  ANTLR_API ANTLR_USE_NAMESPACE(std)stack< TokenStream*, ANTLR_USE_NAMESPACE(std)deque >;

#elif  defined( _MSC_VER ) && ( _MSC_VER == 1310 )
// Instantiations for MSVC 7.1
template class ANTLR_API CircularQueue< int >;
template class ANTLR_API CircularQueue< RefToken >;

// #else future msvc's

#endif

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

BOOL APIENTRY DllMain( HANDLE hModule, DWORD  ul_reason_for_call, LPVOID lpReserved )
{
	return TRUE;
}
antlr-2.7.7/lib/cpp/src/ASTNULLType.cpp0000644000175000017500000000421610522211615017412 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id:$
 */

#include "antlr/config.hpp"
#include "antlr/AST.hpp"
#include "antlr/ASTNULLType.hpp"

#include 

ANTLR_USING_NAMESPACE(std)

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

RefAST ASTNULLType::clone( void ) const
{
	return RefAST(this);
}

void ASTNULLType::addChild( RefAST )
{
}

size_t ASTNULLType::getNumberOfChildren() const
{
	return 0;
}

bool ASTNULLType::equals( RefAST ) const
{
	return false;
}

bool ASTNULLType::equalsList( RefAST ) const
{
	return false;
}

bool ASTNULLType::equalsListPartial( RefAST ) const
{
	return false;
}

bool ASTNULLType::equalsTree( RefAST ) const
{
	return false;
}

bool ASTNULLType::equalsTreePartial( RefAST ) const
{
	return false;
}

vector ASTNULLType::findAll( RefAST )
{
	return vector();
}

vector ASTNULLType::findAllPartial( RefAST )
{
	return vector();
}

RefAST ASTNULLType::getFirstChild() const
{
	return this;
}

RefAST ASTNULLType::getNextSibling() const
{
	return this;
}

string ASTNULLType::getText() const
{
	return "";
}

int ASTNULLType::getType() const
{
	return Token::NULL_TREE_LOOKAHEAD;
}

void ASTNULLType::initialize( int, const string& )
{
}

void ASTNULLType::initialize( RefAST )
{
}

void ASTNULLType::initialize( RefToken )
{
}

#ifdef ANTLR_SUPPORT_XML
void ASTNULLType::initialize( istream& )
{
}
#endif

void ASTNULLType::setFirstChild( RefAST )
{
}

void ASTNULLType::setNextSibling( RefAST )
{
}

void ASTNULLType::setText( const string& )
{
}

void ASTNULLType::setType( int )
{
}

string ASTNULLType::toString() const
{
	return getText();
}

string ASTNULLType::toStringList() const
{
	return getText();
}

string ASTNULLType::toStringTree() const
{
	return getText();
}

#ifdef ANTLR_SUPPORT_XML
bool ASTNULLType::attributesToStream( ostream& ) const
{
	return false;
}

void ASTNULLType::toStream( ostream& out ) const
{
	out << "" << endl;
}
#endif

const char* ASTNULLType::typeName( void ) const
{
	return "ASTNULLType";
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/CharBuffer.cpp0000644000175000017500000000261210522211615017433 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/CharBuffer.cpp#2 $
 */

#include "antlr/CharBuffer.hpp"
#include 

//#include 

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/* RK: Per default istream does not throw exceptions. This can be
 * enabled with:
 * stream.exceptions(ios_base::badbit|ios_base::failbit|ios_base::eofbit);
 *
 * We could try catching the bad/fail stuff. But handling eof via this is
 * not a good idea. EOF is best handled as a 'normal' character.
 *
 * So this does not work yet with gcc... Comment it until I get to a platform
 * that does..
 */

/** Create a character buffer. Enable fail and bad exceptions, if supported
 * by platform. */
CharBuffer::CharBuffer(ANTLR_USE_NAMESPACE(std)istream& input_)
: input(input_)
{
//	input.exceptions(ANTLR_USE_NAMESPACE(std)ios_base::badbit|
//						  ANTLR_USE_NAMESPACE(std)ios_base::failbit);
}

/** Get the next character from the stream. May throw CharStreamIOException
 * when something bad happens (not EOF) (if supported by platform).
 */
int CharBuffer::getChar()
{
//	try {
		return input.get();
//	}
//	catch (ANTLR_USE_NAMESPACE(std)ios_base::failure& e) {
//		throw CharStreamIOException(e);
//	}
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/src/ASTFactory.cpp0000644000175000017500000003010510522211615017401 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/ASTFactory.cpp#2 $
 */

#include "antlr/CommonAST.hpp"
#include "antlr/ANTLRException.hpp"
#include "antlr/IOException.hpp"
#include "antlr/ASTFactory.hpp"
#include "antlr/ANTLRUtil.hpp"

#include 
#include 

using namespace std;

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** AST Support code shared by TreeParser and Parser.
 * We use delegation to share code (and have only one
 * bit of code to maintain) rather than subclassing
 * or superclassing (forces AST support code to be
 * loaded even when you don't want to do AST stuff).
 *
 * This class collects all factories of AST types used inside the code.
 * New AST node types are registered with the registerFactory method.
 * On creation of an ASTFactory object a default AST node factory may be
 * specified.
 *
 * When registering types gaps between different types are filled with entries
 * for the default factory.
 */

/// Initialize factory
ASTFactory::ASTFactory()
: default_factory_descriptor(ANTLR_USE_NAMESPACE(std)make_pair(CommonAST::TYPE_NAME,&CommonAST::factory))
{
	nodeFactories.resize( Token::MIN_USER_TYPE, &default_factory_descriptor );
}

/** Initialize factory with a non default node type.
 * factory_node_name should be the name of the AST node type the factory
 * generates. (should exist during the existance of this ASTFactory instance)
 */
ASTFactory::ASTFactory( const char* factory_node_name, factory_type fact )
: default_factory_descriptor(ANTLR_USE_NAMESPACE(std)make_pair(factory_node_name, fact))
{
	nodeFactories.resize( Token::MIN_USER_TYPE, &default_factory_descriptor );
}

/// Delete ASTFactory
ASTFactory::~ASTFactory()
{
	factory_descriptor_list::iterator i = nodeFactories.begin();

	while( i != nodeFactories.end() )
	{
		if( *i != &default_factory_descriptor )
			delete *i;
		i++;
	}
}

/// Register a factory for a given AST type
void ASTFactory::registerFactory( int type, const char* ast_name, factory_type factory )
{
	// check validity of arguments...
	if( type < Token::MIN_USER_TYPE )
		throw ANTLRException("Internal parser error invalid type passed to RegisterFactory");
	if( factory == 0 )
		throw ANTLRException("Internal parser error 0 factory passed to RegisterFactory");

	// resize up to and including 'type' and initalize any gaps to default
	// factory.
	if( nodeFactories.size() < (static_cast(type)+1) )
		nodeFactories.resize( type+1, &default_factory_descriptor );

	// And add new thing..
	nodeFactories[type] = new ANTLR_USE_NAMESPACE(std)pair( ast_name, factory );
}

void ASTFactory::setMaxNodeType( int type )
{
	if( nodeFactories.size() < (static_cast(type)+1) )
		nodeFactories.resize( type+1, &default_factory_descriptor );
}

/** Create a new empty AST node; if the user did not specify
 *  an AST node type, then create a default one: CommonAST.
 */
RefAST ASTFactory::create()
{
	RefAST node = nodeFactories[0]->second();
	node->setType(Token::INVALID_TYPE);
	return node;
}

RefAST ASTFactory::create(int type)
{
	RefAST t = nodeFactories[type]->second();
	t->initialize(type,"");
	return t;
}

RefAST ASTFactory::create(int type, const ANTLR_USE_NAMESPACE(std)string& txt)
{
	RefAST t = nodeFactories[type]->second();
	t->initialize(type,txt);
	return t;
}

#ifdef ANTLR_SUPPORT_XML
RefAST ASTFactory::create(const ANTLR_USE_NAMESPACE(std)string& type_name, ANTLR_USE_NAMESPACE(std)istream& infile )
{
	factory_descriptor_list::iterator fact = nodeFactories.begin();

	while( fact != nodeFactories.end() )
	{
		if( type_name == (*fact)->first )
		{
			RefAST t = (*fact)->second();
			t->initialize(infile);
			return t;
		}
		fact++;
	}

	string error = "ASTFactory::create: Unknown AST type '" + type_name + "'";
	throw ANTLRException(error);
}
#endif

/** Create a new empty AST node; if the user did not specify
 *  an AST node type, then create a default one: CommonAST.
 */
RefAST ASTFactory::create(RefAST tr)
{
	if (!tr)
		return nullAST;

//	cout << "create(tr)" << endl;

	RefAST t = nodeFactories[tr->getType()]->second();
	t->initialize(tr);
	return t;
}

RefAST ASTFactory::create(RefToken tok)
{
//	cout << "create( tok="<< tok->getType() << ", " << tok->getText() << ")" << nodeFactories.size() << endl;
	RefAST t = nodeFactories[tok->getType()]->second();
	t->initialize(tok);
	return t;
}

/** Add a child to the current AST */
void ASTFactory::addASTChild(ASTPair& currentAST, RefAST child)
{
	if (child)
	{
		if (!currentAST.root)
		{
			// Make new child the current root
			currentAST.root = child;
		}
		else
		{
			if (!currentAST.child)
			{
				// Add new child to current root
				currentAST.root->setFirstChild(child);
			}
			else
			{
				currentAST.child->setNextSibling(child);
			}
		}
		// Make new child the current child
		currentAST.child = child;
		currentAST.advanceChildToEnd();
	}
}

/** Deep copy a single node. This function the new clone() methods in the AST
 * interface. Returns nullAST if t is null.
 */
RefAST ASTFactory::dup(RefAST t)
{
	if( t )
		return t->clone();
	else
		return RefAST(nullASTptr);
}

/** Duplicate tree including siblings of root. */
RefAST ASTFactory::dupList(RefAST t)
{
	RefAST result = dupTree(t);         // if t == null, then result==null
	RefAST nt = result;

	while( t )
	{												// for each sibling of the root
		t = t->getNextSibling();
		nt->setNextSibling(dupTree(t));	// dup each subtree, building new tree
		nt = nt->getNextSibling();
	}
	return result;
}

/** Duplicate a tree, assuming this is a root node of a tree
 * duplicate that node and what's below; ignore siblings of root node.
 */
RefAST ASTFactory::dupTree(RefAST t)
{
	RefAST result = dup(t);		// make copy of root
	// copy all children of root.
	if( t )
		result->setFirstChild( dupList(t->getFirstChild()) );
	return result;
}

/** Make a tree from a list of nodes.  The first element in the
 * array is the root.  If the root is null, then the tree is
 * a simple list not a tree.  Handles null children nodes correctly.
 * For example, make(a, b, null, c) yields tree (a b c).  make(null,a,b)
 * yields tree (nil a b).
 */
RefAST ASTFactory::make(ANTLR_USE_NAMESPACE(std)vector& nodes)
{
	if ( nodes.size() == 0 )
		return RefAST(nullASTptr);

	RefAST root = nodes[0];
	RefAST tail = RefAST(nullASTptr);

	if( root )
		root->setFirstChild(RefAST(nullASTptr));	// don't leave any old pointers set

	// link in children;
	for( unsigned int i = 1; i < nodes.size(); i++ )
	{
		if ( nodes[i] == 0 )		// ignore null nodes
			continue;

		if ( root == 0 )			// Set the root and set it up for a flat list
			root = tail = nodes[i];
		else if ( tail == 0 )
		{
			root->setFirstChild(nodes[i]);
			tail = root->getFirstChild();
		}
		else
		{
			tail->setNextSibling(nodes[i]);
			tail = tail->getNextSibling();
		}

		if( tail )	// RK: I cannot fathom why this missing check didn't bite anyone else...
		{
			// Chase tail to last sibling
			while (tail->getNextSibling())
				tail = tail->getNextSibling();
		}
	}

	return root;
}

/** Make a tree from a list of nodes, where the nodes are contained
 * in an ASTArray object
 */
RefAST ASTFactory::make(ASTArray* nodes)
{
	RefAST ret = make(nodes->array);
	delete nodes;
	return ret;
}

/// Make an AST the root of current AST
void ASTFactory::makeASTRoot( ASTPair& currentAST, RefAST root )
{
	if (root)
	{
		// Add the current root as a child of new root
		root->addChild(currentAST.root);
		// The new current child is the last sibling of the old root
		currentAST.child = currentAST.root;
		currentAST.advanceChildToEnd();
		// Set the new root
		currentAST.root = root;
	}
}

void ASTFactory::setASTNodeFactory( const char* factory_node_name,
											   factory_type factory )
{
	default_factory_descriptor.first = factory_node_name;
	default_factory_descriptor.second = factory;
}

#ifdef ANTLR_SUPPORT_XML
bool ASTFactory::checkCloseTag( ANTLR_USE_NAMESPACE(std)istream& in )
{
	char ch;

	if( in.get(ch) )
	{
		if( ch == '<' )
		{
			char ch2;
			if( in.get(ch2) )
			{
				if( ch2 == '/' )
				{
					in.putback(ch2);
					in.putback(ch);
					return true;
				}
				in.putback(ch2);
				in.putback(ch);
				return false;
			}
		}
		in.putback(ch);
		return false;
	}
	return false;
}

void ASTFactory::loadChildren( ANTLR_USE_NAMESPACE(std)istream& infile,
										 RefAST current )
{
	char ch;

	for(;;)			// for all children of this node....
	{
		eatwhite(infile);

		infile.get(ch);	// '<'
		if( ch != '<' )
		{
			string error = "Invalid XML file... no '<' found (";
			error += ch + ")";
			throw IOException(error);
		}

		infile.get(ch);		// / or text....

		if( ch == '/' )		// check for close tag...
		{
			string temp;

			// read until '>' and see if it matches the open tag... if not trouble
			temp = read_identifier( infile );

			if( strcmp(temp.c_str(), current->typeName() ) != 0 )
			{
				string error = "Invalid XML file... close tag does not match start tag: ";
				error += current->typeName();
				error += " closed by " + temp;
				throw IOException(error);
			}

			infile.get(ch);	// must be a '>'

			if( ch != '>' )
			{
				string error = "Invalid XML file... no '>' found (";
				error += ch + ")";
				throw IOException(error);
			}
			// close tag => exit loop
			break;
		}

		// put our 'look ahead' back where it came from
		infile.putback(ch);
		infile.putback('<');

		// and recurse into the tree...
		RefAST child = LoadAST(infile);

		current->addChild( child );
	}
}

void ASTFactory::loadSiblings(ANTLR_USE_NAMESPACE(std)istream& infile,
										RefAST current )
{
	for(;;)
	{
		eatwhite(infile);

		if( infile.eof() )
			break;

		if( checkCloseTag(infile) )
			break;

		RefAST sibling = LoadAST(infile);
		current->setNextSibling(sibling);
	}
}

RefAST ASTFactory::LoadAST( ANTLR_USE_NAMESPACE(std)istream& infile )
{
	RefAST current = nullAST;
	char ch;

	eatwhite(infile);

	if( !infile.get(ch) )
		return nullAST;

	if( ch != '<' )
	{
		string error = "Invalid XML file... no '<' found (";
		error += ch + ")";
		throw IOException(error);
	}

	string ast_type = read_identifier(infile);

	// create the ast of type 'ast_type'
	current = create( ast_type, infile );
	if( current == nullAST )
	{
		string error = "Unsuported AST type: " + ast_type;
		throw IOException(error);
	}

	eatwhite(infile);

	infile.get(ch);

	// now if we have a '/' here it's a single node. If it's a '>' we get
	// a tree with children

	if( ch == '/' )
	{
		infile.get(ch);		// get the closing '>'
		if( ch != '>' )
		{
			string error = "Invalid XML file... no '>' found after '/' (";
			error += ch + ")";
			throw IOException(error);
		}

		// get the rest on this level
		loadSiblings( infile, current );

		return current;
	}

	// and finaly see if we got the close tag...
	if( ch != '>' )
	{
		string error = "Invalid XML file... no '>' found (";
		error += ch + ")";
		throw IOException(error);
	}

	// handle the ones below this level..
	loadChildren( infile, current );

	// load the rest on this level...
	loadSiblings( infile, current );

	return current;
}
#endif // ANTLR_SUPPORT_XML

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

/* Heterogeneous AST/XML-I/O ramblings...
 *
 * So there is some heterogeneous AST support....
 * basically in the code generators a new custom ast is generated without
 * going throug the factory. It also expects the RefXAST to be defined.
 *
 * Is it maybe better to register all AST types with the ASTFactory class
 * together with the respective factory methods.
 *
 * More and more I get the impression that hetero ast was a kindoff hack
 * on top of ANTLR's normal AST system.
 *
 * The heteroast stuff will generate trouble for all astFactory.create( ... )
 * invocations. Most of this is handled via getASTCreateString methods in the
 * codegenerator. At the moment getASTCreateString(GrammarAtom, String) has
 * slightly to little info to do it's job (ok the hack that is in now
 * works, but it's an ugly hack)
 *
 * An extra caveat is the 'nice' action.g thing. Which also judiciously calls
 * getASTCreateString methods because it handles the #( ... ) syntax.
 * And converts that to ASTFactory calls.
 *
 *
 */
antlr-2.7.7/lib/cpp/src/TokenStreamBasicFilter.cpp0000644000175000017500000000173410522211615021774 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/TokenStreamBasicFilter.cpp#2 $
 */
#include "antlr/TokenStreamBasicFilter.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

/** This object is a TokenStream that passes through all
 *  tokens except for those that you tell it to discard.
 *  There is no buffering of the tokens.
 */
TokenStreamBasicFilter::TokenStreamBasicFilter(TokenStream& input_)
: input(&input_)
{
}

void TokenStreamBasicFilter::discard(int ttype)
{
	discardMask.add(ttype);
}

void TokenStreamBasicFilter::discard(const BitSet& mask)
{
	discardMask = mask;
}

RefToken TokenStreamBasicFilter::nextToken()
{
	RefToken tok = input->nextToken();
	while ( tok && discardMask.member(tok->getType()) ) {
		tok = input->nextToken();
	}
	return tok;
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

antlr-2.7.7/lib/cpp/src/CharScanner.cpp0000644000175000017500000000576010522211615017622 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/CharScanner.cpp#2 $
 */

#include 

#include "antlr/CharScanner.hpp"
#include "antlr/CommonToken.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif
ANTLR_C_USING(exit)

CharScanner::CharScanner(InputBuffer& cb, bool case_sensitive )
	: saveConsumedInput(true) //, caseSensitiveLiterals(true)
	, caseSensitive(case_sensitive)
	, literals(CharScannerLiteralsLess(this))
	, inputState(new LexerInputState(cb))
	, commitToPath(false)
	, tabsize(8)
	, traceDepth(0)
{
	setTokenObjectFactory(&CommonToken::factory);
}

CharScanner::CharScanner(InputBuffer* cb, bool case_sensitive )
	: saveConsumedInput(true) //, caseSensitiveLiterals(true)
	, caseSensitive(case_sensitive)
	, literals(CharScannerLiteralsLess(this))
	, inputState(new LexerInputState(cb))
	, commitToPath(false)
	, tabsize(8)
	, traceDepth(0)
{
	setTokenObjectFactory(&CommonToken::factory);
}

CharScanner::CharScanner( const LexerSharedInputState& state, bool case_sensitive )
	: saveConsumedInput(true) //, caseSensitiveLiterals(true)
	, caseSensitive(case_sensitive)
	, literals(CharScannerLiteralsLess(this))
	, inputState(state)
	, commitToPath(false)
	, tabsize(8)
	, traceDepth(0)
{
	setTokenObjectFactory(&CommonToken::factory);
}

/** Report exception errors caught in nextToken() */
void CharScanner::reportError(const RecognitionException& ex)
{
	ANTLR_USE_NAMESPACE(std)cerr << ex.toString().c_str() << ANTLR_USE_NAMESPACE(std)endl;
}

/** Parser error-reporting function can be overridden in subclass */
void CharScanner::reportError(const ANTLR_USE_NAMESPACE(std)string& s)
{
	if (getFilename() == "")
		ANTLR_USE_NAMESPACE(std)cerr << "error: " << s.c_str() << ANTLR_USE_NAMESPACE(std)endl;
	else
		ANTLR_USE_NAMESPACE(std)cerr << getFilename().c_str() << ": error: " << s.c_str() << ANTLR_USE_NAMESPACE(std)endl;
}

/** Parser warning-reporting function can be overridden in subclass */
void CharScanner::reportWarning(const ANTLR_USE_NAMESPACE(std)string& s)
{
	if (getFilename() == "")
		ANTLR_USE_NAMESPACE(std)cerr << "warning: " << s.c_str() << ANTLR_USE_NAMESPACE(std)endl;
	else
		ANTLR_USE_NAMESPACE(std)cerr << getFilename().c_str() << ": warning: " << s.c_str() << ANTLR_USE_NAMESPACE(std)endl;
}

void CharScanner::traceIndent()
{
	for( int i = 0; i < traceDepth; i++ )
		ANTLR_USE_NAMESPACE(std)cout << " ";
}

void CharScanner::traceIn(const char* rname)
{
	traceDepth++;
	traceIndent();
	ANTLR_USE_NAMESPACE(std)cout << "> lexer " << rname
		<< "; c==" << LA(1) << ANTLR_USE_NAMESPACE(std)endl;
}

void CharScanner::traceOut(const char* rname)
{
	traceIndent();
	ANTLR_USE_NAMESPACE(std)cout << "< lexer " << rname
		<< "; c==" << LA(1) << ANTLR_USE_NAMESPACE(std)endl;
	traceDepth--;
}

#ifndef NO_STATIC_CONSTS
const int CharScanner::NO_CHAR;
const int CharScanner::EOF_CHAR;
#endif

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif

antlr-2.7.7/lib/cpp/src/NoViableAltForCharException.cpp0000644000175000017500000000210610522211615022706 0ustar  twernertwerner/* ANTLR Translator Generator
 * Project led by Terence Parr at http://www.jGuru.com
 * Software rights: http://www.antlr.org/license.html
 *
 * $Id: //depot/code/org.antlr/release/antlr-2.7.7/lib/cpp/src/NoViableAltForCharException.cpp#2 $
 */

#include "antlr/NoViableAltForCharException.hpp"
#include "antlr/String.hpp"

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
namespace antlr {
#endif

NoViableAltForCharException::NoViableAltForCharException(int c, CharScanner* scanner)
  : RecognitionException("NoViableAlt",
                         scanner->getFilename(),
								 scanner->getLine(),scanner->getColumn()),
    foundChar(c)
{
}

NoViableAltForCharException::NoViableAltForCharException(
					int c,
               const ANTLR_USE_NAMESPACE(std)string& fileName_,
					int line_, int column_)
  : RecognitionException("NoViableAlt",fileName_,line_,column_),
    foundChar(c)
{
}

ANTLR_USE_NAMESPACE(std)string NoViableAltForCharException::getMessage() const
{
	return ANTLR_USE_NAMESPACE(std)string("unexpected char: ")+charName(foundChar);
}

#ifdef ANTLR_CXX_SUPPORTS_NAMESPACE
}
#endif
antlr-2.7.7/lib/cpp/scripts/0000755000175000017500000000000010522211615015617 5ustar  twernertwernerantlr-2.7.7/lib/cpp/scripts/make_change_log.tcl0000755000175000017500000000227410522211615021416 0ustar  twernertwerner#!/bin/sh
# the next line restarts using tclsh \
exec tclsh8.3 $0 $*

# 
# Sort the (C++) changes recorded in the repository by change number and
# print them to stdout
#
set depots {//depot/code/org.antlr/dev/klaren.dev //depot/code/org.antlr/main/main }
set files { /lib/cpp/... /antlr/... }
set filespec ""
foreach depot $depots {
	foreach file $files {
		append filespec "$depot$file "
	}
}

puts stderr "Gettting changes from: $filespec"

catch {set file [open "|p4 changes -l $filespec" r]}

set cnt 0
set changes {}
set text ""
set change_nr -1

while {![eof $file]} {
	set line [gets $file]

	if { [regexp -- {^Change ([0-9]+).*$} $line dummy tmp] } {
		# append the number to the list of found changes
		lappend changes $tmp

		if { $change_nr != -1 } {
			# were already working on change..
			# so we have text to store..
			set description($change_nr) $text
		}

		# remember number...
		set change_nr $tmp
		# reinit text
		set text "[string trim $line]\n"
	} else {
		append text "   [string trim $line]\n"
	}
}

set description($change_nr) $text

catch {close $file}

set sorted_changes [lsort -unique -integer -decreasing $changes]

foreach change $sorted_changes {
	puts $description($change)
}
antlr-2.7.7/lib/cpp/scripts/cr_stripper.sh0000644000175000017500000000022110522211615020502 0ustar  twernertwerner#!/bin/sh
for f in antlr/*.hpp src/*.cpp; do
	cat "$f" | tr -d "\r" > $$
	cmp -s $$ "$f" || (p4 edit "$f" && mv $$ "$f" && echo "$f Fixed")
done
antlr-2.7.7/lib/cpp/ChangeLog0000644000175000017500000005735310522211615015717 0ustar  twernertwernerChange 499 on 2001/05/31 by klaren@klaren.hawking.dev

   - Ported action.g fixes from C++ to Java action.g. Warnings and errors
     in actions are now correctly reported in java mode as well.
   - Ported $lookaheadSet functionality to java mode.
   - Moved processActionForTreeSpecifiers from CodeGenerator.java to
     JavaCodeGenerator.java and made it abstract. Added setFileName call
     to it.
   - Added a lot of getLine's to calls of processActionForTreeSpecifiers in
     JavaCodegen.
   - Moved a number one liner methods to the header file for better inlining.
   - Added clear methods to the Queue type objects (java/C++).
   - Added reset methods to the Input/TokenBuffer objects (java/C++).
   - Added reset methods to the SharedInputState objects (java/C++).
   - Added to the C++ LexerSharedInputState an initialize function that
     reinitializes the thing with a new stream.
   - Added docu.

   - Bugfix: Initialized attribute filename a little bit earlier so error
	  message shows the filename in stead of 'null'.

Change 495 on 2001/05/31 by klaren@klaren.hawking.dev

   Added -h/-help/--help options. Adapted the year range in the copyright in
   the help message.

Change 494 on 2001/05/29 by klaren@klaren.hawking.dev

   Changed order of equals test a bit to be more efficient.

Change 493 on 2001/05/29 by klaren@klaren.hawking.dev

   Moved some methods a bit around to get better inlining.

Change 492 on 2001/05/22 by klaren@klaren.hawking.dev

   Dug up a mail from Bill Zheng about doxygen. Fixed a few things as a result.

Change 491 on 2001/05/22 by klaren@klaren.hawking.dev

   More tweaks for the ditching of the tokenNames vector. GNU C++ had some
   trouble with the previous incarnation.

Change 490 on 2001/05/21 by klaren@klaren.hawking.dev

   Changed all remaining "antlr/xxx.hpp" includes to  ones
   in the header files.

Change 489 on 2001/05/18 by klaren@klaren.hawking.dev

   Missed a few tracer class changes in this one. Also some missing
   virtuals fixed.

Change 488 on 2001/05/18 by klaren@klaren.hawking.dev

   Removed /** from license comments, they brought doxygen of track.
   Replaced ANTLR_BEGIN/END_NAMESPACE defines with a
   ANTLR_CXX_SUPPORTS_NAMESPACE macro, again for doxygen. Here and there some
   reformatting and reordering.

Change 487 on 2001/05/18 by klaren@klaren.hawking.dev

   Optimizations in Tracer classes (dumped string's). Removed setTokenNames
   from the support library. Switched tokenNames to use a char* array.
   Generate NUM_TOKENS attribute in parsers. Added getNumTokens methods to
   parsers. Changes in MismatchedTokenException to reflect the previous.

Change 486 on 2001/05/18 by klaren@klaren.hawking.dev

   Allow whitespace between $setxxx and following '('.

Change 485 on 2001/05/14 by klaren@klaren.hawking.dev

   And now really fix giving errors... stupid java *snicker*

Change 484 on 2001/05/14 by klaren@klaren.hawking.dev

   Allow whitespace between $setxxx and following '('.

Change 483 on 2001/05/14 by klaren@klaren.hawking.dev

   Give errors when target file/directory not writeable.

Change 482 on 2001/05/11 by klaren@klaren.hawking.dev

   Added config file for doxygen.

Change 480 on 2001/05/11 by klaren@klaren.hawking.dev

   Tagged a bug in the code. (heteroast trouble)

Change 479 on 2001/05/11 by klaren@klaren.hawking.dev

   Added Ernest Pasour's $lookaheadSet feature to the C++ codegen. (This
   needs to be ported to Java mode). Also cleaned up action.g's error
   reporting this should also be ported to java mode.

Change 476 on 2001/05/11 by klaren@klaren.hawking.dev

   More fixes for XML I/O. It's a bit tidier now. Some too advanced things
   removed (ios_base::failure). Embedding custom XML elements in the stream
   should be possible now.

Change 475 on 2001/05/08 by parrt@parrt.foggy

   made default charbuffer bigger per token.

Change 471 on 2001/04/26 by klaren@klaren.hawking.dev

   Bugfix: in case of a certain order of header actions (pre_include_xx etc.)
   one header action might overwrite another. Probably only affects C++.

Change 468 on 2001/03/22 by klaren@klaren.hawking.dev

   A few extra ANTLR_API's to make antlr.dll work from other dll's. Thanks
   to Ernest Passour.

Change 466 on 2001/03/15 by klaren@klaren.hawking.dev

   Fix from Emir Uner for KAI C++ cast string literal to 'const
   char*' for make_pair.

Change 465 on 2001/03/08 by klaren@klaren.hawking.dev

   Fix for bugreport from Emir Uner, static member const char *
   initializations are not standard compliant.

Change 464 on 2001/03/05 by klaren@klaren.hawking.dev

   Changes for XML input and output. Restructuring of ASTFactory and some
   fixes for heterogeneous AST's.

Change 463 on 2001/02/05 by klaren@klaren.hawking.dev

   Improved exception handling in trace routines of parser. Patch submitted
   by John Fremlin. Tracer class now catch exceptions from lexer. Fixed
   forgotten message in BitSet.cpp.

Change 462 on 2001/02/05 by klaren@klaren.hawking.dev

   Improved errormessage. Now says unexpected end of file and stuff like that.

Change 461 on 2001/01/31 by klaren@klaren.hawking.dev

   Changed the position of the init actions for (..)* (..)+ to just inside
   the loop handling the closure. This way we can check EOF conditions in the
   init action for each loop invocation.

Change 460 on 2001/01/31 by klaren@klaren.hawking.dev

   Fixed typo in error message.

Change 458 on 2001/01/17 by klaren@klaren.hawking.dev

   Removed dos newlines.

Change 457 on 2001/01/15 by klaren@klaren.hawking.dev

   Removed the superfluous '// line xxx' comments in genHashLines=false case.

Change 454 on 2001/01/11 by klaren@klaren.hawking.dev

   Updated the changelog and fixed buglet in changelog script.

Change 453 on 2001/01/11 by klaren@klaren.hawking.dev

   Tweaked the make_change_log script to include both my dev depot as well
   as the main branch.

Change 452 on 2001/01/11 by klaren@klaren.hawking.dev

   Changes to let ANTLR only overwrite a file if it really changes. (Mainly
   for C++ mode). With supporting changes in mkxxxjar batch files.

Change 451 on 2001/01/11 by klaren@klaren.hawking.dev

   Changed the charName in C++ mode and NoViableAltForCharException in java
   mode so that only printable characters are printed and non printable ones
   get 'hexdumped'.

Change 450 on 2001/01/10 by klaren@klaren.hawking.dev

   Fixed some typo's in javadoc comments.

Change 449 on 2001/01/08 by klaren@klaren.hawking.dev

   Removed StdAfx.h from the .dsp file.

Change 448 on 2001/01/08 by klaren@klaren.hawking.dev

   Added implementations for getLAChars and getMarkedChars.

Change 447 on 2001/01/05 by klaren@klaren.hawking.dev

   Small fix to the genBitSets method of CppCodeGenerator now the generated
   sets are also dumped for lexers.

Change 446 on 2000/12/18 by klaren@klaren.hawking.dev

   Changes for MSCV DLL building. Now also includes dsp/dsw files.
   Contributed by Stephen Naughton.

Change 444 on 2000/12/12 by klaren@klaren.hawking.dev

   Added  include. (Needed for new gcc version 2.97)

Change 441 on 2000/12/05 by klaren@klaren.hawking.dev

   Fixed problems with buggy tolower (truncating -1 (EOF) to 0xff)
   functions together with STLport/HPUX also reverted fix 422 since this
   one also catches that.

Change 440 on 2000/11/30 by klaren@klaren.hawking.dev

   Fixed typo in code generated for $setText.

Change 439 on 2000/11/22 by klaren@klaren.hawking.dev

   Few minor tweaks. And removed my name from the generated author section
   a bit too much copy'n'paste.

Change 438 on 2000/11/20 by klaren@klaren.hawking.dev

   Fixed bug with C/C++ preprocessor constructs (#if's etc). Also changed
   code generated for $setText to be surrounded by '{}'.

Change 437 on 2000/11/20 by klaren@klaren.hawking.dev

   SGI Irix 6.5.10 MIPSPro compiler support contributed by Anna Winkler.

Change 436 on 2000/11/20 by klaren@klaren.hawking.dev

   Virtualized a most methods of Parser and LLkParser (as requested by
   Alexander Lenski)

Change 434 on 2000/11/09 by klaren@klaren.hawking.dev

   First stab at a docbook codegenerator. It now produces something that get's
   parsed by jade and gives pretty ok HTML output.

Change 433 on 2000/11/08 by klaren@klaren.hawking.dev

   Cleaned up some superfluous methods.

Change 432 on 2000/11/08 by klaren@klaren.hawking.dev

   Cleaned up generated HTML added quoting for special entities (probably
   still missed some). Removed printing of parameters, returns, syntactic
   and semantic actions since these obscure the output. It's now HTML 4.01
   Transitional compliant it seems.

Change 427 on 2000/10/23 by klaren@klaren.hawking.dev

   Virtualized destructors in xxSharedInputState. This to support
   overloading. By request of Alexander Lenski.

Change 426 on 2000/10/19 by klaren@klaren.hawking.dev

   Incorporated bugfix suggested by Joe Comuzzi. Fixes ommission of
   semantic predicates in the big unicode case.

Change 425 on 2000/10/19 by klaren@klaren.hawking.dev

   Michael Schmitt's changes for a better exception hierarchy.

Change 424 on 2000/10/19 by klaren@klaren.hawking.dev

   Cleaned up generated code a bit. Removed excess constructors etc.

Change 422 on 2000/10/03 by klaren@klaren.hawking.dev

   Fix for VC++ 6.0 bug with tolower and setlocale

Change 421 on 2000/10/03 by klaren@klaren.hawking.dev

   Integrate 2.7.1 main line into development version.

Change 412 on 2000/10/01 by parrt@parrt.foggy

   changes to prevent Tool from runtime jar

Change 410 on 2000/10/01 by parrt@parrt.foggy

   hetero tree labels are of the specified type if any instead of AST

Change 409 on 2000/10/01 by parrt@parrt.foggy

   updated output of .g files

Change 407 on 2000/10/01 by parrt@parrt.foggy

   added column tracking example, updated commontoken to print col.

Change 405 on 2000/09/27 by parrt@parrt.foggy

   changed type

Change 401 on 2000/09/27 by klaren@klaren.hawking.main

   ChangeLog updated. + tweak to script.

Change 400 on 2000/09/27 by klaren@klaren.hawking.main

   Made little TCL script to pretty print a ChangeLog with C++ stuff.

Change 399 on 2000/09/27 by klaren@klaren.hawking.main

   Fixed generating too many ASTNULL checks in wrong places.

Change 397 on 2000/09/27 by klaren@klaren.hawking.main

   Some *UGLY* fixes for the last typecasting problems in Cpp codegen. It
   now works. In 2.7.2 or later I'll fix this in a nice way.

Change 394 on 2000/09/26 by klaren@klaren.hawking.main

   Prefixed Unicode optimization checks with a ASTNULL check.

Change 393 on 2000/09/25 by klaren@klaren.hawking.main

   Bumped up the version no from 2.7.1a4 to 2.7.1.

Change 381 on 2000/09/24 by parrt@parrt.foggy

   updated to use addElement

Change 380 on 2000/09/24 by parrt@parrt.foggy

   integrating ric's stuff into main

Change 378 on 2000/09/23 by klaren@klaren.hawking.dev

   Forgot another ANTLR_USE_NAMESPACE macro.

Change 377 on 2000/09/22 by klaren@klaren.hawking.dev

   More todo's collected from my mailbox..

Change 372 on 2000/09/22 by klaren@klaren.hawking.dev

   Updated.

Change 371 on 2000/09/22 by klaren@klaren.hawking.dev

   More TODO's...

Change 370 on 2000/09/22 by klaren@klaren.hawking.dev

   Added nested namespace support submitted by David Wagner.

Change 369 on 2000/09/22 by klaren@klaren.hawking.dev

   Bug fix for #ast_in and #( #ast_in ) differences. Split of
   actions/java/action.g into a java and cpp part. C++-isms removed from java
   part. Added support in C++ part for some_method(static_cast(#ast)).

Change 367 on 2000/09/22 by klaren@klaren.hawking.dev

   Port of Unicode optimizations from java. Fixes for custom AST usage.

Change 366 on 2000/09/22 by klaren@klaren.hawking.dev

   Implemented missing initializes to CAWHT for Sun CC 6.0 and fixed throw
   out_of_range for STL_PORT in BitSet.cpp.

Change 363 on 2000/09/13 by parrt@parrt.foggy

   set initial column to 1 instead of 0

Change 362 on 2000/09/13 by klaren@klaren.hawking.dev

   Some bugfixes for getASTCreateString( ... ) hopefully all mismatches between
   astFactory.create and it's parameters are fixed. (Maybe even a speed
   improvement)

Change 360 on 2000/09/13 by klaren@klaren.hawking.dev

   Borland C++ builder 4.0 project files for antlr.lib donated by Ross Bencina

Change 358 on 2000/09/11 by klaren@klaren.hawking.dev

   Removed a superfluous typename (caused problem with Irix Mips compiler)

Change 349 on 2000/09/08 by klaren@klaren.hawking.dev

   More configure tweaks. Some libtool enhancements added.

Change 348 on 2000/09/07 by klaren@klaren.hawking.main

   Small improvement in constructor of CommonAST.

Change 346 on 2000/09/07 by klaren@klaren.hawking.dev

   Miniscule fix for Borland C++Builder 4.0/C++ 5.4. (extra parens)

Change 344 on 2000/09/06 by klaren@klaren.hawking.main

   Fixed missing namespace in generated TreeParsers as reported by Ross
   Bencina.

Change 343 on 2000/09/06 by klaren@klaren.hawking.dev

   Fixed namespace mishap with generated TreeParser constructors as reported
   by Ross Bencina.

Change 342 on 2000/09/06 by klaren@klaren.hawking.dev

   Some small optimizations. And a maybe fix for Borland compiler warning.

Change 341 on 2000/09/06 by klaren@klaren.hawking.main

   Miniscule fix for Borland C++Builder 4.0/C++ 5.4. (extra parens)

Change 340 on 2000/09/05 by mika@y0

   Sather code generation/runtime catching up with Java bug fixes/enhancements

Change 338 on 2000/09/03 by parrt@parrt.foggy

   cleaned up formatting

Change 336 on 2000/09/03 by parrt@parrt.foggy

   optimized out the large unicode sets from switches.

Change 335 on 2000/09/03 by parrt@parrt.foggy

   up'd version to 2.7.1

Change 334 on 2000/09/03 by parrt@parrt.foggy

   added throws option for rules

Change 330 on 2000/08/30 by klaren@klaren.hawking.dev

   Small 'fix' to RecognitionException getFileLineString.

Change 325 on 2000/08/29 by klaren@klaren.hawking.dev

   Shut a few compiler warnings up.

Change 323 on 2000/08/24 by klaren@klaren.hawking.dev

   importVocab statements now cause antlr to look in $PWD first for the
   imported vocabulary files, and if that fails, to check in the directory
   specified by the '-o ' command-line argument

Change 322 on 2000/08/24 by klaren@klaren.hawking.dev

   More typecasts for nullAST's. (Should be the last)

Change 319 on 2000/08/23 by klaren@klaren.hawking.dev

   Michael Schmitt found a missing static_cast in the generated C++ code.

Change 318 on 2000/08/22 by klaren@klaren.hawking.dev

   So many things to do... 

Change 317 on 2000/08/22 by klaren@klaren.hawking.main

   Updated changelog for a5 (or was it 2.7.1) release..

Change 316 on 2000/08/22 by klaren@klaren.hawking.main

   All kinds of small Makefile/configure tweaks. All gcc-isms should be
   gone now.

Change 315 on 2000/08/21 by bob@bob.melvin

   importVocab statements now cause antlr to look in $PWD first
   for the imported vocabulary files, and if that fails, to
   check in the directory specified by the '-o '
   command-line argument

Change 310 on 2000/08/16 by klaren@klaren.hawking.dev

   Fixed a bug concerning one of the nullAST initialization strings being unset.

Change 309 on 2000/08/15 by klaren@klaren.hawking.main

   Integrate bugfixes from klaren.dev to MismatchedChar/TokenException.

Change 308 on 2000/08/15 by klaren@klaren.hawking.dev

   Fixes for some cut'n'paste'o's in MismatchedToken/CharException (error
   messages are ok again)

Change 307 on 2000/08/15 by klaren@klaren.hawking.dev

   Added todo list.

Change 306 on 2000/08/14 by klaren@klaren.hawking.dev

   Configure fixes and a small cleanup.

Change 305 on 2000/08/14 by klaren@klaren.hawking.dev

   Got rid of the last member template. At the expense of some casts.

Change 304 on 2000/08/11 by klaren@klaren.hawking.dev

   Last changes for ASTLabelType support. It seems to work now.

Change 303 on 2000/08/10 by klaren@klaren.kronecker.dev

   Changes for better support of ASTLabelType in C++ grammars.

Change 302 on 2000/08/08 by klaren@klaren.kronecker.dev

   Sync with main tree.

Change 301 on 2000/08/08 by klaren@klaren.kronecker.main

   Fix for the $setText bug in C++ code generation.
   More C++ fixes to action.g. Allow '->' in $setText arguments and some other places.

Change 298 on 2000/08/08 by klaren@klaren.kronecker.dev

   Integrate main branch with playground.

Change 297 on 2000/08/07 by klaren@klaren.kronecker.main

   Fixes for namespace/namespaceAntlr/namespaceStd/genHashLines options.

Change 296 on 2000/08/07 by klaren@klaren.kronecker.main

   Virtualized all functions that someone should want to override. Probably
   necessary for heteroAST stuff.

Change 291 on 2000/08/07 by klaren@klaren.kronecker.main

   Some tweaks to configure.in and Makefile.am's. Fix for CXXFLAGS being
   set incorrectly when not using gcc.

Change 290 on 2000/08/05 by klaren@klaren.kronecker.main

   Updated prototype of toLower to definition in cpp file. It seems I
   messed them up a while back.

Change 289 on 2000/08/05 by klaren@klaren.kronecker.main

   Added namespace macro to out_of_range exception.

Change 288 on 2000/07/28 by parrt@parrt.foggy

   re-added toLower return type fix

Change 285 on 2000/07/19 by klaren@klaren.kronecker.main

   Fixed thinko.

Change 284 on 2000/07/19 by klaren@klaren.kronecker.main

   Dumped output of p4 changes -l into it...

Change 283 on 2000/07/19 by klaren@klaren.kronecker.main

   Fix for bug found by Michael Ebner. Bitset size was not increased in add method.

Change 280 on 2000/07/19 by klaren@klaren.kronecker.main

   Made namespaceAntlr, namespaceStd and genHashlines options file-level
   options. Removed nameSpace member from Tool class all is now handled in
   CppCodegenerator.java.

Change 279 on 2000/07/18 by klaren@klaren.kronecker.main

   Added -diagnostic and -glib options to the usage message.

Change 278 on 2000/07/18 by klaren@klaren.kronecker.main

   Java changes for indented traceIn/Out stuff.

Change 276 on 2000/07/18 by klaren@klaren.kronecker.main

   C++ Changes for the indented traceXXXX output as invented by Monty Zukowski

Change 275 on 2000/07/18 by klaren@klaren.kronecker.main

   Added missing initializer in generated code for TreeParser

Change 272 on 2000/07/17 by klaren@klaren.kronecker.main

   Another workspace for MSVC6 has support for dll's (for version 2.6.1).

Change 271 on 2000/07/17 by klaren@klaren.kronecker.main

   New autoconf/automake stuff for the C++ support library.

Change 270 on 2000/07/17 by klaren@klaren.kronecker.main

   Fixed error within the NO_STATIC_CONSTS #ifdef

Change 269 on 2000/07/17 by klaren@klaren.kronecker.main

   Move C++ files to lib/cpp/src as first step for autoconf setup

Change 268 on 2000/07/17 by klaren@klaren.kronecker.main

   Add contrib dir and Microsoft Visual C++ 6.0 projects supplied by John Millaway

Change 262 on 2000/07/16 by parrt@parrt.foggy

   changed version to 2.7.1a4

Change 261 on 2000/07/16 by parrt@parrt.foggy

   added constructors for this class

Change 260 on 2000/07/14 by klaren@klaren.kronecker.main

   Fixed crashbugs/typos in constructors of Mismatched[Token|Char]Exception

Change 259 on 2000/07/13 by parrt@parrt.foggy

   cutting ric's branch

Change 258 on 2000/07/10 by parrt@parrt.foggy

   fixes per klaren

Change 255 on 2000/07/09 by parrt@parrt.foggy

   removed magelang from tag line

Change 252 on 2000/07/09 by parrt@parrt.foggy

   reformatted

Change 251 on 2000/07/04 by mika@y0

   Reflecting change to the Java action lexer in the Sather action lexer

Change 249 on 2000/07/04 by parrt@parrt.foggy

   changed version number

Change 248 on 2000/07/04 by parrt@parrt.foggy

   Ric Klaren's changes to C++ lib

Change 247 on 2000/07/04 by parrt@parrt.foggy

   Ric Klaren's changes for namespaces

Change 246 on 2000/06/16 by mika@y0

   reflecting changes antlr/CodeGenerator.java #3 -> #4

Change 245 on 2000/06/16 by mika@y0

   reflecting changes in antlr/actions/java/action.g #3 -> #4

Change 242 on 2000/06/06 by parrt@parrt.foggy

   fixed my new method addition to handle empty input case correctly

Change 241 on 2000/06/06 by parrt@parrt.foggy

   allows whitespace now after ( in $setType.

Change 240 on 2000/06/03 by parrt@parrt.foggy

   fixed a bug where duplicate grammars caused an exception

Change 239 on 2000/06/03 by parrt@parrt.foggy

   adjusted so it works; header actions got converted to Token objects from Strings; lots of cast problems and then null ptr exceptions.

Change 238 on 2000/06/03 by parrt@parrt.foggy

   made it ignore zero-length strings for processActionForTreeSpecifiers

Change 237 on 2000/06/03 by parrt@parrt.foggy

   had to run ANTLR on antlr.g to make it compile.

Change 236 on 2000/06/03 by parrt@parrt.foggy

   changed refs to headerActions to imply Token not String.

Change 235 on 2000/05/31 by pete@pete.linux

   More changes to support #line generation in C++ (from Ric Klaren)

Change 233 on 2000/05/30 by mika@y0

   Bug fixes from Gilbert Roulot

Change 232 on 2000/05/29 by parrt@parrt.foggy

   improved diagnostic DEBUG_ANALYZER output a lot and fixed a nasty FOLLOW cycle computation bug.  I was being too aggressive with my locking; i locked block end nodes even when not computing FIRST(block start).

Change 231 on 2000/05/29 by parrt@parrt.foggy

   added code to print out FOLLOW set for rule at end

Change 230 on 2000/05/29 by parrt@parrt.foggy

   added code you can uncomment to print out grammar after code gen

Change 229 on 2000/05/29 by parrt@parrt.foggy

   changed version to 2.7.1a2

Change 228 on 2000/05/29 by parrt@parrt.foggy

   added toString method to print out rules

Change 227 on 2000/05/29 by parrt@parrt.foggy

   added code to dump lookahead sets for each alt in toString()

Change 220 on 2000/05/29 by parrt@parrt.foggy

   changed char to int for toLower

Change 219 on 2000/05/28 by pete@pete.linux

   Mirroring Java changes

Change 218 on 2000/05/28 by pete@pete.linux

   Cleaned up the #line generator a little.

Change 217 on 2000/05/27 by parrt@parrt.foggy

   bug fix: wasn't providing always 4 digits for escapeChar.

Change 216 on 2000/05/27 by parrt@parrt.foggy

   added checking for unterminated rules

Change 215 on 2000/05/27 by parrt@parrt.foggy

   added column tracking support; tabs are counted as 1

Change 214 on 2000/05/27 by parrt@parrt.foggy

   allow comments after tokens/options etc...

Change 213 on 2000/05/27 by parrt@parrt.foggy

   setInputState was actually getInputState :(

Change 212 on 2000/05/27 by parrt@parrt.foggy

   updated to handle } in tokens{}

Change 211 on 2000/05/27 by parrt@parrt.foggy

   had same bug as JavaCodeGenerator related to ~(A|B)

Change 208 on 2000/05/27 by parrt@parrt.foggy

   updated version

Change 205 on 2000/05/24 by pete@pete.linux

   Add support for Metrowerks Codewarrior

Change 203 on 2000/05/22 by pete@pete.linux

   Fix for multithreading from Jan Mikkelsen

Change 202 on 2000/05/21 by pete@pete.linux

   Merged in some fixes from Ric Klaren for tracing TreeParsers, cleaner namespace
   code, and #line generation.

Change 201 on 2000/05/21 by pete@pete.linux

   Added destructors with empty throw specs, as suggested by Dan Field.

Change 200 on 2000/05/21 by pete@pete.linux

   Various performance improvements, mostly from Eric Dumas.

Change 183 on 2000/02/08 by pete@pete.linux

   Added support for Sun CC 5.0 (from Michael Schmitt)

Change 182 on 2000/02/08 by pete@pete.linux

   Fix a couple of minor problems with C++ generation (noted by Michael Schmitt)

Change 162 on 2000/01/20 by mika@y0

   heterogeneous AST change.  not sure if correct.

Change 153 on 2000/01/19 by parrt@parrt.foggy

   forgot to propogate b1 changes to mkjar etc..

Change 151 on 2000/01/19 by parrt@parrt.foggy

   pushing changes back into main/main from fixed tree stuff

Change 142 on 2000/01/19 by parrt@parrt.foggy

   propogating mika's changes forward

Change 132 on 2000/01/18 by parrt@parrt.foggy

   setting type to ktext for everything

Change 131 on 2000/01/18 by parrt@parrt.foggy

   from dev back to main

Change 1 on 1999/12/13 by parrt@parrt.foggy

   adding 2.6.0 from antlr site as initial main line

antlr-2.7.7/lib/cpp/README0000644000175000017500000001434510522211615015017 0ustar  twernertwernerANTLR C++ Support Libraries Additional Notes

1.1 Using Microsoft Visual C++

Currently this is still (or again) somewhat experimental. MSVC is not the
development platform and I don't have access to the compiler currently.
YMMV

Make sure you compile the library *and* your project with the same
settings. (multithreaded/debug/etc.)

Visual C++ 6 only is supported for static builds. Some hacking and STLPort
is needed to build a DLL (only for experts).

Visual C++ 7.0 and 7.1 should support both static and DLL builds (DLL
builds might be broken). In general the main problem is getting the right
template instantiations into the DLL. For 7.0 you might have to tweak the
list in lib/cpp/src/dll.cpp. I'm told 7.1 does not need this.

For a static build (works probably best)

1. Create a win32 static library project.
2. Enable RTTI. (Run Time Type Information)
3. Add the source files from /antlr/lib/cpp/src to the project
   (except dll.cpp) put /antlr/lib/cpp in the search path for
   include files.

For the DLL build (MSVC 7.0 tested)

* Project settings ("create new project" dialogs)
      - Win32 project
        - Application Settings
          - Application type
            - DLL
          - Additional options
            - Export symbols
* Project properties (change defaults to)
      - Configuration Properties
        - C/C++
          - General
            - Additional Include Directories
              - drive:\antlr-2.7.2\lib\cpp
          - Preprocessor
            - Preprocessor Definitions
              - WIN32;_DEBUG;_WINDOWS;_USRDLL;ANTLR_EXPORTS
            - Code Generation
              - Runtime Library
                - Multi-threaded Debug DLL (/MDd)
              - Enable Function-Level Linking:
                - Yes
            - Language
              - Enable Run-Time Type Info
                - Yes
            - Precompiled Headers
              - Create/Use Precompiled Headers

NOTE: Do not use the antlr generated and support library in a multithreaded
way. It was not designed for a multithreaded environment.

1.3 Building with GCJ

NOTE: outdated the new Makefiles do not support this anymore.

It is also possible to build a native binary of ANTLR. This is somewhat
experimental and can be enabled by giving the --enable-gcj option to
configure. You need a recent GCC to do this and even then the constructed
binary crashes on some platforms.

2. Tested Compilers for this release

Don't get worried if your favourite compiler is not mentioned here. Any
somewhat recent ISO compliant C++ compiler should have little trouble with
the runtime library.

*NOTE* this section was not updated for the new configure script/Makefiles some of the things listed here to pass different flags to configure may not work anymore. Check INSTALL.txt or handedit generated scripts after configure.

2.1 Solaris

2.1.1 Sun Workshop 6.0

Identifies itself as:

   CC: Sun WorkShop 6 2000/08/30 C++ 5.1 Patch 109490-01

Compiles out of the box configure using:

   CXX=CC CC=cc AR=CC ARFLAGS="-xar -o" ./configure

Use CC to make the archive to ensure bundling of template instances. Check
manpage for details.

2.1.2 GCC

Tested 3.0.4, 3.2.1, 3.2.3, 3.3.2, 3.4.0.

All tested gcc are using a recent GNU binutils for linker and assembler.
You will probably run into trouble if you use the solaris
linker/assembler.

2.2 Windows

2.2.1 Visual C++

Visual C++ 6.0 reported to work well with static build. DLL build not
supported (reported to work when using STLPort in previous ANTLR versions).
I heart that in some cases there could be problems with precompiled headers
and the use of normal '/' in the #include directives (with service pack 5).

Visual C++ 7.0 reported to work, might need some tweaks for DLL builds due
to some shuffling around in the code.

Visual C++ 7.1 reported to work, might need some tweaks, see above.

My current guess is that DLL builds are all over the line broken. A
workaround is to make a DLL from the complete generated parser including
the static ANTLR support library.

2.2.2 Cygwin/MinGW

Not expecting any big problems maybe some tweaks needed in configure.

3. Old notes for a number of compilers

3.1 SGI Irix 6.5.10 MIPSPro compiler

You can't compile ANTLR with the MIPSPro compiler on anything < 6.5.10
because SGI just fixed a big bug dealing with namespaces in that release.

Note: To get it to compile do basically the following:

   CC=cc CXX=CC CXXFLAGS=-LANG:std ./configure --prefix=/usr/local/antlr

Note probably dates back to 2.7.0-2.7.1 era.

3.2 Sun CC 5

It may be you'll have to change one or two static_cast()'s to a
C-style cast. (think that's a compiler bug)

Configure using:

   CXX=CC CC=cc RANLIB="CC -xar" ./configure

The custom ranlib is needed to get the template instances into the archive.
Check manpages. Maybe the Sun CC 6 instructions above will work as well.

3.3 GCC on some platforms (Alpha Tru64)

The -pipe option not supported it seems. Configure using:

CFLAGS="-W -Wall" ./configure

Or remove the -pipe's from the generated scripts/Config.make.

4. IT DOESN'T WORK!?

4.1 Compile problems

The ANTLR code uses some relatively new features of C++ which not all
compilers support yet (such as namespaces, and new style standard headers).

At the moment, you may be able to work around the problem with a few nasty
tricks:

Try creating some header files like 'iostream' just containing:

#include 

and compile with an option to define away the word 'std', such as

CC .... -Dstd= ....

Also in the antlr subdirectory there's a file config.hpp. Tweak this one to
enable/disable the different bells and whistles used in the rest of the code.
Don't forget to submit those changes back to us (along with compiler info)
so we can incorporate them in our next release!

4.2 Reporting problems

When reporting problems please try to be as specific as possible e.g.
mention ANTLR release, and try to provide a clear and minimal example of
what goes wrong and what you expected.

Bug reports can be done to Terence or the current subsystem maintainers as
mentioned in the doc directory. Another option is to use the mailing list
linked from http://www.antlr.org.

Before reporting a problem you might want to try with a development
snapshot, there is a link to these in the File Sharing section of

http://www.antlr.org.
antlr-2.7.7/lib/cpp/TODO0000644000175000017500000000664710522211615014635 0ustar  twernertwerner* ANTLR should issue a warning if you have protected rules and
  filter == true or filter=IGNORE in a lexer?
  This can be tackled by tracking rule references in a more general approach.

* Have a look at the doc's.

* Add allocators to the objects

* Look more at exception handling

* TreeParser.cpp around line 76 the MismatchedTokenException here does not
  use ttype to improve it's errormessage. Would require changing a bit in
  MismatchedTokenException.cpp

* On Thu, Sep 21, 2000 at 12:33:48AM -0700, John Lambert  wrote:
  > 1) The literal EOF is not defined and causes the define of EOF_CHAR  in
  > CharScanner.hpp to fail.

  ANTLR with STL Port. Changing the EOF define to char_traits::eof()
  breaks things for gcc-2.95.2. Fix this in next release portably.
  http://www.egroups.com/message/antlr-interest/2520

* Fix heterogeneous AST stuff. It boils down to adding a method to AST
  types that knows how to duplicate the sucker.
  -> done clone() added.
  Knowing one factory is not enough.
  -> done in C++ have a superfactory.
  Also look at having to set the astfactory by hand (this is not 100% necessary).
  Double check generated code.
  http://groups.yahoo.com/group/antlr-interest/message/2496

* Look at messageLog stuff Ross Bencina proposed. Looks good at first glance.
  http://www.egroups.com/message/antlr-interest/2555

* Add RW_STL & CC 4.2 patch from Ulrich Teichert:
  See my mailbox.. and these comments from Ross Bencina:
  http://www.egroups.com/message/antlr-interest/2494

* in action.g (java and C++) ##.initialize / ##->initialize is not
  recognized as an assigment to the root node. In the case ## is followed
  by ./-> initialize transInfo.assignToRoot should be set to true.
  Report by Matthew Ford (12 march 2001)

* Add TokenLabelType option for generated lexers. Hmmm can already set token
  factory. Then again.. you may run into a cast fest..

* Fix some #line counting oddities (Mike Barnett)
  > 	nonterm
  > 	{
  >          ## = #([TOK,"TOK"],
  > 			... Other stuff ...
  > 	         );
  >          f();
  > 	}
  generates wrong #line info need to fix action.g a bit better.

* This one triggers a bug in antlr's codegen.
  #perform_action = #( create_tau_ast(#p1->getLine(),#p1->getColumn()), #p1 );

  #p1 are replaced by p1 in stead of p1_AST. It's really time to rewrite this
  mess.

  Workaround:

  RefModest_AST tau = create_tau_ast(#p1->getLine(),#p1->getColumn());
  #perform_action = #( tau, #p1 );

* Unicode and related.
  - The patch from Jean-Daniel Fekete is an approach. But has some issues.
  + It is probably necessary to discern an 'internal' string/char type and
    'external' ones. The external ones are for the lexer input. The
	 'internal ones' are for standard antlr error messages etc. Translators
	 from external to internal should be provided.
	 Hmm on second thought.. probably not really an issue.
  + What should the lexer read?
    - Unicode units from a 'unicode reader' in a sense this unicode reader
      is a lexer itself. Just reading iconv/iconv_open manpages.. Maybe we
      can hide this with iconv in the InputBuffer mechanisms?
	 - Interpret unicode ourselves. Ugh don't want to think of that right now.
	   we probably redo something that has been done. Only problem is that we
		need something that's portable (C++ case)
  + What changes are necessary in the rest of the code to support a wide
    character set? Think most should be handled in/below the lexer level.
antlr-2.7.7/lib/cpp/AUTHORS0000644000175000017500000000006110522211615015175 0ustar  twernertwernerAuthor:
  Peter Wells  
antlr-2.7.7/lib/cpp/contrib/0000755000175000017500000000000010522211615015570 5ustar  twernertwernerantlr-2.7.7/lib/cpp/contrib/bcb4/0000755000175000017500000000000010522211615016402 5ustar  twernertwernerantlr-2.7.7/lib/cpp/contrib/bcb4/antlr.bpr0000644000175000017500000001201610522211615020227 0ustar  twernertwerner# ---------------------------------------------------------------------------
!if !$d(BCB)
BCB = $(MAKEDIR)\..
!endif

# ---------------------------------------------------------------------------
# IDE SECTION
# ---------------------------------------------------------------------------
# The following section of the project makefile is managed by the BCB IDE.
# It is recommended to use the IDE to change any of the values in this
# section.
# ---------------------------------------------------------------------------

VERSION = BCB.04.04
# ---------------------------------------------------------------------------
PROJECT = antlr.lib
OBJFILES = antlr.obj ..\..\src\TreeParserSharedInputState.obj ..\..\src\ASTFactory.obj \
  ..\..\src\ASTRefCount.obj ..\..\src\BaseAST.obj ..\..\src\BitSet.obj \
  ..\..\src\CharBuffer.obj ..\..\src\CharScanner.obj ..\..\src\CommonAST.obj \
  ..\..\src\CommonASTWithHiddenTokens.obj ..\..\src\CommonHiddenStreamToken.obj \
  ..\..\src\CommonToken.obj ..\..\src\InputBuffer.obj \
  ..\..\src\LexerSharedInputState.obj ..\..\src\LLkParser.obj \
  ..\..\src\MismatchedCharException.obj ..\..\src\MismatchedTokenException.obj \
  ..\..\src\NoViableAltException.obj ..\..\src\NoViableAltForCharException.obj \
  ..\..\src\Parser.obj ..\..\src\ParserSharedInputState.obj \
  ..\..\src\RecognitionException.obj ..\..\src\String.obj ..\..\src\Token.obj \
  ..\..\src\TokenBuffer.obj ..\..\src\TokenStreamBasicFilter.obj \
  ..\..\src\TokenStreamHiddenTokenFilter.obj ..\..\src\TokenStreamSelector.obj \
  ..\..\src\TreeParser.obj ..\..\src\ANTLRException.obj
DEFFILE =
LIBFILES =
RESDEPEN = $(RESFILES)
RESFILES =
LIBRARIES =
PACKAGES =
# ---------------------------------------------------------------------------
PATHCPP = .;..\..\src
PATHASM = .;
PATHPAS = .;
PATHRC = .;
USERDEFINES = HAS_NOT_CSTDIO_H
SYSDEFINES =NO_STRICT
# ---------------------------------------------------------------------------
CFLAG1 = -I..\..\src;$(BCB)\include;$(BCB)\include\vcl;..\.. -O2 -w -Ve -a8 -k- -vi -c \
  -b- -w-par -w-inl -Vx -tWM -D$(SYSDEFINES);$(USERDEFINES)
PFLAGS = -U..\..\src;$(DEBUGLIBPATH) -I..\..\src;$(BCB)\include;$(BCB)\include\vcl;..\.. \
  -DHAS_NOT_CSTDIO_H -$Y- -$L- -$D- -v -JPHN -M
AFLAGS = /i..\..\src /i$(BCB)\include /i$(BCB)\include\vcl /i..\..\..\cpp \
  /dHAS_NOT_CSTDIO_H /mx /w2 /zn
RFLAGS = -i..\..\src;$(BCB)\include;$(BCB)\include\vcl;..\..
LFLAGS = /P64
# ---------------------------------------------------------------------------
ALLOBJ = $(OBJFILES)
# ---------------------------------------------------------------------------
!ifdef IDEOPTIONS

[Version Info]
IncludeVerInfo=0
AutoIncBuild=0
MajorVer=1
MinorVer=0
Release=0
Build=0
Debug=0
PreRelease=0
Special=0
Private=0
DLL=0
Locale=1033
CodePage=1252

[Version Info Keys]
CompanyName=
FileDescription=
FileVersion=1.0.0.0
InternalName=
LegalCopyright=
LegalTrademarks=
OriginalFilename=
ProductName=
ProductVersion=1.0.0.0
Comments=

[HistoryLists\hlIncludePath]
Count=4
Item0=..\..\src;$(BCB)\include;$(BCB)\include\vcl;..\..\..\cpp
Item1=..\..\src;$(BCB)\include;$(BCB)\include\vcl;..\..
Item2=$(BCB)\include;$(BCB)\include\vcl;F:\antlr2.7.1k\lib\cpp
Item3=$(BCB)\include;$(BCB)\include\vcl

[HistoryLists\hlDebugSourcePath]
Count=1
Item0=$(BCB)\source\vcl

[HistoryLists\hlConditionals]
Count=1
Item0=HAS_NOT_CSTDIO_H

[Debugging]
DebugSourceDirs=$(BCB)\source\vcl

[Parameters]
RunParams=
HostApplication=
RemoteHost=
RemotePath=
RemoteDebug=0

[Compiler]
InMemoryExe=0
ShowInfoMsgs=0

!endif

# ---------------------------------------------------------------------------
# MAKE SECTION
# ---------------------------------------------------------------------------
# This section of the project makefile is not used by the BCB IDE.  It is for
# the benefit of building from the command-line using the MAKE utility.
# ---------------------------------------------------------------------------

.autodepend
# ---------------------------------------------------------------------------
!if !$d(BCC32)
BCC32 = bcc32
!endif

!if !$d(CPP32)
CPP32 = cpp32
!endif

!if !$d(DCC32)
DCC32 = dcc32
!endif

!if !$d(TASM32)
TASM32 = tasm32
!endif

!if !$d(LINKER)
LINKER = TLib
!endif
# ---------------------------------------------------------------------------
!if $d(PATHCPP)
.PATH.CPP = $(PATHCPP)
.PATH.C   = $(PATHCPP)
!endif

!if $d(PATHPAS)
.PATH.PAS = $(PATHPAS)
!endif

!if $d(PATHASM)
.PATH.ASM = $(PATHASM)
!endif
# ---------------------------------------------------------------------------
$(PROJECT): $(OBJFILES) $(LIBFILES)
    $(BCB)\BIN\$(LINKER) /u $@ @&&!
    $(LFLAGS) $?
!
# ---------------------------------------------------------------------------
.pas.hpp:
    $(BCB)\BIN\$(DCC32) $(PFLAGS) {$< }

.pas.obj:
    $(BCB)\BIN\$(DCC32) $(PFLAGS) {$< }

.cpp.obj:
    $(BCB)\BIN\$(BCC32) $(CFLAG1) -n$(@D) {$< }

.c.obj:
    $(BCB)\BIN\$(BCC32) $(CFLAG1) -n$(@D) {$< }

.c.i:
    $(BCB)\BIN\$(CPP32) $(CFLAG1) -n. {$< }

.cpp.i:
    $(BCB)\BIN\$(CPP32) $(CFLAG1) -n. {$< }

.asm.obj:
    $(BCB)\BIN\$(TASM32) $(AFLAGS) $<, $@
# ---------------------------------------------------------------------------
antlr-2.7.7/lib/cpp/contrib/bcb4/antlr.cpp0000644000175000017500000000274410522211615020235 0ustar  twernertwerner//---------------------------------------------------------------------------
#include 
#pragma hdrstop
USEUNIT("..\..\src\TreeParserSharedInputState.cpp");
USEUNIT("..\..\src\ASTFactory.cpp");
USEUNIT("..\..\src\ASTRefCount.cpp");
USEUNIT("..\..\src\BaseAST.cpp");
USEUNIT("..\..\src\BitSet.cpp");
USEUNIT("..\..\src\CharBuffer.cpp");
USEUNIT("..\..\src\CharScanner.cpp");
USEUNIT("..\..\src\CommonAST.cpp");
USEUNIT("..\..\src\CommonASTWithHiddenTokens.cpp");
USEUNIT("..\..\src\CommonHiddenStreamToken.cpp");
USEUNIT("..\..\src\CommonToken.cpp");
USEUNIT("..\..\src\InputBuffer.cpp");
USEUNIT("..\..\src\LexerSharedInputState.cpp");
USEUNIT("..\..\src\LLkParser.cpp");
USEUNIT("..\..\src\MismatchedCharException.cpp");
USEUNIT("..\..\src\MismatchedTokenException.cpp");
USEUNIT("..\..\src\NoViableAltException.cpp");
USEUNIT("..\..\src\NoViableAltForCharException.cpp");
USEUNIT("..\..\src\Parser.cpp");
USEUNIT("..\..\src\ParserSharedInputState.cpp");
USEUNIT("..\..\src\RecognitionException.cpp");
USEUNIT("..\..\src\String.cpp");
USEUNIT("..\..\src\Token.cpp");
USEUNIT("..\..\src\TokenBuffer.cpp");
USEUNIT("..\..\src\TokenStreamBasicFilter.cpp");
USEUNIT("..\..\src\TokenStreamHiddenTokenFilter.cpp");
USEUNIT("..\..\src\TokenStreamSelector.cpp");
USEUNIT("..\..\src\TreeParser.cpp");
USEUNIT("..\..\src\ANTLRException.cpp");
//---------------------------------------------------------------------------
#define Library

// To add a file to the library use the Project menu 'Add to Project'.

antlr-2.7.7/lib/cpp/contrib/bcb4/README0000644000175000017500000000012510522211615017260 0ustar  twernertwernerProject files for Borland C++Builder 4.0 to build antlr.lib

Donated by Ross Bencina
antlr-2.7.7/antlr.jar0000644000175000017500000154274410522212202014430 0ustar  twernertwernerPK*ma5	META-INF/ﾊPKPK*ma5META-INF/MANIFEST.MFMﾌﾋLK-.ﾑ
K-*ﾎﾌﾏｳR0ﾔ3瑯r.JM,IMﾑuｪ	倩ﾅX*h8荀*8鉗薄､(x%irrPKRぃWFFPKma5antlr/ANTLRError.class]悉
ﾂ@EH4>AKｭ|Eﾑ*Xｨﾘｯd%n`藍`Q稷nqg跟ｹｻ<_FP5RｳQｷｬ欝2ｽ傘佗ﾇ説RｫeｭﾘG4{ﾁYﾜ	u7塩46g_!\Jｹｳﾕ6X/ｴ寿ﾈﾐUa)<｡辿ﾁxb槇crﾚ吊ﾏｦ$賀ｹnJｸ%┯慳ﾜｨIygﾒCcm蝸ｴH0蚫ﾅZｽ欄\ｬ鏘Oc礁xｼ柮zﾌｨﾆｭbﾓ慎o樸v諫>ｨ'ﾛ)e｡ｭtﾙP+ﾇきﾃq1%5Uﾚｭ85､｢/ｫｳT]rｰハ啼ﾁy｢8ﾅ7ｮ8yXy#>nﾄ｣-+ｷ !vUudE囗ﾗ｢ﾘdｬbｧｱ卵#f]｣4ﾜ欟ﾅｫﾝ}vﾘ6-瓣 vhｵVhO8$ｽ#ｹ2D:4hﾁ!'寰t臧M3f*ﾍｱﾘ[ｶr肩Mｺ&M･[ﾃｯ<-C3G#Xa略ｸN｡辨
ｯｩ]G魃\重圉 {ﾎｮS亶|ｶi*\ｴ｣0lｧﾞｸ,)ﾈm好肩i-凱
ﾝ%ｽ繍ﾒAｿ倆/pｱ_^Sｬｺｮｴﾏﾊ続zS9ｿｺ瓮萓｡}ｲ誦utﾅｵzｹ*cﾅylｫﾏｶｧｧﾍﾒ4@aM｣mXiﾐ	Xp&,｢ﾁ､ｻﾙｻU#Xpﾌg&F5 <#繋ぅ薪c喘zPu0CLrﾌ	釛討qJｴﾁｳらﾏﾃﾆ_ｼ,xEｪ5ﾁﾒ
ﾁ屬sn3ﾞ<繖5	wｧ$ｾ'8-ﾁﾂ#ﾆﾇﾏﾀﾆｧ佼ｹｬ3+ｿﾏﾁﾆｿべ経ﾈ8/.ｾ,ﾁ"纈犂煌戡=}♯oPK=)ｳ$KOPKma5antlr/ANTLRHashString.classuTMoU=ﾏc{lw8i$蕊NLﾛ､_q鰔*AN MD+｡爵I<;ｦｸｺ`XQﾚ
R7ﾙtχ8H6,Xｱd
73Mﾀ･ｲt}ﾞsﾞｹﾝ/}9\Oao%詑ﾙﾍ9iﾎﾋ蛞
I,ﾈ閧葛*.ﾉﾌeiｮ､ｰ梓dｴ$ｯﾈﾂ滑ｷDG`､ｺk=ｰJMﾋﾝ)mzmﾇﾝYPjﾝm∧m殿ﾓvYｹ*kﾚ渟m√Uﾋ夬壷ｰﾚ孛ﾋu6!ｱOﾚﾎ=[`ﾀlｹ[Vｳk+TH ^v\ﾇｫLｷﾍﾕﾁ邱｢f.	ｪ嗣ｯwﾕMｫﾖ萸
┛ｿ,･:7=椶ｯ贓Vﾜｾﾟｵ夥ﾟﾗvｺｷ仭%辛X戳Hﾑl?ﾎ筋ﾉ種]noﾋｻ依~$ｿﾜQｲdMjｳﾕmﾗ四ﾄﾍ鼾TﾌIﾞﾑ0！

釜ﾕ0ゅfpZﾃ	健>隹/扇?TｲMkﾈCWｱｬ*L
笞1ｧ'\ﾃ洛ｿﾂ*ﾏ@o灣ﾞｼ筱R邦-ｶ旦*ｹS,dｨa茯N｡BU瑛瑞m畭ｷﾌ阻)ﾚ5>ﾑ:T|ﾀiﾝﾝ瑪m0ｷﾅ>>､ｶ-vwUﾍﾑﾋﾗ柆@ｺ2Jｿ鯢ｴｧ9乘ｴ廚ﾕﾈ3員U/_ｧｾｻ彷
pｨ鯖ｫ聢 ﾘ!x僚sGUPK靆\)ｯDPKma5antlr/ANTLRLexer.class{y`TEﾕ~卷d&｝I#ﾜw$&Dﾃ!伸b2Aｹｼ@o@6%AA]ﾙuuﾗXoﾔuWW]wQｫzﾍd2襠#?)]ｯｫｻｺﾞｧｫｫ黏ｿ7yﾂﾑg?ｾd"舎ﾀ腮ΑLoﾁﾏﾌﾇｵ@87ﾁ/p羆x~
ｧﾚfMF､TL(ﾌ(-ﾐUY垪ﾓlﾆp3ZﾌaFｫ#ﾍeﾆVfｴ1ﾚ1flmﾆ6f5c[3ｶ3c{ﾒ繋L:0鯤ｺ羯ﾖ迂g&]teﾒ巧w&=做dﾒ紀o&	L$1ｱ3鯏､/冬L3If2ﾉ@&f2ﾉP&ﾃg2B46rm$轍&ﾍﾗ1LR厳ﾀtgﾁ侈d	ﾓL8ﾑ30ﾝ鏑8ﾙТﾂa6fX ｧ嗔f｡ﾃ8晉喨ﾁ,^凩佻
覬贅Ｂ+愧ﾍ3厠2緲ｾ跿ｸ9ﾘ市-0纒fｼﾊ桁f徃F'ｷﾍg"ｮ3q1Yﾀm%\[ﾈ､ﾔ結ﾌｸﾘＦXﾎvsｭﾂ剣fｼﾚ袈&ｬｶﾀ:0ｩaｲуｮa｡･L1ｹ杢稔載lTｹｲ滑ﾞ｣蠑ｷeｹOM"_Eﾞ`ﾂX
槲Jｮｭbr=惇Lﾖ0Ykﾂu&\oﾂLx#BD｡ｧbｱﾋ晤@鞣pｺ=eUﾉEeeｮ"Oiｻ:ｹｴｼｲ,yBｩDF7ﾘﾔﾜﾒ諌ﾊU]莅t･-tVﾍt耗ｸb亨K慄eNwIrｮｧｪﾔ]2:)AｦUSw+Gｩﾛ漂S>ﾟU慕彑F-4}yﾋ*]*ｪX促ﾔ罨r!ы)u陽ﾆ"ｴ7t坊$gｸ+k<､ﾖ,4｡uSW射YｪﾒZﾛ&ﾗﾄ'ﾔ,X`ttv8\K]Uｹt7Wｱ｡ﾒ駲i"疣ﾗROc"ｴ迂ｼﾖ@fｳ､/-rUjE蟲rif鋭x愡<-kﾌ<ｲQyｮ｣ﾐ鋤ﾇｵ)ﾏﾊNﾏ,Lw､3_幅卵肘f+Osd螯ｵiZS	V3ﾒsﾆ允ｼ懼ﾂ	體33;ｲSsﾒｵZ参綢UﾋsRs夬騨"ｩｹｹ3oﾆlGFzｮ&>=CEﾃｸaBj訶杼VﾟzVc"uMd鶫gE兀SｻkﾚG>Bdyﾚ番廝GF^zNｪ,S棍妲V$9剴:L蟲'fLﾎﾈc}FE鉾霹Jﾍ兔圜O4ｦ<捺>ｱﾐｿ即`ﾔ｢|ﾝFΗnﾅC氛o)D歇V<?ﾘ`ﾅ#4枡?ﾇ蔵$'Pjﾛｬewﾘ華悼H$達俗o7yﾃ,4ﾟ86ｷﾕQｼﾏｫvw#濬*W夸Y+>ﾏ[撰架ｩｬ u+ﾆQﾆｪ(/ｯpkse/X$Gﾒ)"p塵"楔ﾂﾇ>蝗=
:ﾜX疽ｕ擲ﾂ予;ﾇ+&_3ｾ･逃ﾔц留ﾈ騅sBﾈ>讚}ｲ~kDﾆ送甬尅DO魂2僚ﾄｳPKﾞﾜ｣ｭﾟﾂIaﾍ\\ZRJcﾔﾄｴ2彪Oﾔ[dbZﾒBP莅v薐;.q[Bﾔgｫvyﾒｻ9ﾇ$bﾉvｴHｼﾈﾇ4wm+ﾁ3｡侠ш0ﾂ\ﾖEdﾑﾁ-IﾁM配ｪ\5ｭｾ6ﾖB=aﾛ畔M勧ｦ達/K{:ｻ)｡	(qyQ縋盲葩$&O唆ﾚHﾕﾒ*ﾊjﾊﾝｼ'Kﾎﾐ痍}8/;ﾕｪｽｵ.ﾞmﾘﾅRf:･ｴﾂｷｼk忌ﾑﾍズﾍﾇY鈩ﾓ]ﾕﾕﾎ鶴ﾚ喰ｺx4Sﾆ9ﾜS6ｶ感+.ﾞ鰕v0ﾒerｻｮ)Yﾇ+ﾄﾛaS籤4ﾝ&&ﾟ塀xｫ{yaﾄaｯｮo.ｦﾞ縣5ｦ萪^GQ禧o鮪y9/?ﾔｪ沖弋U磋Lp-Fz1ｾ幕Gﾛﾄ結尸輙8Nu薙D{\ﾕo g6Eﾏfﾔ､厰歳ﾙｵﾍ8ﾅﾒﾉ(宍ｧvｭ3ｮﾗθQ:年ｴ｢屯!%洸p余ﾖﾚ
v**ﾕ>nﾝF$哽w*ｻｩ$PﾙGeｩ4ｮレ`:ﾆ^ｩﾝMｿ3ｮﾃ耕芙ｨﾌｧr'TvPqSｹ櫟府ｨxｨl｡RC藺峪ﾎYgｯｳY麝ﾖ:[:[B擯ﾎ^艦ｬC緤ﾘ死ｰﾙｦ覡fｿyv孃ﾈmcb
ﾐｴﾋｷui7ﾋﾗﾕﾁﾗe	竟2ﾄ
蓁
J粱ﾘﾕﾕﾗ58ｰｫ岷+"ｰｫｻｯｫs`W_Wd`WO_Wｧﾀｮ^ｾ.k`Wo_W沼ｮ_WL`W｢ｷﾋﾘ謎覗t=C%ｴﾉ3J｡,ｰ來UdC9qnXｰ*\M迪*ｪﾑ
LK(江ガa)貰Aｸﾏﾀrｮ｣;･1
{Wｿ;Udt炙1"ﾉﾎﾞﾕｱｰＱ*+	ﾔgz6.ﾋ-ｬKﾙF=*庠)､2槎t*%T(ﾝ*q~cｿ'ﾜ%9TVﾓ炉Cｷ弼oC麗)ﾊO~sｻﾍoｮ捫ｧBﾉP｡ﾇ竒<陛ｼﾒ}ﾉ9jfﾌkﾌ$ﾌIfL3
3f;3
f3Cf-3C
f	3ﾃｦ漠Sﾀﾌλbf､ﾁL`f斑efｴﾁ$23ﾆ`:2澱0Qﾌ5df慚ﾀﾌ7/露5w兪0ｯ2吐0ﾏ23ﾑ`杼&ﾝ`ﾔﾂﾅ夢:ｳｰ塾Nﾊﾍﾔ6ﾉXｯ	7&ﾅ>
Z｣yｺo慓彗4ﾓ喞ｦﾔ{ﾓｴhu~ｵｦ輒ｽﾔ選%徽v\qｇ梟ｰﾚ_ｺpｭr4ｻtｪ\ｾ>6Jqｲf%聿s0{ｧｨ|j{f?	s`営P@|=\ﾙW擒彗汕'>+ﾒｳ俎ｮ逾憶z>ﾃﾝ班VQﾖYC消ｵ盃ﾖQ^ｻ[?ｰ/ﾀFa尓ｸC奄{磐pｯﾒS:ﾂJWﾘｮ妊ﾘｭ=ﾊ ﾘｫ撚ｰ_	pP*xLﾉ'<8ｬ腓ｽRG'SﾀﾓJ)<ｫｸ9･杆迷玉r8ｭ\g鳩&xUｹﾎ*巵ﾏﾊﾝｺｲﾞPｶﾃ[ﾊnx[!ﾇPﾀﾊ｣｡$|､4ﾀｧﾊﾓ咄|ｮ怱ｯ迫潴,|｣ｼT
ﾟ)ﾂﾊ尼	[~Vｾ_ﾂｯﾊ術A･+ｪBﾁ0｡｢EX0BｴBｫA嬋ﾑ"cD=ｱ滴ﾂﾎ｢/&梶$｡]呼~b:9,赳@眸A｢句8Tｬﾇa.ﾀ鯛~%v疉ｱﾇp忸'委1M|ﾅO.ﾎ綸+N&&ﾃﾑ!｣qｺF;ｮｧi$ｭWmｨ湘3g♂Vﾌ$o)ｬyﾃ､mH頑hｼｧｬmｱIaﾗ1&ｻ+貧v[ﾗzpﾖB･ﾝｮUJ6Uﾈ3釋ﾂﾝﾅ#wBW=4,;｡ｭﾝﾉ~bマb6｣SkmWR:n蔗}纒ｴA而ﾉw岐ﾇJc*ｱｲｸ\ｰﾀﾞ獣ｨ鴦;ﾚkS沼ﾙｴ9-Р8RｰXﾛ朗ﾂRﾚ.Ｍ\ｹｴI-ﾁ
(ﾇJz_MﾚjﾜD讃幃|ｯ:\O甄8↓烋ﾚﾐ~渓4s嵋ty$l>噸ﾉxﾄﾟ腓SpT蕨我ｫ桂vQ%ｵ駁ｼ}ﾝ>Nhﾇm9ﾈGﾅﾑ='%匪箏#ﾊoﾐﾗ二n 聨ﾑｸz瓰鍜ｵTｼ搆ｷ煙ｷf濔猗hｧｲﾖ齋ｸｷ=GﾈXｧ
ｿｹ3兼d絳ﾆ肪)ｭE`ｱ6ｵz(ﾛBmb｡ｼｶkﾅ-ﾆﾟﾑja０ﾄｪwﾔﾒPｲVｯTK>yｹﾋﾖ|ﾒ%ﾃ&ﾃ6ｸｺﾓ9ｷ/ｦc=Rｰｲ)ﾈﾇ｣0氣2<
/潭p_2龝>#ｨk8恁&#ﾓ&鬧+lﾔ*ﾑﾐｸﾇﾛAﾇMﾚi3鉄Mﾖﾆ薪/ｭ｢Iv試nﾒﾞﾚ|ﾎM]R檀<鮨oﾇｦ'屡ｭﾍｼ､娶ｼ}度鍋ｸ}>`ｿﾛ,{LY靡ﾜ
ｩ*-YZﾗhﾁ_1SMJ'ﾀFﾐｾｽ?羔W~?列Kﾏﾁｷ衣`;ｻ痍ﾘｿﾇ/∫q,ふWｼ/`=|
L9ﾏ{槊zTMw虻ｻmﾍrｧﾙ拵
割E(ﾅm廃隕X 飩$L･ﾇ} ｴBC@ﾐﾆｶｴhCﾐb	Z[へ滋ｵ'hZﾇ h'CCMﾐｶｴﾎｭANﾐzｴｭAK h陰ﾐNﾖ匠耕1h}Z_ｖLﾐｴmABﾐA{14ｴｾ培*[ ､th#ﾚH6･ｴｱmAK%hあ
ｭ#Y-ｱﾅｬ鋒ﾐ&ｴ6腹M#hｖIﾐｲあ	
-棧%ｵｴｖKﾐfｴYm6Aﾋ'hs	ZAｴ唯CIﾐFｵｴB6匠ｴbよ"hﾚB７衵ﾐｧ闖ｮ磨VFﾐﾊ	Z%Aｻ國Uｴj７CﾐA{%4ｴdへｧﾅ-#hﾗｴm%A[Eﾐｮ'hkﾚﾚ h
ｭAKi1h7ｴ	ﾚ-mAﾛHﾐn%hｷｴMAﾐ^

m%将[,yﾜIﾐ"hｴﾚじ腹ﾝOﾐｶA;嚶ｬ6ｺﾅｬFﾛ}eAﾛKﾐｴ	Z-AﾛOﾐAchh	ﾚU-Ｗ摺=Nﾐｴ'ﾚｭ棧5AShhﾝZｷプ箱#hﾏｴYA{□Zhhｱｺプ國!hｯｴ?ｴW	ﾚY'Zｴ?6唖o1hoｴｿｴｷﾚﾛ.A{泛}ﾐﾐﾚRХｵX頃}Lﾐ>#hｴ/ﾚ+uｴ7BCｳ惇Vｶ俔ｾ%h hﾟｴｴﾚﾟ h	
-國ｭh1h	ﾚ/ｭﾚn!A(.$Ljｴｿ}h@ｻﾓZkｖﾀ!|T`ｼｨｮﾁﾀﾓtｺｲjR5!殉圉ﾋ昶(f%ｬ4ﾅ(,ZAo
CD､X)笄@tRﾑ*D<ﾜ*:ﾃ｢Kﾐ9Mﾔﾅﾝﾔ仏ｧ>え^燵ｺZﾉ&ﾒｯﾐkﾐｿB
Whｾ2ｮロ+>Whｾ3ｮﾃ+k"ﾀﾛ肴_ﾄﾗ勒材ﾗh賈_｣5?･ﾀ5Tdｷｹ>kｷUiｻﾍ｣Uﾚmｵﾊ>ｻm〃ｹﾟnｻFｫﾜiｷ9ｵﾊ-v[wｭｲZ_ｨZ\ｪOｿ+ｶｶﾁｰDwｻ`｣^ｾﾖx衝ﾋ嚴ﾕn/ﾟﾗ'ﾟﾝ+ﾗ$蝠ｯE驀ﾁﾝ!ｬeB線^8膿V9!nUﾃﾞC疵M	& /ｳ介 =(@zSﾐQ∫E_8%ﾀ+b C
1ﾞ｣烋1>聰s1ﾎ演ﾟYL"Qd｡ｹhy)fck聡mﾅUﾘY8q著徐｢ｮ%x盜э
<#ｪob9+鰭ｱJｫ蔽b昶qｫ2Kﾜｦ維ｧﾘ､,尓RqｷｲFlQn[塀ﾅ6	ｱ]9"ﾟF,構ｼ足ｮﾘｰﾝsU縢`iｳ\ﾕ捏U;ｺ藥|D椎w打w毒打SJ:@)ｩ山ﾒ#白Cﾉ
爆死Ge禮P:zﾛﾚｸﾚｮﾜv｣Rｼ_lﾑb､N.ｭ倚*ﾐxjLK-湿岨
｢ﾅy喬	v[ｪm歎Bc｡-3ｴ'hA汞_ﾄi
3hｯb+qcﾄﾘAｼ◎ﾄ[8Lｼ喫=ﾌc恢ﾋﾄGA煮mWn;ﾝaGｦxｧﾚ"ﾏ	楳mﾅ厘C怎$LﾟC=(ｦﾞ＋ﾓqｻ?ｸ6)bX/Yｶﾗk#再ｨ/Oｯﾘ0ｹ鬼aﾟ\爽aXﾛtﾋﾚ?izﾟﾑ~h3ﾈ0Cﾌ
ｸ､ﾅRﾂﾍ2n逃)ｿ逶fc=ｧﾜ=ﾓﾆ2;∩6fyﾌuGf+/|or&-!# JFAkﾙ
ｺK$ﾋh*c Wｶ!ｱAﾎｾ/+ﾜidV`G弐ﾌmｶIﾞ､%|_閂ｳ2ﾅﾘｬ県2憂m慣艮ｿ~ﾇﾕ6ﾖu|m翆K{%罕ｿ/8ｫ%+ｵD悵U.;WA<ﾍｼ=8鮫mdW({@	92	fJ;萢p畢ｧ(陛ak薊儔ｰI氏2梍c癢/ﾉTｳﾌｷ腟LNΡ･ﾃe&Fﾉy稔-8,=蠢\ｦ(
径&ｶｺﾆi_滲･ｭｭOJｼﾍﾄ4\ｳFwﾀZ鰯ｶｬﾕ[蔀ｺﾟ6Pｬe3ﾇﾕﾃ
t1ﾕﾃ航賣x%sﾈﾈｹdﾐAﾎ.2剃蟷0Hﾎｲｦﾊd閻dﾘRX'ﾁｹこｶI7pB^
'eU請5Rh+Cｾﾜ契ﾁ沁ｰﾒxｳ"}ｮｸﾅ鴨喀q･s･ul蕣ｾ}-ﾟ	]ｼｪﾛ6ｩﾖｶ+ﾗﾗ6ﾖ･vBﾜ!ｸIﾗ%ﾂ委ｦﾏﾃ]薫ﾀWﾊ攤^ﾂﾛ艤ｼKﾀ]aｬ埠xJﾄ怜｣Aｱ耐:ｮ諺ｵO睿ﾇ瘁7bEﾆFZｪﾏｾﾄR｢L扣烋ｳ誤ﾈﾟ｣nZﾞ9浅ｭｽｨﾝVﾈﾍ6ｶﾕＡﾗｺｲｪ'ｭC舂O盛ﾕC[yX Ob｡<%昇Hｾ歯
ｬ厄灑.ｮ稻)ﾞ(?#ｷﾊ/<ﾇ藐A橦7ﾟ寂'cuｿ$i(
ｸ[ﾅ･ﾄﾙﾎﾜｰﾁ騫ﾍ紐ﾝbﾃﾐｱｹﾕhwﾙﾖﾈ｡4d腔ﾉﾟAｴﾚﾋ｡｣7mI~_(ﾏﾃp､ｨﾒT	Sﾔ0ﾈQM0[5ﾃ\ｵ5,Tﾛ[劫綱;ﾘｬｶJﾃ'F,ﾑ-ぉqﾘ0ﾕ6v,Yﾅ	?桎x'OCN脾IN脾機'RｽN､z(Nﾅﾗ5w#5ｬj'h･vｵtPpｶ:遨ｱH豪ﾕ1鏃ﾇ｣GMﾅkﾔﾉｸJ揩kTｮWｯﾀ
jnQsqｧ嚊'ﾔ凅J腱滯ｯﾆV6ﾀJi}Z*ﾃp5愬ｸFﾗｮﾆ5厂H汐ｾcQﾙxﾓ"u.Dｨ･ﾎ岡2ﾔ澑ﾁ鹵ﾈS+`爺｜ｵｩK&u)ﾜｪ.夾gｾo2f<ﾛﾆ絣oﾟｴ-〆姜亨Mﾔ
ﾂｾ籃5ﾐMｽ	ｫ7ﾃ
剛ﾖｬ?z鷲ﾑCW廂驤ivﾑnﾍ膨:〃士璋uH'ﾀ錠ﾃgu3ｨtﾟ;｡ｳziﾒｧ1ﾓﾐﾘﾛｧqsｶ斟Hwfｫ!ｶe/P#ｽｴaRｷBｴｺ
zｪ軟s!tﾟｿﾐｽ鍍"ﾝｻIﾒｽ葉Bｽ夭-陸!ﾒｽ殳 ﾝ軟:ﾒu+oｾ$+?FZ'ｭﾈﾊO脆o|Gﾐ]ok礫a>鰥慢/ﾃｳU*aTL瞼ﾓｴiｻ｢6P!?;|khYｮ2 lﾏ?4ﾀ'`ｱﾎﾔ笑ﾒ丼:ｳ[cV鯲沙Igjﾌﾆ&ﾀ□ﾞ滝t!A=H孜Rﾕ｣$単燹PKiｮFFPKma5antlr/ANTLRParser.class|	xTUﾒh捏4BaK:!-@XCﾈf摩Bﾒ@ 揆EﾇQﾁDA\@d竡｢".翰牋(n｣#ﾎ誤ﾈｫｺvｧｦ0ｽOｿS}ｶｪSｧNU:釛O<
ﾉ3揣ｳ5sｰｵ. p!?ｸHGpｱﾎ.a隷ﾋ.｣粢判仟ﾖQ返ｰ^gWｱu*ｻ嘸ｯ5Dﾊ]Cｹ
Dr｣ﾆｮeﾗQﾝnPﾘ:b7ｱMl3ﾕﾜL`仰nQﾘｭ:e[Uｶ降o｣ﾑｶSn;ｸ畋$p貸ADvｸ孰ﾘE
ﾘM猾	ﾜK>黔ｿc?@TﾙC*{*P#*{梅Rﾍc倍徨(ﾗDｹPｱYeOP 椄I>･ﾃiﾊ=Cuｦ.G(,蝙｣ﾜﾔ(_何H%ｽｬﾃ,粲佩^aｯRｯﾗT:ｾAｽﾟ$莵(ｶﾊﾞﾑﾙqｮﾊﾞ｣	+ﾀI*~HｹSNS#扶Lｿ八?｣ﾜﾟ(9蠕 w堋裕wﾀWT5蠕!-ｿ｣ﾜ眉ﾀA燹ﾔ/?福ｩ*Jｹﾟｨw&5廢ﾀﾃ:ﾎ	Tガd**粘	htaﾔNhtｦ:'.\"t%Iatｧ\Qzn/	ｳﾃﾀ2ﾃ､K%c@SeﾖJ022ﾕL叩嫉･Wﾅ､C悩ofDf5:ﾇ\O,v>dt哩ﾂ｣Uﾞ[1*｣X庖Uy慳ｩｼｿﾊｨ|ﾊｩ<^	*wｫZ蘢T棣ｱ*ｧ*泛*洟t桧VyﾊｧｨM衲U棗*洸l慕ｨK蟲U>G蚶U^ｬy*浣ｾDｹU迫Pnヽ	('!ｰﾀRﾋTXｮ
ｯTxﾇ販ﾉｳｦ穂ｧf0`gﾔTﾗﾕ遊ﾗﾏ.ｭl霓pqﾔﾅ枡･ｫ*jｼfc[･wHznQvﾁ4oiUUｩ7ｿﾔ[逋luﾋ@3ｺﾕﾔTV*a田qeMﾙ浬O]}ER1帰XI}ﾍ
Ouni仏拶ﾄ螂ｫJT坊/RXﾅnc}
=%)X4ﾋj*+=eﾈ衰ｪﾚﾊ!+ｱKp｡A･aA･瓣･A･羨･ﾔﾒｨﾒ陟ﾒ彭ﾀ)ﾁE腱WQ]Q?、Fｼ_6ﾘ<ｹaﾉ舜l
波ﾂlbFMｹA銕核OnCﾕb捷ｨtq%ﾖи=ｵ5ﾞLｯ輪-2ｾｵ\	ｽ緒OYﾍRd･匯ｦﾌSK｣ﾇﾐv{┬n=ｧﾔ[mｬｳ^YZW欟]ﾐ@		ｨhｺ檳敖ｫt+[)[1ｵﾆ婀QWH叟蘿wg据ﾝCI.技ｺji高ｬzJｫB｡X-ﾔﾐﾗﾗ`,ｷpYｩﾗS朸]ﾛP_X_Z1(Kﾍ52f衾K**=y豢
k=eh;e8ｺ)%xE9O哮･g
7zwﾂ=ﾖxF^P西(4腸cﾃDt1ｻﾙB'ｨﾞiT･批ﾄP9iﾂ	Z稔ｮa1qD"leCieﾅ
ﾏ彗擧~2凉f･ｧﾊS剛uﾃｬﾎ]Z
PﾗPf畝tE6Bﾑkｨタｿﾌ[ｳﾚ｢ﾕｹ+低`P毟Mﾖ4ﾔ"唱峯oui}ﾅ*､｢x|ｼuw$ｹ5ﾙ･=霍ﾂΜQpﾒJｮxЕ#ｷ&/cｫ6ｰN祗pT9ｨｪｨ.Eaﾕ5E定Y\
ﾒ%XﾕM+鴎ﾞ鵜=mｩ､~mｭｧ､ﾎ字n4ｼjE嵩賺ｰUｵ芙ﾙﾊﾃmｶH[9ﾕVe+掌篇7v
'ﾅ^ｪ飜*-ｩﾖ4xﾋﾐﾀｻﾜb ｻｷ4｣險ッ+鹵ﾋ=HｮW｢|llC'v績;7ﾖｳｦﾞS]^娥nm帥扁Sｸ旻眤ﾈIﾝIﾂﾍ｣ﾜ]4ﾁﾔ0敲G､b*ﾗ ﾟIｧr/烱]ﾖsｬ専rHﾐ簣`3|7ｳ薐ｮs^j'Mｸ壤6mｮj
ｨｦﾚｰkjｽﾟﾁ燉)A?炮#雍sJ+Qｪ<螻ﾃE;ﾄ:｣Dl/堆ｧY<ﾆﾇﾈ)N磊ｼ会ﾇ阿ｶaqeE刄猩9ｳｳhORq6躅)6)$9ﾓｸｰ｢<隷Q錠;Lﾖﾁbhﾚﾅﾔ0場椒ﾜｩ<>殲G	ｼ､尭ﾀKﾔPNFRｮ回eﾊ91潟ﾅ蠕燃ｿﾅｬﾌﾁJ(ﾗ場XD^%ﾊｯﾗl	)倥oｷm祉鉐:{сeﾓm 
>qW8I澆ｧ惡<眉安ﾇ>!ス4:ｻﾉ｡ｫ翌nIﾈﾌ妍a省摯拆RT杉Y喋73}zf:n）愡ﾉﾅQv勞ｴﾜ翡lｧﾂ｢ぎﾜi%ﾙYE鰮ｸpEYyｹｸ
錨蒟臈｡ﾛ空)?")qｾg鬩Qkh<qEｭ嬰!/,ﾌ嚀ﾄﾅﾂﾌﾜ 艪刑ﾙﾅ8ｯ8ﾚgﾗ舶.nｨ,ｮ%"ﾓﾓZｲ
梏gｩ =wZ&b袁ﾌ$ｲ囁))ﾈDD蒟c63;虹.1Gﾆ5#;ｯ0ｳUｵ恪迪LﾊX5ﾎﾏvX\ｭｷｦCOｹ!3S｣巧ﾗz+V｡蘢^恁ｼxﾒｦ抱$ｧﾅy=
^CﾔRF^v暸ﾗﾌｪ惧t｢ﾟｿM剿ﾖ-｣
feg囀壮YlEyd2ﾆｺNﾎ恂ETﾏ尓Yh*･｣lﾄY(%+'?;+ｳ色ﾃ横蕚9YﾙS0?3c5bﾏ｡ﾞ-ﾋ\ｰ9!ｳ0ｩMﾉ囑%yｮ暮昼dN)	ｸｯﾎ*+s
Iq]p3rﾓｳK謌ｭｸzｷ9ﾘ2VAn鶸[Nｹ*	Tｨ&PC迷J^u鷓ﾟﾙｭ冰ﾙﾙ+|5ｽﾟXaM+以ｶB=ｼ{5ﾅﾕXﾄｦ姪ﾊﾏc}B}Zﾗd∃Hﾎ81蛉鵯)fSｰﾎVｸ曝ﾋｨｩlｨB盤ｾ｣
ﾏNｧ`+誼ｰｰｶﾄup~0ﾔ+bﾚGﾀmｫｽvﾔｻ･
胙同"
79娥\ﾑI*ﾋ~8ﾛ8#vp&･8ﾜｳdｺ礦ﾒﾋﾌE麥#l?ﾂﾉｴ躙繦()ﾔﾁｴU埠張ｺﾆ迪eｨｶ
U杠ﾕｱ胄
#ﾖ喨S懋ｿ貂B9ﾂL衞ｳ4oH;
-ｺ.(|ﾒ_
-ﾑ色｡+ﾇﾅAI禳EzVW,t畔4ﾟヽｪ7ﾕ(ﾜｶd:	
t1ｲ%:Nﾕ陽っﾔPﾟ>遑蹌ﾜOlｴ9ｺnMｫｳ1(mFsJ+WﾐﾈaF済ﾖ*｣ｻｩ汀PQｸ>vﾁｪ権ｽ)@Cﾛ:kZ7ｫ:ｿｲｴﾌcﾒ-<､2湲捌u均
=a･ﾎgﾎｰﾄﾚｽﾞ遽ｦﾖx蛾
ﾗﾅ*ﾛ鶸"i%*ｲ庫:悔`､･!3(0ｯ:槻幣I0ﾜﾇﾞﾉ｢7ｪﾘv0e鼕ｫO;X&R"ﾍｩｨ,/+｢芯ﾚo(ｱｸ鐃ﾌ･hｯｿAｾｳ彪Qｺ\瑰ﾖ艙sjｼ攀ｦﾚcｫrTﾗ､徽ﾝﾚjSﾈｫ5"繙ｨ淘ﾏX橡ｮｨCEt`ﾏ"凾ﾙS粥?#a6e蛍.ﾐ砥fNﾌwz尋ﾐ=赫ﾉｺ瘴Hﾗ,E7-ﾆ/訣ﾟﾞﾖo光ﾛﾇ嵯~Zｿqﾖo?ｷｿ;ﾀh2~'"/,｡KY ﾐCv'棋∋>瑁ｽ ﾑ擽$烋 ?JﾜｲD=AF8a,Б<ｸ ｺ｢!{$ｱﾁﾙD逗縊g 'ｺ奸眈	ﾔBｺﾑ拜§l!D~ｨEw'&6ﾖｺgh0ﾜﾀbﾅﾁ9%KBｴ0LL!Lｮ0
kR:犒1
y+逢l┬80M@D~s貴ﾐﾙ鮠ｺ峪AwAｸ刹ﾜ艇歸'	0幼､ｳ皃ﾘ6I罠ﾞ稷でYﾎﾅ)ﾄ｡ｫｱ5.ｪ
bﾔ､	*Lﾞ0U+檮ｲh債6j膏'Fﾛｺﾋﾐ曼fc9ﾇﾐ毛掻ﾖ(Di?DﾘE拍育｣	9jﾗF-ｲF揣袢ﾆｨi!G唆住決┳｣rsTD靹ﾞｨｬQbｹｺｰqlｼｹｺ]lｧ'ﾐ,帛ﾋｨｵｸﾝｷﾄｲﾝjD-jﾆd Qﾄ-ｦxj呰vﾊﾘｳｺ7Bﾗσｫﾘｨ･UﾜﾑﾏｷS!bｳ0'%&5Coﾏｮ3ｹ
詣CZl<ｫlOyｶﾘ6司緑Ne'ｮ泊ﾓw｡!6A淅ｳ_PNaxｮ_ﾝBﾟ鉤ﾗ7ﾁiａhｴﾔ{P#HΑyYｺﾂXKCe(ｬrr錣ｪPh+!鸛ｬにｰw
ｪ筺 .ﾅ･Yｸ{ｮﾘWﾀxｶﾂﾛｰ
ﾞ晰>3 怛XﾂｳﾎpEﾁhWﾙ8x哺ﾃｭﾉ8z,ﾖv｡Kbﾋ7!7､ｫｳﾝﾎNｾuﾛpﾂ佐杏ﾕLﾍM瑞纓E､ｹ^X甥ﾄfHﾁt墜ﾎ>疱vﾁL銀ｹQo^@Jｯbk0g5ﾞﾄE{
皹6^'x晋RN耶ﾗKhﾞ&丹ｵ\7ﾃ`)├x1ｩhﾃ!biｯHｷOR$邯ARHM）~ﾑ;ｷｷd拐D*沿萩其ｸh:A淒尸it塲6ﾀﾔ]Mv;us･粡ｸ拌盃:喧ﾖ\5ｚ&k8zｼr/RﾜanT｡昨*y.	ﾁLトYﾄnA<ｷ$ﾜ潺MSd､ﾜjTﾉuX｣)ecﾈ>!4z
ｹzM0ﾂｿ(Zfﾉpｭ嶮DQ秣襍
&G援W%=ｩM0ﾊ介ｮ;Jt孝{nD
}>斫3ﾘB>燈ｶ硫2ｾ-ﾘrﾞﾈ*#ｬ?ﾆjVﾋ歸+ｧｬﾎV/ﾙkvｱﾍﾗLb髢_l67Bｨ"Oｻ柞ﾕ,ﾛamx	炉A宗0")ｻMｹngB`Sﾔ瑟P圀衣]Rﾜ
dfn$WのｮlｸﾙFHaﾗ｢R]ﾙfﾈd7ﾃLｶfｱ[`ｻVｰｻlS嚮!1%a.VｸOﾛ)･I.ew嵐尠fYq\fe繹st{ｮ$3(kш嵒ﾞ'`ｰAﾖXNL1｢耨､FoｭﾓﾚﾆΩ ｪ｣ﾈｩO成-(ﾀｶｶZｪｻｭｴ;DﾚﾞF}`jﾚ"ﾏﾛﾚ~lﾎkｿ
ｭ域登裨ｷ;Pdnｪ%苗ｬﾟ>ﾖoｬ嫣ｬk､ｷｷY:ｱﾜﾒkｬ･ﾖKｭ1忙c,ｵﾆXj些ﾔｧｭｷﾞﾁﾍ0ｹﾍｭｷ%`ｸ(3麩#Zﾀｰ!=
ﾉl/形升<SX慫栫ﾅ,CﾇXﾍ察={nf/ﾀmEｸux反Gﾘp拳ﾙ)媒ﾄﾖｱOﾙﾕ3ｶ挿ﾇｮg@ｻ吽ﾇ~Aｧ;pﾎrWｸw篆x/釼rﾞ旛ﾅｯﾏｷ$崘e,C競Sﾐ篳|ｦｸ椏e飩W!ﾑ2Zﾙﾁｮ+ﾘa･]!ﾒｶ6S{;:h鼡Oo9｡ｬ 鰤ｬ`ﾄ｡J獻寶縁0><
ｺｱﾍﾇﾃ8>	鬢C&ﾏ<楽非\ｨ錏pn=,ﾍgｳ>ｼ版qﾎ+ﾘxﾜ ｧ*v3ｯe[Jｶ拈ﾈ范ｰ=|兩ﾅ澹｣_ホｿ5障ﾛ~MﾋｧKﾋﾗｵﾒ1ｮｷ4;ﾌﾒjﾒrｬ`F#Lk[W柱m)ﾓｰﾜｶ･s7惓ｭ7須,gｧ俸	創k｣>0ｵｿｳｾﾈｴo9Xﾎm^]h9Fﾋｹ-轜ｴ!ゝZﾎ^8滂ηｼ	<	Xﾆ氣ｵ(\ﾁ_
x請M8ｼﾀﾟジJ榮CVﾇ若聆*=ｻﾀnd_渟Wｭ ｰｃg掣≒舖.|ｱ珞5Bo+6Kﾊﾆ0$ﾍﾏﾆ驢, kﾘ3兼讐｢ﾋ甥ﾝKﾜ	r#l%е5=ﾜ"Z!ｸ1ﾂ 	ﾂHHRa0ﾚﾆﾎT_袴ｿH
｣ﾃu$0/~鎰（&ｺ莚ｵy亰佚棲l警*.點'g竇安ｦT鞄M膵ｺｶ;
｢gC$ﾎ+LQ0	4a2Lｦ｢逢ﾁta&
ﾙP$菎B!ﾊ"ｨfA0ﾖ
s瀉a\),ыB	lﾁva	<(Tﾘ5ﾍｿ|ｭ{ｿｼ6Rｶy淋ﾉw#/QｼDjA遙ｧﾐ}Фｸ亅ﾁ-ｬﾂZ(\銅'ｵﾎﾆ蔬ﾝLn@&ｯG&o@&oD&oB&7!筒陀-ﾈﾈ茉6&ｳL~c]ﾐo
`綴"0Oﾌ.L}--ﾋｳｴ'2ｶ具ﾜ\ﾋ蛸ｮ浙｢ﾏ<gG鴇ｬｫ造ｸ(U飼#･]ﾐ/.豈賭ｮｼ世｣H1ｲ84qtGB､
}ﾄﾑ/拶ｩ合"qﾌﾓQZ殿汚ｵb&ｬｧﾂ･4ﾘ"fﾁﾝｸ甓q釡､咏Sh~椹ｭｱmﾖ5ｲｳ;ﾎﾙA+5ｻﾇVﾏｰhyxﾛr>ﾑO#9ｾﾁXK效ｼﾞ｣U
踞ﾑhﾋj6ﾆ爾:ｿM/ｴﾄu｡%fkﾑ屍'6ﾁFXﾗ羅~ﾉｵmﾅi684gﾑIﾗｯﾎｺﾆ4}闕ｪﾒVﾌ"ｲﾆ?.ｵｻ?堵｡株｢,F)G｣Z*Rﾄ0Eｬ\ｱﾅ鰭L^8_ｬu稻ﾘ ｮﾅｵp休l/⊥ﾅ+!*ﾘ/^根ｱN禽ﾃg
ｸﾎ姐ﾂ秕結;*d.nﾖ[ﾜﾍﾆ悔ｲt>6E|MesﾅfV!>ﾅｼ!vｭ,ｻA|士彰ｭ6Uﾋgｩ6ｷTk*Z泌lrZ|e麝ｮ+J｡ﾖｫ拳ﾌMｬ
ｬｳ'ｱﾏｾv亭dZ6U彼黍｢葯B縻z奇K:)秬!M&'!Sf刊P圦ﾑﾘ>
Kｨﾏﾘfw+ｰfｷﾄzqﾄﾝﾉｨH柁ﾚ｢ﾈNt丙Jﾀ"9ﾐ熊粨X ~+ｨ竢介_ﾈﾛｯ(ﾟ汰ﾛﾆ/ｲ@3v =ｦ!S&ｱ4勍)ｮﾒ4払饕j傚鷂跿-Vｭｸ阜ｸﾌﾃｱ~cｭ_,笠ﾞ禁復ｦ淌A0cekｳ5ﾖkｬBk,ｯ5ﾖf+	ky4ｵ蹂ｶO`s`ｫyｴ?V
lKFﾐｼﾒmｭﾖﾂ|h9ｸﾍﾑuｮ藕&[N`ｮ衫觧ﾎgｮ(貅掵-､旁ﾝU･FE鯱ｰX
p>強"^J,^J,ﾒ,J,J,JL)Hng\ +径@\ﾖﾋ1"kﾍhﾜﾖｸｬY-ｰﾆ[炯949茯r3函ﾃｨ･θn;ﾜoｸ5ｽｸzﾎ〃ｲｵｭD儀+ﾑ'Kﾎﾆﾋ紘7ﾝ惓b;撥3U啾iﾛ3u7=ﾘ2%ﾋ伝ｾヱ
4[e{jｶ･P}:J蹌ｻ-ﾜｽｾｾ8♀飼ｺ叫ﾔhws{d6嶄ﾉ.GA$ﾐ$%\ﾝ$DI-uだI族D紐wX%K､8ｸ\屶D8&%ﾃ嶬xOJ￥･｡pFﾟK｣'icRﾓ･Iｬ渠ﾎｺK添_)%J3Xｲ藩&J,S*bﾗJsﾘ&i.ｻ]*fwK虱ｷｴ5I菩慎ﾍﾞ西ﾜ)5ﾒ*ﾞ[ZﾍIkH駻>ZZﾏｳ､刷R騷ｾ^ｺ＼'ﾝﾈ7K7;､Mi;Xｺ?#ﾝﾃｿ?､{OﾒﾃWiｯ&FHO｣･δX髏0AzNﾈ顛j･cﾂj"餠*5a偶鴫U:!ﾜ'H
終ｧf#ｱVTｬ>WK?H7Jｿ骸､ﾟﾄ]筑(歙垈,ｪ嘛ｩｽﾔｷN*ｹVX5p､ｺ[	ｬ7^]+ﾌﾏ>掴gﾞﾆｳGｴﾂｭO*ﾖ-:ﾃ貌PeﾂeｺﾋDﾋ拜ﾜ壇'塀ﾀXﾙﾅr/(謄｡J竺ﾍgﾖyｬｪ｣俐d9zﾊ	ﾐGvﾃ9ﾜr倹ﾃDyL宥Aｮlｿ:夬gOﾈ"咐ﾙ?悉"ﾚ惚ﾚ志ﾏｱﾕ紅ｿｲw/ﾇ-GYy<頸*O3!^
C臀#蹉|檮ｫ9~ｮｶYkﾅ+ﾒ+踏A;ｶﾚ/ﾘﾞｲYﾉV=勸ｺ袢ﾈ千A､ｼｹWｼX兎dﾊK!O^s裹6也}水,ｳﾕ8ｿｳ｢ﾁaxK~射ﾇ疽}崙踵ｭｺﾎ"u｢ﾛ9(Pｵｽaﾍｰ房ﾇｩxﾓｴ/h<マｩ/\j絖"檻x懿G袞!QFﾊﾟﾁ3ﾋwｩ=7nL|串ｴﾄ8ﾇｬｲ=ｳ･P}:J蹌嵬掌ﾗﾇw	
f｣sﾎﾉZR
]P､B	U愾ﾁ!8*氤cｨﾇU\｡ﾒ
ｾUzﾂ/J/&(ｱ,\鰺ｺ*	,FqｳA1|ｿ墻羲PD?ﾚ\凅_ﾄ嫩ｨ'~'l､\
｢2te$8謬隕撃he4ﾄ)c IIゲﾊ87|ﾜh?｡斬\Nl}vettﾕﾊﾒﾂﾄTGK4^-<擁0U庫撫}1E+o屎Tｷ31ｰﾓSF'ｵ.ｦNt3~I｣roﾀBﾅｮ畆耄ｨｷﾜ^ﾙB$ｳgg.ﾍﾈﾟ'ﾘﾉ(m?\ﾚcB wﾝ侶p｡ｧｬq餤鮎ｽT鮎敞ｳﾐ>eK!馮=NJktﾝ2跫ﾛ? 孫ﾗLﾏv@ﾛkｿO心ｸ kC滸ﾄ(-*,ﾒﾑ陵ﾐ(ｾ扈9､ﾈ豢> 孫ﾗ孫ｧ#ﾐ>mK!ﾟ)EL蛮ｶVX揆有
&	~ｸ｢ﾖｩﾐ(iｴｮG]ﾂ%{aｽﾟ8ﾛ邉瘁ﾉｯ:GｫG[ﾟｦ/港ﾚ=ﾝﾍﾐOﾂk}ｿoｭｷK1Qrﾇyｿk･;Hﾈﾛﾞ
L;ｮ-渺?X%:｢~露ｵt(ﾂﾒﾖ/}p比ｦｻ岫af蝴Fｸ･Q啻4];ｲ
*"	ｺﾑmﾆ=DuC#ﾌﾘｿ躾ｸｶEﾍNﾗ旁ﾋJﾋｵﾒ泯#オ筈cP2d%4e
8猫隰L2
",陦ﾌ^ﾊLQｲ｡ｯﾓﾈS
a乏%ﾊ,ｨR襪ｽr>\,uﾊBﾘ､氾-ｶ)ﾋ`ｿRO)ﾋ畉･>Rｪ灣･ｾVj'･､
PVｱT蕋V､\ﾌ)硫Eﾊe<^Yﾇ燈+e=泛\ﾅｧ(ｷiﾊ>Wﾙ-ﾄ*
方蛬!UyZ｣f(G"｡ByEｨQ^蕃ﾅqﾊ[bｶ丼ｼ#*ﾇﾅyﾊ冷ｱZA\｣(nR~w)委ｨ 杁咥果ﾅｿｫ｣*漢ｫ間Kﾕ･$ｵｳT､ｺ､jУｪFﾊjy%週{ﾊﾕ^T5EﾎRGﾈﾔ1Jｬ:Nｨ燦Rﾔ	JｪZ群g+3ﾔyJ:_Yｮ*ｵj甸U]ｪﾜｩ.Svｪ別ｽj奉ｺRyR]ｫ<ｫ^U/RｾQ/V~R/U#ﾔﾋﾔhu:XﾝNPｯｳ硅ZｧﾚO}OE_綵/ｴｼ
my)
艝)2ﾏ%腓村	Du韭-ﾐYｽ"ﾕｭﾐSﾝﾕﾛ`z群wﾀDu'LQ.ﾈS｜u7,U*u塾n%ｾg0a!ﾖ｡c^:ﾔSuｿUﾙ鵬｢ﾃby牧ﾆ卮ﾉ椰[ｿ[uxmｾ1Y}X赫ｩ廐
韵XｯOG2ｽ\掌]OWc0xPa
z %Qkｨnﾁｾﾕx埼{h遇obｶ14ﾍ?ｦﾒjLZC>[ﾝ亂%圦(ﾍ/嵎ｷw縣｢ﾎｮ6｡ﾞE=ｺﾟ碎澣氛)隕>
Q鸞丶>Sﾕ![=
0W}ｪ/ｳ+ﾌｭｾﾊFｨｯ｡6ﾂﾆｫ浹\岫~ﾅｪﾔｰkﾕ湍fgｶMR･ｻ=ｪ1ｶ_冐ｰ&ｰ5狛ﾐﾂﾙ)ｭ3ﾍﾅ-ｇk]yw-追hｽ-'jｽH-蒋-j	|∵踞Z
ｿRnｳｻE~ｻ{咆ｲ;1菩.`ｭ{`^慯_ｬｱl.ﾉｲｹ,ﾓ綬Aｶ?p｡tdk[K"Sﾉ6俗
:\真*"ぱd;ﾐ}ﾖA8Dﾞ^q鮎==ﾗm!3$m2ﾚ|Ouｺﾖ$1J給P]Ly先佰ｴ>枯bL{斬ｭ1ｬ'Vﾄh崘lﾞｻmp-
Dm,(ﾚ8ﾐｵｮMｧ6	"ｴ个Mﾚ4ﾈﾗｲX-崘h9,^ﾋeﾉﾚb6T[ﾂ&kﾋYｶｶｕj+ﾙRﾍﾋｪｴ:Vｧ5}ｮﾚZ棗]6z!洫ﾝvｺ儻kｷ5ﾚV~｣v'ｿUｻ近｡狃ｴ暼!n~Dｻ料､ﾝﾇ_ﾓ鉐hSﾚ;mｯﾀｴ}6ｻ.ﾙ5埓`ﾚ@v-Z_.Y_)UZ~様8ﾚｲ1oﾘn$sｾiｻb､ﾘbｻ0ｭ倣潅{
*0｣ﾛ桎kQｿ曠z
為察ｲ,糊梏ﾟｵﾗ^be贅>d腿ﾇl7未}ﾎ2ｵｯﾙLv樢-屮}=[｣ﾄｮﾑ~ｵ鯆bVf黷4=7ｮ｡倬ｾ}芯~\48ｺｶ>.ｴ*['ZD入箜_ｱｿｼ諄
)ｹf ﾙZﾟｷﾒ'Hﾕ>|/ﾜtKｰｵ｣[胚り`Uﾔ]ﾎLTﾗ^
耆ﾛCﾑlk;^ｨﾄｿi刪ｯ･X`ﾝｭﾔｳχ=Dﾞ^ﾗ=Dｾ-｡ｻ'ﾃﾆ2ｷﾀｾn鈞ﾀ蝙o>l｣ｿﾎﾎsﾓgｷ-mﾍｶﾛｨmｸﾛ9$ｰｭ渟ｶ撈ﾃ_渕
u磊歙ｸ|sﾞｷﾓｼｧ4Bz適	Dﾍ魑ｯ1wｾﾆ柁_s掾､sPu:tﾕe尉p:糊ﾃ`ｴsu'碑]ﾀ｣ｻF準偶(ｸT
7驀6ｽ<ｬ}8ｨ鋏Aｺ'DYOf>桁ﾃY>筑ﾏ蔔雹~=?ｮ銛Cl~T淌_ﾗ銓cｽ･/?
7}ｭ獎/ﾞﾖ/ﾞﾗ/>ﾕｯｾﾓo~ﾔｷ兇ｾKﾔ{ﾄｮn1V@ｪﾇ齒Sｽ67Zｷﾟﾁｸﾝ#z=Hj俘w｡cjvﾙd :
ﾑﾑm~DﾀY聘ﾗf`.[ﾃｮﾀﾕ)ｿｳﾑ孅u猝4飜<=ｧ?ｧ!Eﾆ鍜`ｬCﾂﾗﾝｮ/&ｺ0ﾉ%ﾂﾁｮ3転_!糶a危Г]ﾟ"踰疳ﾗGｸ~@8ﾒ#ﾂTﾗ?屍疉ﾗｿ子0ﾍ3ﾂｱｮ_市角ｼ7\ｿ#懆w當 ?ﾀﾙ颶1｣0ﾃ,p｣Pg｣p兀債蒜A2
ﾍＭｮ2害ﾘhT｣pｭYﾐ個ｭfA7
[ﾍB浪ｸﾇMgXｻ<ｬみVﾍnｫcｭaMaｱgﾃ.gｯ]ﾅN]ﾋｾｻvﾃｶ.a;{[ｿPKΤｴ7E.ﾊmPKma5antlr/ANTLRStringBuffer.classmSﾛNQ]gfzｪﾜzZﾄ*炙
T	)15/	ﾁ[JIH>DI_|ﾐК｢OL|ﾓgq晞ｴ惜={殷ﾖ^g=ﾟ|=01:nﾂ4C:匁茂ﾐ -3L#ﾚ啅P訳桂望qﾖDﾁdﾕｮ:Sｪ掻%7W-‡bﾕｶ豸ﾟ妙Bｩ\cF3
rﾝ_ﾚﾚｲU軻5･･lｭdWｲNｽjWｸｸ峯R}ﾚicﾍPﾅrf<囁2X染C,'a}Fﾁ%併｢ｧ1鑞6i"Fb1}~sｻｾbﾍV･ﾌﾘﾜBesｭYoLn	｣aｴ!ﾆ\&F=aD鑄蝠F%ﾛｩﾕｳHﾛｬｼaｭP~ﾀXﾎﾘ%､x:I&KK填騏ｩ┯酉C"}ﾜ<0ﾅS=jv|癇@m>ﾚ.ﾒ\%u;m7s流ﾛ#""ｱ-d卯ｹbpﾅE9ﾘ	壌W%ｵｹO}('ｻ腕}Nf捗ﾐ得\胖wﾘ7ｧﾞﾓ｢堽!2黯)QmbqG砕讓Tｲｾjbﾑ\｢ﾓﾞPﾘｹ｢qｷEｴ険｣
LaC|`迩30&^ テ減jcg'W}j.9┯.3<"~槞=ｲｼ維\ｽｬﾞ)ﾁｺ崇湮6ﾝ崋KP/6ﾁ2内ﾏ-ﾐаﾊ.↑ｭｬ9B.DBｽ]	ﾉﾅsｺ+m泰ﾎｮｾ煢N%垤ﾐf&ﾘｺﾝ#c墳hj揩Gb悶X瓊涓OI7@ﾟ､M#蛄~C`I椛｣!ﾘzﾔ邏)wﾞoPKｫQｵｰ｢PKma5antlr/ANTLRTokdefLexer.classｽY|盤ｱﾏﾉ&嬪XBﾂ+<1ﾉ'4ﾄ色6	&QIﾂ&|yﾈ>ﾂf･Ul}ｶk[ka｣DA|ﾀﾕ^ｫﾕZｴVk布ﾕ技[%w贔/嫺R~?ｼﾍ恙sf譖?醂9Y^>ｶg/ｳV\c畛jｱﾑ危lｰ炳+nｰ!･F麪cK7越ｳ嬪ｰ鮖Uz6ｰJﾟm"ﾝ.l恐;Hﾘ遵ﾝ).awﾇﾝﾝ"ﾝ#^+賑'ﾂ~*lｫ
羃ﾍｰVaﾄ]ｼGNｩﾂwQ弓ﾈX頤K竭ｶ繽xﾟ?;>V?[蠢ﾟﾑ UzΡ苑dｧ7!3jrvcﾂｨ^萃ｶQﾒcﾇﾊ*｣FﾇLﾔｰWﾄ'租｣｣ﾌGｦZ衆歇ｿv塑~/
yi攻qｻｼMｹﾜ穃ｲ縊Z|nﾇ?)A褂>.ｱSﾔ｣2ﾙｱ\ｾ頻+p	il%qﾉﾀｿpﾌ思Qﾗﾈ;`yｱc-ﾖﾉ僚ｸ\､+Ь疫|ﾃ竺{04
ﾃ隣+}/vﾛｸｶB5k[ｶ_h|4\mzｵm纒\｣;[ｺﾟ蘿[ｪc俑@q03wﾄ"ﾍﾙﾏﾞ豐剃ﾗﾙｯ+#,#]姪並ｾﾜｯﾚ^ｳ
勧FﾖVﾞI9ﾇｵJ7ｭc俐､膵{]N(瞥ZjJ46k買2舎zｱﾏﾝJm.RVfｾｨOt,ｵH26ﾟS|;FU-ｾFr繦ﾇ_壁ﾙ｣蚫[岫I
WvﾟL;$`ﾀ;ﾊｵ畭 8ﾁ妖ﾆｮ)ﾐL姻ｸ
ﾍ2ｧb	j齬ｹ
ﾌｭk)ﾈｼzﾖ･ﾅa軒戴M鑽}A酎oｮRqO4>Z當!Vﾜ幇ﾙﾅFﾙKﾏﾏｹﾚｮδR,聆ﾓ(9ｸ%GﾏhW亊ﾋhs+7噴蟆穽蹟ｪ=ｳｪq峻Agn3ﾇヌｼ瞶ﾘ鋤Eﾜ糺q嵎n[S?n	稠Dbｬﾛdvﾋ4ﾜ哺ｷbﾄ#ｻ$i餅ｰi9歓ｶプcpo雪g槐<訌?ﾏF絖mﾁ･ﾆ}ﾁｯKｶ階 '壁ﾍﾗB"?ﾔ4NbZﾇﾟ
迩	EﾋｧJ噌I'宣bL:I且mL吾ｧ丑4ﾓ}Yﾙ｡ﾚ.､88 ﾊ0SyJ乃SyD4Sﾙ*ﾊpSｹ]ｦr(#M･ﾃﾘ4灼mｭﾅ將CFﾇhｦﾁhﾓ ﾟ0HIﾟﾆI0Fun､1ｦ緞慌ﾏ4（b'2雅A$U*R捺K;6ﾉﾒ>6ﾗﾒ3jGY:揃oｮe覇?rﾆｰ.hﾜ,rvﾏﾐ媒]侈zgu"w幀Ro SUｯKk韵#ﾛﾐ･}Cｽ/ｭyﾆvb棄ﾆｧi:溯<>M3ｬ衲G呂1>ﾃ<:Ｔ鑢廳GQDﾇP｢箍P%｢T%c喪ﾀｩﾒPｮF5U*ﾕ*
JﾃJ]藺伏
ｷ*G揀VU祭j	j*vｵkﾔﾕXｫﾅ:ｵWｪｽｸJﾀzl瑟ｯQo畛ﾎznPq｣峅3ｶpS1T雪J@h松L伍ｴｦ躰ｶB_pｿnx+B朮｢%Rﾁ俶1M征ｦ9&юD･覃2у喞瞰ｷm纎蟆ﾂ権偸*'^fU~7ｦM=)cﾔVdicxgTLﾂﾌﾚp｢ｳﾒ,fﾆi抹敲aｶ6聞No%ｬ綮ﾜ仕lﾁ`ﾜﾜｸ%ﾘ界ﾘ
<<ﾄｷB棲%塁G･暼桎めdｻ
$nﾃﾓ[eﾋ}x3ﾐL茣慄{BF拜"B4｢ﾉZﾊﾙ!ﾌﾙ音ﾆdCw7ﾟｬP$7Pﾈ､L､ﾓM､'!bVｰ=(H*也#旧ﾆ%､ｾﾛ^蚶戛勇ﾞﾃ?ｳG孤gｸ◆ﾁｷ祠F+ﾆo呉ﾟ<ｿ冂ｱEｰｳ俘=狛擲+dﾂ捺
2a'蠧@1E)輅灼ﾎ	vｿﾁﾆｵﾏｺ_ﾜ鋭{孫>lｨ乏ﾄ｡O}ｯ9ﾊ|ﾋt#補0逑G\ｬ(｡D,｢$TQ2V-
･a5
ﾇU4i$ﾑRz|Z{ﾁz檸ﾑX5G6OTｧ醒垢2塞`ﾊ)LﾂD嚮,ﾊ蔬ｳp>eImﾀｩ%rj9ﾟYjgrjS8ｵ\Nmｧ6抓ﾋ耿frjｳ､8ｵNｭ;KlNmｧVﾀｩrj9ｵs8ｵ"NmA渣ﾚ"ｩ7S[伏9萢ｶ;/.ﾁ#;Q|ﾜﾎ0ﾂ讒:掃ｩ4TﾂYATaT竺T´Zt
ｨｨ紛ﾒ2ｴﾑ%陟1適?nﾍWf]xrjs4ベvﾋzfgT<ｾﾀ搬ｳﾆﾛ\ayb嗜ｶyf;ﾃlgrｾﾛｸ抛ｶf;ﾛl1ｽﾎTﾏ(S#S'痘i董>ｦﾓｦvﾎ%Qsx･ﾒﾍ74Gﾀｶh斯CｸYs4ﾂﾕa艫ﾔ｡9ｲﾁ杤5ﾇ4ﾇﾎｯ箒q}X垉Wﾅ+痿ｴﾂPtoGｳｬqIﾄ8'b<ｾﾇxxｯｱｱ!JD
5c,!袷檍鰆ｯﾛ;f:fGO筅BKﾟｩ;ｲ%ﾘ{a鑁;ﾕｿ_pzﾞ
|t6ｹｱ媚ﾑEｫｱ瑠&_ャｴｯﾐ蛉斎緡ﾚwh#ﾞｧ!ﾝэ馭|B孀нｯ|Kwﾒdｺ脚ｺ･Z	ｵﾒ6ｺ益0椶ﾇi?｢ﾃｴ寰PｧJ､=j"=ｧｲ閇5^Pﾓ颱桧ﾔ<:ｨ贊ｯﾕﾅｪZIｯｩK鮃鵲zCﾝJo9u葬rｵYRﾊ｣Oﾝ滷ﾙ峻x)ｿ孵;ﾚ!ｧw1迦C･'8驛>ﾉｭ噂ﾏ#OtrC
{$孳螽>9_ﾄﾒ@>ﾟ%ﾃｧ鷓刈ｼZ\RKXﾌﾒE糸ｷ肅ccﾞｩ汳>#+}IC+J｡oh4独ﾒ1ﾊWDﾅJQ刳｣&On片"ｻ,R拉ｭ7jaｭ爽ｿx"UﾓD	_瀦]ﾗｻｲufe#Hq詩!ｬ満$5@･ｧ叡ｿ[eｶｧ"x呉}ﾍｱ\ｮ緜ﾛ#gﾘ]Aﾄ晝9ｺ#契ｮ瀦
χ`JT#ﾈ｡Fﾒ0柊駛阪Z>[擂:ﾔlｵA擯ｮUﾔ&Uｬ6ｫRu楴SUｨｭｪR=ｪﾕｵDTｵ鶫UｧﾞVﾋﾔ!>隨#Rﾝﾟ舖f褻冶啜痢ｹ｣ﾓ"wtﾏ}恙冒ｹ_n煬ｿ	>褝bｼ!ﾕ
ﾆﾅﾁJﾇPﾕ鍬ﾕかﾊ巷蕕彬ﾅﾊ循ﾕfﾀj
6ｩﾋb;Z淌鴣<ﾓ	柴ｧiqｩ(]l)HOﾘ!Zz*ﾊo$NｱH){ｺ
ﾎ絆郡Wqﾄﾋ虻隍"^ﾃｯ蛻9穹"漫Tﾄ8簣qGｼ#^厩aF<#ｱrｱfIﾅ九渓ｫ~ﾈqo羣ｷ3[0Yﾝﾁﾘ^ﾅcﾗ2ﾎoVｪk櫂M'.|sﾃﾊE2?ｬ\l(辭%Rxﾌ6ｿ｣ﾕfdｩﾈﾈWPKw稍謝
 PKma5antlr/ANTLRTokdefParser.class晃itﾗ柩iF羈ﾂDﾃﾞ-!畝T8ｴ6"親ﾗ2Rg,ﾆｶ@#ﾉl-mJ6ﾚ!iguｲﾊ4 McﾚｬM$MOｫｷ=9iﾏi{尅-om}腫ﾜﾞｽn3~軅ｯ_POﾜhﾂI)
､5Zg做iｸY
怠苹1馮ｲｱﾈ~09ﾈｺｾﾉ膽ｬ bsﾟf;Lna]&ﾜﾊﾏ}Lnc蓖ﾌﾝ｡潘
pDﾃ}
w疣&hｸ1ｹ_ﾁ問A^ﾕf慍Ef浮ｪ相GT<ｪ1将xBﾅ*自P矧ｧU<｣禳ﾏｩx^ﾅﾘ54%訖V鰍Wｼ&6ﾒdｶ=的
鐶ｹXﾁｫｵ暹ﾌ31RfN`ﾆ酒ncｯｱ"i､{VDﾙDｺgT&j;W
ﾌｷﾄ3ﾉ､ﾏ'2鰤灰ｪ/ｹ｢1'続W(93o辨VSjｻｶC|}f悠瓮ﾚ倖ｧｺﾌlｻﾑ弗･ｧｪｪｩ輌ﾖﾋdMﾙl&+pEﾍD什｢ｭ63樣I'ﾘﾏｦqｳ)Qi鰮fdﾓpﾕ'Hl畋ｬQ7ﾝﾝfvm!3';痺ｱrﾃ4R鄭>XX楸ｯ_V#ﾕE3ﾙｸｹQ:0ｳ!ﾒn#峠ﾌnﾋﾝ:ｺ｢P& D%ﾑc$
F+ﾝｯ.0]dﾍ曠.oﾒ･uﾄﾐ｡#革ﾇqBﾁIｧpZﾇVﾞ>:
ﾒq緬Vlﾓ>ﾝﾎｧ1|]ﾇflﾑ:v29ｧ<ﾞﾐqu\ﾂ:篋I`ﾎﾔ｡罘靱Fｳ執ｳﾙHｦ#ﾁﾙ昔諒ﾆｶＢ麟ﾛ滔ﾞﾑ.ｼｧ繃|紊Rﾀg魏ｪ2悛ﾋRh､ｺ2IｱｿﾂｯFﾇoyAｳg|1S>鷂rV啝62ｿ旗俗疳g{[SSgｸ･eKﾃ
M
!"ｮh{[(ｲ汚h4ｴ)BLｸｵ｡ｭ甥6)EﾚI|[筏\ﾟﾒﾜﾜﾄ;Zsﾉ｢ｬ)ｺ^ﾀｹ!ｴ)D+ﾗv尸_{_ﾇ.桴ut
g%>｡|ｨ蟄菟xOqgｲｲﾒﾛ|3｡憂ｪｬＧﾗk喃僉5ﾍ巧f6:K閊ｦ5Dj'"wBｲ｡ｧ9{塹\室ﾏ啅aﾙlﾔ:ﾔnZｯﾏ$S苴ｲｯ8^ｴﾒ9ｻ4ｿｴSﾀ=5｡ﾚﾒ	BWpｦ芸ｼ夕ﾙkｰx2ｭﾄ)#|}ﾝ豸ｦ嬰加ｩｦ6kZ4fVMｪ(ｱ邏ｹ?/0ｽd
､fｧTﾙk$ﾍ墨▼桃鴪ﾝNM､)ｶ)ｦU%ﾕ口ﾌIｴﾋﾘTﾉﾗ詰ｻｩ(ｭ*)ﾈ~ﾐk+lt､言ﾌ=5填ﾌD5ﾃ	ﾛ4~I9･ﾞ齏ﾍ9ｺｳfﾇ賍,､FlB9}ﾕﾐp･7､$廡r-h%5ZｭC!9ﾓ猷怐D98bﾞｲ!農斎ｾｾXﾀU>0:ｬｭ暴ﾂﾒﾓ}nｹｬ	HﾆGｽX;,ｰｷ撹ﾗ0fl%齟ｼ3~+f=`gﾝ'閏Fｲｮ#z/褓>ﾊﾛﾔPﾍ>H<
4ﾓ艘齎｣4ｿﾃr<遮x諦
ﾔｧｨ	棣?C放,2x{1H嵜@ﾚ^$Kн勁_ﾁx丙ﾗp埓??ﾂ	|鞄}>拝ｶ&dｼf'ｳｳﾉ~}|@.u8ﾗA3
jo%ﾋ Zﾞ甄jﾔ
ﾆｲ&ｾkﾋqｮ+ﾓ隲#
!#ﾒ忍ﾈ{ｾ+｡R仕xﾚJy56\3逼rﾗ*ﾐﾝﾂU,ﾒｰ;O･Bﾉｳ&=g42ﾏﾊTｩTﾔﾒ^Oﾅ*Bｮ/"ｭoﾐｵjjﾒbﾏ萵9-ﾃ-ﾗ_ｼ<ﾈﾇq'2ｦ,#U&掣 ｴ鳫aﾜｧ｡ｮZｻa=u晞\ﾎ躍Dﾚ^]Mﾐ Kﾊ2'ﾌr損D.3WﾈUf5ｯﾆ\'o2oﾌﾛ訃>ｹﾉ|@:d>"3汾O兌鵑@;ﾍg?PKｦ鴫;HPKma5antlr/ANTLRTokenTypes.classmﾖﾗvﾛF濔ｫPｽKｶﾜ{ｷ鞐W"PｲﾓBLﾊﾉ,･ﾗ量E 蕪!=ﾎﾉﾝ~ｳﾇ檻{NｿI1ﾜ5)､%ﾅ､ﾙlｴｳｨ僧FI'ﾀ2)ﾅｼSｱ0
mﾗﾝ0ﾖ媛ｩ)ｦl+P杪YMﾜhSt職kqｴｧBﾔ<ﾋ)NRtX蛎ﾃ,ﾗ!螟/ｸfhｺ･池
工1ﾓ{YW鐙ｭ7Eｪｽx?8&ﾅt/gqcGﾇﾙZ;ﾞ3!ﾅ\/､q\者vwfR栢[ｦ忿･顯VQｧ8-ﾅｯJ紅0纖ﾏ~E囎bｩ櫺-J7嶐hｻ泥ﾍﾎI1aｮ?<
ou昌 ﾅ!ﾗ｣ﾑ｢C榱a	;麈rX害ｭﾐSk8きqﾋｰｲ,ｦMSﾋR,亳ｫ;換ﾚeﾃSZﾇ}g憐ｮ$'､倆E[i3境YｼC'ﾙVg;ｩW)z岸C+ｭE咒､ﾓｨﾝ*薩3R^1|wgﾙCi忖ﾒn7戮=Lﾗｮ9ﾏｮ6ﾟ%坦ﾉ \dｩ｢_齋Vo6h(ｫﾖ(xYｯbｫ^Eｯ錆ﾅ"]E'犂ﾋ榑~
9ﾁｪ*Z:滔xEEｽ3ﾜ}+麗汗ｹ<^d別ｶ･4oRﾂｨｸｾ[xﾇ貌ﾐｻﾜfuh!Cｶﾓw2ｹｬ|f#Rz/~篝Iﾃﾘｻ`-羸1J鈞0ｪｾ5OPｺﾞD?ilAﾐｵzﾑﾌﾊs7/ﾘﾐ~､逕mｳ天羞z｣I
'ｰｽ>ﾁA+nｯF{串%i?虹ﾐt>ｯ.ﾚｶﾋb@BCﾐ!1逖G濂1x忱枦桙ｧ冏澪9x框^d^3＠剌Bﾇ湘'楼ﾂｧ楼ﾃg佰ﾂ逖ﾏﾃ/ﾂ利/ﾃW弍ﾂﾗ弍ﾃ7聾`愉;{｢ｿ"稟=PKTﾐ7ｸﾂPKma5antlr/ASTFactory.class氷{|[U6Mﾒvﾚｺ6[&::侑ﾁ`Vｶ瞋nPpｰ,ｽｲ･IIn堤DEE!*Cｬn系c0ｱU睡( ﾟﾟｽｷi跳ﾓ壮ﾏ9wｾｿwn檍ﾏョ,ﾄﾟ<ｨﾁe.\ﾂ蓊JqﾍﾘY3ｮ貰｣s寛ﾓk=(ﾆuｲｸ淆2､7ｸ)n;ﾝｸI棔貰3nnv盖97>/亶齋ﾜ&ﾃE8_雪誉塙_低ﾋ2ﾜ鯣.yw,ｾ"ｳｻeｪCﾖk粱
7ｾ)zﾝ翊ｷ<ｸｹ0ﾂn7ﾈn慕B?"ｪ遁~ﾁ8 ｳevPf秣壷#ｲｨﾟ滅c狃uaLa坡Q_ﾞﾙJ鐓ﾛtｲM-皋X8ﾞﾗﾔi$｣ｾ･
袢Tｭｱp*･0=χﾜ"e舞ﾘｬﾇｨ+ﾁ誚Gx@｡ﾒ"4｢ｱｦ3ﾂｩ孝xCL轣ﾊ昔ﾇ更r^k｢ｿ?9ﾂﾎqr5｢2ﾊ､
ﾎ謄ｨｱL!ﾟﾗｰVﾁﾑJﾙJﾚ｣q=4ﾘｿAOv	卆Iﾋ)ﾝ7ﾋUｾﾕ妁支Vm玖F4ｧﾓt#Xouﾃ$6)
-6Fc=

ｾvS&n&瑠ﾋH"ﾓ#&ｴｼ2ﾙ9#I=lｹﾚﾗ0卍,:ﾕﾋ爨哭Iｾl2｣X茆J)蕉1}qﾂｳ	洲ｬhｨK,ｳｯI速ﾕH$ｾﾃ:暸ｼ議{4eXｳｮ､N7:ﾃ廂8ﾎw甓[ｩe2ﾃFb~y2ﾞ~ﾃEﾂ燐s	ﾊS谷ﾇｭ數鐙ﾇｫ慘jﾜ泱ﾊ	|ﾏJ} ｩGh3xu_FZ薺ｾ)鵝uj鶸z2)^pZu@a､<<<揄ﾁdDo徽%(!f[8Bn_(､ｾ
ﾞ彡｡ﾑ功､3]｡v$0鰻ｽｦ磊xBﾃｹHﾊﾐｩa5ﾎﾔAｴk錙HﾃVﾐf蜩ｨﾍﾊ6⊂:n閘ｺ	
?ﾄ.Hﾃ廠CﾃOﾓq4Cｴｹz_8ｶ<ﾙ7ﾘｯﾇ｢ｪ\cｭﾕiﾐ鍔-畊ｴﾇk6靱榴3Q鉗x9ﾆﾑpﾚｹmﾚﾂtｹﾖｰ;\_禪~-ﾃ3xVﾃs2Flrﾖkｸﾊl｣4<状eﾑｫｼ(ﾋg]xI楞ﾕﾐ]ﾃ9ﾂｪﾈbe列;ﾒ	｡ﾎﾚｰ苑ﾂ5ｼ?0b'ﾍｺLvF6v霹ﾆDｦ壌ｳL甌$ｽ叢|≪蔑F)#剰b｡W*-ﾚjｾｴ黻,ｼ|囗n侫ﾂｺﾍhxk位O2ﾛцoj3ﾞﾒCｿｷ,Eｴ {｣棣p$｢S4ｮﾁ慴0､ﾑWｼ翊ｻﾞ]X嗜&vlｳﾞ&庁pｿ%Sｱォ>ｳ;5Lﾖﾛlﾒj築b杵悶\f蝟ｽ5勗5i鱒ﾂX"ﾜc欄、ﾃ,ﾗ曉?｡昵=ﾞ#ﾈ応ﾎ<6ﾖe
ﾅYｭ面&ﾍ
8cﾊJYｱｺt1ﾋQ[42ｮ=kﾊｾfﾗﾃ誓ﾍ闌n厠ｧ{ｶHｼｻｫD賞W｢ｱ4ｲKj､Y:y}Y攜･}ｷ)ﾍ驤kｭｻF+yﾉﾁ異ｳﾞ&v築ｯﾈﾙ拝一sDﾊﾗｷｮｶゾaA#9,;ｶﾒﾛ｢ｦ穎逮且rﾟd･Zﾌｲaq_ｶG｣ﾂﾖs覽ﾝ秒*f綟T対)Cｧ/ﾘgﾒ7ﾕh｢駘鎮ﾒﾃKﾇp6U振,9ｼ]7ﾃ､i9､楼ｶ>ﾝR<｡p6`ｮﾎﾉXﾍ謖ｽツW's5}pﾕpﾉ燒｡p7ﾖpｬ"/窖QHﾓｰ論*KL､ｵ6ﾒ*"褥Y=	?0ﾏﾜ,8Mﾖﾙpｧ`&桝<廾 ⊂ﾂxｽ/
ﾇ0ﾍEﾝ18F損{ﾅﾝ50m%鈿V｡烝陪2G0ｼ!x[Qﾞ}<_YV5AF0sｪﾙMｮ
8+PfKﾘﾌｮﾉE9ﾊｨb･ｪｧ\ﾘX!~ｮ#}'.ﾆJｬ邵ﾝｦ=ﾘ~lｳ$ｹ倫
阻ｳｳ樸(j:ぅ({尾稍xf升､ｨｾｳ琅ﾎpﾚ~ｵｬ.VY,ｵ隗%灯. /ｮｳｧhK眩能N
EﾝﾁP79\zﾇP*ｻﾁ読焼bﾙ綯nﾊKﾇ;盧zｺｸ*]ﾆ蕉+ｨ鶩
p5_脛⊇ﾗ｣7穿"堝ﾖ0ｧ?&廃埆7峩mﾚV伎犁ﾆ_3~ｨ>ﾔ8
ｭｱｦlﾁﾑ8塙鏃z6披vT0l柯V<*jｬ	"蕗4wi<ｸ躯ｻM
$ﾉ7yﾍ3Zﾕ概ｰ↑ｹHﾒ3QｦaTb初ｱ腿loﾔﾆP+P4	O斥@せ:db:!&!ｳﾇﾆlｱ1ｫ$ﾋｙX杭X僕就ｾﾋ虞8*0j粨6ﾎ|ﾛVﾌV｢,eﾈcfSTiHｯ}d=ﾈ蔵0:PﾊﾍｳﾀD棘贓<"yﾒﾉf父gｸ_茆]/0ﾚ^"z_Zﾀ輅	ﾋUHｵ8ﾌTw<建=h稚Yd･K等.M-祭#8ｮﾅY$]sw~sﾅ-!Tｷ8ﾅ麼7喬命､Tdｪｰ$ｻT圧瀋箟b=,`喟磐cJ8ｾﾊｯﾍﾔ
Rｾ右ｼｭﾀﾟy穃恷wX｡ﾟeiy夙ﾅﾓ聲ﾔV[ﾗﾛbﾙ|Bﾓｸﾞ\ｬ-ﾋ枦I65ｴ,+9幸d
蕁柮ﾂ｣咳ｬﾜ丿
甦ﾆ戳ｪh:4Oｳﾃh諄h餐)ﾓ1EPｪ冪ｨj8U
JﾔlTｩcvS[~ｿ燧ﾜFQG､Sﾚﾍ=ｳﾆ4;｡｡_謾75鱗ﾇﾂｭ襤SQｮ鷁ｫPRmﾎ:ﾟ配ｶ`. 劣dﾕｩ旦ｧ僞-7ﾔ""7ﾓ1K畋7ｼｧ#ﾌJ敍qﾝ&7wｰｱHJ)ﾏｱﾄQﾚu゛G廚鐐;*剖wn
61fdi7･	
｡｢ﾑﾚ嶢ﾛz犬8mｷｮvｨ｡weﾈ|&･:E4Zz9ｦｫｨTｭ亊ﾚPｯNﾇ"u燦gb冕ﾇ
ﾕﾁ/ｿﾏﾁzu.ﾔｨｵlﾃ分ﾛﾔ5n:ﾇﾗLｽX>9･YIQN､Hｻ^Z｢6(-Zﾙ$df	ｳｭ舩y･3LtQﾈ&<:%"y-H洪ﾈ戡"胃9悉ЧIｪ0hb$m蛍v4ﾈy誉qﾘ\ﾓｳr｢1]､0SJｳｫ接F暦`杤Ru)ﾙ\ﾉ維IYY嵐ｹｶｸN喪ﾕцf控ﾗu0ﾌ尠ﾂ ｶﾘJvHｿ+殘鴉9nM_､2d]ﾂ,7鎮Mﾜﾙ蒙}朞ﾞ6閣z閏潦ｷﾈg[fﾚﾊｴｸ?ﾔpA舳c
1納W^V巫j_ﾒPKLﾇ}&JPKma5antlr/ASTIterator.classuRﾉnﾓP=/q塰MIKﾛtﾐ:N,TQ
mX､bQ1ﾈIｭ猝ﾘﾈq|
l韓t摘影*Q樋弃X`Y:wzｼsﾏ_ﾟ~(!檻的$嵩0僻4f$ﾌｦ梠ﾞ\q,5;^ﾛ&7
ﾇｷｽrﾓｵmｳ饉ｮﾓ.ｯﾗｷｯ$\ﾏjY斬
ﾋｱ5驂ﾈJﾅﾝ5F6-ﾇｬu5Loﾛhﾘﾌ$ｭvｽﾓ=･00;覓_瀉鞳｡=､麩ﾇk又q柑ｪozz･=繞｡b*RHｫP綜罧郭8ｯb	ﾋ*ｲUqﾋﾙ>?ﾗI&	ﾊｶ盒ﾊ{|U 囓Sｯ』ﾋｷ_=7ピU‖ﾆ儲+O-{W`*ﾞFgk廣ﾝjﾘ盲ﾂ"吩ﾎ#P､zz獲6
2#Caｴﾎ|ёJ｡碓HjZa>ｽ,ｲbﾄ,/:ﾃo9験ﾊ9鞐楚｡}ｬ!ｦtGH=ﾄ｢]ｵbwU垣｡ﾋ"1rZﾟﾓ牽7ニ\ｦf璧ｻﾒ=ﾑt儁ｭa椚.0ｿH=K8稿ﾌbEｰ
ｸｪ(k}ｽｽOﾄ蜜i｡lq(6･	D|ｭ	ｴﾎ
萓FB&%ﾊ?閾'KﾁV9+|*｣kﾝ､ﾜ[lｨそｸ-｡ﾊ[翆'~PK2M#>ﾄPKma5antlr/ASTNULLType.class酷]oAﾏ]､-ﾋﾒZｭZuｪﾂﾒﾘ庚H1B采ﾄd)N]vuw1麸Bo4ﾂ熄2ｾ3,Pｶｴﾎ9ﾌ3允ｴ豆(THR┯縟?N糜寝ｬ$L碚2
k/EﾊV3坏v;
nﾗOBoｵﾊﾑbｴ｢Utﾓ5Bﾓ2ﾞte:ｽZｽ(ﾄﾇｮn8Qｯ%{TE8.｣ﾌﾐxｮﾛｮﾐPｷ9ﾒcaｶｬ顔^4ﾞﾔvｸｭKｻﾈhﾆ3<ﾝ跟ｾｰﾗ{mV;'<vk｢aｳ混爲ﾃﾁhﾇNOzﾁﾐﾍv｡賍ﾘ/zﾀ\ﾕgﾋZ3堋ｪlﾝ舎h^ﾆUﾕｯｫ4loRv
9官ﾀ龍ΦeﾒrﾔｭﾜTｮigI3?mｧ滾｢6>ｪ"Tﾞ@:ｮﾕﾛf緋/{仗%kVﾗn}!ｧ(瑳U*2T^^箸8%長ｱ屬,ｭ蠖7慊qx郎ｵqN ﾝｱ擅(a1+ｬ5|ｾﾑﾜ/b?ｰ@ひ腕ﾎB/QﾊCｳ$睇2ﾐi夾0_b｡7ｷ
ﾀ-Cﾓｸ+ﾐLn:ﾛﾎｫ,G8ﾝﾇiﾐﾅﾜt.溪､7樋sﾛﾐﾜ4ｫ%ｷ麭盪|]U	?ｸ];ﾋ)ﾌc靱ﾜ襍ﾜ3:r8W痃sUQﾘﾄｫ*ﾆ$趾hGﾐ宰ﾘ+-ｺ=	{ｽ｣襭-tsﾐﾙ'ｽﾕ｡ｹ`(ﾞ
阮ﾊﾞPK+ｲhv#PKma5antlr/ASTPair.classm苔nﾓ@u憙Iﾝ4H､4襯ﾂ魄ｨT .ﾒ	!.愼
ｮｧ'-HｴUｩﾄe匝ﾞﾗh牲;ｳ3ｳﾟx75z犒ﾟvLfﾝ1ﾝ~2ﾊ灰ﾋ]ｩ-鯣鑁M佗ａ,2jｸ#0Oidﾘﾟ:氏ｻXXｼﾚ糂pﾟﾄkp櫻簿香Y椢?P≦J%川[Aﾓｴﾏ;-ｫﾆ6)ｬ9XR･jqziE.w孃ｫBIOH%hUz"Okｴ6Z>-q遵ﾁ4ｿk耡g!ﾘ,〉⊂4g\ [治9!eﾘ4調ﾈ｡UfrXQwHUh倫｡ｾ:EｴQ!*v堅ｴ
i桧WXﾐ9^
$郎	薗蜥｡mJﾄwﾏ4$ｯｨFﾎgﾟDfF+3ﾋｭ*$ｷﾌM'C{QE禾ｵP粱PKﾄDuPKma5antlr/ASTVisitor.class;oﾗ>=NvvvFﾖｲﾌ篶F)
淨ｼ凋"蕈惧ﾔ苒ﾌｼb}ﾇkﾍ0Fｮ珱ﾒ｢腟ｷﾌ弋F~hHS~楚VbY"#D'B(柘ﾏIﾌKﾗOﾊ塢ﾆﾈﾀﾈﾀﾄ,ﾌ, +薪b`PK聿喀PKma5antlr/ActionElement.classmS餝ﾓP.-M嚀-,bQA@IRｭ,V#ｭｸp)ｱiﾂﾄ撚ﾟﾄ'ｯﾎ@uﾆ｡ﾏMﾒj∨ﾌ9ﾟ=戻~0細
0船?tdhJ+M臻ﾗp]ﾁ
ﾜ鏃
ｷqGﾂ]攤'羸炸328+癸9ﾅﾜ-ﾗ)>デｼ3ﾍ徇:藹ﾑ,ｧ徃HZ蕎ｺm!1c9?ﾋ0ｬｦ聟^nﾅ3ｫUﾓﾋGﾏ端甎>ｳﾁ_tｷ9C預9|ｵVﾝ膺ﾉﾜｴI"了ﾃ=ﾓ'ﾓKﾛu+}z!E1H`rs妍図7,GXdN+R)ｺ5o/["ｺ6ｴd*wiaｮb*ﾎ"-aAﾅ"ﾆU愧絵XRｱ*O%*杪Uﾂ嚏uｲｦ臑p揩ﾓMAﾍ y%[G鸚ｴ祿T｣K詐&ｨ ｡
ｽﾔ｡wtﾄｵ髦･[骨譴TOtｾ9B輪]Gｬ3dMＷｭu6LR0ｯﾋPKYT}ﾅｭﾓPKma5antlr/ActionTransInfo.classuQﾑNA=ｷ[ﾚmYｶｰPA-桓]jﾀ丐	ﾆ､｡	m46-ｳﾍ弾lｷ[咫I0(ﾂ拆"袰3w9g賺蠻o嬋U畸ｭ9<6ﾄﾀﾓ2Uﾌ`ﾍﾆｺｩﾏ<ｷｱa繞｡/ﾋxUOpﾄx控_k閠0嵎pﾋｼ縉柴7ﾑ糸ｵ{iｩﾑ6a.ﾔqｬｿdｺ'%｡6RQ餐ﾍﾏ}ﾈﾝZ'Rror<蝕_bﾘｩﾎ5uｿ/號OO庁ﾜ採x}g炉Z｡ﾆ鬱ｨ7ﾍu,9ｨaﾞﾁ<愚ﾋwｵﾞOﾂP&lvﾀ-M^ﾜV綏ﾒ-m5vｻ扼Kャ<$,	僻IﾂﾍﾝﾁS米ﾉ欝?ﾚｴｹCﾎｼw.ｳ2劔痩旌ﾅｬ偕0.鶤ｶﾁ9(ｰﾎP磨簪ﾔ
｣"｣ﾋXCU]ﾖ$Z裙ｵJfｾ椒苺ｧｰゴｦｨxﾕ彈\ｼﾙｹL磬{A)7ﾁ(ｳｸzPK_rｨｯPKma5antlr/Alternative.classuRﾛNQ]ｧｷ｡ﾃﾐDｹx+S､ 
"｢ｦQia`!ﾃ≒ｧｾ	ﾕﾄ_M(:ﾓｱMｺﾗｳZ{ｯ3ﾏ勝fpﾏDv]ｨﾓ骼3yT1ｫ滓ﾜ50/拙鋒C`ｸﾊ宵ﾋｾ嘆(HｮrOj=ﾊ|聰C&廷Oｺｭ'~韶.ｹﾗj隲8GNﾕwくj]E^ｰﾅr>･S{ﾌｶ0き.cﾈﾂ8ﾆ,倩ｶ`｡ﾛﾀｅE拿ﾁｰ@6(ﾖyEｯ7w､ﾋﾅ.rﾋuyｬ8｣供?GAｬ3錢!ﾆ"J1｢/ﾆK闖q1rYbJ/F4 ｴﾆQf6ﾏﾖｶｿCﾘ｢花WfﾗH3ﾞｦﾂ$逞cﾞXﾂ'/E,ｶyvﾒriZｾEｮPl囎ｶﾀKVｴﾀ､}の/罵ｻｲﾑDｶ歌'&'ﾈV塋ﾙﾙ取 ｲ元ｴ0G4ｱ	ﾜgu４Zｺ7蝦POKﾗ\&ｹ-窓ｯｷ)ﾓ	･#
ﾔEﾌﾇ7!90ｳ竒藹
-^_ｫu2ｹｰ=ﾒﾑdﾆｧkt'褸EMPKΓ7lYPKma5antlr/AlternativeBlock.class･Xy|Tﾕn2{^$$\Βa5m51Z藪%2K|3禹[ｴj+ｭZｭｴjｭQ禁U｡VｬKmﾝｭｶﾖｵvｳｵｵｵ-駢ﾞｼ$橡(~悳ｹ逵{g>ｲ@Μa5ｮ｢p･ｫ\-ｾ([|Iﾀ累ｸﾖ
ﾗﾉ痙_A7F9~ﾕ魚ｰﾍｯ硴そﾙ梗}ｫｿQｸMﾐ;艀ｻwx1ﾟpｧ週ｲｻﾋ砂ｽ閲|､;^7aｾﾁｲ>狠Υ>菘.x1Y遜ﾛ搾唖ｽT濂ﾂ><ｽ<ﾁ>筋ﾊﾕｾ'橈ﾓ罹ﾁS|ﾟΙK/樸9Qex?a*~菽ｼ(ﾊｾ$Jｼﾁ+ｼﾆk
ｾh"嗜LG	}｣ﾞﾓﾝ肯i3夊^ｨ魍ｴa&tt｣然佯ｪ'ﾒ1ｳｱ3_ｪ15v4ﾉ煬饌#ｦ cTAｵ荼ﾊﾛ怺ｦ喞i栩Tsb鑪ｵﾎﾆｴmN徊猪eﾇzli"IWｷi堆
ﾞﾜｦﾍ ﾒI6gﾒﾉ･鼓､實5=FbﾕKnj紫｣ﾝ
ﾕﾝFﾂ0ｴa旛推ｦQｨｱ~1
ｯｱｭZiｸn.uP鬣ﾉ娃PﾙMｧd秣ﾃlﾗﾃ1bｅﾔｱ=ﾙk$ｮﾞ
=i崢!<ｬ拡H7ﾚX#穐n#扁ﾔ譁Pv6囑&ﾍｬ	2@>･醉泳ﾉﾋS$ｨlｺﾕ始,呷ﾂaﾕZ禍{=BB殃鬥ｱ"i6ﾛ1W賄腱｣ﾝﾔ;{)ouﾗ髯碗ｺﾑﾅｫﾊT｡!ｳjaﾊ量ｳﾄQcｹｾ<5ﾚ緋坡帽三
ﾛ粢vu_旨Zﾍｨh:Xl馘N_oKfﾌNcET弔:O%ｱdgoｼｪ!Cﾃｩ8MﾃZｬﾓp摩ｳﾑ｡ﾙ+`ｽ]@X@'進kｼ}]ﾃ馼ﾓiﾁ5ｼ75?u-
?ﾃﾛn\ﾃ/K
ｿﾂｯ鄭ﾚEｱﾟ犢nNﾃFｼ｣磔xWﾃ@K+ﾂｪ瘴宕?ﾋ{q$41rTv(良減践kｫﾞg>ｴm紫1
ﾇ?儘QY帝2,ﾓｧIO#Θﾁ+#ﾑiDびDｰｦ｡｡!ｴhq}0廬ﾙ｣畿J
?ｴﾒ!.ﾕoqﾏ_ｾ5ﾆt+D6Kt=752+･ｩaq､ﾍﾃﾒc)ｮ:Xﾆv%ﾍ`携R饒ﾘ
S4率J替買UNqﾊ･p愛｢mｩｸ,9y|V(ﾂI-燕z,	ｦ2aﾋ紀+ｵ宸lｩﾁZv瘟7ﾉBvﾝzMｹ壁ｭｼ竒｡TeﾄｲK.nﾒ&Q@EB?ﾆ要ﾐ･[､Df|lｴjT3疎ﾆQ5ｺ:ｼ！nﾑｹｻs､)22rﾞLr_mSK_9&ﾏｸ"hｶﾀniS閣h+K,MｼFNﾗfKﾛ孟X}ﾙﾓ=Fkkｯﾕ.0(xPglｵﾕｺ[8ﾇｱw
5-ｩK素HE/ﾈｵq|egｧﾞﾙC､ｬ"ｱ｡ﾃ2｣/ﾝC&ﾙ剰;6ｶ25ﾒｺﾉ/ul9;抬fPｱ;:\9R
Z頽､iﾃia]ｹr9!ﾖ展ｼ[^#RhｶaRﾟpﾃ()ﾏﾍ搶ﾏ6\Gﾂ8?m}･gｫ､創ｷU*Pg羮去<､9籍紮雑ｾr~Z嚮e竕窰喫ｱJHKﾋｫｽﾔ-	1>ｿＭｬLﾙｱﾘﾜ(Hv甅L7ｩｴｼﾘｳｭﾅfｿ;eﾄsfﾅQB節ｷｫ
_ﾌA2ｸｬｵﾝ>氈k]cｯgﾚ+Gｦｵ枡ｯg[xk襤彡!cﾔZﾗﾛtｺｽｵﾓZP2	ｻxﾚI|	ﾗ3kvCﾕｪ番TCSｫﾖ1ｷ<ｲ
	(ｫﾝmｭg7ﾊPaQ>JﾇPYﾋ
ｹlnﾂ%ｴｨa"*1	1~娑釶ﾃ151僚8ﾇ｢Ky:
X#ｽ2ﾏﾒｼﾇﾖ^j犲ｶｶｮ~7ｪOﾕｧZpQ2ｪ^Eﾕｫｩdｪ>Μﾏ&Qｪｾｪ｣ｰｴpw使 ()
ｶ鶉ﾐ裘to.TﾔeqﾘﾈS>b嫩Wﾁ:｣清<櫓Hｽ;HWｦ.BZR(4ﾂLQﾒ怨､gnﾄ&幺H濃ﾖU諫2iJﾃ箸進-碼ﾃ車ﾉTﾊ靨ｦ杭Lﾞ∠<ｬｪﾏ央禮ｦ`Z}ﾉｦoQｪ衆ｦpｰﾋYuV\x>涯ｦ艫ﾊ~>跏ｺｭtﾑﾔ砠ｶﾖNﾍbﾆ)sw!ﾘ8`Sﾀｱ3ｷ｡=獵儁ﾎｺsfeq>ﾌnr\OﾁV鼈=亠v7呪ﾗdｲ隠~&C(&R}?f\ｻ07猯｢aM?ﾆ金ﾆmﾐDp#)ｻ&G獨[JhR|ﾄ､ﾅ,I0Gﾋ况肛ｯi:Siﾓc.d!c｣eｴ6ﾑ｣淋ﾌ+q!ｮ#ﾏMｸС.)g,;\ｵuｬｮﾂDｽ勲犁ﾄ\щﾇﾐOaﾒ_N+飴o狙RH魃&3ﾅ'ﾒ_Cｭﾄ\fiEzu31ﾌ5.幢_税QﾛﾐR/｣ｭ}叟F捕ﾂc絆プｨﾇﾊ&九(繆kﾊba?ﾞｶ$霸\bY?J$n逅ﾄEﾅ$nｵ$.ｶ8ﾚ$V:〒ﾑ<ｱU"v鞣ﾔ!ﾙ'=ｿ Nbｦﾉsｹﾋ1籐u蓮xｭｯｻ襄7ｰ｡ﾟﾈﾙﾆﾁw3ﾖ-ﾌ媼儖ﾛﾗﾛﾟ;ｷ湫{ﾅﾝﾘ旬4ﾇﾓ+lo>{ﾅ<ﾁ9%ｿpHｽﾏ!珮ﾚ輟n俸r[YｪLNﾗﾖｼTpZ塔p1ﾎjgﾉvｸqgｵﾓｿd;&	/ｵE飜|28ﾆUｪvﾞ試ｼﾛ｣ﾚ5ﾟｿ<鄙c･B'ﾛBｾ3ﾆｱ~Lﾌﾛbmqｱ>ﾎｿ､}c5皎壘hﾛ&
ｸ`f+禁ﾜtW珈CqDv祁aﾕ
l渭ｿ9ﾅｾｩ魎&ｧ e餡Fz/ﾅ纜8絅<ﾁ!$?0bOｳK<-x務}/p槁ｻﾜｽC%V}YU甼U細TｯｫxC揆7U;ｪuxK%ｫ^QXｻPKﾊｨ&nd
PKma5antlr/AlternativeElement.class}QﾛJ#AｭN&遁ｬ悔ﾄhﾖ儉ﾄ<､,ﾈ｢"4{ﾇmﾂ鎰臭:｢艫"Q粳ｶ/SﾕUuﾎｩｪｧ辯G"Zｧ_ﾊﾐ9Tﾗｧ･-遞ﾁﾈ鯛B1ｪvｸTaﾒﾞ菱$Wﾁｹﾘ	E$､ﾚdT腓	ﾙｽ<鈷>｣ｲ隻a<dp!_髴sﾞｹｷ週ｨﾙｭ@ｪ橲ｰ歴(篷fｳHq0頚"鶯^偉8ﾚﾝTHCm|筋ﾗ審_ｨ透ｽ&f/
ﾆﾒ使炸ﾀ;ｼ'BFﾓ^ｳe7ﾄ功E
G09ｻ∇b緡ｮk訪.p)O4ﾉhｫﾋﾇ(#[ﾚｴﾓﾀ;fｮiYﾊﾁ:Zﾎ疽ﾄtﾘ｢･ﾖ=1ﾟｹ｣ﾔ
B\=lﾉﾈ!閧\1ﾄIK\CMW]ｿｵvO餔3ﾁEﾓYﾃ,[j蛇}ﾇ#,XzMkｨThﾊJﾔ|ﾆｿ･ﾔﾕ-k狸ｰﾓ
]ｱfﾚH汲ﾉｮ`ｷﾟﾈﾌﾒ愬Wｭt馨城ｮﾂﾎcｨWﾜとhﾄﾍﾌｭ喘PKGｱ眦dPKma5antlr/BaseAST.classﾅWktTﾕN2匯0L	!s%

!繊0$ｨﾈ$ｹ	等03Aｫｨ_-ｨｴ5ｵj|Ａ筬>ﾀZﾕhｳU綮mﾗ鷸ﾒoﾟ{g&	ｫ]+ﾙg毳ｿｳ_g毳ﾎｼﾓﾏ経ﾜX峇眤ﾍBnq瞶!ｨﾁmB~鵲~&ﾜ7ｿv碚碚N7ｦ珸ﾂﾝ%d乱ﾝ.!;\ｸ[ﾝ翊/ﾜ_jｸWLuｹQ侫ﾅｯ5ﾜﾆxP$=BﾒｰGмTﾃ
初ﾆG<ｮ	YｴWﾈ>
Ojﾘｯ痼ｧ\Y氣ixZﾃa
ﾏ畜$ﾚgﾝxﾏkxAﾔFﾃ喰%
/ｻ
刺8ｪ甼
ｿ扮ｯ	攝ﾗｼ眥.ｼ蠶ｭ騨ﾃ
ﾃj痊(Z>/3贍7ﾌRﾈﾛﾗﾄFm0｢ﾍ遭QﾃU0邀`kﾔ
w<ｲﾎ/t1ﾜ雰k蝪@ｸｽﾜﾂS袖"ﾆ+2K'-ｧﾁｪHｫ!ヂcqWGｳm4(ﾑｭｭUkぃV３ﾛ摶H(dｴﾄi.V.n奄ﾜv#n-\ﾒf筌FﾘT^｣瀘4F｢ｪ#ﾑ鸛ｸun(､pﾑ液･;:C衢9汽ﾓ}剖+ﾄｧｱｾ+茅ﾌQﾉ劫ｪ
ﾆ佝皓ﾉﾒ@4逐ｨa$2I\m(f斷PzpW
ﾈ彈芯I*ﾊV｣ｱｸ晰ﾒ闡ﾅ弛ccｼ>ﾘ竡ﾒ+
(Pﾁeivﾜ\ﾑiX徑ｴB6ｹｪHｨｫボ蝟あﾁM0ｲｴ諄壇o")1S5:"菰ｮ
#'6ﾘﾗXﾂﾗｼﾒfL鬯｣ｴF,?Qﾍ*]即ﾈe勁ｴ｡ﾟaﾈ+摧8h闇+xｬU"ﾉｩUﾎV｣ﾅ<*%｣ｼ+&PM6ｶ'Nｭｹ$ﾐﾑﾉv売粫ﾐ.Φd}Wﾄb搗ﾘ,観]ﾂ/ﾅ3ﾎc0ｻﾘ-ｸ喙U<6ﾎ｢煉器ｳｸｼﾒｯ=2ｫtﾓｻ較qﾝﾁV\翆uBnr=ｮ玳呈ｵL$ﾋ$maU%*/Q+VﾃﾏMk$ﾋPﾊ｡5ﾗ:?dt眞釉ｲd墨Z9ｻnqｺNﾙｿｱ嵜ﾅjｶ5瓸ﾔｨ
H-ｧﾔ7ﾜﾒfI.･酘8ｬ薩ﾂy＊u
斤,>Icle@atiﾕｫﾓOｩ-$睾n庄!ﾓｲ&ｷ]氷9ﾑ"ﾉ&};伊>ﾛ妝6Hd5}iいｺ$lHｬﾋq後e!2ZDﾎ!ｭＰ{3ﾏ馳ｫ佞mﾏｱQｦ坎{9W餌､嶌a幃獨Lxｱ康_ﾇOXﾟ7ｲ｢ｶｳ｢neﾜﾆﾘﾊ`ｪwｪｼ纏.Kpﾀ%3*p)潭}瑾ｦﾗf@飼ﾗ添`ｪﾓ^?@ｯ､ﾗﾋzｼﾞｰ,泛Wxpﾕ熙劉r六跣En{ﾃGﾁ(N単ﾇ-}h8椥ﾍ鰌K軒ニo咒ﾏ:群MzNﾛ嶽<ﾒ<沺2ﾏﾙ6ｾ豈ｩ~m=%ｭ雌h算Iｭ｢ﾖS変ｨ綮$娜jｩﾙ"ﾍｿｴﾐﾌﾁﾐ,Rｾﾆl鑄夐ﾋt動Mﾀ佯Xｸa､N揖:ﾜ(!齔ｱﾑ#&ｪ3ycｳ>dｽｳL
竟nｩUﾌt奨d}ﾚ倭WTﾗｵ､ﾕ4葬	妖^Rﾆ%~Jb維K%"A
ｺﾃT9i6l/才ｱﾑM禀:Pｰ揩踪ﾃPﾓ剱t秉.ｻはﾈZVh&y{｣oj鱶蒡?ﾆ:]Qﾘﾔ｢ﾚ'QｰﾕﾙWﾉ@ﾒ｢ｧ糜ﾝｨ/朔9鯵諛i~ﾊ^渓ﾅ降ﾟxsH-ﾙ賻	{羊ﾍｼ*ﾕ2sT5ｨXｪ｢QﾕU-ﾂ:u!:UﾑW&]ﾊ剌盤ﾝfNKｾｫ/姨B罕ｧﾄｺq0膜;ﾞ紀チﾔ律>ｺﾓ鑵ﾒ｡ｧ-c@-Cｪg6X]雇j9ｪU#緡ﾂVｵﾛﾕJ<､､8sｵ傴c>ｦTﾁ43ﾓﾊ`ﾓﾆ`ﾖ0 ｷ*^素 ﾛ]a晞ﾊ悵虔ﾔｿO-ﾋﾓz｡W公釦+''遮慚&%L%ｧ0ﾓ臀&勇N39g｡7ﾐ	Eﾞ始庫sx;ｻqZ^殆V7扈|gJmﾓｲzT｡7ﾔ砕蕎q8ﾉ署ﾛｽi薨@ｬﾐｻｾz孫ｫ%Dﾄ`w&瀋,ｸｳﾞ9?+	ﾏKxﾛwｾkｴｬm夛翕來費ﾃﾔT｣iｼ?a{枡,畤Uﾂﾞ愧列ｬｨｽ!ｩv鈍8逋OJ}9:;｣z0ﾖf鉈丑ﾈIｵ-\`?ｮ{漆愆j]Zｲ}ｧﾃﾔg(P渾怯7丕>ﾆ\~iY靭ｾLｰ韲L^jﾀﾕnﾃｱS(ｹﾑ|*l/PKﾙｺ央2PKma5antlr/BlockContext.class}RMoﾓ@}豆ql岬
数ﾐｴ｡･精u!ｵU*E黨罧斥ﾆFｮSｳ@鰍ﾄq襾!fﾍﾒTIﾁﾖﾎﾌﾎｼy3;ｻ?}ｮaﾃョMｴ]ｶｺﾘﾂｶｱyﾘﾁ}\志t├¨ﾂ┠ｾ3{:Si,ｳ鐔嵎BYx<"ﾐ｡偵!｡aSｭ躅ｫ相3二2乾｡ﾘ髷JﾉPｪ(VL4P;9ﾐｹ%ﾃK-｡ﾕY/ｻ!ﾂq竒ﾃLﾒ.｢ｹ影ｺ`]ｿ
8kﾚ{寥ﾓPｽ鮫gｫ｡8S浚ﾞｩ<5ﾜXﾃm‐4ｮ;x(=‘T杖ｪ<ﾅ3Bﾒﾀ,7aﾅｰZﾆ7ゴｲﾋ羯\ｴ]ｿbBﾎ\gМ{ｸ0ﾑ唳｢$>｢ﾑG懺.I┓ｮSs/溲Qｷ?ﾟs2iBﾟ泥E^<$冗畷ｬｲ,稱Ｑ働kbｽ}aΝｳ,醫*ﾋ:ｺOQﾘ擇8ボyﾎoﾛ嗟観~CT'(Mｸﾈ)ｨ|+ﾕdﾙﾄ嶼ｶ]ULｩ	ﾜyﾋuﾖｴ~PKz覡伶PKma5antlr/BlockEndElement.classmR]菖P=
螢[aEﾅ(H|eｳ	4$/v_ｼﾀ
Tﾚﾛ､)dﾗ_･	f｣ﾙﾘe慷W"2ﾓ9gfﾎﾜﾞ}ﾓ(&･$(+D4樞YUﾏuｼ`ﾐ\4c\^0ﾄhsｺAｻ"ﾎｽ｡>｡+VS|j惘哺	>|LM｡?GN｢aﾞvｹ惷ﾗYB､<悔史棒-ﾓ薙+ﾐｼ+eQJj<~EjX蘗殕道ｽ{0dﾃｩｰYWr Hiｫﾝ枸PﾛZg7ｰﾆﾐｬnﾝ9ｼ&ｪﾔI	"ﾐﾔ鍖メ(ｩｧ#挿@ﾑ#膊ｫyf5来h_nｵ汕ｺﾓﾙ,a!Oqｲ&Ek~mﾃﾏYKhKﾄﾊﾖ/ﾄ｣ｾ#ﾇﾉEｲU駄膓6jﾀ
ﾙ耻ﾞPKK尨｣ｫﾇPKma5$antlr/BlockWithImpliedExitPath.classQﾛJﾃ@愀ﾑ41ｵﾚjｼﾛ齠M･ｾ旺ﾞ}qﾛ.&6ｶ･ｿ%(あ澀曳ﾓ"XPYXﾌﾌ劑ﾃ|}Pﾁ嚔4ｦ
陂1`cVﾇ*ｼcQﾇCN`Oc<ﾞ)]1hQ:ｳU/逹.ｯﾕΥｵD亢囓Q'nOﾉｨﾑｺ､{ｴ}O4)ﾖ溶蛛wｹ&,,cEGﾁB&}9ﾕﾂ8,%\eX駸ｿy2ﾘ}ﾁｾ/Er騏E｢eﾐqﾕH?3d~4{ﾀ{ﾔRsﾒ嶬彪､u､iW#ﾐ`ﾀ､率ﾂ&S｣ﾑ擂j)Bﾛ)ｿ9ﾎF梵ﾒﾞ=cIｺ'H0J]3ﾈ'S塾V彜ﾞHｽ`?峇e1K6$ﾊPKﾁЫﾂhZPKma5antlr/ByteBuffer.classmRﾛNAｦﾝv2ﾐVｨU<ｵ]ｰEﾄC｢&Ub0&ﾞｹmg肛vZｧｻF.yﾁｮIｰ$夊ｽo瘠ｨl#mｾ廂Oﾗｪx鐐3(:$ｮjKｸfｬn爬Cｲｫ罵ﾜｲQfHIﾕ州Bｭﾁｫﾉ^ｭaPｯ!X*>aX(猷yﾉ`ﾕ{ﾁ仁J%昿ﾝ孟/ｼV@亥ﾋ  Un垉ｱ-｡ｩ″
ｽHｷﾅｮ4ﾔA(ｶ#ﾟｺjp萵rﾌ ﾋｱfｬuﾜｶQ螽a6llrﾜﾅﾇ=ﾜg=+n,
CﾑSak7ﾕ;50腱拝z丸-i"Kｲlﾚｨv撓脅ﾔO黨$"ﾒ蹂龝ﾑLｳ jj)ｬﾁﾀｻ桎'橸D8ﾙﾝx4WR8=ﾝH{ｾP3ｺ)gr_罔i_8瞎ﾌ流ﾙ9腦^$ﾏ%?AﾚqOﾁﾜｵ/HﾇY3H箪dｰJ
ﾄ6鎌阮;Dﾒ=「５奏g薫'1iG~a78ｯﾖO1纔^Jｨﾐｫ｣LKｰ綮,ﾚ}-ｻB仇ｱiﾖ錆ｵ;Og!a/PK^ﾓﾛPKma5$antlr/CSharpBlockFinishingInfo.classu設Nﾂ@ﾏB)EMﾃ埖hL食BB絋JYXｷd)\^/|ﾊ8ﾛ16况:;廂|{ﾐDUG$(*ﾙQRRRN賃.>ﾁﾂ宅<`ﾈg鈍l1i
驫ﾉ9Cfﾂ要ﾀGト7pｦﾌbHwﾛ｢7fﾘ\ｽ^K鰺使/!~
7ｸd6Nｴ?｢nｦ
~ｳ|ryg=齡s-ﾋR}/･ﾃｻｮ圻uS[ﾎｯ<ﾟyz1･ﾉMe7ｰ煙
$
鍠H+1臣ｨﾛ"d?;C'v8絲}ZRＷｨﾑCHｨ卿a5ﾖ5ﾖ労&ﾍﾒW桂ﾙ|3ﾙ
ﾓ兄+D6ｵｴI"-"FZ%Cﾈc%
Vｸﾜﾗ%ｼ坎┷3ｫ*Rm郎ﾍｫﾐ早(ﾇﾄnｦM\ｹｸoｸ2ｹｪRｻｰ難qw呻qｧｼuD草ﾘ'ﾑ/1 藻ﾘ/q@笄ﾄC:tRｰ#8ｪｼcﾃ#ﾇuｴbTﾃ亟	･N(5ｮ｣)eOJLj來pJﾃi∧Hﾖﾋ｣｡xﾏ%｝j+ﾐ4暄ﾜsﾛ杵~ﾞYﾌqGw,9knｦh匡ｯLﾟr:9ﾇ[ﾈｬｷ2,`ｨ`-ﾐTﾜｦ\ﾖwN.ﾟOﾗD5ｮ｣*zfｵ神rｧｲ*ﾁmｩｯ)ｩﾕmﾇ'ｴ_ﾘ⊆O)_ｩｼRJu%1ｵjｫ~Dayﾙ%ｾ~｡伸&
､qFﾃYﾓ浪[ｦ"")佛怙Yﾍd<.ﾈ`ﾞﾀ蠱ｱXﾌ@'ｺx坩ﾀvﾇs浜燬]ｼ.ｱ趨uF`ﾄY[sｽ黯P ｻﾛ'程|wEqIｵﾒlﾎｼTZ5ｷｵｻNｮ猥.ｫqｦj""9ﾗ[o民^塒%ﾖ1ﾎｲﾂ
ｼｫQ范QOｹﾚMO
ｵﾛ
u､ｼｹ劒ﾝ
b!>ﾀw5ﾔZ4PF):e來Hｧ(･孑幹@9iﾕｭPﾑ
ｭbH+
R
EﾛxﾛｼCﾄlｳﾚ?@ｿ,｣Ёﾛ4ﾟa3嚏ｦIﾐｻ?B叟ｨfﾖ7ｬｹV	Xﾕ;ｴwh&顕cl:ﾉｶ枅ｯ謇ｸﾎｾ衵{医z	枇ｷ	I|ﾅ ｾ(凅_ﾗqa>ﾀﾐｴ2-3｡ﾑh_	mﾏﾑｹ朿ｉEKﾘ*a[跡ﾌヰxK祕^mOBb
ｳ鬧ﾄFｻ僮ｮ!ｾｩ思g･XMQﾛ痼ｶｼRWﾝKﾔ=ｿ=ﾄｻ8｢種襁Jﾘ｡(ﾚ欽ｽｴu顯PKｿﾜｩﾈｨPKma5antlr/CSharpCodeGenerator.classﾌ}|Tﾅﾌ撓ﾍ･%	u4B$! ﾑP､*ｨｸ$$ﾙ俤Pﾄ.>,{
AｬﾘﾀﾙﾛｳgWﾎ几nﾉ|~eﾝ)gﾎ9ufｮ"鷸却柁ﾂ\b｢0ﾑ丶)髞･cbcﾒIﾎ>悌dwﾁ､ｫ巡x7L2gｦ舜躡奘ﾀ>侖3紅^ｫw:ﾃbﾒOX踟楚|&ﾓ ｾｯ耘!6[(椦N<ﾌﾉﾇ､@aｽ!O#HﾅGH>囂ﾆLﾓ|,>ﾇ||/簀廊ﾀ､甅ﾄ瀞ｷ4沍95?3K溪#%\n覘ﾅ稱i陣先蝌sｰ諛`ffNﾗ|35衍｡墹ﾖ|取s5洫|ﾍh~V=套ﾘx聡蹠`ﾗG篋渉でXp4ｾ4_｢y･ﾏ堋紹ｼ
｣簾2~5ｬﾖﾍ立ﾁk-ﾖi^?B7h~lｩ竝括qv厄ｫyIﾗ?VhｾRU~ｵ}ｭﾑ4x=	w｢'i~ｲ讒h~*｢y"ｼﾋOﾇLﾎｳﾙ､ﾝｻwk~=W4?_4ｿPu喟､ﾅ喟｢zﾍ/ﾅ.ﾓXrﾍ嶮H3篋A+0JﾍｯJ｣j艪濠o総ﾍｯﾕ:ﾌｺﾞe詫ﾆ⌒y区7bﾋｿaｷ獗PVLnCｷｧ;ﾒﾈ.~ｧ誣aﾛｻ5ｿGVｬｱGﾖｦVﾍﾕ|帶i~ｿ`ｵ5<ｬv5?ﾁ7｣>L$$ｵﾝﾗ	5ﾑﾘ柁&4ﾟ珂'}ｴ3湟i|ﾆﾏ ｿ届偈ｬ賺iOﾍ湶ﾍ_T%ﾍ_ﾖｬ*&ｯ･ﾗ>:I膊ﾍ･[堊(ｽ#r鑿53ﾟﾗﾍ?ﾋ醸	8聟髦怐ﾉ劒｢ｿ5ﾔ?ﾃ>>ﾗﾅｿT+kﾍｿﾑ[葮2L6#蔡4ﾅQﾅ?i3>ﾑWﾌMﾟj玲ｻﾗn-xLXZ0-ｸBｩﾒBk即O逆-l-:･ﾑODgLｺ`ﾒ渡Zd顋"S駒Zd疚4:\ｳ+z*俗D/%z+ﾑsAD-Hｼ#ﾇﾀSﾔb*1&@ﾒC⇒Dｾ蘆堤聘"`2ﾌﾇ*D｡ﾃｵ｡ﾅH-Fi1Z1 ib?-ﾆj1NｵｯEﾅZLﾐ｢D級ZLﾒ-&kq･ZLﾑ｢L叫ZLﾓ -ﾊｵ8X気
E.ﾓm3婪絮ﾄf6ｾﾍﾑb.ｨS1O懐Z,ﾀﾃｴ8ﾜ'界Z｡ﾅ岨･ﾅb-蛇"-冒扣|ｫ:jQｭﾅRdF-吠Q｣ﾅ1Z,ﾗ｢V:-ｵiﾑStｬ8ｼｰ-咫JｬDｪｯﾂｫ8N5>ｺN硝	Z怦]揆ﾜ菟ｲｧ九ｵ88M況ﾘtq&g"eﾏﾂ>ﾎFﾈﾀｼs籍鋺ﾄy窩-.ﾐ磽j&ﾄﾅb揺ｱ^規ｵｸLhqｹﾍZlﾐﾕ虻R境ｴｸZ牛Zlﾒ-ｮﾕ:-ｮﾗbｳ7hﾑ｢ﾅ校ﾜ､ﾅﾍZﾜ｢ﾅｭZﾜｦﾅZﾜ｡ﾅ抻ﾜ･ﾅﾝZﾜ｣Eｫ[ｴhSbｫ>/EDｷ"iqｿhiｰﾛｵxD季ｵx'ｴﾘﾍﾀ,往00､Oiｴﾏ(ｬ淳ﾏ｡@}ｦﾅ?銭湶-^ﾔ筵4~堀aｼょｯbつ/^ﾕ5〉8Ｐﾆ慵ﾇ=o`&｢/|{K狭ｵxG仇ｵx痾ｬ"｡｡ 蚤ぴ,>ﾖ-ｭﾅｧZ殘_bﾙW|ｭﾅ7Z|ｫﾅwZ|ｯﾅ鰾G"/~ﾒ稟-~ﾁﾗ_ｵM近ｵC?1/-vaﾕJﾟ檀Iiaﾂｴ膸
-･
ﾔ雙煖ﾈ4-ﾁﾘ%ﾓﾓ､-;)ﾙYﾋ.iﾖpﾙ渡Zfh	ﾌ/ｻk刔ﾏZ独ｻﾋ杙f羌ｨlﾙ[ﾋ>Zﾕｲ泱峰cw(r茶ｴD7CN会｢蕷-s@ﾈ\麓勞eｾZﾓｲPﾋ畛社r､魅ｴｭ湎OＤｱQ偲dLﾆkY*求LJｴ惠$-ﾐrｲbi)J[ｦ亡ｴ,ﾓrｪ盲ｴｩ藉Z>ｭ3ﾘﾃｳZ>ｧ?ｵ|^ﾋｴ|Qﾋ龍|YﾋW織ｯj>_&ﾟ弛ぜBﾞﾒm-ﾟﾑ]-ﾟﾓ4ｺN~蜃#-?ﾆ粥ho-?ﾕ3ｴeﾀ=殘棒"ﾌｯ0ｵ9娯lｭ戻碯{L~ﾀ>~ﾔ?Z､袞Z｢蟇Zｦ襃杏OTｻｨ狠苑iｹKﾋﾝZ9E}ﾊR+?tｦ､V
Lｨ4ｭ|Z･ke+ﾕ)ﾍ 遞ﾎJuｱIｪ+&ﾝ0ﾉﾀ$軟賄)ﾕ漲(ﾕSｫl･z!ﾞJｩｾ能ｧU?-ﾕｿVｴｨﾕ ｭﾕjｰVCｴｪU桟ｹZ虔ﾖO`ﾕaZj5\ｫZ砦j之｣ｵ筥ｩｱ
ﾀ粧! ｧXｩ	>VｧJ0刪ﾉ$Lb.爆ｬﾔ＃dЦﾗG舞毀Y挫ｪ癌柿-%ｴｹ4X?yﾎ\ｱｬﾎ
ｮ咳ﾒｹ)\Sｿｴｴ)	ﾕ咄顧ﾀ蛋mｰｪｬ6Xｬ称]ﾝﾌ劃+ﾃkKﾏ4B誼JｲkBkｷrb~y}
ﾓ･2TWｪ/[iLn\ｦ､[\ﾎｬ@c.ﾕｪUj!GﾗFFﾎﾔ6ﾜ.ﾁU蔽HMｨ~ｲﾆﾐﾊzJ:EeFh~M`I-ﾔHｯljl.g7皹nHm縣u`mｨr9玳ﾕｭﾈﾎ嬲ｳHc0ﾓ
00gｴM霜ﾚﾂﾋ"X砂W+k@Whm(ﾚ｝~ﾎhｪ[l､$mﾆﾌf:ｯﾇ釀激疇｡ﾚ*@ｺ4TjfX籵菟FＶ8cｮｿ久eｨｶ6X嘉
ｯｩkｨ>~
"ｩﾃﾞﾄTｽｴ@]pNC芦ｭtﾎｲ@cﾃ敬劬ｼｾ*ｸｪｴ1]f鮓I5#実,ｻyrB
L礇JXN|Jxiｨ
逎｢ｦ>闌zｮC_ｪj3bN{ｦﾉNLｮｪ鉛W56Z鋳9.囀ﾍ]ﾎ)ﾆﾎz{Eｵ疏c} Rｳﾂ扨,-5YeUMFKa5ﾐ5P(Xｨ]梭ｱtAMmUeｱ*eロ｡d2ﾝΔV話.隅4ｽ>hy`M$･褌E2ﾊｱI壞dN0ｲｧN
ｧEｧ･ﾁ意	2nyn*}ﾗ!#jSAﾂﾋ(ﾙ/'Aｸ簗Ay}uｨ8@Q@ｨﾍﾍ	ﾔqRｪZt黒ｧp髄:~4ﾔ*ｴｸｷ祖}Щjｮ髦停emaﾞ
,nｪ1ｪrjｨﾑ([ﾕJ/lFﾗ#ﾕﾌ.4ﾄｯ8剄ｫ 氷UGi RｹzrAEK
ﾔWﾕ｢&ﾄﾏ沌9
ﾁJ&+Zyn肚x ﾝ39ﾅ(33ﾃR	檣_ｵH
`
Csｵ@x.hfJ%蠡@ﾇDjｵF^$乾ｽﾋ+特ﾔ{D0u譯ﾙ三ﾐｫ}>uｬｻ
3壙ｨcn5ﾚ慝uKBｵﾅﾋﾑ@}`iﾐ瞰nﾓ忻襄+ﾀﾘ;ЁiﾌG#*ｮﾑZﾆZ娵ｫ抃ｹ樓trMMa､ｪﾁﾋﾉ;ｽ｡絖@;3｣5ｧｫﾑ6:ｶ_CcｨXﾞsｬdｬ}cﾊ-%CRﾙﾄTｺTﾊツ劑\JFMｦ5>ﾕM4"｡ﾐﾀ2潺莎x垉(j!｣U慨kﾎ弋ﾒ渕j(鉄ｾ7ﾖ>9蜍:ﾔ燦･xﾗﾚ(*裔ｲｺﾈ8曰ｨｲ.^乕Nuｾ6
*ﾈt]耕9pjI
VHpよ6ﾃFｵｦﾄｵ+鼈ﾆｸﾏiﾜﾚ4#饗3S欝;'ｿA｢ﾍｦ粒┌BW鬥`fS､｡)ﾒ+hfe5ﾖｼ哽絣		`im vlr恃]楯Nﾔ附R｣ｼzF0XAj1汪ﾞｱZ八=｡ｲﾖ}sBM黒ﾁｩ5H梹5Dwﾔﾌ1a!ｶｷﾙ螫ﾙfMlﾍVｲU6[宰qlhｱﾍﾎbgﾛLﾎe+ﾀ犯a6ｭｭJﾕ岶cﾙｪLMｵﾕ4u政ﾊﾕﾁJbｫ
5X6 ｯj
#!\ｸﾐV3ﾘｶ圸f)uｨｭfCgj字ｫﾔ<[ﾍWﾓmｵ@,屏+luｸZhｫE[ｩ山jｱｭ伺ﾛ7HTﾇx5$j	;┓ｽｮｴU%@fｳlUﾅ>疾&4ｼ|ｦg芭TﾕｶZﾊV)ｵﾌV5C,ﾘT]恨ｵｽﾃ9ｶZｮj1@smUﾏv)ｲUCｩcmﾕ4Wavｼｭ"8boﾙｪIｭｰﾕJ怫ﾞ5ﾕ%%5ﾀ｢s"f6｡勘_ﾖﾘjﾎDVJiｰﾕj ;;撈aｳ_ﾘｯｶ:q汰ﾄ歡ｳｽ[n,ﾒ,l"ﾅｶZ?;ﾏH*фﾐ'j ﾄﾊ欖ﾟT[劑sCﾄgdｌLｭiGJ浴#椏幎|3Vbｾﾘ-ｹ.ﾀΨa`ﾝq
U+柊Sgn(S憎普ﾚ0｢ﾘ56ｻ3像'ｰ]ｶ:$uｲﾍe詔l-ｰm>}ﾗ#@8ｮO
ｯpｲﾙｩ､ﾞKe･N&>ﾌ	Xｧﾐ,GaEｰ~id`某ﾎ禾ﾀｧaﾏｲ[ｭE禺v\#3q:NBﾟ=S Qyｽﾑｵ:"賜U矯ﾚ榔 ﾛZ
a拳ﾖ,,,鉞ﾛlRgB簗ﾈb (>mu0$0.
ｯｩ沼LｱﾅXLｸ4ｺｺﾋ).ﾎE
歡ｫsｱyﾈﾎ鈬ﾛ鵤･ﾖﾙ"尾ﾁ｡･`ｪVsﾗﾜ|?ﾂ(c
ｱ_ｺﾆ>ｱ臙M譜'瑜O,4<ｾ]ｮiP|Dﾈ3Tﾖtｮ茄ﾊ喚?ﾁ曙08i~~ｱﾍ.C｡Wdｫ緊`iOﾃｿ8ﾚOｧ戡蚰<+
ｦ&ﾎﾈ康ﾐ9{6ﾇ%ﾈpﾕ･ﾐGｲjｫﾋ推sC｡ﾂP､U}	n]ｰﾊV@^ｿulｳﾚ,ｵ
WN=\iK庚ｨﾌ歛;ﾁO ｫ⌒))ﾑ1ｯ｢ﾂ?ﾉo､ｻ&i7*ﾓ+0ｹｱｾ
脅9ｺPｲv駮ﾃﾚX準ｴﾕFゴ	HPｷ ﾘｬ@ﾆfoｲ嬪ｵﾉpｺﾑujmｧ.ｨｼ`jr83=.屡悛%pﾝﾋQ$挫jLs 5D7[&4*夷m?X_jﾂ_ﾁ*Q@5ｼ鵤ｰP
｣o6x;@吾Y<$ﾒﾟﾆtﾛ9ﾙ#ｨ1ｙSｳ､虐虚ｺﾆ	l｢%@~=ﾖ攸ｩ:ﾂﾒ4[ｼЖｰVｮUﾗｱ草ﾑｹ-ﾁ爪ﾘ`u)9,Zﾍ*葩ﾟﾘzp#+k@`5	ｯWj机ﾔ(ﾓｸｵ i NU`$ﾀlVｦ0舟. oBB
ｫﾔﾞP%[ｨﾕ3ﾁ{3iﾍ%
Q\勍\}p･zMﾘ(`蕗ﾏO0憲ﾄﾋfｫT強nT7)uｳｭnQｷﾚ6u+L{9l0l@ﾃIﾜｱ^ﾁ秣+｣rｹﾛ 8#ﾉ)9uxﾞ簫&ﾏﾎ綬･y%6餅X<偬ｮk\朿ｷ｣zｿ｣ｽ
ﾏKｩﾂ肇g砥e椚D.u7霽H緞ｿｪ%qｴ勇LX瀦rﾉB侃PﾀVｰ]0XW;$;4ｬpV皋%(ﾋｮF ｣｡!ﾔLﾋ枌OSBlﾕｪｶtls ﾎVmjｳﾍｶｰ6亳ﾆｧaﾐV5鼻諦･去ﾗ-_lｳｭHX+ﾌ綏u翠ﾒLYU <ﾗmu/"n8店frH`嗄
\≦&ｧﾍVM;3ｺﾆｸS｢ﾘ_3-<ﾑ况5GBｯ0Fﾎvﾕ3cHﾖ:ｦ2:ﾅP}jｿ3\t\莫t蛋ﾀEｳ.D浴ぱﾚ1y島ﾑ$#1ｶﾚﾎｮBG
X4続ｫ0ｬGﾘｽｶzmﾈc"椙事｣@!､ZO!B遲ﾅｯｯﾘ麭ﾄ	ｵﾃfk5
ｦDtﾋ昿ｽｫﾊU
ﾓﾝﾚｭIﾘj'ﾘZh惆榮ｷﾟﾑｻz冴Sc岶g瑠麒遣朸ﾏQ2俚
ｺef｡ﾌﾆｷ
bbｴｴﾟ旺ﾕ&\dｺsV#ﾁ:\qGpﾅﾕﾟ眩ｷEaﾌBｧ.ｴ-qﾚ竄ﾙlｧｽｶ祭eN{/ﾜ[ﾟ･1)午答簑)
ﾕ¶ﾓﾀ6~'ｺ	欺X08ﾊ畫}ｸ{ﾃwVchE
45ｬ=7L遉ﾞｿﾝC恍Rwﾜu<ﾏ^$釈[aｪzｱﾙ+豪O%ｮﾀ厶ﾎ`ehｩｳ@Nｪz@揺ﾀﾅ{0Eｽ8
S.斉ﾁｹ,?yﾆﾜ館ｩﾑH店ﾚﾅ｡Qｨｯ[ﾐpﾅ離ｬｱq\ｽ丐ｸ:ﾜC[ｯqｬ^ｬ-bwﾚﾆ鵞ﾛ1q声YB[S夬邇u/ｼｱFﾛyｺ.TﾟqcﾕX=h|ｫブPZSﾙﾑGｷｫ毒,D,ｰ%ｺｫ凍ｬ佳｢PPMuﾅ\ﾊ竅uP/Fﾛ8貨Tzﾆﾂ@ｳﾂ)XUﾅa)ｧｬ誤Dｶz]ｽ礎ﾜryﾗﾓｱﾕ篇゛ﾋVoｩｷｼ÷.逢bbNhWTｴkl斯ﾗf糶痣ﾜIp雲Sﾎp粗5紂y2寃EｹX5ﾎ87&T	iN#VｯWj法VE|bJﾊU4--怩餝ｳﾋ`ﾘﾃ誠ε喃-%裏ﾄA,S倥Z埒ｧ@mﾍqAyN咳
ﾆｪｱBﾑCﾇﾕ0ｲﾈb4>qJqｭ,7:kf5ﾟ劵-Qﾝ尭%>ﾟwﾚ犯Wﾉｱﾕ鐺磐ﾆ"5听?i`∀^cﾍ枇凜ﾛｷｶB}iｳﾗﾙ6{ｯp[疚栽aｭｶV=ｧﾔwｶﾛ丙仍榮aｺﾋ=9ﾘｻｿﾚ}羸cLｬ3ｻ<@pyGﾕ｢ﾔ(ﾇUｶＱ9%ZFT#bﾍ:S|Y諷ﾎA2ｵｵ拙2a@ｸ崇ﾑqﾊ<媛Oﾐ筐5涓Ws/>貽ｽ{u.ﾇﾅﾐ｢6'怩&v @|餠ｦdﾘ^恃d､p/ﾞI;ｷd^Lgj9a/ﾎﾄ^ｼ	ｼ或ｺﾍH里R8笋ﾋｪ=yR.ｯ8Kﾟ)･ﾓmm｣
奏^ﾕ;ﾊｪ*ﾓmﾝ	bwﾝcai6Qz;[>)w{lﾝE}	jﾓﾝﾃqﾈｪｻ麩`|ﾁｾﾆYd3ﾌｹ"xﾋDｴｻ#ﾚﾜ?l"ｪ伉ﾊﾀ}Aﾛ-錫ｮｳ9支ｧOMﾐ｡N愕Z襯ﾆﾜ製-ｻxIbA瘤aN^n?ｰWﾇg疥
{ﾙfｯｲ凌-授Gﾁ*"折L氾〉H7wｷ7ｲ;l揣ﾔ`e3ｧRﾒﾙｰi!ｼ/桀ｬ2[hEcﾖMウﾉ■@u%｣ﾁ瀧{〃NnZZﾚ畴ﾂﾂ)#<ﾘkjGv覽c_唳ﾏIｽp[ｮ	@~l4u關cjﾖdｿd栴\AJpﾀｅﾓ疳`ｩ劑|ﾗ4嫺娩ＣN"ﾕ `3ﾑZ哦･{ﾚ:[ﾂ途ﾘｺ7D渕情I殺ｷu?ﾝﾟﾖ~ｶﾊﾖ接ｽ\｢Ｃ晨ｱ､4 ﾞ茹★zPﾛYnﾅﾅ惰:ﾆﾛｸﾓAｰ|ﾆﾉ藉頂Y0?+Y亡
ﾄｸ2
=ｵｦﾖ;;ﾞ9説ｪ嗔ﾄQ5礪	]SUｽﾟs`|継ﾅuｰﾝr3ﾙvcC^ 旋ﾝﾇuﾅC~tﾈ7t'ﾕAｩﾗｶSケｪｻｻ<ｭf 1ﾌCf午z@ｺﾁ'ﾘk{Xﾂ9h}l4WLYRＴ埴篋Oc黻ｳfﾋΛ8&ﾗbfﾎｹ5ｯ`ｺ3ｭ戌ｦ:g+ﾓ苻-(3ｻ)taﾈ4HgNｸ¢n2椙k槇Mt｡@ｧｪ梍1)ﾊN_ｧｨv｢1ﾔｰ(]ｨｩmjﾄ/K懿ﾆ 惚ﾏruMk7GD<ｽ	誥 ｲsIIﾝセﾞｸFﾀ*s)溷ﾄ`'<謠o\悪*`紵ﾍﾐMﾝｮﾘｹﾀｶ貂殫､ﾋｵP繪X$b鏥竍ﾞ9yﾓ+kｫrﾗﾊDｧﾇｿｧﾙpz,ﾀｹXBｫ\e弃g&浬ﾉyｭ鯖4%ﾝｧ&隹D7[ﾁb]ﾚM牴寧3fN.ｱ:Rﾃ胤43ﾛ戊;ﾘｼ3ｧﾇﾍ荀6"ｹﾘ冖,6u*;ﾚ｡%ﾐｹO<懃3Еｯbｨﾟ%ｵ|榻ｱ4塹NFg｣-0ﾔ>ｿg$mv踝(霏\､ﾚM]ﾛﾖｫﾆaQﾌﾜ~02*攣pﾜﾌ'｢<ﾘ刹Gﾊ＼
ｬｹ!<ﾖ`{歿ﾐﾇﾅ~ﾖZGﾉﾁOs}ﾕ訟ｺYzIpY`E
ｾq§ｯｸ	'ﾂｱ･ﾇT･8aｳ(tｽ滕閾ｪﾈe9ｸｬ`;]ｼ1｣ﾌヲ狩dｱ#ﾚ	ｿｺﾄﾁk`ﾀ\}RｹWC雁ﾑﾕnZspﾜ池胛YHﾑ鰰ﾕｬ%Lｭw截BｾsﾑIGｰｱﾞﾑ~矍=qﾟ可図5a<ｫ5ｳ}[zQｰ1&ﾑｸ;ｦo篁&ｶ◇k胛Sﾊ7mq鯲)e匡箆(=yﾌﾙ援yﾌﾉc`嚼jｹ"ｱ,N&Huq|F)HﾅWﾗ善;ﾌ8+･@zO.ﾏiｩ	{ｷ){矇ﾀqｯnNK陸ﾋD`ﾀ弟]8#Kﾂ贍｣M膩mｾ0_･箸W壓瀉At87jl\ﾝﾈｲ 0K桑:UaPﾛ\Qﾟﾃｭ?晢'7EBﾓ｢由)咥ﾋpﾆ 8ﾃV0iﾎ[/j樫｡.ﾘｯ5D秕>ﾜﾋｧ N)n
ｦｫﾃ{祀@`ﾕrﾌG> 諾e舜ﾋﾙT1ｳThｳy似eｮﾋ)ｪｩ5kj台rｱ $ｺ7a･ﾁ[8XnJｦMqrｬﾘp瀬ｪﾌgｽ朞t :vhtj*ﾈ).pn1hﾎ5ﾌ､kｪ&FPKzGc|卵ﾔﾊ@cｽｽ､ｩｦｶﾊ8(ﾄyK遠ﾎ抂ﾝ2Sﾜ{＿V徨6食ｳD._ﾅﾕ5ｱﾕdrﾙ､枳99aqﾄ卻^D帰ﾗﾋ0ｭﾇ%]ｰｴｧｫ埀 ｣｣!.Pﾃ!bｶ9zgｪgｻ
/ﾝy"ｮFLQｧ･猯ﾌ
勉Wﾖ6=ﾝj窄U^_ｪ_ｺ ﾔ姻嗽賀ｳ叟nY¬蠱*sg"wﾑﾁ(gAﾎｺﾕMvｪﾅ=t釵cVｼﾚ9鈞枋v瑰M(	W6ﾖ4DﾌｸD3ｫAﾓ腸ｫd}5qｷ1uIｼﾃ親跿I|Di@ｼｻ&ﾘh6u矮､ｨｾa4ﾟ哥穗ｷ@ﾞs@G.ﾕy7h$ﾚ｢5ﾕ5XW化ｭ(lﾌtｪｺ貭沐gvｿﾎ)ｯ{o}ｨN9ﾓapwnﾎ[畤Aｽﾘ3N*ｽ*-ﾅKｹﾅzL%\Uﾖ-~xxO1ﾎZﾃﾔFﾐP
[ﾊ輟^{cﾇ&0鬩n\殤粤(痙,ﾜvJｿs=砿Hpu祥/Ce(ｦRy*癨ｯ5x\ﾅbi坡羆U〕ｭ& 9ｶﾉﾌJ6}鋭ﾚｼ02ygDl~ｨ2ｰ､	ﾘmn*ﾚﾈ棗ｵ｡pS#v凾11
(`%羃D謚ｭ[ｻ7z=r_$ｧHﾊﾑﾏS円WyﾎD
3ﾋｫﾃﾈｦ]q]ﾎｹ｣?~ｩtｪﾂﾑｻｨ｢l菟V:e匣倥hｨｸ!@侮K ｫり>璋k偵s~/;ｮ4x7uF匠ﾄ4{&~d_4ｫｱﾜn`ｫﾊ-ﾅ棡d鎗"ﾛd(肩{O<ﾚ]_襁+ｮ鬨Wﾃ(ｿSｰ釶ﾔ!
4ｴsSｺ:7tﾂ3uﾓk齶ﾂｸ桶背厶u%.p｣^sYo:Lﾊd:ｫﾞUh而5'^ｾｽx5ﾖR牽ufEﾅﾌ密ｮ笛ﾁtsﾇT^;q併ｺ=_WﾃjwTxｻVﾃｲﾆwﾜU讓p#ﾋｺdﾅnﾏBF淳O%j攤ﾋ1l+｡)7kj穹紺kLnﾎvbp袖ﾈ\v夜sC[Lw･ｻ娃.r懊8u昜'坎ﾎﾑ綛ﾎ7fQ[a)込ﾙﾂX!\tﾏ)EDzﾃ｣c菌ｳｩﾝﾚts[U9ﾓ#｡yﾑBﾄ<飼GBﾙｬ｡槹-mnLK\鳧5ｼﾁ0Dﾏ3ｫS律ﾅB+e>|Aﾖ%v+ｸｪnr鰤3pﾝ+<;ﾛ$ﾐﾗ9=疥ｼﾆﾝ-幵ｻ	s3｣[!ｮ.IY Nﾋ癨*τ{sN
tp軻8h`ﾇ背ﾇtOｽ#;z=ｵ｡J;w琴ﾄe&肚･ﾔ,袒ﾄ
gﾃJWE･1奔ｼ鱶3ｦﾝe@7ﾀﾂ,Bﾉ&/茶7指ﾉ咏j$x｣忱ｮaﾇ帷	Dy蹄<ﾙ}樞>Ou洫ｹﾏｵtvy樣>享m樒ｸﾏs
}p1c酖oﾊ.w犠ﾘEbv	<}xgナw冓G:,xﾌ6竜fH7ﾀｯ5
ﾏIy[	ﾍc[	ﾃc"'ｭDm!:囑ﾇｷNﾟﾒ.Aﾙ先､'NJI價:途棚ｦ到臧2I!YFF鉄ﾈDr*泉Jv赴H!ｱd莊槻m､>ﾛHW^uｫﾛgj廚49rｮ1qﾝ｡Mｷ6柘Ll|ﾋﾈl#ﾝcu&xﾝ:r1`ｴr7z~2ﾏs｡]V+鰉FｩﾈﾟFzRﾒLﾆﾀK6%ﾛIｯPﾜｻ策)ﾈk#}ｽ`馮他く､AC餅O9@宣.寸.植3m#Rｲ》ﾊﾖFc2ﾄiZнx>m#9w!､`6$拿	oW掻d#B6掃r
ﾙ十G簡@ﾖﾍ､五Df騒ﾉ砌RIn%ｵ膀r,ｹ岻 ｭo@ﾜ
p/>CМ,A◇86w倔|倔@ｲ&exﾆxi##ﾛﾈｨV2ｺｦ枋瀰ｿ62ｶ"綮ﾉﾍ$;/c|)ﾊﾋ(ﾆV2ｽLｸ沐ﾀ箇拉mﾀwｭ ﾝｭ菎$7ﾚ%╂2J!:Sｽ,ﾚyRm*T曼L<乾ﾍﾊcU｣ﾅﾇ^ｫ遙5WqFRﾅ*ｬ1s
ﾋS6怛ｿ｣萍/9Jb|[OzCｺ&署()&Oﾀ 雀膠$YD栫i~4ﾈ膓r-y洞盛ﾈy飾Jﾞｧ ﾒ|I>ｦﾅｺ線娵前1!_ﾒﾉWt-ﾖｰﾄ5ｮ\ｼ	r!炸v{迄ﾝ%';ﾊ軈2墹/w腎ﾌ仭ﾌsﾆｾ､0記ﾌﾋ輓蓿"棊ﾍ｡`畄ｲ("yﾐ(F哩､､?Y~	$7逗ﾟﾉ$傳vyv90螟
ｦ栢@59恨撞ｨmyｭ;ﾌa乖ZｴyW｢B｢囘0n濔酊ｻ爍ｲ9ｮ=ｼ#SHR9*受'rﾍb蒐笄VﾂK0m&]jo"換.E
Kﾀ[ﾇ□.	ﾍ{ﾚﾌｦﾉ'!`HVﾓA]ﾜ_tqoX;ﾈ靆ﾚ逗]ｱｩj&=ﾓ｡zPF1,鰌ｦ#｣:^*"=Zﾉｲ{I
:ﾆｹﾜYAv墮%Hﾆｰ0謳ﾎ4洛ﾞ曚ﾁﾐ
ﾉ奏ｹ"ﾓﾑ舐:ﾆo3FﾞﾑT準^齶Ig@$4l仝@Xw\ﾒﾘFﾂ快ﾚ(xﾝ(:枦$C'ｴ葭Id8=ﾝN(｡ｦﾟｬlｶﾖiY｢)$ｭH$x[頴+広ﾁﾟｪ､oﾀjﾀ*ｧﾒ+Zr廚ﾎ5m艀,ｺ<Qｧg懆ﾘ♂ｶjz Lﾏﾋ89VODﾏH{wbﾎｪq?ﾅ"c+撩Sﾇ*ﾚ`ｭVｲﾖﾍｻ呪ダｧcﾎｨ6rｰ:+ﾗXﾕBz8ｻ瑜37	eYｲ,uHﾛ?雫g9ﾘｯuｰGﾂ"ﾘ,ﾕFﾎ.ﾒy酘s篁Q囿IｶﾆｷQ峨ﾋ1ﾏgｨｧt^ｶ6ｼ0ﾚp]ｴE姿,ﾄ享ｦｨﾐﾜｦ%ｩl智!ｾｮﾖ7⇒RｽﾞUQﾃ渥/左ｾ,･ﾀVﾋ	:t	ｯe"ｴ懍G&楢!d
ｭ ﾐ$Hg代駘｢9d#扛Z蕊"4=ぞB$ﾒ｣ﾁｨT佃ﾁ|G膰ｺ*｡>ﾚD3飩:式｡ExZJO､s)t>=.｢gﾒ%,ﾈ9璃C/閻az1ﾝI/｡ｿﾓﾋｭnｴﾙ鶤7Xﾃﾖ(z･ｵ?ｽﾊ唔ｯｶ贄斎bｺﾉ:某cｭﾗZﾇﾓﾍﾖｩ#h7ｦﾋ;讓op嚇ｿ6;@ﾀｿﾖ$ｿﾉﾉﾚﾕ^ﾀｯL!烙 xUｹz;ﾙ8ｽ`ﾁﾄnﾚ@Cｬ｢
ｯqﾘ*懿k攜ﾘｰ構牋ｿﾍm艷ｻ
!ｶﾄ5ｼｱﾃy[ﾉM=nn|ﾚﾈ-)-贍=+>1(NOﾜｪ6r灑ｲ｢ｻZﾉﾝ;ﾉ薩yOﾈｶz$ｬｸﾅ凍2ﾓSﾚeﾝ思tﾜQ[QｶeXuﾎﾈｭ
ｴ鍋ﾁ
uﾞm&>$ﾙNﾉ0ﾇHﾟ驩}耕ｼ-左甅Dｻｸ/ﾎｾ?~掠ﾘﾋ-覡ﾂyzｹ｣｡賃ｨ(hﾑBz詁L?暃1
ﾓOAS|z8Jﾐ!ﾈﾍ8ﾌhQ+ﾇｲｬB戯[ﾒ*ｷﾒｬ枢nｭｰ:YｭｮﾖV7z+ﾓｺﾙ麩ﾝfｰﾚｬ}ｬmﾐiﾋo}l
ｲ>ｳ[?XCｬ_ｭ\/+ﾏﾈﾍｮ_梦]ﾖ^ｾM鰌=乏ﾛ|<ﾙｿ{"ｵ蹣-8E;悗B5ｶF帯ﾖhrｸ5e遷ｫ豫ｱ&駐ｭﾈ餬)ｹﾐ咤.ｵｦ1ﾞ竡qｳｫ;寥fﾎvｦﾃﾎｽ!ﾉｹ{2ﾑｹ{ｪ捏瞭:F[DXﾓIｦ5レｷf悼ﾖ<ｲ謫扱ﾀ|ｫ喰ｫ.ﾊｵ泱ｧSｫ]ﾃ竡ﾆ(gｨﾏｦｳ{ｪDｿElﾎ0#G黛ﾖbｲｿ %V%9ﾄｪ"ﾇZﾋﾈ
吝03+DﾖYﾇ!ﾞ貳袿	F諢槫作9ｷ&脩ﾗJ^h#/ qﾊs冷班ﾋIM^ﾍ6ﾈ蒄>|
^+ゞ 4{ﾃｭ*｢UﾟlWｵ5Z擣^v4Z｡ｿ0+Fﾊ弦M視ﾒ#臂｣ｭﾞ3J*=ﾏ驅I^ﾆaA騷-ﾉﾍﾓF>1ｬ怖Tﾄｳ酎
|慙[ﾉ'Eｼeｷk-ﾚｲ%早"擦$ﾅbﾁｧｩ挙f8`Ub5ﾖ*談ｭ&ｳｭﾈ替王ﾉ:劈`扣ﾎｲN#岻ﾓﾉ斎ﾙ膀r殷yﾓｺｼg]H>ｱ.!ﾟZﾉｯﾖ?(Zi]E3ｭｫiｶｵ鐸ｷ6ﾑ}ｭkhｮu-
罸hｩu]bﾝJOｱnｧgZwｹﾝyｦｺ吉<悍｣ﾎgｮyﾈOﾖ= `ｭ､況ｴｶ沈ﾖｽI槝A@ﾅ
t懈/RJﾉ{Wj四xszｼ'乙Sﾙﾚ/貼険竈巧Gﾄ罫0gt
ｿF|VM聴餘Nｧ地@芙Igk;c=jg)ｵv
)2ﾟzﾔﾏｳ$l=GV[ﾏ涛ｬﾈ袒K腴eｲﾙzE因ﾃ｢ﾍp畭ﾆ	ﾚ｡q6VD#4ｽ絅h?%Dh?c｡	5V:ﾚ'7BY烙ﾕ>BﾅAｧ,哽諌0ﾐﾊV{ﾌT^ｶ関5ｩV笋ﾒﾋ`7ｳFkﾝM
>+	ﾉｷMｳ>%闘ﾏﾈｰ_9ﾖ7;ﾒ`}ｰ?5odｽ;ｹﾂソg"w3ﾙﾂﾒﾉCｬ訊#涓
Nvｱ}(eﾙTｲ^ｴMsY?ｺ@緊@`ナ
Bﾏd9"訪ｯcyF飽og	6>ﾃ
鬮l8剥_ｱ琢6ﾂｧ.vｷｫ掾<ﾎ謁杓+ｿ7{
ｺ酢,wﾝ陸BYtQﾌ;ﾐ3ﾃ譽N麟ﾗPﾕｺDｵ.[v襁~2D>ｻ塰ﾛﾉ.x聽起2ﾊdｷ9ｶまBLｮ僮I\ｳ\雨ｩ[&･ｮｵ+h｣1ﾇﾚｽﾛｻﾁ請奉ｼｾH,ﾏ0ﾚ$ｳﾁ&ﾁ&>l2ﾈ$綺卞ｦ茶Y99LｰCﾈ速,e3I妣壓｡86岻eﾈｹlｹ-$竜Ed#;<ﾅ3VEｾeKｩfﾋiVOｳY因g
t(ﾓ｡｣ﾘ
ｺ?[	3qku}ｧﾅｼL*ﾐｲN孃ﾌｪ?ｿo保ｩB｣ﾚｧ碕ｼlﾞw+M[ﾋﾀ埓帑ｨｱｵDｱﾓI7v&鯱ﾎ&ﾘ9$~ｲﾀ:mJ9tq%QｲgRﾎO7ﾄｷ耄l+ｴﾑNvﾕﾗB仙5lﾔ'bﾚv惚ｸcuｺAv_ﾐ,4#n搴f｡rﾋﾙ｡kﾉ=Y
oIf6ﾏﾃ1瓱_ﾟLﾆﾆu觝ﾂ@ﾊB%ﾛh臭ｺwｭﾚﾜ士q5ﾊﾞ鶫p
$mｭ淅ﾍﾆWﾉｫﾌ戎	=zﾈ団EﾋC`ｲ$m%ﾄｫｬLﾚ7〓Lﾚｿｩ絖blBﾍLﾗ@陛ｮ$｣ﾘUdｻ囈ｰ$ﾀｮ#'ｱﾉ駘3YｮﾂﾍF:ｻ仮篠nﾖJﾇｳ6zｻ櫻cﾐCﾙフ{録ﾌ杓ﾊu9nｴｨ染ｽﾍｰ8ﾜ!#1eOmcｹ\泌ｲｶV:ｰ儺ﾀcﾐ虻[鮴ﾍd"ﾂ=)gSﾆpQﾚ$SX垂|ﾐtR蛟晉ﾀ帋@欸~:､m&杳-ﾞ6@m2i.*照ﾎﾘ苹=ﾓs<ﾌ|X｣ﾁ$*ﾉboxh/佃ﾞ!#ﾙ{､仗O`6昔b麾67i`_5ｹ筑C6ｳﾉ晧'r/h|ｿｷgSГw@ｬ従ﾛ[ｸﾗFﾛﾈ625i[粘Pﾓ鯏9z 
ﾊe*ﾞ聡竃ﾞ革zA+-ﾘAｯe｛ｨ/錵讓径ｨ2｡Ho|oｦ<ﾉｮ
舳=bﾁ-ｯﾋ贔鴪V:ｲﾌﾌﾒ@]ｿ鑼軾ﾒﾙ}ﾇｾ淺填狩:ｬ瞶ｯﾆk]ｼ-ﾋ､5m倆t径;!zﾊ､ｵmｴｮ
π2i=^B/繦AﾜcN腆ZS躪ﾗｯveﾒﾆ(ﾋ"a	'瑛ﾗｻﾈ;b}fﾒﾊｈﾕ畑ｫｰ+ﾚ靆<}ﾞV{:-瞽$эKv-2皇岶5;>6	ﾍﾞ'u焜ｷ['wAﾓSR9咆ﾔ事沾P4ｧﾞZ輌zg乖ﾜFﾏLｱ:棚掵5z6棉l瘡oｬ轉ｬｱb=LL=ｾ癸z>:>\ﾐu澁{n詰ｹ洪h"墳｡嗹ﾌVﾛ鮗"Cwﾚｲuｽﾘﾐ)ｺ洋bxｵｾ△畑ﾗ{慮ﾑﾋ$ｫgﾉIf線G対ﾖ署栽ｻ?快ｹ駲;ﾙﾘF
窘}0ﾏxｦEｮｸ(|ｲ廊zeｽjxﾙ啼ｩｵ額2pｵsP	{7\ﾐM亰抖ｵﾒkﾚ襍mｺ(O%象擘uｯw并zg@ｬ!舁0 奏ｾ腎蜍H?碇礙冬|	)漓2蓋ｼ･d*?ﾊr2隣脱ｼ,磆､Ho +y#9燥ﾉ鮠奥ﾇW尻Jｲｯ"ﾗﾕ腱~ｹΡt;ﾀ寂ｲe#ｳﾕv拳ﾁ?g銖/ﾘeｶﾋZwv=ﾛﾂaｯ_ﾙO/'ﾟﾅ･.(-,>X0>Rp>A>I(>Shｾ@､｣эｯ]ﾑ賓咨fﾑ旻%zﾅ>|ｻ靄氣`5ﾑ響+z)劾b占&ﾀﾛP9"O芒ｱ"_Lb(G渦b-j!ｱｿ8K"qｹ ｮﾅ甲頂[(ｶ嘘据腸r{ﾘﾖ{:#y<ﾟ83Sﾞ辱-y粭[｢ｪｸdﾟDﾉtt>鏑ｬ_ぱxtﾔ-Y壺\ｦｨ8.j蜥\cｫｳ蛭波ﾒｲﾓRﾚｻｴ]Lf\ﾋｷW渭耒'R{7;筌!t(vﾆ[~ﾌ陶ｽ!駄ﾍz*ivｸY{vﾜ柢ｷ担Q寫H 5播ｼ_ﾇｹ^ﾉPｹ(M畩ｫｶﾒｶﾐ;簍i$9ｱﾈ覧ﾋｵﾒ梁(lp李ｳZﾝﾎoﾚ,ﾗﾆFrlm8得ﾒ1^ジｼkﾐ!ﾇｽﾞ周\	ﾞH]A4ﾇ/vｾﾟmﾌR9.ｿR#Vｪ66ﾘ蜘<湲3ｶ2&z;
rﾋ･$]ﾔb9-鶫ﾑ@0-"､D4訴b!V土8rЧC*ﾅq9V廩V遠ﾁ曖ﾎｧ-b-y@ｴ8鴇(ﾎ"o圧ﾉ{oq.Z廨#ﾎ'ｨ%.､ib*.｢K饒q9ﾍﾍt蛮@'+顳ｱ膳窺4$ｮ｣ｧ壱b3]'n､崙Mtｳｸ呀!n｣O棺顆級VK-VOﾑf[ｭｱb5AﾜgMZ絵ｬE祺k悦ﾌｪOXｫﾄk菜i.楸.OYﾍ稱ｬ警ﾎzIｼh(^ｳ~ｯ3*ﾞ`Jｼﾉｺｱ樞m6Pｼﾃrﾅlｴ縁ﾘd1;H嶇浚ﾃﾄglｱ６/ﾙ9+ｶN|ﾍ6oﾘ5禺v串爵%ｾgﾙ冷?{Eﾌv過@;ﾏQ祕>^ﾅKﾅ.^.vY梯ﾓ､ﾅﾏ膜_(9ｿLJ乃yｩ2坐/}厥ｿ6Ev\v]eﾈ漠｢ｯ.re){>b｡ﾌﾙ[,ﾅﾙﾒ/.Dｳ(塔ﾄ縒_ｴ,^輩
/ﾞ39L ﾅorｸﾘ-Gﾈ49Rv淵9VﾋqｲL/代虱u 諒ｹT 陵Ry凋*ﾏ盲蕀`ｹj]-+蔟rｼ]ﾎ眺P頗+汾萼r~C`t｣\WﾋG_tｵﾞmj%xO1Oﾄq歟ｿ腑mOp｢ﾞ/ﾟt･&w4ｿｭ8O履OZjﾚﾛ?_i黜+ﾋﾁn･%Z@<%
裄
ﾏ贋 $.@･蘰ヂL2ビｭﾀ:ﾘtﾐｿ35t!Qﾔ$]Ezﾈﾅ､ｷ\Bﾋ*2L.%｣2R"kﾈ4YKfﾈ:2Oﾖ#d\(ﾈeXr浜$ﾗﾋ0ｹEFﾈﾝｲ瑛+ﾈvｹ廷鉢ﾈ?號ｪ<湿-ﾗ随芍艝y
Q曷挑Q-ﾏ膾4O朏ﾇﾈ$y!%ﾗﾑｹ"z能O茹ｴQ^F女ﾍRy}P^M泓+rX^C?隣Z勿liyヵ!oｲﾊ[ｭ塊.k仮ﾛZ&ｱeｫｵZnｱN杜ﾖﾙrｫｵNnｳｮ煎[-fu|ﾈﾚ&ｶ梵ﾛｭ鈕#ﾖ+Qgｸ涙ﾉｸ|
妄ｲ|ﾛO届倫ｳ｣ｬZｾﾈ茘ｬIｾﾁVﾋｷﾘ]ｻJｾﾏｮｲﾛ衂ｬU~ﾂ帖ｱ'蓍iE:褸_jq脯^ﾎ.isﾎu拳ﾈ､ｷ･8I?偃ｽ(ﾊ'ｱ悍ﾏｲdﾁCﾗ叩逶幻F[!ｽ┥W%撻=咆緝容ｾ姨ｦﾓv)@ﾘ-$m-ｧlｬ0ｻｯWg
$VHﾚ悲!G/"ﾅg2QB&ﾋ_ﾉ!7rｨ,%r9S&酖ﾗ+J｡,rd湯:ｨ{笛#ｷ+ﾙ｢｢Gﾙc旆ｾｳ鄭:Md訌ﾍ潜ﾉｴ=0Hｫbg.鑒ﾉg.tﾌE|!ﾏ7kｨSz'ｭ=鑼mCﾗ咆sｧ奈<ｑ｢4躰ｭGｽ豺ｨｪ+濤gｶ哨jﾒ3髣Eｾ｢3餮EｾﾘPVｶ9睡梦6ｭｳEｽZﾙN縢i&rD>k｣ﾟｽﾃ堤ﾖﾑ=ｬa
｡'Si$ﾇ&? ]Mﾏ?捫i#c`cﾓﾘX_妄Zﾒ'?ﾋ}･gｧﾟKk&rm]ﾃYi淳ｿ煮綣E><Ez0ﾏd;W｢ｪﾈｱ+J鮫ｺ;v姉ｱｱ餾鴿ｭ1Xｵ詒･#Vvｶ
Xm ｲ\僧ｷZ拍*齡ﾝ	ijﾁﾏﾔFﾎﾘ`ｩwﾋｴ婁 ｨI>jｳｸ･ﾛﾚB蟷ﾎ親ﾛHｧ<ﾜv銭q*IｭｯMjMﾍﾋｴTｻhﾈ(,ｩﾈｺHzlﾃｧ礇ﾄﾂ峻`ﾜﾑ#clｬ抛GIﾂ&虍ﾙH誰)ｦaCﾛkﾓ/ｻ等ﾏｦｺﾊ0ｪﾅ枕秣w*PﾅJﾛ5ｫ+柯ｳ]\7ｿュ4ｫｫs.mmﾗﾝ-ｻ?ﾏ齲弊ﾑ愎ｸﾗﾅ｣／BVW<`uJJ丘ﾊｬﾎﾐｷﾖ･ｨs?｢ｱｶ[
ｦ>ﾊ呻ｮ']O貂ﾃ:､ｸ]nﾊdwNbｮｺ=V｣[Wgui~ﾞIrﾃN糀窮LﾝsVｭ#lﾘBkM&已｢ｮｱ肩｡/
ｸL.ｸy3ﾔ3ｽHｴﾌC+3碍ｦﾕﾝ(祁ﾒ)ｻﾛ6+fﾝ黶ﾋxｺ<ｻ岔癰ﾊAｺ蟋ひ3EﾕｾW禿ﾍｰv炸(3綴恟u歯'~ﾈ)(g61ｽｽﾊﾚ-ｮiｯ"ｬ^SE､楞vk鈍ﾉ鱇;ｸﾖｦ-ﾞｿ6}wﾋ溽｢O(UY:26ｯﾍ|ｨKｰ!憚O蘰)sM
B)ﾃ"[ﾆﾃﾋｴﾜN[鞨 fKｾ-a\ｻFA闥-ｳﾓ｡疎ｷ､RﾐﾟﾞD=ゝ!爺K鶉ｴ鶲ｺ)?ｧｵ/勠水j(9V蜻ﾔ0r･*;>ＭU#ﾉ;j?｡G>U難ﾕxｫ*｢DMB@GｫRZ｢ﾊhｩ哥ｧｪC陦j:=Lﾍ､GｫC髯0zｮZH/QGﾒMj1mQGﾓ婉ｽMﾕﾓT}\K欟策yｪZIﾟUﾇﾑOﾔ:N｢ｿｩ-ｦNｱ|鶺ｫｻZk昂ｧ[耻YVｩ:ﾇ坏ﾎｳｪｭ%"+ｨ.ｱﾕzu匏Y]iﾝｮｮｲZﾕﾕﾖCj｣､ﾚd=ｯｮｱ^SﾗZ洸ｬｯﾕﾖ/jｳ:1u#ｩ婢wｵ榊ｫﾘu?岷`A ｫSｱﾕcJｻC=ﾍVﾏｲﾔ1"{Zｽﾂ^VｯｱOﾕ幗k循｡ﾞ鍄ｪ駿｡ｫﾏﾁ黌~ｸﾕ|･賊S睿~ｷ捕ｯ/hﾆ_ﾑ愾｣Xｧｯu鳶莉tw束{拒ｺｯ
=DlﾔCE勤ｷ\qｯﾎ場|./矮'=Z･ﾇﾈt=^f"ﾙGﾋ!zｦK8=IﾎﾒﾈｺLｭｧﾉJ}成ﾓ2｢'
ｹNO覧
ｼFﾝ'[lyｫ#ﾛ\ｬ'ﾟﾕ薑sｽP~ｫ諸?鬟襃:ｸ^｢飩5BWｩtPjU｡劉9ｺVｮﾔRﾝ@|欒t獣^Lｾ封
ｸ`ｨ>ﾍ3ﾊﾚX苙y	棋:莱oM<ｧ#ﾄb;ﾘN.:~7[)"ﾆR2ｿﾟNRﾙtOoq<6浤9}央♯襪U睛ﾋｶﾕ;ｩ腱v3Bﾚｿﾆﾏ]ﾑeL?ﾆMｴｾvﾓ鴿m棒n鯨ｲｱ4ﾁK｢ﾎ･戒ｫｱ秩~Rﾑbﾐ9ｺ逢
!: ﾟ*ﾌﾇ#R7R学%ﾙﾂｼｷYq~1箟ﾎqｿ｢蟹1ｻd'=?["y｢ﾄﾎMI(gﾈｨo3aﾎ師ｰｶ!MUﾇ祈Dｳy峽o[ﾒｹｱﾜ奮籵ﾄｱﾗﾃﾐﾗ9tﾗ7!;_9ﾌbNbe煥ﾗpﾚﾍg我ｸ{ｻMl ﾝ&ﾍLﾘｾ17$Jﾙ萋X｡)+ｹwﾈ9)ﾆUﾈMY≪ｴﾆBﾇ続 '悌z-鬲ﾏ ~}勣ﾏ&駸ﾉ}>9^_HNﾐzrｳｾ値ﾓW乳&ｼｾ⊂ｦo"o嵋'･ｾ脚}7ｬﾛhﾞFｳｴｿ~ﾕﾑｱ1:E?Eg輅ｵ~茄髣飩ｽJｿEｯﾑﾑ')}[iY;ｫﾁﾊﾔ?ZｽOﾖ4婉ｧ?ｭ=wEﾖｯｪｺgｦｫﾓﾂｰK&,9-ｰdAYV	ｲ$%
xbﾀ奪ﾑEIﾖwgAP扉TD*)f午ｫ龠辨eｼ}LtWUｿzRUｽ哢
Ai.ﾗTｺMﾐﾃ哢ﾏi&ｫｪYｬ囑ﾁ喨AﾖOﾋd7kｱ[ｵ麝啖Eﾎｮｸﾈ∫\ﾇﾛﾁ)ﾑﾞ%bEﾚHﾃNﾄ泳v6蛯ﾜ-｢q熊
ｻｬ}ｲp薨]ﾑ
L\<7оﾖL-Uｵ0ﾔﾒ｢ﾖrｱﾖﾚjM2ｭﾒ堙ﾕZｸFk	ﾗjｭ7ﾘｿﾜ-危P
ｸｿac･4Gｮ>W5m<ｦbﾁ-･M蜴iﾎ沱gﾅeﾗByｯ
aﾍｰ?ｧ須４n｢哲釿ﾁ譱ｵ
i?=尋8Vｵｨﾖﾘｲｴﾎﾐ^]ｴｮ星uZw｢]#ｵ0Nｷi0_ｻ榑ﾀ*ｭ/ｬﾑﾁzｭ?婆Wﾃｫﾚ@ﾘ･
ﾚ`8ｬ
cﾚ08~ｭ后Nﾊ猶ｮ#破8i0R然ｮCJｽ)e4Rﾊ､然nBJ2)eﾕ&ﾂ@mz2龕=	ﾀｸ側ｨ･\'e｢m
hﾚTﾙfｯﾛ覲PdPｰﾖ-#ｨC*6ｺｸwﾙh渺鏤7ﾙ蝿､ﾑP@ｶ,B,y鼎8$"ek+ｯDﾕ-ｴua@>nﾐｵ{ﾀﾐmｴﾑﾆﾗｽ卻m5EnﾜNｺuﾞ@ﾛﾊ萍Np八X攻*･ｨ'ﾛ'nio抱V7ﾍKZ<i!Qｼ斧｡枳p&;ｦiｵ'ｱﾅﾛi[tJﾓ)l4市|3ｲ
&YUﾚNﾚRYｷﾚVw圦｢%ﾒｹHｦr)3ﾈR#DﾙｵbnEr杙AVJ犂ｻｻ]'Qｱ齊ｯ\9,ズ60F/ｫHｳﾏ8V@%m%2'6ﾖ档ﾚhｦｭ\mﾒｮｽ7h･0A+)Z9襦|0D傾ﾐﾟJ\ｱN韈Lgﾗﾉ凌驚$_%ﾏdyB%rf"T>U>ｱ7Gﾆ稀怨xｻg真#凶o'ｽB觸
ｴｧ潔Iｩy{d艫(ﾚfｰｴ-姓ｽ5ｴｭP[{
9u陟mｮﾚ.OoLﾟcｴ}0Y{ｦｽwi｡H;況wab總bj了｢gﾌﾂ)ﾄ演褌%;ｾB霞餤tﾄm徼q32宋G!手#ﾑﾇ8｢c8｢絮W;#7ﾎ癡XP慊Q2q驅楫Gﾝ?ｩｩGj(!cｰﾇ:$?H{ﾋ(ﾂ饑ﾊ旌ﾁｿｴ ｽｸFｹ*ｩ
得vﾟｵ･ｯﾝ?}ｫ/|P$焜tﾀFZ+丼モ蓚r:ﾑ@EQﾄ5eT證ﾃ{CEZ痩ﾄZ)$Wﾆｭ
gX:ｴﾈ痺?G"v莓H:Nt ｵAzｭSg､kﾇ_ｹ]'vﾂﾔｰE<ﾈRQ翡險E 7甃鵄	1:~*､7ﾄ	･ﾈﾔd3ｩ"藥F艸ｫｴﾊyﾈ･癲ｴ塗`ﾟ闌&ｧ耡淳|壙ﾎ9N君推ﾜ?帝飢鮹_A[殤#9ｳo､途ｵ*ｽ4	ﾜd8z<ｿY､ｷn､ｷ癇,礇髞ﾜx"&匍ﾉ]鱈uｹ9燎RCﾝｭ､ﾓSoﾟﾟﾒﾟｾ#ｿﾇoﾃｩOｦ'!ｽ3y9#yyWr~Nﾞｽ'mｳ{痘3痘%/O^ﾞ他@ﾗ ｺﾊｱdｪv_ 泌ﾏ
j/o	
ｾ8S<比%果鯏x銖raﾎy&v5[ﾄｼｵﾃ*sﾓ<ｧi-nｨﾊﾄｷ q牢<截&ﾕJk;6痺>~ﾊｯ｡ﾟ｡g>)|8kﾀｱﾅZY{>嗽訥ﾘP~#ｻ過ﾄ&q~>-X)淙vIs~脚/ｿGYﾍg*/芭Ae'泪縱父|柮狐W受ﾇ百|｡#/R~迢T?･i5/V%･|ｩ堙掠-r5?｣v+ﾔ|ｾRﾀWｩﾃｳ麌uN敖ﾗｨﾓZu&^]ﾁ_P溘ﾔｼDﾝﾈﾗｫ[u;/Uﾟ臚鵞S条M1築弛Vｿ躰ﾔseW|徙kｾlｺｯﾟﾋ;}m._ﾟﾉ
^ﾟﾕ|殪ﾓwﾋwﾛw3ﾟ嵌ﾟﾍ|w}saﾟ腋o)ﾀｷｭ"ﾛﾆｻｰcRｷｮ@Dhﾎ_}ﾁ嵶貂.ｧ&kBﾍZ7E=闘(G\辻"鶻-ﾃｻx荀ﾌﾐbt･<漿ｹ銛(ct庖^ﾞ睡tﾇr^-ﾌ侃｡辧X9ﾎIYｪﾌ^木ﾅﾉ｢歟l#･ｰﾈ~ﾎ)瓧|ｹ+B･t(EAﾗA%>ｿC惆｣ﾊ_k:Hx薯ﾄ
b｡液ﾐﾐﾄﾇ?ｾ ｵ]慾ｫsﾂ隨J$ｬUzﾕ8秧Sｦ絋)必iｩﾇﾄｩU1{HｾﾔJ^@\ﾄ&ｶｺ
;|勠ﾁJiｬｦ'}Csiy鱈Ｕ｣g峅麝Jｿﾗ隴縡M`｣ｧx､/%Va嫺Hｶｸ=(1ｪ0､Y?W据/ﾇﾜl	雪uﾒUﾝ+v腴ﾌUA@ｷ擧ﾖ挈ナﾐhz5.]Uﾄﾚbﾇ辞#}ﾍ｣ｽﾓ袢B歓滌*ｴ,U4*lﾔ擒zﾒﾀumw廸fｩLXｵﾂ|%g峨F"6J骼ﾚﾞy禺ﾏﾙﾓﾚｶ8ｾ(n)QBYdrｶXｦｫ矚'1hoｩﾒﾄﾕ悚EFd/逾ﾟA"i薀)&-抻$埃ｹ魎e扇濤61o$ﾏAnE 鐇幄nh+ﾄ]wA=qﾋ>eK
ﾝ幟]辺zLｦ梶ｧ-Gｼ%｣ｷ*p蚶酒z[Q乞/れaｹ艘G2)G｣@ｱkﾆYｨ#68ﾆC9ｿ巫､;,ﾟ"eWｳ$|2,<ﾕ~\ｩ|]7qﾎｧ
献]`ｽ逝瑶M ﾔ#ﾏ>Rﾓ[ﾇ+5-ﾊ冨屍陬ｰmoA裃AZｳ0弌gﾃラ:ﾀm:ﾙｺu?,ﾖｰJ7a屓ｻ 慓/_j､ｪ朞j5ISｽiｭ_B:
ﾈe･*ｽ!､7"ﾗ!2Nﾏ!匂fdｶﾞ<｡ｷ ﾋVd材嗟ﾐsﾉKz;ｺﾞﾗ;Rｪw･壜載zw嗇､uﾋi{=殼ﾓh×%ｨ_E}霓z?Zｬｻﾁtｿ>梅､｣_#乘_ﾇ*｣XU}"ｫ｣Obaf民Of[ﾘｭT>栽ﾕogEtｶB淬ﾞﾕf溯ｲ日A･ｪｰ眺?｢\｢ﾏVB<･ｾ@鬯?ｦﾔW鵙ﾊ0ieｴｾXｯ/Q&K2}ｹｬｾZyQ_｣ｼｦ?ｯﾑ_P念R蜚^ｦoRﾎ齶U｢ｿｬj65､ｿｪ6ﾑｩ跛ｯｫﾝ*}ｧ:XCｽV:Vﾟｫﾎﾐｩs7ﾕu5ｦTｷ閾ﾔｻｰzHO@?｢ﾗ宵ﾟｩg衝_O|T?3O}A3_ｶｹ､/ｪ疚ｮ漑uﾐｿ
ﾓｿ采MﾔMﾕﾏf轎ｿﾄWdPﾟ2V官ﾄP}蜀ﾏ眼2ｾ};h仞｣7繰ﾚFeﾈUｭ広柢汰ｧ大kT1ｪｧ5ﾙUF-:｣ｶ轍ﾇﾔｨﾝh	\lD5骨@}｣i lｴﾊﾞ吉&gﾝ<陣yﾒ;.ｮh眷yｯ剴ﾃU
%ﾌﾃﾛｴdﾒz,aﾄ"ﾈH}\囃ｯﾘyｶﾆ=*1甬ﾘ)*|ｺ派)ﾀD':･rﾂ{7g事蒿ﾟ冠KR,s,毘|鴣;ab(}>ﾟ =2ﾜi8ｴ&a9柩涕･wkﾛ崩'ｼk`-6Pﾝh1篇:]｡ﾀ才aq7zﾁ-ﾆ頻述ﾖθｩ｡ｩﾎMｭﾛ}ﾛ`@約 ﾔ5榿,鑢<レGｶ｣C7ﾓw％	仄凰ｽﾎﾛｫﾘﾎﾛ援ｧ$ｽﾑｯ･&ｽ9ｭｫ2畭$召]7ﾂxｫｽﾉﾗxｲﾃｦ(ﾎｼ酢歿:Vﾑｻv:iRAﾍ4､%Fqﾆ
)ﾞ)h\K=O+ｧ3Ul蓚†5劫WU'<ｨzﾄ\廷悸ﾊ8/"~"｢WDｴNv匡&ﾞN~M坏A[k｣ﾖ.亜ﾟ==ﾏS0U8n熹飄1ﾄ	$]jﾂ木ﾄ|2蓬-煎ﾟﾇC&P栖ｼ>ﾓｰqXDﾜOQﾆ"惆B淑BｶiC]ｳ240ｫ@ｳ*苞C73
ﾌlｸﾙｬSﾍﾚpｷY7ﾃ<ｳ,4ﾂ23ｫﾍ0曝9Pn6-fﾘf6M	{:法^)"O､ｲv嫡L洞ﾊ8~7=	ｩ嵐桷ﾘYJ從ﾝ4%"尅ﾌ:ﾑﾐk0=｡LY"肪ﾘ規=fzﾓ0ﾋﾙb"掘:eWeO
ｯ*f;ｩ%ZTh鮟@3.Yﾆﾌb蒋ﾋ鰭EK厖I｡
/P.勣括
-ﾀoｶﾋl冉.ﾔ2ﾛA#ｳ=苻ｭﾙ.3;A/ｳ3L2ｻﾂ4ｳｬ2{ﾀfOﾘ`^咬ｩy%	HﾐOrﾍ\ﾒﾉHzコ"?e淹ﾆH7#egk/ｮOrｼ(~xJｦ 9W｢ｰ.Nｱｲk癢Jﾂﾉﾄ2･｢yﾍIﾐﾉｼ
~ﾎ悉+Eﾏｴｰｦ(qI蔚ofｱе欖qL8i富ｮﾖ鰻rTfn砂｣ﾊ\6#RFbﾞ竒K}誥ﾄ擒孩AﾐｼZ奘BGs&\nﾞ｣ｱg>ｷﾊ徘EtCﾄﾑ%ﾐP･ｙRﾞ詠/｣EｨVｻ29ｿﾄ`憩zDｬ-"vUVAｻ罰宮rｹ];ﾙzｷ]pﾑﾑ`ﾙﾑ陋｡ｸｹ}姻&咼惓ｮﾛﾞｺﾑ$ｶdsT3壽ｨg>受ｻ:婁Pｲ,Eiｲ侏a道%ﾇJ8fｮ帽s骭4F7Xﾄ腰yMﾞ"ﾔﾂﾋ泳餝Yｦcﾕ
ﾂ"ﾅ,ﾚOk宗｣ｷ艇Rｪ*,*hｿ偽ﾐ(A~/まﾞAｺ$
 ﾚ既ﾌﾝ( 程ﾂ･譖2ﾟf諧hcｾqv
ﾍC0ﾔ|F賂a｢!ﾜi~+ﾍ渋笹	5?E＋筑2M9ｲ決3+ ﾊUﾎｪ(ｭ畑X｡L.^ctCﾔG\_ｦｲtﾔﾂUｼ牲Rﾄ驅
[,s
!#ﾊN,[科ﾞｻ%I4Or臓ﾁ<ﾜ<賀裃(得D

v
"贐ｨcｾﾖ詈鑞栫|,ﾂ酖ﾍ_~塔ｷ;]ﾎｦ屓-｢ﾈtgﾓ楙Bｰ%ｩﾇ"呻C礬６Mdﾖｲp-h@ｷ4ZTｵlｨnUﾂﾗ~ﾉｾr	ﾏFﾂﾓｰｺPrKA$F>dｳ戴^iﾕuSｻy
ﾏ
ｨ$ｩ易YQdbMｫxBPｦﾟﾍ ﾌｺ\逐ﾋｭ"Bﾖ凭XfE蕨n ﾓｿ,5ﾈк|au ｫ軆Hﾏδ凭怛ﾗﾅ|ﾓ
eﾕ欟ｫ.Tｱ.VCｨk5Kｭ┓(ｴｰr旌YﾍｫLｶZﾁtｫ-v蜀稻Xﾖ#葦ﾙ8ｻs56&ｼcHﾘ ]漓JYﾓﾞRｹﾓｵﾊｨgｵP鑚6ｲf龝
2cRPI決ｫ酘Xs!是ｾﾟﾓ｢ｨZzｧﾑAﾒXK荘泡#d片ｴVC｡%vdｧﾝ,ﾐ+uﾚ	jｸ蜈s1ﾎy｡xQ@ﾉ+ﾆb3iｭo%4faｫkﾜｵｪd)ﾌ#ｵ嵐'ｰﾋ3'紛tPﾙ9鬢eOK｡ﾋAﾝlS乏 uﾇJ紫齡H1.ｼ｢ﾁMﾂ吠@ﾏR7ｰ6ｫ蕋/ifｷM壑ｹｱ
;1ﾘJJd`西'^_6FP緤ﾎ"DﾂT"ｿs夊ｻｷｶﾓkｻxcﾍEpa反ｴﾚﾐ%ﾋ]&'Z~cﾀ*
ﾍpﾝ*G:ﾜtrﾄ爆[qﾂ	}ｬﾗ滸\o)ﾖｸﾗﾚﾏgｭｳﾁf0ｼf｛ｬ｣暄sｱNKﾒﾛｱ~ sｭﾉ4yﾂ:C[酳2w､3	m.mO
ｿﾊﾚAF(ｼ嵯/ｷ"蟠諂R	ﾔs|ｦｭ6Zｧ盃(刃ﾓ$Gｸo#9･ｰｸ ﾝ｢8ｫ筌貞ﾊ彁_,蚰@ｸz}蒟bmT6*ｶﾙ ﾛｮ*ﾐﾘｾZﾙC枉ｺﾘﾙﾐﾛｮﾚpｽ}	Lｴﾔ往u暮悩B&毓ﾛ霾汲%_$ﾎﾍpﾆ%h毛eﾓ0\Pﾔq･学i1?弉Oﾔ[
lf｣RwD[#ﾆ:K嶬1ﾖE^W干ｮY*ｪnBж書茸ﾅ随<"-儔"I､'(ｨﾓ緜\ﾃ0ｸfﾁlv,歸=eYﾎｮｮﾐｦﾛﾍﾀｴ[!6[#6s｡ｯﾝFﾘ]aｴﾝ
&ﾛﾝｻ'ﾜm_ｳ0ﾛ
sXh_	Oﾚ}`貸ﾊ~Pn_
幗pﾀ.Г`､孕ﾔ｡cﾄｴﾉｰﾜUｫ迄綢)qｺ;ｮﾗｨｺ吝ｻbｳW光.g/槻 ｻ2ﾆｮ*Ｍ遯醸ｾb%Qﾍ剔nｩｸf[膨染-ﾂﾎ浜Q+簣'$HﾐｮｪｰK7\ｺｶ)#ﾍｱ}2ﾒJ,dﾋ'Nｱﾆ)ﾊﾙﾕe0ete0ｸ禄蓑%otz蓖
=ｰkrRz"zCｶｻﾀﾋ4O牽曳ﾎCeﾏ｢ﾉf侠ｪｸﾚLﾆﾊa虱h
+L件
w_gvｭw0ﾒ｡+_=a{@ｮqｭQH|I~=m堕Aｦ}ﾔｲﾇ@s{ﾘ86J8番Bﾛｻ｡｣ｽｮｲﾀ$]|ﾝｱｻc#ﾗ模ﾟLfｺ燻d9Cﾀﾛr$N尺ｹ，"ﾌc巨ﾜネ懊ﾕSﾋ牾`;斯$X(ﾅｾ｢Oa8ﾝ.:孃f#虱Bｪ怏ﾂ6}YﾘｸBﾇ投r繭).o'}ﾔO｡rO5oﾛﾟBTｵj襲ﾇ>!'hb櫃ｫ&Kt`∴r6Eﾖｴｪ00ﾋ[ZCPKB<ﾏnﾓPKma5antlr/CSharpNameSpace.classmR[OAｦ累uYA[@.^zQ[ｺｦ>@H┤儘@|惴ﾓ:f;ｻ儂}1(_J｢?E摧Dﾓx袈ﾍﾅ｢'メﾐｶJ4鈎ﾆ6ｦ5ﾞx技:j.4,AOj+h!u6ﾃ ﾙｺｭﾘ疂*T溂ﾝC添Ｇu3ｸCa,U_v#ﾏ$3孱ﾀｸ!ｵｧX｡L`ｿ,ﾉ5:UhﾒN#ｼEｭΖω制	OQ傴Qｼｽ)旋r瑛!7Eｾ1Cj
w
/,<"yKｵJ!I B	ﾉ.ｧｫﾎﾓｻaﾁｿ4ﾋ>ｲNvPK4歩a｢PKma5antlr/CharBuffer.class]RﾛnAVｶ[ｶﾕVｴﾚ"l+ﾔZ家IMHﾐｦｭ1ﾎｸｺ,8ｽ|ozﾝ､ﾒDｽ-|Hｹﾃ7髮涸ｿ~Pﾆ=ｳｸ垂詐EqQk由Xﾆeｭ]ｱpﾗ,+&VMｬYｰP0qﾝDQ ｽ(ﾈﾖ_ｻﾜ陥ｭKｷ%ﾕ}∽/ﾂsﾅ饒鮖Qｶ､@ｦiﾔiHﾌmmﾏykfｼoﾊ^鑾ｾハ､竒ｱｧ｡呟+W=舘mｩﾊｺы,idlｬkm7L芭Tｰi&6Mlﾙｸmｷq撈UﾛWF ｡ｯ*:Aｨ､ﾛ刪
w92*/ｹjzｧｾ･餃U礒=ﾞLCﾐｬrｸｨﾃyo#ﾎﾕﾇｴ躯ﾌLｹｸ刈｡v１yｲ/ jvﾇUo､ﾚmｷ凋､ﾟ:WﾊZﾃﾊ'ﾝ^O-ｽ隱dqﾌﾒﾄｼ､幾ﾛ ﾀGｽZj1鷓(ﾏﾒrhﾇx[ﾎ	┻ｱ｣!z28
ｬ"5z邀@ｴ~3ｦ｣ﾛﾎqﾆ1yﾞﾉ痢ｱm槨讒ﾎu異'ﾟ`ｽﾘ8ﾁﾌ#f
(1ｨﾒ2ﾌa/I溽ｯ.千9wｰ･ﾇ9F
bﾏ,gXPKｾｰQ8PKma5antlr/CharFormatter.classm枯
１ﾏ亙Qﾔ#mZｴpﾗ&Snｷ[ﾗ｢陦"活愬9ﾌwﾎ繦ｻ12癢p	?'ﾄﾗ&	s/ﾚ-79ｻｲ@ｰ"
b%ｳ"]恂j=aC9[d階&ﾚuR廈ﾔ[qy	3ﾁ	:薬ﾈTu0e2yﾆﾟ>迚2
:｡ｽ:}忽4:ｬ}EZﾕﾖ`ｿPKﾌ]軸%PKma5antlr/CharLiteralElement.class}T[Sﾓ@BﾓﾐR.Ａ/@ｰZDBｭFTZy瀘iwJl01uﾀ_･3/斐ﾙ6Eｴy8{ﾜv勝ﾒxｧ"+*著R1甑q5Ｌｸｮf･cNﾚ讌ﾐ･HIaDｰE7走Z&%,+ｸ･6Cﾟ雁X*ﾃ從rﾇｷｽ)憐xｽﾎｽl`+ｹ5疆wｩｺ[qﾓrﾄV｣ｾ'ｼﾟｳﾉﾒ_酒ｸOjHoEﾚｮ[cﾑｩNm2}ﾁ+Yｵ6ｼｲﾘｴdﾘ>Lﾋｧ|{ﾃu碾鴒#ﾗ0;
jｸ
hxGｲXQXﾃ*(xｪ!5
xｦa+6泰\jｼPRラW
ｶ4ｼﾆ
oｱｭｨa%dﾝmWEﾎw3佩EｨP桁Aｩ
ｿ$}韻ﾊ波ﾊﾘﾜｩf汗g9Uﾂaｰ槿*叺-	
_譁ﾄｦ撕径T.*0DN3ｺｹd鮒ﾔ纂諚
學GﾓﾁeﾗｶEﾙｷ\蹐ﾆｪﾘ5ﾋ/
氣K^@DJ椅[宥聞｢ﾅAﾟﾞ8.Eｲ]鵜ﾃw9彬gｰ2cwﾋ%}4薮0ﾟ1Sﾎ9f鷽,$;ｴu恤｣ﾇ}a垠愿｣O窒火5k_ﾎtﾒz痰N]ﾏ3@神DI社#型Z絡ﾅW0c=ﾟj"ｼp型IｫﾒDｿ鼠"b傑娜ｿPaDr

ﾉﾉ8､ｿCｳ､ﾔd凹0\ﾂXﾐNGiF｣ﾇｴ彖瀰%幣ﾘ(=:=.Y4ｴﾄﾛYｱI;!|>Mk$9Ak&PKuF@ｫﾌPKma5antlr/CharQueue.classmRMOQ=ﾓv9)"j*5Q%ﾁ	I4~)}葡vJｦ-1.t耘p｡lﾘｸ1ｱﾂｷｸwg=wZﾋB2yｾ{ﾟｻ釛{ﾞﾀｮFa`"&vﾛ&ﾂpJﾌ%9ｸ,ｻ+bﾒN`績,4K%號=ﾋi易ﾋoT^ﾕｫ者-ｼV*ﾕUCCﾔ)ｸKNﾃ-ｫ:ｳwﾋNｹ1ｯ!真槲ﾋﾕ,靈ｵﾒｬ眉ﾘ.T	ﾚ{{ﾊ)ﾊﾅ彌肩巻*ｧｱﾘ靫3ｨ^ﾙrﾅ滾Y*6讙jm_=(ｻui祺ｭ駭3xnﾇvﾗ坎ｩfv}ﾛﾀY､恵ﾀ@?ﾎ nﾀ能Rﾂ>1ﾃa峺ﾓｨｸﾙ^ｹd+ｶ*ｻZﾘUﾛ
郡$; x>鴿ｰﾐ惣v寝轜ﾖwhDｭD|_ﾌ~'	ｹ輩hJﾟ;lｶR団号!ZQﾚA筺G
ﾇ1B覯f.p1､ﾘ寉Id1ﾅNﾎVy鴇>ｬ:W#B"${ｮｰ莵h"oﾍu)βV	t鉦@ゾ#ｿ,IｨZ妖ｺK逓jvo~ﾁ驕[Tﾚwﾋｪ廡Tｹ脉･騫\ﾊ昔､Dり{殼ﾘeeZﾎﾅ"盟I丼HЭ0ﾒﾈ6堀sｴ 襟紫-HdUﾌ蕀｢+T}扮専ｮQｽI2廿bｧﾄｽ!7ｳﾉ棆pｬW8ﾋ3)帯ﾂ℃l眇D懃|ﾔ%ｳｽo/PK粒AｫPKma5antlr/CharRangeElement.class}U_WUﾝﾛ$\"ｭM6@,VﾔｦVFWTTTﾔMr	ﾛlv羇)>	
>磴{Iｵ=ﾇG*~u&ｵ!!3swf7w赭｣ﾟｬ49ｬ%0禽､ｸ牝XO
ｼ)熔Iq]bEiﾝH瀘ﾜLｼ+Rl&ｰ頂mｹﾜ騨GPﾂ
>LbZIｽﾇﾇq|"ﾍO)ﾘg營Ei止W/仄U/ｻ斬ﾕ橋Yuﾃb`[aaﾕR\ﾟ岸0,ﾃｽﾉｰ耗tﾋ5揩&	gﾇﾑ娥ﾝ)Xﾙn颱)wﾀﾙｲk!･木m7+ﾂ)盗x]Xﾂﾑ]2ﾃY飆ｫ|'ｳｹa#ｦm7舅)ﾗcB~"ﾆO呷ﾅp/k+萓ﾝvｪbﾛ申2['ｺｳGﾎ笆)堋rWe8ﾇK(sｼ殺,(後ｪぽ溘舌9巳_r|#_s|バPtU8ﾔ9N`(ｸﾃﾑﾉlﾂR`s葭b$ｽﾙ>>惹則>-r|誤｡ﾕUT
Obｰcﾃtc魄qﾉVｺﾗﾉ^裔向ｧwﾔ黽ﾟ;ｻemﾏ<ﾃｴ+斂g-ｱm;2ｳfPY'_?'GﾀkvIｶﾒ[02ﾓ蛎ｬJ_=ｰｫz･mﾎﾃBﾀｸj屹ｨｺm掲ﾋ,lｾpｩ@快ﾍx$[砧ｻ酸ヅﾗﾋ8ﾑｧｺ$ﾁﾜﾚdgo9;=話&ﾀD.vｮw0譫MklXｺyｽ<ﾙﾞ､k項Boｯﾘoﾅ=虱髯y\椈ﾞjyoﾀｰ^ﾁ,ﾒｵ丼
惟乗囘DﾞO/R/y:F腋2ﾉﾋｴ!B囹ｦ;IV僚蔭願迅1u･遵=ｻEﾅ;HｨｭG3Qﾒ癲石#刮v1Cﾏ_j|ﾊﾃ
ﾉu健 ﾖIｲS丶*2ﾄk基ﾔ4ｽﾎ3ﾏb厘ﾛ､処y母bｸＭﾀ+Tｱ,UJ>`1&b2晞bJB､ﾒﾓｾ賑経+､ｺx0>1ｪｸ
kﾔk╂JｮPKxffTﾏ,PKma5antlr/CharScanner.class更	|\u囮ｼ遼ﾋﾝ､MsthS:擘M｡P G!
	
､MiBkZ疾N^刀ﾉL忱i/.ｯｪ+ﾋ.ｨxｭｺmｷ"ｬ梓｢ﾖu=ﾐuﾝﾅcWQｿｿ{f2)~ﾉ鍾}ｧgﾘDｴ〒B4Igﾊ }^ﾀE_e裟｢2裟"ｾ&ﾒ鴉!|[ﾀ裟｢Zｹ_!xVﾀ7ﾋpｭ}崟#ｫﾔｬ惓ﾕw裘{ｲ}ｮ霰褌ｹ}毯 ?ｼｰ曾Xﾘ$D?･殃ｭ｣_ﾂ/eぎ~%ｫ_k降｢衡Fｧﾟﾉ @｣Fﾒ鰕e@笈ｫFﾜﾍ$CｼКd
ﾕeｬｱｮsY(:!ｮ濳抬d_-h5:ﾗ鷭ｧR晤｡57;/騰蛯ﾜｨ
撥荐Y@	ｼﾉ-0骸Cｼ津｢ｽｼJ燦ｸ細以su^+""ﾂg斟Q旱a
w霈^
wjｼ選ﾛ1rCｶｾ]LﾜﾏTﾑ櫟fl3i6ｳ\Kﾄ､ｺ8ﾛｺﾙfjJ"ﾝﾙｷclxﾗｨ搦''ｷﾎO劼nｮIﾂﾋﾂpHW蚯挨	ﾄUﾐ;耨3火ｭq{ﾔｲ鶫ﾋTﾘ血XｿﾈGｷLｮR菓鬢BFﾊ2*u[靺rﾆVﾒ蝸Fﾖ-4畠H^ｬ+秉腱ﾑ窄JoｱHWd覺h ｡tVcｪhDXｾ`ﾇ6淀Kﾟ｢ﾋｦﾍ,7Yｫq腓
L幃尨ふｦtﾝﾛ浸る倖ｫﾐkIpB)TがF根Ml3f2ガﾓﾖL*m､ﾓｩｴｸﾀ柄ﾋ冠&損ｵ"*ﾌ3抖5T霧29ﾓKﾓﾖ盧$bufA."{ｼ*ｳ ｦ卍亘ﾏ｣ﾛｺﾌ<乗ｺ確e\*ｹU$>Rﾅｴ /ﾔfｧS%'､TrUｫCﾉ	+)u碚瀏ｵ即ｦﾍﾎﾀ#示fﾓ1Kﾈ績儉Z
"ﾐ;鎭デ韃ﾙfﾜLｷt+ｽﾂﾛd{;ﾝばｳHc5(I)dlﾑｾｼﾉWﾒｫ`ｽﾂﾘ ｮL9ｽﾎ蒋ｦｦｳdｰ顆:タMｯ1
FGｾ/ﾔxｳAoゐ|(ｽﾟGd{ｱlﾟLwj|加]ﾜmpｼﾇ|)ﾝoﾐ'餞･	ﾝ2x+\Z逝ﾓﾝ_.\ﾞ&ｫY=Nw｣ｯ#4萠｢ｸ9/ﾛFsﾝ浣ｵﾃq笑
ｫｩﾓI<(
ク;
ﾅwM嚔ｾXﾌﾊd
ﾄｴ(Uﾃ1Iｫp<Nｦｰｩ絶H*ｷI>Hﾓ1m{<｣jﾏ嚼8Ix\ｩUﾓ}oOﾞﾁ;ｺ齢ﾓxﾄ燵|5SmA誥U%jｼﾋ濂Q43Y.-ﾀv`#浄nﾞA#9-ｩﾛｮ0ｰ+彑vｪSﾖ蘊aogｲ$ｼ/胝y.R･2哺Nｸhy盧憐|-_gﾐ!:ｬﾟﾀ臓盞ｭI､6幤徠@纔ﾁHｶﾄ.争ﾝ果ﾛNHB`w8ﾖﾛ+ﾑD湲{ｼs';|セﾌﾋﾋﾝ嘯DDX42ｧTｹb~a.caD､｡耒ﾛｧｮ闊ｩYpK&g%ｷ､yb";｣ｮ螫意<飭:fmｱpnｧro*_泊N鯒Sﾇﾝnｾeﾆﾊ=ﾐGﾒﾞｮﾌ9=ｻ｣ﾘﾋcﾁ醍掣隶ﾈｳﾌ	wR6bﾞ]$"E_篁ｲeｵ_47Oｪ\ﾈ}ﾅ
^Tv![2ｶ+AYz訟xｪs'ﾛN~ﾁｦｺ"ﾇ護Iｯ嫂Bｴ1]_ﾌqｻ旛ﾓｰｫpY"eNｸ｡^qﾉｽﾊ=訪ﾓ@dﾝｾ~eｨ4ｲｯ_=款ﾄa鬢､ｹ/T/ｵｸ)RDｿE<\W5ｮﾌ-囎ｻゾP$%TNﾄDﾄｨ_,ｩ鈞ｧﾛ$~LQ%-ｧ8ﾝ員M9ｴﾔHﾓ0d8c	ｯｾ|麑ｻY儀ｨｾ鼡魃ｾﾝ鼡	ｬｾｷｹｷ+ｼ!ﾀｻｰ;Ｔ捲&詆園”ｵ>Gﾁ(ﾏQiｴd4zq*?M｡9*ﾇﾒ]ﾅUFkｫｲT}Bﾄ{-瓊克濘_ﾎｰｻｫfXﾛh5uP:i~_J醵(Dｯﾗｹzﾊ%ﾖ
ﾕ執洶ｺ9ZQI%ﾊmｦjｺH汰ﾞ%盾XﾈC款ｽ]霄｡ZNJq6ｺtﾕﾑSｴ07eｩﾞO})itUﾑVE},ﾔYjSzﾔﾛp&/k姫ﾙﾒSｴ,Kﾋ!ﾅ*|qすBV0縛Qｨ~鼡ｲｴ｢Qﾚ7｣ﾚｨﾋwﾍ8iｪ.{ﾎﾉRﾋ1･ﾒSﾔﾘ?Gｭ橇冨甓%ﾜ	O_Mﾋhｭ､=8]@{睇`ﾋ~悁彬Lｿｷﾒﾝｮ壥ｮg囈rｵ皀TｧVMG{yｿ,萢AZ★厮]房\ﾋ[=
j勍U邵~ﾟﾏ5<惡TX!ﾗ{陝ﾜ ｴｸAKﾕa嗚陝兇ｨsQﾃ.ｪxｷﾕ殉+ ^ｮ.ﾗYeみ傀ﾓ獨､｣ｴ呀^Tﾍﾏ@ｼ繩ｲｸ[*暉ｮ籀ﾋﾘ諦ｦQcｩU}ﾔｫﾐUｮ則ｾ黎,ｼぬｶsa已Hﾁ{oQ#ﾋｳｴﾆｯﾋ;､Qｻﾔ循?UﾜｬwｳnｵS_Uｮ[PeﾍG6Y:7ｯ｡奴Cﾕ?└>V諏hｻN窿ﾍﾚ,E椄uﾛ;ﾀ+ﾚ碣E'駱零ｳｴ｡脛vﾅ崎ﾅ釁棔･MﾕYｺ0K寶QkbIｺ荳ｲbｭﾁT
ｵｪg~Gｩ猿ﾓｹt乂ﾐｷ鈞￥4]A召ﾜﾕｽ ｭ^ﾐﾂｺqzC霍;ｷ4_ﾄu輯ｸｳ)Aﾔq>;j1｢O｡o?QiDi藪瞑ｭ2C^py欖ﾐﾛ}oQ淌:ズ､ﾑｰ?箚淞ｩ`_減l-ﾙﾒﾒ mpXｷd鰓｣ｴ,/K贖Uﾂﾇ^|&/ｵ陰､3線U5ZO_ﾇ|QO/貍
Xﾔyﾏﾊ海ﾆｷ眈x=ﾞ$#ｻ庁ﾍﾑﾒｼ診ｱ2'ﾙｿ欺9氛駿縅3$!ﾜﾓ&罘M6【-ﾏ磔Cｪ銖綬Nxｯﾜｶ@ｾ棣ﾀﾈラﾀ~LFQ[Kﾌｰ秬礦｣^耋$tﾝｿ'tｿﾃﾉq/ﾝFﾐ溯<疂ｺ,莇$ﾗ^棗∠ﾁG
泄@ﾐ勦ｗ(ﾚﾜｳﾂ孚ﾍﾕ6ﾔ4o*閨"ｼｪｨ足ｩkpzﾕ袗證ｨ閾|Fr=iﾜ(rﾒｧ\髣ﾃﾇW~V(qﾕ<%紗 罔vx/ｼﾒ喇5ｷR?Kﾋ>HﾝﾒRw弑j､ｮﾔ､Fq3蹙iﾈ犀%Y奏tgｵ轂msｴﾞﾏv=すｸ頓x#nｲ^^E\ｧｱﾓMTﾎ孀rmｵH6鑓/｡ w砌cﾅ5?~/ｷ琅1ﾏﾅﾂｫ$}0Hｸ/2id'覈Y探 6W/ !
錨U8ｸG:ﾄｶ({ﾗｭ=FMｩ6V耋'徠娼5靡n@ｹ宗｡Qｸjpﾟ障	+a+｡涯:Ok慫,ﾁ麁r則'i而Iﾈﾒｾ棣|ｩ;Bﾆｩ檐"(ﾂﾗﾒzｾ^	yﾒ2護sｩﾚﾂyｽﾃｶ+ﾐx毀ﾑP69OR逢hﾇｩ冩､U愨'1G|lz醗~9澳^fｺah,駟ＵAｪ9Iﾗﾗﾞ是w1ﾆﾑOﾙ<ﾉｨﾟ蛞7
ｾqｧﾙQtm]ｺｶ借啻ﾍ74ｵ1yy8ﾃw｢x-ﾞ
1ｯJ~%]ﾀｯ奘&t♭ﾅX給qT它j~ｷ!ﾕnｧ(ﾟ『ﾎｴ｣ｪQﾑ瑜ﾏｧzﾓ3贋ｳ$ｿﾙ?7PK[s禿
ﾓPKma5antlr/CharStreamException.class;oﾗ>=^.f.vnvF6嵶ｼﾌ;FQ
洳ﾄｲD愼ｼt熬｢ﾌｼtkﾍ0F錮乃F~淮ｼTｿﾒﾜ､ﾔ｢斉､Wp~iQrｪ[&#癧噌ﾔ伏俯Z像ZP貯洫2順≦＆羨21ｯ$ｧH*F悒_O\連早	鎭`B!@
ﾈS3i6-ﾁ@,*T'ｲ8PK椦ﾆ>ｿPKma5!antlr/CharStreamIOException.classmPﾋJﾃP=>ﾒﾆｴU塗ﾕ塀､7EAｨｺｨt[/Jz#ｷiｷ\ｨ狡｣ﾄIuQ43gfgﾎ釋ｺﾚ8ｨaｻ*vlﾚ面ﾁ錢ｬDｬｲ蹊i&s暮BTi福ｺa颶4!Tﾙ$tFJﾋ蛞*ﾍｭ丿8緲ifBﾍ碣^碗n､椀
Rｾ{.ﾘwQM8:OM\zD8;ﾝy%:YK"+ｹX┠aM*t3υ	?ﾑhＤvｫﾆkｭhrvﾖﾖZ@ｻﾗｽﾁ_Py^m8*=ｾﾑ?	.ZﾟPK?u#ｩPKma5antlr/CodeGenerator.class氷|T蝠?軫&3吁薪BDH&	QﾔｨｨyS'LFP|ﾄ帑&2刮w&ｴ*m脯ｭU
ｨ(｢ﾔ可X`ﾕ*nｭuwﾛｶﾝｭ}ｶｵ/ｻﾝｮﾛﾗJ釵;電2ｨ已oｾｻﾟwﾞ轎逵/o~･cDｴzﾈﾐ峰/2ｫ?雪~(ﾃVp#欸ﾈｧｪ>ρﾀｳdh朕ｳE徭d8ﾗﾅｫAﾉ	7ﾋｰFﾖｺy斷郢ｸE觀7ｷﾉﾜ.rvｸyｽ7ｸy｣Biｹ?鱶Dﾐﾍ拵rqﾈﾅ尨
ｴX2j胝(4?雖卷態L`*7='ﾇﾆ鏑蠱mﾚﾖ7n2"ｱ#綴
ｸmtT3確Zｬ
E	=匣0｡0-ｶﾏ耜ｨﾞ沍ﾄc家ﾈ鏐ｴq3ｾﾓｵ羽ﾄｪl炯}0ﾓm=;G簷Аj1-ｺ*枢6d08bΨﾘgﾍ｢ﾅｰfｬ｣Z2)ﾀ6pﾛmﾀﾍmhｽpCo[ｨｽ｣wCGWGwK8ﾔ
CleｪnXﾟra0ﾜﾛﾙr~Goﾏ法ｸmcoxcwGﾏﾆPｰ,ﾚHd7kﾑq=J刎ﾔtкﾃ=)$r0-ｲC崢∃ﾀﾖ酌@W ﾊﾍT6ｪ崎=ﾛ#ﾉ碣ｰ｡'絏ｳﾌ2mXO$ｧｭｷ･-uｻ[ｺzｖsﾃ=ﾞ9ｦ'ﾖG｢zﾏ濮d沌iT
5$瞶!个t&lﾇ8?M$Iｮcﾊｫｩﾝ0i鞣pｸｦk|ｴO7ﾂZ_;ｽc､f6iﾁT-ﾓp｣ﾅｲD場｣姐D僑wﾔ5j瘁R}Gﾒﾐ刀ﾐ`sIM&r!msm.Mjr-ｳY移SLtﾒｬｬKNS揣劵((ｦ%#zk4ﾞ?b朷ｦOﾍｭ借ﾀtﾔ齲i｡藩､Es猪sﾓ ﾓO遘OﾝHﾟ89t鞅ﾇﾌﾛ裘*ﾒ寸2:翦43嗄ﾒ呼L2ｴｨﾞｭNgｾ8}f/U3ｼ3Kﾊ夘3ｩﾏﾋｺ椦(ｶhﾑ鎗gn吋5c 'ﾇｭｺﾏ6CﾜlJAd3賺ｲ	gHｷ8-3z"aｩ4ﾒﾒ6凍1.煙iyｮ靠vﾞ!=)ﾈｮ%uk鈴建秋9I拏33ｶ$罐ﾍS"尉j謫.mT塁{ｲ[ﾇﾍ7cN篦.ﾐs桂c筧ﾒﾒﾚ碗ｧﾂKbﾜ鼻K@X{ソﾊ･'5炳tx5ﾌig｣ﾂIﾇ碧9*lﾖｼｴS-(ｰﾓ#Zﾔｮ9L｡\ﾙdﾚ%ｱ粳｣V1ﾌｾ>ｶX23ｭﾈﾅ#'ﾁ
tﾓｨ
}4>｡ｷ$贈估z#>ﾚｮG5Cｳv｢L臀C渙qﾟｳV暗豊Uﾍ､ｧeU@ｷfｪu&#,ﾗfZtｧ猩涯ﾂ%衫lJ刊nｺ9sｯ髀ﾚﾈﾓ7u)M $ルｱR､ﾒ=tｯJ4｡ﾒNｺJ･ﾏﾒ､Jｷﾉ鈿2lｧ.V餠ﾚｭrUｾ7ｻx玉ﾅﾘ豁*ｽ&^例5ﾚ祠Tｾ/Srﾅ@ﾐC*}コ*_$ﾖ靈*%ｶ-
D｣
ド,歿ﾆ屑T醉\<ｲﾎキ､ﾒ~犁ﾆｸｲ}ﾛ舘ｬ.V9"LｷJwﾒ]*ﾝ香｣ｲ7ﾊpｧｧｱﾑｷｬ･+ｩｧｻ盤X	ﾔ部B崩5ｬ｡Y璋qｳ咐%%｣&Z/遶lpB螟7ﾎｸpﾙRｹxｻﾊ;x'ﾉﾒ7$辿ｺo橇!ﾞ拳>(ｾﾚ鈔ｫﾀt彩WｧｰXｪ5|-
J賜a位ﾗ廻ｼV庇ｪ40ﾃhﾀ4aｉrｺｸ耨*/B
~ｵ*矢5zMX\^蒔t5＋'z賓Uｾ頴V鴣ｴﾈ*ﾟﾂｷﾂSw;-鑪|ｻﾊwﾐ.ﾟｩ]|ｷ具Q^恚S~ﾞｭﾒﾋ開_B<轌礁{y淕斡'ﾅﾊ*]GｻTｺｮU-ﾑｧｲﾟ喜ﾎﾙﾍ淕ｧT~姻聹M9ﾊjﾄｬｦ6ﾓｨ0?ﾂﾔ7ｿ|+NNuot<琢>-襪VﾔQT> 磋ｨDmZﾖ\}g6@ｹ陬ｴﾚｾ!y耡
jﾑ貅,ｲ&ﾔ!ﾅ
	ｭﾒ48俾^AneRｺﾗ2ｻ霜+fﾄxｨoｼﾀ'ﾊXpﾚｴZﾝｨJ-1JMｾ<4Z@ﾃ∠ﾙ芳2ｩK\ H船ﾏ俟ｯﾋ摩ｶI{+電ﾔiﾝ<ｫﾄ~"ﾜ囿@､Fﾃｪ-Zq$ﾔ藪2ﾚ#C$ﾆvgQ4#ぇ\ﾟ郎xrｼx6<ｸ^;
ﾀcﾀ4a`n″0ﾖvﾚヨﾚﾟ?ﾈｹ紹フﾐc=NOﾓ鑰ｱz撼ﾄ+=~{>ﾔGﾅﾙ>J薤%ｸ|/Zｨp貽|ｾﾘ^r=袞[ｹﾆ?XｹﾖﾌｨlU-p\?vPﾖWｬs49ﾊr覿ﾋ+ﾋﾉdO:`ｧwOeｯ｣b/γ+ｰﾋﾗｨ#/ｴX@oﾀF_ｧeﾐf9}入6"床ﾓｷｩ
ﾟ~vｰｭﾅ苓X鼇r%補蹼Qﾙsv%ｱ怪錐v-救]67(第Qm曁>.ﾟKｭuI~Rｱt\造yﾏM:ﾟ=轆`ﾌKQE｢ｳﾒｻp刊u圃ﾟ
ｪｼOg`}.厥ｧｿ@ｩBU
4ﾑﾒ*\gｫ坏
ｦT(ｪﾋｳtｨｶtﾇﾐ゜)溽Rﾏ#?/3ｱ^ﾍﾕ胼ｦｸdﾎ証{~ﾔﾚc8h2ﾓﾌ'徳冰､}=?mﾏﾏﾘｳﾜ,ﾌﾃﾉ跟tﾉ之|丑ｯ~]"-ｮ{解ｲMﾑ堤iｩ9桙1Eﾋ:b哄掏能~ﾘｻｲｿ蠣Z▼ｷﾆ戻ｪM狙v瘍%ｲｨｷh･ｨﾁJｽﾙ<ｽ+3ﾘkd靡悔Rtﾚ槞 ^;eZｵﾚ	=T<搗紋L`V8ﾓ鑒U8蒋*憊ｦ攷寮ψ9X｡苦*/ﾑｹ
ｮﾚﾕﾇiyEj>至`2ｿE5ijk3Gﾎｾ梓ﾎ碇M藾m垓ﾐ}ﾃｲCZｺOﾌ扇ｼCTW臓｢悶tJﾆ発"崢｢mlｮ但>xﾗﾊｱRﾃ\SY,&ｹ搏08ﾕv寄5扉]t'$琿駟ｾ℃策6ﾟLｭ.ﾟFﾌ|Wｾ擾Vｾ純x|_ﾀｻ9vﾞﾕC,^G 絽ｩHﾃ(h]ﾆJﾌr兵K"E｢/"ﾋ
66^ｽ擇遖5-ﾅｳ)ｽﾇzｻｸg0ﾗK8Zｦﾌﾆ|論ﾍ`梟ﾜ.%7ﾈﾉﾏﾀ*畝0ｳ2ﾗ!嶌oAc(4"ﾋHﾙ;$劵ﾃ3$liｱｬｪﾌﾀﾝﾘUP!gﾕSf9●疱|2ｪb!8槎ﾊ6?･"Uﾏi	Nﾁw-ｿｬ[z5SﾘﾎｲｭV環V,ﾅyv碾P瘴蓙?Q	KﾒZﾄ*崙娠Mﾀf+PQﾉ#ｷ笄"%;ｯ}､ﾅﾙ$魁bHS"
蓁咢l扨｢ﾒｱf!ｰ膝ﾉ+Dｼ抉d誕ｱﾟdﾓ唹e病ｮP*:獅)｢iﾑｼ椏ﾊﾓ"I穰u5ｼB｡ｽ粡)箸Mｫrt.ｨｪp｡葎'署cpｫ襲8Eｦhｳﾜ鬯2,ｧeTｨ!ｯ筴J5*ｴNiﾔ1ｺ焦%ﾚｱxﾞｫﾀ>ｼ岑^9尹不`俳dﾂｺﾉ.｣埠%kStﾑ>ﾖ藝Kﾄv.Nｻゝﾚhﾒ遮[予n_
:eoﾅﾕｺ(m0鳶wﾏKﾉ
r*蹐ﾖ +抖ｩtﾑb%Dﾋ熱Tｫ\kﾍ絃Km^ﾐｼｶJ聟ﾒVｸ蕘者･ｳtｹ|/ﾆﾎ?WﾊY6･ｿ*ｫ-ﾟJNBｯﾋ'O<褊Mﾑ{ｨﾉﾐ9:靜w麟EX]ь;_ﾚ`ｶ/&ﾄﾐt!=?>尿>	zﾄDLｯ;QUKｼﾛR4ｲ-ｭｮ8D肴^ﾔﾞﾋ3啜Gmｪ(ｭｷｨ蟆ﾍｩﾔ~[｣ﾌ望ｶﾒ<ﾘEﾃuCｼ
ﾀΧT｣S-WｶﾑiﾊmTV&HSvﾑｲ鍍*+Wﾓ彩$ﾝｫ\O*7ﾐﾊMtXｹｾｪﾜFｯ+wﾒ;ﾊ=瑩O鐚se~ｶ_ダG$s&&ﾍ(!*vｼ@1oZ{¨ﾉ繚眈mｰ~ﾗ||ｯPK､w纐#PKma5antlr/CommonAST.classmR[oA=S.[-ｴXZ[JｵｴﾖｽTｶ錯ﾁKLｴ		糺7duﾙ5ｰ5麸A錦?ﾊxfXｨRH83s;;;3ｿ遠韓用H8,.L	ｶG0%Xih
苒蒹;_@ｴｲ!ｨｴﾟx=7｢ｾﾛIAﾔ,､ｫｶﾗMkQA,~M殲;蔭ピﾘﾎC?Uｪﾓb=$ﾂｩ
ｳuﾝﾌz%ｰmｶｽ(	n/Cｿq4r殷ｺj3Dzﾏ貧7q3-uﾘ7ﾃｱhﾗﾆﾈﾘGcdｿﾎ%ｵUGｻﾐy&Rｸ
O)泊ｫｶ9
,/g凉襠\仙ｦ6
d"ﾝﾍﾎ\bi^w,gｾoｩﾛIuﾓﾖ蝎ﾎvﾆXｾW(ｬTl扶jpｬI]A%C_製影ｸｼ議ｲ|
ｩｼ駄ｶs	q･ﾑﾇuJO鏤}ｿo慟?d#2{
4PKZｩ\PKma5%antlr/CommonASTWithHiddenTokens.classQMOﾛ@}K8H＄ﾏ爨ｴｪJ#Uh/果ﾙ$Kqﾘ1ｫ概慰CﾕsTﾕ7Pﾚﾋ巛7oﾞ'覬ﾘﾊ#喬ﾀj羝ﾀ車vsﾘ萄o!/ﾓ}_b/ｮ試;ﾝdﾕ	ｯ｣桎迚｡ｭﾑﾖﾎｼr$ｹj}vo\宜(ﾙX@ﾑﾆ<掛敝柯ｵQﾆ嚶U“XWｨs!丙ﾓ*jｴ9厖!&M(1F\豁ﾆｨｳﾎ齧｢ﾅF秦&RJﾟf^*ｦﾓbf堊ﾆ｡efh>藐&ﾟ茸6｡姜rス~男LSｫDｾFJ}銅ﾘtｿ誠y#=跟oｳﾞ椋ｰ鑞歡ｵNmjeﾄ晄盲ｼGADm*>渥rEﾀ!6ｸt凪/hｫﾅ鵲ﾚPKｪ･0ﾎTPKma5#antlr/CommonHiddenStreamToken.classQJA=｣ｫ崋ｹ圈･fjﾐj｡`%пG團m.ｬkﾏUPzｨ靜f"%gfﾎ徭ｽ;殪8Cﾆｮ=ｹな(ﾈﾘ猷dP乎|hﾙ悖ﾘﾑMgl7Zﾖdb冦ｮﾘ\滬ｬn6"ﾟ｡ﾃm爻aﾎダｫﾞ0H-k@)jﾇ0lﾒ轅O初IkW掉Qo蛍sﾔDﾃ5#･ｭ逎#ｴW+紛ﾆﾞﾔ･馮櫁ﾔSﾖ6､遺ﾔZ3棒b傲ﾞｺ魯AU@LA![1ｭﾌ_ｽw9碑ｭdzJ$羨;Iﾒ*ラJﾛt*ﾑﾊh
ﾔ訌ﾏｴ｡ﾑ	ﾃdT2ﾅ\ｹｺ晋爰州jｹ9|^Cが&]Cla(/nし9^}d演cg｡/,y♪ｴ]2G蝋+
x･Ej=花.^!yｻｨP､Oｯﾗｼ#ﾒkﾄdﾜPK'校	}5PKma5antlr/CommonToken.classuRﾝNa惘ｿﾛe｡ｰｴDQｪ`ｻｪR%1iBｼ朔｢ﾀBｪ.)[｣艱&PM|ﾊ8gwi･ﾔ并ﾍ9{f:s璞ｿ,篁子ﾌｧ`｢$eAgYTN篝5<陣Iｾ,kx(ﾍ#
+Veｱ'2z堝ZX｣ﾘ
ｪJ鞁=sCSｭﾜｨ9GｯUw蛇｢nC!Qｩ;uoノ｡噪-ﾜ6%^ｵ學vkｷｶﾗ$Wｨ^Fｶ0x<ｲｽmﾟ吻Aｿｻﾉ潟$O.ｱBﾕW8ｹ`hｬ)､(ｳ6ﾚM､ｷﾝﾚｷ_ﾖﾅ阮ﾛlｺﾎｮﾑv蟋L篌ｮXGﾖﾀ,ｦ
d親ｰ~+/ﾚvK!.o`ﾏﾌ ﾏREMﾛ(ﾉ荷%qﾝﾀ(ｩ訶uｬ諄昂
Cﾁ,bﾞ幼Lﾔ誌m蹇｡4闊WF3柬ﾟWｺ5D塘D1	ｿ~ｯCﾉ=XｧﾘYqj戮Y托nｰ傘%s)勾ｼ!ｯB桍ﾍtyﾖﾔ｢VｩスO!8xｨ寸b望ﾎW楓ｩ癪)ﾍ_ｲaD&)"誂疱( $Bﾜ:Ek蘭ﾁｫ双}ｫ3ｬwp7\ﾍｶ+ﾞs｣ﾓY帙dｶ｣ｷﾙ}ｰ_萓ﾅﾉ\ﾗﾊ幤?匝{痔ｩu栖:ﾐ呂０ﾀ0<犇濂ﾆS,ｰﾞx孚m帽ｧｬ0ﾀ*'EｬｿPK7竈aﾁPKma5!antlr/CppBlockFinishingInfo.classm設Nﾂ@ﾏWｩE?｡｢WXx演IH^`ｼ牋隔K未ﾏ薤c竇澆g｢1ｺﾉ樂撩f2殪ﾚｨﾐPJ#ｲ%%U
ｦｾﾗﾁﾚ宅*`ﾈ恋鈍l1驫9Cvﾎ要ﾀｧ｣g7plﾌ旋ﾎ^潅径_pｼ猛=ﾏﾞｬ9Cｪ
7ｸ`姐N=Jﾙﾐf8碪ﾎ栞畠ｴ症ｪF鴪ｾｫ|foｵｺ|遑OﾜＭ1ﾛｪﾖﾀｲv6cﾗ@F堰]-Ovｭeﾈtｾ,ｹIﾑh{	ｺﾄ:ъ｢ｱ甑(ﾆﾀT[ﾒｺﾑ(Zｯ`ｳ!齋"D竇ｴ#ﾒ2彫｢W盈R}
ﾔ#R~KIｹﾌtｦHuEjЗZ･ﾟ<逃ﾄ;$ﾞQ堝;&	9
ﾑ版/PKf+濛PKma5antlr/CppCharFormatter.class控KOQ=fFAq@+>(m･~EｨZ@潔MZfWｮLﾜｻu#q皋&ｦMﾜv鰍]ﾘ;3孕ｿ=n__ｾﾄ

=悪Hｨ8｡bPERﾅ衰N盒g慝!.癧.ｨｸｨ竰d+耐ｸﾋ,､T謙ｸ｢bLﾅｸt､\U0｡`Re$如(:pS 憊ｸｴﾏ訃'Wzｸx7=奕hﾅ.:騏ﾛ闃fnﾌﾞｷﾛﾉわｮ%}/ｮ
5Vm-p!u濶@s$輝ｱｹ?KFｸｵOﾇQ｣/ｹ3m1逍;+ﾌ~OﾀﾝNCﾌｸｾｳ&}ｪｿQoｧﾕｸ-ﾇ]ﾗｫｳﾏpi去{Oﾀ寒袮ﾚﾀ]}oｴ｡ｶﾘ.莫ｹU9j2ｻV9ﾆ｢ﾃ<iDxp{ ﾐﾋ?J3行*ﾂｷ^>ﾆ>A|煖ﾀabKﾕｩ9Uh!L=/[ｭｴM｣
ﾓﾚhcｴ>ﾚ4ｭ6E[｢]5嵬fｨlﾋfsﾙl)妍ﾙ2"ｯﾐjOﾟ竡ﾕ∀ｷｸlﾆgｨｹｴ*ｯq+ｴ[涓ﾋｪ@ｧｯｭみｹw?ｷﾙNW.ﾗ}ﾗ味2Jﾁz蟄Rh'`
e;ﾆﾙ	Vy浩gy蕊6偲F娃8#＠H#N3
柔ﾐﾂｻ喜ﾋｹｯ0)ｾ'Jﾆ哄kﾒI0厩ｼｷた｡
:ke氤ﾄｻﾍ?9uUG3^4ｼ}ﾒｼﾑﾆqY*`kZｨｬﾚU-ﾔﾘ*4kｽD慙|ｳMﾜﾜ'3ｰﾂ5usﾀKﾜｬ鱒C78yﾊ.Ktｫﾈｳ芭堤･.ﾜ]ｭｩ2`wﾐ鉗.qﾏ&ﾄ~PK宍Y0ｦPKma5antlr/CppCodeGenerator.classﾔｽ`Tﾅ8淇3ﾝdｾｾ;ﾞ)gﾎ9uf蜑ﾟｾ16:ﾐ3ﾋﾞ&GD#%M妊(嘘ﾒLﾉ癆ｴhﾋbｷj恍VJVhｱ2丘wｳWQrD8鋳ﾕxT帽#q]章be8J而ｲｲ0YKw'f遠ﾄﾉﾊ)YｬH廱ｧQr:=ﾎJﾎ､gﾄﾙﾂ鐔-ﾎ｣	ﾆZ\税Jﾅrﾒu%々ﾀ7ｸ2/･6容架ﾅｩoc椋B\ｩﾅUｶｾ坩ﾗPr-6jx壱鴿7R魚ｴｸ9ﾀ*ﾅ-Yｱﾄｭ nq;Uｹム:ﾘbsｶh[@ﾜ%wｸﾄｽ q?袷』ﾄVＹﾄﾃ4ｨGhPﾛｲﾅ｣1Jﾗ竕;T<刔ﾉS 棣ｾ泯g)y.[ｦJ>･V櫺遏Z}ｩﾅWYｱ<
ﾝﾀﾇ	j/Jｾ･ﾄ ~#U	ﾄﾏ ~+衣@b;H茶ｴ@ﾚ ｶ葡･ﾎ+$ 2#漂T信ﾝuﾙd9Yﾖ%X
ｳzﾒ].ﾈｼ^{⇔ﾙ嶢9辨P｣ｾｲ?ﾈ9P9舒A燭ｲ
 寸 ⌒	舊夐'ｵA舷<9ｩ)	 玖｡蓮猶R
rﾈﾑYr芯Aﾀﾛq w9莪 'ﾐxv｣啄NE))｣dR万,ｧﾘﾇlﾟ痔價ﾀｹ'ﾈr須〓9
d%ﾈ gﾘﾇﾕﾞ ｫｨﾞ>肥rfｷﾊYﾈｲZﾋﾙY+9艤 軫V.,廨ﾘﾎｹZｯ蕋ﾊDDy ﾝЕlｹ8ﾀｫ蘂 ｦｬy(5
覓@ﾖぎ&ﾒﾗソ
rﾈ睡Q晏 ｳｬHN|h｢ｻ\ｺ朽掲ﾉf/LQＵ?dK5ﾖ敍Hﾔ1ｧｽZ鮗"M隴ｹ
┻sd凡驫ﾓp8亠膕 ﾗ<1Z8隻<）ｬ･萋ｦ裙D'@>IYOs=
竓g)9積ﾓE瓲/−+ _ﾈﾗAｾM塵−巵ｾ兎_!ﾟ･AｿG材ｧｻ諛ｨ?薑 ?	ﾈOｩg ?ﾈ/A~5N･ｪ-5ﾈ菫@~ﾟ ｿ=ﾈ@'?莟 #2Nﾉvｭ(槐7+熱WJ３ぴ$ﾞﾛｴ*ﾊ附(*T7ﾄMuｧ比 rｪ'ﾝ!W_｡ﾐｨ^Aﾕ'K桧PｼSｫ~簸5ﾔ@Pァ
5ﾔPPﾃ@ｪ癶F	ｪTｨbP%JA5ﾔPcA撃ｩﾆQﾏｻP2ﾔｮ&ﾚ
ﾔ&*5	ﾔdd5ﾔTP{ﾚSｫ,7ｵﾝ彿UjｨJPﾓrｲ哂ﾐｦﾂｵ柏ｸｨ*Pd米ｫ+<ﾊﾙ曜ﾍ､d艮夭fj?PsAﾍC>RｩB`PI膀%ｦ"fW:ﾔ"P帰鸛ｪzｨ*#ﾝ｢B摩ｪU*梧SﾕSRPﾋ@5ﾐap衡ﾛ*B尽ｵ還s3ｨﾃ鰛BITT+ｨ(j%:j(ﾔﾕﾈZｭ者j
ｨ｣ﾖu%ﾇR｣紂PkA揶~:	ﾔﾉNu*ｨﾓ@/ﾎu&ｨｳ@扨ｳvQ秉P轣:ﾔ.ｵﾔEﾖﾚ鹵Pゾ
2P翼ﾚHOWｺ2K]･ｮu
=_ｪ
ﾔuｮuｨ怠ﾕMnuｨ[AﾝF鞏P臂ｨM6ニｵﾔ擒u7ｨ{@ﾝ>Pｨ@m ｨ@=Pﾛ@=
1P純zﾔ蕩4ｨg@=9Pﾏホﾔ侠^2z#J^ｨﾗｵzｺ~湯ｷｴz岼P5｢､ｨwAｽｪBｽOLｨA}鹹P麾ﾔgY黌ﾉﾗ濫|EﾉﾟA｡@ｪｾｦ湯o@ﾔｷ
;PﾟS芍鶉P?ﾔ/~ｨﾟIｵｮ･腑PﾛAｳ,取-ﾐ6hZﾊｴﾖtt鑞ﾐ鈩ｻ:tOﾐｹ@ｺ7>h5yｺt?ﾐA= ﾐアA=0ﾐ;G.]ｺt	鏗ﾐ｣@=Xﾐ;繆8､ｧﾞﾝ@DｺH<ｪ郊頌ﾈKzWﾔﾎz*ｽ%ｻS2tﾒ@O=ﾐSAzOｪ_z/ﾐｧｮ=ﾐ{Πｽ閘$v)陌T鑠ﾐｳAﾏ｡授C]轤z>ｧﾁｽ:□／ ﾐ>4Iｫ>tﾐｵｳﾆйｩｽ2ﾐ
ｽt#&ﾐﾐQﾐﾍﾔ&紂ｺttt+W^E}$靱ｽﾑ},鞳@｢ﾇZﾐ'｢rﾕ'｡諌'>ｩO}:霑>ｾY檸猥}
ｪ>yﾏ}閃1ｸﾀ腟ｲm8u/ｽﾐΘ@A_
2Ｑ9%)ｹ{%隲@_
ﾐﾗＯ}齏	ｨI[h^ﾐ嶢7∪伽}+ｽ)Vﾐw+]7ﾐﾍﾛAo}ｧﾖwﾐ鵑徨ｷﾖdﾙg閔)ｹ薯)%PｲU鴾蹟ミDm^ｾCﾉg｣tWO!P3霽P躍續<｡電ｹｾ+ｰ1}坎3檻ﾃｮ淅闍ﾈぱﾏ~_"阯@ｿﾐｯ~
ﾟ&霍@ｿ
ﾐ~ﾑｪｩｻ宗ﾐ殍曼殱ﾖwZ蘓fﾔTﾌ儡S1{Zeﾍ弧ﾊｹ褫gﾏ蛹/,7vD$ｪ7ﾔﾎi	ﾗﾍｯ7bAgji8R>o>gｭﾏｯ郭訌ﾞﾞ｡ﾘｲ
叢元蘇E4狭ｴﾖﾆ｣-m7ｷﾆｩ80ｽ｡rgZﾓ,3/ﾞﾒY:	ﾛｷﾆｦ｢56勸rCKﾂ冴ｺﾊﾆpS8D36ﾍOﾏﾄ馨藐E笶ｸ=j｣MMﾑH蟐xKｨｼe)籘ﾓ3'ﾔj%kﾍ誇ﾑ唖1ｾ｡ﾆVｯGxUmｸ9ﾞ採_ﾖ]皰[從ｪ｣7孟 ｳk[[Zｰﾋｹｭﾔsf(olCO{5Fk励sｼ溢ﾜpｬｵ0狭ﾃﾘ凵1+ﾔsiﾕohCﾔ惨	6Uｮm,aDDﾑ	ﾅ糲Xﾝﾚｴ$ﾜﾂYzvれｪTﾒCｱｼ#ﾃq8ｶ,ﾚXH)Cﾔﾌｰlﾆﾘ14ﾇ&7ﾘCｻ6ﾚﾘｮ･眸ﾆ4457勺?Lｳ警vHS@}GBM畊sｨ68rYｨ･*6ｭa)	AｨW｡鐓混ｷﾄﾁﾒQ$ｴ[ﾈﾙﾈ-e弾ｻEe邸ﾌｯﾉ｢ﾆxｸ%7ｬﾄJ%JMVe､ﾎﾟt`｢ｰG3ｳ寐3えｹVﾘ_ﾚ'Q:3ｼ*ﾜ祺ﾌ%UeB｢c>墅私gｷﾌ憾ｰKE,Fｲ懐ﾜpｽｿ鄰2憂0脆抉与ｽwｲHfXｰ0ﾔｸ<$ﾐ
講ｵ｡娘=.
ｷD;鎮ﾒY｣3ﾌ螟M/1蘓
X8飼ﾞｵTLUf	ﾋIqﾅｳavｧﾋtﾔｱe恪K2Lsｳｯ;ｪ間G'e>7,JRｰ勣XBMFﾓhﾊ関磋K仏ﾌﾈ ｷ.`ｭ
ﾔﾓH劭]ﾇ=/NAｭ0vﾊtﾌﾙ]J伎屡嘩km0詁zｴpｨ\
83C拱棚[tCRFﾗ'楡格HI･V箏ﾋｰ'ｯﾕt｢dP､ｮ&4)iIﾑ慵ｮ5`慕ｷB1ﾁY簇:u=亙ﾆjﾜｳ\3O{ﾔ"3F'髀ﾍﾇ顴rp@ｨ[
｡F#.Wﾌ"z&ﾂ纎rt嵐1uEﾙｮ嶷ｯs>uﾝ&皙ｱ壅qｫｯ5ﾙｼ#囑D'-鵤ｻyｭt擠ｭｱr3ﾜ涯鏥ｹs@灯4ﾅ冦潰WﾋxEｦﾕｷUW/ﾇeｮ頴貲\ﾐI監|ﾂdﾎ
EBKﾃｮljn茄｢@ｸMq註毫./g#2y呷#j猪
TpﾂｼG+#ｨ甥甍｢〓.-ﾃ#ﾆKﾈﾂﾅ	S勣Ｔ	La&ﾝ聖jｯ=ﾎｷ4q6ｾｰ齒t]Wdtﾍ､>U3w室ﾒsﾏ/ﾌ\1ｧ1｜Uｬｲｩ9~э+ﾒﾇ
ｰGｲrlｷ&ﾖ$uRSｨ勳o齡,呈%ﾍo	EbF!gDｭ+碪ｧｸﾒm蚕I:U+xﾈﾐｳ3	Uｧp?A"ｷｾaUﾒq渤
ro4ﾅｭﾍ*後ｧｨirm｣逍gﾍ狂ｶﾔﾝ(09險侵ﾈ爛ｩ+ﾇﾖｷc?j?齎象O8鍍%OS%/ﾘ述沫!0rJ>ｴ檗ｬ&賞A､NS(刺9･cf隸ﾟｵ｣ｩｿﾑ_V｢上
ﾖｵh0Lﾖ&6ﾚﾑﾟﾙｿ:{ｪﾑｱ%$ｶtOgｭqｯXﾁ綱ｵ-┘ﾇA鳫ﾀQ'ﾂ傘,
ｶｱ	
=t滓qe撹t､^ｭ､eﾕ0､j8靤%ﾎｬ澑ｲﾈs0pﾇ'ｺ蔕ｯｺ9sｺ;ﾐr惜;ﾆ#	ｹ腆.z耳ｦC
uA
ﾐi	ｷ].bﾅ^Ьﾎub乘ｽ9c∪ﾈ4n
v;撞!	@畊mｨ9l誓Q~GIﾖhNBq_隋-ｿ粗ﾆuﾘ
ヱXcWiﾉ~I｣ｭ`ｴ>ﾘBz琢ﾃ@tGｬBgwz=G｣ｶ､ﾝ#1ｳﾋｰiv0譜飮iC絶
ｵ5｢ﾇ'ｷFb
K#aｷﾚﾔB,ｶFa2<зe(ﾓｰﾃ5rﾑﾀ
ﾝﾒl(%Pｽﾈｲ`EIIｰ	-X
ﾇｑh<kmn叱ﾄΕﾂKZ:P%板(Fﾃ
cﾘY9b)&0柴'籏]噸7隈Dﾄ,Qﾀｮ｢:!
ﾑ1Uｳ到`7vｷﾓ0ﾑ2倅ZqWOFV(ﾒ0EﾃTIｼ\&f或ﾘ尭>ﾘP,ﾄ永n済C｢GM]ﾚJｺ?ｲtﾊ罰ﾁ｢瀚*H3*4ﾇ~ﾛ~ﾇ（8mﾁ)Aﾇ~穎sSk1｣[｢ﾑxﾑ$\鰄ｿ｣C%u憬｡
ｶFбﾒ`4d劃ｿB11@ﾔﾂ
-ｱxﾅ2ｯ
汲Cｨﾄﾙﾌ}jｩﾜﾌﾔ{眸jﾌｼ-rCu+B腿ｰi9?椛ｳiﾎﾗ ､u!ﾞｮvﾄﾑﾍﾃ1ｱﾟ%NG3*G矧Qab'臍ﾏｹ#X^x\温ﾅｵ｡RKｸｾｳ台,uｹｱ改uｴ5F
ｭ VEﾂｫ8椒ﾃ則e茜｡ﾑ^｢ｻZ皇/ﾊﾜ#{ﾌ$"ﾋｱ!ﾅﾓ38ｦﾘt局i}4>.LR莠綜ﾋf9PMﾓeﾀlｺ冫PI]Kｩｦ､if6ﾉKｱﾊｸC宍ﾊIﾒ抽Z(ｾｬ!f	ｪﾕﾆﾆ`xUsｸ･ﾐ5BIﾑ.\属|PﾌW"畭kpUﾄ8-紺.u-.)ｱFRﾇ\.F萱借MD屡%zｷﾕﾁ1c盛G,*ﾑ0桔j#'ｺ:0愁M4D礬{ﾊX中Tﾒ茲ﾗcO&嘩;ｰ'ｹ^Hwﾀ9ｰ豫H4ｲ埃#ｅﾘ[Q	ｩ覈AZﾖ｡
YDJ8bｾX6遷ﾕ7U&脊Sｧ犬ｸ陲默(Zm!臥ｬIﾁ5A挑瀚Dｹ､Qｶﾊﾈ;\･-ﾃ*ｪ洌iﾙlj{{ｹk$s"D0Ｇｷch隋
@Q凾恆4Rbﾂｺp=Z:E7zA攷)%NｫｩﾁP'-ﾘﾞｻ茅QｺX!ｭ3%XXΜkJﾕEｙ3汲{ﾐﾔ浦矛､Hz.Q_(ﾖ蓬0ｲ!ﾂｧ呪
b鞍
rｬ1];&)DZｱ5]DｴY( >.ｼﾇIﾘ	濤@2jjｨｷ]-來q･ｨNｾ"諞ｹ0ﾙｾl邂  知娯(MﾌiY01ｼa#ョCFifP#`fﾖｮｻOｩqﾛｻｷGD7!ｩ
1V)]ﾞ~D`Mﾜｨu
ｵ5,i､JE4ﾔｻxbA%n聖OｬGt鶇ﾔ]Iｵ_､｡義M
ｲｻ2寝m.e@jn瀧Nｰﾂ	ﾆｪH毓?6ｬ2NTﾐ亞髀
(a#$y轍篤
Bp6iG
1
蘇,2ﾟ､`ｨc[Nｷ*｢3'ﾔﾐｈｧI8ｧｽa搓lG｣7)iﾛ;ｬY｢q18坐Qﾍﾆﾒｬ佯ﾌ:C螟ob牌｢ﾒｯﾁr｡I1Qhv瀾@W殖忽ｦ\p4MﾃｻVｴﾝ3j･漸ﾒHoG懦ﾚCﾟ$mc褌馗殻*.歇<ｼ頁 WqwTﾜﾅZHﾇ:ｫﾙ竚j4:"@<ｺﾆﾎ89椚ｰﾕa
ﾎ槇ザH扈4楮eg\ﾋG?ｺCﾀJrXｵｧpｬﾞ] 51ﾓﾝﾕCGv	I'*朴'ｾｻ鰯ｬ#8Vwmﾝ%"6eﾜ`ﾒoDぃj\CﾔU5u｡x此^|0箏&被ﾚﾀ;pｱﾊｱpｪH|:ﾞ4sAb3ｷ'riz]?乘k┰`ﾚKｫ翅	dGﾗRr"i[藥4N"~2%ｧﾘｴ瞻ﾕr%4ﾓVE2bｸ|懼詰
ｧ9+茆NJ0申
ｽﾓｺｧra%ｪ渋ﾀ_鏈鍵mF:ﾎtﾄWz4ｷkﾜ保*鹸ｳyyﾁ｡ﾈ團57縉p2srjﾛﾇ国ｩj爐5甕SRxuKvPﾗﾌxｵﾇﾜpmti､ﾁl|uhV	衫w]ｵ3:c;VNlF綵ﾒ>6ﾘ､mｦQ@ｸﾔ	薇｣cｶｦMwg;p廳ｱﾒvﾎ#ﾞ;歟滷悸aｨJﾆr6･｣6ｵXｬ･ｵOD$H拆ﾗ筈#頚ﾋKVY冂Iﾆﾏi掘ｫHa1y羇0&X	ｯ,'ﾅ阯:ｰ惹GﾃEﾈr驟･ｴ6{ｴﾐ+ｬiIﾜ眺憩ﾞrｴW=Q込f5,燕ｱ0=h,ｱﾎorr|X穡u5,*･
ﾟ%xﾑ	2ﾐｬｦﾌ[Fｪ聴ﾖ 驫pﾕ4w･ｴZ車5ｿ!WD鼈ee鳧8ｰ9ｰ.F$2Tｺﾞ*岳"ﾄ[ﾀ%F|I:p)Ew視Nﾅﾌ抹･鉤L.#ｽ迫ｦｰｭ｡*GnｱﾖE+ｷﾑ/ﾎj$'ｸ6:b/Q瘉*
ﾋｯｰ?wﾄ`◎_Ie9ﾂnSnﾝ輹ｮhXﾛｭ3腱h]IﾗﾒへL2#2jmoｨ}3ﾃ+ﾕｱｨ+wﾒｫﾟｿc}ﾗ{･V!ﾂ泉鶩★;B崑87ﾀ唆bD:斜撰Pｰwｰ畷ni%6#憲瀁
0MｸDｺｲ&Nﾚﾄｮ殴
ｼ9p+ﾜ貘pg%Nﾑﾗ5ﾔ"	iｹ0ﾜRﾟﾘm証C｢PﾊEp牘1Z繋`-ﾚﾕ煎摘ｮd2,1^ｱ逧#ｿbｨk吏3ﾛｬl&9lﾘB?*瘍сﾑｦ8ｺuﾉxﾚ偕4Eﾆﾅ#wｵyNXﾐ｡ﾖﾆx晄Zｮ5ゎｺｹZBｧ(Jﾊ-)ｸ$\jER｣Kｼ2dVｲ簍S､肖я緻ﾓｨ!Sｰﾌﾜ｡.;XB04｣8ﾏ`6=ｸｻﾉ∈T｢E
|ンバ粃!ﾜiｸﾟ∩5鰡癢@ｮ
rtP`+&ﾂｶｷ#餞k@ﾊﾄV_7夜"庫Sﾜｩｼzﾌｹ医ハ>j*ﾉ衵揩ﾅcﾈ江Fgﾐtx"ﾈwﾁｪ鼕Zﾃﾜﾊv耀ｼ4ﾗｴ､.ﾐ磐7,ﾔEｰ#h葩ｯｺ:U鳧ﾂ9ｹed0ｽﾃ阯!k羂慵6bｱ2ｳ暦ｺd｡ﾄ轍ｨﾄ.〃(ﾘBｾ┣ｼ*Cﾓ廛rﾑ夏ﾝｰめyｼ･/ｳ[0ｨ貢0Hｪ水^Jﾇ1y'wtE紹ﾈzｺｨX0oY5蚶ｪ径.6ｷ.iDｭｽ&ﾘF[nそﾈ｡甓ιQt#麾s祖喙V璧qｼｽﾕﾉ嶮.Xｬ0|I4ﾚq~惷ｼ0t､R評O[xk｣^Cﾟﾐ1j且┳Iﾐ[x^､s#ｾDﾕ/ﾃ+冓ﾒﾗｼ
ｯ9:obﾝﾒ+Lt諂|L+nﾄI'､ｸｬｬｪz儷ﾓJ､ﾐ$ｼｰ癧Rｽ'Lｫﾆ5t環呀ﾐ俐DﾀP*ｵ^ﾕ`佰ﾝ3Zﾅ!ﾘﾔ#2儘L8オﾓ$:Wﾞ┷`ﾄｼﾜｰ渾ﾆﾞ髴毓ﾜ5ｱｹ0敕ﾆ 0ﾗｼtrmｺRﾖoﾑ:pA	&6ﾌaﾞ$ｭｹ3ﾋw.2謇ﾖ｣ｱｲt
ｴ6G#Xhpdr(f@ﾋﾃ浦ﾙaﾖｩG巉tE痍]7釣VTpﾈfG_ｾ4ﾔ匐苺ﾔ噐qdM!Pﾅ類,ｭIGｻ擁疣D0lｳ※*ｹ-Xｽﾙ防2PCckirﾋ[ﾂtｺﾂO-4BﾐI 娯ﾆ波nﾒP74I｣ﾒxD轅ﾄﾓ\ﾎﾛｷj辞9壇b?ｳﾏaWﾟ｢塗ePz･聾)･Azy峺	木{ｲｴ4職Ym^櫞鎖{ﾇﾑfｷЦ6D
kiｳ､瀞ｿ紀qg･&dｰ:｢ｺﾓQ踈92r}J唾ﾒ'rG
?ﾞｦ
ﾙ拉Q%6aﾁ:ｯ[}PﾆｵﾚﾁﾚXルｷ$3/3Rﾕﾑ
Q綢dX$&X.ｨ鎗ﾖｴｱyx4ﾎﾇ,袴BKqhﾆ紵雀ｼﾁ;ﾜ$ﾎi郊ﾍLｴｼﾀ{､Pﾟ5翰>､#ｸﾐ￥)鑓>｡+Jlﾟ-｡Z$t.U胎ｭBRn･+*Zu0T関ﾈlｸuQﾙ]ﾃyｰ_7QV15&ﾎ鬆"鑞wｬ?ﾔ圸ﾄr\Wﾒ>7^Q:鱒L｣ﾙ迅砌ｅ頓)ｦﾇｼﾄ6fﾚｦ蟶L&fｩﾙﾅｉ&
N#ｯ238Ыｲﾖ84暴Eｬ|ﾀ･贈ﾚ闃0琵vﾍ#Y"ﾚ=瘉ｸﾇ8､敏ﾄd］;ｳ:ｪd:OQc4ﾉ)ｨ"ｭ麹ｾ|｢ﾝ))Oﾀ ｴCnｻ4"ﾔdWﾋﾓ
鞏ﾁ敢ﾀﾈrﾎ謖E"}ｸoJ､Nｩﾄ[鎬>i,…ｿJw囈∝-K[ﾉﾗ1Gpﾒw驗FﾈwLﾑ糜ﾒi｡aｴOﾍ｡Lﾄmd0TKrhﾎOi
筐"6!:x醉>ﾆ)7ﾋ>(_4イp|y|Qｲ:ﾄrｴ&T2卻5跟ﾍrW7idSｆL$ｿｮ3筐7Hz"ﾝ;6X詑!ebksﾆ]ｿsjFU[h霹c@^g7#.ﾍｮﾂ$-FG困μD去倆ｪﾛV愕p旛整ｪMG籃ﾉ3ﾒﾒｱ瓷ｫ?qﾉﾌ';Z藉?ﾉ果MD*ｩE=ﾌ;薄KUｩfMMmsck鯨ﾚｮﾙ.K_迅ﾄnwF櫁蘯箇y萠ｺｻD楔^ゐ駟Vq%戌ﾐ
mﾍｹ封53gﾏﾞｷ|ﾊimEnm淞視y@USﾞﾒ｢e錫猩泉xliI蜴+ｱbT$Nnｰｾ%ﾚDﾚ_
･zxﾓc(掉s洋ﾝ<ｷｮ烹ｽ
3fﾛEEEﾐｶｾ*"}U闊ｾv桟satS俥%･<(:瀚ﾂﾎ/7ﾒﾉｳ2宇F凖ﾔbﾓﾐ?ﾁﾉｴ'=P~4ﾟ>QC渟◆H錮9ｴ	ｿR侯巍"G3菎庶ｩ､a藪K繭*B	ﾃn`f癌й≧刑rﾞbｿﾓis;8'猗vﾐ5畳Zｱw[mlm敢ﾃx+ｰ宛#u^v"瓏ﾔﾞU兩{ﾓKﾇкtx3;b､ﾔ.;2ﾂ]遒.+ｪ扱2	縞}Ur
j?(ﾐ3膝)由Kﾐ甑砦ｰ軅$xﾏｼVAｿﾛ}ﾝ慮F2瀾Q倩褻ﾊ$罵ZJ摧+ﾌﾈI=Gu笏S迩i粂ｨ#	ﾗ~姥)g.O怫ﾊﾈKﾅ0｢Cｮ=Mﾌfﾙ1M1%_湧ﾋwｿYﾐ,bｩd5#収^｡ﾏｹ4ﾄ譴猩4粮%N-屮ｭﾈﾆJ,勁L`ｱ檸廿]ｼ巒ﾋ8Mﾓ_T;"n$掛4rﾝI;* ｺy$ｹ5ﾓ(G
ｱ萢ﾊYｮﾏ筱<ﾑha>rR辷｜M｣"1Fｯ7-ﾍ冑'｣到｣#新%･-ｾ,茎伏､nu2e意奧ｾ浤ﾈ}ﾑｵｼ5搗xﾍﾛ侍Bﾉ猟{ｧdﾑNﾐ8n%鉱ﾄｻ[j!佞BWｦﾏcUｯ垳ワg,｢ﾕ慴ｪo咾ﾈﾈt8Fｰ9-？PfE｣)ｬﾐ-荀ｷ領2Aｪ7Db箆ｱFb9jﾊ･a;ｼK2+ﾊｨ3廨嫖贔5Bu.ﾗﾓﾉ#ﾃ[ｶ赧uhｨ+7砦[竰)ｱｪ枇ﾒﾋ椿ﾆ:繆ﾌ3#ﾜy^ｦｻﾃ功 Hﾞ青｢ｮTvc>9鬲ﾊﾍgbｪ:ﾚ､dX睛Dﾝﾉ鞅ｹA#	X'bX*?纓Evﾍ薦尭0Q&ﾂｯB､ｰ拾ｸJ9qIWkﾈﾇ竸'>i堀Rw[ﾚ]9?奩ﾂD7ﾇ"課S^ﾂ靠ｮﾟ;ﾔXｿ0ﾚR轜n ｷ｣ﾊ
=]m;ｾ=#(+袱W3鬢捜ﾄﾋ(j,ｨｪwｿk>ﾏ3逕hk;局j[壹､ｼ})髑M,Dｪ謡疾"ﾙ鏡ﾎn1Nv-槍囮7?qHﾑｼﾋｯｳ.ｺGﾑﾑ夬Wfﾉﾋ∵篝ｯuﾄ迎ﾋTﾗ|･ﾙ祀b互ﾒ>ｱDV斜ｶ葆9倡{ﾎﾆKﾜ,ﾎｮw'｢浬eﾙ
Rｹ\豆ﾉMN娉処ｹef３ﾓ､竭ﾘ叛$@ｸ匁mﾚ>ｼ5Dﾎpﾆ&{拐m1唏Yﾑ嵯ｶPkIｧｪﾂｩ?岸qﾄXｫ"Рt}ﾀA0)i陜｡C｣ﾔ>Lｳ庭ﾄ｣fI[ｴｸ肝%ｪnｲﾔU]ﾚｱj_ﾔﾇﾈﾕﾏ｡UGWﾒﾐ4ｺ熄ｿ父晝X站!	ｩO`UHﾘﾊ｣7ﾎﾂfﾉ%保mN]eｺ~ﾛ貸ｨ2d屏ﾑ恚#碓}ｿｧｫ釘覆3vﾑ&ﾗD馼糺Y=ｧﾃMﾒ@H4ﾔ{Hﾕｧ瑚滌哩{k鵬ｦ	%神幃ﾒ!,gdﾝ30'ｵｷｨghGﾟ瓸~ｲPﾒｱﾎsr鶴ﾚqﾝ馳?ｺkW<､ﾗ燎ﾖ^*yｹﾋｱF葉n錠^僚}:ﾋ|Lﾏ{p'ﾓ:ｧﾕ|if uH頁R	ﾁMｲｺVy卮**lｦO2ﾖﾏｮOLlaｦO單j&夐､蕊&
Mｫ鍵ﾏ2{尽]ﾝJnoｵkobｾｯﾐ!ﾉｦﾏ9sB覚ｪ2ﾗﾉ､ｾzzcｩｪK好ﾌ'ｵy}0#ﾛD_Oi^Fｱ羌ｷf渙!ｲﾑ
\?&9ﾍ9ｸｼ%<ﾗ哉d畸絏荵ｦﾀ|m'･ﾋｲ=ｸn燵渡ｩ:8~鬥ｩ{T彦@Clfﾘ肴VﾀHmm&｣九啼ｾ心冷肥xtA｢鰥n樺ﾑ旱輦:}ｺ&=黠61ｩ仆|5ｻﾞｵ'ﾙ1ﾔｮ鰻f痕G鵺P$隕既Uｳｫﾉ->ｿ贅ﾍﾕﾔ&紘ﾙ荐ｭ+剿勲!ﾟﾔ｡#q?苡|I.:3Q8甥c@,yhﾗDｾPｹ
ｱｱｷ1ﾆ1Fﾟ戝;A溽1ﾗ'ｽ遘ｼﾓﾞｬW9yｼ2z昌ｾ=ｿ臂_ｮｯxﾗWｽkﾞuw}ﾓｻｾ蘊ﾟｶﾟ1ﾗwｽ銷ﾍ｡ﾁcｨ犒ﾀ淹	ﾞ[ｧﾌﾜﾜaｮYｶ匯~蘊nｯｯﾙkﾇOﾂｦ椚Y艮\|留 ｶｿｵ埼ws!ｳﾇkuﾆ駈ﾍﾌ｢ﾄｦDP"暁fｦ鎭SﾅｰﾀーXﾖf慢ｺuｨR7|煮=6ｳ憬"ｷｿﾇt&Xｰｬ;ﾄﾘﾖ麗ﾄｲl(ﾍFｲ=ﾙ8Vﾉｦｰｽﾙ^ｬ模bu8[?ﾘ?z8伺e,ｷxYﾒ^ﾛY棹ｻ)ﾙO湊ｱkﾄ悄偵錠4ｾ^ﾘｦW;ﾋ_省秕nvﾖ'ewF沾mF(-]{9ﾙ, :ﾄ枌O胃ｽ禎.ﾘﾎ
rｲ62ｵﾖ稾mﾞｶｳ)d1飩lｸ9Hﾖ岶ﾆ皹bﾙｫzLh/ﾙﾆ
ﾜﾄ#nﾆ娥lﾞL癢kｰ8ﾓ二4[ﾘTX?ﾖ7Ljﾀ浜a:ﾂ:ﾓY/v"ｷK~ｷｷ{ｰ趁ﾖH5愨ngﾁ穽6､R鈿lX;ﾛ	sﾟﾞa#潭q范ｱv9N8ﾑW1Noﾑz井縣#6a?ｬV4ｫtQG7CKS}gzﾖﾝ砺2ﾗﾍlｻ倣ﾌngだ9襄Uf ｦ'ﾂｸt.飃-俥俺ｹ
` 8+	ｮﾊ7ﾁ
64C誠卞t+6|!dY仁C韓Bx`<ｰ7 Sq傘ﾔzｶ+
U)
ﾕｨﾜﾑlLv66wgｼ!ｦﾟ&6ｮ晨ｹ1igｻｶｳ	ｻ}?ﾉ4{ｹ閥gMｷﾒv'[ﾝp4ﾙ4胃泉%2ﾎ+ﾔ4ﾉ$撓ﾎﾐ
l&6}妛､T.ﾀ\通]ﾝQ皿%踞ｺ{Wtｻx
Gﾌ｢py]減QiﾁWdsKﾈﾞﾉ&ｮgZｴ｡荀ﾄU\>ﾃ大6G､j&'ﾞﾃﾊｳIﾕ%eﾂ 	jﾀzｶ[I舸6u音匱Oｳﾄj	<9♭枸l|	
ﾁm3ﾞｴ麸SﾞｹM ﾌE];ﾛｫL膩秘柩ﾀFﾓｶｲﾊ(xｫﾜﾄｦｷｳ｢nﾖｸ夐ﾜｽﾋtｾ,4nｱｰ@膃RVmｴ0yRｺ啄ｽ*ﾑ>从
MG2iR
n$Sﾆｬ颶R
7cｯ即ｮc捉ｫ
ﾝ8ｺ仇塾Iｾvｮｼnﾞ Nﾋﾁﾘｵｫﾇﾟﾃ金nｵ瑜ﾅwZy時ﾖJｫﾞﾝ9ﾙ,ﾇｻｻ'ｧ孩w{r^ﾆﾆ|	ｺ4dP｡､ﾂ惧;ﾙﾌ惧e?ﾊVｲ･Lﾏ49昔9:Pm|lﾚxb-lﾖzｶｼﾘﾜ<%耐[ﾋ_
c都h
ﾕｱu煤:4ｷ1u6ｶﾞ_ﾇ%
;ﾑ省ﾈ?､W' ｱW瞿QﾚX*Z+ｹ劼､\脹疔vAN0_]ﾅ遶彡ｮ4ｺ1'_化ﾘl尓ﾚﾘD_s&ﾖﾁyﾘﾏ^｣23Qｾ!w^道	ｩt|M'@ﾚj!ﾕ$+!惱=)ｼ<]ﾖ,FtｯbK併Bﾗc戎ﾏ抽@W&GEﾍｹﾍｫﾛ~M棡｡ﾚ腑ｵ_棹ｶxﾕｶyﾕFuｮ薹ｸfﾀ6ﾄｫTﾚy念MW昭-｡^y5ｺ厄g模~EｭﾃQｲ|ﾎﾙHnｱ*ｮﾘbｮﾙ<ﾀN贓tｰｳy7ｶ∫ｰyOW寨ｶ>l+/`Ou>k>倚ﾄﾛPW>弦磬n>めﾇGxGy	ｏ簪ﾑy>ｿﾄw豈qMｾﾊ?ﾇ|7淨ｿ蜩|
於[淡Xkﾟﾇ:k斟ｳ.糒ｬkｾﾐz/ｶ~｡ﾟｲｻ%vO^g竍ﾙCx｣ｽoｲ+磋<ﾞbﾏ[ｵ|}?ﾒｾeo腮ﾛm8{3?ﾞﾞN脯$ﾑ供,&ﾓﾅ~ｦ价ﾏ砠営:q-_/樊ﾅｿﾕ2歙+x巖浩4;aH0ｴq､6ouｨﾚﾙﾁ3Kbpｶ75=ﾀ拔ｺ怨\拒tｫ孟|ﾕ&YｰKﾑﾖКﾑｧｩｧﾒｻﾘR溶aﾋｰvfﾖｶｷ｣袙ﾑｬRｯ｣則^G祭｣bM徇ﾀ`ｹ!BIﾔmJ6日/A>vcqｯ`W｣ﾏﾚ潸隴0~ﾋ豺ｳ^6
逶ﾘ^|ﾛﾟﾉfｻﾘ◯^ｶﾟﾇVｲ5!d嚊疎c'進枌W釖ﾕYv
爵ﾂ_ 	ﾇ%5}"$ﾟ減ｴl`Yxｱﾖｳ!wｰXB6箘tｶ谿H診eﾉ&ｶj=x=Gｶｳﾕmｼ付ﾐ&vﾔz妨惱ｼS};A;ﾋmﾐﾎ偲ｪﾇ#
U絅慍%ﾄiﾖｺ致"ﾝ沐靹ﾚ'
O!ﾇ楴栲慟ｧaｽDﾓSmﾅ溂?軟ﾏJUM籟攀}ﾏ\頤:ｫ#pｹ軾毬Af媒
/､]}%ｰ$襌ｭﾀ熨WY)削ﾂ_G6y僅與ｳｹv湫ﾘ
	ｲﾇ霊*5ｻ鈍ﾌｿaｷoﾙ暼;*措(5ﾂ/|?+_ﾌ!;_ﾎｷﾓ0j<ﾟ窩%ﾕｨnｱﾟd+u<ﾌQﾈﾁ>ｪKVｺｨ3+邂fv%c｣Kf睿･}馭v卯ﾋP|/ｷﾘﾔ4!ﾋ],ｸbｻﾒ%Fq)Vh[=Xｩ陛ﾆY=ﾙnV.嬪蟲rｫ7ﾛﾛﾃ觜ﾘ!ﾖVo
dﾍﾖ`ｶﾂﾊV[ﾃﾌ絢'Cﾛx｣ｺﾑU扁韮ﾁﾄ澤1｢Pbﾀ番8rﾅｿﾕ藥
lﾟt^絛<舸vｭO夊ﾑ'Mmﾘl鉄Lｺ樸ﾀｪﾗ燕^$@ｫ&;峇ﾕF(ﾎｽﾞﾌﾒ&vy77pS;ｻﾙdﾝ"ｶｰ[ﾛﾙmﾅｹｷc4ﾒｩﾔrﾂLf:ﾚ;fﾌｺ[辮8聘kW恟ﾝﾘBkwｶﾆ堝執&ｳ
ﾖzkOvｫｵﾛjUｰgｬi%tｳ?ｴfｰﾏｭ*kCﾔ妾ﾓ煎葵ｿｦuｬ妾%Zmb寤巛vｺ#o飃;ｷa┯菓ﾒH}IzgｽSﾔｹK%ﾈ==#､ﾓﾝ~瓶ﾁ!d]ﾚ舎ｽﾗﾋhOdﾜ淀6ｿ#Mｸﾜ?)ｼ嫖ﾍc便|Vcﾏ址ャ･剃4>孅檪ﾎ8猖Y>ﾏｧA篭戔BｺﾉH霹20ﾒ斐3ｹ并ﾒ昨^ﾞﾀJ蒲wОｯRﾎｸv
ｾ丐鑛Ｏcｽﾝ=9広aY>4
Q
餮\､益==7ﾋ8ｭ授ﾗ絶m
ﾞ!ﾗARJlRP\ｾ岑+dWﾐ:ｷ)Y泓檢~Fkｺﾎ吹AｪZ4#rﾅﾖQｨ､拶#r,代ﾘTxvu"技'ｳﾓｭSﾘｹﾖｩｨｬﾂnｷﾎb[ｬｳQY敝ｶYｲｧｬu8%ｱ7ｭ緊%ﾝｺ枝oﾝﾀYｷﾖｭ|е;歔mｭｻTn>ﾓｺ/ｳ輌k+?ﾒz神o=ﾂoｷｶ小'/ﾖS牟楔ｲｭgｬ｡ﾖｳV｡5ﾚzﾑ0{/O\ﾃｰ插｡so~ｩﾝ?k/ﾙAwｻｿｵ溏膳ｱ=ﾆm招vｵwｶｰﾇ[sﾝｭ褻$ｫﾅ枌拯iｭｳﾋｭｻ
kｫ=ﾍzﾘﾞﾛzﾆｮｲ楾躪ﾘsｭﾟ6ｷﾚﾙvO{ｱﾝﾛ>ﾈ{oﾏ5~ｵ
ｹ[立	ﾐ伐輌'C獵ﾎｻer栞ｷ8OHｼ弑ﾞ#ﾍYﾅ綯&e8gｲg哦4啼｣n
ｱQv嫖Yﾈn`v#[n7ｱfv岸ﾂﾎｰ[ﾙ:{ｻﾌ^eﾛﾇ蝙jE⊃蘿D
ﾂﾝ浜窕	ﾇ{･t8fﾓ蔭&｣Y栲嬋淆ｦﾚ'ｱdｱO1ﾈﾍ!{qﾗ3那exｱ柆s9ｿｷ1hdm?ｭﾇfesp`g牀慄vｳﾏb褻9lｺ}孃渮雫/bﾇ`ｧk緊ｩe=倆
2A｣;U!
";ｺ晏]ﾉ開ｰ`LｨM|l(ﾛXnbｿsﾘﾄﾇ負ｶ_ｯｵxﾛ張爺nVhﾌy覃f_ﾍ
66ﾎｾfﾟﾄZ巍咢ｭBvv}ｻﾛﾞﾄｴdOﾘwｱ霊{ﾘ/}ﾜｲ蹐yｯｶｷﾇﾁS0iﾞl?ﾃWﾘﾏﾕsXy~譟mｿﾌ7ﾘｯｻ7ﾛ}ﾃ{£ﾝ:ﾒﾚ｣(ﾀzﾘｲ6ﾈ
ｳ?澹-P?? ﾝ3岩ｬ=]ﾜ%E円.Z屠aﾟ滉sjdｿ3)ｽVｩ&ｴ･ﾘ!FB@l甦:hｾｮ頁TﾖIﾖﾝ嚶ｷｿE-ｫﾀ著#[cｻﾄ江eﾎEO!ﾘﾇﾘﾗ"ﾀｾﾙｨ<ﾅ1炎.ｿ｡k-95ヶﾌ縵､Cｾｧ	蓼椌9^G―ｵﾗ槨cOﾇﾂ8授Vqhｼﾂﾄq|?弱部東$=ﾑﾆPoｷ~z8剌sｱ4mｨAPｧｻHOrｼ2_Q ｧﾓｹ<>8ｽN鐡ｽ;T｣`OFeyｼ.｣ﾒ｢ｲﾓh誘莢Q｢'州3c=1ﾙm`
拡E'*ｱｸﾂCﾙｱb;E形ﾄ8ｶAﾂｮｻｲGﾅD(c/緩CｱD筏/ﾅ^陷Vﾞb:*ｪx｡ﾘﾏｳBQﾍW9Xｱ?Iﾌ蝸楽jｱ?ｿ^,dだｱ	黨h活ｧﾈS=ﾟｴ;ﾎ>鳶
ｭYﾊ	ﾂse:ﾒ波悠ﾟ"怕}ｷyf武Uj+涎5ｰ"
ｬHｫｶ_ｹWｺ標ｯg徽獨8ﾆ擒3ﾎ殞ﾄ}N{ｦ･6ｶW遯括伏5ﾚｮｲ幎匏ﾒv>]ｳｶｯwｾ$ﾝﾆ-|A@｢EｾAHiｵlQﾃ､8
KﾘPQ鬼\ﾏKﾙ>0ｶ盜ﾎ考沿ｲe｢5凝YｫhaﾇVv湛ﾉﾎGｲﾄj懋｣Pﾍ>ﾇ籌楝8冏欣xｾ8暝眦ﾄY8ﾅgﾑ秉>^怫S9X=ﾐﾝ]9笳ｹvl2Q彈A鱒Dｩ!?ｱ$_ｶh"ﾐ(薦ﾞ哘1UYlw蝕&ﾙﾁﾙ:ﾄ<ﾕ$	塢-ﾓ6Y(wchk-Pﾐﾎ流g7%a9ﾁ|ｸ兜ｗ.g･ﾍﾇbﾚ｢eｴﾊt屎ｶKiv!ｱ娵qｿb∧ｻx旌峯ﾍ凭5^Lｷ ﾖIｮA總
R	M}g"-M\覲僅ﾈ	6担栖k%o}U拡a}身ｮcqﾂ婢q!nc･箟lｩｸ5顎
G5;W<ﾄﾚﾄﾃ9t^~哨$!樊･ｾｳｸ暦&^炮y･xｯ7｡ｸｿｼ1雅`ﾟｼ碚sｸ,aﾁ疝EJz~Q:?4ﾐｸｦｳﾂa<ﾈ塗經ｰ誄ﾝﾙﾖkﾄｨ?`9#ﾖO|ﾂや3T_T|ﾀV怯櫓uﾅ^犖ｱq=宦&4
x荻g驩b<5bgRｫ4ﾃｶjﾞ諂栽揀.ﾋ?(SNﾉohﾟ~g篤vV液ﾜWﾚlｮl禅H趁ﾉ､jﾌﾝй83ｻﾔﾇ碾kA.?ﾞ=wJ18sﾊKvgZ`捨aCd..{!	ﾘﾖ$廝tﾃ｣%､#%ｨ#g貧箜mｼ逑血_OwｬﾆiVｷﾖ
ｬ?]Wｬ逧ｮﾕﾘvｺｮﾜﾀ~ﾊ
ﾄ|ﾅ&ｾj=[９ﾖ僭O~礙ﾘl=ﾛｧSｸRkﾄｬ决褸NﾋJ膤nﾅTｨ6.耽vﾀﾍJj俄竺ﾃ?錆U鑪ﾝﾟ`ﾔﾆ?妲;z=奸$:ｺｳ黒麓ｴ")ﾇHT
ﾇxqm4>75KX_戛8qｱ<96J仕ｳ(ｶJ使7ﾉ]Yｻ愨&'ｱﾇYYﾎ^養q&ｧ,9摎ﾋjﾞ*銜c臀~ｮ\ﾀﾗﾋﾝr@贔dﾝﾈ痩=8ﾙCsuBh'ｸnfｻﾓy烝4n:乙{;_ｻ-ｧｴI爪QNj'ｧtﾂ)ｮJOB=ﾕ晄^Nw/q/gｸ3ﾝﾋY褌膀rﾈｭﾏ1ｫﾞn鮖ﾘｼmｬｦX
ﾕﾗﾞ<]ﾐﾎ/莎ﾜuﾛ洌C毆7ｭ鞠墓系鉈ｭﾋYNｩ{Kg广摯ﾆ^XAzﾖﾜ炯}ｱOﾇyIq/5ｺRsY鰺4ｸｽSｴｻﾜ8出iﾖ+|Wｺ橸U齡沛=準\導｡_3ｮﾏ型_ｵﾐﾛﾜﾋu褝Lｻiｸｸﾝｰ#L｣貸ﾘIFejxﾓﾇﾈpｳo ｷd"C1ﾜ廷ｱ[ｶ4璋ﾃｹ#N&$wｿrFﾇ故ﾉ｣ｦQﾞﾉ｣2ｲV60z9ﾃ倨}ｯ:y李,V&膩ｾyﾇ|s價aﾐyｨ[LwzOw･ｯﾉﾒix	｢\嘯uwﾑﾜﾓ_{ﾛ}襦1"e*ﾝﾑX&ﾐa_ｭﾟ:3ﾞ瑾ｪﾍ~ﾀﾛHﾖｭ3隻4;/｡ｮﾛ'ﾑ期Cｸy疱ｭｴ(ﾛｵ勲ﾚ譫ｺ#I!]ｱｫｩ(?V?ｲｼ｣齒ｻﾜﾓAE?畤,詆O巽ﾏﾖｬcヅ
匂l徑`ｻﾉﾃﾘdﾙﾈﾊe廼ﾉﾃﾙcqgｫe+;^ｮ`ｧﾊ菩lｹ姦敵ｰﾋ苟ｹ壥*州Cｹﾝ+叔ﾉcﾑXﾇ^婆ﾙ;d<}!Oeﾟﾉｿｰﾟ\ﾋ3y/y/堤ｱ|ｾ崗O*y1?^^ﾊ"/耘ﾋ獄妨X=蝠Vy5DｶY%:k愍ﾞ(oｰ塙X3莚ﾖ~6k｡ｼﾝ:Xnｲﾖﾉﾍﾖr丘｣ｼﾓHﾞmw憐ﾘ}蠖 y歉(ｷﾚ聿D誠ｧ|ﾘ!ｳｫ裙	､]'浤/苫ﾚﾗﾉ銕蔘[｢怖ﾕ^ｾf&_Bｾ!ｲ;"Wｾ+ﾈﾄPｾ(1c1A~"ｦﾈﾏEH~!面/ﾅ碪kqｴｧ8Y~#ﾎ量oﾅF攤M~/?袷ﾉﾅ77屈]reﾉleﾋ1Jﾈ雨ﾉJ･袱
臀睡ｨ,Yｯｲｪ<_u覧ｩ/ｯW}蘿U T艫ｪｿ|F
俳ｩAﾊRAP;ｩ<5\ｬ
ﾕ｡ｪXﾕｫﾕｨJﾕ
5FｭQcﾕj邏蠹BQ蕀ｺｼU鴬SｳPﾍY侈ｭ憤sJｴO>緤HｿRJ靴Z輅ﾔC､皐xRHRｪﾊﾊ茯駛#_ﾏnﾛ&ﾊﾀst|;ﾁwｿ征cx(栃}ﾖ+zｱm5ｳ&矇~双?3樵艘割ﾋL!h#ﾓ_夫o+樵)ｹg;7iﾛｾ		
蓖Gwn熄8磧ｶ｡wBﾚc^嬉ﾟHﾝｾﾁnｿ>ﾕ-OW6-聨?8ｧ&0｡vcﾙjwﾖ]奮ijﾛGMfﾕTｶXUｰZ5-W噴Uﾍ`ﾇｩｽﾙ駛_v棯f劉ﾙ65mVｱﾇﾕ鎧ﾈｹ:ｦjt糒ﾕ~ｪ緘糒jｿWﾆｷｩ襞)ﾕhｼ`閨zﾟＦ霑た`ﾀ{ｽｿtﾟq/ｺ憐/ｴｮﾎﾟﾟﾚｾj{H)｣中称4ｾOﾓ
滕ﾂ=ﾐ･磊從贇傲>ｦМ量ｰﾆhﾈ際QｿｰﾟRﾄ^J;x?屡ﾇ;D纉ｵ~?ﾝaｿoﾟZｾC4nﾐ霙v.2曲◎Da､=ﾙE+畧ｶﾞ-ｬ迢ｵ簪nWﾓ^ﾌ;tﾛｾJｺm	=ｽcｯﾏ:.-/BG]T､bl患qj屬VｱｽﾔjTkﾘ~鷙Tﾇｱ｣ﾔu;M敲ﾎQ'ｳuv:昊､ﾎ`ｷｨ3ﾙ晝,:=ｩﾎe/ｫﾘ黥セ叔`ｮ.訥ﾔ･ｼL]ﾆｧｨﾋﾑ$l蕘ｩ+ﾐ$\ﾉ酋W惇5u-ｿHﾝﾅ/WkﾕｽfYm裃ｩｭ<振ｵｫﾇｬ碎	k奔ﾒjROYﾔﾓﾖFｼuｭzﾁｺIｽlｽ､^ｱｭ^ｵsﾕkv_=Hｽm､ﾞｵgｪFｾｽ^}`_ｮ>ｱｯQ湃7ｪﾏﾕｷ鵺T_堯｢T}#ﾆｩoﾅD旙S}/fｨ淨\ｫ8X&Uｿｵ]ﾄ5Gi.Nﾐ椋S7ｭﾅﾃ:K|ｻﾉ#髷rwﾝKNﾕr夭-ﾑ}艚ﾝO.ﾖ蝪z@嗤52ｱl_庶ﾋ]ﾋﾝｽ#ﾍ~拉
柞2(釆ｷ儉h04>IhｼﾌZ%ｷ}ﾓﾎ塲:QｳPiｶ4ｫYﾜﾒY褪*
	嵎ｲAzｦｲqz8屬GｰｽtﾛG硫hﾖｪﾇｰ｣Xvむ劑ｦﾇｱs."=枉ｮ'ｰk&=揃ﾉlｫﾞ=､dOr圉ﾆﾞﾓ菩=gpGW<ｽ/ｧg!z洒絏=｡銛~ｪ^ﾈﾏﾖuzｿLﾄｯﾖ[u衣ｭ歴t-ﾟｪ:ﾌ_ﾖmｽ､雄0+ｨ#V｡nｶｦﾗ+ｬ#JX}е>ﾒ:[ｯｱﾖ鬟ｭK1>aPzﾛｳ9｡曜ﾒｺﾘw{ｦ#kﾟﾍSﾅ!ﾌ鳰|Uz噴&_採1ﾄｿｹﾍｬｧ~Oｯ@$!儡｢･jｴ{ﾀ!x[ｾｸ大圜&Bnc#4ﾖ*
6賤
ｴR鐸n\ﾖ輜-･Oﾆy;附ﾗｧｱﾝ鬯LMﾓg珱數跌ｳﾙ"}.;F渮NﾔｰﾓLｽ持ｯ7ｰubｶnﾔ粒k褌FM'ｩJﾅ(:瘻nT{ｪmﾜﾃ:pｹLuMｮ_:搭'hﾟﾞｯｾﾁｷ+､ｫﾖｳﾗiﾇ､$}ｷﾊ%wﾟ竟U蝣/`ﾐﾒ晒ﾁ枠%;ｨ=ｬg;uﾘ&ﾝ､ﾞYﾚｲｬ6yｯf%ﾝoZ,ﾃ槐ﾅ｀oｷ,on'X
ﾔm%邦_靼ﾈ*ｱﾛ-Q誡岔ﾝ+ﾏR^ﾐi
ｱﾝﾒｩ[ﾀ@t寵ｶｱﾓu6ﾁﾚﾙj|@澪ﾘ=!`Oﾈﾊﾏｺ
(ﾉﾏ｢ｾｲｲｴｲﾗ3ｵ6ﾀﾗf!ｽ(ﾞd9W!ﾅb琴ｭ,y0快ﾔ$[ﾝﾛ3ｾ乏ｾyV畳p#ﾙ4'Aｨ<ｫgｲ･=!;?ｻd燈kﾐ;ｯ$?嶢s
DoSmﾈg燈'ﾆ埠+鑁ｨﾛkるﾖﾎ^ﾛ`#･=JaM>ｶﾝ]Pｰﾎﾊ歓v};-8D&ﾄｸ C8ｽ6ｩｲu観仲"ﾉ%V%ﾓ8.ｶN東A>ﾉｰ霏!.q愴樅;堰ﾛ'穂;4n]ｷ@拇|ｦﾝﾌ,ｷｲﾇcｫ4誓t.n得弊	券ｮ誓
L得ｧｬkﾚyqﾀj1E,SK侈ﾅﾙ[･t#;ｷdzw^ｹ井9j"i凜ﾗｸｨ-T勇ﾜoｽ+-ｴﾗXmbRKGﾓｰwﾁd!"
ｲiｲｮp!ﾄzﾁｺ5蒭ｺ4
q!'蝋o"ﾆ]pﾍ(ﾍk8ﾝ觚*ﾂk懽譏ｺJ9ﾆ"ｯwyｮ訥ﾀ1ｹnYｸVQ純∇n/｢ｪ忻\ｭ孩,号qpｑPﾕ$冨ﾅ:ﾝﾁYﾀP5ﾗﾅSQ腟辞篥肱W厶ﾎeN&nｰｧ>'ｳR^y2_O腓	｡=Sﾍ､^gｸnlｲ|?_ﾛﾄ_!\ﾏ?S)ｾﾕ!ﾉｼﾘbkﾑﾏ!岶PBﾖ｡罵By99ｲ
m'_苒\
fﾋe`怖l賓mrU8*ﾗｷ袍―ﾎﾋｹ｢rCdﾈM-7CirTNn穎納｣ｶrﾔMﾉﾝﾑXｹ'zXfﾊ}ﾐvｹ?ﾚ-@蛛陂<ｽ+ﾟ歳ﾊﾃｱ&ﾟkﾉcq#y:1Vﾍ眄ﾀy6瘋ﾎ/墓匣Q^ ｸﾗC&ﾜ8Vo09oF4^墅iﾆMﾓﾝTpﾊ9/nFﾛｪ?ｵﾂﾍﾀ賈LjU;zｹﾑazｸ.45h$ﾖp屈t蒹0T>ﾉoﾁ=xB>K萼P 氈ｵYﾘ"ｻ苡皺	｣ﾝ檣)彳摎/2ﾖ犀ﾅｳ]ﾑ鄙-穡説4'_b$%ﾚW$ｾf$wFﾟ0頂ﾂH;F`$=t^O@iV4b紿ﾏ｡ｨklﾔ[ｺrDｷ
ｸ##a市ﾘ4ｴb
n)慷61D
ｺ(Lﾗ"F凪bF"ﾓ弟筝ﾆh2ﾚ」盧ｽdﾜ>Fｶﾑ:官聘A秉ｾ桙UtCﾟ>鞆Pｿj{柞ﾙ禺/
ｸS8~ｧﾞｷｻ~dw5xｫﾛn8(ｻ#ﾇh捫ﾜﾕ鱶t+ｯpxy?ﾙﾃ5s[､ﾜ3ﾚLﾜ+ﾙqﾃ"Cﾍﾏｼ"
ﾈ	σ'ﾖｮｴ-ｯ>b|G
蹤Jﾍﾋ<ﾕ錬Xﾁｮcﾗﾙｻｳｨtｬｽﾉ}ﾈﾝrZxjGﾇ株0unﾉ畆ｮｽm-
箝Pｷ<凌wﾟ米p&`b(ｷ>L鬢:･ｼqG-ﾔﾗｾ霏gA具ｾj~\]ﾓUaMﾟ｡0?p｣?pGﾄｫg5"
Ln5ﾍSﾒﾓﾆｸｧ,ﾇｮ淬3ｾ7ﾒ~菷Hw'倔}ｸ_-|%:|'ﾐ(_ﾜ.ﾁ3ｬ"AEEZ*&4Ulｨ､ﾀ･ﾌQｮ〒白ｰD)ﾏ+eaｵR6*裔蚫ｸｨT/;･2ｪTATｩ概%UUBｨ秩)(Gｩz)ﾕﾑ ･ｮﾔF(uﾐT･.Z｡d｡-J6ﾚ･4D彦險ﾒ抖圍ｳJsｹﾒﾛJﾜ@i;(qG･ｭ葢~Jｯﾜ')暃cJ挽)=6･ﾞｭﾅ;J?|B衣U盖ﾊ`|Nｹ｡ﾜｮﾁ?+CI)蚣r2隙倍H
蘓ROI*捺ﾊhﾒFCnV ]奮､ｧ 飭Wﾟｪ─ﾕ△UN1ｨ+ｨCﾅF麪ｱ:Blｫﾞ#讖云ﾔQb/uｴ8]#ﾎV鬱ﾇ丸ﾔq筬黜ｰ:Q<ｭN?U'祇ｩSﾅ+4'uzﾔG｢:#`ｩｳuﾔ9ﾜ@u^2觝ﾝIﾗｹVwbﾖse欖ｻ"ｺﾛｪ_ﾕｯYﾛKｰ､概1
	棔Z蝿p讚ﾖﾔ)我ﾚﾛ:7LｪwDL;ﾋoﾚ?JH|ｴ穂?ｸs徃KQ氛ｲ鶸PQ}jｩﾐH]ﾍﾔ･0H]3ﾕ0W}朷气･
xC}Nｪ/ﾁ;*H}.ｪｫ盍ｺｾWﾗ｢Tu*ｭ｢伎z醗n@mﾔ昏FｷｩEhｺﾝｫnEsﾔWﾐJu;Z･AﾕｽｨHﾝｨﾐA0:ｦｾ>Pｩzgｪﾇp斯7SO燬ﾕｷpg$ｦｾ具SOﾕ偬qｯV?ﾆｼYoW/篆5>ｦ~ﾅｴ星ｷ麁ｦ|ﾃｴ+L防$C花V&ﾍﾕ_ﾈ`W2F広T'ｳ5 Ojlﾕ09ｬｦFﾉ咫ｩ&ﾒ哭ﾋk
ｭ､ｩｴ圜ﾑlMｧﾍ4ΩﾕLﾚGﾒAZ
｣腹ｴTｴv
]ｪ弗/ji迅=ｩ払gｵr７杰ﾖ*ﾐh/ﾚ
ぐUｪh7
ﾍｵt｡nﾖ2ﾎZu｡ｧVS隗ﾕﾗjｴ:ﾂbｭｮｰGﾋi┘Zｶ茄HLﾋｾﾖﾟiM─ｵｦ｢ｵｫjｭﾅZｱｮﾖ6ﾎｦMe/&｢r囈pJ｡uYﾋuﾞｩｽs｣･]M等0ｮ咥RGPｴ[恬ｲｽ慮{'A彰ﾏpε'袒ｳ#ｧﾙｾ#ﾛｸcvt咒ﾊ{矛ﾙ4B謗ﾑピJ若､'ﾖ?ﾕ-!N誇Tｭ+hZwｰｵﾛ｢ﾖnﾑﾀセ?舒LDSRUD$6｡絨ﾝｾо6或ﾑ0鴇q'{.ｭF詰H､ﾇｪ:6%ﾚPｧZ燦m･7zB{"ﾗﾒ;XKg變/\ｻｸZｲ
ﾏﾄ鋏H神ﾗｻfｪr"ｪﾜ､ =圏$ﾄｮﾑ1CPiﾚHｸ^Uｴ1ﾐRｴqﾐY=ｵ	ﾐ_嵎 n5ﾒ酢ﾌm#ｶﾕ\ｹP臭市 垂!vv闍ｶw}\$~ｼ4>?｣BvwY
^F9､ﾔｳ(,pﾃ:ｧｦ桝"X良3kｺﾁ2'7q斉慫ｯI@ｴﾉk宗	m
ﾔﾑｦﾁMﾚLFd就7m6ﾜ･ﾍ≪ﾚ|ｯ-ﾚBxNﾋﾕﾚbﾘ､-ﾚｳｪｶNi+#ﾏ&Q
X釿sｿ外ｯ2|燹sｭﾃｾXuc蕊"gﾒKｬ｣ｫXG_f]ﾍ:ｺ勃ttﾒ6ﾃ8-ﾌ+M#Bﾚﾂe"
I｣ﾒﾁﾗ.彜x~&/ﾙ薪nﾂ+RJg%ﾚ須Η磋x=tｿ艝ﾞｧfｼ+ﾊ/&,^｣)ﾒｼ蛎Rｴｯｿﾌ@ﾃｫ&gﾗnﾆ+xEvo攴eｰ4ﾃﾉﾍ薦Qｶ9Lﾁ饗型ｬg"□7jｫ5｣ﾊﾂ&*6ﾇ-"ﾀb|,ﾌ･	`;&lﾁﾃｸ(Bｮ漢%ﾚﾚﾖpﾄｿi11ｱﾗ彜ﾇ季7ｫ
d･>bｨoE魚0ｰｷｻﾘgｧｳ+Gｮ+Kv(ｱJFｪﾆ{ｸﾓ}ﾄ0
3ﾕkｯ纔r<ﾝe矩n隻(ﾃQ;｣ｱ簔Xﾛcｷ_､[$ﾘｿﾀ{v$ﾌ?&4畫4!ゴ;ｿｩXｯﾄ=癘ﾌ替ﾞCﾚﾑﾘﾝ7}襟>+梭ﾟOﾆ覚'髦/耽ｦ<ﾝA M秣1sﾓﾟ{'始ﾟ閤$b ｪｿ#0>ｵ颱vｴLｲﾕD懷ﾉｬ~"ﾀ跂P5y6q	:ﾟ繽竹ｪ'{緜彦$~g9ｬｸ||0dｦBnN&FA$+ﾙﾏﾝ>Lﾚ鉱ﾉ没_@ｺ播iﾗe槻~蛔ｵ城ﾟﾊ?i襃億､瀰ｸｬ*OPDPg`塘ｻkｻ>ｹｩGｯB]m/ﾔﾓA6ｻﾗD;-ｴCﾐN;ﾌﾄkｰT;ﾋｴ｣ｰ^;ﾆﾄqﾘｭ捩ﾚ[ｺvﾞﾒﾞ＾ｴ痰v
ｮhﾀﾚY$h｢ﾚGｨｮ1jｬ}zh躅<ｺKｻﾑ>E+ｴﾏP｡vi泪ﾚ%tD]ﾑ.cｪkﾚ7ｸ授-nｦ}k?珮ﾚ駿尾棧ﾑ?ｮ君J]ﾀuocﾗ{tﾖ5|LﾗI)=H6i｡ｧ生z	ﾒ_ｿ翻ｯW｢ﾗ髟iｽ*ｭ｣ｧﾓz
ﾚGｯE魴驀z:Fｿ丑ﾔﾓｩzC:GoD渣s鑁ｽ1ﾝ･7｡ｯM1ｽ}WoN?ﾖ[ﾐ吸KzYoEﾒ[Do'(z{｡ﾞA(･
<｡ｩ~ｳpﾞQｸSｿE｡wFｷ
.ﾂ4ｽｫ0K&ﾌﾗo=ez/%ｽｷPｨﾟ.驀=z_5}>PV$ｦ%}ｨh鑿琴ab>\ｬﾗ顆既箋(e}ｴｸ^+nﾓﾇ閲磚}ﾓb墫譫瀏L5ﾗYU3ｮqgЩ&u遺ﾑ
GﾃB	ﾁ;Ka笠3ｫ垓ｳ.ｶｫ$":ｱ5>｢ﾎﾅｮHJﾘn猗軍ｾｸ(Iﾔl6$ﾅuﾃ種ﾉ猛､MX跟ｸｮc-ﾟｱﾟDJa<ﾀ407q下扣ｮwｮﾋ]sﾙ|畧T亂遲ﾒw9$9詈LS餅幌ｲB?Ц叮ｧﾆ｡.(ﾓｭn列:ｯq靭m1:Zﾄ2對LPjHZ｡ｵ,藕ｹn+)Eﾍtﾞ1ﾏｭ凵ﾗﾒv's#e|C舗変ﾟh･ﾄJ%邊WOﾎﾍﾊ9ｴ&Aｩ_h瀧扞ｮ､
檄兀ｷﾄﾚｮ陋怖|ｪ(ｩﾜ勒ｲHｧj?ﾕJ8腥S$=董､貝ﾆﾗｳa6>j鑚｡>ｺ頤｡ｫﾒB?}ﾑ氈{e0F_sｰP夜Pｿｵ∪>ﾑ7#｢oAｪｾ篇_A(､A5}ｨ7ﾔL?鎧鯢P;8ｺU?】'Q/mtｧ.嗇ｿ跌｣gS9*ﾔﾏ｢ｭh:ｭ_@髻｡O/ﾐﾟK鑒2ﾆ7Xﾒｯ`[輪+ﾟ絖ﾜ_	Oﾗﾅ/
3D|ﾒPG/:ｾbﾘ6(F*im\C0ﾊ藤ﾆd撚ｺﾆ'ﾐﾐ8ｷ遑ｧq淌@f|_ﾃL椀|k`二31~&F`
H2E杷P9SE筆e&ﾊ2-把QﾓFｷ乘ｨ孳-麥ｦ｡ﾁfi4ﾌ,亳贋CE^棗ﾖ1ｬ{i縹(0ﾊZn41ｺ~IｦSサcﾈsﾂﾍ縄Q茹ｻ#no階>矯ﾖ逾kﾇzLﾎ艤
広'ｷt次Hﾍp,ｩ蜉ｬﾉ^~粭'
ﾃ衒d:N<ﾁ龝/ﾋｻｧ#s錏ﾐ=ｿ呷$.0+B)ｳ2ﾜ`Vｳ*dﾐﾈｬyfu鑞ﾖ／f]ffﾁ}f6L6ﾀ3譎Ma･ﾙ6-甃ｳ
\1ﾛﾃｯf.ｪnﾞ齲ｽQcvﾔﾊ噺ｦmｼAwa_w･#X羯ﾈｭT 妲5ﾐﾆL
+@ｲﾂ檜e4Aﾈ7;ﾄﾄeｽpﾄMｨJ8映人廡ﾎﾋｯﾓﾇ&JB唸ｳ?H(aﾈ1A誄話死ﾙ=ｰﾕｼ#6ﾚFｽﾖym0計"｢ｾ＠ﾔOo$ﾍ{癖縛=｣磴2,.$cｬ捧騾9uｨl糸8ｨo紫ﾛﾍ	0ﾐ|Faｴｾm袍懌柔O/.8ﾉ_'ｰ，ｽ､｡ｳ:htｵro禾濺
r剛希"r｢朽ｸ舂.xｾ舂qﾋｾ_ｵH!M奧5ｳfUVﾙ$4ﾎ輅D$Xﾂnﾄｻ1YEZ杰TSoGTg｣$ｴﾓq繃#ﾓ弩聢cIﾗHk_~$ｴ#｡}$ﾔ5ﾒﾖﾗﾈh#｢[ｩ｢}c8ﾆ甘
鰲pnｴｹﾘ警ｪｲ1	2ﾍ)	N誥xﾀ|1ｿ勾ﾍ'ﾌﾙｰﾞﾛﾌｰﾟ|.娑｡剌j刹Q}s)電ﾋﾑ
tｧｹ0檬cﾍﾐDｳ=jｾf岫ﾐ:eｴﾕ\材7ﾗ｢s:ｹｹ}knﾄﾗ啾\ﾏﾜ郭ﾌｸ了O0w瓱ﾌﾝxｹﾏ5痞s?^iﾂｫﾌ#飲:ﾓ:Dﾘ	jﾄ譽ﾈ`(ﾉ+nｩ贓ﾄ蔗､#ﾎAﾌｬ2^la哥B(ﾒｸ*ｳttﾚ21:戍4ﾊiﾔｩﾃ閑ｼ凡ｱﾞ@_誥:ﾀwｪﾘoﾔ莽
&Cｷ端yr5実ﾍrRﾌ向sﾆﾕ3ﾟΥ踴Pﾅ<uﾍｳﾐﾘﾚｳa;ﾇdﾖ6d淞|3Xf^5%ﾘn~	ｯｲzﾌｯ皖
ｼg^ﾍosﾋ･y^Tﾅ
ﾆﾜD附ｫﾉｿ$啻ﾙyUﾅ冽Qﾅd襾｢.7椌#鴈t	G圓ﾆ｡､kﾜ4阮s}ｳﾋ}ﾙﾏh酥ﾝｹｴﾃ&巡PﾐOBﾘbﾒ･薦p 苟/*qﾊQ序ﾈｽ-ﾆﾘﾆ7z\ｽ
e"ｲ?ﾂ{fqvﾒﾋ麹K8&B嚼&n&=sl糜}!ﾒx僭EA|M_ﾓNr/zz'｣羣
Nﾗbﾖg公'ffW梗r[3nA/C/?@EG6_~z豈ﾐﾐh!藁aX`QﾈｷXiIｰﾚﾒ`ΗﾃVﾋﾝ	-ﾞｰR-ｫj･"j]Z破疋螫RｨｲUeZQ=ｫjjﾝZY媛Gｫ
麥UEｬt4ﾝﾊ@sｬLｶj抃Mｴﾗｪ歳YuﾑWﾖM8ﾅj依Z膏cｫ"ni5ﾇｬVｸｫﾕｶﾚ眞V{<ﾜ黴GYｹxＶ3柩uﾄｳｬ[fｫ+ﾞnuﾃ{ｬxｿﾕ#ﾎRfﾚﾑﾓｱy)2sﾝ獰ﾑﾍ'=ｺｵYﾛ綏｡ｭ舸画NｿZYF@V?YwB{k-ｴ肉髱n22-u革Bｯ袰肩ｺ碚9>>ｽｳｯｽ'MT]ｭﾞ-壽+0wｺ|ｲﾅｩYﾕｻ9D~ｷuｼｶg高5ｰｭﾐﾚｷXﾁ}wｬ5	&Y統ｾﾜﾉ命nfu4"tﾎｱﾓ<=ｷd"扈E>ydゝzﾈｽ}｢樅W厥ﾘｸIﾟﾏ/髻ｰ!ﾘﾟﾀ│$調-v列蔀ｹﾓｻm'ｮΔｭ瀲 Eﾛｼ+歹蝉dXa^･<篳 ｭ04sﾈ$ﾇ･ｧ6>}ﾕｫ鏖Qｵ2	?=eﾗ"ﾅCｴfﾀｦｩ(ｨﾖlｸﾆ7Xs｡ｪ5XOB+i6paｻｵ珊K眈|jﾀﾟｭ鼠ｽ謙YPkｽ3惣1ﾂ7ｻｨ僣燭vｵ娃ﾉ%ﾘｯ0*ﾛuｭLｼvｦ]ｼ1Z穢PvｬE蒡<哘ｽ0qﾝ彭｡･Wｰ%wｪﾀc?e叫4Tｵaﾎ4ﾈ｢…bd:ﾝ
ﾀﾊLOegﾞO┌B霏謌｣ﾂ<*t槁咽iOﾏrWﾄ亊P欠咀8Y珱.$O9ｿEd｡?2凩#ｨvﾐﾍLﾍﾐﾉﾎだM0ﾈｮ#lo7Ivﾌｴs痃ｻﾌｱ崚SvXhｷ|ｻ5lｶﾛ@貸ｶﾚ-ｻｼmﾟﾌ鑁P!\'ｼ-ﾝﾂJｰSﾀ3&ﾂ
ｵAd8
g$ﾗ@ﾟ塚訶hwﾙUnﾐﾈﾎ>88知L|
,ｫ!4	9ｻ加3TJ印7ｴﾇeｧｸｺ+mtﾖﾗｬ煩{ﾅ"ｲx#Z秧<ｻ茎_ｮ僕1韮昧ﾉ2&Tﾝﾒ\6刄ﾛﾈｳ=ﾘｮPD枋ﾍｳ'+:ﾝﾜ担ｧ}Fﾌ徹V2敖ﾌ膵ﾉc%/ﾃﾚ\m}蠢ｹ%ｬﾍ逹ﾖ+ｻ%ｧｭｧ;*8ﾚﾏ雪砒ﾍ`ｵ戈:ｺ%鄂,杣;ｪｺひM祚^tgﾆKQ9&V癪ﾘ;ｼY>ﾙPj｢oao3nj｢厮ﾋ'ｳｫrﾝQﾓ<ﾕ茆y?	叱葢ﾄ祉ｬ恩厠凍?A%畊y2>ﾝnｾ咀cﾚﾍｧ,･ｧ訊孱 稗rM罠0-ﾀ]C撮95ｵ=l迎*l籬2僅ｾFﾂ疉@.R hﾋｿﾑﾖDh;ﾟ67 ｺb/oﾉﾕ\純u[VﾖﾙｬｳQxﾞG鐵>2}_-曰X?yi_ｯﾜﾝﾟN_yW1ｰ襪:/mΜ=,19f簡0ﾙﾓﾍyﾏ･:6ｺﾅkAdﾅ*"1#禍qﾜ^針Ｓ`ｨjﾟｵ!ﾐﾔｾﾚﾛﾃ=ﾘﾁp~m盾qhxﾔqLD欠･Xe?k解0|lOTｸlO鴪(廷Hｳg｢=5ｱG-y(ﾏ桴ｺﾚOﾛh$ｺﾗ^&ﾘ巾4;ﾍｶ｣ﾕ3hｿｽ擴離gﾑｷsﾘｰW熬J\ﾞ~Wｲ_ﾀ5\ﾇ~ﾗｷ_ﾂ9*ﾜﾏ^'ﾘSv!~ﾆ^勝ｳ7郊攷	ｶ7絳vｾboﾁ?ﾙ[	ｲ_!{1$ﾛﾞA壗;IO{冑!SWﾉ2{/ﾙj#'膃
ﾘ骰!Zﾍ>Loｲ_｣M#ｴ:hｿA;ﾛ｣=｣vMﾚﾟ>Fｧﾛﾇ-ｰﾟ｢'迩}=zﾎ~_Pﾛ>-閥ﾏu巡ﾆ' ﾑ;｣.詩a
\ﾇﾌfﾘ`#剿B2N截1i仂Y/*ﾙ2N∃`A&ｻｲﾕﾀ]ﾜ迹/PKRV|PKma5$antlr/DefaultFileLineFormatter.classuQ[KA=｣ｫｮ溶^[uｽﾄ圍ﾐK`ﾒC H/Eｲ(*ﾋﾚﾟ/ﾔ毅Aｨﾗ
ﾒ恙3sｾﾎﾌﾇ銛+
vC#@"2Rすe(ふ22dPuﾃ2ｯVｺb｣gﾘh?ｻﾜｾﾔｻｦPﾜi珠｡\8ｶa
4ｭ}ｧﾟUSｷUW'的)Eg|rerVﾜXﾒｳｶﾌﾃ5ﾍ9ﾉT^w旻Kｦ憩=m(頽tRｺｹa曜ﾍI3餃*h6j&0､ｻ､i,醴ﾛｵｮoｧ(iｵ
'Wｪk,X朏｡:ehsq#$3ｦｭ稍ﾗO:ｩJｮ棔ﾙ~z7ﾂvtﾋ!XYjｱ烽`ﾐ憤Q2ﾖ\%%-ﾍ0･ｱCｽ#Pﾚv
gｭｬ']ﾁPUWzｨ3Sﾞu鰡∃=kﾙ1ｱYcGﾏ･ 2o･;ｫｬ%ﾝﾔw
kTFｸきzｾn1ｪ@#ﾗpK 決ﾀ\THﾃTﾐ_w@Ub9旱ﾙ1,ｲ
嚏a?←B捨!'p	8&DH
LHrWU<Tfﾚ4*7E漾ﾚ?|/樞丗s|%5ｪF濕|'0iWｼ|O獅ﾎ2Vｶ8[ｼ慳+･fｳOgA66･ﾛｶｷk=Gｽｯﾘ6'HA4XwPｫｦ旻ﾉxﾉ+hﾏﾐ7HﾞﾔｭZ@ｰtQ繁ﾔPfｳ筰-_,SF2ﾝ*;+cﾕhﾙ軻_pfｦ&ｭﾉY0ﾆﾁﾊ執w;ｷm}RTﾋﾐ諒･9xﾁU[ﾔbﾃTiMﾙﾈ+ﾊUtwf9酌ﾔ係KBﾕ"~hﾎ･澡4ﾅ]7ｭAｮﾋｹ."ｺ忰駻nｹF;n1泙h	B	ｿ@ﾃﾖ!B凾ﾗ\R?|h｣ｮYZSﾒ(oﾂ捉R@ﾓﾏ%鞠ﾗc^'|ﾃｵｻYmｧDkﾘVﾘﾝ*ﾚﾀ{V8竪s8嚊:7t畧f-[ﾐ}H｢ｻ墾:ﾑ僭Wｸﾆeﾝ碣ｯ靆#@8N<ﾋﾑ3,BgY0	:5ﾊ謎ﾋｧ蹙&+疔掻
隧ﾄ]_ｦd｢ｮIo･I&Jn履v―q!､I}｣Pﾙj洞ﾀ道J榾Bx鵜&Ys)!棊Kﾘ-zﾒ･h酖ﾎXgx jｭﾑ!ﾟ｣妖造=ﾛ1ﾄ｣n/ｻW~ﾃﾙFlﾂ|懆КU>ｵﾘｽﾁﾟ]ﾎﾉ<{ｾHPﾗ渦H=a!Oq舳ｨ驕1T｣Iｭｦiﾒ)陽｣wｷ癲*ｴ蹣gﾜUPKiZｷ)
PKma5#antlr/DefaultToolErrorHandler.class昂ySG
,ﾌﾁpｸｲﾐ5X斉D｣倏%ＹDﾔ8ｻﾛﾀﾈﾌﾎ"壙佚侏hb4&ﾑi.鰻R豈T3$"_ ﾉﾙ+Pzｺ攸~uﾏｽ_lﾀ
6｢UD宸<ｴﾊxｻ9iｱGA!:$tq/']懍導$Tｺ奐H8､`
ﾋ錵_滋滂袰q\ﾁr弃"Nﾊﾐ猷＞A	C%NI疏芥*艱･色姙荒2ｦﾀA殻l歩JHK用Zﾁﾟ淆3"ﾎ岳Iｬ[ｮｲmSﾚ藪ｬQﾀ担ｸﾞ2ｬ;ｻm'ｩｻ.sл9ﾋﾄ[ｸﾍｰwﾒﾈ｣Jｪ{Z｣.ﾃbﾓﾉs1天､D:9ﾚﾃﾜ楳ﾈ@ｷVoﾖP}壌ﾖPcｯｩﾝﾑ的ﾝi<ﾚ1牘tﾙ>ﾌgｴXMｦﾛ伯Ciﾃ=#`Wd椪?%.觜ｺk元fﾓ誌蕚ﾙﾑﾁｵ油Zﾛ&隈5ｷ/｢ﾙSﾗgｸﾃﾉQﾓ`	.vPws[;ﾄﾙnツQﾙﾊｴ駻ﾔﾚﾇv鏃ﾂdﾎ至-xYﾀｬ墅ｧ｢b3杆6	X6ﾅ踝 gﾙ８苡lﾟｮ禧ｼﾆﾉ愍!笨7q^P+-o竄知ﾌJﾔﾙブｮ=ﾂｬ*ﾞﾃEｫ優|ｨ#|ｬ|ﾊﾉe殯･Y'ｻﾓfa溘ｈ/T|迂WT\ﾅW,[7l3Y炭ｮ官qMﾄ7*ｮ繙ｵ&0篌ｶl+ﾁ(ﾐ$藕*14cVﾘ!甬X@A于ﾆｨmQ^=#XﾕM揖埋ﾁp現驪模Oﾅ6dﾟn笋奇8ﾟｫｷ@ﾀﾒyｲzﾔGﾍ西rﾃ1Gｷ篥3vEﾜPc倥ﾕﾘ)w髴g詰.o~ﾄｫｹ傭(擅ﾚﾈﾂｪ^ｰ範ｪ
ﾜnﾋcvK%;93話蔗*ｿ筝iRm･
*愈fﾃ･.ﾐ8ε"ぐ5ﾆｬ嬪3j9Bﾋﾙ､ﾌｽ際稔Vｪm4e傲ﾀ｣慄ｬ!wﾘ孥(朶tｾ^Iﾓ-}タ>ﾓfWIyp*ｩbnｯﾗciSwｨ｡ｬ撒/L/ﾍlｮHzｸｶﾅﾃ]L>g瑯像ﾋ2UzﾐHuｱ	4･]ｻ拑ｼVgo~#･$･ｸYm礫ﾊﾓh?ｿY,R謀兎ﾅBｿ;頗粲卷zﾌR蓚ﾊ!吏｣ｬﾃﾆ剴b^8\zｿ$
WU蹟"2ﾊｴ蜑4纓｡E_-ｶ儂Rﾞ(ｳI,ﾎ+梦fﾋqﾗyｺw	ﾂtﾗo､ｦ,ｽAぞ痺Q'ﾟl･ﾝﾚ掛Bﾑiﾑﾈ檳]｢5wQpｼs5
zbﾅD(E	ﾊ画也ｫ孥oﾜGaYbbﾘ,､PﾁM\ﾒﾄ煤"｢5dPﾔ
L｢U+Iｧ競SdPﾒ {K年｢ｄﾊHｨO3Xr
E唸VﾋE5賊ﾈ}ｷｰ>gTﾔM!3
ﾈ徙ﾗT槃41ケ&詒ｰｼ$ﾜwl6､阨U┠aﾖﾓ-"ﾘ泳t"穫ﾔ(ｭﾄP$痒ﾐｼLX^!├@vfﾃ zﾚ
_ｪ
ﾋ'1Tﾋ3xbﾇkCh
rmH茱｢ﾉSX
E壺ｩZﾑ*BUCｱｦ_%\!iﾅ4WﾑJW8凝ｦｪIG
ｮﾎr淮治ﾂﾀIﾜ肅S1;}外Cﾀﾉ_ｰ烈5宴ﾕ隋MU(Lc-扁&ﾗdｰ _OｿHﾕｳﾐuﾓ{ｺTXkｰ沃"Pa=`;qpﾇ靱:N_gq醪G#魯?ncwh弱w愨8I嗹｡ﾉﾏｦｫｧD｣
xn閣ﾚiD)V幾
5Mﾎｺ/ﾎｺｯ<>_ XﾇSﾏﾇbﾃCvXOｿｧｸ榮ﾀdzG造ｺqﾉ4,
G@3蝪?PKｧﾗnﾃYPKma5 antlr/DefineGrammarSymbols.classﾝZy|Tﾕ?躁22y!ﾉЗﾍGdﾉあBﾘI$ﾘ*N苧dd2f籔V\ｪｶhRAｫｸﾆ]6･ｮqｭK[遊ﾜｪﾕｺVｱｵ規釛賚ﾂ$ﾃ鯢3ﾞ{ﾎｹ轜ﾏｹ迸{3ﾟ;U｢ﾀ	(思ぢQYp斬2緬ﾑﾔsﾇ&儉bRﾂ､祢途&ｬtﾂiXW砌lｨﾅ)<ﾖ	E8ﾓ8墅d舜ﾂX慳8'奥ﾀ譛櫓ｪ8gqﾟILf;p&畚ﾖ8｡G)8k厠gｺ$ﾁЁﾝ)ｬ.凶dBﾜ7N1ｩ椁@0ｼ(黠[	w*-zﾗ_鈍%知們ｩﾚｽ!/6ｵﾝ｢` ﾒM錆mﾖ[撞JｾｦHﾋc0vﾋ朋r櫨>菎_妬mz;¬=]zｋ､ｶﾃ\tﾊ畩ｽK
ｰFFwAQM,;Rｬｼ膝Wｾﾘ縊q^ﾋ･ﾞﾅqiz:pbﾏﾄT^J並
奪9稘ﾊG94ukbj7陷8｢=ﾔ糖鰐ﾑH溟?ﾊu28G饐4[帋､├ﾄｲQNﾓt2ss|ｲｼ^F5崋VﾓiﾛﾞrﾌN｡Ik#JｸL.gﾞn,ﾇﾓｪ@ｫｧ%糒{乾鷸>殤匿]ﾝｾﾉｼ&=,ｽ戮ｽ>=*島&ﾌ#
*a･lZｴﾍ,ｴｻＲ]N:ﾀＢy ,L碼43頂､V罧b从ﾅ星ﾖq#ﾔ7\涌ﾇQ )8疏ｫﾎpｩ,sｹｲｦ椣摩/Tﾅｳｪ0/Pｧｨ&TｸvｨｰΘ1VQ韭
ﾍｸRｫkx朗%R#
渉c*<ﾎ	&}ﾐｯﾂ^ﾘｧﾂnﾘ｣ﾂNﾘEﾇ楽ｦ2nｦi*>ｏｪ>ｮ8@<	（ﾘﾏ盟ｯ笂矧O3*>均ｩ|ﾞ2T喇2ｬE|Iﾅﾟﾂc搖ｿｫ2>ｯ+*ﾕb｢2/緻G%;g^､ｽ暃/$V/hﾗ8$4Tu樶 7ﾘﾀ7)ｾ･籟'ﾟT|署ﾂ?3yE(]側ﾑg,X5YﾗｴｳｪｪｪﾎｩｦY>`Ma>ﾄ&%徽Tｳ=ﾛyﾎ巵Aﾚ綟$迚ﾂ*~ぁｪｾdyｦ9ｮ傍ｯ9B鷹ﾞzzﾂ8ﾅﾁ*ﾂ/7次地ﾓｫB｣ﾖaｭﾓｳAﾗH毀ｹｿｵ晟'､冉h？ｸ;ﾖ6ﾈﾁｳ|ﾕﾄU:Sv)ﾈﾛｪhｴtx就
｡?ﾙ>ﾆｰｰ.6E2ﾍK咾tｿ｡}･o館Bｸ!LｱL3sｦﾖｴﾐｶ靦x;=aｭ'ﾑ6ﾒl膩x淕ﾍb~ｫ窈TUkF1ｫydﾂﾒ<>ﾊm=啣択ﾆM譏D}醉受
ﾏﾀｳ*<ｿQ
｡b5QﾅUﾘﾈｵ"Cdｪﾂ.2 事ﾅ啣h]善Xkﾑｵ酔c-ﾔｼmtｲ奠ｻ筋}ｺｹﾉ(ｳｴ{7ｩﾂﾁAR喘(ｵR叶Hwｷｬ)ﾔfJﾂ瑚*n
･vﾒUtﾉ秬k'童訛lｺ皮嚠ｴ鶤6.｣ﾍ姑;t?ｧ4>緬[m7Un#｣ﾆ菻
濤MN^[^ﾎ*N原|K(OH^xA*n瞰僻ﾏ哥潦(Jfｪx1%,kqTｨﾖ6ﾑﾙﾍ:鏤4*xｴﾚcｴOﾕｺ*叔H八ﾂﾉ:ｪﾎo2ﾓQ鰌7>SS5m;･6>茎e;干ﾞ囿4`
4O6ｸｩ{IZMcs
mjﾕ謙)UNM｣Z4~_M釈~^ｿJﾓ油t
-､Z攫ﾖh膏
鞦XK3uv
ﾞ@$dMｼQｧ僂ﾚR^?y6SｧｿUﾗZ;ｹpi縄6v|:iﾙ3ｾKgoｨ脚moﾚ-z"菖ｧ)*%･ｴｾΞﾟOZB走0!ﾇﾕｷeｸ7ﾜ#1uｮ6｣ｶﾒﾁ`ﾏ8:ﾆ}ﾑrk
ｳESｾ餤o(
,S溘議kｱ･3ﾂｸxﾔｭ印'､8/船|ﾊDﾗ!03俵ｧXｷ!<a4o!#^CｴﾟIｯｶ､cU閃ﾙ纂Ciｵﾋﾓc戸繧9囂ｫ荒=8nｫｵV'ﾒT妥徒劈ж囗底1ﾉ､ｼﾊ)ﾞC鰤_3J7,E8	OﾅO'ｦ浬息掛哢ｸｸ陌樛ﾞnYｷ
j0･[ﾃL｣ｾｳ?ｴ｡ﾝf5ｨbljuﾃдz#J梹謬n4ﾍ懈X'i, UiIﾕTｬjZﾖrt2Mvｹ楽:襠ｭ"ｫﾅﾌV_]垪ｱ-Qｭﾅﾌlｾ｡S[F	切-lB M<ﾞMTV'v/熹1ｯ$1L剰j梃A~
u%ﾝ｡冖ｷAﾌNxrヒpﾜKwｸ 2!~0wﾂ.ﾛﾀ=w/#Z瓣筑粟ﾌ%ｾR疋>B,(<&7汾ｿ3Iv$ｵｶC&彌ｶｰl?5ｻﾁﾖｱﾏﾌﾘｧ>kl.e7dｳﾌ鋪j
0ﾆ$ｷｬｼﾊ* ｿｬｲ\lﾂﾓDgﾐZｦﾐlGA.ｭb$L	PﾓN

姫Uｰ糸
+hd5Gﾒt#5ｭｽlﾐﾊvAﾁ#0|ﾔ庖Cau&ｷwﾁQﾌｽ0Bﾐ2v｢5ﾌﾝ牋ｶ寃{a$ﾂﾛ^韋QQ	^- f襯ﾈ"z<8ﾉｨ<ｨ&WﾍＣiﾜＯ.ﾌXN"ﾟ閃ｳ6榛ﾙｻｰｍQ｢ｪ平0Fﾀ686ﾁｬ0v惚 <ｺﾚ騅fp&ﾙ2Dﾀ0	ｮ*ｲn5,5ﾄ<ｼ`ﾚｰQge0aﾜｸ+ﾃlC2モﾘ.S!N
Nｧ9<4"ｼd黏ﾋ0#]NﾔFｷﾖn9嘯ｭ韵ﾒｳｭ#{x9ﾝ､~｢ｯﾀｫqlｩﾘﾖ}唆横ｵRﾂ鯀ﾗ癶!蟠)8ﾌ^0き|展ｴﾜ几`ｼlﾄv/ワrｯﾏv+ﾞ溘Cp握~+}ﾒ;ﾑｷﾓｳ楢;鰮ｾ&ｧlﾟ}7-Rﾃﾐ[ﾆｩﾔkｰﾕ$彡|ﾍyBe&>弄_勸ｹPｳ柑ﾗ57ｮsﾞﾃP[ﾏｽ)ｬ1rﾖ呂ﾔ\ｴﾚP ?wDmﾀIｦ
80ｸﾟdﾅ[az|椅QxZGRkｭｰ;驂售ﾖ;b6ﾌ騨ｩO關K)ﾟ
H｡UﾛPaNｶTﾘﾂ2cU$.ｦBｮ`?,7ｱtV<ﾟ鍍ElX4ﾕ塁｡92bmT	事ｵ宰cﾁ8rec:湧ﾜT-.*駅ﾑJﾓErｰﾂｵ*瑤ﾕ?ｼbm7'ｪl(ﾆｨﾂ\8`>ｺh%#炙,N	孅4lﾆ1p>祉kｰnﾃｰ浄ﾓ[X`)蠅2ｫ濕怺ｹxｺq:Nﾄ羈OｯqV紕恪軈-曩ｭ_瀉ﾜK6ｬﾇｸﾀ&ﾀ抱*ｮﾆq
~ACx塋ﾄｵ"=bｶ崖lﾇaｻ使:唄ｱK怫ﾝ
閏1"ﾃ
磚ﾜ$ﾃ,)^ﾇｳﾄA<ﾗV嬶Exｭ/ｲMﾁKlｳRﾛ"ﾜb[L睹~壗ｯ Aﾄu5ﾑｿ､gﾛJﾃlﾗ(=ﾛ
D?NﾏvﾑOﾒｳﾝJﾓﾜNｳｴ5+ﾞEｯ鰮>9|ﾇfOﾅｶ!2ﾛ.｢儀c掴槙.}t
~沸榿}D楚ﾛCDiｱ$&ﾖvV盗薐{!楊@ﾗﾉｮ肉ﾀ哥ﾚ錯J僊VTｺ凰脂K@\tﾃ)ｮ[鴬JSﾀｬv\ｧﾆg({･然,蠏|8G30氤2|籾ﾐ/ﾂ卻璃ﾁｿﾍﾌ"G:宜aｹﾌmｧ5T<	v羊?ｱ[ﾚ%
*ｾy
拌ｯﾑﾈﾗTﾉ喃囹F$iﾊｴﾝﾍｸ;IﾑAR)z\6鋼>zﾞ#]zｶﾇb+&&fｳ･ﾝ縉r/~咥1"鰈~Fl按d[K金躯4Y鰥+ﾌ噸m鉈砥C匆ﾍ(蒟ﾅNｺｴﾄ丈ｸﾆｿｹ/rﾘﾗ麦ｿ←Hﾚﾒﾚ$ｨ?^嬪ｩjﾍ茹封W)､+ﾄﾚ､
d	d2ｭk}ﾝ`賂2俸沓*ﾒｹﾔ?=Y2rﾅ0超[ﾛ,偵mｹ梹'O^v~ﾁ.ｲ[h'蚤9ｭB6OｯH`ｪ0俟Jｦ
)餠@@n1&7L#aｶKﾄﾑd#=:ﾅﾄｦ`V嚶/&嶮J佛=
ﾁ｡2Egｧ淇坪T:k
ｶ3eu0'ﾐZ燈Ol1墾ﾑ,･l圏+扠*m24配栲;mY5ｯxｴ3鳧ｵWｼ"G杵U~馬ｧ逐ﾙ萵^ﾎ-ｮﾎﾊﾘeﾘ^q欽兵gﾄtgE,匂ﾁｽ祗)ｾ.Q\冷>)^'%ｺ7W"yt#楽ｲ;ｶﾉr｣夜vｭｯ諺驪ｩ1Hﾛ`美ﾉo#ｳY
N!Yﾕq添8Qn0eＣﾜ'l牌ﾌｵLﾝ,ｶA｡\罔5ZP0w糶%i9┐ｳzｱﾄﾀ婆8ﾛ\C<ﾜﾎVﾈ*ピz癶ﾕVx16rn/<*G~(G.｣AAq
!ﾟ6ｹ6n罐ﾃy曳挂3ﾉ營｢答*b膀(｣ﾝ0T1
ﾅIP&貘,1瓜々拊ｬ吟Bｱｮ災+銘Nｱ敬ｗﾅ*Tｬﾁ|ｪ(ﾇ意p｡
ﾑBUf+-ﾚ2｡羞｢w|Bt稾bｾ#|ﾂ)(ﾑ-ﾆ寓b館b｣X"6qｦｸT+ｮ?河稱qｾxU\,ｾ淋>ﾎ許	xc:ｱABq~\8_ a+蠶ﾃﾞb(hGKｶ峡ﾋ?	G~達>KﾙFf:ﾍ	Eﾆ^ｵTsI*5FZｸ4ｽ9ｽｰIｪi*5ｧJ5?屠誂ﾙ*+妝ﾗec)立ﾖﾌN!徊｣ｼёﾒS涅監0Ml:qｴ駕ﾐ-nﾄﾍpｹｸ
wﾀnq'<-８ﾅｽpHﾄ8\ﾂﾉb7ﾎ｡Eｽ8@nﾋO[絵囲服qb+ﾀ畴,｢ 熬當ZEﾎrqVいｾﾂ
~ｸ｢l
1e慚v閾+5｣B傍Wｯ+ﾝ咄O	ﾗﾙｫcJ\ｿｴ4ﾊKｹﾅtMﾓﾖ8ｦﾕa`賁ﾝｰ此ﾋIZ7W3p撥ﾋｺ_ｱ-\ﾚ\ﾏdﾑj9n筝'氣京xﾆ吉｡J&P-Pﾔ\|IVKu{*P1ｨﾃﾆ!@ｽ)ｯ纖nﾔｵﾊ朔ｨﾞﾒgﾔｭ諚A{ﾘｽeｱｿc?ﾆ-ﾟDc.лC#Ss%5ﾜ)ｾ｡枇-ﾀlﾙｲeｰG･67	ﾘ;R嵳ﾀ!ｽs0`ﾘ-ﾀﾞｬM-ﾆﾛｲ｡ﾊｦﾂT[.ﾌｱ蠱|[>ﾔﾛ\ｰﾞVWﾛFﾂ攜Qｰﾓ6ﾘﾆﾀm,ｫｰﾘcﾘio荼夏V麦ｭ蛮dﾑ#PKw\ﾂoｯ9PKma5#antlr/DiagnosticCodeGenerator.classｽZ	xTﾕ?郛$s<ｶ	a_-$aPﾂ"D$烽謎%厠ﾄ	!Zｷ関jﾕZWｰ.ﾕ*Vﾛ*
Qｴ-ZｵｵｭVｫuoﾕjkｫｭ9ｽ7&3｡/ﾟ.迸wﾎｽ=ｽ@ｹqLﾎﾃｭ8ﾃha､r蜜<:d`ﾘ課葭蠹ﾒﾗ]&"輯x埔.g燎x鳴oﾊｳﾂ朶ﾃﾜﾏ到o鈬xﾂH繞"yｻX痍%B黠vｩｼ]妄/羅ｮPx･4_･pg>ﾂｫ~_~_#?ｮ壁u>ｼｾf畄?7ﾈ紮?蚤7)ｼ9w-
$o壁u
o鳶ﾓX蓼,S碪vyﾜ!?ﾈ;ﾞ･pｯ0ｳｯ{n(ﾜｯ^况淞)ｼ_2漓咀青>｢Q?W>ｦqK>眦'8|J皹ｯﾗｧF&V碌ﾒ3,&|\>ｴ瑪
_(ﾀCE陳|U疚｢憑+|]ｾ｡MT鳴ｷｾ｣])|??ﾀ?ﾉV｡H睇
"ｯ(ｴ漣ｫﾂｿ)L矚Cﾖ<ｿﾀ*猟/}閉ｯr"TD褐|ﾊa:Eｹ這ｷﾈ綏yp/^-縮蠱-,((*Td*h｢A+｢ﾈｯｨHﾑﾐ*ｦa恰ｳd4BﾑHE｣i4朔ﾑﾘﾇﾞF緝|ｷMﾈｧ4Iﾑ!2+絹(坎hｫ襖+*)璋2ｽTQ劼rE3ﾍR4[ﾑEﾊｰｹﾒ=Oﾑ|E):\ﾑEJﾟ"y,VｴDﾑ竃嬉閉ﾗ26-緑巻LZｩh覆ﾕ巻)
G)ｪQTｫhM朖u関ﾊ:Gﾐ:ｪWﾔ ?ﾖg
ｽ
6*:Fﾑ&E[@ﾇﾑl:A[舍｢｢ [ﾙ菰､ｨY則ｨEQｫ｢6E!E')ﾚｪ(,ｶ|JQｻ｢阿ｨ｢E'+窗>竓BｫSﾑ6E]憾+鷏t瓦S}｣･;M+:Sty柾ｾｩ鑞E;q撻鐔-E)ｶ｢] *森ｦ9ﾔ"ｺXﾑw]｢閔.便ﾋ|tｹ｢+]ｩ隱ﾚIｻ]ｭ顯ｬ殻
鏤bﾇｸ^ﾑﾝPH7ﾒEｷ7)ｺYﾑnﾝ筌!聨船ｰ)jZｳ嗅ｬmVｫ4GC替kｺﾎｰ邯ﾍy毅善b	1m懷ﾑfaPM(bｭ駘oｴb
ﾁﾆ0ｷｭVaﾄｴ啻$赦ｬdﾑHUﾘjｷ"怨2stｲ+慍b疏"ｴﾍZ6mﾕｽ｣ﾜ^ﾝTiNv.oﾆjB<=ﾎJZﾗ#ｭ鵡wｸﾛﾋYｱUｱ`{{0ｦ{
ｪｶ7Yﾂ(;ﾒVｱ鹵ｵﾑｻ､XkΤx:堺4ﾑﾙ:ｫﾅｻxｷｯ>ﾅfr>ﾆﾑﾝjE2X圃扼}Xｲ3fYﾙ詠ﾇﾆ`xk:ﾇI｢C礦ｦ`ｬ9鴨ｭXｴｯﾘﾆl=ﾏﾒ[ペﾏlﾗ1菅萌ﾛﾛ｣v+VFﾃ疉Wｽ氷拷笨ｮ｡^eｦﾖﾍｫｭ`ｳC(踟喇tkｰl嗇癨Q怒ﾖXﾛZ>)苹背ｵﾆhﾘvQﾟ隊x蒋停jﾓ4ｺ;$Zｧｫ6	ｶZｶﾆｭV｢ｲｾa9$aﾙｾpｨ;ｼ疫a駱珂ｵwgn濱Q杠sRp[pf敖qﾜY殺+ﾑｳﾎﾗ6Yｸ岻ｫ)ﾛ｢ｳuﾓ2ｧUgX$-ﾂbﾁHｼ:ﾒﾍｾd~{ｰCｼｰ5ｹ8爺燉娵ｯﾚ+isﾛtﾑﾎX瞳2$ｳ"l好tZｫｬkｶ\婢M恟凅8.`ﾙ惹>VO{0ﾁﾞmﾒｭt姜?ｦ滲隗&ﾝNwh終wﾒ]>ﾚkﾒ>1駭ｺ!ﾍ0&ｧ{Mｺ淳fﾒ4!zﾘ､GxYz梅｣_tzX坎｡ﾋhｴ栄ﾀ看｢ｱxｹI肖&悌`ﾊ,到爭ﾜ１､ﾕ莞ｬｮKB唔OﾒS>肘ｿT褪ｺ5到ｲｿ｡ﾟ奐;z慯ｳ>%ﾑ法0ﾍ：ｱ5~Vｴｴ履=oﾒ"ﾙ偶ﾂﾜ挫XШｯ4ｴ笙ﾜ宇ﾊ-h蹲"ﾆ0ｱ2VﾔMm&V6'#+ﾑﾋ&ｽ"ﾌ谺ｩk`F_雰_FOｿe=u各--	ｪ46Z眷&ｽN0
z♭ﾞEｼ痾莱	ﾊVjo咆ｶﾐ･r訳y+p
ﾋ做.ｽiﾒ{ﾂﾋﾂﾕ'L垪ﾙ7G部t~	ｸﾈｰ攫aｹｭ3ﾐ
ﾁ+4Z-険．hｶ堋AY欠ｰ%ｺﾙaM象胝
>｢殉>ｲgI孛Ygﾈｦ>tﾄMAﾆ帶ﾀTF筰 ﾓﾎF{S徊ﾒｧｲ
Meｧ暄懾ﾘ-懾zﾁvK橿xﾂｲ6+nｎDvWｰ8ｷ"[ﾀ%ﾅﾛｲｺR>6駮bｷ;3涌[ﾝ瞑魁ﾘﾎｳq卮ﾒE4;:s#ﾌg.yYI?26ﾞgJ稜gﾎc=,ｩ決
;瓠｣Iﾕ邸Wｴ3ﾜﾌrkﾇ峩X.eу型QﾖtB
&両Cﾅｫ4詳Zｲﾝ%靴Xﾔg$3!ｫｶk躁.應ﾁﾖ`(Oh粽ﾚﾂﾁtcﾃE｢	誘ﾚX･□ﾍ麈ｽIw(ﾒ講Dm6ｴ8ﾚﾒzE?駐gx=ｬﾏ.ｨ4lｴﾗNYｪ#ｻﾏ､ｿ&>梁｡ﾌ}-ｧjﾍﾄM嫩3ﾘ侍ｹr､鍖ﾆ｣ｾﾅI_iPh昇ﾕオ_Sｯﾉeｱ\^%3ﾀ4PXoClﾝ坎ｲｺueｵuｪﾓﾊﾋﾋｧﾏｰQ貯xﾑ4孝ｬｲhｬｬ]0｢4朋ﾁ\xiﾛﾘﾍﾈ.,ﾚ%kXZｿ%[ｹNﾄzﾀﾙﾗrﾆl;92q&ml
gJlx覗ﾛsｇDｧﾋ旒3ﾓﾈa7r<冷&ﾎ#ｦ/$ｱｵ
#,N5
%]ｹ+ﾖﾚ)5v\7懾4!W>Us)6;6Sｶﾑ.dｲ蟇ｵbmﾁ塰1｡xｼﾃmlTtm蝎ﾌ=9JYｯ,ｴﾚ↑於妲＿3Lﾓ 竚ｯ諦､Bｹ%mｸ2ｵｯmA｡ﾌ&:c9\0'ｶ光瑠姓ﾎc嫂*ﾙ披､配ﾝ;儼ﾊｺf+KｬU/c-癸ﾜ暑&_ﾕｸ)+咆ﾐ尅zR7ｻｿwC販ｻ8ｦa徘命嫩ﾊｶN竜Eｦ1TWF6ﾔnｮZWﾗ?ﾖ#ﾌKﾇﾚSxｻp&瑳左>c亙7Fｰｳe=ﾈ#Mc1ﾂ4FcX0ﾞﾚ社ﾈuﾂuqｼｱｦ1N;wu$膩2肓_ｦﾏy略ﾗ#YJv?)qﾂｾ(ｷｺﾎJ悵h&#E､Tｫ)ぎv"aﾓ倭L4巧ﾆ!\%ﾕ&
dKmﾏﾜC%NVsｨ洩ﾔｲj･\瑚ｪSﾃ8~4NDDsx酎ｮiﾘ:乳pﾝﾞN:ﾒｹ*ｬcｱｮP+N蒡i5阪~z地"(!^ｽ'eｨ志hﾓ,V,@+'ｰYｹflRMﾌﾙp(nｵｳx5ﾁ､斡ｱNﾋ擧憑ﾞOНqsｭ0)ﾘf･0BU8Uｖﾕ\ﾐG[Cﾝｼg案ﾇ&将ﾋ@cｨ5ﾋ枉lﾀVｷｰiｯ冓ｴﾄ跌ﾐﾃ塰O3譖ﾆaﾆ&VNﾙXM｣ﾗ#:b｡mｬSﾓX(袂"ｩ｢｡]ﾟ	FゃnFbﾓ.Jbis葭｣Hｦ2:0-Tn風
ﾘhtkg;C艶洌ｷｻVﾐﾝ
Xﾘﾚ叱3
mｳb畫ｫ裝Wl)ﾐﾗ賦Kｧ呪ｽｻmz危ﾔ牒ｽねﾂｵﾎF5G豌ﾒtySﾁoﾃ5ｻｮｨ搗TAX僞{`Wﾐ[駟ｹｺl!晨ｧｭyﾆ9RｰB1､ﾄo!)
儂ｴ3ﾂZﾐWTk鈿oz｣\J｡9ﾐhｶﾝ9ﾊ
4wﾂ+ｹ5c=~X+ﾊｵｽﾆFｾm+儡ﾞgﾆｬｦg+鰛ﾁﾑ羊Uj%+ｪﾊ&(ｩr衛ﾐ:ｻﾖﾔ羔tﾑ珮Nﾁ楴bｵﾜA1砂ﾜｼOC愎嘉ァlCM^榑V｡XNOxﾙｨH｣坎j=d悃V[ﾜVｰО"ﾖd肘$双Y)ｩS｢ﾉﾑ1g\o\jｫ餉ﾓｨ､2ﾎ#頬;鴣69eq]ﾚ6z1disﾛ\kﾜ践wD#ﾍﾚﾒjf;ﾆ蓁ｯﾉ苜ﾆ=)ﾕTｭｦ`ｧ:|r､cｻ0o挽Iﾕｸ)Bｧ9ﾚﾉ]vrg盤ﾍ9H(ｮﾃrﾅ-ﾓ_6$%引ｼTﾀv*lﾓ7ﾈ援ｰOｱﾁｭｸﾕﾔ'l>ンhｭ臉I\k:浤ﾖ46ﾖ![/詒E澣:斌閊ﾓh0ﾖ嵌c#ｷH飄ﾓﾘ:ｶs+<､ﾓ:ﾉ{ﾀ蠖邂1ﾙ,ﾗk4$Sﾆ8CVhН;翰aqｽLﾆﾄｸｬ､5ﾝﾉ:su0ﾞｦｺｧ鯱<ﾑｲ7*sｺgj夫,ｽｯ菲ﾅY;8D9?ﾊm_U抽1mf伺ﾉWN｣\ﾐyｯfObﾃ餓n詛矇{劒ｭ辺ｷPn椚D欸ﾏn)N'ｱI>6ｭﾝｾｪﾗｩﾕ剳>izｲrｱﾝﾛ不J3yｱ
ｳｩ_<ｦ心xG0"[ﾄ,]ﾂ0盪ｾa粱ｸｨ肬?fuDc$ｾ"肺ﾉ$ﾛｳ]mHnﾚｵ;陥[Efｮｾ>ﾋ66+k!ﾛE峪Eu|W倚rﾘﾕ穩<ｬ鬟C蚕指ﾖ}Jﾀ讀2ﾙｹ瑣h#b狭ﾛB蓐;屠>ﾂ｢貿3@F党{$ﾞ寤ｺ@矢ﾟｩｫﾇ-Iﾋ･ｺﾑj
9j1巍ﾊﾎ+g!kわUCRﾆrGY%Cﾚ棒狂2ﾐｳ~FY:ｽiｲ/2ｧ/O(:sｭｰｶ1ｲah@S'迢H｢ﾎﾙt3n`s\苞yz~鷦-ﾑ~ｫｰbZ,Iﾔ齠遊aﾈﾟrﾜ誼通ﾐ`S-ﾎQ};:Bﾍﾅy鵆ﾀ ﾄ膾'w鼡匐xu0M愕(区協p4n艝94ﾛ'!ｬD0ﾆbﾛ_'ｵﾒ氈ｳﾜ刪/+ｩ+ﾇ#搭(_碚rd\ﾛsｴib#ﾘ%ｨkｨ|ｦ鄒場ﾋ穂]yﾆG+ﾉﾃｯ>ﾟｫ	IWﾇ崋8*5vｴ･
`Hﾆｰｶdﾃ褒P>$dvﾁ箙1ﾋｪw麌Aﾁiﾓﾄﾎｰ'積+WﾅfｱL珠k<+ﾏｦgrﾍ粽g*Cｳ}･"\HZ｣ｿﾝ誨
ﾏV+jj6J讖ﾎ>ﾆ"ﾑｳﾝﾜﾎ:IﾁF,ﾟ6p陛籀'%ﾉc%ﾞ宸Mr?6ﾋｲ4qﾗ	ｹ堪鼈ﾂｲﾒﾀ>}'ﾏ6覿ﾄｫMBY睦惓6ｸﾕJEMｺ皿~Wdﾇt}ﾟ｢籬 UQ梗ｩ[ｮ絖yAｽ裹(_ﾂV､U8qFMﾋFsOhN篶G｡ｴ｡匂F
ﾊﾝﾆ18螽oq:ｬ'ﾋﾆ｡ﾉM$゛vP$Ｏ蠱RﾘMCﾓf=絅hｻ搴6D宸狛畫結ｨ	IYﾏ
ﾞKw隙0◆BoI釣_録Nﾉ^ﾕ53CﾂNXﾂ/〆[ﾊﾝz``iI締ﾒ0丐ｴ/}RﾞC{xw6ｹaLｮｶﾔ!7ｮﾔ!7|Mﾙ~ｰｫﾝ調ｹｻﾝ\ﾄﾈﾘ｣h	Oｳ`#ﾉ隊軾	ﾂ
･0fﾂ佛ｿfﾃ<`>,ﾃﾃfXMpｴﾃRﾘﾆ:V3･呆MX@ｵGﾅｬo#g1;!o7九ﾛ絆ｸa|Rﾊk5ﾕAﾔﾃ`hｰA纏齔鹽EBｲﾄ?｡&僕ﾚ途Nﾜ笛f.{/LﾞSX｡S	詔%i2;ｧﾛc孳ljｹ)l1 守薇b8&AｦB#尿3ﾌA鞠｡ﾒaa､ｦ"透Uﾕﾃ9ﾃｺ楼ｶｼﾄﾏﾖﾇ槻ﾘ)ｰ1ﾋDrﾏfｱVｳﾘｭf鉚ﾀ｡ﾒﾆz`ｮﾏｩ&ぴJﾈc%刈Fﾃ)ﾜ~*y垳0ｱﾜab崚ﾄ壻ﾙKﾎ
w9ar｡痢Ecﾖ9ｬｯsﾙ蹉-|[ｰHx0rﾙ､<滑ﾅ
暁\K舒豫錫ｷ;aｩｻNe曳Xﾖﾋｱb
ｱ{柴eｬﾐｬM,W鱸ﾊt邁cUｬNｶ#枇ｫh=ﾓ裲ﾈ4ｮG%ﾖﾈﾏZw降ﾖe[pｭ^hろ<3ｳA?ﾗﾜｨ淺韈ｦtｺ囁ﾍﾉ`_ｱkﾊ縋ｾ_W代
32ｧｶO熈ﾘﾒ'ﾚｽﾟﾋWPﾖ驕F旅ｦ蛍BsXﾉ･'ｸKｷｬ)ﾛｭｶ黨K讀ﾝｽｯziﾛｷﾊs/,｝	:3Rｮ{8ｾ疹"恚a-|ﾖﾃ･4Wp`臍ﾜ'ﾁﾕﾐﾟgｿZq\7ﾛ昨4ﾜﾏﾁnxn7澀'ｸｾﾛﾐc>ﾜ祉,=8ﾄ	pNｽXP鞦p7ﾌ~<
ﾅｸOﾑp+<梁#x5(3｣ﾚ1Z|ｬ兀eG*ﾍ`~姨鯔4､2H;ｫ ﾝ譎ﾙaｲ=2-[vｱГｱEﾃ漁ﾁｰﾝｳBw淆Hr+ﾀ_9&>纔;ﾇﾄ_ﾂ&閻-徨,Dﾘ晧虍c\飴p)*ﾘﾉ夥炸ｯｲｿャ痂8ｾF?訌10古qMﾆﾑX残ｸ8ﾇﾀ*怙kﾜﾌ='lﾁiﾆﾃRﾆ2<扁ｧjﾛ潁Eﾛ1,岩ﾔqJ慳jｨMvJ9ﾅ孕N;牾鴕ﾓﾄ使$ｷ憺ﾍLgﾙ｣ﾎ等J@'ﾘo糅p椌Zﾑｿﾃ踪ﾌ抜ｭvｱYｲ
>79x章萠ﾒｽｭｽpﾞcｰ%9瞻	''ﾖ3aｸ`要Lﾚ･ﾎdｯｬﾟLｾ09ﾙ耗ﾑc橢{ﾆ7ﾅ]ﾒ_6sBｸｴ搦ﾃ,Fｶ:.B7ｰm:p	l",ｮPｮgｴｻnﾆ｡浚~ﾕkFｿ邁桝j
"ﾖｳ74滷ﾜ5xnﾅﾍﾚﾊﾕj5:eﾅ%N=ﾛH庸)g.ｷ|ﾅx"臑b#cﾌd茉vﾉudｿeﾌe6鰺=eﾌ^亮2Ks蠱ﾋﾃl2限*Z8ﾆ繦遂酖ｼﾖ礒ｰ椨皿xc蛹W0ﾆ_ﾉcNﾆ]佼ﾗ0ﾆ_ﾋﾆ縊d!cM佼73ﾆf諺16ﾆ3ﾂﾟﾎH~｣ﾆｻﾘ1ﾆ0ﾆg諺1>ﾆ`1ﾆG`ﾇ	78NX^籬-岱ｷdDｷ嬋{拳qv_ﾂT|張)ｽF]f]｣ψEｷ&｢ﾛｲﾕE?ﾎｬ愚wｼ30歹ｸy&碯ﾌﾀﾌﾀK0_讓{｣Uﾈ聡ﾊfﾚﾝM'ﾇOj9et篋ｿ!尺ﾝｽ疇@Rwﾚ*ﾘ｣ｽ.･ﾇ￥_ﾀL|戯y肉鴆ﾀx|覧泓^涙.st-I.ｯ薮ﾚﾐr揖:
>+Lﾀﾏ@ﾐﾜ｡G;ﾙ桙ｹ柘@Oﾎ猴ﾙ
9oｨNWｴﾅO髢<膺IWFﾜｷ~&河ｿt
,*?炉ﾂX2ﾖYrﾆX朷32uZ遡ﾇﾉﾘ拜鑓bｧﾚ-&'ｹﾅa釦lo^N?
ﾍ醵t&e状唯就｡g咥漣c(iｾ~ｵﾃﾀﾝ_ｺ栓$<ｰyg<ﾝ捺>ﾏﾃ<~
`/gﾟ蓮S荏6o9覺,･8ｬ-ﾈｱTﾍｼ
9Cｊ,ﾞ慈Gﾅp1項ﾋi$､Qp劫[h<w▲c'cｾ妥ﾉ;｡ﾄGｧｬ}kﾛﾗC｡｣ﾕﾅ9Kﾆ嫉Q渣ｽ1vNENﾉ亞篌ﾏ危ｾ傭ｴ
厶v(｢研(犬添1廊抉F]0慮ﾃ"麈GbG<蛭篤ｴ;ﾆZ固^D俯A┨┤.Oｻaﾄﾝz蓁5;詔ｼNp|d,ｧヘ霤RUE渉ﾑsﾅ_p`o}vﾐ/"zｮ｢ｧ.
ﾜCﾏﾀ,ｼLﾏﾁ<ｼG/ﾀｧ
|Aｯ｢AｯcｽC鑪,･q6淋愴>ﾂ嘗ﾏp}ﾎｩｴ陝･%ｯ|ﾎ';
ﾄ'
ﾂｸ5#ﾟ5rﾃ
{鋼ﾊ3ﾒc
5ﾓ8cM2Tfﾓaﾆ0:ﾖﾎP} ﾊｧﾊ%"ﾑ qt'匙ﾜ罌ﾀレ4&0ｭp郷ﾁﾃuｺ~ﾐwo7c?歯;Nw
^ﾃｲ角ｼ/`嫣尨
LrBｭoﾉﾘR飫ﾇjo=Dﾀ功朷ﾛGﾕc読ﾔﾄ櫞sﾈﾉ･6@1f
ﾌ0ｦﾂzc:l6Jc4ｳaｫ1bﾆ｡ﾐmﾌ3酵pｾq8\b,ｫ
ｸﾉXｷ金~ﾊｨ迯e啣o+痾cUﾚ>錺:V帙\k巷YSﾁiｶﾎHｿ!2jFg｡<[ﾈ鞴餒LaIv
l&lv0;ﾚﾔ4｣ｸ脛律QﾜqFﾖq2｢ﾛ愿ｻm6ｸﾃｧj~Nﾙ^d,ｭﾈ敕#ｶU紗Ru愼PS'｣ﾎhw
ｴ#ﾄ)笠襠qｱG弥f盤0患ｵG餒ﾛ萄WﾓﾍiｾN3ﾃuNﾙｻﾎeﾙXJﾒﾇﾐCﾓ6ｧ1ﾃz奄aｦ!F]ｰﾀ閹JXe
Gﾟ哉^gＦmﾆ7!j
敞8ﾕ8N7ｾ鄰.ﾘg\ｱk數ｮ=xﾖｸ^6.cﾗｺ>0ｮО賢x蜷XOPKWSｪﾔ2$6MPKma5 antlr/DocBookCodeGenerator.classｵ:	xTﾕﾕ釛囘ﾞL^Hｶ0YPBI@$ｨ2yI&3afﾂﾒZｵｶVｭｵUｱuﾃkm赫ｷnﾅ･ｵ(ﾕｺWｭKﾒﾖｺﾒs{ｳfPg;ﾜsﾏ~ﾏｽ淳uﾇ=P)\9痃ﾌg0っHｺ]親｢G9pｴﾌsﾁXﾀ`撃c3NﾁBﾇ+8Aﾁ"F3乖$^ｧ9q2椋p
Nﾍﾁi8效娘`<ﾎd濛ｪ2膨ｕu,擯.<ﾒ鋭pｮ(8哦ｬrｬVｰkｹ醒"俯b訐ｯ`skdｰﾑK,cﾂ&ﾋ戰ｵGﾍ
ｶ(ﾘﾊｫﾚ\ﾉｨcxrﾛqｪ;弃症*ｸ墸蓚綵ｸﾗ*ｸNﾁx｣Nt窘<謁
v1ﾆｧ`ｷｆ{p.Ε旙琴j旙ﾇｸ>ﾖHAｿﾜｨ`ﾀta4ﾚ菎ｰ#ｦｩ｢N
:q3naｱｶ*ｸﾍEﾛﾜ｡猖ｼﾟ)
棯瀛,w戉]<=ｿg逋<}魔ﾟWl@ﾁ2ｧAﾏQG
椨炸
椡熄ｼ@ﾁ(x｡?Ug
^､倏
^｢潘/U
Bﾁﾋ彭ﾔﾋｼｯT*w)xｵべ(xｭべ)ｸ[ﾁ･7ｰ&ｿr瘢kﾃ7ﾙN;twｳ{ﾜｫ瀰ﾜｧ-
ｹVｼﾍEｾ效T.ﾀﾝlﾜ{;U>WF<ｨ瑜囘!VU
1ﾃ?ｱgрO*狽O+O=ﾋ=狢|rPﾁ?;I\"Eﾁ|YﾁWrU|削ｺＰ(Wｾ鯊ｷﾜ僧ﾁｨ釧}+ﾃFwｳｱﾙ `Bnwﾈm6ｶｮﾂｭEﾙG｢｣ﾟF宸u(Bﾎ@ﾘﾘL#ﾆ"経ﾖτ@ﾘK#ﾔ｣ﾍEｾ!ｻﾚGkl･3W#ﾘCﾝB~ｳ?hｴwｽ+@ﾗｲ事貳ONO/mﾞoﾖｽ=ﾘm醇Iｨ3｣hﾕ1Γｨｱ$nｦz ﾂｸﾒ8､`(塘7蘖:\ﾒﾅ＄o｣尓ｨﾆ`wﾒ籀d}nﾓr=髄5ﾏｯ"堺ﾙｱｱY2ｭ^ﾖｰ徠5n,(匳0Fﾖ4ﾚﾂ-｡p稚qｵV瓸*醸2ﾚ*｣'y蹣ｱ9ﾓd$/害t6ﾁa｢衆扼>&>6故Li｢SlL8ﾎｴﾓ頽鱆;ｮ5ﾂ｡t3d棟e舎潭I賎｡PPｮ"ﾋbI(mi7｢*l%kjtｲ帑ﾓ冠Fﾐ}aﾅa#'C'qXf鞏F｡ﾆﾍ｡ﾐFｽｦRΤﾃﾖn*ﾍｴ[｣ﾒd蔚ｲｼﾛｻB3活｢}[正9)ﾘ,LB/fﾔ｡)ﾙsyﾄﾜ;ｶ
p｢舟rﾔ{
ﾓUﾂ!汚ﾙD2ｶ>ｿ0wｧ･mrｵi郎Srｲ#ｬ#Mﾁ霸讀vﾑｺ囚ｰ｡G
却dLBｹﾒ人"^@ﾀｻ埓B睥ｬ貮VYﾑW
grYｦｵﾎ~}ﾃ揖KM%/*)4駐9p嫦謇{ﾟtb{h03鑓ﾙﾓ
!ﾟb壽r)CQ'+匍
ﾏﾃA桷ｧTx朮Bﾖtｽ`♀ﾇP哺ﾟD瞥)ｳ慈O@TF%ﾑ*~ﾑQｩ簓OKﾅ'所溪g\ﾅ/KｿﾂCo)^PT =Мﾘ"Kﾙ%菓ｸﾕ%魘AC究4##分pa乃ﾂ6ｵﾅｫｦ*慊*>qUｨIuｪ*r｢<賊ﾂ愚Bi1B#E>お$柤｣鷲ｴ(3ﾍ23oｯ1bｬ*ﾆｱY舞ﾞ*
决ｼ丐"Qｬ渇lｰ度Bcf添ﾊﾕzXｯm0z#ｵP犲ｯ措ﾋｵ-}~_滓宿ｺH)TQﾂｻ)遍^ｹ^ﾏ咬1ﾕ!ｦ!粂ﾏ{ULgM\ﾁX｡PﾅQｪﾂ･CﾌT辻et4eh@"$ﾑｨﾏXｼﾉ｢L螫Vｨ､唸7j形wM
/ｱUE	史/緻ﾂｳb68Aﾋｴs燃*ｱｽｨ$8Rsﾄ\乂乾#UﾍQ]栴@v飲*2ｿﾛｲ>+dｱﾞdｦﾄh捉s闇ｪｨ
ﾑｨ%bｩ*鵬DsH欒禳J&hｧZv}Aｽﾟ [$ﾆｱﾙPｴ緒A9S諜唾ﾘ\lDm､慯{zｿﾎｱ@ｸ<ﾍDvw驗!ﾄhaﾓ!Eｫﾍ_吊D{n堕.G｢bj萇ﾄﾑ(;ﾐ\ｹﾈ
R｢:ｶｲﾞ靹ｺｶiﾕ2ﾈﾃ★沈htﾊﾝｲeKe]kGｪﾊPｸﾗ[R+ﾇﾕ^IH岱ﾄI鐡F=甕?erF苹%ｶﾁ洸ﾒj`ｰｫ广&Uc#:ﾙ"]蘇tT4-ｦNfb行･ｮ	ｲ徊o諜旌ｾ>}ﾊ偵cﾞVﾅ
ﾑ-ｪh蜥嶮RﾗQｿｬｱ]ｫknVEﾅｰX)治J襄x4ﾙｮj
｣ｩT!,ﾓ<墮ﾑgXe-u朏ﾟ/g景=聖Ok)+ｺｹ$pｳﾒﾄｬL6ｼ8RｩiMQ-hﾍ6広｡恣%Eｳxｦuqiﾐｶ｣}ｳ裡SuMﾞﾃｪﾋ犲ｮSUｳi/+ｮ，ｬREｻ陟C稔ｱ\８ﾃｿｨﾄﾑｾ､劾.寡ﾁ略Xﾃﾋ&ﾏ>ｾ鏐ｮQ直T1[ﾍﾏ%Sｬｨ磁#Vﾅ:q<阜*'uｫ4證ﾚﾉZ窟	戰%ZEﾌkoﾂｽﾓT{OPﾅ噂9ﾗｳ'q{ﾈRｯ侫8ｻﾀｬｾ:ﾈY(鍔ﾒPT28ﾘﾏ
ｰｶYD俣ｾP腕p 卜Y扞ｦｺS}#ｶ-.ｴ.Labﾞ:"蜥K例ﾓIs7:｢yﾄw嶷ｧ;Γ4Vﾖﾅ萼"[ﾜﾝtろ｢K>Aa4"ｽｿaﾗﾖh|Q35倣@辯ﾜp覬E剰u>UﾅZｾｱｦ`文ｳホ根~UE0蛞viｧﾐ…Q叭ｵ癩ﾍ%whT	聴子4^#ﾘﾋ｀Wgｺ徃ｲ:ｲ凌ｴif=}t#ｫﾛｲﾙ-爿jﾗﾌ*ﾑPﾌぅK3ｲ]ﾊﾏY塚ﾞH!"ｶﾉ0KlzMD
 ｷ厚ﾞez､/ﾊOb
_*f /ﾌ3当6ﾊ枢ｧ-.ﾈ8AｰO条擺1ﾎﾌｻ
!勸{[ﾗJCb:"bDﾓｼｿ乂瀑GｯZIﾓ
ﾑ薔罪ｵ顫F髴｢%$]#wｽﾑ｣tU7?
2弍ｪac 屡aO2e{ｸﾃ=j振!ほ袁#ｭ;ﾈDtf滑1辧?H.｣ﾗ4W:(^ﾍQ滅ﾖEｵ"ｧﾝﾖｬKkl:?mV^肇ﾜAｷR鄭ﾇｮi剣甕/	Qｴ
F｣豬j趁S+YｦﾎｰﾟLｿ\ﾟ 兵`ﾔ\菖atv翰yB靭|_Mﾝ峯q$ﾝｸ｣FXﾊK娑l得畛KUk	ｨｩduNｫ如ｱ笆ﾃ{T瓷
_ !ｻ湖Dﾞ賀a紬||pｲ2{gﾇW吋ﾈｿｷ{{机iﾏNiﾕ.ｦ珮ﾙﾈa6版､	ﾟ藉4[･3專6､9I漑$jFｮ/ﾌ覈AI8&EmRBｳs歸
疋[g>ﾄ､J~蠅ｸｦcｫｹyc]Plﾛﾎ簓杼	{魏謌:?1ﾆﾌﾃVﾒ:&鬣&鯔3ｮﾟpkKﾚ圀ﾛ:ｹﾔ4e^>sﾘｩﾙｯo蟄ｭ;ﾘJl33ｳ|ﾔｸﾑｯ{]ｵi(ﾂpoｭヱﾆ∴?ﾀｱﾙ*ytjﾚﾁﾒ4ﾜﾖ婢ｭｬxiﾑ7ｺ4ﾊ'泙祕rf>ｴｧWｫoﾈ菘gL笙ﾌ,
ｱX｡ﾋeﾙｺﾏ'kZｶﾙﾗR>#qﾂ,
~ｧ｢'ｶ`Ti&睹|fptt祺設ﾒNY葹JFIE7rxsA[饐=ｼ
ar|ｿﾃ2ｧutspppg8b'､簽ﾒﾙﾞ瓱ｴﾃVﾍﾅ~~e坎i石ﾑP]8ｬo縋j貅ｦDｯ目帛Xｽ+｣ﾉ?ﾔh=GgzLﾉ8<v$<%GOﾃ3Yb武[觀 ｷs7ｴ｢D"LD
!fHDｾ('DｵD0Q+#M┃ｬﾀ>ﾎ3>ｳｲ!us\ﾅ0も,汀
Gﾂ%0ﾊa}5p44ﾀ|h*8ﾀzｨﾂﾀBﾘBkN:ZR\ﾇｰ･cmK:ｮ劣歳 ﾟﾁTJ;@ﾁ$_3ﾉﾗBｸV弛%ﾉｷ$[E/ﾇ掫!9ﾏﾆNモ}0fﾆ6累vB9
-$ﾔ!("ｲ!从ﾐ_x苙4ﾚCOﾜf.ﾃ!(ﾙ#｣｡QD傳UBﾁ5ﾗ単ﾈﾑ]0
／
}ﾒ< Hｦ	ﾁrﾘ$|ﾅｰ	V/?ﾙrΟ廷U詰*iﾁd刊ﾌ=eｦ&ｨ]*84ｹ箏ob|ｶ${ﾝ"kｳ藍ナ;ﾁ駲Oﾋ],ｽ
f胆ﾜd｡\rM&ｺ)ﾆﾎ｣ｽﾏ\ｸ<ﾉ
及ｽﾅ<兩3#S醴ｸ"qeｺR梁tr3+}C匪ｱﾘxﾙ%c,磽ﾟｳfzd碁OU&せｷﾀhp7ﾁ狸ｽ!,ﾝ}錵Z1o牧舞籐ﾆYEAp袗蘚+(ｯＷﾘﾇﾁｵp<ﾜHﾁw瀁ﾘｿ_Qaｻ炎ﾙ	#ｩｽJﾟｦXy#ﾗ峇｡髣皴Qﾗ!ﾞ!ﾏｿ+Wｼm9ﾈｰﾂAﾟﾞ7ﾋｿｭoe垰Eﾌ;+Z+插^T性､o檐ｬﾙGﾙｻY$S!hNWﾂLｫ｡?ﾈU牒>"W貼	tﾂgp|I+Dﾐ{0ﾀlｸx]$貘鋸ob>ｼ#
歔|…ﾒﾜｷxｱ5襟V斤ｫeZI阮ｸYﾚﾌｴkｹ
Vｲ脂ｧｴﾇ､榱qｯ漬湯踉@ﾃ"ﾈﾇI05藷a!NF!ﾇﾚ)ﾅ$籔棹%ﾕ!3佼>ｰX	ｹ80&帝ｻ_SC皿ｪ!ｫｿｶ獏0蹶Y,)吃qg株ﾇVﾄ$"q1`=Lﾀﾉ}九Kﾄqq`ﾍﾗﾈｴﾆ2ﾉ碌Vﾚ彷ｦ
oﾓ贔%ﾏﾚo<&;'F?ﾉ1鮮┳4l,lｶA+ｮＷ<:88ua7Sﾙ±p#Fa/nｻp<ﾛ	ﾜxﾌ~>ﾂQ掾ﾏA'ﾜｴ袙)Vｨ8ｬﾖWﾙS((ﾆ.ﾑ)H?kｰｺ詁ﾁﾚ&tﾂmHzAMｧ,ﾝHﾑ(崛3Sﾐ(ｭｴ糀 匝ﾕ冊a*>@ﾑ{屑a>ﾋQX縁ﾃj|ﾖ癈`獗ｰ氈(>ﾛ怏ﾏﾁ9ｴ<ｿﾀ?ﾃ.|∈e9gｹ茅｣劭ﾝﾏjo
Zｬﾜｰ鉄6%､ﾊcz|採:Lﾂ7hｿｩﾜ巖ﾞｶﾊ%	ｭJdﾌ/`;]
ｪﾇｦ醤燒ｻY驤ｬMCM,ｪｵﾅu2ｲ<ｵ
f3-ﾃﾊﾝt9｢､ｮ|ｾEｶﾙﾊ`2~Fｶ
f	s
	;,Yﾐ%
уv\ｸX苴ﾖ疫炬勃}ﾌ聳"業V	ｷIｸ拌L､ｩu鈕､Bs割ｧJx噪ﾟ択ｻ.磔$+i抓q^ｾUｩ5｢9｢`Tﾁce務fXbN|ﾄｴM7ﾔuKﾀ7,ﾕ1ﾓ6糴tﾊﾈﾎ'S泝L薊]3sｦ+ﾐ%mﾗﾊFﾋ2]ﾓｱs痩ﾄ|T'忿vﾑ5%ｱn:湮0rK挈ﾟjr-ｩ｡
5ｴUﾁｸ	L~]ﾗLi佝撃Y
qIﾃJaq@O悛 ｦﾑ-ｦw.2ﾁﾕ4uﾇ"tsｰFsH
ﾑ9b3ﾄ汕(T3$ｧ!ｪｲ+"1;/mﾉDﾛ$ﾏ7_ｰ+5D參Tﾉ.萓PKﾓsﾂ_PKma5antlr/FileCopyException.class;oﾗ>=^.f.vnvF6嵶ｼﾌ;FQ
洳ﾄｲD愼ｼt熬｢ﾌｼtkﾍ0F錮乃F~淮ｼTｿﾒﾜ､ﾔ｢斉､Wp~iQrｪ[&#｢懽*]+担J2@ｦ0ｰ0ｰ22'謨馗ｨadﾛ劔ｯeP``:h薪楳祗@哺K{;紮ｰ<;蝉喰ﾕE8l&NPKﾊ_ｼPKma5antlr/FileLineFormatter.class}堆Nﾂ@ﾏ-･R-*7ﾅ<ﾄ号тc穩ﾀ＃ﾔ綴ﾁ銓gA｢澆oﾋ_説賽ﾜ3ﾟ悳&4(8ｲ拭ﾞDﾑﾄ1!=州)(?ｬｷ<_vｼ@ｶG
びO]n滋_$ﾁ臆ﾉcOｷ｢邉b･jｭ,KnSi
.ｻ[ﾙhｦｳｴｪﾐﾗ呼ｳｨ"ﾖgb｣ﾝｮn割Tｳﾏ_`uﾇ堂/｣!ﾆｬZtﾛF
)ﾂ,ﾔ憶6xBaKjBv穂ｦ7筑･Wｹ.ﾉ{ﾆ5ﾃﾝ	ｯｩ躊ﾐkﾚ\更ｴﾜﾁ-ﾇｿA{C:L:ﾈﾎﾉﾊﾒﾚﾊﾔと:r:aﾜ･ｸ_d9均⇔'S鑢揚slｮ9^5PK8ｲMnPKma5antlr/Grammar.class標	x\Uoｳﾌﾋ臚4I嶢BZ*ﾍﾒ､Pｶｲ､iﾚ銚6｡･猴ﾌK2ﾍﾌｼ
$DDP\ﾀ綱AAｨK頁&咳D( kﾙDdｫ ｲ y&鏑_7ﾟ徭y9枹ﾏ=鄂{?ｾVｪ９橘角6	ｹ神･神	ﾙﾀｯ5&
ﾗﾊ:!ﾗｹAﾈol2*dLﾈV!7
ｹIﾈﾍBｶpKﾓﾓNﾈｭﾜﾄ>ﾘ.呑e VAAﾈﾜﾄ瑁 趙吁ﾄｽc	窰!ィﾒp;H嵩Gx,パ号ﾇ?｡甍ﾂ沐O黄ｧ9g
ﾏjｫ4<ｯ
5ｼｨ%
ｻ4D4Mﾃﾋ^ﾑw
ｯjﾗ4ｼｮ
Y歟vｻ8p1ﾞﾄ[Bﾞ燵"zｮ姥o<ｩ>?
EFﾂ菓=Sﾐ;ﾝIｳﾌ寂｣~3aﾚcﾙ
圃｣V+b.ﾋ)uﾌﾎﾎﾁ埋YoX)\fｸagH柴{ｭXRｭ3ﾎ0售N4ﾖﾜn$｣7f｡ｦ｢ｱHKw盾:Y｡ﾄ迫仗ｩ~禀ﾂ瞽a'zｩLｦLｻ5f$i1噺3ﾍﾝMﾓ懣Xデ｢儀esf･D崚C弥ｬｶﾂFｯｬ0XCNﾔJp;3ﾉ隙ｭXﾌｻ岔k^ﾍY:(Cｶiﾄ餘屑蕨L\W"=/7穰B業ﾌpｪ+2羶ｦ找ｭ0吊#	G|ｯｴﾍH4l8ﾄVP~bﾒｴﾛlﾛｲﾛ好$F翦 cﾗﾁ8隼*ｽ魎ｰ沽)g((L鋸}F*訶
Ha+7|^ｸ(嚠:ﾇ(,ｨﾛ=ｲeｧｫｹﾉｮﾛM侏S祺1r]ﾊ鏈挌Eｶﾘ&ｫｩyiGH^Ｎﾃa3}
|ﾈC7旒l+疾勘%~.ﾒ(3ｫ女2	ﾗF9gL-貪!/>nﾗwｸｷﾂﾉ`farﾎｺ	y*io｢ﾝ/0個ｸ控g|v/P["来qO箪ﾌ舷:A兇ﾉ%1D顯仁ﾍdｲﾅOﾉﾑﾓ|Uﾝ)ｧZ枦'uｾ･Aﾐﾅﾉ1ﾝQ!｢rJﾂｬｺ=ﾗQ*JfOaﾎﾞTA<.｣Bﾏ､b0ｽﾎｯｸ鏐i3頚ｷ粉ﾃｦxﾁﾄvr,ｧ緲悸｣a!ｦ>X'dT泅	MﾕSﾇ鄰]ﾅ`0|{-Qｲ￥uﾄ岱	ﾝR
鑠缶ﾓUｾ*犹M彊
UE/磑m^jﾙqﾃｿ匱ﾒpA@*op>9ｬｫb\ｪ+]戊,>ｧ綉愴J5P･ｺ*鰊Eｵ*,ｧ莨讌+qｼﾁyｵTﾒｩ5kYhﾙj#Q{Pmﾝ僥ｲVW號*
ﾗｸ樫"q.､ｺ圜U｡ｫJU･ｰｿ9襖ｫ@ﾚﾛY8旌]ﾆﾙ}fﾔ	ﾘfrﾀ寄,ﾌ俘3ﾈﾏvﾖ筧#ii&攷X[ﾍwｳｴﾏ%ﾉｬ6b)ｳｶﾏｲk}JｸQｪ%ﾆﾓ圈Y}R逹ｷ'ｸmﾒﾏ9{ﾟｻrｺﾟｵ妲ﾄｴｻyﾊﾑ睨2ｶ;WV*$9ﾄnﾖ"iﾅUﾇﾝNﾄm	ｹﾒkｷZ呶\L=ｩcﾑ坩ｫｸPWﾕｪu,ｷ鑠ｹｯﾁxﾂvｼﾄ洸fﾔｾ
SAMdBFﾓB6MWｮ羞ﾊ\ﾊｨﾕﾜｱb^H-ﾘCｬVb
刮H[ﾌLﾝIe2mﾚH兇ｳyn>ﾜ螢ｷｻhHｿeﾂ{Fﾒﾝｸﾃ3H<ｪ,ｺ#塔ﾚ紳'ﾍqD3ﾓ.D甘ﾟ`｢我	貶<ﾂｪOｪR<ﾅ桂ﾄｳｪ	ﾏｩx^ﾔ2ｼ､Vb:	ｯｨ8^U^Sﾃx]搴7ﾔxS]すﾔｼｫｮﾅ{黝ｼｯnﾆ|ｨﾄGj?ｴb%ﾘﾉﾏｬｧU栩ﾟYｻiｲﾒﾔ妛Hｽﾍ#ﾅｫq･ﾟﾊｹBｪｪ恍ｫﾆKｹ犬帆.ﾉｩﾋkｷbyｧt1ｬ陏Vﾊo赳3潅ZｵｼiｺC=<
涵ﾘﾈｫuV
ｬiｭｶ體XMﾍﾖｪ9P(V葺ﾆ猯TﾓqﾟｧVﾕ8Fﾕ]I全pPKQ43V
ﾖPKma5antlr/GrammarAnalyzer.class;oﾗ>=^vnvF??ﾗﾗ _O?ﾏOgFFOF^錮ｼ竰ﾄｼ腸ﾄ慥T踰32引{;zｸ:ｺﾄｻｸзﾄｵ0ﾋq逞%ｧｺe讀ｺ%跏&9%覽V･馥%%22ﾍﾋ)ﾒGｺ$ｭ沒琉沐伏\ﾂtﾐ｡Lﾌ,@+佗莎#9$#'佻PK､ｭｭｨｵﾝPKma5antlr/GrammarAtom.classmTmSU~.	ﾙﾍr｡!h碍B欧ｭJｰmﾆFP栄uｷLﾚﾍ..F/鶚Igtﾆ淳G9>w7ﾍ壷ﾙs}ﾎｹ<迸ｳ
`	ﾊﾂn､*njｾX+zUﾑbﾕﾄGn盡ﾅﾍ控ﾓXﾃｺ⊇Fqﾏﾄﾖ媚ﾜｷhｩ鴣kﾀB沽ﾘ2ｱm禊\`ﾘｱ嵬ﾈﾖﾛ'vﾙｱﾝﾃN犢ﾜﾃ橿i^ｻ｡~
ﾒ¶Dｹ此諸ｨ	$\妾ﾘｩ4ｶｼﾙRｫ-ｷﾜﾈ褄ｶ8~yﾓｷﾛmﾛｯｶ
ｧR+
$ﾗyL潦ｽ蟐ｭNｻｩﾝt*ｨGｼ.ｫ0u"_ 1D祺掫隈Hﾇ4｣蟷s>諳ﾍｼ(ｶｵ縉}ｵﾑﾒEdzWyK嚊ﾄxCbW$rｸ*ｱY;%0+fYｩhH|‐2ｮK|憶<蛮ﾃﾗ二｢ﾖ:)_F`ｪ譫ﾘN ｧﾕVn浅ﾂ:V$ｾﾅwﾋ:ﾗZ嫡穀※ﾄ>ﾘﾍﾟｾｿ
功5Oﾗ 0aU'Pｾkｭu/ﾊﾁ!x餬Xz!蹌ﾘｱ昴XSｶ寶ﾕ~P)>Fｩ<実hﾀ邀ﾉｬ!朶	=IﾙGGﾊeI泣F] O術2t\ｻｭ｢ﾑﾒｳﾉЫｭ{Nｧﾍ筮||費{dT千"R聒'sjgﾁ#ｩﾍUR7?ﾔ恪Psﾖﾕ酘
ｸ1猾 ﾘｯ&ﾃQ0ﾊｼ
(ｸYﾁ-
nu智ｶ)x獅ﾛｼ_ﾁｩf瓩x佻ｰｏ(ｨs璢ﾈｶ`TF}ﾞ病｣ｻﾅﾘlｰ!ｻ;ｶ[W
ﾑﾖ!語#ﾑ&ｿ0び訌?叶ﾕ66S娼Z`ﾔｮ$鷁ﾟfﾃb_榛｢ｵｶ竰5Pｷ＄ﾓm.#ﾜ｡w俄Zﾖﾑﾚﾒﾊ發笆
fｽﾒｯ{+ﾛ｣aRjaﾉp	5繼cﾐ曖ﾁﾘ箴ﾞﾄ粃ﾊﾕCﾞ荒tBlT丁み唄b
}zｸﾅGﾓuZﾑ<ｾ間2GﾇﾅFﾉ哥xiXｰq5mｬ(Y8/ﾆｶ"hｬｷﾂ	ﾚﾅｷｵRG弾ﾄｧｱ｣V=+O詩儼J｣y~献#ｴﾑS}Bpｲｱﾁｰa､J攫cｲﾆq｡>ｷWwｧ]q･!倒,｣nl_Jﾄﾑ
BA9,G%!ｿ?ｴ･ﾝ.	ﾙJﾖﾐ魯ﾋ
-辰3A#Z悟ﾇ骨4ｱI$a劭waЫｷВ>"*ﾈNｷVSi､ﾍﾘ&ｧ>YA物oｶ@WﾈoFqｴor'妣ﾚﾐ}悲ﾙﾜcﾛ9ｷﾇ%yｹUｽ*wｯｭkhzﾔ0w0'ﾆ%ｻ2ﾏ"弊@ｿｿr
}ﾂ鴣sAl
uﾑP ﾒﾍu~磁fﾚ`M@Hﾊ鴫4{B馥MｼF$b2遁ﾛ
ｯO%kｬHｳ@ｰHｿ,ｩS'JN貘m舎顎ﾟtb{h 5鑓ﾘﾓce鹽ﾓ
ｫﾂ汝
ﾃ#*<
娼p 吮ﾃ(G)NU<4<6U｡◇}欒iBF鐇ｨ3sﾊｱ｢M!	ﾗESgﾎY@{?*z｣帝*欟9ｭ穉ｷ|^ﾅﾟ|QﾅﾟT|	H＊舍/ｫx尾ｯ爿|Mﾅﾗ､bﾓV_4ﾓｺ-ﾒ継8撒ｨｾ0Znﾀｪl^Kﾟﾂｷ@7潼Yﾅw1:､ﾎW]|Sﾅ}ﾚj糾ﾅDﾉ
矚咎石/ﾋﾄｼｼﾀ週'>K6ｩ闍*~ﾌ悄狒T7~ｪ稟lｷx灌ﾀ,k9ｦﾑ鞦纃晩B=圈｡^#t.ﾓｶｼ}/｢饂dﾋﾗ#覬:X｡ﾂ;$OaC劒罨ｰｳｮ@0
ｪﾈ*ｼ9Г
;咋
Uﾔ界ｪX,ﾐS`i1喉ｴaﾛ P.y)|8c?ﾎﾐﾁ0ｺ8捶&3M3,ﾅjｧdm%｣$筒8ｷﾖ┥zﾗ溥KS粱ｱ慓	ﾍﾁ斃ﾁ晄$攪LOﾉZ{O─q寿>~98ｴ輊ｨ.ﾖｷqﾕTｲｾyｨ$K.ﾁｲｬ繁ﾃt次qj4ﾉ枋ﾒ=鄰xGdQxL>n'鑿 ｿ4Q4}6Lｽm?nlﾜvﾏ棲dﾇbAｵ S
ｱﾃXpB劇
ﾓaﾂｯ2籾蹉@^x?($ﾄﾙbｫき6ｿ`=ヰ5ﾟ枳Yt+d亮ﾕAﾈﾜ
mD(売&｡3$!ﾇ$｡ZF噪吋ｨ符Q&ﾁU嗅w⊇従S:｣鷺^#ｩ-'=+aﾌч0
a6斑50a>ｴﾁIｰNｳ`@C5l｡9蹉-IEﾜxW拓llDﾏ>ｳr	Jﾁ8抉F暃H>ﾉk-｣弘(чﾄF/ﾘy賞sOﾉｻ=ｷｲ[ｻaﾊ骰X嗇tdQﾛDRz)ｺ
ｦﾂｩ0ﾚI=攤ﾗAｬ蚪T蘭ＺO)阮lﾏZlﾓhﾌｦxJﾝ0u維%ﾀ蛹巵ｨd頁ｶﾂ\Zｺｦｧﾇ=}XpFyｬｮ4DUl+ﾉ+Vﾇ?kｳ6&dｹﾈ伐x鷸ﾋｬ陋RfE_}[>hp7Bﾓﾇ^ﾂ吊ﾇ^｢a)gｹTﾏ6d弑dQ^Lｿр2
ｴﾋ4ｸm'tﾁ財嵎/ｷﾂ]5?&xｹ匠蕾痢ｰｼHﾙ
m
ﾂ)ﾂ>傚ｭ!B甓ｷ,Mﾔ<懴;ﾋA蝣ﾏｾiｲｾ鈴1,o+黔{ﾍSNｮ沈yﾁｳvﾌｷwｳJｦ:_2ﾓﾈ･%rﾕ淙U/騰^!Wｽ晰眤;ﾐﾂｿﾃrﾄ}!ｭ咄crﾊ'4Sx>"|>C[棺^ｰﾜuｾvｫx[膿-σJJｷﾆﾍﾒ僕fｶpe<ｽ=&ｩﾈ>Uｶ%I)/tBｪPﾙﾐ#
ｧｩﾋ許.K) 8D&洞UCｸB_ﾒWﾃ丞ｳ''B6染'ﾁ$,xﾒ操'ｫO'8寛H
%ｰﾑﾒ2&ｯIﾒｲｸ*桝雁､b%"P8KJ|ﾉ8ﾗRq|\ﾅA8:ﾍ･ｨ'%ﾑJ｡ﾌﾂm
}ｹDZeﾉ'緲^'ｱﾒ&ﾕ0室 ｫ｡
A;ﾖC'6ﾁﾘ^<ｸ
ｶ緞ｸuﾘ疑x{	gｱ槁
pｧﾚｷ｢ｷ<'%ｹd9vｪ*旬]RT~d9砒4犹~8x簀G厘BG	ﾌ實ﾎ[E?呉8}ﾎ澑臻渉ﾌﾖｲ皰!庶ﾎｳﾙ･ｺｧ熊ﾊAWcoｭ癸U/｣5.7^A.ｸ*陥ﾀｼﾊ:WﾃﾜI3^{H.
[
'wｺwﾁｺR*>ｧﾎｬｲ釶ｬ#=U蚋Pp徳|専	｡@'ZoＨs3hXﾖ~ｷ
ｩ[EU*珎之ﾀh膕ﾙR鶏｡s T!XA3>I~
Nﾃｧ甅糀ﾆgHﾂkｩｦ極lBﾍﾀ>ｶ呻lｰAｫd:ﾐﾊ#MF
Lﾆﾟﾒ7r･4B"Pﾚo+zｨ｡估?C`'吾ﾞaX弦;f ｪ`ﾙ)ﾚﾍtｳC`蛋3CkｭiｱﾜD)乏&sXAEl隠ｹﾄLJ為%0桓/@6咸e2Qhﾀﾗｫ}Xｳﾘﾂ&\cｸ	?;?a2ﾔ[ｱ2將ﾑｼ｣ｼ鑷G$De;ﾀmLｩﾍ&v蔡-ｬﾚﾖﾘ&ﾛsdｻ]ｶ醋ｼﾄ'CﾑCc_IZ!&ｫｲｽ0拓kc躾ﾘﾁｲｾ楝
ﾙ~Sｶﾟ弟Eﾔ勹咋R d
ｨﾂnsE&T	,
,Nh.X%ｲ *TｸBdﾃubﾜ$r牴	Gﾄ(xFｸ畍b4ｼ ﾆﾟﾃAu[ｱ┳蓚駈笳良mﾖォ輪莉/ｻｲｬxｮｱﾗ葹yﾌ\0ｻﾊﾉ/ﾈ｣抗!ﾅ-E菘hQybLLS`ｺ蠅61ｪE14Rｹﾐｬ?ﾇQaｯ･X少ﾆV[ﾇｹ･U<;iﾅ:壕魘ﾆ蹶.pﾊﾟｩﾎｦｮSｬ,ﾘ6Hﾑh
,異d9#貭X141看IP*石Ud9dZX*AｧXgQﾟ$癬5V";ｾ#ﾛ+d{･lｯ弟ﾕﾖ｡h拈kﾂｵ-CZwｸｮ葡ｻe伐;ﾋﾜﾗ稀7ﾊNﾕｺ傳d9ﾈ)"-0^ｴﾂ$ﾑﾓﾄ*'Vﾃ"ｱD',ｧA婢kDｬｽ$畩ｪﾌｬoi}ｰ]皋ﾁｾﾇﾜｹ瀁yBﾐｯydSｺｽｹo硴$J7$B<n袍inKｭ%ﾉｪ馗Wｫ6Cﾀｾ1ﾐ｢;礒C}jﾒﾈAｲF遺ｯ,
!E｡Cl∴ﾘ
ﾛﾅ6ｪ8ｾ!ｾﾟﾁｵ稈ｸQ|nWﾂnqﾜ#ｮ竿ｩj拶ｾyﾎ跿ﾂ5t窰蒐\邸嚠+ｫｸ\&%n俄kHﾞ}~R/9ﾉ>[Z>ｾ7}L+M蛔彪蕨cC|iﾞ｡_o+{7ﾑ,ﾆﾞW贔ｩrUｷ@a<朝ｩｲﾚ>?ﾜe]pu2ﾌ･z oxﾖio屐i幢ﾈuﾗ.ﾈﾄﾜL誚'Vﾄc#9ｶ5ﾗQq ﾋ終V=9h巷ｹ[X痢ﾒｿﾔ･ﾓ(^ｫ養ﾜu(ﾂ唇&l#ﾊ聡)ﾙ>☆禊/>Z3ﾇ作ﾝaｳAｧﾍ]ｶ*:3ﾁos@ﾘｦﾀVｶﾛｲ滷
ﾗﾙr`ｯm<`sﾃ#ﾄ､m,｡弓z'syﾓｲ醂､ｶ鏐榑-ﾃｭaDﾅ~\Q,ｩxﾏ0ｨNhﾝﾎB{UﾅFU,縉	ﾗTｼB&袢伜ﾑb:ﾍ-｡ｽﾁｰ}L3ﾓﾐﾋｦj
ﾑﾁ@Pﾅ[x宦ﾑｮﾞKｸp<%ﾞ儡G}ｩｹBｦ 澄[ﾍﾑll壜凸絳ﾂoS凪ｴf\U|эU|"ﾂ観ｶﾕG央Ш4R絳I楾uﾓ`ﾘ笋M､劭q"Y20nYｦﾈ>ﾕ｣ﾅkSび@
ﾅmｽmq-ﾗ沓ﾒTkp審uAﾓ_@ﾃﾎ%|ｮ|ﾉ烱ﾜnﾅt媼Zﾖ<ｦaTq_ｩﾟｨﾟｩ81ﾍUﾊ*ﾋ1ｬﾄ从}鑢1ﾎ漉iC!%ｽ`:aO#ZMﾃｾD3低TﾑﾎcｺEﾎｴobmW[%ﾖ2
ｺU"-溽F蛎wｫl侫Rﾙ6]	ｼf鍼5nｯ^eOhA烱Waｫｳ蹈Y併pC4ﾍ哨ﾗ-DWｨｱﾆ"襯m{zﾒﾎrh!r<ﾗ5ｾｽ`k望俎居-'ﾕﾉｦｶWSzﾀi
yk0庚8K3=OS}a$ｨdFｫIl#ﾎwﾒﾈﾝ跨'J;ｷﾉｴ=恨I｢ﾇ姐a?PKSeHa>
PKma5antlr/InputBuffer.classmSQsUnv溺ﾓ･-ｴMT)*地･)｢R･KZｴ4ﾈ Pﾆﾑｦ餉ﾙ嗟ﾂf閭8	_x･/<ﾀLIgdﾆ犁ﾁ昊m*｡等s桀ﾎwｾﾝ?ﾓXﾉ`ﾎ既PﾌG>ﾎ 鋭r亰IiﾉI禊	泓纜傚.飴(汢YｰpﾉBQ!]-ﾟiｿ･zxｺVｭｶtﾀ｣ﾗｮﾟl^ｫ]ﾗ
ﾉmﾝｦ?\*{Aﾍ/:ｯ椙s=7ｸ`'o)佛ﾆ3Kｮｧｿlﾗﾗｵｳｼ^c$Uiﾔ.ｱｭﾊｬYuk5ｺｲTfUt3pyka醍M､9惹'K[蕋ｭmnｾmｲsﾂ96箴ｴﾛ莞!渊
稼Bﾔ32dxﾁ唄ｾ~閊ﾌK:愡ｿｽW骼愡ﾑh}ﾙCﾋ^ｳ\jWｫﾚ6!gc｣6ｲbﾆ0ﾊ｡{ﾔ速6ﾞﾀQl/ﾍﾆ樗_c縱|ac'mLHYA:L胸ｵ沼ﾇ┥Aｯｭo
ｧ8ｺﾏ±tｹﾞU3y追哽髫ｮk/X`Qｪﾜljﾑ"/ｾｮsﾔ綱ｧェ｡Xｾｮ7Pｿ'ｸbﾃﾜW?J~ec?{魁oC詠ｴ<Wﾎ.把ｼｼﾇﾎｧq廝)ｼﾕE>#DwVw07ｽ但,#ﾇ.2ﾍ5ｲ-團7<縊)Px'c;1鑒^ ｽｺ鏡諜c~慓ﾚA7dｧ舖ｼﾛｿ$ﾔﾋｿｧ:8ｴﾛ+ﾋ?*P臉x村-ySﾜﾅiｺ|wqｺD-9
Wr%JｰBﾜｫｼ=|/}D靴K
ﾋﾜi<顳､ﾂﾋｴ菟(鵠!!iﾔﾉu0 $Пnﾍﾜ '=Jﾞ"ﾛｯ(8ﾅw鉱沚bﾘ饒0zﾁ5Y｢ﾃﾃoｽﾆ韜Q`6f2臈ｧﾘ#ｬ6iq兔.ﾒoｦｻpBcｬw59YCﾏzlﾐ69ﾝ}ﾂgｬE滷xｦV寶!o肺!疇ﾈtﾆ62疉ﾈﾕﾜ~W?уG"H~b勝1ﾃｻﾎPK4:PKma5"antlr/JavaBlockFinishingInfo.classm積Nﾂ@ﾆｿR ﾈｿ7ｬ	<ﾆ$｢欠ﾞJYXｷd)\ﾀ2ﾎ6Dcｴﾙ~ﾓﾎ~嵋||ｾｽ陟｡#RI舶T乃返R0Sｨ3靈`ｮ\-Cﾂp<9]ﾟｳ(麦2臟\p驗|2zBwﾎﾀlwｶ'S=ﾁﾕ逡煤ｼ暄3$ﾏ<痳=プL(zめｬﾇ\ﾞ9c2ﾕﾟｾｶmｫ}ｬ･ﾋ橙ﾕｯﾉuC淆ｫ9btTｱ‐ m@Gﾆ@V堰Cﾃ｡/ｻ3zﾟﾜ
ﾑ｢･hｽйEcｳQ戟ｩｾ､yQ｣Xｳ^ﾁ,ｶAﾌｲ鬻q:霧‡B龍*ﾒ2阻ｨP*勘霜ｮｰﾅ	ｯ\f;Qｸ"57HX･ﾟ<擢ﾄk(ﾄlﾅhﾔ/PKd.ﾍcPKma5antlr/JavaCharFormatter.class控MOA~矢ｰ,ｲ,PﾄE(･ﾐｪ`＊ｯ"_4ﾑu▼粕ﾔ-ﾞKﾐPK:ｹ~PKma5antlr/JavaCodeGenerator.class菴w|Tﾕﾖ0ｼﾙu& 	Bs鑛ｱ&E圍､b!刋H囮┐bﾅﾞｻ`ｯｱ]+{ﾁ^ｯﾗz-ﾗﾞｻ^Wﾞｵ9sf&劬yﾞ滂胱ﾋﾞ銕ｺﾚｫ}ｧｸ(ﾑｿｾ淕ﾟ､-JIﾉﾛ堊袒ｽKﾉ{美Kヰﾄ腓J>ﾊOhｬO鳬3*悚ｾｲ/鵄+z圉ｾ｡ｧo鳬;z梟!ｫ諸Dｯ?ｿ/JoT{o!ﾈ珈PﾂｴpｰN A歌JhZz
ﾐS{-B0VdRIJzjﾑGYA-rh俥+hﾑ7･
#a.(駮ﾄﾊﾅ e;ｦdJﾂ4ﾘ?4S3b8-K*｡ﾅﾈ Lｷﾘ｣ｨa~ｦ#
ｩ､ﾈbj)6｢ﾄ1FhﾄX#v2bg#v1bW#ﾆｱuﾞ搨=ｨgi仁e4ﾟ楸穩ｪO{QEｽmﾄ#	:ﾃDｩrｽ膠2兒L	勧蟹R>ﾙ
#ｦqｺ3(殃D･ｳｳｵﾘ竣
ｬ腰C陋興,贄頤ｩx#ﾟPr8ﾈロ8ﾄC更dﾄb#"F,1｢革ｨﾚ葵5Fﾔｱﾔ:#3bF4ﾑhDﾍFNKm	ﾂﾍ"FOｭFｴQｾ慍ｽ+鐺･ｫ>ﾄZiﾄQAｱZmﾄ1ﾔ臾#磁ﾙ3窗#NﾖkN$ｸO2稘#N1禝#N｣ｪﾓi#ﾎ0祗#ﾎ2稷#ﾎ1秉ｪ嬶ﾄyF徙ﾄF\hﾄEF\lﾄ%Fｬ%ｭ#ｹﾔ依韃r#ｮ9ｮﾔ筱 ｼ$ｮｦ楊ｴｸﾖ壱を敢ﾞ(oｧN7q7ﾓｷﾐ齋-fﾄmAx履ﾞnﾄﾟ;査祈ｻ嫂ﾖSｲﾖﾐA3nｲ串OTvmﾊｦｸ蘭ｱ决$減?ｰ(ﾐc4綉ｻ'(y2(Ocｶmﾛfﾄ34ｳFOｱ祈ｾd萢FﾝﾈW向賊囁ｯFPｾ)ﾟBﾑ Iﾉﾛ半c莉(!艝(0蠢(yﾟﾈ向ﾐﾈ曙ﾘﾈO向|ｌl蓍F~a范F~e葫F~c$ﾊhFｾ7#､ﾅd蔆A+m/Fj與Fn膩#cFn3
恵F9Fq｣氏ｦ､Qﾊ(2ｸ^0*hTQ!｣2碕aTO｣z鋲TｶQﾘ｡ｷQｹﾘW1ｪｯQ弧3ｪｿQhﾔ ｣ｵｮWjAZF稚ｹQCiJ｢"5ﾌｨ瓸wj*59E2*櫟
*4ｪ滑My	撫A､ｨkﾔNFlﾔ.Fjﾔ8`7｣v7j｣J*3jO｣ﾊoﾔ^ﾄ'c"ﾂFmﾔ｣｡'"ﾟｨIFM6j害S載ﾗｨ
｣ｦﾑｪ群ﾓ	ﾂFﾍ4ｪﾒｨYFﾍ6j?*嫩ﾔ\｣5ﾟｨ校@pR\hﾔB｣2鸛｣1鷄｣ｵﾘｨQK謙2ｪ:ﾜQQ｣j謙5jｩQuFfﾔ2｣麒｣綱2ｪﾙｨﾃ綱1*fTｫQmF!觀Q+校Eﾋ=ﾂｨ#)?*ｨVｫ｣汰ﾔ1F/ｻgﾔ(ﾚ:ﾁｨ5F揶
Y拇ﾔﾉF拊ﾔｩF拉ﾔxE戡ﾓ枴ﾔYF拯ﾔ9F挂ﾔyF抂C_@ﾉ能dﾔﾅF]bﾔZj找ﾄﾋ2｣.ｧ愃Y]Ixｸﾊｨｫ瑳ﾆｨk瑳ﾎｨ瑳ﾁｨvF&るz2:pハ6腆ukPMﾝF聳Nｯwﾐ|wEVｺ]oﾔ｣:顧ｨﾕ=ｶM>K4ｵIｫ{ポｨﾚLﾉ}妃Oﾉ~%ﾒvAｱbA､~Y*ﾄｫｫ"-ﾕig\mi鼬+N扣ﾒeﾙｶ7=ｩk孔[ﾓﾃ,･ﾜ.s｣ｭﾛ盡p{4d･ﾘRｻ'	ﾔ､ﾜ糾ﾆ圜ｲnx$;>Iｵ8ｧ"SD,+,嚠ｼsｧ柯ﾅ嗄ﾃ`熟ｩ}aﾁ。抽ｵﾕYq4･ｩﾆ涵ｲKﾌび'Pｺg"	!敍3I
SｸぼN原V-ﾅ匸J9嘲#祭$|ensｴﾊo<ｯeU Yｮ譎diﾄE癢膿勲ｯz､鑄ﾟh､BKｸ06/C8w*ﾁ5 捷ﾖE-ﾋｹ<撤ﾄ`陝Qa
Wz,7｡ｵｩﾁﾇh~A｣bWZN3ｻj6封ﾘﾌF罩ｫ&享ｹｫ4ﾕ-ｴﾔ5ﾕmSﾑｸ5ｬ及b?_枷&^ｬ&ｴ吻ﾝﾊ_dｹ%.ﾍｦﾇ,aﾓ譁ﾅ\ﾎｱ%ｸ物ﾀ呶BZR,	t[ｷg<ﾆ#笶ﾖueｰ櫑汲tvﾋ鮓!ﾍ2ﾒ儂皈k[ﾗ:｣ｩiYd)ﾒQO2ｧ写?(ｮw祟Pｼ､&?Oｧoﾚｻ候｢-
$*4ﾓ孝vuNﾜ}+J?9
9ﾗﾀ腔Mn~ｽ Vﾄ&74ｷｮJﾚﾔ5｢瑕7巍｣ﾕG=ｶDn4*ｫ@,Oｳ7)&ﾇｼ蓬cﾌ
ﾒｴﾆ鴨v(喙坎pnw知ﾈ.S!ｽﾎJgKu1; lk(ﾓ塲Q\*O'ｪ蛇ｮτﾉ壻ﾏﾜXqJ蟻ｬ
ﾍkjﾂ晞兪e?Tgｬｪﾙ玳ｦｶ蓑阡:ﾂr.bBｼ7~|Z委｡d.糒9*ｰ4yW蹴Rﾃｧ!Y%A叱^C､ﾁ
ｩwﾔｻ!ﾞﾌ[BE歎ﾔｿﾔTrxH}@sﾆｰN}He1,罸ﾔｴ服ﾚ隧込盲ﾓrz:/ｩ蕉ﾇ!戒4､>S殘EH}ｩｾﾂ･MF;76\ﾝ
ｷ6｣､c%!5ﾍ匙VｫB黠Ш~ﾔｧ穿Y}RVｿ ｭｧwHｪ~ｩﾟﾕﾖ穿嘱Cｫm!
ﾍU鷲#+dw覆!ﾍqdﾞﾁ7ｴ紿ｬkS1ﾋﾗﾝ!-ｵﾒZｴﾁｵ洫u0､3tﾗﾒ兒iｫｩ!"!%瞑v~Hg簸Dｿｲ ､{,ｭｳC:ｷNB:要D樶｣t?ﾚﾎ麕ﾂ蘯ﾆ豸ﾖｹｭ(ﾞKjﾛH4ﾖ沫.ﾒyｴ｡ｹiﾙ(ﾄs､蛭s!ﾝ/@(\ﾎ9ｫ 碌紛45ｵ妹2ｻS9Ar*ｪ未lkCﾊﾛﾃ#G｢ﾅSL7･ｮ%ﾖ:滝ｼｺｽｰs遯p)vﾞ!iﾈHHcUﾔVﾏkB_&ｿ'eｫlﾄb>>｣BJﾊｬ岷Bb~I/ﾂ
~?]-OﾓX槹花誌!Ch0n&o7i=ﾄｧ硬ﾊEｨhｬ式,oE｣｢､>ﾚXﾛｺﾔB林@&UｸﾁC	ｯｬ8､ﾑイ
ﾘﾈ3ﾜN桶
ﾟﾃ	ﾟΩｫｧG昂ﾗｻ,ｮuEｱN=ﾒ#芯H=*､uA_ﾇQｷAH!]ﾄ7#8`SKk佇ｴ､ｮｩ､ﾂ･'2ﾉﾆ｡^ｭ｣$n啻抂ﾘhxw穀X寫ｮﾙ徂US-J8ro頓IiOﾛﾓu鸞ﾝｴI掣`Jｫ	宝fﾌIｮﾓ	sｬm[ﾖ	7$7K偵)｣tｱﾎB芥)ｴﾈt;KｩﾛgUkｴ*Z_辺me晉q･x]ｦuﾝｔF`ﾚ"磬ﾉmG､ｴ拑ｳ､ｭﾜ.ｯｻﾆｺA]宣kﾔ擽l6w)E*|ﾗ$ｾ(!ｾ(L3注ﾉﾐ6ﾇｺｪｬ!=Z纐!ｱ#q､奇禮ﾖﾜｶ､ｾｮ*､w"ｵ水W,諂ﾖﾊﾌwﾉｽkﾛﾆﾛzｻ蘯%ｶﾃ4ｿCﾚMｳ5.rｫ｣KﾚjK&QZk}sｬ|ﾋﾎ0O｣ve6醗:｣ﾔBkkﾆqﾝr,ﾂ鰭ﾆﾂ(o4\8ﾝzｬN~'&､haﾀ[ﾟﾏﾆ)｣些:2ｾ絲/)=杁wｦF妹'&ｷCmｰ7	ｴb_ｶ苴泛~Dｳｿｳﾒ濶!=IOﾆ扣	sMl駁ｱK7沱8§Bd兌&[H擒ﾑヵSﾉ惜ﾔ｢Bｴ/nnｩ[G1RZMiwｬ$dt.ｩｲ/C､･XbqﾐzuｲI辭"9-ﾆduY衣JZ*ﾘﾐwﾓCz圉羚拇ｭﾍ@絏ﾏﾔ!~?;､gｭg3勢咳ﾋEU痕巾8<､#3H瘢ﾁﾋw,｣"｡#ﾍJｱ｢ｺ ｬ辟\4ｳ<ﾚｺｴｿ^!} ･#kﾑﾏｩ^ﾎ/)))(
ﾓea館ｫQｮ,
ﾗ!7ｨRﾆ	'ﾚﾛ&ｭ6:"ｭﾑ;ｾ|,ﾚEd
ﾂK榛例c*DＦ瞰疉},J$ﾍ糾ﾈﾝZ^’P4憑ﾚﾒfI;'M 柊ｸ{ﾓﾙｶ驟Didｶｯzvｧ#着ﾈn買ｪ{3ﾁ7壕ﾔｭGKｰ喬ﾄｲ)2V?ﾖｹjv､蛇1jZNhi禍ﾙa_竹ﾆ]@ｶ{Dｫﾉ,ﾍOﾂ:'sq佇k=ｽQVX矼W.ｳ訖ﾘm鋸ﾄ媼ﾛIﾀﾄ{Sﾟﾁ碣6kzA企新iｶ暢,柴Z=Lx$★ﾚhｫﾟu^SJg+ﾇﾒｮﾉ.ｦWﾘﾊﾄZ(椄杤;3yY蟒5vｺｬﾎVRUnﾗﾑ\M獅悄枌壇~醸ﾌｶmケL蒹m ｩqｰﾔ査ﾏ刄ﾎ奢鵙!ｽ俘[繊
渉">nl"ｦF)ｭ鱶%$ｫ4ﾚ[
ｮn桓qﾃ叢ｭﾋzVﾏU2ﾟ咒rj@!
(/ｧｰﾞ3ﾂ{ｭ7T巻#Jｰﾖtｵ陲鬣d^｡ﾙﾂ-杏免p+dHﾗYpﾊ鬟ｼｲ"J!~;_CGP8ｹvhｭｸM\6*IﾐｺWt6:_	ｯｫ8ｷｷ .PJﾃﾑﾆｪｦ6zC84ｩﾁ'ｻj┠Z?w､|;k嚀蜆ｴｿ寧ｵZ|#HﾁﾙｹuhﾎX%ｫanﾌ6~^l套k嗚$A慾Pｸﾒ-｢｣8;,ｪﾓeｺｾ{､纔｢`ﾙ皇]共d$l=ﾜﾆｦ麌xEJQC|ﾊﾅQGホp{ｵ[&RDY8R蕉至ﾁm丸ﾉ*:
7ﾙｱnj^eｹ}XW7ｼｳmｭ動>9ｭｷﾌ	t:ｮbｰｫﾕN"鋸げ=)ｶﾒ､;ﾁBI霊ﾈ#uSH7ﾃｵFﾓｨ杓4ﾎ迫斯ｦ,ﾛｸ｣ﾑ崎^錦稔p=羞{	嫩ﾁｯljﾍ咤v銜sm6黒W@ﾃｮｧ??ﾒﾇﾍ
xﾅﾕ替}ｸ跂ｸ~*xl	w AｯO@4ｨﾖ蕪揄通僊｡'浙I
!ﾉｲpﾝ$0/*"ﾛﾈvｬ;ﾋﾄ4襲S<僣5､J=g(e
Zﾉﾆ@rpﾇ4U暼ｐ>ｿ(9,#^!}
ﾉ禊)9採ﾚ~ﾝ!ｧ;ｸFk0ﾁ･TJ>
鰌	3!ｾ?ｫ､臻鋳ﾊ府PqV剞>ｶｿﾆ=ｧｳｧｩHﾋgsﾈa$健ﾓﾀ撕ｺGQI遽葵~17ｦJﾃG轆ﾔ;W汞鬚Vﾔﾓﾊ2ﾎx>夂}aH_､/f0nn6MｸﾗZWeﾉ菰uM}[S[ﾌE/Q好
飫hgpDﾇZｾ.､ﾗR$	YｮﾈqqYU@Rﾋ畷ﾄﾖ1半UKｭｩﾍm,tｹ曜ﾜﾄﾋ|Gﾇ7#njｨk%ﾛ.lｦFbｲ\B"b了qx緇*･ｻ7K｣Uﾋlｰﾚ
7哀SｳｮｶｱﾉｺHｸ､檀U､
q盾c*sﾔWｭKﾒ誓愍白ｴ｢h誘6&ﾑCﾊｱﾎ>!$ﾎ泉徙!ｿ\+!ｰ婆nﾜl3j鷸｢0ﾈ8'踏yu~ｲ棣Rqﾉ9'UL弩Q9ｵX+BJｾ9ﾄWp
F猯#G｢ｽ近刻ｭ
ﾍ艚疱3D泳.木97｢ﾗkﾑ@q[Yﾚ{ｽ罵FuL返V
粗d"ﾏAﾝ來*､ｯ"6ｾ哥ﾍ巖XUﾟD釟.$Bｭ!1$､ｯﾑﾗj}]H_OﾞｧﾓIｽwﾒ7ﾘﾐKUﾄZHｷﾓ "ﾊ1yｫ｡Lﾂ欖ｮr
M
ｶZ"ｭ髮t4<[ﾎE誓Eﾟ憾vn}{鑰6ｶL6舂ｴﾌﾛi"=ﾍｰQ驅a怩礒K｢hﾟｧﾃGｻXﾟｿ['2xﾐﾀ;w3pｰQﾚﾀ僣ｦ腿ｨﾇ5ｪ
&bﾋｩh+jm(KZﾟﾒ:<<､;ﾈ遁ｨq/ﾉ疎ﾒ幺ｽ!ｽ儺ﾜ}ｾ.朮ﾎ|ﾔｸn#tNｨ砦5｢
Zｫｬﾌｯﾝ.ｮu硫iｭ鶸ｭiEfTLｲﾐb得甘袂甅ｳ#H5H*QｲR汰ｦﾔﾕｮｲrﾂﾃCc/ﾖ
l4ｵAｭUv聢｣5[`ｱﾒﾟFl:ﾜmj"ﾝﾁGﾘe帰ｶY窺Qoｴ45/%S1RWﾟﾖE5袒ｷDﾉ亳粒ｭﾘ@L,ﾃｩﾆｫ:--.ｯEv=ｭ$戍>Wﾗ!ﾜ'w館n	ﾞ'臑)ﾌc擶韲z寒Jiﾚ$ro上Su愿ﾓnﾛﾁv%Cj;ｱV2lglｧ/nsKtE]cu｢玖~ｷｷｽ.LﾅｴｵK姨W[ﾛﾒﾝﾘR銃髄kｬN｢;eｧ｣.%rvWCaB$ﾁ芬｣ﾓ玩tｰｻ插xﾟ霸/	XｴU総g/ﾉWE嬲ﾂ騏醐0/ｨ聯Jｪ&ｴﾄM缸椒qﾙﾉﾒ酷Yd提~4､#ｪﾓ檐ﾒ壌-ﾈﾋ幀ｪQDﾖﾉ､r$`筱5ﾄ･>ﾅiUΔ穡ｼ､oﾒOﾑX･h?ｷ月C靉C詞簿凧ｦX桴ｾsA\ｶﾆ5@H?Mｮﾇﾁ3｢ﾄ欝E+"5Ek青ｭ

ﾖｮ鞅Iﾄｩ3ｿ*､%･ｧﾕ?9ｿd､Oｦ[Qｼ｣ﾕｯISｶo&Vﾇcｩ(ﾈ0t咲|茅這=Oｨ Wﾄ盍x^Bk季朿1^*,釆yｳｮ
"/ｽ紮ｱｷ鍮7慊"vﾃs厨Aｿh匸ｪiy*緩aｲ>ﾝﾏｧ;ｲﾛｸ 
曙ｰ楷ﾈ%/晒xﾜ0ghu∴L_Y
D｣eｮ$ｮｲW$]談]班ｯxｲvHｹｻｯVﾛｵ
vHB%ｶkW]ﾗﾛｳ敕橢Nk=ﾓp}:)YwpbMO|3′ﾖoｵﾋx]i%ﾓﾙﾊｺV照ｖｨgｵｵU:SB膾廻_"64｡･ｶﾍ=AQ･yｨｰg上BﾃHdCG#Uﾄ6vﾂ f暄玖0ﾊｻｬnJ朱｢'.=\";ﾌZｳpＶf善葩s焙懍ri44 供|&ｻ溥Cxｯﾏ懲ｦ(啝17ﾀ3ﾓ
ﾒeｰﾅ15ﾗbﾄ扎6{tbﾈﾃﾝ!*H綫ﾚｳAﾗﾋOjﾉ.[RHﾐ+ｭ 剰(簟fW｣|M宀ﾑ｣I:5<ﾜﾝ､mｸﾑjoZAｵ[wｭｧ壽X~<術ﾙｭ8]lﾏﾝﾄ~Rﾀﾗ=~Y71`{ﾟI箚!汗_ｫt､Yｶﾅ箇=ｫ楔sﾐFｴｦ=HKsﾏ`Tｶ處ｸ拊Tﾂ0%ｪu仞kｹ鍄蕉ｯ｣<寝G*｣ｹ舒5｡ﾚAxﾆﾒ0J啻ﾑｼ9'/1kﾖ	N0	ｫwｦﾃd曙=ｷ9L恋|ォ茂貪%Qiﾂ'	]ﾅ	RZAｧhK~8ﾟS()V徹1ﾎDKWﾈRﾐｵﾘ｣ﾏｦ~+､Iﾉｳmｾx(ﾖp{心ﾐｵ+z釦ﾜ｢
H(聟!ﾄ[ｾe0止7ﾄ謠{O3%
Qﾔ協<
)ﾞ)/Gﾙﾓ6Jｯz
ｨﾛ堡ｦﾆﾑ-TOd7楸英場ExORﾟ｢ Z6ｍRHﾈhQHｬ?｡ﾐ6Z9汨ｻ9ﾇ9ji\._箏$WMhXRWk罅)｢蕉Xﾔ
uﾐ=JﾚOjOﾗﾁﾟ､o稗ｺ4ﾘｭxｱ~{ﾄｽioﾍ 
!布?､顳-#C|｣ｿ
鴆~l&搓ﾒ?骰ｴ\ｫ酖tﾀe纔v祿ｺJkｲgｱ覦Y1N雫4cz曰晞bｰkBjｧｻ､塵{ｪﾕH逅ﾖﾆYFｼ#*ｱﾞqq挈0ﾘ=X('ﾇ\ftVGwｹ*ｭﾇﾌ`aZ;ﾟｴﾋﾏ'x
l櫻ﾐﾚWrﾑ{憙TﾟﾖﾐHｫﾝ%､ﾕｿ!uﾛ#O{ﾙJ2ﾒaﾗ器=ｿqYcﾓ
?h譫/Y|6ﾝ惚艷ｼﾂ崩ﾔK菲mﾋ*扣3ｫ脹壞ｧ､	b)j留ﾕ#MﾅH｡ﾌlｶv省ｷﾟﾑ#ﾋﾚ&sｭ鷽ｭ'ﾕ咥M:幸lsﾖ津Piﾘ"VwDﾔ~fZ⊂jAt/抵ﾓ7Jｦ･噌Cﾏ|j#Xi砦{EfItidy=憮゜ｹLKDRﾓﾕ帖ﾄ僉ﾔｳｽ>ﾕ杲6哈Aｧｭ@M≒ﾒｧ挙Q2(齬8ﾊ/闃w｣~ﾕｴ聲ﾌX?ｯﾈｶ@ｳｱSiﾒwiｺﾞ{ﾙp^
!ﾟﾕ･判_忻7｢>1ｻﾛRｷ(}(暉%.9X｣ﾋ諜W!%ﾇ/%ﾘ#j$`ｫ0粃а*Lｦ堝}ｨ$_ﾖ足=襾4O埔ﾏｩ&ﾎ4yﾑﾔﾉ蕪蹲7kN=ﾁUｱﾖ(嘔ｼｩｭﾕ&ｻｮi憩6ｮrIｭ涸e#ｬ8tﾟﾜｴ6ﾅ?AJ%ﾚoN翠鹵ﾇuAWｸ滾越]ﾟｭ椌>ﾁ%#･v50ﾉｷ,浦ｳﾆ槃ﾚ!4ｫﾐ傷ﾗ萓B4!4ﾀ[友膳D炭M^J搨簑ﾛz｡eﾗ┯ﾖｦｩ$$ZGﾉｸVｫ:ﾜ虔ﾜｩｧｲ｡kﾖL[)#4oｽI/ﾝ)蛔｡ﾎﾟ:･ｾ+ ﾋHﾜｺﾎ~|折nﾚ!温ｺ=ﾁ"ｿgｧR=b\:ﾊｵf*.ｾﾙ｢ﾗo線}b僵ﾐ:Τ､~､.ﾅ7ﾅ?"邨ｹﾈ?｡;_濺%,ﾍG1F狷ｭyJKSc>:v泱胴ｿk:
:&ﾉﾀﾗd凵d溥ﾋLnﾞ9Iﾝﾇ/xｻ寮gZ耻iざﾗ拷n3Szｹ(ｺ麿ﾕﾓ｣ｫbtW})ﾝpﾕ腑慾ﾑｷ鈴ﾐ鼠ｺ_ﾌﾚﾛ3ｭ]a(ﾒ!呎ﾋFHiｯｱﾐ搴ﾃﾛ墺鷸茘%7c$zﾘ7UE牟ﾕGZVm躙!/B5曚懼ｽｩｿP傍ﾅ､~ﾁB
EV.#Wﾟ^
Bｬﾒ} ;R{:小M#霖bΠﾟｮ{"S(ｺc筒cuｴﾆ:､ﾖ!
>~B推ﾟ 2葫ﾘvﾒﾛｹわ\歓Pf螳kHTﾛ/､|ﾔﾑ5:qｳ｢ｮ葬n4vｺｿ=`	cﾁｦｮzｻ8ﾔﾟ陜G騷E､･ﾑｪ裟I$*7{u.'ﾍWﾉﾄ敍/	ｭ$A恒?'Dz･"颪tﾜﾃ[_LH
wSw譫\+ｽ捫$b{?ｱﾐﾞ､/ﾝ｡ﾞ6aDｧﾄｻｱsｼD｣ﾞOｴvﾘｪ匏錚ﾌkｪhｬｪo｣ﾟP!y;F耶T4ﾎhjｬ]ﾐﾔBｿﾏﾒ3ｮgﾕx%hMﾍFｭｶ{gi$ｦmG0d5"M~W｡柤ﾃｸ涸[
+*jﾜｫJ\{螺nl7ﾅZcU(Iﾅﾔ%錺ﾏﾔ_ﾙ!ﾓho`z吏&F｡｣-8w炯~t"ｮ袿]2ﾓｭMIｫｫ y幗ｦ穫ｭ4rAﾔﾄH｢p吃ゎ&/&Tﾐ酘悪沐ﾟｰﾟ{ﾖUo\ｴ?ｶCfQ
ｫﾈ*Wｩ(ﾉ;:#$駻ﾖM竿ｪ"ﾍﾇYﾑ惚衵]粲ｨ
L$JｳPUON%鈿ﾉｱﾎ$椏ｦﾘｺ\髯Gｽｿ札ﾑｾﾆj(ｾR*ｲY5qﾒ梯+骰ﾟHWVｿ曦ESF#ｺ? 雪匳ﾟ5佻ｬkl錦a)X/_h/eH游bi&nｳ粭ｸ
g0\･1ｷｧ"ｻﾟ惹沁"ﾟﾊﾗ)_<ｹﾖ;ｿKc8Q5:(砿r;ﾓ肉篦滾W武Isｪ｣iH,ﾃ@滬c
=ｭA垪閼rｾﾖﾂM!蕉殤!ﾁ[CN~ｺﾋｪｨﾅｲGCｴ!	*ﾊOﾛAｹb秒
-ｵAﾓ｣=9ﾎﾗ
4及\G>E･ﾅV$`冬
'2kﾆ刑ﾈWｭHﾟ&ｭ衰ﾘ$#e人Ｊﾁｬﾚz
ｯﾄﾔﾑｲ遅'n啀Wｱ讌-+ﾘｽ8t\`夛ﾜtg舜[dｽﾃ::Y%Pﾈｬ･ﾘB｣ｺｵ"^穐ｼ媽ﾛ杏J&ｴD邵~ｽﾌ?ﾈｶF嗣ﾚ
Iﾈﾋpｮﾕ清ﾎNVCｪｵﾜ#~cﾍｰ4[x&ﾆｯｵ陀uｪﾈ櫞ﾀｬ{ｵﾙｯｭ吁*ﾄ鶚ﾋﾕ	ﾂﾎhmｯﾄｭo64束2ｧ鶯ｩﾁ俸~ｧc
ﾓ
\ﾌｪqｮ	娚7L8ｯbV%ｭi｡sS.秉Hｿ曹ｵ2ｾgﾉI?柳#gkw.再fyｲa耘Cﾌ)ｳ嶷ﾍ ﾅ
o棍XCTｾ/<^ﾁｧ耨ﾍ3}fﾒ{%ﾍ箋~X 7倫ｳ|ﾝ
ｷ^~/ｼ`/?ﾄﾋE^ｾ賂lｾﾄ{ｯ籃6循y狛 W`槁&ﾁ[eｼ耗Lm5p`楼(ﾜｬ0kkﾞp
熹Jd畴PnｽL1P(6@ﾟ3=ｴ2ﾄAoﾂｴｘﾎ!ﾂﾐA.隙0FﾀDﾘｦﾀｮ0Iﾍp泊潟yｰｰｨp=8ﾐ#1fﾐﾖXhｴx}ﾊｱ恠p0ｯｰzﾜｽ(,ﾚYｺ	ｲ$ﾈFﾆ｡◇p("ｬ疫?}N鉉伶UｶO|ｼ鯢ｼｳｶ柮dz洗v!ﾉMﾔﾒﾕｦQﾄS
筧ﾟ"殊ﾃuｶv\湮ﾀ5 p左ﾏ_ﾎCSﾟｿ\3w8ﾗゑ1ｮ〔ﾃ蝦ｺｮ_g澤"pｫl涸\ﾞ_H(n5ｾ座β-ｸ掾;ーcu潘B潘F潘ﾁSｸﾓｸﾓq｢|･7Q	ND d#h:`0XTﾟﾚ	ﾈﾁﾀXｲﾊ釛]ｰ8ｷ7ﾙ｡ﾂk|ﾊﾒC洗ｰｹGY9p)瘴oｬ#8
[ﾃ;`ﾄ犬M0誕ﾛ]aョ f1Vt@a1.廃XPｼ	
ﾅatq覗偬mOｹξ,U
2ｶr&ﾘ加:ﾄ肛ﾘ剪]ﾜ~ｯｶCｼuﾀｸ;歎-`ﾆD蠏tﾊpOﾛ｡nﾄ67C)ﾜＳ6wﾁlｸeﾄzdﾒ
P寳l7ﾃrｸﾇ{G|祉qｵH8ﾒE#@ﾒfｱV｢儒BﾜﾝHｮﾝﾗﾂ製`章Pｮ,{ﾏ(ﾇﾊﾙ{瓩ﾝ関ﾃ>kq0汕:`r;]ｧｬｩ稲ﾂ};｢ﾀ0M,ﾞﾓ6ﾃtjF･ﾛ'ﾂｦ3払bz亰

ｽﾙｧﾉ檮	6ﾚ償酘遲(ﾌ0ﾛﾌ[酘ｻdﾏﾇxｿm耻潮Hz>ﾐm樺%^ﾖﾎ,L?ｺm_Mｳ｢ﾚ$ﾗ
>興]*S桍N$aﾉ"ｬ_ﾇ鵬z#ﾀ)ﾜ嬌 桿杳9ﾘ梏}%､例;翫ﾗQJｾ⊇H淆l/澡	奎oﾘ.-ﾟｱI#ｫ─ﾘ3饗oｬ~ﾇc1ﾘj)(-｢	cｺﾁ!]旺0PoyXｱ椎ﾘ/2僕*Xｲ".fｪ性ｪ_X;-ｸ店Qノj7ﾂﾒｦ干Gｇﾇ!
90Ｒ(ﾁeﾌ$ﾎ筏LbA价2a!	KX/hfﾙｰ雁ﾂﾑｬ従ﾔjoQxbpdﾗEﾕu]T'ﾉ聢;ﾘ授ﾆｻﾇ#ﾉrtﾗKﾃ)ｰl月ｽ!ﾕｻ萬織TXﾕHXｲｼ脊ｵﾐﾋ堝UE;
O2Hｰ冑H&岐ﾘгｳ|ﾘﾁAｬbl4ｬd%ｰ嚶ｱ翊ﾏH.ﾒ&ﾟ蟲瓸祷ｵlｱ険Kp#夫ｮGC敬ﾞ宦ﾍ[Uﾜω｢ｭ庇摸翰	Aa叉ﾒ}^EﾏGcｺ搦､Nqｦ.ﾓ擁濳÷7ﾙﾜﾅA)J{`ｻ"K冤wﾀ	ｬｳｽ夬
ｱ英!kﾙｸ旦ﾀulｴc~'嬾qs,ﾚ0
ﾄ<ﾓﾅ耕"触ｭｸ易ｸ哀7ﾀ@Bﾚ1ﾞﾗyﾊ釐8ｮ"ｽQﾝ&8椒4>ﾁ5''｡ﾐkh{e湍'詑坐廰久ｧﾄeWz哨,ﾌ>jｲOｵ駟6=ﾝｦgﾘL屓eﾓｳmzN2ﾎﾏunJ慵iｲﾏｷ6ｽﾐｦﾙb嫂bﾓｵ6]gﾓKmz儁/ｷ6ｽ坦倫ｯ黴ｫ攻ｺｯﾗlAﾄｹO倣0(ﾓｵ)0!8^ｨｹﾘﾗgﾟP*ﾜｷ;爬琥R'ｷ@<壊dﾟ筑ﾋ=pkｩﾊS[@)lM@j｢ｬ->q鞋ﾂ',	>iﾓｧ竪{ﾚ0ﾏtﾀｳ鯲らﾜ遨$ｦxﾁ7Eｴ込UWOOﾖｬ{ｩﾔﾞ/z%ｨmz=ﾌ&ｻ･⊂ﾀﾃﾊﾚmO８Jｬ "vﾀｫｴﾀﾗｼ隣;熏7}ﾚｷ旁E/)ﾌ~ﾋgｼ]jｸMk!,ｧ';･ﾁｼ狹ﾚm徳g轆ﾞﾑ'M叡ｸ>n1瑜ﾒ8HG:輩yAX@ﾄ5n灌!ﾖX)QgTﾄﾖﾃE|YHRｯﾂ[u%ｾb煖Wgﾘ雍ｮ絏ﾐ>薐!1良ﾋ5判jﾀqﾐﾖ6ﾕﾀ~bs!ﾍγlﾆﾀhｴ~ﾆｱC`:[ｳﾙb佰蔓CﾑZﾆCUYﾇｰ83ﾘ疳k゜ﾐBｺし｢ｺh巍rｸΟｶcｫv|ﾈ私ﾏﾙQheｭFﾋ麌ﾘﾊ斬;vﾁ使ｽﾙ	ｬ?[ﾃﾂD6喋ﾄ館ﾉl'vﾛ屎ﾉagｱlｶ敝gｱ#ﾙﾅﾘ祿ｬｽﾓﾋﾙU
vｻ吊弘ﾙuv=貨eﾎﾎFgwv3ﾝLgｷ8U6ｧ爵饅ﾀu:ﾘf!v浹ﾝｼﾈp^e9ｿｰﾇｹﾃｶpﾃ樅ﾙIﾞ=ﾍKﾙ3|{燦ｲ錏"?┸ﾄkﾙﾋｼ⊃ﾆﾏfｯｵM~%{已ﾄﾞ盥ｳwﾟﾌ>誂ｲOｯKｾ閤%2ﾙﾗ｢/Fcﾟﾋ~ﾘ召$fｳ淒ｱWqﾛ*ﾎaﾛﾄ:ﾄU#nuｸｸﾝb#ﾅ緕ﾏ9ZﾄｯNO'[rzﾋ>Nｮ苗恠ｲﾌ/qﾋﾎrｶ3TF昵r3B萢#廝y郡$症ｧG(･vｵxﾗ鞦cｱ,)ﾟ顋:ｭｯﾍ泗ｹo旱[ｷu)>禧ﾟｻ舂[蚶瘴ﾄVA蔘;,Pﾟ｢樌osﾊ弊kB$ｳ~I舞qSｼTz絣ﾉｷ)ｶｯ郡|忻K~gp壤ﾗA1f[ｽｲka0ｾJv黴?ﾐ4ｽ3ﾐﾇmﾟ奈ｳｷ]
rZ飴8
'p喞'ｵsWA(･qsMc･ﾂ諄;8r･y(=e觝[Oｱｻﾂﾉ｡ﾒW^ｧｦ]薐C#巖_肉鼠50鳶ﾉﾋa＞ｬﾊ塘ﾋｸ
ｺ*靺ｧﾎ4gﾚg蝙}zcﾙNXｻd:ｻﾂNﾎP跪{;･0ﾕ)%ﾎx8ﾂﾙ.v&ﾀﾎ>p3wｦﾂ+ﾎｾｦS:33g|耄沱gﾋtｳ^N!;5loｧ剖8ﾐYﾆv唳ﾄ9-uZﾘ丑;ﾗYﾉ.uVｱ梨｣ﾘﾎjｧｷs3ﾚY冐譛闌wNr&9ｧ"ﾜｧ;ｳ3ﾓ揀3-憫ﾙﾅｯyv鮒v1vgｳ
x%愿Bﾝﾆ茂Xｦm盜ﾆ9ｬGﾓｬｿh^播ﾒZS7tｳ^	｣6e%ﾜ ﾖﾂ,ﾋNXﾙ9,ﾇﾍzｻYｷLﾖｧ;[ｮﾜｽ}｣8綣`蠕嗣cuｵoﾛｷo{ﾛ5O|LMAX諭Bﾋsｳﾉk體b懈ｰJ婿ｲｰ`[>(!YRｦd邁ﾁ]ｬﾘｶα?ｿ冤ﾉvｱ"ﾂﾉ1ｻai1ｿYDG､qdｷ#&ｭﾏ孟
ﾝa├;ﾔyhｯg｣:`:/談ﾖa|_aﾋgG纔ﾆ1+$ｲ廿ﾗ-蠻pｬA糞Nｴｹ波ﾈ0ｻ@^Dｹg)+@;ﾉ9ﾒr.軛ｬaﾎ:\
ｻ9WﾁX濬$享孱ﾁｹ返ﾟ86XYﾎ挾｡s\ﾜ
W;(
晩/8ﾎ=無	ﾞwEﾅｵﾗ}ｨｸｭﾎ;ｲ ﾚｨｽ怫Y_6ﾘy剥p杼;;Oｳ]挌ﾘ^ﾎｳl奕<ｫv^b歳ﾋlﾚｰｫ旛ﾘYﾎ|
vｵ&ﾚﾁo｡.{ﾄy殉ﾋﾉr>p::｣恟彎搶抒Td98_9K惘擂ﾎｷNｫ攀ﾂﾞ9ﾎﾁ9ﾓﾑｹﾐﾉﾙﾛyﾘﾝ3轆>懽A\畚n.<ﾀKy唇!>挌9ｼ?煎站x浄~
ﾍo盪Nｹ醍ｷx>ﾀ?;xﾊm|ｨP|ｸ霰G粟|､ﾌﾅp^JｯHﾌ菁｢剌ﾋy8奇(ｮ臘ﾅ#|'ﾟY晢"ﾞ莉ﾝﾄ'|w/ｿ=ﾅV^./ｳ^ｲ?ﾟ[苙|｢慂ｧﾊｩｼBﾇｧﾉｼRﾖd狐+|ｹ夲/Oﾊ3A\~ｰｼ+!擣5楫桀2瀝梗ﾋｬﾈｷ枚&[vﾅiﾌe$\ｴFwｰd位ﾑ[ 委cﾖﾁ椄;Z寳ｹｦﾙXｷｷ虔ｶM;wｰ],aﾟ99ｬs]乳象~ﾂ｢考7ﾗ,ﾁ志{lｱnｨｳ0鹽{ﾘﾁJｷ酩:Y匱ﾊ術vｰ=懿-p韋lzｶﾗ0ｮﾝ
ﾀ|hp,ﾛr6ｱC惨]璞賍ｲｽｹ&u;｢evﾖu､ｻl懃]tc/ｹｄｰ'擴阻V襾ｪﾇ噂,縷ﾛ拿uﾁ'MMFｶp7ｪ:ﾟK$ｻ｣<ｾ6ｪﾔﾋｵ3+:ﾘｴvwRｻ､ｻL:ﾝ淺ﾑ0#ﾝ	
揣|g3ｲ(丱ﾁｾ'ｼ
$州&ｯ◎y-ﾃ猟L~ﾋｷﾀIｼﾎﾄ碯ト
ﾁh6ﾃ
	l4_ﾃv'ｱdv8?幅ﾍﾏd7ｳﾐ>淇ﾏ/bｿﾆ/uｿﾌﾙダ檎7:ｳﾍﾎ
~ｫs4孕ｿﾃｹ戻鰤ﾀv琿攴f1~灌.ﾐ?諫ﾆｷ8_'懶0?iｹD@=@罨4>ｳ+#+ｷﾀ..e$lｰﾊ腫6ﾘ,ｨmdｳ;拵ｰﾒ殤ﾌﾚwy7@篳｣лy<御/ﾁ.e8帆
U
XﾊﾟD諺
'w4>\ﾀ?+Gvｵ'yｫm祉VXｩCﾏMｻ仍ﾝ/f楞儘c
F逅ﾞｱ｣誨ｫ#ｩﾏ呼"θE|‥%蓿ｯd#ﾎょgﾉI[D@_貿､涼<rﾁｼvｹvｿﾜrXn鮠=Sｶg'Vﾜﾀ周({	f
+ф｣DA8Idﾂ9｢\*zﾙﾕ樞L/GﾆCﾜｰ-ｾ9慰樵窿]ｆ];4CYﾏuｰﾅ[`ﾗ$)J%耶#ﾉ｢f温:[_ﾀｻOﾕ(ｻ(&蒟AWμﾚVｵ敷ﾛ･]ﾚN姐-､齢=Q蝋F]2K6P了YｽｷｨYﾃZ闕	ﾛ)ｨCoｸ%9ｬ	[パf4<ｯ△｢AR'ﾖｳﾗOﾌF?打艘ﾖZ*ﾛｷ}ｳｳm/p
Kﾀﾕ摩+Mﾜ<-O_諸ﾐ奏jｧ\Aｪｼ｣ｻﾙfﾜﾑﾍ~ﾊ=:9｡R脾ｦ%｢?.ﾀabha8K尭pｸZ劇{ﾅ(xDﾁﾓ｢^%豚ｶ干結]Yｦﾇ=ﾘHｱ'-b･bo6AL`笠ﾘL1堆豚ﾁXｾDﾋﾅtvｨdｷ館n1ﾝ#豐ﾍ?.觝<ﾕ郊cﾐﾊD*H覚ﾇ7V?経ﾕ0F<$qI".壯1ｯﾆ*･檸,ﾗw9leｧH綯7ﾒｸ*ﾝY:4D?ﾓy･ﾞﾑz･tﾚb^F^ﾆ毬･鵈ﾐ葮ｻx!遼CﾖZｪ├ﾐＭﾝ1姙"
艫)w辨剛
dｯ宣BHY ｢
E&\xT額8H4ﾀRﾑM｢Z0?Jﾄ
ﾑ
ﾗ6ｸE,;ﾅ
ﾘ(Vﾂb<.死gﾄ択8
^ｫ畩q,|%NoﾄU慂8ﾄilｸ8燈圧ﾘ`ｨ<w ﾘKﾓ"ﾘO.E2uｲ單Vﾈ8JﾖﾂI08S.dｬ桃p挈d)WﾂHﾘ*消>仔ﾊ綺y,Obﾃ菲ｬ@槎ﾆﾈﾓgｳ=.籖ﾁ糾ﾕﾜZdｺﾉtｿ!vY;ﾘﾅHﾏ6ｲKｬｽN'ｷ7 ﾗA湿ﾉﾋa仂
}GMﾏﾈﾇ#8|!氣3Lﾋg然_dS衢ｬRｾﾆ賤ﾗﾙAMv掃従*ﾅｮﾀF>柘y|祝ﾟAｪ･ﾛG｡|ﾟｶｦbv:bvﾇZﾘﾞ\帚ﾎﾞﾗ｡ｩｬ8拷郷ﾚ篌ｵwQ5q/｢･
+鐓娵F級f崕xﾙz!^ｾ%ｿ5蟾0J~c蜿ｰ廏&ﾈﾃﾌ盟ﾂr+"Q\ﾌ2ﾅUﾊAｽﾀｿ
=遑依誅脱ﾖﾝt]9n簽sﾊ:ｭ2 ｬ2qｸ翕9ｵXGb"樗"粕3禽ｳ[ﾘﾈDﾜﾏ､'Wlｰ3Nﾒ･wv命0X(ﾟｸ裼ｬダ(ｿg|ﾕﾗ迚ﾘﾆlﾓZkﾘWﾏJﾛﾄ裴+ﾔZｸ枸施[4ﾍ}	ヱﾝﾟ5nC?Xhﾏ｢[蝿ｽ&ｸ眞､壮ﾘC]mｾｰｴCfc	Sｯa嚊;ﾘ#[毳,UｸRq春ｰGﾛe蕭ｵ乂$qﾇ4｢ﾇNЪ{?{泉d-｣ 1専9*欧?祁`g5Tﾃ畫U'ｫ昵^ｵ<ｦv釀*ｷﾕ^蝦ﾔ>,GMfjZﾔｳﾙIj?ｶVﾍeWｩy6ｵｭWｳ{ﾕ!~ﾌ鬱yyA｢ｻ(.ﾙA(驛ｴｿｻb`zﾃｱｴ!ﾞﾇ]釼ｦF{PqM@1周ﾎ\'Pｪ.FK_壮x[ｻ5ﾞｷtｰ演ｽじ!O苞ﾏ苡ﾛｴlbｮﾊE%瀕^哨籀VqS炳	ｪdﾀ裾1ｮ萄ｼ'疂崕葦.B`eｧｺｩ(7DSe詁禝Y癧ｼﾌ}ｱSi松wｬ1y=ﾐO[g疳zﾋｧ謀ｵ{Gｸv肋hﾅ:ﾘﾇｨｷ費暈2	'ﾉ檻･俔kBｸｰﾉｧｩj<怐\J{H､ﾕ]ﾊq穎p2ｽFUﾈｸﾌﾜﾌ8ﾈ｢ﾜLﾂC4?ｧ児~ﾇ\$ﾁy=ﾎｱﾍ暝-q＆ﾎｫ|\/ｺ	_射ﾊﾍ"O6w回]\恨!Vｾ泝蠎ﾀ5Yﾛﾚｷ}麿ｺvvﾇ=-険,k~攫牌'8ﾇ:
ﾎ>}[ﾚｳ煖7gｼﾎﾅVﾉgﾙj|ｻｶ::倥-tZｮXN｡ﾛｧy=殴6%T#ｻ&ﾑ瓔ｴ
射E:gy	40	Bc\Cﾍ募wZvﾘmｬﾒｶﾞ7y_蒜[-?羨迫M&ﾟs?ｫ0~兎ｲﾖqｰrﾘ酬>ｬﾌｼ廴':ﾘﾏtｮ@NH^士硅ﾂdQｺ~Iﾓ4W\ﾛﾑｷWｸ侯｡藉)ﾃ~%qｰｯ7dVRﾏvﾘi;ﾌ殤
sｳLｼｩ崘ｺU|｡ﾛ$靱rｰ>V.ﾖk)Tyｦ>M^ｨO隣3舂LｹI%ﾔ醋S}只Y_ｪ@_ｦｴｾB災ﾗｩ"}ｽ*ﾁ|ﾝｮﾔ7ｪ)&5Sﾟｬ鐚ﾔ!zｸｪﾒCU收M5鞆ﾕ
}:zｵVoTW黠ﾕuzｳｺMﾟｧ榧ｫ鉚鷯ｨX?ｦｾﾔ将ﾟ滴GOC>ﾏ帶}'ﾊｾD+m"遅ﾃｭxｵｪｴ_a勘ｽﾖ｣酘7闃Fﾐ/5w)ｿﾌW茎ﾃ)ｼﾄ	溷墮ｮX U=5d=U27ﾗ
Z%ｻﾇｭぺ2H,,ﾊCｻbkﾂﾁqﾃe档Cr?i筥M'ﾏﾃqNｰｶ徭婆Dq ﾛ!L-.鮓ｵ ﾅx?1hｭ島ｺn〕ﾊ鑚L代霤R冢Iｴ氷雫w爽ｶJ簡ﾁﾒD+WｩstuﾍqdﾚﾜｽU5ﾐ淑
孤ｴ(諍:ｳ慷Pﾎﾝ蠏w`7莊ﾗA7!Sｿ
C星?ﾑ#丕?ｧpN7Q8Wﾗ鑰;<ｧ香/Lｾ3Aﾍd20=Y榾bﾃL.eｲﾓ常bﾘ棣?嬾ｳﾍ0Vm
ﾘ即oFｳ3ﾌvｧﾙ冰漏vｿ)c徐=ﾙwf/ｧｯ吩5統|3ﾅcｦ:嬖ﾎfｦs吝ﾜn:f橦館ﾟﾞ,p~2ｳ煎1串藺Sﾃa>ﾚﾔ｢ｹ<.C6/\矯ｳhｽ｣fVSｽﾞ緝[RｿKж鄲1pﾝ｣ﾎNBﾅ[`P潅P葮$K.頡Eｽic!ﾓ4A_ﾓ;(21cZaｳｦ0ﾝｬf,2G@ﾔｰ_ﾁｯ
ｷT$ﾍ=圏D86rﾕ償R萍ﾉｨ┘ﾗ;hYlN6;$ｻﾖ;=ヤOmNｵﾏ糘ｨwa謝3ﾅ孱ｲﾐ帑jo.k"aVvﾀ\ｿ應｣"ｧWｪ紊胞eｧｻ`6､ｷﾛqｩw ｽﾝ卯ｽ駑=ﾒﾛ､ｷ工o ｽmﾍｽｰﾘﾜj輕蕚ｱﾙｯ=ﾚﾌ0ﾙ>ﾗx}Fｰ3
鬪}ﾅｨE:wzよ1ﾛ饂ｯﾓb'avﾇiENｵ亜Yﾒ(ﾅV｡&欽N糜Y据｡瞿<	)冏aｴyv3/稷ﾗ?@ｳﾜ橲,L}冫燐ﾏN触ﾝ*UｺSｴﾃzｧ3 ^壹LjｿN鶇A鳶+~4ｯ#5\ﾃ0ﾜ3n畫\Ko6ﾄ7､ｱCb譲p晨FｯG^\ﾅ$啝玉|`巛5{0~)ｳ鐶'ｼﾖ触檀]9Cﾚa1蕕ﾛl0lｭﾌSUtﾚEﾕlｬqｺ牋o彎dｯﾔe穿m鑵Ft:>,)r0ﾄ|
ﾘﾉ|･8ﾀoｨ5ｿB｣
麿ｭｸ帙蟻a祥ﾍﾃ*	ﾙ'VﾊZ邁+ﾓﾝｮｨNｺ]⇔8r-rﾘﾑl4ｶﾂﾑvoIﾔ写q;瀋{ﾊﾘ疸r竚｢,鱚ｷ3~^縒$)ﾚmb･r+ﾛ@?2醪+ @ﾂ漾v｡<	zﾀ＝,ｨ	隋sｬΕ矮ﾀｸ<0ｮ	ﾗc~{ 鈷ｺﾅﾟｳ{､榻槲ｹ)/鈬OiOE託ｫｪ雙ﾑM`0ﾌd｢它ﾂﾊ!ｧﾈ瘁勘,"Q.1給 ｢*' つｺｨx⊇ｺ｢ｲUﾕ=W2ｾｦｺｫｫｫ_UｽｫuﾄjｸﾞAFy｣ﾍ6俄蟻ﾔｪﾒF	ﾖy^/S椛｣ﾎｷw_ザ悌*ﾎt叶Sｴt碍Nﾑﾚ)ｮr喚*ﾛTVJ粛\p|ｸNﾜNﾎ'u>+ﾃY.|罪ｵ~ﾃﾛ傭}Jｬｪｳ]ﾏ草ﾎﾒ兎｢l9｢｢qBﾛ鞋t@峻\ﾃ9N}ｮﾂ>Tｱ&棺ｸzk､*YﾗU5y*ｵ餮B(現ｭﾒIｷz籾Qﾂ｡ﾖWopﾏ-｡ｯｴ莨ｦ･無ﾍhﾇ;h銷ﾆﾖﾊRｯ鍖ﾞﾎ8E_ｧ鏝}ﾘ*2Jﾋ%ﾈﾓｸ3$&G:@e嶋lJ｡ｽｺ匈UtY	
ﾄｳYSﾙｱT	ﾐ  |ｽｶj?ﾃヘ!rri|Hdｴ､v7Eｮv溺纓ｿｧ*驗]腋Hﾃ"ﾘ挺DFzｻ,MﾖX歟7ﾆ.Gﾄ.Gﾆ.Gﾅ.Gﾇ.o潅ﾑｼ&ﾄﾈn樞ｧr槁(O｡xTVhﾆ茣蛍北彜件!eOPawex｢ｬｿﾙy<)曼酖徒G>ｳXﾍ､簣ｷ鎬ﾑlyukuﾄ7ﾑ･ｽ-q"ﾎﾕxｪSLs企N1#ﾆ|$0ﾊ	ｸﾃﾑ=|W艀ﾏ#姦ﾟｳ彙v售1%&ｹ3kz4~1=ｿｨdﾁs萼嵶Ti0G鵆ｸｸE%%ﾑｵ hｰiG)r$ﾎnｴ擅ｷｬ@ｻﾁｴ;｣=`)･R/錬{ﾃｴﾌ｡}痿ﾚﾓｰ梧I	5@Jｨｰ◇MtTﾐ｡PI疥:ﾒ8FﾃIz#@Gﾁ春4B&dﾑqﾈGﾇ｣Kt9揶ft5揆ﾚﾓﾉｨｽ･ｷ｢At
IoC肓T4儂Gｳｴ酌恩ﾓｻﾐ.:擘ｳﾐwt6ｮK鈔tz/nB鈬tnM稷ｺw｡痿<>管ﾐ%x*]拡ﾑex]7ﾊｿﾒ'ｺWﾐｧZ蒋UK4粍&)t
YF7tﾙMｷ巣t;9Jw丹h9懣"輊介&ｿﾓ=I_3jﾑﾗ4ｺﾏh@+肴ｴﾊhCﾟ0ｮ･o];Fｮ1偃7ﾓﾆM=>zﾐXDﾟ7L+鐶c5ﾀXO幄ﾆzﾔ(ｧ{鑷｣萱0ﾒG)$ﾔ8Mｿ0ﾎﾒﾓﾆﾏKﾊﾐｯM京1ﾒoﾌtｭﾙнgｶﾟ岶9ｳ=ﾑD2ﾐ渭♪ﾟ
ｼ9j諮薀崙ﾉGJｳR･膤Z?ｧ値uLGﾍ稷6Gﾔ!	Fn) $ﾕｹｱ那&ﾕ施1ｵ婉.yﾊﾎﾇ髓\RﾙﾕFg7egﾏP'ﾌ8ゲ'kｺ:Pﾙｹkﾈﾓs｡ﾈ35ﾍｿjrｲｾFlｸf苺ki8臀+vm犒qﾒ0iwq孃･髀ﾒｿ｣鯛7d←Rｪ+*q､ZｸB盃使ﾁ0ｿA｢
ﾘQ･pi_･蝠瑾a陦ｮtcｽ尉=ﾅ1(ｺ･6Pﾔ?rｧYjﾓ~ﾃQｧS+n･ｩh"槙I<仞鶻R｡:諧｢>s[扎弦Bｺb｣>ｼU*\q足ﾉﾅxos ﾙ;穹ｨﾝ庸ｱH=ｬｇjrﾟpｸﾆQ|5訂4aﾊ,ﾎﾅﾈw'ﾟ#ﾟ2ｰ?ﾀﾀﾚlﾌｦl槃ﾄﾙ,ｼ吽νﾙ\寐ｿ`痂ﾙﾃgﾁQﾒ-!!gﾒ-'｣ﾘcd{廰c+ﾉlVHｶｱｧI{ｼﾊﾖ7ﾙz=ﾛHﾅ'ｿｲ"ｳﾎ^4ｳ-F#ｶﾕhﾁvXｩ妥ﾂFwVfa;今ｬﾜﾉvﾘ^綢ｶﾏXﾅｪ

c;{ﾇﾘﾍoｲﾆvﾈ8ﾌ'ﾘ3vﾔｰcf*ﾘｼ7ｳf図b^ﾍnvd'ﾍﾘ)sﾔｼ傷6ｱｯﾌ褌ki沙栲knbﾟ兌ﾙYｳ悃3wｳ淮7ﾙﾏ觚WG孳#瞿凸鴬xﾒ94翊橡-On{ｲy-Og樓鯒z4ﾏｽｼｾ1ｬ譌z6tﾏ蕎｡ｧ7蝸yNﾆ3ｼ於ﾋｽuy3oCﾞﾜﾛ聞主!ﾞﾒ{;ｿﾊ;誉]ﾀﾛx,RﾞﾁｻＸ>%ﾋ
<0ﾙﾉk；ｺﾅｻ	y-ﾂ:=鐡ｮ遵ｪkN鼠躄*t(ｽ+ｪU8ﾊﾕKRｹﾒﾑ螽nﾐﾑﾇ椙ｸ$!uｬ8b0般2ﾑCyﾛ#ﾁ振Jﾚﾔ･Wﾂｱxｷ#0御ｩ2T|p7抉?TﾓK(¶\､.E戦ｾ8ﾆﾙ{?y*韓影┃ｿFY-从m吻ｸmS･{ｮw?\ﾀ;λｻでｻﾃ･ｼｴ=!憐∇ｼ｡ﾑ|L釋ﾃL0Xﾆ潛>6族剌R~T1pэE>>$ﾔ念F|ﾋｧ｣e$汢ﾖｻQ气6{ﾐVY訳ｹRﾓ/伺ﾒH笞:ﾗ|>油\ｴ隰*ﾞ
jｧH軒搨xOE=橇k希
ﾆgﾇ8ｷﾏsj歇Gﾜ"lｽAﾂｨN'ﾍ蹐
ｿpHﾎ畸仟｣r椁ﾈqn芹v情ﾕ賄O'ﾋｵｫtﾔｻHFhmｱpﾒ+隣二ｺ`ﾑC:ｧｪﾛ.ﾟ	ﾇ%4O@ｾﾒ寅扮н)	ﾅvｲﾃﾍX3ﾛ9Eﾆ/\\t$ｩｷ3ｮ
ﾗｷ>|C｣)~SKﾓｷ男ﾕｻﾔNGﾛ窩;(ﾈ1硴&/pｾ両 Aｾﾇ;ｱ璽
ﾞ腔ｰ?~gﾋ^+1ｪa軍ｴ%QPYq0lｹ驀bIzｫ髱
;9徙/ｪEﾔbdﾐｯ&8Fﾄ狹qM|\f｢'｡棚ｸ6ﾖﾉ尊N:ﾅw｡Su劃ﾑ)ｧｦ｢弐Q?寿ｵｶdﾄY[JｼFbｼN.ﾎo□ﾄｧ%'{Frｲg｡
_Cs0弛|,/ﾀ"ｬ膽Ｐ羮~綢drﾔЦﾔFﾙ|ﾎ｢>U4仭.9ﾘ>4娶｢ｼ
m與Jｮ*襃｢ﾝ|?:ﾉbﾌcﾊ?ﾄWcｸq|#Oﾇﾓ)|ｯ荅j%^#ﾋM+	uI{%*'ｾﾅ[L｢紵4褸<｣OﾄWg:v買ﾊ^QM｢37･鉋ﾄ殄ｴsｩMｵ銑cｴW&坐鰺墨ﾏj･1ｬ~=sｲj2駮8ｾｧF9>%Oﾚ｢0ﾆｭ炎d}
｢ﾍ6cT･ﾇ9ｿt･怩ｯ|
ﾟ2ﾎﾚﾏ)ﾗ'ﾉﾋﾎΑ
M@k [`.ﾜ,<0Wxa羽ゞつ_о2aﾁ^aC菱weC｢.ipJﾔφ｢>|-ﾋ
ｿ:k完ﾅr-ｨｧIﾗ簽DｫDﾉ浩粛ｺ診*A!ﾗdｦﾟH3ﾝUﾑFGfﾘ耄ｰN侑ﾏ
耘*｡屆ｮﾊ鱗?1rbﾔs恟OkﾒｽL/餮QbY(%2Vi^u5~0)ﾎﾌｻsp舎ワu0')M刺
~ﾑ\ﾎﾐL\	WｴA*2aﾁ`ﾑﾆ碍0MｴﾛﾅU0Sｴ＋E[ｸOdAｱla諒足ﾑ	ﾞ昵
GD78&ﾋS｢ｻ\0)s宙猾GA\'櫂$+$｢iﾖHRQ煮D95ﾄｿqﾄmB$;ｨﾗ|懦o蓼N^ﾒｾ=ﾍBiｻ竃P-ｿｩｩｮｦF募ﾜ｣lW&(~*1ｲvC"枩|ｶ2$EV病ﾗﾛM&pBｩ｢貰sｲｵM|ﾓ{ｱﾗ箔a)>[凱ﾋboDｾﾑﾎoFｸH 貲ｾｰﾐ@Eｿｭ!｢ｹ2ﾂﾐ*3擒ﾆJ縟i｢XNﾅG｡a=\)ｷｷﾄﾟｾ@椋:庵ﾐI"
Dﾃ%ﾎﾀ1VQｰF戟酣xxQLq3$ｮNﾄ-遭_維煬核矩ﾈ/f樞N4@ﾜ興ﾑl1-sﾑb>*｣聹ftR<ﾎ闇隰xKﾐｱbﾊｲｶX梵ｫb')w5ﾃ27WﾅｼN;筰@ｱ;｣y	周妥AOG9kｨu｣h戛hpt0"ﾖｩ畑HP誡5ｯ>畠ｫ%7\斂謚ﾅJ刊蔚<
]ﾄｳﾐOｬ全ｬ$u0[ｬﾗﾘｱ+｡{Pｻｮ$ｯ"敢ﾑﾏｱg>oｾ磧f@:bTｸxz逸ﾃ.~ﾎ矗(3X･ｦｮｿv;衰ﾙ｢p7ｼ泅ｹ<1ﾒ>ﾝﾀ\'かｲ_ruq>ﾋf
$akｶ瞼ﾁ:<ﾟ只7ﾛ[轣ﾉｳS|ｷE_ｹ横ﾞﾄ!ｪ禿A蒋ｵﾐFG)ﾗﾓﾗpﾑ蕎Yｬ稘8Pｵｭ_ｨﾞ,Qﾞ=`或rｹ_*^湍｢.沌ﾍﾅ[oﾃﾕ){ﾟｱ_｢ﾂ)ﾟuF甘0^！磴ﾇ`XJゅｰ]怱ﾝ笏蔕!S|)ｹK蒟8|Wt{6u\Fr`ﾎ7ｨg]髢ﾒUv=.ｶﾗru墳♪2tb@ｦ@;横ﾜｴﾒ･BﾌbY{JeP`濔ﾅi曄	ｬヰ､*t0+ﾌP烏t=QhJF*゛
９ｳUｪWｨfｧ､y!%Qｨ晢7CN#ﾔｹﾐ(浣,^W!nﾚEﾊjｫ+uｭ 4ｰZC*ｸﾂｺ７;hkeAiu鰻G和蠶\ｫ"yﾇ湯4洞ﾌﾍﾌ|ﾅﾗ2ﾋH\5鉱tf9#"癨ﾞﾉ･EﾔX<ﾈh
ｯuﾔｶｮ4k0dXC､ryﾝ苡
鱸DV*ﾖJ/'6ｼ"輦YQ&ｭｫRﾉIwdoq(LRｳ告ﾏhRﾊУ4ﾂ､ｶﾃ･ｨﾟ#ｻ+_f|./ｳ
tｹ振ｿ送X'ｰFｳFA}k4ｷﾆBﾀｹﾖD鈩ﾝｬ[a5Yｷﾁk*厳fﾀdvｸﾍｺｲfﾁ,鴛Hel搏Γﾔ｣
ﾐ,ﾍ慎ﾝHQA$ﾑ瀬S`掴J7ｸｱｱ9QY%=ﾜ/饌▽$<-ｭE親=ﾗﾊ\9ﾅUﾑ)U笊qq､N
珂敝ｨ蜍ｵTﾎﾇ2ｰｭﾇdｯoD,w]6武ｺy#^繋-`v4Hﾋ啣k､zdｦ#z0ｹD~/ﾏjsｩW)兮R?~Y廣ｯIﾏBkｭ､ﾐUﾞｶ档ｭ告oﾉﾖo長ﾜ｣ﾚV3Eﾊﾞ妨fｰ倅ﾝt5ｹ？信椛[ｭ熱f醍9h.ｷﾄ&:聊B]ｿAﾜ%
#Womｴﾏﾉｺ]贇叉ﾉA･
ﾂ%ｵ"ｬI那(Qﾋq8.･Xse蠣ｧﾌ*ｧ悒%ﾃ
ｿｹ擘?ｯ3
G5b｢D`}2ｭ罟･	ﾊｳ>C7Z泪･ﾖ鑷4Zi}応ｱﾎｵﾖｷﾟ:qq{Zp/iTｩ≒ﾒｨ彩,CｿnCﾋ歔;ｸ](!
pﾜづﾊQv
裏戚]ｭ竺S､ﾘ､$飫ﾒ8__ﾈ･UnﾟEｧ2}ﾀs｡万Kﾖ共/ﾀ%#fﾘ.ｷMhe{!ﾋｦ震[ﾐﾕｶ!ﾏN｡vmoﾗｩv=ﾉﾞ!ｺｲqnG･
ﾊぼｬ iQ眩ｦ卿ﾙﾔ
ｦ6母^ﾚ	評ｷｱﾋ#_ﾊﾌｸ&ﾍu｣0i7･ｾBｱ+ﾃｰｮ4｢邸ｰX竿赤M
n鈬`ｱ\ｭ90,!-t	ｲ隙ﾜﾙ
i貯5ﾋnu誡&[ﾀv+mｷ	vﾌｰｯ9v6ﾌｷ;ﾀﾃv_XbwぇvgxﾒOﾙﾝ`鋪JPfＳｻ7ｶﾀｻｿﾄ隋4G竪ﾔ4E/AAi&ｭ
%ｺ隲ﾖy麋ﾆ脱*,I	dﾓ.Eｹｪｽｨ@)~I>ｨ遼W略鯖娚ｰ,ﾚ鳴"=ｨﾅf汐h郛{ﾝGｮQﾈｵN:ﾈﾖｼﾔqｳｱ.PEqgTﾜrﾅﾚｯzｪ^(Hﾈ槎H0髦拍8`衄謬7'ｮ0Jｷｳﾗﾕ_ｺﾈﾕﾌ.h)漣:ﾚβｶｯ`ｸﾌ"牙hmｶv>ｴｷ晨｡=BﾌHl盾{ｴD嫣｢=ｦﾛ聰n{<ﾌｳ'ﾀDxﾔｾｷ'ﾉ蝓[/ｭｰﾝｾM｢ﾀTﾘcO*{:ｴgﾀ1v8aﾟ_ﾚwﾂ7]pﾖ	?ﾙsｲAiｽｨ=5ｵC{>jmﾟﾙﾐ0{!c/Bｷﾚ句ﾞ#]ﾖs冊ｯ糢､nﾚｵJ;餬PFｺ嵐ｮｪｦ嗟ｶ遼/:cｲ}rﾈ､+=□|ｯZ賠-ﾉﾟVg||Pｳ}餡ｽｽﾝZH!G｢6屹ｺ5ｯｸ;Hzｵ#>Tﾁ蒻PKDs､VjﾏﾛPKma5/antlr/JavaCodeGeneratorPrintWriterManager.class恒ﾋNﾃ0\淋@@)ﾜﾒHH徨DP･
R廴ｺWｩ9ﾄｷq(ﾄ贄B草ﾁﾏｬv胚&pﾀｱ#ｽｩﾈﾂご惱ﾔ濃ﾎ儘oﾞS+W+iqｰ/ﾒSﾆｻｵJﾓザﾖﾐｽz1#etﾀ園駈&):"b_g毯Nﾒﾒ\fｫｴﾝﾙ^ﾀYﾅFL･卍ﾆ(UbvﾜﾒﾑRZ袞Lｩ6ｲ.0t
Rｩﾇ\｡\ｫｸ7{i8E昂蝶?譛K-ｴ憧ムqGﾟh｣"f畴ZPｧﾍ蔵ﾍx猷Y;腋b`ｧhjUpﾝVﾀ!#桿ｿPKｬ+PKma5antlr/LLkAnalyzer.classｭZ	|Tﾕﾕ?鄒両7敵 ﾈF
灸%┣$@&ﾉLfﾂﾌnTqｩ慎-ﾗm(j*ｶﾚj]>?[mk}ｶﾖｪﾕﾖｵuﾎｹﾍ栂$ﾒ>qﾟ}掉ﾎｹgﾟs荵ｯ
JﾅﾃN
ﾏwﾀ郵ﾎﾍdnｦp3UﾃiNHｵｾ]狢餽｡8qｦｳ8+5懊ﾀｱJﾃｹN鉈x?輌3_ﾇj~.p磽\菎ﾅX翔Z\ﾂﾜ薬2
ｿ｣疵W8q%^､｡Uﾜ\籠ﾕｸ{&ｫcﾉNﾗﾀ=読ｹYｫ:獨qｽ8lﾐﾐｧc梼~'靼ｬ紮'巴Pﾇ?ﾃ:ｶ雕化ｸﾙｬ\ﾍ7ﾟ0ﾓ-:ｶｸ塀隷xﾏｿ廢\ﾁﾍ舗ls審ﾛﾓ*ｼﾚ;ｻ:^ﾃTﾗrs搦;攤ｯﾗq?=:跚*n.qPSﾉﾍ
:ﾞﾈﾏ嶌ｹ+ｹYﾆﾍ6oﾖ{ﾌ
oﾕ6oﾗq嫦/Kﾝ鄲6lﾗNhﾀ;忸'ﾞ･xpｿ指jKｽu<､=ｺ良;ﾘｺixｿΘ?ｨ紊:>ｬ醜鐶癡呵Qn~ｬcｧ雑ﾘ浜:ﾕV當:>ﾎ;anﾖ	~>ｩ甦ﾌ':柝潛ｬﾔ博?e>ｭ3lﾃﾓ,餾ﾂ潁
ﾎﾏ邵y=4%ｾﾀｯ/+_r@:ｶ2?ｳｯ_aｯｲﾒ5fJrﾛ汳黄9ｭ肭<}Zﾇﾟ8i
y鍋VﾇﾟｱEｯ綣懃|猾葯顏ｿ:ｾﾄ?:Yﾇwﾔｭ艷Eﾇwuｫ趣ｱ｡ﾟﾗｶﾁﾟt仁巣lw皃誘ﾜﾈ0DﾇOuLﾇﾏ咄ﾖ茵:Kﾇ/ｹ侮_;燹
儼*ｹNｽﾁｯｧu!pV*|ﾁZ!TnR8+Yﾟ淀ﾌﾐ2ｯｯ｡ﾞl脇6zZ|a澄ｸｨﾉｴ~
&
4捉Pﾘ[署塘ﾐZ=Sｻ"_ﾍﾁ〜ﾜｷﾈｷf0ﾐ耙nbｪ囹}^ｳa｡'ｼaTd椄^
ｯｳ?ﾏﾞ
3嬰浸ｹ`ﾞｼﾋ
ｫlﾅ->sｶｿaｶﾏl"蹼.ｰﾙWMq$$ﾘ;*f4C&!｣佃oNﾏ旺xf~専
ｵﾔ)&gz3ﾌ*&36IrnｯxｲＮ莅	ｴﾍJ/｣y6Hｻn5Η$8ﾁohGAUS0ﾕ@貢%bq扛Tﾝ6uth"ﾏﾃﾄpъц3Ъ権]%iib､!Fﾄｬ､瀬乙1Z!ｯ｢-麹ｼ]･wC|Cｲ) ｭQ(4QlQｪ衛/ﾎﾖﾄCLD87(rDｵe3LRﾁﾗﾒJZﾝｿｯﾕﾝ葮`ﾜ!ﾓ2ﾝ香;ｿｴｴｴﾈ7XﾝBM秉Qd印Hｼ8_LﾒDｹ!&)*ｦ1ﾝbﾙbｦ!fln*ﾅtr^=ﾅ梏ﾎ｡ﾝﾒYCa7mｴ4x!匂y4Rｿﾎｬﾟﾀﾌ跼:7ｘ2ﾕﾀ｡陲ｸkv{C4でlｬ*ﾘﾈ+."ｳ{dﾝ枢-nO8ﾊ@ｵ域懐ｨh5 Qu梵ﾛｵﾝﾍ!X(ﾅ
娥ﾖ0ｦcCPﾁcnjｹY"頬b!ｾ#北b!V葛ﾉ5ﾝ,m嗤ﾌ0pf%%(ﾌﾗﾄ*C\"V#L2尹ﾃｭlH>ﾘ儒l_yｶﾜQｧb腰Ao$ｨlｶﾖ鸞罔ﾙ'ｴjｦ煖EXﾅ埜=c頻>FXﾇ!D*ｴｺｩ汝U{a
ﾊﾊ痼ﾛ輓=｢ﾜ：z屓ﾛ#ﾑK冏ｺ｣p鯰o)6莫Maﾋsﾐ鈎ﾟｰ;DZﾌpﾀ_PﾊVgzﾑ	ﾓ(｢!ﾝ
ｱ訳f!ｼb=之ｱCyｵAPｹ9ﾀzuﾗｷﾖL7iKｸ!Jﾖ{(ﾐﾜ塙ﾁVｷ=*･s蘚ﾄ&ｱﾈ~0DｳﾘHｬbＬZ幀>CEﾈaﾑB`B^Gn･ｸ荒ﾓﾊﾝｵﾄ.ﾃｽ冕3aMbｳ＜qy&葮7ﾑ[8綮ﾅV
pｿｹ%ｼ寵ｫﾘｯ垪畑+ｫﾗﾔｲ･o散誄ﾐe穩Rﾔﾒﾅlｰ9ｮ4ﾄ簗(.2-6連｣
ｱMl'雜sﾑﾜ*廖ﾄｲ7
ﾖｫ#>ｪ7舖~2ﾘﾁﾘ鐐=d篏枯 睚5,>ｯﾏﾍﾗ危ｱSl7ﾄ.qｽ&vｶﾃ坂&\)緩ｪi鈍2@袵ﾇ鴨	0ﾗﾟ3｣ｫ/Uﾈ2ﾌ&ｮﾋｷK:ﾉK世c\lﾐﾓH馬ｹ毟|ｼﾐ譬聯ﾇ[CﾜﾂｪﾞJﾊSxﾝFﾔT%街ﾐ`o[f)	 Cｴ-課9"ﾓ#ｺﾉj欧`証ﾋkﾙg6ｱ唯ｿ督ｸRdゞｴksy阜ｵ梢hO*"?ﾓJ鞫{忽ﾔ kVﾄL5ﾄyｫqﾆvbﾕ陸缸"w1饒おｳ耐]ｿd(ﾞiﾚhﾇ ｿI插xﾉ柏ﾟHmﾎH:8yr"ﾑy2ﾄ閭$"7ﾇM1ﾄ~堀ｷ楼ｪtg!aﾛl[ﾀﾏ|｣7填V蜥厦!vﾚ=秧JUｦ:-旄偽ｭﾒﾓﾙﾓﾙｵ&
 ｬ*'ｹｩ<｡0ﾟ参6Mｵｧﾉdセﾎ溢B､j肥+tｷ!R,4湛ﾘH`ﾍ1D+x涅ﾍﾀｳｩﾘﾆx石┸拂｢uｵ!ﾏｷIO21X鏈ｩﾓｱｴ!討5T\qﾖmKYPｷ朿=ｪ.薦NFQ鼬ﾅ*ｲ{/C&轣IN\Qyi｣f}ｯ56岑
ｴｰｬ#70n!ｭ:Lk7=ﾌ264ﾓﾟﾀﾂd%ﾟ莓="ﾗﾃ∧><(?綜(&ﾑｸ听|~Z@2芳ﾟｳﾖｦ衰+7hGﾞﾛﾉc)ｽXﾇﾞﾜ" ｼ[My:-ﾕ*%(ｶｻ9喚3ﾌｵｽ浚⇔0_ﾉﾐBｽ_Kｭﾅｻｼ!掴棧_Zｦ ﾉGｪ膾euY`ｼﾐ運Wﾄ_餽u｡梁+K劍援#Lﾒ呪閹0空蘭雎O|焼ﾜﾗ-QUW<[ﾈ's働0ﾙ]WﾏﾓVｲ1c┻tOｶﾅI'ﾒQLYﾛ(-=ﾙ弄Afﾒ脇ﾗ-[g+e校A	ｹ1kｭ'H	幵}吝ﾝG>bf0^H｣E艤#bvﾜ遼ﾑ"､o話qzﾏSjｯﾑｪ$xW魍eﾎ謡q
y寂&>S^.zｽ踊#ｾ5\ﾏｴC乳zЫ!晄ﾏ87ﾙ紡ｭ筮3ｧzﾉ儘JR@ｲﾛF2R揣<
唐ﾄ趣@9ﾇ
刀Tﾗﾐ握Jcｴcﾎ┓;H$Vｮ燧襪?}F夭kcｳ@V◆i
ｺ[ﾇ"e隕y6､玄2veGIBGｵｼ}戛,b齢leV01Sﾉｪ-M#%蔀f絃EsUｼｸ饗n憶
Rﾍ-_ｨﾇﾙｭﾈtj｣ｼ騏oｰo･(<
j~U臟hvsﾈcﾘ倅H偕f-ｻ[| E｢T朷觜ｰ蜘b禁,+ﾟｰk9ﾇEq!6:9zｨFkP｢ﾊ腿ﾖf粭$ﾑU>ﾛNｦR}ｴ4Z;滅≫ﾉm莵]ﾚﾉｻｳf勝,Hｩ3ﾗzﾉ,8'V奧1ﾋﾊ##｡ﾜ｡ﾀ渠蘭ｹm4p=A;ﾇHaY3FｧHP%f0ｾ濤c叟ｿ>=Mﾔqｼ鏡fﾐｹ楪.d6ｰZYM･ﾒ6ｾｦｲy丞払6貽6ﾔRQﾔﾔﾛﾎaﾞe8[ﾂ9a|	_ﾑ臾H･Ou=Uｾ煩L桧M~ｾ	､ﾇp@tbｵｽｭxVA甓ﾀBB<
7*ｿｦﾔ薑A;za}y9a?jGNPa8ﾀ髏
!ﾂ0E_ｩUﾉu1ｩｪﾐs|Q'8gdg'､｣
Rﾔ各ｧq';	駻Hy(*1xAE$ｯr`ﾃx(	D13,I麩ﾒ瑚-ﾔﾂNm0祺ﾐ:223ｻ``Qﾊﾌ｢N!4RihｸﾊT｢ﾏ.OﾁT^l6
邏CAﾑIﾈm琢ﾈk"Q2Qｫvﾁp粭ｦ#ｺ`d蓑ｲ"･Fﾑﾋ5fE<ﾋｭｺ41ｦFｾｫG`l｡+dﾐ
ﾋｴ,糠7'yRｬH'ﾟｨk察?ﾊ,=K= ｾ'ﾇuｵ86n怨ｴｲ,ｭ2胸ｧSﾏZhdNｾ4顧	%齲'｡ｴﾜ｡9-6Eqlﾆﾑ臀2:6}袈Q末{ﾎ.O｣.{ﾅ｢0芝夐Jﾋ廩_tﾋb討VO､>ｩ堺ﾔ.Gｮ+ﾍetAYM｢ｦ蹤4=98rI3鮨ｼj冱ﾀ,棺\{=ｾﾑ韓T｣ﾊﾓ韓P｣ﾊ
ﾊ4R{29廻聡ｴN腕冠lL藷=5jiQOｸ 2~孚ﾂｸ	ﾇyqm炙蟀 ﾅﾞ計ﾈe>ﾊvhsVｷ
顯}f;ｶSoV慫ﾁﾚ"h続	ｫbﾝG<競ｹfｳ9勘Iｱ穩PH齒A･0,O独9ﾒ$ﾌ-ｶCﾇ識;4jｧXﾍX､鰆/'ca
褓Tﾊﾕip\@#ﾓ匆fAﾌ\療<.ﾌﾛ｡pﾂｽPﾕqX
Oﾃ2xVﾂ寇&oﾃ*裏Vcﾔc4b1ｬﾅ歩Eﾖcx'yﾘ葦AP､@Hｰﾈ[ﾄhﾘ*J潦q\&ﾊ疵1ｮ3甄1ｮ吟:ｱv階a昇馨ｰO<ﾅ8(梳ﾄｯ!&t?ﾁ1ﾅ
O(｣爰ﾊ+e)ｼ､4ﾀJe=ﾔ*ﾍ{eｼ%)ﾓﾆﾀmо)\K&ｧ|	D･jｷs	｣格$KmΧｼ6ﾐﾔP0rhﾔFﾃ;P!лﾎ¶ﾉ@Mj3ﾛｵｹS娑I嶂H嶂I/H/I岷H岷泳fYﾚ(-=E+ﾁqﾌ+W]*C2Gdｶ遺\)9渣QﾊRｳRｳR飴EYｩ]P]ｮｹｴH啓ｽ ﾑ鱇"ﾂｸｧ+e(ﾋﾓﾇ1抉C餾#A5!繊鎰┯ﾚ%l:{B掾ﾐﾂ^￣gEA｣#ｿめﾟ"ﾔﾓ$ﾜqｻ!ｻﾎb:iｹK%dｼJｽeｲｾC巫Xz.oｷﾋA,KｵﾙY+$ｾﾝﾅｴｰ"Fｳ ﾎ｡+-ﾋﾖﾘルﾛﾁﾇNL}V-W2/ｩYｮfｮｮY梺ｹｦ&ﾁｫ俥碁Yｩ就戳 也ｭ"ｷﾄ/ﾙ遷炒$[C*05ｪｩt爼ｩ?:a:ﾓ<棘TnｬﾄABC`fﾘ菎攪8~ﾃｺ私qﾃﾑXcp	芝ﾕ瞬fb1ｶ`)nﾅqx蕊ｫlﾜp梛q*>4Uﾊｯ畚|釿gｸH雕XLﾂ暁2\+L\'6b?ｱ7蹟オｫｹ所$'･ﾓﾓTDﾕ麾j6ﾕTﾂ1h,ｧupｿ\M向ｵ59>9|ﾈﾊ胄滲ｭﾋ叮･ﾖｼｼｸyﾞｹEyJ僚ﾔ｣ｰ0ﾍﾙ34ﾞoﾍｩ帙曲j缶ScﾍHﾖｷN<ｬ~4麾ﾒﾃLﾘO@ｰ<ﾅ編｡N立ｺR蟾$ｳHｧ8抻uﾚﾔｫN剱(ﾕｲ24ｲ[Z/ﾙ[ﾛ稾uﾁ扣@.ﾌqｬｵ北6%0Q｢Mｷ;ﾇﾛﾔｶtｱZﾋ;
蘭ﾋ,b6ﾒｩｲNe･.;ｿp･r
syｹniQｧﾅQ畍J黻m]ｰ=ﾀh !ﾔ争|WE躾-Kｹｭ4飽&ﾚﾑ翼蕭aﾒ-改ｾﾛ]濫x~\ｳ|3^ｮYｩu･tﾂ5]pmL.ｹgｯ$\Gｹ#?ﾒﾂwvﾀ0ktsｻｾ錨ｴﾄOﾛ!2DRpｳeoﾔｸRG馥魯ﾝ｡ﾑ&B｣ﾍ帥[a^q,ﾇｰｯx
ﾜﾗﾂmxｼ跨ﾃp7o｢ﾍt篏文ﾚﾛq#i｣ﾞxp覯ｼ睹~|ﾄ?狹6?cQ1ｻD93qｱ伶Sb-Dﾃ /疂'|Vｼﾏ瑪ﾊ|R/(･ｲRｯ(疚ﾊ2|]瑜/Q	筺彪|G1ｾｫ愼]Rf"ｨ甞眈｢\.ﾂSﾘｦﾊ\z湖｣ﾌ･ﾄﾉ辮Qｭ融c楡r･pｸ{ﾉ≧t'猗O｡ｩﾀU6!ｵ%ｵ､琢ﾜﾄﾀﾙﾅﾝ+!rﾓ
ﾀ1｡N>Dsr-
ｱｧC7.Kpcxﾟｭ妹U$U･,%+･ﾘ:ｦ,~cz+R倔M6ﾃｸ3募ﾅu賠ﾖ8兼oﾜﾜ|/鍬ﾊ{ｱﾔdﾚ.ﾕEG･-;R(嗷ｨ礎ｷｴﾑ赦ﾇ嗾kｬｱｶ>_ｨ'`W'ﾜﾖｷ麾=膸Ufﾚﾞ(_Dｽ9!H'-;rﾔﾎ1+叱ﾑﾈ}mｰｱg8U[ﾌﾇ1ｿ盜ﾑbeSIQx0択｡桷%､ﾊﾃ]CｶhﾉQﾑa~'S棉嘉]Hd jｰrH'ノｧｸｻ壺nLﾗﾀlq-ﾌﾗﾁ*ｱｶ雅ｱ7ﾂ#&x\ﾜｧﾄ^x柎ac
ｷ蘇ｿ}%ﾑ30ﾖ塾cQｷ畊鏥ﾗ畠Y\u､/7ｨ*袒ﾑ蛄ｿﾊwﾑ*ﾓ*ｦUЙq哩{h^tHmﾝｶｶｿｰｵﾝGｴ=fu翆ﾇ!灼jHﾋ'ﾋFVDd%4,ﾍ+yｲM^EｿL-aHP累ﾄ･色ｫy垂aﾂﾁ\(,?t堪]ﾇ`ｳxｶ九ｰK<)W6ﾂ^ﾙ2;h南Oﾘ9ﾅ恃qJ､ﾆ"!到sﾄｳRﾈﾈo@ﾈｯHﾈK$臚)ﾄ>ﾀ>ﾁBﾖ$錺DﾈI康eﾔｯ鮫ｧﾚﾀF崇
ｯ#tﾉaｩMkｼ6cxｫ&>"ﾛネ1T碓`ｾ毎ﾏ(埓Kﾄ?･魅,-	ｱSﾐ晶MLﾟ$Giｫ4ｭ.9Mﾖ	ﾏｶK*?ｳ釦ﾚ喃箇ﾏ鱇s]|pia!."ｰ +輯eTyｨG熹ﾄ[曲~ｿﾆ檐ﾇｾ8%ﾓ0%^ｸﾓ蓚d`諡ﾖﾄ_ｦﾗ/ｵﾁ&Kdq慂幼"3_ｱY>;耨ｼW｡ｽｴMkT?ｭ9ｲ.6ﾙ199tv649暇ｶ,ｧｼﾇsqﾂﾗ]Z=UIR･?LUﾀJ畢ｸLW)YｰS7+C`鞘そ浜ﾏ+ﾃﾅ号2)c0*ﾂYJV)羃F祥糞ｱA凰e"nU&疱zｿV)1qｹoﾚ雋/1&ｫ D)a梢ﾖ}Qﾈk_虹k莨憑ﾘ浅ur"~ﾇｮ2,t悒Tﾀte,R*aｵr4( Tﾃfe\｡,みﾊbｲTｭ\鳧oｯ?ﾟｻm諦SYM堪ﾆ|ｶｻ3ﾘV~ﾛVﾞｲｷ聞｢ﾛﾊﾎl[QHｫF乖ｬi*峯ｰLﾙｫ鏈ｯ4ImﾇﾚﾚｾakｻﾗﾒvJｯﾛJ'､EwﾙｱｹD｣ｭ?ｲ詈ﾑﾟ猛Hｩdﾛ駟rｫ9sｿoM	佃C0[	ﾃBe,V6ﾃﾅﾊXｧ\
!2ｸ\ｹｮWｮﾛ吻脾~`/ﾑDｷ$汢nﾟn･ﾑ推圷j偲槫鷁xｻｺﾇj]S-S洳麌PJｧｻs-ﾓ5葆昜ﾜ]葆ﾉ7ﾃr薹ｨSnfeﾅ^ｸ_ｹSｮｽﾀ^{ﾀ^愼ｵﾛ7?Z;ｽﾔｮ勵rｺ提^ｸ@ 督嗾?､o8+Q_zﾘsｻ餓5ﾑﾍ秕ｮﾚﾇ[憔q弯ｰﾏfｷｱbｾ緤ﾍ冪&^ﾞｼQHFrF/ｷIﾖGﾆﾒ	,oﾖI]ｾﾛ薪ﾑ{Dﾑ｢.'襭&YYｾﾊ淵消\蚋つ聰W棧08ﾛ蕪p搜
N+ﾏﾀｫﾊﾏ潼裼ｶｼｯｾT^@Ey+迫ﾁﾁ｣oJｵ]'控ｧ覲ﾈﾂﾜ	拍ワ(R這v楾ﾕｿ+ｿPﾞ┌ﾊo!巫ﾝﾊ[ /拯ﾞwo5b>[ﾜﾖ/ｷﾕ%ﾕｿﾄiｺp>R\rｨ(芸6'Zﾕｹ7･*
LyｶｻDﾄﾗbｿ瞥探y2柄゜ﾎR>びﾊﾇPｨ|Eﾊgdｵﾏi{鳳･/ﾒt執5ﾝl_採QY|ﾞA2/ﾟD(ｲNｶｩEY*ﾛ謝qIEｩﾔ汚RｦDM
CU
ﾆｨ:粘:攻ｪi､ﾄﾙ8ﾁVb*m0gYﾑｿ(-F熨9ｨu8ﾕ隸fﾂ o嚠討屓r0砲4hGｳ短h_ｭ_Xｰ1謁､ｻkﾕ!ｩC	ﾂｳa90ﾒ娑Q軈-濔bﾏｮ=``歛|,堤`ﾇv+ﾓ"*｡｢<ｾ 損=藝+/xﾒﾉiｦ譫ガﾄ汝i;悟軾0悄濤sN怱/ﾚｺ$砺箪9[_dﾘ*芒篦ｶ`A	Y鷙｢ﾂｵFｩ總ｼ:ﾎU'ﾀu",Rﾋ;ｹｰOmｿ:嫻+羮PKｮU8R隋PKma5antlr/LLkGrammarAnalyzer.class部]Oﾛ0潤ｵｬ1Xﾚｴﾛ(ｻUA0!eﾊTHｽ3ﾉL[rﾝJｧb?`?jﾂ康燈ｦｻh5輌;ｿ5ﾘ)ﾂfｶ寛ﾍ`&D&JtｬｬV<ｮｬ4
鴃+nE･ﾚj驚+ﾍ7mｪｭj-4qｱp窖ﾉ瀋蜚ｴfW箜
%FｨlｽJｷ=ｭﾛyXg0%ﾝﾕdM#ｰBｫｼ%欖wd陝=v息木Gｷﾜxﾂ=ﾋｧ･/hruペ^｢5<敢iXe喨O"C0ﾔﾞl噎摎K"欹#ﾔﾍｺQI涙ｫﾃQ\ｷQG醫
證鯑/nr'樛#ｻ:ﾃﾞu鶯R_2ﾅR-腰ﾁ|ex頷ュNﾊｸ)qu逢ｪﾆbﾈ`ml什餃wM'B"Υ邨HqyMｭ沁ﾁ%ｩ3婁WwX凝[綴3鰰))wX@ﾌｱs槁,ﾁ祠q8G|M'~
q∈H|K,来ﾋﾄ葺ｫｰｼwﾉｬｻl<PKP~QwﾏPKma5antlr/LLkParser.classU[WUNﾌ0ЪﾋJK(ﾑｶjirii｣)`ｫXｫﾈ)a的･^ﾞ
]ﾋ>`ｻhXﾋｮ螢數､ueeg淇}ﾙ鈕ｯ~ﾀｾﾗ0碁F愿菰ｮkﾔfﾌiｨﾇｼ4/4nﾊ蠅ｷ､ｸ-｣b鮭*kbZ;2tIﾅｲｹHﾃ]$T$emK=殄ｫ*>Sq_|.ｵ)ﾂ嵬;ｩl喨ｫ蹇ﾔｹVP`ｦF6:Xｰ悴FqｵｦHFvﾔ"wfﾒJ∪7ｧ閇董ﾃ苒	ｴﾖｨB 
Nﾊｲﾓ\uJO
七ﾃ&g%ｸｽ+ﾃ|8C
PjﾔGｦ衞Z｣%|ﾏﾝh2:ﾊ6ﾑ薩tｸｸ17F簸験ﾔ=5gZv1]ｷ=`筒P竚ｱGｽ媒ﾌﾚOｲ伶｢G0Kｸ8S!xUVﾑｰd\<ﾆﾔﾁ!F#ﾓ0厮｣=^ｳﾉ6ﾂ頻ｱej	宏壙垤%H$ｨ	"xaｯ}ｺ.AｵＰpｩｯﾃ!y=6ﾛ	ﾕ*ｬO^z7mｲ	ｿ%/ﾖ+WﾐﾄN6状[fl	j(ｴP+m%ｴ片滄･ﾓ3ｶzﾏ 4ﾔAｳﾑ[B遏QﾎCﾙP$ｺ+<{ｬﾛS	｡NTﾓﾑwﾔﾓ	(ｧX46ヌｸﾎﾏ,naﾋX;ｷi/[ﾝｻｫ做韻 {2VﾑFhC0xr
孟Bjｦk5錬C_&L択$ﾓ](H)y)JﾝｩPKｾ･\,UPKma5antlr/LexerGrammar.classVwﾕ晄5MRR[｢iﾒｦ

ﾒB+TЙ､\あ潴鱈ﾂ濺&Lfｰﾂ"ﾑk}]ｱ｢Uﾑuﾖｺｬ蚌yｿﾝ褪ν?ﾂﾇｿﾕﾇﾞ塘ｶ!ﾊﾊﾊ>g縢ﾞg=ﾟ%>c5v6&ﾜﾉ.&ｻ們frwﾂｽL轜fｫLﾒad仙&!'!/aO:2&F,	E~ﾞ穀GねXA&罧y@ﾂ	IxXﾂ#e読$dﾙ%ﾏ艱^%ﾖﾌﾕﾞaeﾔｴkｨ+頭vﾆ2-肛忘ﾗE｣ｽ､4gP@vｴ駐ﾔﾍV穀ﾘ%ﾐ漸KZJ3Kｺ｣ﾗfd跼ﾂ9ﾝ ﾙVv訛嫐ﾐC$ｹWﾝｯｪ呻O9ｶn跌､ﾝﾔ!ﾑ暁U?ｷ[1xｱｴgﾄ;g~R7ｵ-n!ｭﾙﾛﾕ4&5qﾓ<ｹﾉ｡ｧ2ｪI!ﾐ2)ﾘ釐jF甌o疥0莉w'dｼcdPQba\ﾆC8)稚ﾙiW7ｲRﾛｮｩmﾋK悗ﾓrｪ｡g復e+#ﾉxIｧ′I&U田ｻ蛤@.墮樂]Pﾃ+ｸ%GIk
ｫ*WﾕmﾑMﾖﾋpﾈx樋敘[k魍9掖壊7lﾇK+(緜| ｰｪﾔﾈｦｷbﾑﾋｶj%c凱Mｬ亘⊥ﾍｰﾌ<蘿ｫU*饋ｻ
ﾔqj{ﾔajｦ鍔憾味~ﾌ*zﾞｴｸ~ﾝI$Tnﾁ--#ｺﾄﾎJ_誡|m｣f"+褐)|"經ｮH･zgW=ｵyy盪ﾝωｭﾑｱ】Zﾍf鴾｣｣ﾜuY-ｧｺｳﾁｶ-{屠f
>ｺｹ:P,ﾚwT順ﾏﾆ寔E{6％･ﾀ蠏溏湶褫ｳｵNs擇P偖ﾓﾕi\otﾌc鮨ﾔｨ便ﾚ'-)5{Gﾜ､Y>{樺ﾞﾌ5
啻c岔gﾍ＄7ﾆﾉﾚ<ｩﾜZﾙxｷN 6ﾒv@+|Do"Vﾘqoﾇ蓑髓ｪiL屹.=0ﾑ1lｭｪｾG~0ﾐ=ｾｵﾝ/Obgｼ{ydA	ｴsﾛ	箚2:&ｱ脱
E戯tｹ'jcQkMtｨ|f&蜚KP~$
ｺ｢ｯ&ﾏ蕘
rk萎]｣ﾘFO) ｽｻ
~欟ﾝ]Jr竄ｱ4ｺﾓｹ&昆樫ﾓｷﾄ瀞Oｽe,ﾜ,|\ﾄEﾓ衡	ｯ(絆T<｢x5}足ｼM妓S楢驪,ｭ2|｣ﾋCｸｺﾂ? ,ｫGXVCｸf.ﾂｵm牘Gﾗzk爿Gﾕ
z=ｽms档@)ｵu舉\{ ﾖGVﾃM4ﾀ泄ﾈｯ2u9,ﾟ髻ｪl&-ﾙ愽
"7湊饑ﾆｪｺfﾊ;j->ｪｩ[Tｪｳ4ud頬Mﾃ*茯P鰆
qL膕､ﾟ>醸'珥(\ﾃ8}<3x_ﾐﾃy<痃|Cﾟ~ﾄa#ﾏ7･O司|$ﾎaJ|OﾄﾗLｳﾙSv	PK
ﾞgQ*
PKma5!antlr/LexerSharedInputState.classuSkOQ=ﾛK
DQhｷJ}A04QｫK4m゜]lｷfﾙO~ﾐﾄJ｢?ﾀe<ｳ[i\ﾖ49sﾌ劔3ｳｷｿ~	`
dｱ愧0JWｮ	\ｸ!ｰ｢罔×ﾜ2xｹｭ緕ｬJ莪5ｬｸｧcCCﾟ^ｫﾑnｺｴ恰Tﾃq膚ｬﾟzｫﾜ嗤{~ｹｹｪ'ｸﾚｾ\ﾕvWｪﾈuｫ}pｼ5
NCｹv篤ﾑ遙ﾞ.5lｷ^ｪ槭ﾖ%^oｫ｣#)`ﾝq櫟&1･
/ｨｪﾜﾚg｡aiｼﾝn*oﾇﾞmﾐ3k;ｭ0蝠ﾝrrｽﾐsew+
ﾔ潺ﾙXｾｯM頻ｸq2簇ﾓI	ﾗ昔ｸｷ;ｧv67臠顯O{鶇A
j3jｭｶｷｧD梟ｩｪｼﾚﾛSﾝﾑl_-技ﾓ(ﾁｨ奥ﾀ仟ｸﾀ搬ﾎｪｷ>*-Yｳ躁ＦV蹲L筮皿ｦCRｬ冶ﾙ｡ﾚ#ｧyｾｶ,ｬ飼韃)%;ﾖｵ緇Kﾙ▼ZMf｡5x｢fo/隊Xｰ治YｩI＃@ﾚJvﾐg;ﾐｿEﾎ/O椄umﾘ2ﾇv,;ズﾆ轤&ｳﾝ&2･ﾉｯ管ﾈﾃ阨3B0q1H寞I43&m永yz贓5L孱ﾕhﾓﾖW~>｡ﾎ"q!･鷁j悦	1ﾔ荅uｸKMEｩｫﾄ|,5･nｱﾔD濃&ZﾁpB}ﾍﾍwTpｭ｢ﾟ!ﾒxﾄVﾔ>碯ｩ2否ﾘ&29	\PKD横	:PKma5antlr/Lookahead.class攻sUｶMｲiｲ}JyY(J奐｡ 
-RZ(M[ｰｵt嬪ﾛﾐd7nｶ<fdt7uﾁu=e tDgﾀﾑ_|月阪wwｷI	)ｦ=懶橸ﾜﾜﾟﾍ[ﾚp.0*P§ﾊ敘@5(ﾈ8(ﾋ2dP>磋ぺﾃｨXﾃaｱ<"8ﾇ1yﾜ女dｼﾀ*｡楽ﾌ昇~hﾂe\ﾆцｯﾀ$但愨嚢ｦﾄ^JFZ.ﾁ3榕,	kcｪn･ﾌｸ遷iq+i鞁d:屠ﾟ擽4ｫS7~&榑$b'ﾔ屠{Jﾕ'ﾚ,3ｩOpSﾑ2ﾙdﾊﾐhkRB`Rﾍv;	ﾒ	ｾI=i=+｡<ﾜ<ﾂCｻ｡ｪcI]朗淑豌:&ﾀﾃ省CD/?げ{< ｵ礦yツ'ﾄヒ#=ﾆG"ﾅﾚｹ澱1･Njjﾂﾆｨｺ･&Bﾌ筈nifﾖIIﾂﾑXｫ'Sﾊ繋q^o)ﾅﾔXaｿe8)衢ﾞY｢!]頭ﾙc亙ﾕbﾞ%｣/6ﾚ55ﾕtZ]ｬ{aｰr+c愨1mﾆｵ椄燭UｾTmﾂUﾁ豚､OHｨｨNDUﾐ７ﾏ`+ｵｨ
ﾛ5ﾊ{,dﾐ%ﾄ3`XCﾓ剏aZZ｢t徊ｶｯ{yﾁｭW錙WSﾝｦi
:ｱ]＝-
2xE萇ｯ.台Nｱa"+l{ﾀ6Dｷｻ敖^ｨ+ｦｿ{z|\3%Tt6ﾆbΕaﾓ8ﾉfﾟm$D菊wCｻﾑ螂旒L~d彝pgdｼｪ5檢$ﾔｷт･Eｬ0ﾌ^@J窄ｻ\ﾕv=ｲ+z鉢	yﾘlｲｦR
\J>5酉D-糾pﾇｸﾊﾋ.ｳ)MWuuBﾔｷﾖMwx楫3_ﾋ磊|+'4kﾄ悪cﾓ)ﾕ<#a]xAｲｮｬｱ誌l亶ﾞ(Dﾔ｢=ｷｹkｪ歪5(j寺ｹﾚﾆ吏っｲﾈuH沢k(粁｢uxｮﾁ{BJOqﾙﾀ9粥ﾔbﾈﾙ篦lFｼ-0犬
lｧ] Oﾄﾊﾘ*e1ﾆｧ
貳]`蛮鍛倖ﾟFE,ｹ
o⊥`^ｱ	ﾇ)xKﾄ28ｷｼ･弗[St親dｴ顎p残ｴ&･aﾆﾑ	l莟ﾛ､9ﾅｦtFlC嶽.僂粮{F｢Nﾑｪ/ﾂ淫ﾘｬ移S店Eﾌj.ﾏ優｢sｬ｢6ｳ咤iﾚ臧BF{u8ﾕlﾁF悋ﾎｱPｯ綺廨oｰ鑰2観嫺ｽx&8{噂Mﾒg/pﾜﾁPﾇｵ招Uﾞ8糾ﾃD暴Gｨ_D_DUﾔ樔霧ﾌ]ﾛX学(ﾒwｱqgg>v7衾旌H濔ゎｹOyqVwｱﾜN&ｷﾌ!eYｭﾊaYtｦH;伶ﾇｨﾁGｴﾎkｿ帯ﾕgｶPﾔ匙1ｼ粍湲sZjｺ7xｶ烈P],T7ｪ圍9ｬ闖ﾘZVﾆЗb,V惰ﾐc9ﾔｧﾐ9ｬpﾄﾒ0醴犧m$ﾇ･ﾃ縅ｩｳVｭ8寉r4ｱﾀLKWﾔﾊﾗXバy/ﾟｱｬ3ﾘ+ﾔ6糧-ﾒ9ｿ蚪ﾏgkGｭ#･9"漕鴪.ｉﾏﾝｴｳｷixﾅ+ﾍvﾀ
&<ﾋ貸y緊ﾟｦhｰOｶｹuｹ ｡ﾈﾖ;hｼﾈﾗF靭|&mｽ忌7ｰABMﾅｹGｿ7j)|惶秧E]詼ｲq1,｢^w3夫!ｫﾁf~ｧｼ`ｯ鴛軌ﾟ蕀錫_zrｿPK)#@T2PKma5antlr/MakeGrammar.classｵZxTU?L2ofx｡愛ム&
EC@(`$/ad2f& "各u]bAQ侶ｬ鴨LﾐXﾀ]quｽｬeﾗZﾖｺｫ[ﾎ{oﾞﾛﾃﾇ暝n9ﾔﾟ9>檣ﾑﾗH淕WMｵ易*ｯ､｢ﾒﾄ､卯ﾓQｫ蚰弘擡ﾖﾊﾓi:ﾝGｺZ蕾蔔:S~ﾗﾔYjσ;[ｦ昴･1j｣溶Q鋺z桴*ﾕ2z※~皀j4zﾑ}聡Wﾋﾘ%ﾒ\ｪｩﾋ<靡!wO]ｩｮｨｫ}Kiｮ服_ﾉｴM夛Q匱N^ｮﾗﾔ
ｲﾃｪ~鵲ｵYS7	ﾉ寉Mﾝ筌)鷏yｹﾍ匡灸歙kjｫGF､ｺ]Hﾞ!ﾍ擺躱奧ｭ嘗ｫｻ=埃ﾗG5j沸ｶh娘ON哢蓁禎	yﾖﾔv･n風ｽxﾂ6ｨiﾔﾔC>Zb#ｵﾃ距>ｨｽGA^ｨ]ｸL｣靭ﾂ<ｩｩ?i)驂ﾚG'ｪg|tzﾖ｣椏ﾟ=/~ﾏ墓EQ覓ｲbｲ<](ﾍ+>ｪzMﾘ|]密7Dﾖ7eﾅ檸Mｯx岬ﾞｨw<鷯矼/W循Oﾟ5| ﾋ>z	撫ﾅﾀ淙ﾀｧ｢ﾋｿﾉﾓgﾒ|.ﾍ･Lｻ+代k嘱FvｺC;eﾉﾙ2[iｾe~/Ob泅AS?j鸚ｲﾇｿ}?ｿ棟癲fｻ<懊畚ﾌe7hｳ･ｲﾇGWｲDﾘｷ縷>ｺ<ﾜﾟﾃｨ梏!x｡鑠XJ
窩~.先S!0D(h<ﾔGｩﾚ0i{ｸPGh<ﾒGﾛy迫秉$O｣}ｼ=<ﾎﾃc!8+班yx?冗b諒ﾂR才|ｿｸ'xx｢$O)>
罠Oﾓ@ﾒ`ｽﾀUｮ!B絮Oﾗx戎翕瓏\yxｦ%ﾃﾋ豕=ﾂﾃGzxｮ薯｡｣｡Mｮﾛ<x>>F^zx聡朸ﾏﾂ鷭/ﾍb/ｱ"ﾍﾑ>ﾎﾃKeﾞ2=ﾇﾋ=|ｼｼ悛>＾｢9Y噫･Aﾆ}ｼPﾋ&iQﾂqｳｨｸEﾒ･9E囎ﾒ└iQｪd2ﾄﾃｺ鷏G|t兵U6晃)r7"+c
k痊(:ｱ1
朔`$嶌(h\Yｭｨ_(/l糠EC况ﾇ績j纔ｦEﾑ3;ﾜ9ｩ)^2SｶT4(m壷qwﾘ闇
PPs-ﾑ@kk :;好ﾑｵLﾑ脆h､f湃hｴ	搭ﾚ熊E6ｩ系!wH0薫W4ｵﾄ朮延ｪ隣X
Ъ c4nｩｶkkWﾖ｡ｵｧﾑﾒ%較fEEjヂ｣ｮｽｵﾁ椅B靦
蘇帰Eｮ=4ﾐ粕ｵ>2ﾋ箒&WT妃oF4WI･ﾈBOτ婀sJ蜂Oｳgﾖ柿ｨｩ6C`ｳﾃh､ｽMQ~fｯ･香)aWasﾝ惺ｨｽA発ht謖s{ｯ9ｿ>j`ｲﾏ!7ﾑ#盧q*ZRjｯ37ﾋ鼇ﾒ7F后ﾜｨﾃ姜ﾑﾚrQrK[gﾕ}[ｰｵ-4q	ﾞ"e｢ﾒ>･ﾀﾚkｾﾉ^ 蓼霖%ｻ5ｱｭ彼Iﾒﾟd4ﾃﾜBｫ.ﾐjd8娼ｭ^迫ﾁ,碑6ﾂMｦMu<､决^ｳ
90ｽﾏ2｣]祉ixｱYﾐhｲ姚w,ﾓ-yVbv鬘@ｲNQﾙ愆
Gjﾚ繿#券
隙笹ﾑy捉疸
畏pzｼQ｣ｹﾆ4/芬ﾅ1#夭Oｺ隈[担縉ﾖ魁ｴ6!E=y鷭ﾓWu{ﾍB(;VaEﾆ況zV幢1ﾑｺ-ｿ薜i*ﾚ-SEQ畷遇ｰ^%Im7ﾘ)ｽsーI･ﾀl;%鰄fﾄﾇﾅnﾁ譬hｮｺ殺5｢M{F9Sｶﾜｨ淀ﾐﾂ	7;瓣傷ｦｦ&TｮﾟdЩﾒAMﾒbkﾃ忙!ﾝDｲBﾉｷ(ﾒm4ﾍPXiﾘX0A｢_WcﾔXE｣vΓｵ42gｼｮｫ!ｺｩF鬪H斎ﾕ>ﾊ⊥ﾃ+ﾃ5aｿ拌u屍L羣ﾎｼZ5|*=efｶ77拠ﾍﾔ惹jｱﾎk4-7ｵxﾄo籠t>抔kｼN3T紺v
ﾕ斫蔟:氤FMQ霈A戊ｪT柊ｽTｪﾙｪL輳x｣ﾎ銓yｺ**j<ｶﾋﾊ揮#IﾐN?ﾒ､ﾙ/V寉笑遶/ﾐｼﾉﾗﾋj|｡ﾎﾅ:_"ﾍ･ﾂz･噫h｣ﾈ%OﾐﾕDｵｿ(ｦW:ﾔ2/+､6勒Yｰ椡ﾔ*5
ﾈ楔>U5ﾉ賢uｾｩｫﾙj爾aｶﾃ
ХQ'I･/謠Гk:ｲbﾃf@ﾈｫｵbﾟ_&;､9Ρs"ﾊltﾙ $挿hjﾓt極@ﾃﾗ|σｿ7ﾋM:ﾟﾌ[tｾEl<､ｯﾚP躰6ｭVYｾ^泅ｸhmkC$､B薇qﾏ~ｵﾆｩFﾔ2･ﾎwzｫﾝ|ﾂ勾ﾃ尊ﾟJ膊:ﾟﾋ綜ﾛﾚBﾁF攅}:;u邃ﾎﾝ2佝Tｪｦu､im剛M菻y;T咒玲0_%q{ｰGﾕ 驟瞳笑C:?蹠xﾎ;ﾕxﾕ第1掫:臓mcﾖ凪	ｶ'":ﾖﾍﾃkﾎlﾉ穴=)_ｺkd火o.ﾉXF-ｷｶﾇﾃﾟﾞﾖ5bFｿxWlL遘Dｼザ偏O3"羌ｺj砠t5L
ﾗUｵD_ｱﾄ!tｨ4ﾓ%gIｷｷE#孝,&幟ｲﾁ_Y=：qjAL押t~狙ﾒeﾁｨﾉi｡oFｶkZG1┻姪ﾎ~ﾗ+窕3ﾊｯｪﾑ薩Y震ﾃpﾋｵmg弌ｬoｬH袮u罪ﾐM3*T?!fｴ｢ﾔｫｿ･ﾛEﾔｯ*cﾖCﾃaDh<^mDqｶ吭ﾏｵgﾄﾄjp!s$ﾚZｽSR?i]舫S&L榔齬ﾚm俛]ﾜ8ｩx]q綸iｦﾋ j磐ﾀﾚt暢腮)*z畿単P:A轂$ｬ舳u檍ｯ@5K簸ｿｯh鵞?ﾒj･Ql卍6KヂТﾑ｡濔q卩iﾒﾚﾚBA0ﾜP"|%蜃sｩ{>#5(-$6ｵﾘ*wN?勿夏~Rﾂﾙ琲!ｫ\ｱqu 4ﾑ
5Oﾕ9ｲｧ殃pｩﾎ}}ﾆ4\ﾂｺ7dt伽｣\5+yZ
3(*=ｴFAZ脹ﾓlｪ屬fﾚｯ/V5J遽ｳ 嘉@E詬､jﾓN9&ﾃｷ:ﾇﾟkﾉ?lｶｵ
｣5IIM稠??gﾚ哘ｨｿﾓﾆﾁｿLfﾒ'
鏡ﾟｪﾀ;`KｯH-H+ﾃﾒ｡ﾖO撲ﾙlﾃ`M<ﾒｪUｽ｢存Ps&P*ﾈB0ｮfFR菊}y
EVX･騨ﾑlvｵ.ｨ]ｯO.ﾒ]
ｸ綯揖WﾇﾁG]92ｭ､絨禮ﾒﾑ-Z恕eｻ?ｾｶﾍﾐ]ｹ篌ｺ扮撤?SP{瓰#
xX('嚔/-ﾛ>ｾL-ﾗUｪｻﾜﾂ･&x瞑レ
,悛NDﾌ"ｰZｪD官\cVｺﾋ,QﾇqM(漁F"哇償]領ﾞﾙB ^ﾛｴМK7G#ｭ/ｦtﾓｫｱﾗYﾎ6/mi*ｽk%[]'ｩ殿YW榜TﾖZ3&ﾖm@"oXｺ[g椨ｿﾜ5P哂 根IW$ｫf1Bｾkｰ灑H3誄
吐ｸｬ(肌ＹｻEI%竰W眦F度ΤWP-Oがdiﾇ'7aﾝｵ0ｹjIN訊ｯィ%｣C効ｬP ｳｮS粕ｾﾁ@愁p榜ﾓ/鷄ｴ（Cｮ+ｺ靱e找ｰﾎ醜=8I･篳gｳ'鷭蔔ﾅﾍ I("H声*45ﾎ菜@誌ﾖ6hｰj違{ｸ`ﾊ､#Wiｽ'岌ﾈﾜｶ@8ﾘ3ﾍｹD(7ﾓ黍躯ﾅXﾆ+ﾘ63 Lﾔﾗ5ﾘﾏPcｵ%d襯#"｡K8l7ｷﾄｰ_[{lEﾖﾔS0ﾋﾅｿ廐ｿｴKGw ｯkoEｲ躬w､ｹL､_oMD]=7o恚!Hｱﾃｱﾝﾋ戮J8 $ｷﾋｺ=揮x
kﾆぉﾉ撈2k$A領S*o0fa,5ﾉZ｡ﾆAｹ1ﾊ鳳ｴｽ!f?gﾑtｼﾏh妊,wｨｫﾚ籔}ｴ疂qnj裂uE<ﾒ
､ﾆ8vwlzｼ}逡寓s蝗Fﾉﾜｾﾍｵgﾏ6Hｮ椴ﾚ
孀4bwｯ９M)+黜Y侘\YFM"ﾛq1襯｢觚傾0覽ﾉ!e乂zﾌf
眸,政ﾞﾍ%4ｬ盡諢ﾓｻﾉ｢ 9%ｦjr､齣St､VJШ§ｶXｨﾖ寇ｭE｢ｰ-ﾍﾔｿｽ)ﾍﾞﾂﾍｺYRﾒﾋoﾌ]1C譚萠ﾌ/M襴icﾚ氓>>0Hj42鮖ﾚ.\Hﾐp逐	ﾖ鱚s買i拜ﾝN盖癨ﾆ\ｨhﾔn/-莱參｣rm,nｴZﾈｹ ﾒ緻ﾓ]ﾍ｢苣ﾚﾞｧgqLZ溌;､ﾊ若Q｣5ｲﾚｨGU位;uｭ
g`~0釣込}疱膾ﾕ&嶄}ｷ/ｾ"Yｳ4
､ｾ*8諮~｡筑ﾇlﾞﾚfﾔ･vｦ5spJcNｽ+><ｫtｦｭ	Dﾃ&槫	Xｴ#QﾃFb[｡ｮｾvaｭU3儀｡0ﾍﾖﾑgP!mMﾞ;ｽ!G7ｷ殍1$}ﾝ[\欽gﾌﾟb_g%ΠxA61蠅ｫKyｴｨｾpc魎#nﾒ献竃ｴ照 西4htﾞﾈ^ﾑh9W髻Q5J
奠!%/CqV､澑叔~Oｱ>ﾀi	&4@5P4nｦB躰UHK遜q彈-ﾄ%馮助進ｽﾊ=ﾎ駑m雄#逧ﾗﾟ*檠Yﾄｾ荘ﾇ野%LDｦi/7d濮cq巣PMkCPx虚ZX+ｰONﾈﾄzwjZ+Pn>,24F
RD､Q旨｣ﾀSPﾍﾟajｸ[ｨF仭#ﾕ(ｷH哉/ﾉG@J>Βﾝou買ｿDcﾋﾊ+*ｻI峯/&W蜚｡ﾉ僻]ｦｺHﾛ&$ﾔ8ｴ#ﾈ貢$xHT@ﾃh(困4ｭ抵6r縢Zｾｧｶｬ鴇ｻｨ滌$ﾈ'ｯzHﾇNy4｢Iﾐ蝸uﾓ瑟6|4{璽IｴM･整X娩ﾝdｿ! ?､
ｺhhYｆｵCTJｨS9zKU儁aﾖﾋ韋ｲ貸TﾘC#ﾀ猜y#4JuRQEFｧh
･\ｯlh'Rﾎ&QMﾆhｹ｣iｨd.ﾚﾇｦbSﾎe5ﾖ萎
ﾆ%4Fｆﾟｦｱ独t.肝屏}SMシ｣=ﾑ｡Pﾟ卦ｪ	6ｱ5部｢Ｓ(g\~ﾛiｼ4ﾅ	*)+ｦRｸAﾙR<波ﾞpｬ沚#GQ1采泳廈m0野ﾟ
*ｦ
0侖Cwﾂ4選ｸ｡頼'ﾈИ]T$}ｳﾉeK;)7軼q;sﾖsV7ﾐES-ｩ泙.啖f?ねS,'ｯ鰈-Ю.}i
-璽ｴ君ｦ｢1{ﾂ&ﾋW@,Qﾈ	ｲﾛN:ｨ3ﾕzｰ蟄UPQ5帳C{hﾒｻiﾆ#｢ｦﾃ,疔 ﾜﾌ4畴冤c4ﾙR,%ﾚ内ﾊ'9@ﾔｷi｢2ﾀl3鰐Q%pa餽3E`ｶ=`ﾟiｶ｢ﾊUZosﾊ{ｳﾒi%榲膓Sﾕ4巨ｺ驥_ｸ丼eﾝtD]%=2As{險･ｲ｣ｫr*sT[牢ﾙE\ﾓrr｡ｺ-VyAnよUBwｎ鬆Jpｰ0ﾎﾅNｪﾇﾅﾖK慍ﾞJ2rlq	Zｺ.ｱﾃJ:ﾋｪ<-ｯ)J｡ｺ悍ﾈ_鑾叺昏:鵁]埜ｨ儖]t|擴ｾz簫▼B网n:9ｧ25ｿ!A鮭i"｣ﾐW侖Eﾍｲ.A-XUYｨ%hE｡[ｺsﾕﾖ滌戊?･2A+ﾓﾔｸMt:ｬｵ爽 LXm=片ﾎﾙ渥s	i搶ﾐ.･ｺnﾁﾓﾝt%瀉;`ｫﾗ颶z6ﾓGt}A7ﾓwｴEｷ(Eｷ*mP騅5偃Pﾃ.ｸ諱 ﾛ\燿>pｱﾍ	ｧｮ|;ｪr臂,ﾕﾚA蟷,-ﾂ	釜O<ｹ*ｷ0ﾘU擒6ﾎﾜf*OV逧:5ﾜ4ﾒ贄ﾓﾄZnZ%蠏T潅F'ｭｻﾙｽ0ﾝhｨ1圜ﾆ:`-ﾑ}ﾄ.ｩx  !ﾉﾃН､G皹肖ﾚE?e>	=
U>ﾅ=hy宅､鈴zTVUVｪk9)U^ﾞIｱﾃo｢Z+舌tAz｢iｷﾍ8qﾊﾕ亡酒rkﾆ 畄嗅ﾚD3ﾒ	撓Fh^拉BjE遭舩鬪ﾊMｲ+ﾌ觧6Hﾐ:3ｦﾌﾀ\!ｴ ｪﾝN蒐sWﾘZ〃玻bｯ}_zKSﾌｷｩ補ｷｨQﾙs5sｮﾖkn
e麿ﾋ8陦ﾇ綉qvUyﾊ､j=品ｪZｪZｪR*ﾀ罩PkPP婬｡,宣m;偉ｨAｽOｫﾕtｩ宛ｨ城=ｦ>ｧﾗﾕ囚>T_ﾓ隷A}ｫrﾔ~兄h;6凋7ﾇ暉ｸｨ~# 聊9	ｷO､UﾄO&ﾏ{d#ﾍｧｶ笨otN薫ｧｰｺovﾄ行+ｩ(
cｦ9fs.ﾃ:空0k測ｷﾙ?ﾇｮ房)匱ﾊ暉l
ﾂﾏs菘ﾏ`ｫrｽ 齋: ]淋zyw%~0pp*蜻ｴ功ﾁ鐫｡6ｮﾃ!ｺ髟RU)ﾞCｯ-蔽ﾗF6}ﾉﾍ(譲｣｡\L綺nｽ8H聢}･｣%ﾀ婪wL\Nｹ\Aｹｽﾇ:ｳ)xM溢｢?gA&｡8gﾉX{閏6}+{ﾘf*z:ｯｴMr｢sｬ圄ﾆｽ砕ﾐ銜'･"ﾎj嬖|ｺs%ｭｸｫsｻｱｭ 7&ﾞﾅ&ｼ_(ﾌﾙﾒ)&ﾝﾋ%n咀#)?ﾈｮU
髢､会ﾐﾒ:*brﾐ\T冫=ｶo筌岨8ﾀ<毀u4慌71Tﾏ矩$^BｫXZﾍﾇﾑﾙｼ湖肄t檗廁$ﾚﾌ
7ﾐ=lﾐCﾜLｻｸ槫|ｼc癜ｰｯﾋﾌ常6A殕ＤZ/桝釈J#ﾒﾓｼ
d鎔ﾍr7+ﾚ97
##ｴ/Gi氏8Uｱ'ｨmﾓ閉ｵﾄtﾏ[ｩｰf_詢"祖妄ｺﾑ{ﾖ銕ﾏｫrﾋ沐覘sｸ-[|怠ｴj荵*R柱J
43lｦﾑ訖ｫ[ﾉｻﾑ濠ｳｻL収ﾀﾜt.ﾈﾌw[假fﾍﾏｧ送Oｧ眈ｪ8吐ZﾂgS櫃QﾞH\ｺ槃Οﾎｦﾛ"ｺ/ｦ2睛1ｾ槭ｫ@$uｲｭｶ｡4ｹ0}ﾓ蛸楙ｸ w=ﾕn]j:)肌@枉tTXBm･ﾜ｢Mo姨4刄ﾟﾚﾕﾒ､GR⊇@ｦz雹d0ｸｻ鵆ｬ爆R濂(葦o｢⌒A%|=U
ﾈ 嬖o｡･|5ｭﾛｩ晢K.ｺKw=P狄4o｣>z;A1成Q鑿
x*ﾅ%Zh樟+5ｻg`y杠	(o暉/iｽﾇ%Y各
g朶ｸﾂmｧｱ|?ぇ&睡uS?B､朋(<褶Xﾕ潺m燕縻2Fｻ?ﾙhｾ釧肛iﾄｩﾒZUkﾗ罧ﾐN$T百&9|ZﾉIﾒOHdOﾑ(~ｼ>ゲﾃ934ﾛ7Dﾊｺ･腺y4･b}庭
+UﾖG~〉Eﾀ/ﾑ~
ﾍｯbｯﾗ`ﾗa70ｻﾙﾑﾁ$[ム\J･ﾃ鑪ﾏ;苺m/ｿﾂ^~LYyBqBｹpfV9]*G~sｻPｿ}ｻMN#鑿w)ｷj]J点O劣ﾈｯｷKy袮ﾗ･|ﾙ+ｲ{ﾘ`ﾀ蓍 ﾍﾇﾀ０ 譱ﾑ只ﾜsｬ
:ｵﾇxｰ.ｸ萄Dｽ｣eﾛ+猝ﾗ9ﾅYSjｯﾉKVXｦg/師夢q･cｼ掀冱nｯDﾜyｰﾊﾛﾛJｪ彑P?ﾒd襖ιｹ.EK\Lﾍ.]9ｴﾖ必]nｬ,qM忰lq医R寨G転 ﾎ@3粭C愧gﾄ)8Cｱ｢+XPKp{ {CPKma5#antlr/MismatchedCharException.classVmSW~僕%ｮ喚ｨ(ﾑｨｵ	ﾙV-ｾ@i!｢J(ｮKXB0ﾙ`ﾘ(ｴｶuﾞ鰺t･ﾓ/ｧ_亙ｧ旒)0cg止lｿ｣94ﾀ販桀ﾏ9樒徭淇O=ﾐ弦5ｰｧC8ミgE逸\-^ﾀyD芥zﾃ!ｬﾇ2^
ﾑxYﾃ
W5\ﾓp]ﾃ

75XF5､eﾑX6ﾆ5d$фｬI
ｷ4萋ﾂ	｢@M樓T)X,8ﾓｮ蟶ﾃVｮd亢｢@87tCﾖ^｣ﾀ?ﾘ9pｲG氓ZqV
ｪ_ｪgHｦ~AUﾔ=沱ﾎ[nzbhvﾊ賽BﾉKNXEﾎ);fﾃ率ｦlﾚ|ﾓｶｫ`w?ｳﾉ[ﾒ\NV0ｿ僕~*ﾗﾒ埠SｶﾛF秘ｴ8ｲcseｭﾄL附ﾚｳNﾖ`ﾀXﾓｰT[#ﾆｬc飛｣vqﾈﾍﾑｲ#豊&/ｯBv5ﾄﾖ%'ﾉｵv2ｶ{ﾖ棍ｶ2ﾄﾟk堯ｴX-9ﾋﾉｴ､ﾜ"ｻﾁ7XlGｹOV橄c+勃僻ﾇｲﾏ漁*矧iｻ7+55椚ｴﾜﾌ､)IｯY"ｰ	KH嘸
筝"ｺuLﾃﾕQﾑ;: ｪ綟ｭ"至86ﾇp\ﾁﾖﾕ湯ｽｯ0ｫGtﾜﾅ月短沿ﾇｈわK+,gﾖ攝ﾉhﾉ好ﾔEﾛ"凾ﾉｺ篌kﾍﾒｴｴﾚ-ﾜｲPﾉ6｡ｬ)2伏詛VpHa<ﾓ1駒 ﾞﾐ&層M%#穎)ﾚﾞsｮｷΒjｪS雁ﾁ巷誂)s斎辿e.dﾈ<ﾚ9W棍GM+｢`!鉅x､&､偉wｵ奔ｲ+ｵi物+-}AeB)Hｬ面ZﾜbﾝBﾙRﾀtgｪn｡ｳX敗RcMW俯ﾎXrﾍﾈﾘﾃｫl?ｯ
xQWL.4Q/ﾓM皷eﾍﾋ鈴/Q?ｴL?ﾌ9,履ﾐﾘ[+耜ﾊH*{#y-g､/eｵ}窟6!7忍ﾔ-|2D録鯔ﾗ*ｲﾓ辭|"TE糢7遐s<ｴx芹>ｸﾃﾋﾛｰ涼｣lCゃﾑ+`]ｰｰ#kＪu｢iUｴﾄ<ﾕﾑ奪fy=,ｯ怜拇息ｸＰfM*Pｱ｡?+めC盃^4x台ﾀﾏｱ+ﾏO佝ﾆﾔ再Mnｪ]ﾄ&ﾓ0ｪｺF}佝跚僕}M｣ﾞ/!ﾓﾘ*ｪil{nｪZ"kVR酎puﾐ遣s
4;(ｰｳえ/u樵ﾃｦｸ73ﾌ>e鱇ｦ~.ｸnﾆｱﾋK~ｮｶﾂﾐp棡d;S穉ﾃｸN卉E8ｸﾛｸ\ﾃ}Z?"樟瑰~
ﾟbsHｳ皇XdCa釣a杼RQ醍8ﾊ~Rlﾃm%ﾂ5rﾋW允椙|L6燵WJ>ﾔ鴣^"斥熈	$遘O蝠2在ｷ哥､wI銷｢~@筑意	;)ｮ3V9ｫ捗Oz7ﾇｩPK&@ｲRﾂ	PKma5$antlr/MismatchedTokenException.classｭ練SSGﾇｿy\ﾂU0７茄j|ｴﾅ*･EAy(Dｩ｢ﾅ.1聾ﾃ
}Y寓mｫ>:ﾓiｴL統鐵ﾆﾟ:ﾎﾎ鞜aﾝ姙D;ﾂﾜｽ{vﾏ9ﾙsﾎ?滌@%(8､牴ﾑ/(8囂wﾑ#嫩rﾄ/嫂I｡_6Aﾙ柚ﾈﾈﾆﾐ?!{a;"!ｪ &ﾟqgﾞS娠0(eMｮ ｩ`HﾁIﾃ
F彝ｾ澆)X2抃奄3|害gﾌ市=vB狂#ﾚﾀﾒ請*ｫ:D(ﾜ!`5Tｵ｣z8Q蜩"ﾇ-ﾑX&ｰﾜﾄﾂa-bﾑﾁｪｺNC6ｬ8ｳzｵmlﾍﾞ@C攬ﾃI-!ﾐﾖ1比@-:ﾚv7J!ﾗ廴Xr;}ｲkｰﾋ9Sｴ	ｨ岱`ﾄｯ収F稘ﾎﾓ纈5､ﾋd<ｮ%h<ｨ袖,ﾋnB匝ｸｪ>､wj:｡m5｡hHｯ･⊇ ｣ﾐ`D｡%ﾕﾚ酎^-碯9ｲﾉ%奕ﾄｪｹｰU<&EsX,ｰ3ﾃﾟｶｧK蝮ｨs5､iﾂｦXXﾐr!~AMoﾕAｦ｣ﾈ]椚ﾒ/Pnﾎｪ肛%mWHｦｵｴﾕｬ$ｭﾏ`khq欝)-ﾜﾓ.Caｻ+]l.tﾄﾅTｸR'ﾇZﾃ~ｭ廓弩*^(徇lﾇqIﾅeﾙT｢JﾅleAﾗh尊>簫啖kﾇW甦6ｪU4ﾊf様v｣ﾉ煮Ulﾂf_ﾀ'ｰl齠ZBB甎ｧQU\ﾃuﾀ@諍]ｱdｴﾏｵ“変;ﾒ祥NoRwpcｺ+､ﾋ遠＆ﾓｺFｨ]｡ｨ+ﾁ蠏TﾏｩｬX=[エw胞^PbQﾍwｹｸ｡&n燥3儒4劾ｹﾍﾖﾔ4<ｴ;ｾTq[GP^*ｩｲI韮y91YﾎRｱsF圀eg=湿｢X橙ﾖ0nﾞyb疆ｧ}ｵﾐ鶏ﾗc)ｷg#'uﾉﾚｼﾊ｢}ﾞ,xsK;布x餞Wﾐcu延ﾌｦﾅ]ﾞﾝ<o緩>$~ｬ磔i#oﾝﾅﾆWｱJ^茣7Kﾅﾎv^G5GｷﾉｻoPﾞ!\!ｿIｹ6C~喰ﾎｹ屍}ﾜﾀ純ｱn｣ﾞeｾy.ﾎc銃ﾏv/･Mｰｲz慊剴3噂虍ﾃ｢ﾅﾘ只噎瓠1
ｸGiﾝjZﾟｧｵ搾^蒋ﾌ>=g檎觚ﾉ川S~=絮<ﾞq?麭:86|舜rｺﾘzv,ｶqN落c息ﾘ2芝ﾓ<癖gｻﾈSﾎﾘV2ｺ[ﾛjFw'｣ﾐﾄxdｻG?'yﾛLﾞ;莊}菁Zﾈk%ｯe学墻ﾃJ替洞▽2;$m糀悌%i帰ﾙnRﾞ5)樟PJ･ﾐFLEbnGﾁlﾌ}&諧bvｳ祷>bvﾛﾃ8BP音ﾏﾄ!､]n据+l\ｪ積9HNIｱﾙrｻ榕	(ﾅ8蔑`zｱfｷ徐ﾕ慰o`71bf
ﾖgﾁxJﾊﾖBa;` @D	#@ﾜXｼﾃ\pX前i臀6∝Z.堝K:WH!,ｲｿ掴Jﾘv拷ﾍi填ｳLJ3ﾕiｵﾕｳﾔﾊLy+痃ﾚｺ攣?ｦﾐ
逧1X挂･ﾋﾓ龕.仟ｺﾖﾜﾚR｣XU痞EWxｼ･鮒ｺFsﾅﾘｿ､攬殪]ｵﾂ3
5ﾇ､sﾛﾁZﾓﾌ^V｣,豕.<飴袷ﾘWﾄ\Eｸ&v篌hﾂ
ｱ7E?Cｸ-.燻ｸ鶏ｾ誦ﾏ?TﾌJ｡氾wuﾉ=ﾘ懣%_A-!｡鐚熱Q欄ｫx$uE期ﾔ)ﾙ2
ｺﾌｸ{ｳｰｾ胝槨?+#gｻ/ﾌ;PK):ｶV]
PKma5antlr/NameSpace.classmSﾛRA=6機辛oｨr!ﾞ/AﾀF凍QP技`ﾀﾕd7ｵﾙX妄┗ｾｪUJｩｲ|ﾍｰｱgと*
ﾎ Mﾍ=+8％ｿj
N盒Ｂ2揃%7ﾗﾜbp%"ｮ{ﾈ(ﾈbHA
p_ﾂ｢ぞp/CｰYhｪｲｵ%8かﾜRfqmJ扛釉rｩｬ喟HMｫaﾋxﾈﾀF<ﾂ推ｫ｢ｰﾇxﾂﾐSﾃｨｹ僂]ｿfﾘ+ﾑ溥贐欖ﾟｰｸﾀﾙi;枴螫iqｧｲダeh7+ﾛqﾑk屁jｹa7MHMﾓ｡Z1&ﾁｹSﾕｨyﾍiz[ｨｵzjη/*hﾈ;]u]\ｭT簇&Cｬﾕ遯=	痞ｶYﾐUｷ連梦8ｨ2O僥ﾁｹ4MB?ﾝﾎ%ｦﾋﾙﾑ ﾑsE,旆P8ﾙ駆ﾁｵｲ'xh]介｢､Hｴ
ﾟJb8G6H@At｢巡悦｢1Tｧ=A+b聡窃7m受4Aｨtr
ﾐｾ
ﾈｻgcU(oﾑM`m;ｪ8ｲｳｰA惟>Fб:1Rｧ\#B1&ｪ靂ﾆ>｣吟-bｴ馭o.ｺﾚ8ZEo慇@伸ﾇｪ8ｾｳ｣Y2ｺqｽ$ｮ;bt｢>@M/旃@ｽqｱ渭\肛 Tｭ!LR$ｼNPK^O;4PKma5 antlr/NoViableAltException.classuT[SﾓP&Mﾃ-ﾐ"U4\ﾞlEﾅKｩ( Hg*:ｶ2緜Z拜H:i-｣ﾎ閭?ﾊqOｱR|韆憚oｿv7鰕__ｿﾈaGﾆｼ桁(ｮcQ%1$#魯JA仰,洩FBV≠2r笙騒箒ﾁ-ﾜ牧Gﾆ鰍ｻX朴Oﾂ}!ﾏyﾃm盍a{麿ｯ危*ﾃsｩﾀ]w,禽=ﾓｱ[J發i巫C"Lj宿6}墫ｲiﾝQ砂U｣f組.Oﾁ｡ﾖﾈ[ﾝﾈW<ﾗｴ~ｶﾒ玻3ﾞj
ﾊ廊ｦQ┼8mｷﾎｷMﾁ:ｽ劼ﾀｺ蚓ﾗySｨﾉ,hO厚.墜5	Tｰｪ｢(LU\ﾂｴ5qL1ﾄﾏWﾜhpW@1hm7ｩgｾｯs,*c]ﾅ雍	]ﾂ[ﾘ&i=Xnﾎ∇jﾗ<欄XO慧饕ﾊ}JﾓN鬚ｾﾎ/yﾝiﾐ2ﾈﾗ珪ｸ掩*ﾖﾁJｦJｺo:VrRﾉ{J%ｱ徂ﾏ|.糠答cﾈ^@ﾔｿｾ0Wｻ坎偬"{N7ﾆ0ｽ0ﾜw	Gｾ*&べ'pTﾟ59ｭｼvHmc>}E`b｣tbbﾃﾑ)⇒dｯﾐｭ!ﾂ俺ﾆｴ⇔ﾈ2彙(暹交?w翔ｬﾓﾏs5澪!O6ﾓ．?9悸c$M kﾐ寒/ﾘIBfｾAy}勘ｦv0,\糊ｩτｺ?b=ﾂﾚﾉ俟;`gU$$U｢jｳ賂ｲHﾑYDsｿPK@ﾃ{BsPKma5'antlr/NoViableAltForCharException.class}T]OA=SJｷ]Vh+雖V汲l?l7げ@lRx%qYｺｦ拯ｶ[ｭ/繝M-F?ﾊxg巾P濛ﾏﾌﾜ9釵;ﾎ涸?(`#原格\用Cﾂ穴8f#違ｦJ0ｮ ｣"ぎ怱ｼЪaTQRqwﾜUp!r犇ﾄｾﾊt价Zｲ-3誤Fﾅ^ﾍ-ﾊﾍﾋそ漁]碆s相-vｫｾﾇﾝ鉞^購%ｯﾍ7fｱf核qﾇsmQ],K下ﾎ.ｷL擾3L廬ｪﾜﾛ簣ｦY%w｣zｦ檬ｧ藥|ﾓ!ﾓﾛﾎｮ-｣ｯﾖｼMﾇ鮒nｴ-ﾞlG､和ｨ｢狎Hixy
$$ｰ2F,ﾉk	ﾞnp騎M[舅!ﾍ0v:嵯ﾖﾁw･bQﾃKXﾖｰCﾔVDﾃ*ﾖﾖ･qｺ[ﾊｲe俾r柢ﾋｩRﾈﾖｳ搆ｪ%ﾋ ﾌ:稗｡浜	ﾃ)Sgim8ｵV旄ｽｿ堤ﾔ!ｳﾑ烽ｺ?Cﾚﾟ溶Aｨ;Iﾝｸ`79]閼Tｯ悸ｼ汨ﾐﾋg^鑛/|Aｺﾙ蔬&b$ｺﾐｲｯ4ﾒ,1ﾂqZﾍc4Nd,ﾟAｾｇﾌ&ｿ#ﾕﾗNｼa%eﾌ2園e名i慧廿Tﾊ鵜%
ｦ心oｧｻuｾDﾂA｣2|*qnﾘI3_wｩ#g-ｽｿ窮+ﾙoEﾓｰ薜ﾞﾄ/D^Bﾍu0晤@潦･ﾇ&yﾖc'ﾌ倥ﾃG Jﾉﾉ}9N*ﾂiJ6Cﾇﾋ跖莖K?匚渋ﾄ%{PK4衂ｾPKma5antlr/OneOrMoreBlock.classuROﾓP=就ｻuﾝ&clTｺn21｢dI鞍?ｱﾕuﾒtFT嚼-jCk;
h乳;忤oﾎ}
`;rX病-,ﾖSｸ6ｰ)ｳiﾜﾄ-[0$ｫ"33岡\+*j*n3(;ｶkﾏﾅﾝﾀ>ｸﾟｨｼc俤Z!gﾙｮx3;┏Oｳ肬泰n(Mｶ+|9aж9槞e(ﾍJLｶﾁ[
｢ﾞa珈n[2*ﾖG荷ｶJﾐ'笊-/ｸ簑bﾗNｺﾛ脹
詁(鐡O]ﾅwqOﾅ}Pﾇ#8SP*ﾒnB,Lﾜ駆t芸ｴ<LCＭ,LﾆﾉYSW"ﾙPﾊcｬ]~E蒄周c鬢lfﾇvﾌ1b耀4｢de戰JR&犠ｪｦ讓	S"ﾟY3E<●PﾆX栃0ﾙ児P縄z#廓"&ﾋﾚB]м_2D4>ﾅ:諮ﾇ]｣｣&_漾墜kｧvquF2C涅達焚-ｳﾐｶｶｪvﾘｶｿｶ;dｳa1PK 2'ﾇPKma5antlr/ParseTreeRule.classuT]OA=ﾓ.ﾝﾒ.･禁ｶやG?(ｱ
ELcェﾔ｣[puﾙ夬ﾖW|01ｾ窿&Z｢&~ｼ熄ﾏｬ鉛}ｸsﾎ=gﾎｽwvﾀｮｰﾂﾈﾓﾋ)!ＲｵQPﾞ:NаｧT0ﾎ牀鯖舞Uｦﾄ9ｵ竄)｝eaiｦZ几0Sｭ	澗@ｹ4=ﾓ豊ｻ%斈Ｏﾋ貅U嶂ﾌ｢m:kﾅEﾏｵ愀ｦ-ｴﾖﾒL[主笙擠ﾙ%ｭﾜX!ﾑ`ﾕrｨfﾖmF{*
^奈ｭｮた冤/
q&U蟐ｷﾞhzsﾒｵ棘榕pR;Yg[ｫｫﾒ%7
z痕@hｱﾑr怜ｼ･ﾄﾄn嗜Sﾖ\)ﾕﾉ環@
｣ﾊ\4逝I佝%GqXy%窯ﾙ?ﾛ-v)j'ﾒﾑ1ﾃｪﾛ10#:f
pｸｷT取樞ﾝgkcQﾕｬｩtV貯ﾎFm.0ﾞk:ｻｧｰｻ杢ﾊ,帑	aKﾄrﾃｶ蟯黏ｳ8ｳXcnﾋ匙cq8=s"､]積ｽEｫnwf昔TvU，ｼ臑~~ｶ?斬纛｡ｩﾐﾗﾔLｸq/4Aｾ矼ｪ銓ｾ
姻tFhC挾u｣ﾛﾓ口ｹ6猴?ﾂ檪}紵懇SEﾞ&P'･#w]XLﾆｩoｧ~紵:ﾗ'R%糴鑄}ｷｹ6m霍ﾓoｧ4ｭ頒~禹:痲/ｰonBk#､鶴漾*ｽ2ﾙ厘ｾ#恟ｵaLﾒﾀC?a@`J{ｳ9ｶ+hﾑN|-ﾀ1Vt慝d).ﾇ3Zﾀ).yｶ:*w0拐8Sd:ﾚｭﾛ&*ｱﾊｺ5ﾟ+芸A蒡｣ﾓｭ^PeｴDｿ崎ｻ{ｱ=4
ﾛF,6D_蛄ﾕF:C)!ﾈｯｵｪU?PK働不
+PKma5antlr/ParseTreeToken.class}Q]KQ=WｭﾕuKｫｨｴﾏu
^2A"H點ｫｫl魄ｬW飄`P=ﾘC?*嗅ｩ賽ﾌ=g恙粧ﾗ7E*H猊ｲ$URﾒKｫﾈ`ﾕ5
ｲsﾂｹ6ﾃBﾍｴEﾋ-ﾕeXf?ｰlK2於Ρ籤pPﾍｲiｯ}ﾅﾝｺyﾕ｢LｼﾉE7Dﾛ驫cZ}SXﾏ襍[ｳo忙ｦﾝ,ﾗｲ姆ｽFｻ號ｾﾊﾎw!ｦ軾ﾔ鉱ﾜk~bﾉ_｢gｦﾛ蛄烈QKE荷!ｧAEPﾁMli *ｽm;v･ﾚVｷK%ｳ#ﾕ､.ｭmｲ"ｧﾒ^]*O-θev:ﾜｾaH漂cｱ{ｳ(<ィﾓｭ{m3@{ｦMHﾅ艙ﾉﾗｰ@v":jｼgxGﾙEﾂJ｣(0ﾝa,酵ﾄ脹腺8;ｲ`b20ﾅ州A堅qﾊﾒ'xﾞ蕃ヨ2倪'押｢8CﾙﾅﾄｿPKｻ;ﾌ沺ｼPKma5antlr/Parser.class･Wy`e}ﾉ&;ｻ勁ｶi寔ｶKﾙl｡ｱｽ ｽ 推BRjZQ&ｻ楠ﾒｽ悃!ｨ\^ jQ+"ZDTﾀvﾁﾅｩ3Uｵ4Y3ｧﾕ;ｷ&kｺﾗdｭｭv\党a矍*ｶcｳT杆ﾑ~ﾂｿU怕ﾓU/｢階qE寤ﾉｼﾕｸ勉T\桑Tﾄ.ﾉ嶺_?^VqZWｱWｱ3ﾞxｺ<ｻ枚Uﾑ$啅睇.~,;Rﾞｴﾏ$yﾟｲ<\ｧ"怺#滑O衷ｸFｰ+ﾏﾆﾊ
HｮF犯nﾄfｫe+ﾂ}=粗]ｫVE*T栄ﾅ&ﾆﾞ(接D#@pﾃJｪｫ=淌Jy軾懸ﾇS%3a"ｬ(匯u週椥i]~瞿ｧ#eｴt艱ｼ&ｪ&#ﾇ'ｿGﾜBf01啅ﾍ[ｽ[ｼﾇMEf`ｨaｷ"ｻﾉﾂ4'=2､=厠vo､ｲ骭ﾗﾜｬ禄ﾋﾉ)&ﾙｧJ坩qﾈ~;ﾌ｢蚌ｺ弸授囓&JﾙTﾌｬ-&ｮﾙ!gﾖ$* y*ﾒﾂﾐ艚ｬ｢\ｧ費Hlﾀ)ﾉYw>ﾙﾙｭ+{ｽu袰`]9:ﾚ ｧ?^#'9cp}#Eﾐﾈ;@Cﾃo蓖0ﾗ ﾑnu%j泣\>/*I.ﾍﾑﾆﾋE.9@ﾙﾎ<ﾆ｢eｬFﾗﾆﾈｦ3樂ﾘ柑xｵｶZｫｴ=WｯMﾑhｾｵd｢ﾙﾆｸ档7;ｪﾇ2xF穐ｽh=謂pｨe=eﾗmﾔ`ｦ!I饉pn=|ｫ>E|奢･F瞻ｼo%ﾞ >Oiz)^ﾄ$~･:F皎z睹'籬NiｙｨΑ諷ｿ煽w･I弩ﾂ_B･ﾄ_ﾆｶｿﾝ"_ﾊ｢､`Vｳ嗇iqｹCｬ9Q_ﾓ}ﾗaｺuﾓyび"f;否甄t*稜彡q聢q3郵wEｴ7ﾛｴ緞￥U%ﾎﾆ;奴｢ｴy
ﾗ廃Lu翫ｭck｡cｫﾅNVGsﾜF縻y堰ｽdｪﾜﾔ穢簣9夷aｴﾑﾙHﾊﾌﾃｼ{$uﾊ9
ﾑ7p?ｻﾛ|Abｲ"jｦｱN+ｦﾋK肥s\D*蝋e峨eｾｧ裸｡Qﾇ\^ﾞSk#ﾗｻ7筬ｷ舵ｹ'ｹ息ｹ組ｪ\^ﾖｯﾋﾐz;ﾂ｡#宜狃ﾝｵ<>KYu｢瞎1ｼfBy⊇y
%J?Pｧ|ﾗﾓdﾃu8ｼﾟDｼ､ﾌ埠8]^A禺(`h｢鮭)ﾄO･ｪ
|~:3oｧCu8?ﾚ+ﾙﾄw/kﾃダ舩XRﾄ1ｮ!x櫛b純ﾘ諄\'ﾙw/xK9xt^[ﾄ2YVﾄｱ､ﾒ>,,?凸|:ｮJﾅEZｱ窃a｡8
kE歃Jｼｾ^__ﾗ1ｺ膿林ｫ惆>ﾊSﾃ.(ｯ畜ﾖ)=ｺ7ｸｳz<|ﾄ蔚ﾝ近/湮ｪN,窗w燦｢Eｬ｢d/>瞰ﾇ巖ﾐ$ﾖSrM);<{ｸﾑﾜ心｡^JA虱ｭﾂE'ｺ7ﾒﾅ勍rｿﾗﾕ｣ﾛr/ｺ
1ｩ姨ｷｳ)ｽﾞ3ﾐ6ﾋx¬ﾓS%怜@;9崋ﾏaｲﾝOﾗpﾑ瘋糊廝o,災ｫHG飜N｢0vｬｭ,bﾕﾅB;ｬ1｣Bｼﾎｲ?SJk煮･ｩｾ0
ﾎ蕪tｫin悵'9\變ﾅj胼ﾈ[ kｮZｻM｡u5ｺ昃Shi.ｲUｼｬGﾕﾞﾗOﾚｻｽ87竡ﾃ ﾆｱ｣*枝神-7PKﾉf
PKma5antlr/ParserGrammar.class}U]SU~ｲ├`h)XﾚF6!$(Tｬ
ﾅ-I	
隔b ﾙM7ｻH捍ｼ朱侮3慶擠3晞G89ｾ2Mfﾟ}ﾏyｯx g~繝faﾔqSbｩｸ･"ｮbﾌ象陸%ｸ翩&ULｩｸﾇ=Lｫ浪嬰%T|ｪbﾖO4)Y%尼)R竅斤ﾝ抽>,q+*ﾉｪk>ｬXAﾓXﾞﾈﾛ
FBﾉ-}G*錻nhﾑｶF.榜
ｻ`
-冉!~^V燵2ｳBA[2o9ｧﾖ寵.世諢!,ﾝ&	IIｽﾝ(ﾙyﾓ(ｰ｡5'Eｧ$ｬｩ^.+8
殷｡ｽdQ.OX9ｧ(將擅ﾁ4羅搜](閘S:ﾛﾂﾗﾓ｢餽1摎誦ｫ,ｬK/u+&ｵ5\ﾃｻ>ﾃ>ﾗ#ｭ!ΞぐｬH;ｹX2ｹ}W"9Zｯj3条ｦｨm痺ﾐｰ奥/跡隻ﾛ
(*ﾐｪ"'ｮe
&bｬcﾚﾉｲ規ｬｵm944#hﾜﾔe}4ﾝﾄウｧlﾓ"(eΘt4ﾓ昧ｲ6-yﾃf2v~ﾒl骰8&ｴ(,=+Q}3護蝨^$ｿｳｶ鳶讎ｰdIﾘﾖ┳｣ﾙC'ｷv･]冱GｵOｯS･;\ys(:-p8w&%.6\ﾎ靂9~l52ﾇ爆l(Yﾇｻ;^mﾙ｣^ｧｻ蒭
ﾎP{m柩｢xｰH瑶ｦﾒ["cW醫４jvﾉcQOo薇NN7ｷ 5ﾋI%d@-ｧ觝￥ｵ$vV19ﾓﾛI零.bﾂｭ=e"ueﾉﾜﾃｶ%痙mﾒK%apX(昊疔ﾛ剏j婉
ぞ｣!鋼ｸbPp拗?ｼ鵝d0z笨IB?/ﾂ.Rﾂ瓊ｺｫﾛﾀ3ﾐ<+*ﾔｪ@ﾅeDyI$侯&ｮｺ喰-票ｩﾝCSe鱧ｱ《ﾒg膓ｪ`ｪ~G纈ｻ盪ﾝy=V"=ﾃ_:ｼｿｹ{*hﾙﾇｨdiuY$ｫﾕeｵK薮員UΥﾟ'ｹCs絛{ﾃ鐫 }､ﾆ0ﾂ
慶	~R誄ﾋ倍85ｹ鍔p膝,ｴ,?悍ﾚ\歡ﾑ@ｻ橋H輟#
	厘%
tｰｰ遨y＾gｽ/"ｮ:ｺk-tYxｻ糸Kｮ愴VgER.ﾗPｪﾈ稼ﾊ涅ｲzｫ〜DTﾐ[cﾖ篋b幄&ｼﾃｼ'ﾘﾈI斜ｮ;ﾂ4k 6ﾋ偶>oｽ9ｬ"ﾅｫｶｰ5V
ｩﾟb
{Xﾇsl~~ﾂLﾉ
ﾒY
Ao#ﾓPKR?鰭PKma5"antlr/ParserSharedInputState.classmPMOﾂ@悋-R
ｨ`p｢		Q姻,B1KﾒD4Gﾟ詠yoﾟﾌｼﾉPﾇ｡ｻqD糎･JﾑﾂM(1ｮｱltｦﾂｻ!Obﾃ@ﾌfｮ7d`MXx|"慓?ﾆ{ﾃFﾛ優!zﾌ\廣ｫTﾋi洽ﾉ耶雅`ﾒｲﾃｻcB)fｖ&ﾂｿZZf+ﾕuｦ1"5!sﾄXﾓjOﾙﾊ苅pﾋ薛ﾈ=里
ﾛ>E]YﾛﾘDﾒ
6b(ﾛp薪(.ｼﾗRｫp7ﾝ題Qｿ4(ﾓ窺:ｾ]ｹﾓ叫}ﾔuｵ2Lﾅ圓zVｬｦﾍy	5iﾑ茜#K圧ﾔ戛j恊_cshｵW鑰0VZT@
膣$l淳2｡尼P尼0Hｩ=/eﾑ,Qﾍak
UK=｢ｺM=PKｨｴｵswPKma5 antlr/PreservingFileWriter.classuUMP[Un^x､'筈BCｱ&$!ｱZcJｫE@0PZZhﾀﾉ}NxﾁE;:ﾖ始\ｹ)3詞A73硯ｵ;ｮ\鷸ﾗｮ徠'檢^"?ﾅEﾎｽｻ釛ﾝ悳?G^ﾀi/p｢g宙v$ｼ,B@ﾒトq妄ﾎqﾐ翦y7zEHHr閧ﾝxﾅ晃ｹ%ﾜﾇﾗﾑ晦ﾇｺ!sﾓ'
iI+m1翰ﾜ…ｮ0ﾔｲ>ｧ3yｵ0xﾓoﾋKrB-&霆ﾁmﾌ/Tﾗ\躑M5.0ﾂ妨Aﾖ繙ｮjs=]疾b周痔UM]悄Uk,竜ﾊぃｵ3[(ｴy8^\ﾔｳﾊ卉?ｦ+%E_｢
90ｩｫ｢ﾇy.麻)/-跿.!減┃ｧｽ箚f8Q朴
ﾗZΧHN9	|u7嗚ｫCcﾉﾈ)%Cﾕdﾌｩｺ5期ｻﾁb>｢せ｢RﾒBFPYVKﾟｩ!TM輓攵!+kZｱ
"g!	!N｢3淞tpDﾂ:白ｻｪﾈ9Eghﾜﾋﾝｩﾞ蓙ｦ[fﾖ!釦-睡ﾊf%d蒼pSｸﾄaSﾝ蜈Eﾋ1ﾄｫS職ﾁl擇04滾#5ﾞ豫+哂YL)Kf_LQ0	g浮｢ﾍｷﾍ病4ｼｿGy5b蓬&ﾝ讐4aﾂﾓ}CC]C筮ﾓ将)狆c1ｩ昼+ｧCA]ﾅvｺ68xcﾑﾌﾁkk"弦uﾀI+ﾀo-ｰLｶhF2ｸ2ﾑ
ﾜ?ﾀﾙ┤q$ｶ)ﾇ.｣n拏2ﾕ)ﾚﾜﾆ[ﾛ貶r;n
ｻnV桓雜fck1M{b8佑ﾙ鱶
:C罵d[%:晒zu｢$PA愬I\$d$ﾋ店Iｨ定!y鑑吮ﾑu･ﾝK8[/	逾ｭGX嚶D*58ﾈ9jﾑn｡｡刎/Vｰj)ﾗﾉﾖ_ｩﾀ_A ｽXPﾊ飃z|竣ﾛ)ｰ後Iﾁｻjn游s=餾Cﾜ'ﾘV畛ﾃ){R>硴晨n毋ﾆ"Suﾚﾙｼ'ｲｵ?H枠N2,途ｦy
aｲj#ｨｽﾊ鵐ﾁ曽2淌J骰uﾛ}$tｽSup椄､6$柞
ﾎT=5+网ﾁﾓl#`ｩCU>jﾍ:'#繰ｭｴav#&ﾉ3'剱ﾕ嫩ｰ6Hｬ套Xﾄ,/j價*｡
(ｲ_De鬟ｲR青0ｭ､qﾆ ﾓL｣Wy退疇\ﾇ]zl?ﾂ
ﾜ｣ｧsLS痂祠ﾜﾂ*}Cﾑwﾈ痣j貴ﾜﾆ襲Ｚ指'tﾁlXbN|JL雄ﾞcﾜe'>ﾄ,Yｳ^|ﾂq衍ﾙｾｦJ亶PK甌/ﾂPKma5antlr/PrintWriterWithSMAP.class抃[sSﾗ志9ｲ|ﾀｶ
ｲ漾plﾉ`Cl
8j n!p	ｱ|ｰｲ腴G陸!6､m.･mR4ｽｸMﾓ6iA射Lｧo數L_;ﾓ>ｴN鮃ｶ%[rK侶^g]ｿｵﾖﾞ銛ｶaﾁ><[季恊S:ｾ縒0Lb改i!SB~:ﾎQ承uHaZGZGﾆ&戸yｦ|EHﾖ懆ﾘ:~ｴb\ﾈ9棊ｼｳ>|ﾕ>ｼ狹兇51ｲ霑RKｸ,蓁｢
^瘧X|M｢ｦｾ衂ｷｺﾞ絎ｼ%ｻｹｪ羹:ｾｧ｡1槃fｭｴ}(oﾏ蓖疆ﾚﾒ
捧ｱL>ｷ棄ﾚ:4g4ﾔ1ﾏ區y;呟%c@ﾃ漠ｳg妬;0ｳfﾜｶｲ｣f.zNhM3b%ｧ｡課X2=粉咎Y;Ah6iﾛVﾊﾕYｼｻ馴､ｽGCｰｫ8咎-ｳｳ9=ﾐ}\;囮ｴ$4ﾉOOXﾙ｣襯栢ﾖ｢tBｴ毀ﾅｵ俵ｶﾖUq焚袖ﾍｬ]
ﾋﾝ5$ﾜ6ﾅｭﾌｩ$蟾ﾒ踏ΝK4t1｡ｻ'ﾓеwﾙｭぴ]dｦﾌT/Cｧ拔8bﾅｼﾈﾓ|ﾗﾉ關
ｭ6棆稟･"ｬPWｵVQJgｩ4愆悁ｫ27vuWzE｢ﾕ]ﾃﾄﾘ7｢､狎aY｣I;;8xx尨30杏
<馨ﾃ.);yﾒﾌ%鍠D
cﾀﾀn|ﾁﾀ!{2'rﾀﾀA,YQ
･mkﾊﾊﾊﾗ!ﾟ76ﾞﾑｰｶf8匍Y2c05gk3p
xｲ6ｷ…x_CK%ｏ躇?:wｲｻｲP5潦ﾞﾏ}､c{曼槍c?1Sﾌ~ｮ#ｿﾀﾇ~雲嫁_ﾓHｿh0ﾕO<#:>5VLｦー(ﾈ皖9ﾌ11Yﾎl*/蠑ｲﾃ4ｬYQf俣UﾖﾐｹｼeM愕鬻@w5銀
ｻV?
笙ｴm&ﾓｼ 啗sﾊ;ﾄeNNV|]ﾖ^NMCﾏjUｬbﾝﾄｱ)rd隲(=kﾍﾆ黒ﾓ@ﾖ@BRｬh&秒ｴﾉLZﾔｼﾚ&靜eｲv)｣RI=L;ﾃ垓ｬ7蓿4Pﾍ'ﾌﾜuﾞV｣HｸﾜiuX儺	椽Tｶ%O<碧YKﾍ｣$Jﾗｵ6@峠4ﾊﾓ\#ﾐﾂ[ﾗ-ｸﾂｷ[ｼrﾖﾔ
J
_$D-i<|`蟷ｭﾇ:ｾｭ-ﾘ員xﾐ ﾚ辺'ｧ	:uqﾝ雫-椰n与襍／CﾚAｯ[5Lｯｽ<荷ｫ･jﾜｳﾓMwIuｳrz`ﾕTﾗﾜｳﾗ-wIｵ瀞ObﾈﾚﾇD%ﾕu:合雜l7ﾀｿ40f-唖=･注ｽ詩b｣j｡	｢Jｺ擴ﾂs(ﾅF)Mﾞ{ｧk枅ye|ﾚﾚﾇﾜm}枅OｳC4#ﾍ椌lｻﾑ跣撞ﾙｾﾞrHｭJ4n慣MpﾒｦﾚNYJﾄJ3b;Wﾊ>ﾂ､ﾏ｡1ﾔ狒.{|t｣tj]ﾛｯｱ9Ipｨaﾍ
韶yｸeﾋ7ﾁG埣ﾌ劑B死9溽8^釖Yｳ*ﾁ･"ﾎ磐CL'ZﾀCeckﾕﾕs（ｼﾀｦzQ)uc2ｮDｦI)珮%lQﾄfG%6/ﾑ錵b2o沂ｼ/ｱ/S禮i舳8#_ｯ/`gxeｪﾅ揉ﾞ&｣}祇宍ﾒEf畳'%5ｯb^%}ﾍP-Zq鞆､'ﾔx?PK鉈YｶPKma5$antlr/PythonBlockFinishingInfo.classu節KAﾇｿ展ｦ拑圜ｦxｫ(A*0zｸｷﾚﾚ砥-ｳz8｣｢ﾙC活餅ﾎﾎ|f粧ｷwMﾔｳH｣斑ﾊF6控卦ﾓｨ･ｱEﾈN｢ｩ檄*鷲B｡=zｭﾐ謄ﾖ@ｫ@試草ByZﾜ	rﾟﾞｶﾝﾖ･0ﾗ3･"ﾕ	ｽﾙT鮪Bj燠`u｢踴邉｡PWﾞ0dOeo]ﾗuMNvﾍ/ｺ♂k\>q$Oﾃﾈｿ2z:貶楙忽&ﾝﾆ*6桝ｱ打轄+mO鷄ｵK'ｬﾔｿﾞ	_c裸疲Z|	ｳ唸{ns云厂ｬkjsｱｭ:ｯ b,8Nﾊ国粹X1ｬ舍ｱ務乖M.PAUﾖZ+ﾌq]ﾆ岑Z;4ｸｺ!5b,:･ﾟｼｷﾔ燮`ﾞ6Sv仍ﾋﾔ=(&ｭn|PKﾊLhPKma5antlr/PythonCharFormatter.class控KOQ.}ﾌ0ﾈ0HE@ﾑR(焜 T迫&｢8@M搨:ﾅｸq袒ﾄｸs眥G篦MﾝT｢+W
WF<ｧﾓﾖ.lrｾsﾟｹ逵鮃ﾟ淦霪uﾄU4｣S｢K｢[邃ﾄI唄ｧ%z$zｩｨF\｢g1ﾀ｣A鋭Cﾃ*p^ﾁ8ﾃ(CＦ/H験WpQﾁрI≒`ﾒIｺCｾhﾛu"}ﾗｨ扣:L喋Yｰ乏ｴ｢ﾚ妙u;ｱfeﾂﾑﾉ嬶Sｬ
ｫ+e9ｫ]n&鬯TﾟﾞMﾓｼ温+p,駄*ｩ､kgｬ肌ﾒ擣ﾈｪ)ｲJ黥:婪ｶﾇn聢#w-ｰﾂx:sﾟr蝦ﾉ"竦VｨZt\ﾃ"ﾃqﾁﾖﾂＱﾝ｣ﾙ廁ﾅlwwｷKｸｬ`Jﾃ4ff)蕎C)%ﾇ"Y
sｸ"+iｸ楽
ｸｦG
ﾇ@暦ｷ7暮ｪ袷Tf齢ﾙﾋ~ｽG/#ｭuﾛｹ+ﾐ_悔昿億ﾛﾙ冲\{雰､.蝎垣ｹ {｣藍
+雰gWｸ忠褐`ﾊvVﾝｵBrK.ﾓ;F鏈~ｪ|ｩc#8@I<ﾕ条0ﾍx瓶@#ﾄｴI$､ｩｭﾁO>3并ｨ嚔邯*ｪﾀ姥ｰVZKGﾄﾑﾎ/=wｻ MdCsﾀY
ﾙkﾍ'ｻHｶHvﾁﾎ芟`ｮ､｡ｼCﾀ窃8ﾄc5g鼇^!d齒ﾟ筰ﾏ|Sｯ}賺ｨｾ啣読Sﾗ7QK<悵驤Yｭ]ｬｺrV捩GｫﾝM3ﾊi･匙
&di:a=ﾆ0iﾞ1ｪﾌﾕe*rX)JCﾊﾟ3j笳這<ﾚ1@?qｔｨｹｹE裄~F樢
Eﾚﾘｭﾅ:(森{$洲_ｽｨｦ滲ﾄｻｭ;q ｣rﾃﾀﾇiｪ機馬･嶌ﾆJ塾biﾓﾉf箚&稽ﾇﾛCｽﾀ葬Fｨ^&K*K$ﾛﾉW｡PK|*s=PKma5antlr/PythonCodeGenerator.classﾌｽxE?Z=ﾝﾓﾓｻﾉｶdﾙ牧Xg%ﾋr[N2凋ﾈkieKZ｡]91&#ﾊ(r42嫣棟xd8G<ﾂｫ齷
^匳{{埴<ｳﾓｱｺｺﾂｯｫｻuﾏﾀ#Pbﾕﾇｧ鴦娯ﾏsy?ﾁ_暝"=^ｲﾋ~9ﾉｯﾐ絛zｼfｿ!ﾋI~oﾐ絎?ｬ輟ﾑ緡|ﾇﾏﾟ襃)>ｽn隻_ｰ蓍ｱﾐ'~ｸｪgOz|ｮｩWﾔﾈﾗ>
ﾑmO,(?R溯3=~｡｢ｿZ?T7?吾ｿﾓ繽ｾ[?a		ｦ洗ｰ陦ｨk
ｿKe(a["ﾓS~ﾌﾎ｢從Tｦｻｦ綿ﾃ,ﾌズ"G応ﾎ･^庇[>J)ﾑW厭碑ｧD%(1ﾐ'bΛ%ﾅ09UNﾔIｾ沱*
B"ｼ2)c$*Qb｣%ﾆPXG吶娩W	~ｱ(ｰﾄｧﾄJ琵蹈%&ﾑ{ｲS|ﾐ,ｴﾄA4W/PUPb*qeｱｨ軍ｦﾓc3葺･ﾄl%ﾊ葺｣ﾄﾁJT(QｩD福#覲｡yJﾌWb他ﾐ核%ﾑﾇb%鳳sK馗ﾋqﾅ
K｢ﾄ｡~q乖Qb･Aﾊ]ﾓ)j-Qﾒ BQo苛Jｬﾃ覆A嘉鮨椋ﾖH=6ﾑ｣Y0坐E#派･､Q%ﾚ嚢G\OI蛮HG*qtGﾓｷ8ﾖﾇ痿艀%N*幄q｢實楢綸z廝撈Jm晄gkﾛ牌:=ﾎ@g*qgﾓ9J廳枇ｽﾏW%.T"%.規h賍娩篥泓*q燐L_Ad]I姥ﾑ緞z\ﾗ危qｻwV窘j%:蛤Q央蛤Y閏蛤U課|ﾍ鈿JﾜAｭﾜｩﾄ]JﾜMﾟC夾ｼ[丙W丑%ｶ)q+*SｹG肺ﾔ|ﾘN晧ﾇc4
+э"椄嘩I顧･ﾄSJｶRｼｦﾄﾟｨﾚJｼAﾙo*ｽﾟV%ﾞU=ｲ+>･]wQ@ﾒ/飾ｨ+路罵,押ｽD3N伍ｳs)szcﾍ/櫓夙)薔%ｾR稾%ｾQ秬J\|ｧﾄJ@%M}'ｳ沱,>~Q禪%｣ﾄoJｮﾄﾄﾂﾝﾊ?宸ﾝ廊ｧLｮL4屹ﾟ箸'ﾚｴ|*z\M縮畠秘供L?vbf(ﾓVfｦefYf7?[ivWfef転ﾈ｢ﾇｳﾔ\ﾊｯﾙﾓ2sQﾍ^挽[凩漠G?*sJｧﾌﾊ@?*3ﾌAsｰ2(s(j9L凖9B咬ﾊDｲ漂､ﾌbｻﾔIz犬ﾇh;ﾕφf七ﾌq9ﾞ2ｵﾌ	伴絞祗rﾁ<(U襯ﾋ怱ｬ5'ﾓeH]､ﾌｩﾊ惡ﾌ2eNWeﾎｴﾌY~v)Z!lﾊｯﾌﾙﾔZｹ2(`涅ﾖｬ齦4ﾓΘﾁｬR觸?;査q噎乏!!ﾚ并魍YHｿｪ併H刹併З]Je!ﾋ併Hﾎ｢f!ﾊﾖggo'ﾘｻ&4>謇~sｳy:ｧ(Tﾊ;混l2OWhSﾍ3冨ｽﾏV9>ｮyｮ2ﾏ｣7Z毆ﾍ冨2/T襴ﾊｼX剽(ｳ]兌輩ｩ2/S趺ﾊｼB儻**ﾋｼ嚠ｻﾗZ誦ﾊ${cﾞﾌN縷ｸQ7)fJｿ踐VTf6eﾞｮﾌ;輩ｧ2R赧ﾊｼG兌冨ｯ2;6>ｴx*!4貪hIﾍG頌ｨ2ｷ+s2S跂ﾊ|Ｓ櫂3ﾆﾟQ覩eR覺ﾊ|Z厮(Ye>ｬ"YX)~$=ｯﾌ毘W驪ﾊ|ﾉ/賤ﾊ|E勹*5e紘}]冩(Me"6i6ﾟV&6ｮ2ﾟS踴ﾊｻ2?P諛ﾊHP貮ﾊD辧*3eS辧ﾓﾄ|｡ﾌ/捧2ｿV7ﾊ2ｿU誣ﾊ榿q櫁1ﾔﾗ礁王gﾒ廟hﾖ~%Zｳ陦蛹ﾐ懐ﾏ](sｷ帳$SﾒP+)4部JZJ*%}J蔑PﾒV2Sﾉ,ju)YOﾌ-ﾉJP2電ｪ珠ｩdｮ朕肥ｭd%芦ｷ菩犠ﾋ}靦OﾉJPr%)9Xﾉ!ﾔﾔPｴﾏr津｡dｾJ*Y､dｱ#,Qr白h	NCｳ*ﾇ(9VﾉqJ燦r_%'Pﾛ)ｹｿ(Yｪ腑%')9Yﾉ)鍜艨J"ﾘｸLNUrｽﾋrｺ怐$g*9?L,9[ﾉr)ﾖ*9GﾉヵｬPｲRﾉ*%*9OﾉJ"ﾊｸR断ﾋj%)ｹXﾉ%ﾔﾞR%)c暴｡!T澑zFﾝJ%カｮRｲVﾉ:%CJﾖ+ｹ(XC6Pﾇ
3pﾔ+ｹH6｢ﾉ&jｴ>ﾃﾔS拠Gﾐｻ(UｲMﾉu暴c/7｢4ﾈ
勿7>竪ﾒ(zM縦鑷,=宍蓴>ﾁ兆<ﾑ兆-y鶴F朖縦駲=縞S<UB曦蒋ｩﾗ3ｯ莚JﾞF･oW叩ｼSﾉｻ半[ﾉ{鑢+eﾝ遇!｢ﾁ喋勿ﾆ ;ｲｱ9ｬ6ﾔﾎk
ﾕUﾖｰrruｨyﾂjXﾎ@EろBﾕ｡
Qｬﾐ\jﾕﾍh5團ﾕ蝋qxp]pTcｰyｨﾑﾖ贏&瞭ﾆﾜﾂﾉ鱧ﾍ
ﾘlｷﾚpSSｸyﾆhkpj	)くﾁｦWｪ"\l\lﾅﾕｳ8ﾘﾘvmｨ
ｵDﾂﾍﾕkZﾃdF飄UxqCpU#冶ﾞ}ﾍBｭSkｩ )7G｢ﾁ讓ﾛHｦ`Csr速ﾆﾐPkYc0ｩ
6QG-ﾘuRJNｴ5Zl\對啣ﾛﾖﾚ#\ﾐF暝ｨﾀ^[GﾑﾗｴﾆpZdQwｷfA(ﾒﾖH権ｦpl壻ﾊ`ﾑan[ｴ｡qﾔ`dM排ｰrﾏｺPmcg
kﾇ* G`ﾓZﾕﾖｴ*ﾔﾊﾀW5ｷjQUE3挨ﾁHhaﾃ!dP(ｲ&ﾜXﾇqｱyﾍoｨ画ｫtﾉｬ
764"｣啝G-ﾆｯp+kﾁ	桟Wai枩ｰ(ﾗ_*咾Nｿﾕﾃ$糲`]ﾝBｧP樞R"ﾚﾐ-ｯ湲ﾚFﾂﾔｮ	ﾕｮ-s4ｷ-ﾚﾒﾅｲ｡`#DBQ-ｯ媼屶4獄､ﾌｷ:営ｼ′ﾆｶﾈ夛ﾚP3
ﾅiﾈwｹr%v"酵/ｫ1jmFﾖｹﾓJｹ}cｹ:iFs]bﾕｱﾌｲ5ﾁﾖｬlLﾌWﾑｰC+ｱjyﾚ!豚ﾄﾌ
%6ﾐ;房A;uｧ)ﾘｪs3b:Ｄﾌﾄ1:｢^隠所ｫ帽#^ﾈQﾔL=Taf[sm悼b栽mﾍmｭｷ&pﾇc<ｭH貨yﾕHM50也t宕sb%4ﾁ寮ﾉﾙﾉｭ2Qﾓ7)y"ﾅ^｣KjΟui{\j
ｧｲA婢ﾒ4ｲ4qo粢ﾇ壞｢善ｧqH洽l9U9U｢{ｫ癆pjdQ
靡&*qd
マｽiﾛ]Nﾌﾃﾙ(oｮOL/
ﾝヲK!刳)`X<ﾒrm?&複ﾍﾂQ3喞$擁｡b0ｱK-Eｽ特0Fﾚｴｵn%2flhAｻﾑﾔJ7gﾋ化ｼmO(丶ｬT朖^Y0Zｻ{r3ｾ髴ﾙﾁ貅F2譫窗jｼｰ%Tｫ嵋ｮnﾝ俘Hﾇ衆ﾗｾ"鑵zﾔ^HJ?Sｧ鰥yﾖﾆｩ:qGｪsﾄI崇CBcm6jﾝuD｣80ｮZN号<櫁2"H%;ｦ樣ﾔｨO斡*,踐c皎翅{'圜娵'.ﾗ墺c亡ｦｼy"ﾇ､｢槁偏9ﾅｬｫ[Jz]kcｳSｫﾀｳwN#ｸ]丿ﾘI8:ｦSpｫﾐ?3c4ﾖHﾂtbeｰ9ｸ:苻5ｬN[ｺ
ﾅﾜﾑｸ?35i旌鱶'ﾍ0ﾒﾕ榻ｽ､+sｭﾗﾗ惰$*蔭1+21=6ﾈOｧﾖ驪Lｱ:ﾔ癌d|~欹ｪtｭｿ鼻w;GK蹇ﾖﾘﾔﾊ/Oｺ7ﾆh,称hj穎L偖腆｢#洗d6疊cﾈﾕQﾔｦ`9ﾈrﾜﾉi&-	HUｷ#ﾚﾈｦmｻ巒Vﾕ｢9hi
ﾗ"W懋hﾈ｡1pﾔyn:
ﾛq/DX
1v･8ﾈｬID9xDZMO;H
､Bﾞﾖ*運юｹ8ｸ昵``MX､%XD~ﾑaﾗ$4ﾅﾀ;ｶ#
No;2潮gｯ亂ﾆ蜂Nsｰz]ｸﾖ*[irﾓﾘG
g'ﾕ6ﾆﾃmｭｵ｡
4ｧ}ﾏKcG嘘､ｴ蛩ｼﾀ薮ﾋpﾏﾚ!^gJ>ﾇ踵侏y堆及ﾂ4ﾋ#ﾄｧﾚ|=ﾊxｺDgOeｨ)Eﾚa-･fﾙｶﾜ.wﾘ1ｸ-汾OZrｧ-wﾉｧpvf瑕Yｨk｢瓠徇､ﾄ飽s蔔8gｫﾚ辣措｡VﾏMﾇｨﾔRﾜ` ｬ'7ﾐ	4｣徙K>cﾋgqﾌ9~ｵ-泓/0嶂GﾈｿR梢@ｳn濳ｴ
`N}kｸﾉIp拑鶚2･zM(pp3ｮ増劇！&ﾙE%_ｶ+ﾈ:ｪ|ﾍｳ褄)[ｾ!ﾟD鰄ﾓ]ﾘ-ﾌ譌ﾋm6><｢>ﾅ&ﾉﾛ]-ﾟｷCK~dﾋﾍﾀ佰衛ｩ!<ｪ|ｮﾇ%[~"?ｵ臠ｶ'ﾎ只#ﾏｿ ｸ神dﾋ/藐ｶ壻 ﾐP2ｯｱｾ､｡Yｯﾑw噴n#sﾚｼｺE4ｭﾛ徇>儖ｱ=|ｫ-ﾅKpｾSueZ[}=錯[!09_ｼ龍ﾃQ岷/ﾘ|ﾍﾙDPvJｬ控譽MT佞8Qu挽ｷMﾌﾖHｴl
ｮ$ｼHxNBSｵ発ﾛ龠Zj隙ｰﾂ
ﾁｺuﾁ賍.Sﾆﾅh~%ｰ蠢蜿Hjr>
'ﾓｶFｾﾔ鑷 朋蒜?7ﾍ廠ﾌ瀘|Qｳ.`GﾂIｴxj痍bYlｭｺ覆,覘е!K	T祀Wz5p*oｮmﾀVЁ瀦4啗Gﾗﾐ8{霪&qﾚk豺ﾙr7M/ｴﾙﾐﾏ‰勘PNﾝxﾋｶﾅh奧ﾒ`3袁ﾚK6:*X+2:2d[Nｹﾅi$#uIｰTﾔ式	ｵ堋uﾈｱH廻ｻe")v店%z$xｰ1R窰疋Z｢+F坂+5)0blﾉﾘ1#p}堙Xq4
Oj冫T｢;M 篇Q芍5｢ｚd,ｶ%ﾐEi侠ﾙ@YC-ﾊ-ｹｶiIﾛｲﾈ･-DmKﾑ栗ﾇ拙冓ﾉｨ･垉n@\ﾟｰﾁｶ2,/ﾁ｡ｶｬLﾛﾊｲｺｹ4ｺV.ｶﾀNﾐ5ｺ_8｣竺ｭVﾛﾊ民!3R鋪ｶrｬ楔斌|GRﾔﾁo8}ｱ&Wﾔｦ1海Iｭ>隋ｾｵlｾ|ﾖ<暗ﾓcAｭ(･ﾁ2R窒@ｩﾍ｣ﾌau｡@M
yﾊ囹|ﾝ磧aｰu:|ｮ]樵"X｢膂
｡DkﾁﾗﾁｾPs､≒]E|荼ﾕ慾ﾝ
~Xｵ｣,ｱpｾmC墫G&0-W+J09#+hｼ+lｫ沚｢謀cL龠､.FjUﾎ#朔75ﾇ望ｶﾕﾟ`ｿm~1ｲﾏ勺
Xネ~oｵJｬd
ｦJｩjj(j[Sc{y'*,ﾍ,-<ﾓｩﾞ格吩ｵ臠U互^
3Mﾃ{/礪Iﾟ壼f<90"FﾁRﾋえｱｦｶ9笠	zﾛﾖP/\ｫqﾆz4爍ｩm)ﾚbk藁
G7h座ﾙｴYV｡e瓱1癜"･9ﾜｼ》ﾝﾆ@~IIIAQ}ﾋﾄZu鐃ﾗ箍5ZPﾄ+2Qｽ踪3ﾎO`ﾊ菎mﾆ撰(画*ﾔ莊aｽ'ﾆ配BﾜCｹﾚ:tﾛIBﾗ+麹@貅･16櫞鹽澄ﾌｪ苒､鎮ﾐ.ｴ*帳0])U$抗EI]V Gﾒ/籌､ﾟ'ｨ1xﾛ:厚ｬｱVﾚ戛?呷ｨ虔y=ﾂﾝｶ､裔ﾉgDoj｡w\eﾕ"E｡Fﾔ竿Ο鞏@a｣
 Q鶉!7Y1q叛}繩pｻ
ﾐ4plｾ+Uﾈｶ:銀5Qb|F\k数zDﾗﾖjk肯5X3于0v00W]C-ﾉ
cｨｵｾｱ-ﾜ	ﾐlRXｰX彿ｶｵ-6?g[ｩｹ墾,[ﾛ$ｳ盾Hﾃ･悔!2ｴﾔｶ7[ｶ&對P ﾜﾔE]bpu鰌pﾛ襾｣廩ﾖ+ﾅｦV7[ｵWhVjド､(ｳﾑｱ#ｫqM唖鐙ﾅｱｷﾞ匕Bｨｾ梍m]h:剏A1Oﾂ4ﾙ豺[	H_Gﾏｦ1Sf榜4vJ@ﾏ/!C&5惚狼ﾛ手炳ｦ蛇&5宏ｺPK@}C+ｮﾅ嚼Sﾎｩﾍ+]躬ｿ:%i苅4領[0czyYuyﾕｬ窶ea[ｭｴｯ龝	&･tｲ%ｼ]ﾇ4}<ﾚﾔBﾂ％cｻIT%Ｃ=;ｹiﾍIOﾅA:･Hm~ｿWﾇ計W'nﾔﾗ|]f0)ﾟｶ"､ﾍQj)oFｳﾋ2齔mﾔｸ%ｶﾍZgYmkｩ}ｯ庇Qw耿ｶ6R礬ｸee[GmX|申Zﾎｹ!8K笘ｧ┸徴ﾑゐﾂ5ﾔo
 ﾀ濆s=pk&=:ｵｪｺbｶw｢^乱iﾝLc9家"#i｡h牟l<斑>].iｭoｹ ﾔpｭﾞ茎新`d ｲ&ﾘﾘ ﾐﾟHｴ試qdﾁzﾁ獵_ｮ衲:ﾇ	;ｹﾝ'э#6L耿ｬｹ4幕･mﾔ#ｽ0Eｲ(ﾊ剣pｽC拊Gi/AL山琺､lDM頒t<ﾄ/､;(ｰﾁ?+!rm篷U!\Dｧ	!詞ey}p河ﾏ疊ﾛ\
a鳰δﾚ`3ﾉ&｢紂-譽ﾄ塊'8E/覡ｨrh盈dｸD<ΩケMｲyﾜN｡ｨ筰ｸｲNﾓｱｱ6ﾄ蚯竊|ｷ*ﾑ#/ 3轢ｶ朴3ｶAｨｩ0iz荏gvbﾅ∠HC俶ｸ8%BB痞]ｶ､!稽｢､湊ﾝﾂ.ﾚ差恩bﾋ!ｲK｣]ｶｪOr8｣､9絎qｦr狠Xﾅ輌ﾂｲNｷｭ3ｬ3i9w-賽ｶﾎA-B]劃[銓'm<ﾝﾑkｻt廛;鰹?ﾁﾕｨｻf:8偸┫ｼjﾔ岐髫8ﾔi/ｨhﾀﾆQ箒sC<撮TﾌFo蜀ｦ0ｾﾊE%灰ｯ│ﾔ]Te壗"芍ﾐﾗ｣閻閂@圜>Hｭ･ｮｱo:顱Iﾃﾝﾁh3FB映歟ﾒPaﾝ５撒ｹﾖ[ﾄﾍﾞdﾁz:りrﾇ0蓮ｴ｣宵ﾐﾐ"0Eﾘd0ｾ之ﾋYﾘXﾓﾔ{~ｶu5;@ﾓ^ｯlk:Z]15	ﾇｰｽpuuJ;@｢ ﾀLﾓ塹ﾗﾓ襴ｦ(ﾕﾓDﾌﾊKﾜBJ\<｣T$	rﾆｩZ.hﾎﾒx眞褫ﾃj[Rｨcｸgｪfcｦ"叙ﾉP#ｱ閧06ﾈY酳鋤ｱGE苻芝k qﾘｫS膩ﾕ\>5Gﾚ咤ﾄｨ^髦Aﾞ｡ WFﾗ74ﾗ袮4河恤嶌
袍li	7ﾔiTlhlkEL蛻.ﾎP}\ﾓPvﾝﾎﾉｫﾓR!ﾒﾉ吃ｾrﾌCJJｺｰ_馼ﾒ%ﾌﾊｦg&ubﾒYOﾇx薩n6 ｡ﾊｵ!ｲ椎{ｳ{ｱｷﾉvﾜｵ篆;抄94ﾂ\l]b[ﾎ^ﾆ嶋cﾈvﾚ|,-ｸﾔｺﾌB寶｣ﾏﾋ)耶ﾈ
ｶ
7Fﾘ3ｸXx2ﾝ｢Iｻｼ裁wｴ鷽ﾅt7Gﾇ&咳涯ﾐJﾗ弔80奩AGﾏy],廱ﾍ!j#Vｽ	Eiｷ5imRJ+ｼ｢ﾉM射y
K喚x採6ｴj片T､Cﾆｦ[k5ｿ丘ﾟ<泳ｰ｡4ｭ\ﾓﾖ文u埠5暎Oﾐ潸ｸdhD蜂=rｬｮ｡	mmｬ&2V剏X]n?ｦ-#鹸揺
bU繙`0i_ﾊ榮
'x?yJ>魃ｨts((Xﾀﾝ,6j(狽@(粮ｻ[4ﾔ嵒姥P于ｼ&/ﾕbﾞ千;ﾖﾉHﾝI腑ｭ6憫P]H衍ｲ翌3ﾑﾏ8･ｺﾕ$	ｭｰｭkｭiﾘ$ﾛｺ事様確]ﾏ;-ﾛ槇	閘ｩｮ7qbP4ﾟﾙc洲obﾇ旆YﾛSｲﾇ9%蠢)｣<非D憲Z$裁tｭﾅm@叭gb1｣ﾈﾗT/1｣ｦbﾜΙﾎ1uｺW"Mざﾊｪ哘g,H?V#)'ﾎY鯒ﾖg既}[z:%ｳn｢椅zNｶ(v@.PIzｧ9ｶ.ﾟｶnｶ.ﾓ~i0ﾗQ弼ﾚｦｰ
b癡9
ﾅ-ﾖｭ67ﾚﾖm|R%M!ｺBC.轟jﾚ菲ﾈ=ﾏ:ｱﾎﾙﾟh7蕉aUｪ6ｬｶ駭ﾕ澗$ﾚｿ旻n[wXw端ﾓｫd`ﾃﾅｶuﾙﾈｻﾃｵｽﾇｶｶﾒJ饋棄r8>ﾗ贊ﾉ叭ｴｪaｵ&Y9!g9L筵k,ﾗ陽ﾑﾑkｶﾕI':彿t#ﾚ-:ｾﾖﾒ!籬6ﾛｺﾏ:ﾈｶｧ5ﾞﾖΩ染ｰm=b=ｭ獗A3ﾛﾚnJ､[｢ﾝﾗ朶TtOw\龜HﾓｼXl
ﾍtｦﾑ｣1孃胱!ﾛ:ﾌ_ｭw逹ｶ､ﾍGG｣奄&メﾟ剴j\ｫﾄN汲派當Wﾝｦ6Fﾖﾗ^Sﾅ,ｧtﾊﾗﾑ@gｧ遶6~yﾍﾔﾘ	qﾈｮﾗE恕猊LPﾚhL％ﾖﾈT盻8ﾋ蜿/ﾌbJｪ&a8ﾉKAｳﾂYﾋI罘ｸzｵﾓｶvYOｹﾒ\ｬﾊﾐ?er化･ﾕsQZ}(2ｶﾅﾕxIﾋFﾛzﾚzﾆQ蓿Y:67r}ｰｵYｻﾐHﾄ=ﾚﾒﾛ｡Ntﾞ"r懣ｶ|ﾈz(ﾒﾐ襷ｭｨk｢iAd-不ｼ-ｵ1ﾛz樞倍d#NSｱe殞ｽ@Vqj$k穢[ｬFJｪ一ﾛ}匏温ｼ寤
甓( ｸ､,酘Т	ﾉ8I:jHｭ$ｷ･V糶%ﾓy3ｦ-啅S6w建Y3ｪf,六=w!mi	%lｭ%敞椽麪│亞4ﾒｻC(ﾉｺ苦05ｲｽ+眸液ﾑﾂiY減
ｱ穩ﾌｭFロn畜ﾄl｢ﾉ旄ｭ｡ｦｺﾐTｴﾁｫ實ｦ勵皋､5ｓ檠北ｾ4単ｬ
ｭ	ｮkFｹDNﾗｫｮ､S痩槹J揖ﾗ\N耡拗ﾗG:]AﾂﾑﾍX"驃nﾚ曲ｺｨ6ﾃk%ッd
ｴ､aｹ3@;ｻh967nD沿ﾐｻﾉ(ﾚ1)WｱF､ｶq繿$}cW3*ﾖﾆvﾌﾜｼ蝦DSRｮT･ｩB｢ﾐ]ﾇﾞ$ﾚｻ9部ﾜFｪ-m劼ﾞYﾛF･ﾓoﾎJ+n･ﾒK箚NN1d庄ｾwaﾈ雍s]IPｼ系"ﾅ(髢rO輙O征o/E+tﾓzﾏS7KGｩWk悒ﾏ蘆諦ｰﾓL箜ﾉ国h"ﾚ4鳴qSｺ)oﾗﾝ螟iEODT;R\Dﾗа粐3忘Gﾋｯ&ﾚ抗ｰ|/ﾗt;ｷhｦｶEﾃｳb料zﾅMS粹Qﾀ戍ｰ尽ﾎｯnﾞｺ4f"ﾍ冒3kS+睫8~ｦﾜ*傷dｮX$ﾞﾄ夊L旁祇oｻﾖ
ｮ霙o+ｻﾎﾋWﾓﾎ?皺ｧｯ=ｷ;\ﾁｯｴgﾍﾑiAﾚ椏&ﾏsﾟ/昵ｳﾚ奏Wﾏ恚P>ﾓ喧腓ｦ.范9猶(ｽ宸ﾄﾜ)8CX.)ﾙ援ﾟHPﾒ\ﾓ17aZm蛾ﾘｸ>ｼ♪刺ﾓﾒz+半袈ﾎﾝER,ﾞ穡mpUz総{ｹ^!#|ﾖｦeｸ{!5ｮﾊｧr
ｾ7ｬ･･ｾ>Ｍｧﾓ.ﾞu6wcﾛG影A\7c=ｯﾐy軆ｼ$'ﾐ54GfｴD5ﾑﾋ\}ﾌﾈ-隹;R0~\ﾓGﾇi}$褓ﾔｦｻﾊT人ｽﾉEﾈ:}3ﾁﾃｹN菊眸ｶｦ踝-ｦt{ｩ｡ﾎtﾞﾕ皴Fﾇ\ﾅｵ\(Hﾛ.蓚 xﾉvD8轗rﾒﾜ慰瘢dsDﾒ\&ﾘ/:M喟ﾐ符xｧ｡{r-ﾒ杰$艝^窟B"vLhﾟ=+ﾄnb冉m｡ﾜ)涙v}ｹ>-揆Hｼﾑ暇撈I]燼ｪ%t/ZGｸｨ鞁ｹﾌﾕｭ磆ﾕ碪賍ﾆ6ｺeGﾔｹ;ｴﾑﾃY7W娶/	ｷﾒﾁsﾝﾄXﾐ"ｦｶｶ7#S+謳ﾕ亠ｫﾑ｣ukｪ{ｻｻ87p5澗侯z鈔ｮｽPAAｾｴ#ﾑH-bｲ
	7莉%ｲﾍ$M=ﾝ=eﾁ詈t	9ﾔｪ7褪{ﾌ9'yiｳ｢痲ﾑ@ｽ&ｧ]ﾞ･McDｽ>bﾖ截｣褄I;ﾘｩ貨9愛ﾏT 池(羃ﾍ&Р探ﾅｬu流ｭﾖﾑﾖｬﾆ+w	ﾋ;ｩ
ｶxk{bgP粐佑qﾝ敷<ｵﾚ渕ﾉ箴7*9i禎JE歹禍y1ﾝPﾘｰｹﾎ餮:徼ﾕｰ,ｶ0E疂Thhs[ｧ7ｬｦ?裔Cｱ夏ｯｧｿｦ*ｽlﾌｰ｣ﾔiｨｳﾗ_bﾋｽ札X@蹕hf=ｾ*壙"ｴ_Hｫﾎｾｪ邦ｼﾒﾄﾑ\ﾏ~U｢ﾇ〔ﾜﾒdｸﾍ猪96♀Bｳb+m3\$欒ｶ湟ｧｭﾀ?ｫR_ﾀｯ軌~F4ｼ(蜂釐tっぐo胥q3>yuﾜﾕuﾅ舮^Xﾎｭwｬ=]Q純-休･,ﾝ`ﾂｽn5M-ｫ.歇EBｵﾜ｣-ﾟ@u著6Q/^ｽ斛ｿ."ｪﾟｼTﾒ|ｸ萱.	/ﾆ~ｳﾅﾅD=ﾕ]ﾙ滴ｼ｡ﾁ]Oﾓ授ﾋｨﾞﾍﾎzﾒｱ企扁Pｵｶ:`qd･ﾞNtｺﾖｹｯp>@ﾐ鉱%鏗ｽ~7PdZｿGｹﾑ{口ｾﾇｹ{_=Aｿ~f|mﾀ串}@ﾂ3Xｮﾔ-?ﾑ}Orﾟ廿>ﾐ>OﾕiｻLﾓﾝ蒸$t?3ﾛm倫ﾄｳlｽGTﾎ軈ﾎﾁ54ﾝ涌ﾚｧp+ｰk _F6ｱ匈爵_ﾞｹ係3>Aｾ`	覽zmｾ,ﾜf!ｿ$=,zｨﾂﾁｷl効OｻPﾜ咥揣ﾟﾝﾝ#ﾞa!vｰｻ>.aﾇaP%8ﾄ｡8ｨ*>ﾗ%､ﾄ
%ｻｨr鞏	=Eﾝｭ^ﾛ~]"
1e7鰯朗濶ur;｡W;R価ｲ{wB8eY@+ple-Rﾔ┸ﾏZｨt{ﾏ#Fｌ!ﾗﾑUdｻﾟ･;閹ﾜﾇmｮ/H|ｶLﾟ9mﾘzｱ|｡ﾛHl俶 ｳG5+基L｡j36v
dﾀiXｵﾚｫ馨鬪<;ｯ 5%bﾁE`&ｾ7I0ｨ0;ﾐ	ｳ韈PFO\%>o攝_5~(`ﾐG!PT*ﾄPﾌ`ﾜgﾎ{櫁яbRaｽ`闖軾'語ﾘXｨ
ﾔ甦耨*ﾀ･H砒H描ﾃUﾈｫｫ1`ﾜ+ｷﾃ4ｸ*戝6XﾁRxﾅ膕ｨEﾚﾖﾀ聒SﾘN蓼.蔬ﾓ(ｽﾏﾀ	,ｴﾘ翡ｵﾈPb顳g｣qE@ﾇｹSY雇c;a\1ﾒ>桎ﾟPXｼ
&wﾂ~ﾎ溥ﾌ
徴"ﾖ	8ｳawp 浣猯ｽ
=5ﾐ0ﾞ"xｷ｡ﾞAI|し褞1,O5ﾁK*ﾍ2++ﾚ
･ｨ梭&uﾂ6
{浚lG妻>&qｪｼXy/ｰa*
魘JｧB'蚤ﾑ飃謙箝0s'G-揣%fﾓg'波ﾏﾁG'L轟
Lｮlb･ｲｫ0;V4/ﾋ椦=/磔xQ4ｯﾒｄS
ﾖQﾁ?ｭｸg戲0;|ﾉ檎ﾄ鋪村ｯP;ｿFC炮恫`4ｓ+ﾌ∂0	Xﾋｴ0?ｬg6\ﾄｲ`ﾏｲ9?ｰl募0ﾁzｲ,怜ｳ^ｬ螻Y_6索ﾗ萄ﾔ兵Q貶ｴ!Y=ﾚaﾐﾝｰ86%8悃･ﾙﾋbcYNｦ`=ﾁ竍V竢ﾃv｢ｲﾑ^8ﾔY
ﾊ鵯ｦ水 
輝ぇfa梔	ｫｶAmaｮ ^6ｶ萌6ｱ｡(霤`ﾋｬ&ｲB(c#qﾈ｣a	5l,4ｰqfA被ｯｲﾌﾊ4
ﾙﾂ痣･nﾏ｡ﾄﾖﾖмOﾕ-wﾛｻﾉUﾈ4ｬ	ﾙ~ﾖ┌19O喋ﾕﾀk粐ｰﾔ脾zｶC7,ﾕ ｮKtY$ﾏ	ﾃ_q｣ﾛ6ﾉ+G7*Y%,`Up8寞ll叙v?ﾄ%{*;貸m殼eｯｭ吽XY7ﾄﾚｵｲﾅ ﾘｳe惜耶q6ｰﾓﾙHLﾓN(BZ蝟､5u5ｲ);ｹz9｣ﾋﾀ誕ﾝ艤HNavK｢fAlﾜ
ｭﾔ\ﾄ･ﾟW;鞭ｴ℃ﾑ?3ｰU税jQNBPﾅ!ﾃRﾖ'ｲ0慊Z,ﾖｪﾇtB遁ﾇ厳x;vｱｮｲ推Hﾂ{ﾉluﾂF恋-ｮ>ｲ爾9墺	Gwﾂ1ｴ4A彭ｷ-ﾌ>Nｻｧ脉t慵&<1ﾙ:doNｱ'･茵恍
}'VOEдZa鮗3ﾜTｵ3;,'lLd逼9;q|ﾎ/戛1f滔ﾌ<ｽ弁*ｧﾜ_ｲﾏｶﾃ腱wBﾋｳｲ/ﾊｾ>ｸｸﾔﾌ3wの3ｫ
ｳ/ﾑｴ{Flﾋp)*磅ｩﾕK;ｪﾋJe曠ﾚ.>Jｻﾟwk菲
Jｭ3d4bOｰ/狐ﾙWﾆk絽-7ﾘﾜfｿwﾞﾋ>ﾘ`|和Q
苫6$ｯ6_aﾘx法
ﾙｬg	繩ｴOX貭m?ｳ殱yﾔｰF'tL黌.裙^a9ﾂ%0A?｣?3Bｱ	ﾆ`詫鯣P歪ｹﾆpXd劇eF>f@找MﾆH%ｰﾁﾇ｣aｳ1N3ﾆﾂﾙﾆ8ｸﾀ[	ﾈ廼1ｦ滷kｦﾔ､cﾊ宮cﾊ虞ﾙg憖/鮹i3 ｣欄ﾜ]	Ｕ0Jq`q`賭`Sp`ﾁAFﾌ4ｦC13aｩ1U柴ﾖ:鱗:ﾗ斌ｦNvｹJｲﾅ+ﾒ]ﾇ坑ｿ$ｶjaTiTめｨゐﾆ\鑢ﾌム1
0ﾊXｨmﾈ鰉ｸCzﾙ'1ｽｺ3^sﾀﾓｫｯｪ:o,輟xﾝｱU椌#P?艇FA}3y^w囑哢ｧ崟噪Mﾟ2`じｶ:褊	
{|g肭]7Z_Q
.ｵﾞG&&X5Au@/ｧ|7ﾎU 1/ﾗjｰGﾎ0ﾞrﾑ|~X撹譽D列証ﾐ>&[｣_洟Wﾙ&ｮOﾏ]ｰﾔ_倡ﾏTCk9b蔕,ﾞ､ohBﾙｻ\畢@棘瀰ﾇ･#4c%dｫPRCPfｬc
ъC嶝G-pｼq彙ｴﾂ9F竅瀚cﾜll郡%4悋ｳ灣ﾊｸｾ3.f6ﾚﾃ>ﾆlq%嬾\ﾅｪ賢Yｵq
;c旃ﾁYﾔｸiﾜﾆ7ngwｰﾋﾑnvwｱﾇ砂ﾙﾆ=5c+ﾚﾘNｴｭﾛｴﾌﾖ;澑lｻ;x魂=cｳ%ﾃ:ﾇﾐ]ﾀｸfX甓ｰ醐hﾞﾆ0ﾈx敞ﾓｰｯ,ｺｯ軋"ｯ_~kｰﾂ細aｵ7aｽcｼ号8ﾋx.6ﾞν桜｡ﾃn3>刻`12>ｿ淬;ﾆ銜w+ﾐｾ4ｾ◆経YKyﾆOｬ潁3iﾂﾆ"p:ﾈ嫗ﾆfs`k9cG :階vｷﾘﾜﾇ.諧ｶgｰ\ﾝﾎ3ﾙ<=ﾆｻｱﾏxﾏf?kｰ芙爼/ｫ}H3Fﾆ80&AFｱr>ﾄ義lnﾔF育詐ﾐ8#@k軣鷺8紮>ﾞｸ幢k<ﾂ';~ﾆ|3^j|ﾃｧｿ罪yg|&ﾏ裹| 淌J^ﾀ銓>衆dｾ唇耻	鮫ﾛjﾇ6'Fg<鯑0ﾇc9ﾌHﾟﾁ-ﾚﾊx'(C頁;ﾁ_ﾜﾉﾌ-ｰY>ｯｦﾔ帰yｳ憇Z*鹽>鉐dw｣<ｦVｵｫfvYｵｰhﾓ&jﾖcr0ﾆ吋ﾆ#ｬｻnｧG<捉BｱxD/ﾁｲ藏^｢灘 %=wﾂaﾅ[YVﾖkL閊仗ｻｵ秀
ｶ･K貉ｰｾ0ﾟ,ﾌr?ﾈk釵ﾚｧﾋｾ-2ｮ6gﾘﾘﾏK^碗┤諧bﾘ.ｽSa鰲ﾋ０SｷJs>`NO.6RJ剤ｿqzS	tｬｹ漲{xa@FｺﾓpsﾘﾀN鑵zﾒc雋ｧA^O2x&ｾFp/痞ﾋ＜aA"L?陥ﾂ@%ﾘﾊﾗﾂsｼｾ遲ﾌ模ﾗｳ^|ﾏ重#Ql9?m'ｰ&ｶ董ﾂ槫ｧｳ3ﾘ錮\]挂ﾃ･ﾆ~ｹ1歙i,藐5ﾆqZcｿﾞ8那`愿o3ｮ箙ｻ隈V	ｲ昏Ｌ\驚/I｣Cﾒﾅﾙﾐｰ,$ｰehJﾐ-1ﾔ剤Xdﾃﾓ=･耿鈷s･ﾁDｮ>脩｣ｰ?5|'ﾔ]p4N猾ﾁﾉｯp../Q6ｸ｣ﾜ_ﾗ嚥ﾝ遘ｲ舛MrTﾄ｣ｄｩ4;Ytｿ&r[H{pG墅ﾃf霈 ﾍl･7ZN3-&邇pdﾚigﾓ､gｰ吏6手8淌h飛ｯ漾
T｡術	6_甅8ｮGｹﾖ]Bｳ暑Tvz｡7ｸ謄pQ津F{4aﾒ朗6v'ｮG縋軍ｴ錆)7ﾍﾌPﾆｭﾓｷZm*#:ﾙnYﾓ+{ﾀeﾄﾊﾒGzﾓ36Nri"ﾉ緲ﾌa糖ﾗd硫l
ﾍP;P尹ﾝ(ｱ9ﾑﾎ湎{搖@((ﾗﾉｦU剤ﾊﾊ寫邦ﾏ[ﾙ軍ﾑｱ嶇ﾘｲGﾎ893聿､ﾙfﾊaｳﾒ遘ﾎ(ｯ 割	蠶ﾕﾂMﾂ6ﾇ杵ﾐ.zﾀﾕ"nｽﾑ^}疥ｱ|(ﾂ"?!ﾎLQ6ｼ染El(fCﾄH/JﾘXLﾟ_憩ﾓﾄｾl娩殞･41QﾋH｣ｳ硴QV牝ﾗ8ｬﾛ迄ﾏ""ｿ9ｬ<ﾍJ'ﾍ?	;tｯ亨ﾁgvpRｻｴ櫛#jcﾏnbD又uBvW鰒
n(ﾗ
=.踵|{_+tｵ:鼻硲ﾀOS尿71D9ﾃ(Q翡\ﾘ_,)b!Lﾕ0G,Ｚb1,Kｱﾅ2hﾋa拗G気濺q()ルﾄJｸL畴ｱ
uｰUﾔﾃッ
<#%ﾑｯ&xW4ﾃgfSbﾋY?ｱ
ﾙ(q$/暫峨ﾙ｜[-NdG遁zq
;V慳6欣ﾘﾙ穰vｽ8ﾝ"ﾎd圧ﾘﾃ稷ｸ8=+.`ｯﾙ["楮}&.a?v巉bpqｩ1@\nW:cｲｸﾁ&:9&cｾｸﾙX,nIA鶤nｰulrL_｣ｩｪLY*8$Eｫ*Yｨrﾘﾜ$黴枳;8恬敗ﾘD8=9ｹT;;`Xﾜﾒ&x｡珈ﾘﾂ4<ｽﾋﾙﾈ冥!Kﾜコｱ
C凅%磚4ﾁ
0ｬ州+ｮLﾎ消y	ｸD<	w云xﾞOﾄ愚頻IｳﾋWrh齎$'ｪ7ｰﾓﾄ'ﾇCVYub關-2`ｎFｸ｡Cﾍb:dKCl)･x｡CI_,:､ﾝ鞆
ﾊ\ﾙG8`$F9ﾞdI,虻惧ﾚﾒ\汲
ｹｷ<18ﾗﾝ'ﾊﾞ､	*7xHｺU,Iaｾﾓa0ﾎﾒ岑ﾋo＼ｼﾝﾅｻﾐWｼﾅｨﾓB1游fﾃﾁ礙愎歛%~οｸ陀ﾅｦ吏ｮ5l7-xﾎﾃ+fﾋｴ畍3刀卩f6n豌>fO0sﾙpｳ7+2ｰ}ﾍ}ﾘDｳﾚｨ0oqg*ﾔﾚ&'	ｶｦ:i+ﾚ=L_5Aｸ9%菟qFｩ冪tﾙ}ﾈN濶ｬ>4UspGq`5[DH叩ﾘ･ﾓmｶｲ&og+K-oAﾆcﾓ鉾uｲﾆYｫ4DﾞC忌樫雑ｮuA.ﾈ_ﾈQHbnﾂtQﾊ6V_ﾘ氣岫wｬ)P淬uﾐﾀ
ｦ9#`ｰ櫓pYsﾌQ0ﾟ
Kﾍ1ｰﾊ
貔6'ﾀzs?8ﾚﾜN6'ﾂY$愧)ｰﾅ<ｮ3ｧ粮M醢ｪ9ｾ2+ｳ0ｫ4邉saVｳﾞ"dｼﾕ瘍ｹ{(%樹ﾂﾅgg△挈vｶ/箒ｿﾛﾘ癪9bｲRｿYﾒAwｳ嗅 `6ﾀiｮE甓
ｯﾁ曰_%ｩ汳ｸｭ氾ﾖ&盥F2Zﾘk到呈4割" rEwu
呼-Iｺ･馴ﾓﾅﾃ査`諌r&Wh<垢Nﾖｦﾝu.ﾂ絵ｮ/ﾌ\9ﾊwﾁ｡ﾘEｮ+1蹕ﾈﾑ9+G]ﾐ-ｯ｣箕ny=*ﾘﾉ6莢洪?ｺｱ+ｨ.mX隶zc9K78Jwga碓轜*ﾞ拓ｶ召!ﾜｴﾆｫB[bｽT
q9ﾍｵ&單#終ｶLni86iR視ｷﾕ?i嬲P"6T~矧c｡ｷyJ	PfnＳD枠Kﾌ乍Hh7ﾏ+ﾍs瀁<ﾘj^ﾛﾌ披K3/cﾂｼ弸5ｬﾀｼ檮6;ﾘ2FVkﾞﾄ67ｳ3ﾍ[ﾘl及'ｻﾎｼｽ`ncｯ偸｡ﾔｵuｮ─.F<ｾﾃﾗ	[ﾀ庄Mｸﾁ/}ｰ%Yq3ｰﾔ;敘ﾌ往{1\T硼ｨﾂ就ｱ81麾画.惑>ｪｴﾞ#鑞裏AS_├x葉#ｴ訐属卵ｮﾗ整ﾗ属7整7属ｷ整p">D4ｼ3h鄭j勒[ﾜｼQ5ｽﾕ｢uv:ひ抉喪ﾖ,+ljcｬ)ｩs恪E簡ｲ"4ｽ頁[ﾙI;ﾙ*43,
[Dｿcs2-ｰｽOm7霓rｼHﾓｶﾀSn<ｱ撈ｺ幅ﾞ栖ｱﾓEｳ38ゎ=ﾛ辞ﾊ3縲狛秒痃i,扛egwﾀc^佃Iﾖﾀﾔ誡ﾘ9{かMﾞiﾂ楷14灣qK#<ｷ統討ﾒ9>組bJ'KG圭2ﾏﾜ甚ﾑ'ｰﾍ_!ﾇ夂ﾟ`､膠)ｰAfﾃﾗﾉ柝幗ﾛd?xX]r |$ﾁWr(ﾋ胞lｼﾅｦﾈﾑlｾﾋ面qｬ^N`肴Xｫ恁冬$?ﾊ暉ﾁｧﾑ!ﾀib:遘魂]P魍ﾘB\&ﾄ1A	&､is*9
.鹽}ｵq.Fﾙｫｰｰ8W防dﾋj釧O,s1~ﾜKﾋO*Kv由	ｶﾇｾ[ｨｮﾇｻﾅ ﾋ`ｸ	Er6L泌0Eﾎ←`-+a●ﾋ<ｨ宝｡ﾟ脾8FVﾃｱr)$涼9r9\&Wﾀｸｿ枚ﾁｲ[?胙K*茶ｽﾌﾗ.前\｣ﾚﾙ･ﾋｶｱﾋ4RｱﾆAﾔ蟀 ﾊ｢2U膳紫I9樺&gnl悍vY+S_ﾉ｡ﾔ$Msﾒｰｮ繞ｸｸﾍT@蟆ｫJ3N丞ePｽﾂ!#7ﾃ鏝縛A}ﾙy}ｶv菅lsA杤?*竟Wｳbｻ｣4ゥ4Fｰtｫｼ;ﾓｺﾓvW^Pt6^桧ｰsm$M碵Eｹ6Q剽n｡+ｫ2ｷｲｭbliV^貿ｽ[`T^ｮyｶ-dVｧﾋ,*Yﾖﾉｶｹ信Xﾆｭwy卞｣8嬶萃捜ｸ･ﾄ,-ｺH哀D･ｼ唇ﾈﾌﾍ袴ﾎs脚3怪,G$Zﾚﾆﾜﾘ+ﾗﾄｼ,=	ｽtq%-ｰbf$渙ﾝ{ﾐｹ=h%gﾇ埋-ｮF\兌s{8K@ﾟｻﾑN蔕ﾈｵｯбNｻﾉx佇陦ﾖ#ﾓ(0!0=笠;ｿｶ要｣紊ynlX檐tbｬ31ﾝ晶ｸﾃ囀+4, ﾁ靹冲､=/Xﾚ怜vﾇ
r.OvA1ｵMaﾘﾇｵﾇ｡･ﾓI揚{ﾙ0]q'ﾜ鞐(｡Aｫ
ｹ<菁股ﾂﾘｹ記壌scｻﾑ3bkﾟ嫦豌'ｵﾂoyﾙｳtｲ]jﾍﾋﾖE柮A,,LﾓﾂﾓiJ謚+R対wｧﾊ｢ﾎﾀﾚｲ鑵b徭ﾏｦｬr[齣Pｳ*OﾔZ渟Iaｳ`Iﾔ･(T&耋釈^GjEｿ･ﾏ
)蓄ｴ【ｽﾄﾅn妄ｲｻ舖lｫ|="ﾊ梍/ｲｿﾊ鱗ﾟ萢5弓ﾝ癡o=葩ﾆ>]｣Pｾo剣･#cｲﾘ)?1緬ﾏ慶菫兼蟾ﾆｹ;綯ｽq5弥?ｷﾉ沚m2^ｰ|ﾆV鴛i|meVo腓ｭ\>ﾚﾋﾇYdk殤
[Cyｵ5惘ｱyｳUﾌﾛｬ只hｫЮo咲wXｬRｬ5汰eﾄｰｦ_ｬ2ﾑﾗ)&Z及ﾖBｱﾈｪ5ﾖRQo--ﾖ｡b｣'X欣ｭｵ祀+*ｶ6胃ﾖｱ誄Dｳﾈ:ﾉg拊`挧忘ｧ儷ﾖ馭ｵuｶﾙf捐c]h杪]j^h]f^f]nﾞ`]aﾞf]inｳｮ6_ｵ:ﾌﾗｭﾍｬ嵶ﾏｬ[ﾌｬgﾋgaﾝ.
kｫTﾖ6册= sｬe_!ｰ膨ｭk<ﾐzLVYOぁI\?ﾇｽ7ﾜC鑾職Zｨﾍ要&}
鏑ﾙｵｮﾀﾅoﾗ驪eﾖﾓｸﾜ9棔燼{xW	弘=ｽｪsﾑ
ﾏﾜRTzﾚ22ｵﾁxﾞQｧ*R廰ﾒ､ﾌﾂ｢苔ﾘ援靡ﾘ_;N4
ｾ+沚ｨﾆ1Fz9ﾝ遜Q^ｻ
痿ﾙｸNyｩL1ﾙdｪ)Ts'ﾝ*dgｨ苹･fﾐｰ5･"疆ｮﾌ8ﾍﾘﾐAEﾈx･B,歉X波ﾟ晧鍜氤t伽ｲｾb+SﾗeJｩﾄ著cｭ猜銅+Ohﾞﾄ｡!｣投:ﾈ刺｣uﾄｫﾉ1支;｡0|-ｹﾃﾟpｴ:ｬｯ+oﾈﾃSL｢@ﾛD))H3ｭOH恥>｢ｯ{bﾜ]ﾐ畍ｧe	%ｸﾗﾓ狷脛玉*ｴﾞмｬｷ `ｽSｬwaｶ>TYﾀ瞶Gｰﾖ叱>Kｬﾃ7ﾜd[ｻ	ジ楳7符狽ﾟ範@e1Kuc飭;ﾋU=ﾘPﾕ桃U}ﾘdﾕ欟ｫ[｡ｱﾂ散#ﾘ&UﾂNS｣ﾘｹj4{X皇ｩﾙﾗ*eQ鋼5ﾅｨRS婚ｪﾌ8Jﾍ26ｩﾙﾆUj首:ﾘﾘ｡*桜U報｡Zh|｢蔓Bo)4\蜀qf[ﾜX瘢*爾ｵoﾜﾇﾞﾔ)ﾅﾎ･ｪ遜bｻ冩uﾂQ#ｷｲ\ｪﾜﾉﾞvr陳ﾜﾛX}ﾊｻ::2U
V+aZEｪFｩ:8@ﾕﾃLｵVk`阻鰍'ﾍ幾94J時M[ﾏ[ﾙ;:0凭ﾓ1wｫﾐ
g"UuﾂYｨT4ｵｴ篠@GUﾟuｩｻJ$ﾝ.ｿﾁｵﾑｽ覊ﾘ'Or`煦0Uｬd注mｶq翰ﾎG1tﾁ杉Rﾏa袒&.蘇gX#6ﾋ稼xﾕｫ9){ﾜ伯ブH|fZ馼阻ﾁY9Tｩ(ｪ6ｫﾖ皰lШ(Xｩ糸ﾃﾕqﾐｦ紫
vｬﾚ$ｸKｪS`:朸gﾂｫ,:~U0｡.d~uｩ.a#U;ﾛO]ﾆｦｪ6K]3{'WｻrxsrH8ﾓ$･
5(為竦ｯCAｼｱFﾄ孅ﾈｷ ﾞ鰍x,Pｷﾃ!鶩t'{w晶濫{場ｩｭｺﾎ)n tｨ0｣ｰ郁ﾄQｼ彁iﾕ}ｺﾒｩn･%Xｮ|ﾓｵ_ｫ}ﾖ湿IﾜﾋﾎaLｴ6ｵ遅ﾃtdﾔC寸[m｡麭(QO`'ｧyW､#zﾟ;給ﾐﾘ鞏KﾝﾁW$ﾔ90me_wｲobｩ9_	怎
傀mﾜΙ侯)Xｬ曚Nﾀ&ｻ|ﾉmｧ.s穢礁(塙暦?狆B=ﾖﾊa?ｦﾓﾔSｼｱ4ｪ~NｭKeSﾑｨ7P籥n-TｲｷQ籥‖鷯豫ﾞ2>ﾌQ4{ﾂF惠ｧｫ障\	lQ淞u3ｸEU淌CﾘｩｾﾕWｨHgxs9ﾊE~ﾝ征_>'it聾}愈ｲﾔXLｯPｷ2m貿諧ﾄZ?睥B^ﾌﾆ桔ﾜｨ~ﾕﾅﾎv=鶩zﾄｿｷCｸbﾓnｰ釣ｻ;`iﾑﾚj>ｹﾀ≦	ﾇ:
諞yﾐ.ﾛｼ+彎､.e0參iﾄM8｢ﾕ8?ﾚ
y>LﾈIｳﾔ辯･ｾLｨeﾁj_whuｾﾌ9ﾞ`ﾞﾂ｡闍ｼﾙ゛ｹX9象ｫ	;E[
ﾑｾｶ､示}[v/ｦ9zｨｼ病颪ｮｴ`傀ｳ痩｡ﾒxEﾞR彡卆<鞦ｾ公
鮴aPﾋﾅｾBX	k|｣p慶ﾟX8ﾋ7ﾇyｮ7ﾎ3ﾐ,信^ｱﾇ8YUB>癧I +'ﾞRGbｹeiLﾞ{愁D"ﾑS ﾇw 侯M蠕2,u^LLｭﾟ斃P趺|pNﾏkQfﾐp\D'ﾃﾕwﾈｭ?ﾇﾈﾐUb9r:叱k-利ﾕ0T･Nﾝ62瞳<ﾇﾈJ-ﾑ-ｵDﾔ=RKd'%靱;#>｣'.･_6#GcYﾜi冂ｹﾗS9LﾋsOR?0AｰRﾍ､｢Fﾟvｴｱ殉0#6ﾚ~)踞ﾍTBｽ掎森lﾓﾜ@ﾅﾇ:ﾝ（ﾔ晝ｺ2Ltﾟ敞-:=eｫ1ﾘS!1ｸ団u%フz}ｼ奚tCo身%ﾌ{^j
j!ﾙﾃ膏^驥]&ｪﾄ)ﾔ｢X]ﾒ(｢3aｱEw;@eﾛﾙ)･t0佼娯R弾｣%p枩SU祿e股ﾈ7｣3ﾆ P,ﾖ'L秉_"ﾏg蝎ｻｼ繆ﾎ[1ﾖUJ_鍬ﾎx!苗KgWT柞1｡0Wｺﾘﾕ&啀?2`?=ｧ艦ｩGbｨjｧQﾚ=<重Lt^ﾎqScrｪJLqﾒﾜAﾇｨx：:
卑Tｧｴ粘Y幼ZYjﾙ驩ﾝZ0fﾄ尾緒ｳR橲4\ｼｦｦ飽&fN;ゞ聰xﾍ繩.Q髞M紘sS%ｷ村fﾘﾃ W1i讐逎iｯﾃWﾙｾｹ鑰鄰ｾｾｰ殪ﾛ*8ﾈｷﾒb倥[}Kaoｬ-Fﾟ
引…|ﾂfﾟapｶｯ.ｭ+}Aｸﾁｷ
ﾕﾂ6_)_=ｼ[
ｯﾖﾂﾇｾ0|緻}GﾀﾏｾVﾘ0ﾋﾗﾆz6ｰ<ﾟF6ﾜw$;;;歯使s}'ｰeｾMl･Dvｸo3k敍呪變樹敖N斂ﾎ敞.效ｮ數:|邁Nﾟｹ=ﾟﾟﾅ'ﾟ%ﾆ@ﾟ･ﾆHﾟeﾆﾟUﾆ2ﾟｵﾆJﾟﾆjﾟ
ﾆｾcｽf綛ﾟ-ﾆｩｾ[叉}w練6ｮﾝcﾜ4B5ﾛ鮟ﾏﾓｿ=l鞆n痣ｾgx7ﾟｼｧE^窖//}ﾌW>脉ｾ/ﾟ聯8ﾟwdﾟ\ﾟﾕﾙFQ,]ﾝ3ｳIｺ{ｦ$*ｻYﾁ"*"
$活舛Dzｼ迚DED任\A	Hｲ癇C$x縺E/ﾄｾ龠ﾙ+ﾟ{ﾟ商gvzｺｫｪ咾ﾆｬｬﾃﾆﾂｬﾟ檎ｳ0ｪｲ2ﾖ3blaﾔx杭ﾆ3vｲcﾋ4ｾgYﾆoG冦Zﾌ1%吐C7sY=3ﾌＧ{ﾖﾐ<52ﾏa栽Xﾈｼ51ｳl膨ﾞﾇrﾍXSs:kfﾎaﾍﾍrv鳥鳩0Wｱ匁Zﾖﾊ|劑bｾﾎN5ﾟemﾌOXﾔし3ｳ取vy泌[dIﾖﾙjﾈｺXﾍY「
;ﾓjﾏｺZ拗7lVhbgY硫ﾖｬ5懾ｲndZｷｱﾞﾖ=ｬ穣k=ﾆYOｲﾈU旬gｮFs藤ﾍｹD･Q札8?ｴHSｨ虜ｦ籘ш_怪ﾊ･h･(ｼﾊ=qｭ(bｴｿ>｢ｵｼ#Z茄
ｽ,祁煕}ﾐIQ懍Bzx｡倔J:PYoｺ@蘋?dVﾒA5殴jｶ撓酉ｼK9]Pjﾉ-.~Tx｡ﾂ詈bｨﾜﾖ@O]ｻﾅ鞨9*符ｺﾓﾊ$嗔ﾒｿｩa\ｮ]｣Wﾆjy? ｸC祚ｪﾙz?ﾗ5NI支hrﾄzu暾j騏ﾒ=ｴﾛ]=ﾐkVo穎!ｹｼ｣^:ｵf護IｾﾃN糞aw5;ｵoｵﾑ亅ｶ憺ﾈ"伽Oｪｫｨ4ｱqЛ｣A)齏?.Ux髻rｰ思t*ｴﾗﾗ9ｱ$齊ｩkR閲御磊7ｸﾍ勲Yﾆ_N]+ﾓr叶改Avｪﾝｮmﾀ｡ｽ貳罸ﾅl7ｹgCｦ0Y)E涕+#｣G%ハ黶>ｮSﾛ.蹂Atｦ{d母ｼ^YHｶg+tﾚ(e擡Drﾊ<ﾍｫ^<ﾙpﾆg{ｹ0pﾇﾍFｼ框ﾞﾀlﾏ譎ｭﾞﾘﾃ尨Cyｶ9也亶\s?ﾉ愽[婁xKs9oeｮ'媼)譖ｼ笹屐飲%ﾏ3v豈4(he3ｬ6ｼ琴Xｼﾐ:歹聨ｭ\k0e呆ｭﾑｼｯu3ｿﾘ*躙X1~･ｵｱｶｫｬw0k'ｿﾆﾚﾋK|>~ｭﾏﾏﾚ太ﾎ|費~捐8+7ｦqｾ9fﾟB~ｫｯｨ1=nN斯q湯@,ﾘ慍9発碵{7W裳{Ih8\ﾚ"｢-｢=T颪ｮ)2A>?ﾇﾅZｭ逡iﾃgｽ｣"ｵO衰=U&fｴbQ掎ｲ{569	v>npﾝ傾ﾗｧMtp7ｴ
n(ｸ娟9A+ﾀ{ﾟ
IHｺﾃﾂ乳nq95mﾓjｸﾚ舳Bs~}ﾐ朧^
ﾝパ1ｩ0?
7ip;･|&<ﾂ麾處6,詁Pﾉ鄲楯	砒､_Bﾎ覓ﾉ
Y2/'w艤Z3嫌ﾞｮﾜ!`u9qﾔｫs"D陟WﾝpﾉK 瞋冤ﾒｧ'2索Iｲﾜｴ｣:ｸﾕK怏ﾕｩk5djhﾀﾗ"7@!ﾟ#ﾋ0双ELﾕﾀs|TWｳｻﾔ匿ﾍdT?ﾕ}.奨ﾏ墟鴾tﾂMｪ弖Sｳ翻P;kIｭ$M-p;H6;ﾐち=ｸ袷ﾘﾆlﾏ;｢｣N0KｧﾇN<悖対ﾔｳﾔｬ$ﾒR梯hｱﾖ襴%ｻ
ｦD%ｧﾍ`O､v:ｸNkAU頬ﾒﾎI5ﾀ嶷ﾁ^JT橈)(}ﾇｰjn]>品勿ｼｿeｵ-ﾍｸJw,杏淋|!ﾉt~J柊ｩ_:幎UﾉFｦ4R'ﾝｴ?mﾎ,:ﾎ､ｩ+_x;AIn	ｭ騒?ｓ'p>ﾟﾗﾝ0⊥0ｷ)ｾI!ﾒ&ｭ/､
?B:_Iﾂ'w?ﾈ(y#1Aﾉﾂ"汪L`4[pﾚZ'l/ﾚUHﾚSi_Qj､｣E:Yｨｴﾐe宴ﾀ／ﾚﾜｯﾕﾚ､kZT}ｪｰl
}咫_あ7]鉞鰲xRo臟beｮｦ圸牝O*p｡43F蘭A乱ｩｨﾋｶ^ﾋjｽ｢2jﾀ膠ﾈ貫e5PO列脇ﾓu4ﾗﾐg(齦5fﾉ莇ｩW:ﾌﾚj&悃ｦ@#q*X｢
0ｿﾈェ"
'怪ﾐV戲8Gtﾅ0\t	｢3L]	Q畿7ｨｰQ5稷xｿ+ﾎグDOﾘ#ﾎ}｢ｩ9	,7E,+ﾇXｷ鰮:ﾕｱJ*~ﾕ
5fﾅﾑeｹ頸ｩZ署/F洵ｮ)ﾉVｽyﾁ壻ﾖ1uCW(v-n貯A'嚠ｳGrﾊｴ&Yy	D;"円`規_唯Hl1NﾅﾐQ┻ﾄ !Cq9\-ｮq%WﾁX1nﾃ-｣)q=<#n@<殺\=iﾌuﾃﾉvW､ｷfﾆ依oﾓ.齋ｹE･[TｹEﾌ-ｪｱﾈs豎Tﾎｬ｛=ﾖ
k"ｧｩ|ｭ目ﾘn拉､ｬNNｧk粨ｲ*鰛單hｰｾ准Vｹﾉｬｮpｯrﾁ｡\ｲﾔ瘢噴ｫ\ﾗｪ靺
阯$ﾒxﾟﾇｵN
Lj0ﾍq5uﾋｱﾞ就ｻZ^'d{@C1	卆	ｴBｾﾝﾅｸP<ﾄ｣0H<0F0Eﾌb6T胸ﾈ瀑ｱ>褞ｭXL､XF嚠gｾOｺ兜､ｧXE.品a糒勾朞倡gqIDﾇ7_瘢ｪo^*G礇8e<O遠yqｮ9ﾔ咲ｹｦSｱ浄ｴQ研扠ｭﾀ扱!ﾖ｡袷ﾅFh%6｡oF	Gｺz姦ﾐWﾔhx
ﾎ;Gjｴm?ｭ壇ﾚ燎q広K1澤ｨ踟k}`@l.ﾞﾓﾅｺ羅枌粧ｲｰﾎ汨m
}ﾔ*pﾐdw94ﾄ1ﾃ\ﾞ｡PQ~拂陛ﾚ?/F鹵cｾ)ｰrｹﾊ}ﾊｪK;ﾔ｢^寝ｿyA&Jxfn*ﾈeﾔ$Nｨﾜ)SS_{ｾUiΜ?tｳﾞｬﾈ=ｵDｵﾏ鍍^|	ｦﾘ4ﾛY稾菻o W|ﾍdｱ"b(｡廁ﾎ?ﾁr饌"~〔ﾅ%~1窈'ﾛﾄ_ｰﾐｦｼmﾀ+ｶ{,T7衄"育購cｮﾆ(%ﾕ･"3ﾟ語%^ｱ冩ｭ廢pn$h)ﾇﾝ汪獏ﾝ｢ｱA｣ｭｯ6!+ﾀ
標*}Yｳｧк1ｲgT;ｶｬ苣Aﾘ60ﾛﾁﾂ
z震ﾗ楠Dﾐﾁnv6tｷs滷ｻ胚+鳳bｷろﾖz(OyCｹﾈｩVｸﾄZ_亅ﾂ9ｸﾋ;s蝿洪｡+賊$!ﾐ湲ｰ｣`ﾙ(.ｰﾏFvhbwﾅﾖ6'ふ\V]ﾎｮ&ﾋ巨ﾇｧ+ﾍｺ嗜U'ﾞﾙjｪF
鬱ｩﾐ1ｷﾇMﾋm!ｪ､bQ~F|_\y餽Xｪ｢up
%Vｽ諞r8ﾕ_0｣ｭrz(ﾈfﾌｲT9ｬｨ[鑢趁b}┰E$VﾉCﾒMﾏc犁ｰ"ﾖｹﾝ1b~ｴｵA'{0ﾚ8詔W!ｶﾂ-0ｸﾇｾｦﾚﾃaｦ=贔#｡ﾎｾ*m紛ｨﾂX祺cｪ醂1"QOGC_ﾇｹ$ﾏh[旅ﾁ,i~ﾖｦｫQ｢]｡s=}3畆.h夐I)茶ﾓhxﾈｰo】mｴoﾇﾁﾝﾓRcYJFd\jﾁｭﾝﾙk钁
E9ｸﾆHX3=ｸ)3ytｧdｰﾛj皚,ｿP|$ﾊﾂﾏﾟFW(ｶxﾙﾂﾜQ,尹y蛭(}Wﾔ@V(｣ｨ瘰Sｧr3ﾌﾌFﾓｫﾖ｢ﾘ}('q@CﾈR剥ﾉp=e絏bOΓtaﾏｱ,g?肬y0ﾁﾚﾔ^Sｧaｺｽ棆+`ｮｽ9綺獣ｷ#R-ﾜｽ1柊冥ZMﾔﾍｵ/ｿbydﾙ`ﾏjjｧ咆鞅ﾎr発([+QｶVAｻyｫ
!就gｼ/ｴﾗ i3檐韃}	釀T底sﾟ	ｯ'{禀#8fluy|｢（柤､ﾝ	鵆}Mw1Kﾊ｡到iVﾓTF十ﾏ#ﾗ".ﾕDｧ紗U!=muﾛlﾈﾄi陬ﾔﾏ2ｸミ27Pｰﾞ6vｨwｼeｿ鱗;P閤ｵW+ｽ\-Lｩ黒m`EVwGE｣ﾀﾐﾙ,dV@;ｵ}ｲﾛ悽ｬ｢縦tｧCﾉh2
Fｻ寉R糶Dﾅ甑槲Mﾐ筥ｵ尼ﾃﾊ堋ﾉMgﾌ
h徊e%6Whｮｼﾔﾉ果ｮ葮3Bﾖ毒ﾚ#*iL~4&wﾕﾞ|叫肥:Fﾁ
;_FPｳﾓbi(M2Sﾛ>?ｵｶﾛxｺﾇZ猴ｫ;ｷｲﾐTUf6$ｴNf,K蒡ｽﾈs_Ac{rﾗp|?\lKCpｭ}nｵ#P樹K｣ｳ消:`気ﾇ#y mI:Arﾓ伸u舵敞d"sｲﾀi湿Bﾂﾏw読ﾛ7F6ﾓﾏf?ﾙD?ｫ$ｪﾉ[+I瀧玳ﾊuXt"嵎;峰"ﾗgｱTym"･米(ﾒ瀲Tvﾓk ﾛｽ､{忌歎ｹVh=ﾎ｣y>ｿzwﾚ@N;h陷ｹNh蝨廸撰t。ｧ懊B_ｧ;pﾎk0ﾖ9ｵﾐ*｣ﾒSﾍaﾔAﾊ Y傑ｧ感ﾝ]ｦd1筥[G+YIｖ訊帰捉^n|ｩX0'FjnR妛1弊ﾆ霎水Jkｵ&ST@艀m｡|Wﾝ|i<ｷ?問;｡ﾈ
ﾄh,_Nｿﾕｽ.K驕T?\"猥ﾅ`;"nC#g 4uCsgｴuｮ斜p韶劇罹3:ｷﾀ衾ｸﾒｹJzг#罫nｉx]ﾜ:聶)躔ﾈ4ｪ堅ﾇz漱ｺﾌDgｰ｢ﾜｰｶ｣{俸齲ｭBW:筺囀ﾓ^;ﾙｺ･Jﾛ+岫eﾈ隕評eNR･-JgP躁;w!呻^N)vBｲﾞ	: 9ｫ祭X{像ｪﾋir&ｨｸ0(簷J酣ｩｦ兇Hｧ醍~rﾉﾔｻﾀ謙gE%?P鴆枳*ｵﾓRI腐H%UIPﾉ裄ﾇ遷ﾓﾁqfBKg>懋,ﾓ彳ﾐﾁ)3廢p&^:O#･#u銘g	u鳴堝yﾔKﾑa#ﾈ島(酪ﾚi/懷(,+@8+Q蕃ﾆ?J`ﾄ愈ｨﾏg}dｸ~*\鞦e6
ｱｾ:｢6ﾎK&ｳSｲ暫U5ｿU)襤ｼｽﾔ7C謠*嫁欟t<Uﾁ0,桟ﾁAlX｢嫩ﾗﾍﾁ俸ﾇ ﾆ辻蘗Uﾃﾐfj･;4P.;\ｪyp搭w	ｴｴIAKnｭﾗm-ﾑd2h､ｮﾖﾁ窟~_ﾀﾈｨ62cFVqgﾒﾖKA:拶T退H鞭6ﾐ剞Lｪﾗz"7T"7ﾄP=T｣jXﾍ愀ﾈPmｮG諚:;尅^-(g/ﾃ%ﾎVT5p糞
;ｯﾀ躑ｼw:oﾀ$蹼xﾈyf:ﾛ｡ﾌy;;`♭!T8ﾁﾎﾇP褌ﾄIxﾉ^uvﾁﾛﾎnﾐv9淌^gND_ﾂg/痞E2怡;_ｿ=ｩ錮@;?懲ﾎO､宝3NPHｾs8ｿ裾ﾎr｡+鱸F;!ﾎQ2NｹCrｷ､､Td4ﾉti9ﾒGﾊeY*3ﾉ*ﾉﾈ:ﾉﾉF)ﾈﾒ&ﾛ･Cvﾈ艟ﾙ川枕Cw[p1ｦﾍﾂ趁AﾗA	ｺ!Sﾓｺｲ)4届ﾒｾ挟ﾞxﾑﾔﾋｽ/lu0ｻi乂kｹｱ懇ﾛxjｱ懇ﾛhｵ个rCｶ*[B<ﾚﾉ0ｴ猷hCrﾗQ詮jﾙ謙9ﾟ2
Uﾞ83h陛>nX$h｢
碕ｺ[試4,Jｨﾈ(tP ZﾇﾖｫfAｽ位J5ﾗﾏﾔｮ迂｣ﾇ*MﾓzM:ﾑ<翻Iaﾐ2K覇4氓a\ﾇ+ﾗｫ,面r歿~V0ﾛ%#ﾁｬ$Xps
\ypEjﾍﾃM)ｯｯｨF9TwvD]y炒恫E*FｽQﾟM#BF ﾊtoｵ｡91#ｨｾﾍｱﾈ}ﾒ洽ｴﾟF~ｦ盡
z
ｿﾊ埠ｬﾆx`*猩瀘｡疝2
､♪ｾ
ﾒ､ｮ+@3sﾋALﾌ$j<ﾇ･Uｵ4f4ｪ:SｶS<2ewp荵燉=  {"蒸6/{Cｱテ\/ﾁXy兼ﾃ-Rｸ]	ｲ買>y9L淡ﾂd9ｦﾉｫ疂9梠ﾗﾂr$ｬ泰ﾁ&9ｾ幼y$oﾃ&ﾂ8ROﾞJ塋ﾛH+y;9EΧHG/ﾒUﾞCﾎ薮退r"''諒I2&"｣臈r倒圏Sﾈmr*J42K>Fﾊ舩ｲBﾎ@)昿brJ\ｲUﾎ#ｯﾊ
ｹ･y!yW>E-&;ｱｭﾏ薊ｲO.'､
mﾛhl､p獏`ｲｿ遞ﾝ\kﾞQﾉﾊ*&U;城｢O亊玉a4｡
隱ｯ幄ﾓuｶｾn瓶:ｪxdy｡{ｩﾕGHｧ)ﾅjj?ｸV|欺TｫzｲBr5t斌<ｹzﾉ畸ｹ)ｷ	ｮ縛aｨﾜ`ｽRYS%棺ｱ9渾ｽ･ｭQﾈEh9ｵｾ+_C.ﾁﾕ｣|lｾR笂EE^~ｭ0ﾎ=:Z"ｩ4壺T｣7ﾓﾋｲ5嗇ﾆｹmｿ]h!?Bnﾛﾞ策ｨｰCｩ&/猶:ﾋｻw3ｨﾓ]"ﾟ僚喚Q)j｡ﾟ	ﾔﾂfｾU遯戲9ｩﾜ9｢.<°鞋ｭﾝｮN;e`ｹ鄲uﾂkRｩ-pd#v｡F\□)%ｴ農AT~
7Hﾅ=`美e L這y褊ﾌ汰ﾂ<;,萌?@福ﾀ?-~jｰ7?Ay9Aｽﾓ<岨-ﾜｼkF鋸ﾑｲ貌雪ｷA･~{koｷﾞnUﾇﾛ|ｻｾﾝ5	愈]Pﾟ~rPｵﾑz､V!ﾄﾘｦ｣ﾊPK(｣ﾐxUjCﾕPKma5 antlr/RecognitionException.class拘ﾛNQ]gz稀A." ｽﾑ***EHH*@L|ﾊﾐﾔｴ3ﾍ05~唏1奢~拝)Rﾆ靈ﾚ銕ｳ:k3ﾗｷ韓後ｾ$ｸ掘V ｧ勃ﾄQﾔQﾂ∞ｲ]xﾃ(ﾄO
kﾟlZ
ﾃ婦諚ｳﾔ0Z鰔svｭｬnﾔm棠=hﾕiｴ6uｻm*2ﾙ7,ﾙvNX町ｰrｿﾝ<ｶﾜ#ｸﾁL*s轍2尸=)ﾕ_Y-ﾗｪ圉u｢ｿ>ｿqfyｻｴfﾖF2ﾙ s1U|tB	ｷ/M&ｹﾞq]ﾇ}m撈5ﾖﾄ=ｧﾛIYNﾛｭZrﾂゞuj廩ﾝｱw>Tｭ,較敖`ﾋtﾏﾘ2k	普ﾆ
盡‖ﾜ10"青煤UL+公k|ﾙ>=ｵｶﾑxﾖP6ｰ
ﾒ4aﾚ^ﾃ-旺瘠｣ﾊﾁｵｴNs=_cﾝ1#ﾃﾘuﾜｦ騫稔`ﾈｯｶ糖秬jﾋﾝ「ｦﾎ|擒来坏貌Aﾟﾌ控w.eﾌ3OoAﾉTｹR2X?綬1ﾁｧG縅WﾀhnX]@ﾋｩsвﾚ9ﾂ耐~ﾟ]9G8(9ﾈ8Dｮk談ソc*7ﾕ$q
:ﾒ;M｢殍Bｵﾈﾓｰ囲iﾑｫvﾝｿc楞I珸ﾁ\
｢!-Ryb′ﾋQ$K鴬iﾊ駻･e6袋>Z｣~r8ﾙﾒﾇｾﾒU秉`i､ｿt郊ｴｾﾒbｶz轆換鍜ﾎ明#憶ﾐEｻ紬:霏2)ｷPK4TｦjUPKma5antlr/RuleBlock.class晃	|ﾕｿd7;ﾙ	,	 Mｲ	D｣%声@Jｨ祢2I豊f粮,里hｵﾚz佑[ｨﾁｪ(JTｰ
朸j{ｷZ{湃ﾃ^ﾍﾌn弾ｒﾟ庠ｽｾﾞﾛ>xiSﾄﾈ0籾Khﾂ
nde_apﾜﾂｭa蒹6ﾞﾜ桴;ﾕｶf{;ﾂ(rOvpg俟ｻ|1_ﾏG)vv7ofﾖ{Bｸ7袴ｸMﾂ}ｼ~Cﾂｼ0ﾘﾆｦ%<ﾆﾃﾘﾋﾂahｱ0ﾇ~蒙+!ﾆ<ﾁ閭xﾘ淌|売v	OKxFﾂ0eiﾏ2ｫxNﾂ%!X@d3%[DｻｦU'bﾚzﾍｪMﾚ<ﾍpeQﾉ,ｲｾﾜｧN"ﾝ蒙ｭZﾚ\ﾓｪ5T}C"NrF$q,P讀gHbgｧ捧;ﾆｴDｻｨﾛ導20CD+ﾙｦ+`｣匐Zｴｹqv｡仙ﾎ贅淞Qﾇ[2>e23Xﾁｬ柘ﾎｷKｱ楷盜-Xﾂﾛ2~w(ｨY!柘７滓贈｡克\ﾕJh妨ﾘ2~梱Yｿﾁ;2~近ﾉ霹･2~?ﾈ#DQﾎﾎd[G9醤UJe漏ｪｨｺEｦlP:ﾔ┐Jｦｵ	$Fi3-ﾅ&3踰ｫ渓ｱ1ｿﾉx	Lx碌2″2ﾉxﾎ87d
2dｬﾄ)ﾋｶﾞvﾂ2ﾍ7!W唖枯iﾍTCｶ弗ﾛｨdi攜Tﾕ答縺ﾏ$Rｺ	[iﾖfR鞍癇E)BB脱>ｼ+ﾂTﾊ^ｸｼ"舵ﾗ1L咋ﾇｨ8Fc"櫟a,｡$Z"ｧp鯢･､0ｾNA>　嗜!1qH痩=ｻr&U､pﾆｲ>ｻG毒 ﾏPK>ﾌ&XG槞割瀏喩Yd=ﾛ?ﾊﾉ族I)忱･叔$贄
,tｸ-旬ｲﾇ]ﾒ;P睹ｺ倭ｶﾇZF血評ｿﾋ｢)微vﾄ.%&卸ﾗXZ+H\ye)XApﾖ色ｳmYEp6炊ｲI	^覓*e童ｼﾜﾗﾖ`ｶｭﾜ-2､ｼ`Шj禪儁oｼWz･^ﾕｹﾁ<&zSr僧ｧis&簽演ｱﾅﾑｨ桓慟lｩﾏ鼡|｡ﾓｼkｩﾗQkq0ｯﾂﾕﾌdｵyﾑ1ﾔﾁﾙﾙｺ悁iaｾ-'ﾑW"哺ｿ呵ｯ"ﾌ5ﾘﾒ銕 ｵ[錫亨MaﾘJ樓|8謄Gｼ爬yｸ\壅?鷹堕9$｣泝ﾂy=b#ﾓﾇ･Lp3vb|圦ﾆ夙Sｶ訌処gk&ﾜ超漠~Rﾎu4ﾏr8ｪOﾖ|ｾOn盤ﾐ|ﾁ{酲ｰ9ｴ幕 f軈砌纔5_踝ﾍgｴ\4ｹﾒiｺlqtﾎｼｴf｝
i区Y=y9鷙ﾉ}･ｲ俸1PAﾉT&｣hｧ:夭ﾗS1ﾟH&j茆ｺNnﾇｭｸ;ｱ
c;祚ｼ]xｻｦｺｿOG呼1ｰhﾀ^ﾑЖы}祀7WlCJﾂ磚上ｰ8#Tｫﾏ5ﾗｦgQ沢t}&ｸxﾗNｪ鸛IpｽX]Y忝徊
槧萬XFFb^b　
ﾝ8ﾄrｫﾄy"
ｬ栩#1FyT[い酖ﾝOｼ湯ﾀ胼&ﾆｼｳYN,跣F7Lﾞ7-ﾜﾋyc4q輯ﾟｿx胙ﾊ2(剥x沸ﾂ欽蟇Qﾈ_ｧ /ﾗPK‡｢E
ﾕPKma5antlr/RuleEndElement.classuR]OA=ｸBﾋPｫｭVaQx#ｦlH&啜｣Iﾒ&ｰｲ;嬪｣*M0FQﾆｻ犬ｾﾜｻﾌｹ醫=;ｷTPI ﾙ8(顏GsA Xﾀｾ鷙ﾔｱﾄi廓G2､p｡|ﾛｫrﾗ且ｭCLｹﾛｻ懶2ｰﾟﾑuKY"茵柝瞰Jﾚ杢"｡ｷ妃9GﾒﾛG6!哺ﾙb｣ﾖﾟﾝ=KｵFQｵjW(1{nﾏkﾊm+ﾋﾙｲｮZu[:R斧o :ｾXﾆ
ﾝ`l	(0Qﾖｱj 5ﾐﾈ･(Cnoﾚnｳ毫ｱ6ｭ謌SZ5L甑ﾃ洗;汀ﾙｹ$J~dY｣3bﾏｼwﾆ`ｭﾗ^;K9NA/
滴Rﾓ粭ﾅ週}ｧ:D9c民ﾁﾌr!ﾂWﾐ.x幡$燭STO哂v(ｰ2H凩Dﾌ鐶\<5G)JΘ
ｧc翔y鑑/>PKﾜ沺WｲﾔPKma5antlr/RuleRefElement.class控iOQ=ｯﾛtﾊDZD,CYTTｰ盤鼈
ｸ刀>Je:%ﾓ÷ｿﾆ麾	規礙?｣功uﾚbﾋ&ｽwﾞｹ檜QlﾑZ1*ﾌX羣-vwｴｻﾄ峨`Rｧﾄ｡8&C佝隙ﾙ ﾂx萇弭SﾂﾌKX晴ﾈｴ43ﾋｭｵ3ｴｨｴCmLﾗ護ﾘｺe謖l鎮C"?悠胸ｬﾁ獨ｵ-ｮ3ｦsFﾎ啼鞍UﾍｰtslﾅﾔyﾍL柾=n$ﾓCｯ)ﾊB!Cﾕ愧W[ﾜﾜﾐｶDNﾜﾔ,ﾚｺ繧)像T)e[|ﾈIP鬪ｷT[秀/Ъzｨ,@%@ﾛ藥ﾜ､b%n{jX9Tｬ	\ｬ[妲Z/俚|9'ｴｷ幹ｭ%晉ｹa濠ｨ2ｺﾑ#｣2"關ｰ$c1Yﾁc	iOT拡Ve<ﾇ/ｱ&｣Kpﾖｱ!癜凄斯･;;ﾜYXTﾆｼ複 Fｷ]+!bﾃ)ﾝ筥｡YｹC^ｽ
ﾕ'ｻp瞬ｼOciz｣M[ｱ;U0	衄6!*?筥ﾈｷｪ蜑?鏥XｧJY{Pﾄ@ﾔNCC
ﾀﾈ^ｦmWﾔ随;+wUﾆｰｶ･ﾞｭ]ｮｪ{)Cﾓ?r
ﾕ]uｯ悴r流野O#凝ﾌｴ}ndUｻｷIDn｣ｯﾟC?嶬ｮｳｼFﾊkWi
ｉy#{康Kｯ｡'z/ﾀv0n%qﾏｼ唄"V粘xｿ@"3y0朕瑛Y凭
h&]､殲恒fF言rｮ8\ｴd
?E@9G2R刃AﾂMB｢平zi^^r抖鮴'ﾛHuﾗSdo8RCﾔqｲ%z超F[ｶﾜ｣|ENd瑛;搭p)ﾃTﾐWNﾂ)B簧|w=奢39C9筴Qｪ}Wｮｴｨ祕ﾄｾ#ｼyﾆ岬s4鏡ﾚ給穆ｴ8ﾜ
ｸ%L%ｩKTｦB鴈BPK$%I7PKma5antlr/RuleSymbol.class}帝OAﾆ)ｽﾝBｹｼｩﾒCY<1&巽0$mｻ塲=嗄k｢4H41~2>3ﾝB-
Mﾎﾌｳｿ戍ﾇ/+ﾘﾌﾂ@9J1ﾜﾊnｫﾝ舘冕ｷ堋:ﾜQ6Rｸ+勢ｹA`ｼjm74w:ｮﾜRﾒｦ@ｪ._ﾖﾄ{〕(e(}[ｶ#ﾜ\Wﾚm'[ｦ5]s奨 ､sﾒｲI舉X-ﾓｵｹﾛｿ｡Bﾛ∫IｿMｱ;'ﾓﾅｳ`iO ,ｨKｱ*Kyﾝj2|kﾕ\*UｯjｸRkWｪ:Fｺ!ﾛ[ﾝF'凶!ｭ況]M 羔檐2R,q29ｿ肬
6sｶNrNﾏ､TUeIRﾒnﾐ	mﾒQ
)|展ﾜ5qI`ﾜﾑ+hﾙﾀ8&ﾜﾃ}9x,cXGﾆ7S尠肚JｯBﾋｬｰｧ谺fS(ﾄﾀﾝｽｩｰﾝaFv鴬壯LﾏPｼﾟ訳Y｢ﾀ擁!'gﾅP?ｦW｢ﾗIL騏Zｯi5ﾚﾋ<ｭaﾏ嗟ｹrQ華ｻc""/牌闥S朦W1ｹﾟｳrﾏ帆#^9B籌-ｫ?ﾌ0ﾟ,漂ﾌE.jｪbｺ$ｿ樅I-ﾎﾓ^ﾓV｡KQtCE9B7ﾒ橋\ｸl|ﾊｧyｸU(pｸﾎ<ｪ8K霖､&qLｿRｯw#ｻCﾑ	,ﾚ3o	4ﾈz母ﾓｬ9踰SRl:ﾃﾑ繕ﾂﾚD:Tﾖﾅn5晦gﾐ−消ﾀ.Qﾛ${､4ﾉｷｰ
PK6 ﾗPKma5antlr/SimpleTokenManager.class攻[WWBn(ｨX%卑Z{ｳ*bﾊﾍ嚠ｶ齔8堽､ﾉﾄ耽lｫmｵｭｽﾗﾗｾ･vｭﾖｪkuﾜﾕﾕoﾏh図rﾎﾞﾟｾ暹?p｣霤|;毎ｷEｼ#穩W｢筱lｴ｢虻ﾀt0(T\ｱ裔uﾁaﾜ染ｦﾍ嵩MVｹ1ﾃｰ｢ﾈ緇ﾑ)(瓦-漏ｷ棡,(ﾋ}引PﾄG!ﾜ矼>QﾎiK)ｦn*PﾆDoYim｡盤
e]答igCi+嶐ﾓｶa卩!#倫ﾍrg^Uﾐ`kY]ﾁﾎﾉﾚ-mｨdﾙ｡1ｭxﾝ9諳ﾄ1栖ｬｬﾕｳ&;^L-GﾍVW3ｫ刹CIｻ`蕎t-3cfﾉA儻T_｣zbｪ皸&<ｬW';pﾓ燮|^ｪa嗟L[ｦｭf濯5ｵytﾓ:ﾄﾐﾏｯO@:枩ﾃ40ﾗ:餬gﾏwV死ｳr(ｸｶw/<ｸﾎﾆWﾄCﾋｨ禽/｣>>ｸ掘|`
ﾇﾎVﾀｫ0G觀]F緜ｨsｭM+h>ｨ`[pﾛ ｬEﾖﾖVk摶ｼxl｢､ｯ~｢ﾐ.Fzｱ沍w'ﾙ#啻L"ﾓ穢}ﾈﾘｹN瀧散~ﾄSｫ喋+ﾘｵ	ﾊｮ若ﾈ`0ｲ60枩ｱmJ算Tﾐ｡<xD聰ﾜ"隷4RE洩g黝匣Aｦ8A2ｧH4代､6ﾁEｦﾞ｣8FＶ\{ﾙ@{ｽt3ｶ-\ONｫS3;$p｣ｼ9IOｮﾕNｮﾂｲAbxTU:ｯSrr=h/ﾝUｼﾒﾝｾUt5f(954ﾉｫ{ｪ_#Ey牝\^績xz*ﾘﾇﾏQ寂怫閾ﾝ｣/S=	ﾝG/P;QSC
ﾊ	LzﾐZWgRyp}OﾚｬﾑIﾈ`/ｭ*鵐ns-d=･.梛ｩ清] 胱Pｦ|｣
eｽ'蚶DﾏｮｲOｷ)/ YMｹ[､3冬:wﾑﾀ庶ﾂ2]ﾜめﾋi胥'ｳｸ蓊{<|ﾄkC~:(ﾟt^了PKﾐf|~PKma5 antlr/StringLiteralElement.class}UﾍS[Uﾝ竪^.>Dﾐｪ$Im5"ﾁVﾀびｴjIﾑﾖVH.Iﾊﾋ{R｡~Vｻtﾕｮﾔ坤3ｲpcgB:ｵ3式徠ﾂﾎｸp澁=%h"仇ｹ迸ﾏﾟ9ｼ{萄ｦ瓣Lｪ胤1甘~<#:ﾀxR*榑ﾐ自v<-iｹ$5ｺ厶舎蟶g1ｫaR9ｹ弃ｱ｡Sｰ(ｩ鈑梯ﾃ4ｼ斡4tRｺ8･%ｼ,ｩW8%gｺﾋｶ"7X･鈷pzﾒ裂ﾋzﾜﾐﾍ||ﾉｱ鞠>ﾉ燬)哘ﾃh$ｭ寰aﾇmｽTﾒd纔ｱﾖ儉E輩+'ｺﾒES悴之旃W箒辣)lﾝ!ｲ-祀矛ﾆﾐIEfﾒﾄﾐBﾏ前mﾉｪﾘYｱP伴痙(鬚C(	ﾓ剩喪<隈(ｱ!FlﾋxUﾅkgq弱uRq槭ﾞ炬ﾍtｮｲｺ*li1ﾊﾐ{ﾆﾌ蔚J"7jﾔﾝN俊鏐睚"ﾇ!心ｱﾊ賎▲ｊKk0T8LﾉｴP諄e狄8ﾂ![姦ﾃ皖犂換96ｰ)拿痊ｪx上}|ﾀ!ｮｪ#ｹｶｄjｺｯ>ｲｮjｾ~旦ﾙ_>枝ﾈR榜M=/靼ｷｷﾀ
.iｵｻ
ﾓ,ﾀﾐ射Yﾚ,ｭXﾃX､ｹｯ｢{mﾗﾉｴﾟef,ｩﾅJｸW>ｽ\f斬｢･ｵﾖ蜚ﾑ:V#岶Y$ｯ4S/Qｷﾄ%ﾑ四fｷmS 晉-｣R｢;m7>ｯｰm拠掌旭剴r_Kw備x厦2y;ｻ4Kﾉg罐hN∴lA.!ﾍｼle賦｡ﾛ#
ｳ紡握SｴﾌxｱT6龝EgI8蛤寨ﾕSﾈC茸ｰ7^ｹ"ﾔp,'ﾂ嫖z[ｰﾉI^｢=ｲ3aZｵwRt
"擔5uc獲ｶﾁ晞楚ﾛiﾆｿ;ﾃ態∪嚀
ﾚQ壽a!0QmDﾓ｢Qb_>ﾚcﾃｷﾀﾆ3恷UﾑVB庠6|L+a'ｯBｽｳｷ瑜ﾑjﾈ{ﾚj潦｡脂:鴉ｪ!ｸEﾌｰRC6zb珍材ﾘ喪hJB	)u妃漣\ﾒ!HxCﾞ瓊/ｰR萩{$ｮ)l渙7範Q7#ﾐ岌M_>ｾxPKxｷﾐ菅'ｼ2ｽOﾑ5ｳ亘ﾆｮｵ`6#-ｷｫK･-ﾗ慰N%|ZｫﾕｭRﾁ^rTﾐ.~9ﾅ"｣#0ｪc:."｡ﾊь$R:L､ｺ-ﾗ+2'ｶSｬｶ鶴ｴ^膣9Δｮ{ﾕ蒭6ｬﾒｩ2僵-ｪｫﾟﾎ楊ﾔﾞd.ﾗ2ヱlwﾍ~ｻB1Z\:碍ﾙﾋ,F<ﾃG=*8ｫﾎ.ﾎUpm3ｿB|瘠ﾀﾙ	ﾐｸ%ばu	ｮ	ｳぢG堅j斌hｱDMｨ庖w{ﾇZ黴Uﾆﾙ)ﾍｮ壽;jｶ)mmNﾋﾆﾓT賢85ｧ･o3Vｷ1z臀｣ﾓ壓=9矜ﾇ	ﾏD5ﾏ｣ﾏ ﾎ1h
CHc7囲cｷ9ｺ状ﾍ政ﾅ|cﾃﾔhｺ)+h｣ﾕｿｦPd
ｸ\:
Uｦ
5s"ﾔdCｨｾｪｶﾊa椢ﾟj胆Lｲﾟ播亦sﾏ2ﾉMﾞ<d]a狩ｸCV悲ﾜ裔ﾔﾆM垤gﾍﾉ
ふ2ю!;倫
ﾋｺS筏r証?跫ｭKｱ靴PK[呷綸PKma5antlr/SynPredBlock.class}ROﾓP=oﾖu屁ｰAD鮗ｹﾗﾀH$$11ﾑ1ｺ4	~*M禦PﾆﾚﾎHｶﾉｽ掉ﾎｻ/鄒涸ｾﾐﾂｦ"謀ｸ僞ﾋYｬ燒涯ﾜ稔ｵ牋Ｖ闥U+#ユﾌuMﾒ膨ｯﾊｺﾉﾟﾚｻｹﾗｩｿcHｸ=ﾁP4-Gｼ
┨ﾏlB悶hｻH3}埴DNﾁYｶfｽzD6	猊:DﾝｮYN_2襾~ﾊﾛ6w%ﾚuGﾞ｡xmﾉ･咐ﾖｽmﾛ=ｴ$[ﾃ5播hih羸竭ど樅ｩgxｮ煥*^2T
ｶGGGﾂ日恰,j鐐!ｱ)ｭ	ｯwK:!ｷl_xｭSVkﾍiﾒKﾒﾙﾋ\%!靨z.bﾋｩN`ﾒ\ｿ&ﾛIﾉP媾'~ﾓ`JX俶`ﾋ磋ﾙ'A｢ﾅﾉlﾌAtI匙ﾌｫﾆ{豢M抬F晄''ﾂ149O>廰ﾞt／ｱfﾀ莢)吠ｷ@ﾚh乎ｾﾐ｡ｨh槨?ﾗ殖池ﾆh4田$竓竭ﾙｨD
挾FY3ﾎRｭSY)ｪtﾍ
%珂鰲ﾐ幾ﾞ"Q;jU捨1ｲﾆre債qﾅnPKi)ﾕ(PKma5antlr/Token.class拘kOA=ﾓ明XｬｨbQ睡忙)*ｾ｢ｵYYZ符CXHｱlIﾙO~勢%惰熄RﾏﾖR宛ﾉ暾[">陽結蠱Eﾚ瑠>/ｷﾙqﾚmﾚWﾛ$琳CrPﾆH1(ｭ$sﾏp"
ﾏ⊃ﾟﾗ)ﾏA.w1Vﾛu7嗽wY迹hｭｺdｯ(ﾋﾀｫ8ﾅｴMﾋ%|ﾏﾟﾉTﾞc?lﾚﾊ0QFHﾒ(｣cｼｺフ勞ﾁﾘｪﾛﾙ茹(Sｸ衾歃y斐H7lｙq濳乢徂ﾁﾅ孅ﾞｨﾏ桜ｿｦ)ｴ?3mｿﾓｲ箔-Rｮ4oﾗ只鋤雄ﾊ{-ﾄ｡謫]/ｶｽ|)服ｭﾁ6W+qьﾕC｣にB<｢aGl@益Qo燧
A2gQｯﾛﾄ･ﾟﾏ重#..ぱPK%m}9PKma5antlr/TokenManager.classu柘NA｡ﾈVTｰｶﾕ頬ﾓ衄}ｮLﾄh5)eJ茂ﾎ親h蒄zﾑ｡携匠^933ｷw8ﾆwﾖBmｨ豪只+-ﾍ0ｸ齒T陏･5Bｧ蕩k(ﾓ卩}ｫ寫梳7TRﾆ/,:.歌,ﾊ$xH篳ｨLi餡ﾊ?隆FF#ﾋU8歎ｩ･UｲｴｵUmKｫX7ﾘ[L0uZfｫDｺﾈJﾚYM:W3Jﾘ｢`ﾏｲ?ﾕ2	ﾔEﾅﾐjMGHｹ 管:靦ﾊ&dT&ｿ\M	oﾆ55ﾋqﾗｮLgLﾊ
lﾆcﾝﾙXｱe:3ﾆ-Eｽﾉ笞ｪYgJ6､xj,_ｳｷK-N^ﾉ･;MBui*ｰﾍeJ#*9NtzKｭﾏwhｮ苣~叙xｵ搏･jﾂ｣酔
4Gxrﾂ借ｪ飴担補*5g搗蓆k｢&ﾒ峪撩ｳ3ﾐ.g5ﾐ¨q刹ﾉ0(N閻IM'RS/Sﾎﾙ/2Mｱb帥m躁I\桍ﾐ1ﾏ%)}
tﾑv3*^･ｷ｡假｡[楕>|渭傅羨ﾌ/m*nB縮S{浩V\觜｣ｭ攜串=hﾃyｲ珍徐~`イ|3FﾉﾟﾃGﾌ+蔟ﾑgｬ/ﾐ> HAy贐&k4｡7ｩ%k普ｭ从m轄廠ﾕｴG柁8I8ｶ&IｲIj!^ﾔ	ﾐﾗ8%ｮ｢Yfｳ9	O慮zV搖{ﾑ.｢ｩｸ嬉ﾒ;浚ﾗi･ﾄ:B忙GﾛｱﾌaN魯ﾓﾄｾﾅｩLS･ﾝﾅUﾌ:貶ﾝﾟﾚﾈ擱膺ﾋ$ｭ6渋･oﾈｰﾀ?濘9ﾟﾁ@ｫﾑd瞠:ｼ6W鰐\e畫ｫpＸ'Dﾎ48	硼｢p
ﾎS岳Fﾏ~ｽ矚PK3阡w+PKma5antlr/TokenRangeElement.class}TmSW~nｲﾉ5ﾀｷZMｲ@RｭZ5VEｫ仄Z+ｩｵ/7r	堆ﾙ.N鯀?ｱ3F暃c?G9楜ｻ｢橡ｹ<ﾏyｻ惱ｿ@	脂C8敞A彗
教i愿yﾟ磽qﾉD吏芝&ｮﾛ-从ｬ~ﾏﾍnaﾑﾀmYTSﾗ;)ﾘ)ﾜ褊=?ｸ/0茯ｺvｲsB6ﾊKｾﾗt"ｺﾑtDU ｮﾝ》ﾔ_ｾAHｸK^nｺM澗|ﾁVｮx薤OｵZﾊｫDjｭｽｮﾝﾝJｵP q｣ｽ｢FｦｫmｶﾚｫｩｺCHｪ｡])涕[珈aｩ繞笄bNｻｽﾎlｵ%ｲ	PkZｭ廈ｳ遏+wRP0瑠巫3}ｫﾉｵL? k}ﾓﾑ-%8次$寂K永ｰd&3E%繪〒ｿ78ﾆ窈V`Gｺ“+ﾐ兌Eﾃﾀ噪&裃[ﾍﾕUqR3殞_ﾐ1｣Rﾜｴﾝｶﾃｻ魑ﾟ]蟐&uｼ?Z淡ｦ褸ﾚ*ｻﾟZ`iF霧Z653?ｨ隠Cﾊs`Hvﾃﾕｶ6ﾂQｫ%@HK:ﾆ6遂b.va>6ｦ
>ﾓ曹穎s7箟iﾛ^_p糞7Pw~.ｻ\･ﾗｾｿｾｧ
xIｵｱｼｹ＠8x*4ﾂ馗ﾑ洶錨_AｰNGLﾖ$
	胆鐸碆ｻlﾍﾎ;V|1qﾋzﾄ+ﾍu酢
#Rﾌｱｾ衡璃ﾟEﾇｭ6ﾙ,ｳ
/8Iﾒ$ｳHAb~Y牽q廡ｷ1丶g:Eﾖｧ随ﾊ+ F;@ﾉｭF>F4牙cg鐐Ｍ拒ﾗQZﾙk鮎F_ﾌ8Mﾒﾂld哦<2&箍籀ﾄﾗ5ﾈ8ｹｰSﾒ壥ﾆ鞐zt｡BJｽzｶ｢S,s=睥[d謡0 ﾇ-ﾙ英滓dｸ7i饒A&ｽF<ﾓTy	-ﾃﾗPKd%jﾞPKma5antlr/TokenRefElement.class}TmSSW~!ｹﾉﾍ$$ﾊ禁`-$AmｵJｬ-R･iｯhMl+Zﾁ怱傴B/ｧ鰊v筧3~L斐M0ﾑﾌdﾏｳｯgｫ7仟T纔f狸 s3Iﾌ虐覡ﾄq6市|枷･I埀L\ﾀE&_嶌ﾋ&Pd+ﾌ}cw頁o9ﾌw&q沙･$ｾﾇu7,ﾄｮ4ﾜFpU`2g)7ｰe_9儒ｱ5ｵ[\-鐇ｪZ`ﾈjｸzeﾋYﾓ~Eｭﾙﾄﾚﾕｾ
堺BKﾛ饅)ﾟ営ﾖｵｪﾌｲｷ?ﾖ73ﾜﾑｵｶvｴﾌ=QO米q Qﾂ?ﾁ2pSbｷ$n緘w$ﾊｨHﾜ･:ﾊｶr蠡oｸk[ｵ奚9ﾂ､ﾀ鐓ｷｪkTo5p樌豸ｳ贓Y雲崙=ｬJﾜﾇｪｿ罍ﾄxh熨ﾂ噤ﾇU5juｶ]GC	貴ﾘ	榮4@IOaS su>ﾔ眷ﾀsｲ滕{ﾘ壱袖X0麥#ｽ2ｼM蟐ｺ&1}0n%ｯｸ｢**/J栖>$餞ﾝ^ブЗ9lｦﾀtｮﾛ70aﾛ絶%Bｰ箜慾oｪbjcCｻUﾙ樮zfｾB犒楾n;ｲHRｽ,Dﾇ｢磬ﾌ跨衣{．ﾊl!ﾉz:Z川ﾐﾂﾀlj睚sd
c､ﾞE*dFZHﾘ`)｣ﾀI｢SH=B杖0"lｧ即iｨNMU:ﾒcｲSs}ﾄ｡掎G-ﾛ宿$9!ｧBﾊ^ﾓtsﾖｵｽF'
/1ﾁ?caﾐ)｢ｧ鴈ﾃPK/kﾏ^`PKma5antlr/TokenStream.class;oﾗ>=vNv.Fﾎｼﾔ樺線ﾔ7ｶﾅy}[iﾘﾛｳ%蹣ｳﾂﾆsﾉ_t%nR扼$'おY―R糟L~`w5S崖:A匚ｺ2虎ｸｽkﾚﾅﾆ0M{=UﾗﾍZ幹4ﾌZｺﾋWｫmngﾍj!yｮ做ｩJｦP皈NｭwﾚﾇﾝBｳc捧3Chﾁ酌6ﾊtls+)LcCﾁ$ｦZｭ&ﾜﾃ怩0"+ﾘﾄilIxｨ 確1ﾐﾁﾙYﾚmﾒsﾑ:8Khp%ｾﾂ曚x?茶2ﾙI
賈@ﾈssﾍ
咫ｼ#｡rﾗq~ﾊKﾌ;!KNOｨzﾋ)7毆Iｸ>Cbﾈiﾟｱ(ｵ#xPﾟOﾃP*舵0Av*MaX､/J	ﾒ+｣ﾕ/ｨN 9|ﾝuｲ1Jｾ
ﾔﾒNo誠FｫﾋPK寳PKma5 antlr/TokenStreamException.classu析Jﾃ@ﾏ$i｣遇Oｭｫ&ｦﾒ<"郁*taijｴ摧征ｯ*狡｡ﾄ{c	uﾟLﾎ=釵a>ｿﾞ?ﾑｭﾆ.｣ﾉhﾙhﾛ煩#･ｦ{r'`]ﾅJﾀ	"ｭFｫﾅD%｡慘I鮑ﾁ｣|\齷?N滴ﾏﾎ8瀘ﾐ(瓩ｿpﾜｼ[ｪ後U2U7;'･ｩ將躯ﾗｩZｦQｬｭﾁﾆ｣ﾊｨ1=ｩﾓy穉J	ｴ蒲｣0ｸ篇G応＠ﾁM課ﾗｧ]ﾐ^27:ﾐﾕﾄ劑ﾜ^]ﾛ秋蹕ﾙd0&
iﾚﾚ>ﾀｧﾌbKwﾚﾋMｬ｢ｿGIiﾐﾙ
PK坐gPKma5(antlr/TokenStreamHiddenTokenFilter.class攻[oU弱K,q湯圖%｡gﾆm／註贍RSｻ@
acｯaｩ/啄ｦB TRERy､ﾆ !梭ﾄ珸ﾟnlw拊di譛3ﾟﾌﾎ;ﾇﾋo&q##ｸﾆ ｦB滋3ｲyYﾄl楪ﾅ訶3｡XｱA7zI容活+ｲMﾉ鷆W臭ﾗBx-ﾗｺﾟｷrfﾆｨﾞT86JｵB%-
fｶf必ﾕ､Uﾜ,$ｬﾚ該娵/匚j决ﾉｪ+fnｵ|ﾓ,5ﾝﾋﾅbｹtﾅﾊ衫ﾒJｭbE@ｷhﾁｨﾖﾓ胴*G
ﾁ!gcn,辨XS/穆&･ｭ馳mｫｸaVV麹OBYfｹU茗+&ﾀﾈ･[Ysﾓﾎ=74ﾗ~Yｾｧﾐ杠[ｲｪY｣痴j庚tｬZ惧T銛5ｳ｢0PD逍4b.y6-qNﾜYp傭S,｣H纎>>ｶ_FJKIGﾆb
/=/ﾈT鈞a｡姚ｴ体ｾ5ｲRﾞｪdﾙm厦hﾋ[刈曽戛ﾀﾐﾐpﾏh8aﾌR'4<坤務｢%徇<&[
Cﾖｬ8ｾ5ｬ祟
kxKﾃﾛ:ﾖ5ｼ#bDp:"ﾞﾅi
ﾏ[ﾒFﾇｶBﾛ@Fﾕﾊ廐ﾚﾌ
GﾛﾎｼUX･ﾍ-禎浴'3Vｷ7ﾆｧxy寒ﾜgﾞ膕ｮ捕ｽUwﾇ:r葉Vｽ2r9侯8ﾅWﾈﾏgﾁ'ﾋ/Mｶ悪詔Z#偲･蚣外緒zP擾B駛>Wt]ﾟ◆haf=睨ｧ逞	ﾒ[笨､Vﾔ}ｺﾁRﾝ;7CD=C憫ｸ攝簧't&s[ｯ#｢ﾒﾐuﾔ｡ﾕﾄw潛oﾋﾉ},{0q!ｾﾍ>I?ﾀPﾜｵEmｯ辮cﾒ;L!|{阮ｵOｾ燹{ﾍlｧﾐKｩ3ﾋIq喚ﾓ价ﾌ続)%ﾗﾏ造軋夘4感Vpﾛ椀ｩN!	ｷﾕ#ﾔﾒ｢Tc紊Ap嘘Gｼ*0縷/*e磧鐶/t咄艨	ｼﾐ5ﾊI$ｼﾐ肌ﾘ:ﾎﾏKa:Tﾇ奈菌ｰ]ﾎｸ.cｮKPZ祟,ﾏeﾖﾈO┸ﾙX培s\
E
uQﾟｱ郛誓Kﾚﾘ3蒋ｻOd忤ｩ\ｮ%$ｮｽZg古ｦ耋\g･ﾜf+n~ﾌ	o鬧ｼ駅x>gｿ ｭｾ$･"ｯXﾕ=ﾒ駝|oｾ}С邵磬ｿPK紂ﾐPKma5"antlr/TokenStreamIOException.classmPﾋNﾂP=SZ@J}lﾜｵ籍ﾐｸ1囗. /xﾓ\-坦諺蕋M\~拝.Hh&厠恙99sｾ>ｿ;h｢蝣み:ﾊﾘｳｱo｣Mｰ!xﾃG,"e｢廐ｫ吏\dﾊ3B\i評p#ﾊ玲AZC･袿j>暮XLF恆Y･3yｭ諄l椄eｩ
Aﾎj｣翊ﾃ°ｺ.ｪｰ	'BgI_叱ﾆﾃvゝﾋV."f9 {(:侍A髦Ｎ4憫
ｫｰ尭ﾁｫ龕攘ｻﾐﾟAｰz7膿ﾗ{;9._h熕Q養浩PKﾝｧ惶	PKma5+antlr/TokenStreamRecognitionException.classQMKﾃ@}ﾛｴIcｫmjｵ
ZP4?@"zl驀[mw%Mﾅ衍<Q稷*^R賠a賚ｼy3;歙zﾘuｰ炎Ux:ｬYﾘｲPg(ﾄbｬBｽﾋdﾗ:撚)y8ﾚ9f0O"O[ｶ3u#ﾊA$ﾅﾕ|:&ﾕO礬丁ﾗjｷ.C薗鑑Wx,."]~8PwBRN*ｱ柤`aﾛﾅJ.l4\X(ｺXG蚊h9?=匱lr5ﾓ	Er)f3ﾒｰｵVv滾Mo梼ﾀ靦l蒟ﾈｳ瘰]K藷｣:ﾝﾘr晟+檎批jﾙ
1ｫｴ萌(-ﾃ=HｻﾅﾎOｿ,3ﾅdﾋｩ簇7PKc`lc0PKma5%antlr/TokenStreamRetryException.class;oﾗ>=^.f.vnvF6嵶ｼﾌ;Ff
ﾍ0F錮乃F~淮ｼTｿﾒﾜ､ﾔ｢斉､Wp~iQrｪ[&#帖撓\R爆濃RT饂像ZP貯洫藍X綿ﾃﾀﾂﾀﾊﾈ 沽W担､輯-#
ｸ$"ﾐ ﾀА$制30ｰjmg`ﾜ貿箪@@@ 實PKnt眇ｲPKma5&antlr/TokenStreamRewriteEngine$1.classQIK1}鯲8ｶ纂]+
ｶn｣W/E｡PｭxOkﾐ4#iwﾄc/"xﾏ$oｨ−ﾋ#裹ﾋ聟ﾝ=y県ﾐ┛$tｻ鎬ﾂBﾆﾅ帰CM襦ﾖ&F欺僉;瘻P%｣ｯn鬼-更SR影d饅adx+RIｳﾊ0序ﾛeｰ癰`h/ｰQｯ妹ﾞ砒ｷV昌ｦj*[<'ﾜｸﾚ7ﾋ｢b"ｹCｪﾖuEｬﾋH`霍{#ｮ{hFﾒﾅｷﾕﾉﾏnXhndｨ:~B^A)｡ｯﾕDﾍﾃ(ﾆhz/2ﾄｾ?｡;鵲~>7｡fｰｲﾑﾔVep､ﾚgｬ@6g(t`ﾊ)D+AｻｭT拘!ｩ饉ｰ髯$ｮyk｣'器顏<ｿEｧﾊｹXｳ野ｹkﾘ崢廛罩ｻc7ｬﾆ予oL|ｦB^唾ｦN擲ｭ4)ｧｩｲﾐ>2ﾄPK:ﾗｮ6ｼPKma5-antlr/TokenStreamRewriteEngine$DeleteOp.class請Nﾃ0ﾆ?ｧi宕@｡C%
C R､
､ｶbwﾋ)2ｸN8蟷x
q`Kwｿtﾟﾉ迴ﾏｷw&h 艶Fｴ.撚Rﾙﾏﾓ{｝X>拭g､ﾝﾖﾙｩ彿V棚Yﾛ9ﾝ(_Nﾋ'2gI.ﾆl淵kSｰe(W2E]i惴ﾙoﾝｽ+ﾒ蒻n)cCvｨeUQ%ﾐgﾆ忙ﾎﾗﾎﾞ繞F5剿ｦﾈﾘｩLqW<{ #hrlqﾕcz|ｶ ^!^ﾖﾇcｮ冀mlq2ﾘﾀ&ｫ
ﾎﾛ袷PKQTPKma53antlr/TokenStreamRewriteEngine$InsertBeforeOp.classQﾉNA}ｭﾀ(滋ｸ.ﾁe>｢		船孝｣F
2=逃G(/&F~eｬ1齢､zﾕ抔殪vｰ咼饌ﾄ1牝82!垈0eaV ｱ*ﾗ	LoTｪ7^:mｩZﾎｱﾑｮjｧｱｲﾗ 》ﾕUtﾜﾕI淙z脅tFﾙ壕ｴ4乢櫛魁ﾘ5ｸ｡hﾄｻ%ﾅ5$手AｻU擬lXｲ1小宜ｲｱ懸［ｩL[;ｿ鰊+ｪCﾚ畑駟ｪｩ~ﾂｮ(Eｺﾜ慢uN5浙4ｮｧﾆ｢TﾌPﾗd｢ﾖｱ｣?{ﾂ朏ﾟ'ﾕﾘ期Vﾌf･@ﾜU
6u鴆ﾟ#ﾇCN \｡ｫｴAﾞUﾈnｽB<1	qLr!pﾎ｢fF`貪嶽f/<{ﾓ]r｣ﾑS倔彗ﾇ$ｦ9}PK/|ｦ@qPKma5.antlr/TokenStreamRewriteEngine$ReplaceOp.classR;OA<¬ﾃgPZ`,4喀b4｢ｭ警z.幼Q~剥縁ﾄﾂﾒﾂe愿ﾆh33;3ﾟｷ3ﾟﾇﾋ+"ﾖ｢c*篝剋bｳ"珠hK5ｩ' ,Åｶｭlｽ#席Zﾖ皈ｼ%GｪVｩｪ=[ｵﾊｹ≒^ｻI島ｶ｢｣u攵址;1ｨG紺(vﾏﾏﾉ+鋩刺ｵﾝt`tｭ}E顎H^W靹ｳ5ｫS}､L5詮ﾆﾀ忠eｬXﾈJ･ｯ4ｿ^!ﾗ
:vyﾋoｱi)Eﾞﾝ｡察饑鰄%OjｻｭbΛｹ0ｭ4ｴ@|ｰﾊﾟ%7整Kｪ)P罰ｦｬ@跣UXｸﾇ(ﾀqQｶc|*`+儖n>C膣ﾜMｶ\Zﾌpﾁﾝ6gﾇ9ﾜbｦD#o07|)@ﾉ_ ﾅﾉ1,ｰ峻ﾂ諍ｸ0$F?PKG相?ﾆPKma55antlr/TokenStreamRewriteEngine$RewriteOperation.class}SYoQ.ﾛﾀ8J+.ﾐ筆pﾟhk-B%ﾁ｢･1ﾍ.8-\ﾈ0(?ﾊM4ﾑﾄ熄2;簫}ﾎｾﾜs耆79廼ﾌ#@$ｬHｲｮｨｸ殻R
ﾒ*Kﾈ装ｺ怱ｼ
0x
ﾑ稍VaX|l1┃{;=ﾟﾕE'_ｷLCt
ｾUCﾖ:C$Y匕ｧ^Qtｱﾟﾁｪ!ｨﾗ琥ｮﾞ闥F當ﾞYﾄE鉄｡屮v屁庖[_:ﾅdjVjｽ?2崗lﾈｴKｻ}.ﾈﾆﾞo/ﾏﾉH
ﾜﾕﾆｆE慯p<ﾐK
i(`Uﾃﾖ5<ﾆ=kvc杼逃ｳ!劼┤b2E!ｯｫkﾗGb"ﾕﾜﾔ-｣/Bﾓ*ｭ"7犠}8腓ﾛGｭｱﾇ峩wR邪ﾟ癘翡ｰpd:賜<ｦ｢ﾁSﾈｶﾞ紲ｲｱ,ｾﾖｦﾅ%+rｾ.ｭS焼ﾀpﾔN|i逡驛-fﾓ兎ﾋ0#ﾟ?ﾖ	ﾖ蜩ｧ8敘<ﾝｹ~<uﾁY0#6yｸﾓ`鳧\鴈ﾜ櫞ﾅp0L@臆Lｳ9<#ﾋD'	毎ｺzﾓ溂'ﾌGxNs\､>U跳ｶﾒ6<6ｼﾕL(aﾃｷ哩yﾞdl(6ﾕｯｼ>Й筰ｰF ｳﾚ8Zｱ1Gｼ婬o#X/猊KｱCｽﾕｩｧe錏驩J!ﾜﾀ-PK鷙|OEPKma5$antlr/TokenStreamRewriteEngine.class抔xTﾅg_wws ｰ% nX券 ﾈj0>
帑&,Мﾜﾝ( *U|U+｢"JDｴTEﾅ*	ﾅ糺ﾙjﾕｪ}hk[ｵｶ･Vmzﾎﾍ跏hﾌ撕9醂冱fﾃL9n怺拵T`雷ｾ`r'董)ﾘ#1s&w)ｸﾛ
7睾ｺ痩]Nﾜ浴ｱ7富@ﾁ/ﾜﾈﾅキﾊXDｯﾑﾉ\珮y､極#LUpﾐ国xﾜ'$3<･熕cY匡ｹ佶3L枡ﾀsL樒U^牘匸､瀑7寄
w^ex攸~ﾉ膰Lﾞ`ﾞ莟ｷ仂ｭ7ｦaw~ﾍﾃﾝw匸ﾇc3ｭ婬ｿ3身?箟ﾟ)ｽ褸怒x苡n|薫傲Iﾁ|ｪ/
ｪ瀰ﾎｹZｳﾗｴ
ｨﾁHD勤iﾅbZLﾀｵHkmﾕﾋｩｬ`$ｦE羌ｵﾆ蜜ﾈY､
3N究粃毎@veｰjYﾍ４ﾋｫｫ譁. 冱Z"ｱx(_jnﾓｬｴｿ2ｷ|^ﾙ竓啼-8yQY蟯ｪｲﾊr⌒兜｡sC%ﾍ｡HSIu<4ﾍﾔﾃｬ
ﾖ,ｫ朮ﾎB剖ZﾍIﾀﾚ粃謦角,N gkｴ･)ZMｳﾙiｳ複VJﾆukXF0ﾒｭa楠a"ﾑｱxTｭ\A7GK$[ｵ$
畊}(ﾚP姦･ﾔｷ47k宜IxuksﾉpｼZcm3ﾃ叢⊂"y当ﾘ豢4hｬk8｢Uｵｭｮﾓ｢5｡ｺfj2ﾄﾑﾖﾄ(瘧&･ｳﾑ悌5ZｫTFﾁg苣(iWｪ'}mEOｺｶ慂lｱ0瓣k循Lﾘ･榔CCMKuK4ｮ5>=亘｢ｹﾎPi";!$袁3Y![ﾖﾗ｢c{i3｣[鰍SPｪyEf.6gUﾃiL@&ﾎ@ｰH加､†囘ｦO?ﾒﾋ4y瑾羽｢sEF@No冨hﾄQｬ瓊｡ｦ:
｡韈鮪C敦svｼtﾒ9螺+dBS否ﾃ毎ｺ:Mﾊk9ﾑ0_ｨ9ｱ6e5:&	,渚7孅ﾆ[zﾌNﾆ4､ﾌﾅgﾆ[詼umM=k#c*ﾌ2_?寥&iﾉQﾘｿ餾yｧﾁpｨ吁ﾚbﾒｩ$ｮ<GｵJkとFZ?il詫ｽWVﾝﾀ&&FSｫ[ﾚ｢ﾚｼ0gﾑ･舎ｬ｣&ｬbWｱﾋU儘▲ｨｩ]F\ｧｬ-祈Ckﾙd幌至ｳ#ｲ=5??[A譜絏kｵ5ﾇ|ｮ]E3ﾈ%Cﾌ｢Qﾅ,ｸFﾅ?/Goｭ穐
｡
ﾝﾛﾛ*ｾﾆ7*bhSq.}3ｶ	 鮮+ｭｪ隕ｴ┗│｣=0ﾅ騾n｡2IX菩6kｱ榾ｪｰｳｭﾒ託ﾅ溢}Ea3ﾎWq.fr	w7ｰ+ﾎSｱW0ｹI.)/ｳ	幃､ベv[c｣Fｾ
Wｫﾂ〔U｡ｧ危闍ﾈf&7ｨﾂ%ﾜ*ｶP庸3Tﾜ渥=ﾛ-E#qｭ王jﾇ6Edｪﾘ.ｲTﾜ*ｲFﾝ.J5)Y鷏R艇>≠ﾞG"XVﾝs襁ﾄﾜ亮ﾃ匸Lﾐﾁu屬lﾘﾚFLKO	%g雙w梓<ｳ2ｧ(從ﾗｶr磁[!-ﾈ8ﾊj艮H沖ｭ3菻｣ｭｨﾄﾚw!ｩﾔ悚ｧﾆ
tu戴ﾄ督ﾍI:3uT｢kｫｵPｴ~ﾀ"ｹJｵｺ5Dｧｨ%*3ｰｧ(hj5ﾆ&Oua9塹yｦ廳0ﾝ2:BｭｭZё 晝R笘ｰg]ﾟﾆ?ｿ/P軛ｫl柊ｬ3ｬ?Hn 7ﾆｸﾚｬ8侭q~ｯ1ｲｪ椈Upﾑ#p1孟ﾓf)=N,8曉ｵ8#ﾙﾏｦ冓gﾁﾆe∪m\rdﾒ[*<ｲ･ｲ"[ｪ1ﾔN!lV
So<ｬ$pΞ殳B< ﾟU+下蠧f8)91dir:ﾓﾗ	軌ヵ河gﾝｻｯ尺N(瑶態.ｸk:続*}gﾒ\57帷rhrｬX囹ｷ･曝｢7潜登.Eｮﾀ`\Cﾏ-Gｲ[17aｶ送ﾚ	E撫gE/ﾔm;穆ﾀ ﾇ馥?"?菜;0ﾘﾟ!ｶﾈ｢ｮ?遵ｴｨ･)ﾛrｲﾑ等:盛ｭｻﾋｿ7ｩﾗXrp;2ｱΣ久ﾚﾇ;ﾀn披.ﾌﾇﾝHｯｴﾐｿ鉅+ﾔｵrrｳ;0ﾔ頏烝沿鼈Sﾈ6j'ｰﾛHﾍa2ﾄ[U|yr､ﾘZpﾃｭHｸ1%/W｢:ﾈg暉ｽ滾a嚔!ｮﾋGQ揉B嗾 ﾟｨﾈ｣p燿ｴ%	ﾕ渝j｢x関､ﾚhb+ｹｱﾀx僕}N"ﾖ$｢.噐ﾚG#ｪｺ0ｲ鳴lﾔt[qﾀkﾛ肖･v梢ﾛ剏/ﾘ`;ctﾗﾆ霑爵pmｴw~w｣]曄睿Xn-ux･絵)>6mV:ﾚ騏縉Jﾔ`	ﾀｪｭTJUﾄﾇ6L,(45ﾑJ據`那ﾙｷ5$ｺ)sWb8ﾑ#茴ｯ#,ﾒ拇､pb徘眸L早ｩ_.ｲ0_xｰ@臑択"$#"ｱN1頼Qﾘ$F:1[hｾ]孤mb")8$ｦﾒ殻ｱ.yｼmｬｺx(28N1MBﾎ7∽d2 3%dｽГ-ﾋﾐｯﾘw"2ﾅIw℃屏聢>［9aFﾌ\ｸD9構ﾘｯE#d>ｩ柏,ｳJA*%茯ﾁ-$起萄屈ｴﾃ戸ｻP\[Pﾜ暇}綽ﾔ K,ｦ窓:Nﾐ頭孛d%K堅ﾓﾉｵｳ!
cﾁ嫣ﾎ"ﾌﾙｳﾎd?#f9aBc砥｜La4音Xﾇﾈvjs(ｫﾖ交ﾚ:1･ﾇ+-ﾂy猿<朴故Kｹ>ﾑxm&6ﾃ#Zidc2ｿn[zv倹v\B.5ﾈyY#!吏ｬ筴T5ﾕ9 %蔗~"ｷ"Ｍ瑞+註遨:&訐B錐re_HX們ﾕa?I櫓ｷｪy8#*\M#zID"+gｾ曩sS衽ﾁEl"J"3忙!ﾃ021_OtｮM帑W}V_Jm
8ﾞｸﾂV華ｬ#4/ﾎｬ.L｣崙ｫKm[;[ﾁ.功ﾘ+ﾄﾐb汞jzft`贅6ﾊoRlﾏJ-舵ﾂD;
ﾅvK4ｱデｯ;囃'舗%ﾗｧmｻ.投h腑#dｷﾘ5ﾆ毳ﾘ卓75.Xｴqﾇｺ/Lｷym鷹ｵIl｣m(ﾁﾕ}5ﾝN%ｲ+d;橇(#v｡ﾋ｣､^修ﾄe^嵒a(e'JﾒxﾆmtTｷﾞ設ﾝ/y化
ﾓﾒPｯﾓKｳ笛圃7交Cｬbbｯﾝ躄ﾒv瀧IGｩﾓ絖ﾊﾖ卞ｺｼ.Z_v;2ｼ.ｹﾚﾒ康ﾂｽﾂﾟiﾛA>}ﾞO	j/ﾕHﾘ廊'j韓娼｢補1ﾔ管ﾑ$Qm~ﾄa\-棕休Pｼ隈ﾄｫxLｼﾄxWｼ焼ﾛBｼ#=zﾟｿ/<1F|(&QｿD|Lｫn9ZXﾍ6nｧﾑ#uzO7ﾄ~糟ｱｽbH2$ｳﾀs
/PBq祠埒1y哦ｺ<ﾎ5#dﾀ菜ｪ3ﾏ"f`/)a科ﾊﾀ3ｰ[P*恬ねKｫ
7ﾈﾟb郁ｦ騒苧當6D伎B9?/N6^}eﾞｲX1ﾘﾂuf
]黛ｽ+Bｲ+{{kbQ親q"ﾗ"ﾞBｷ'eM#I,kXS)･ﾊ､Iﾊb>K6ﾜ膾ﾑ-ﾟ=+Zﾆ['ｳ4\ﾃｨAHﾃ6ｲ躬J$0ﾚﾈq僊
z1ｪ%ﾞqｽﾜｬns!TyﾃﾐNaﾅ4菎慟脇ｻｱｼ]ｵrX姓ﾌi7ｮｶ0X沌P･3hｸﾛfaJ迦Iﾌ(ﾘﾕ0=
wQ4ｴ@雀ﾚ狃ｺｽ]ﾈﾙ{YNeJ皃C-hｧﾒoFtt'ｰｭ嚔Vﾘ4c∵]zｹlX9←ﾀﾑ	ｾ\ﾛﾗ\邑Es_ﾗcFκqNﾏﾖｭｩl縺c47ｩﾀﾌｶｾ葩^治ｲﾅ
ﾝrvｸN>-眛Dm[Gh?@ﾅN馨P^X ﾁｵ  %ﾜ&1U'X;H禪(S島m6懷4S$	ｿIｾﾓe但'敖u.O9ﾃ5鬲ﾒtヱ%
碓xD朞雅ﾇﾐｶ紗Mﾂ=ｽ鞳Y_9.?ﾂﾀｻｩｦnA参hs<碣憎1ﾋ'IｴGﾒy帰/ｿﾘ!?l>N症$Eﾍ"ｾ嫂前捗E,6Hｴ執8/@ﾊ]詫pｱ橇j梺_壗Yﾜｮ!ﾜｬ!H渾ﾅ6xｯﾖ<ｹｸﾔﾘ､sｶ_w凩QVx鐓ﾓ鵄ﾜemﾔ剌ﾖw%&nnｿTｰｯAE.
vﾃﾘ｣ﾈｼﾀb`5mﾀ]>xp粋T?j;挧ﾓsmｧsﾊｽhｶ{ｫ袮ｨgｶc{Y譱ｸtﾋ\猪aｽn;Vcﾔk[n狭ｻﾄﾄ;鵡ﾔ*c之ﾍｺﾞ,ｸﾔ鰰?Yﾎ4-%zGl
優害豢f葯YWｶ0避ﾍqｯﾝV:b:"ﾐt┳ｦ#
!ﾉｯVﾄ)w^晶SEﾚｱJﾛ裡r:)｢｣~ラбｺ戞｢H伜0溺 咄qｴ@ﾂUi｣qYﾊ$頗u(PdC;蕃y呟甜┼ｰﾙ0ﾕ,O災|6/bﾒ+[KﾁﾖEﾂ鯉%(廟ﾒCﾂ祭.､ソ蝿ﾙｽ/sK漁齒HLﾌ6%PK\ｴPKma5antlr/TokenWithIndex.classuRmoﾒ`=oju矇dsﾀｦｬ瓔ﾋﾆﾁ%&$ﾄ/#cﾐｫﾐ,f'?h｢辛Gﾏm	鵜ﾓﾜ懃ﾜ懃ｶｿ~	}yl\]ﾀ2ｮiｸn m牝魁Uﾇ
峺寺k:"ｾ･羝ﾄ;:基梟(､=ｿ缺*ｨｦBｦ碼^ｸｯ清*ﾏRAﾇUXlyｾlﾔ?rm遞Gfﾅjｶﾞ:忝ﾏｻﾃp顋ﾝ]ｩﾐﾟｻa3隆ﾓ1lﾊ30V虱0
醤ｧｵﾜﾞｹ/|uｩ迦ﾄ%ｬ
L\ﾄ
ﾌwy2:9qｼﾔ+H牾Bbｧlb%Z)ﾛ
ｻﾘTﾐｷg｢!ｭﾒqﾐ綯O荷欧?
娉ﾈﾆAﾐ~ｴﾉ!:メwlC:CﾅVy]行lｻｧ48瀝Rb恬｡c枇mK_ﾎ惑ﾎ9ﾗｸ*1ﾊ^ｺ:	/
$K!ｲ他0賓!ﾉﾐｪ{て|A椶ｰ詩iA匸dｪoHﾎW馭採lN3?_只4堵"r拗,橋ﾃﾂｶ~ rＵ.3ｦ/枕｡$ﾃ`ﾈ搴sSｱ謔芫qｾ$y愉ｹﾏs'影ﾆｶPK\ｽ]oPKma5antlr/Tool.class杭	x\U>%肉2yY:mﾚｦiﾚ髷Lｶ6v》｡mｺ&m陞箕等妖ﾚﾉL丼挟 UﾑV!｡彫(ｸPAY筆ﾀEQQQQﾞ%妬!ﾜ;ﾞsﾎ=ﾜssﾎq"ｪS>讀'xj>bｷ4ﾓ､.ﾍ紅J?K袢<+擘q阜x4ｮ明F啝i熙ｩ庸ｮ4､iPｲﾇYｲ遶ｼﾀIx｡|,呈4'湮坑ｰX%Nｪ爻/敷卮gHｿﾜ	ｲ*ｯtﾒLn断4ｫU^｣Z'UZ4nVL'ﾕr怖ｯﾗｸE綏aﾞF際T>K藪NZﾈ屎ｴｷｨｼU蚓Nj費ﾓyｻ努pｻ努.uｶﾊ酳ﾇﾙ"畚'v~槎ｻ擽歓ﾒtH纉9ｿ4ﾊ扼:Sё9ｩｻU8i/Ty藷ﾚxｯﾊA'miBﾒуｭW胚･秋ﾕ8&}\繃NﾞﾏT>隍si.疲"i.VB(/QR/Sr艮ﾐJ扮ﾒj'虧T､ﾆﾗ:)ﾄﾗﾈｩ]ｧｧ忿=ﾟ 貔Q唹kﾙﾕ!'?'ﾍ5ｾI/hﾅ|h|X#I/k|ｳﾆｷh|ｫﾆ_ﾑ6坐ｪM;4ｾS>9ﾇｻ4ｾ[ﾜ｣ﾗ5ｾWｴｻO蚩H?U蚩jﾜｯN/ﾗｨﾆﾟﾒ瀬TyH蘢NｺE儒fﾎｨI縊ﾅ5Gv0,&yP紕ｦ耡<恟坐ｫd;>¬:ｩ欅ﾈﾇcﾒ<.?疲	｡柁O鈎Oic"?疲i此ﾑY!yN
uﾕo殺｡ｮﾅLｺ延#ｼ!ﾐ0MlbﾁH朴8ｸ:m濃ｷ7j1ﾁｨｨﾋｭ
xｻB疉,煖29e [ﾅｪXｷ･ｵ)?穣ﾆcｫ+闃x{zｼ5□)扠%鋒｝&ﾃ7ﾗ)
bFﾄ幻E湖ﾀ5"Mﾞｨﾑ
ﾕユｿﾅ&盛ﾇﾘﾜAﾜ[
!%QX!sﾘnr`sﾌ衆Qﾓn	ъｨ睡崢｡h,ﾅﾂz2ｷ"ﾒｵﾍcｪｽ/ｾｭWb寫ﾖﾌ[bﾋ腕*ｫｶ16ﾐｮXﾄl姻t-ﾞﾙ>[嬾述俵ﾙNbv囹ﾆ6､6;ｴ｣ｷ[l･68&}ﾄｶ￣ｭｱo｡jﾉｰz9ﾆｶ榜罎FLｴkﾂo,&3ｹﾒﾖjﾔﾜbｱﾅD_ｷ瞻恭賻>1'ﾌ1B1\Pｹk?ﾄﾖ"R{Z婀僞ﾂｨarｮ>3zM0･?ｼ1r0ﾖ埼ｯ冓|6}ЦO'?]3禿ｰb･4儀"ｧ#iﾛﾜ,ｴ旙`k 掌ycﾝLｳｳﾉﾌ;rｰ閲ｻ,Ym5lﾗﾋﾎﾟﾆDﾜ睨ﾝFｰ]74)
!業2ｶ
U%ﾃｻ
ﾟｱq ﾈ/IｾXｲｲj4G伍p$<.&O*ﾉ糖s打ﾞ	wE肩`Tｧ7
ﾚ(跖>ｮ2zｱIoﾌ@ﾀ蔟z#Hｦ)肘udi[1?｡0(｣ﾆf擴ｶ｢燠淒MU'緡ｦi!ﾋﾙ虐ﾝｶYﾒ	nZth7|n\W.瘧f9｡Xｶﾀｽ草鬚椪｡uWﾓ｣#pF[ﾚp贖雑|･cｾ$:贈ﾓ/餮:榴i桾9z_ｧﾓ$SYﾂtﾍ!(光o瞬ﾆ*ｿｮH畧Sﾖliﾞｲzﾓ竃tz憎ﾔ%2ｽ｢ﾓｫsi^導ﾗe相SbНoﾐ/奪ｫ君o<ﾋLnｲ8ｶXｧ鍼ｭoﾋo"ﾂ3-ｵ2ﾞﾙ);5`｡俚#ｵｰ批ﾚｧﾖ靹w{亘ｱ;,1:ｿEo鷭Fﾃﾎ鰰$6|_?ﾐt#司B
E它oi?51ﾖﾝﾑｸｯﾛ5ﾏﾅ-!鏡-f･ﾈﾒｦﾝ→;窒ﾝX(｡ﾆ*Fﾚ鳧'S7千C^ﾑ"Mﾖ~芽┣YﾙｩA
ﾇﾜﾞ､ﾅ\ﾂT沱ﾘ溟fｷ?lDCsbn"Kﾄﾏ0紗弘lﾏ:3ﾃ櫂孚[匁/Y,萍犁ｪﾟ*ｿｫ?:救ﾜ稚宰3ﾔ=ｷﾎ9~[･諒ﾍﾄ!ﾞ<･ｳﾊﾐﾁbYｱaKﾋｦ縲(5&Qｳ5B鳴ﾂｿ腑Kﾋﾞ!oiﾄi)@?HNぽﾚdB!]aｦ｢XAｿ@ﾆr繙;v孳.Zｧｳ:+
 j環1#{Iр･鯖Urt%Wqﾀ8ﾖ#fu%OQuESuﾅ旺T
ﾄ乞T6ｽﾑ閹plM8ｧﾅﾅ&oHｼ,
rdﾄ･ﾟｨJﾏ+頒K敦悧4iﾓﾓH+]ﾞ`胡緯｣榎ri$紲ｪ璋怪9ﾘ彭X<ｳ$彭Yd乍wtG4qkｨﾛﾄ+ｿﾛﾌ<ﾋﾘ未ﾓ姜fﾓｬ NW$ﾛｰｰ*Eﾈｶ$U)ﾖ91階Wﾆ*辮C%j｢V囀*･TeｼｮLP&鵯2Ihdｪ}ﾐ瓶ﾉ3絏 恨ﾉﾜ殆亜ｻw.｣逖ﾈPTﾕvﾗﾝﾉﾛ遇ｾ@蹉{<-璞w#6ﾝﾞ`01e[ﾚﾗ1-ｬｮ` 炎ﾎ､ｬ`ﾘgﾁGｸﾓ"ｰｯ&*LgぽotﾄｻﾜAo<ﾄ講n3Dｶn闘d,"ﾀﾂｸ8_ﾀ琴fｻｱﾇｨﾃｦ1｣Β`僣lｹ瘉\+fｻ{ｮ1ﾗｷﾗ2ｵ蚋Vｵ^w式LAｶQｦJｶ帛惰:ﾜUa閘HFｩt珪ｬT wzXcW柿杣)ﾒ?
T
 cﾓP)ﾓ双bm-ﾁu~yｴｰ陥x,ｴ?JHｦｺ2S%ｵﾛｻ'/Cｭ_R, sｶﾈ#+U*Uｺ祺ｪAkpOKL扛･4PjﾃLzﾈ
ﾈｵ｣｡O&Xiﾝｬ:O錐9Lｼﾁ>ﾀ｡+ｵJ攬ﾔ玖|j ﾇｬ%~縟:ｼ~w縲Uﾉﾚn-GiVﾉEｮx>.gﾈﾓUeｮｮﾌS･Jﾊ7v≫#6姑lTn踏-Yｮ鴛Y'荐R愃ﾍ較貶鴇=Xｷ垓ﾏｼCbｬﾋﾔNｩWp磋W.ﾖV%Obｱｰ5f刳ｫZ^ j]禅ｸ｡T薬F
厥"+VｹMﾞr2/ｾ｣ｵﾙｼﾑ痔ﾄ"j螳&\燠ﾓ(矜ﾘo-m邸暗G1捍&ﾓG$ﾏﾎT
ﾝR<禮wﾟﾒﾊｪ,ﾌDﾒ2ｪ41e.ｰ[Fﾕｯ&_ﾓ‡iｴ､扮vｲ7qx･Io)ｰ涓胼P,-啓t[ﾘjﾆｫPD.顰ﾗﾋﾗ[+$棉ﾍ-｡5n｡N[ﾇﾍ{:ﾂﾁhR｣T｡^Q叭ｾM<ﾂ
*ｨ-ｴﾏA7ﾟ_cｭ鵜O*=轍56ﾋｰ｡|CﾖccZｸ'G?Yﾏ茄w"*ｳ檜ｲｪｶ:;8lYｨ歪ﾍ!ｿq@L滸1
N購Dm者ﾊKiﾁ腓X柢~ﾜ|ﾆ!ﾏ>7秧ﾋ0HP["&ｴ襄%PEo･ﾈ旭闊ヒ牡ｴｪ繙･wSV
ｻｽﾑﾖpﾄ0ﾙ|ﾏF	f~`ﾎ･ﾕA｣ﾇ\&ｫｮﾀE.2汢%ﾖNb<_7'fA^ﾈｽ~ﾎgQﾙ_$]	b+ｱ板鬣#ｽHﾒ4:DOﾑﾊ隆蔡)1ﾚ\yB2ｿ浤g9ｳﾏ仏$ｳﾁ/舵"E{%幟ezﾅ_ｵﾇnｯﾙｯ嵜"/C+捉~IｿBk|=Ｚ.{rH&G喀iWﾞｩ杪ﾒﾚ蹴9ｨﾀ耡ｨPｦ<<@ﾅﾒ禰3ﾆ;@.子CT:@胝sB;膂ｲI蚩ﾐｮ｀V`}7l3リh6婚*唏54譴抂
ｴﾑiｴНe#xﾓz|ｵﾑ2ﾚE+ｩ禦 ｷｦｽ
ｲ墻歃*ﾏ\,､ﾊｽ､g｢=ｽ腐ｴ8Sｴﾈｪﾀ廊ﾒMh紛$鍍ﾚｷｳﾊﾔu'ﾚ?e瓢)\ｴﾎ*ｵ(Sjﾚｿﾐ;64叶V｣ﾔ:ﾍﾁNa+ﾍ&?_ｹ,ｫｨ>Uｪｯｩ､ﾉGh<｡N1ﾅ5u折ﾕ
h]ﾓﾐﾒA嘔E}LJxrﾝKｩйｨｿ躊/fNbi,･lMｮｦ呰ﾕC4kｨﾁ照\ntpc^ ﾍ>LNts社蚤ｪlO(Q%JXｫ醍aPTgPﾔ研(ﾋ5em敷ﾎajｦZ+(eｬ]斟>ｬ5)ｩy#ｧ<ﾂﾞ)X!C縁$諦訂-ﾀﾔﾂﾚ!Z4Dｧ5:騁4ｶ怜ﾑ!Zﾒ7&t4ｪe25ｿi顳ｭTSｾBy}TR枚ﾑRm趨}ﾆ]TﾔGｵwQ^Yﾁﾃ鉱吶9骭>r4門ﾉgﾞ ｭ0?ﾖﾇﾑ列ﾙ|N<孺哀ｼ叙ﾅ|_Iﾋｽ映｡=郁ｿ!ﾎ"*｣ﾋi]ﾘｾ噛駛ﾓ8(F7ﾑ5Yｺ拵･胖5:AwID､ﾞOｽ孛&WP?ﾗﾓQ^Hp
p
r;羌飄ﾐd呂G鮟ﾐ訛>@ﾟ迢餡ｾ鯨ｭ罩ﾑﾘ5ﾙﾔ滬/ﾛｩｫ痃9<必'｣ｦ鉢儡ﾏ!x曩Tｼﾑ鞜｣ルを啾Zﾕ￥ｮnﾅYｭYfmcｮy*諮#^夙椙ｯﾃtf;ご`椅ﾋﾙｵｴ9ｨｵ1o6始lTｩ
｢ﾊﾔ!:ｫQｦM82
S崘i8ﾊVHﾜv偐=ｮΧkan %g'愴S奈%｡xｶ蕋eﾇ陷G鞋Fg儡fﾏCｧﾒ2'艙ﾋ怎ﾔﾑGd<ﾁYV粋d｣笑>ﾕｧ囿6HLｺ､Q,oﾌORIﾌ#wﾚ|ﾘ橸Mﾎ釛鬼ｺIiﾛ@0蟹?ｺiｯ畴ﾀ策
ﾙｧ|yﾐｾ#塩bｴ馮*烱ﾒE烋!莚 ｯﾒ&vﾃｬ Bｸﾖ･pｨｺ.ｪﾀ%s閔廳承kｻ鑛V餾ﾖ-~:Xe;ｹ訊.笙=Kｸ管@ｷ2n誨ｼ7鎭ﾞﾋ*航盥]xｧ TIﾏﾊQ:?a扎
ﾟ)壯ﾎ<<擱Sﾘmaka>ﾁ9ﾂ参ｬｦ｢ﾎ?･ﾐｭ･ﾙRｦﾁ孟&ﾌIﾆ(w;F[ｫ剖ﾕﾕｹｻ饒ﾈｼﾀ
班#晉ﾓ^@cy17ﾛk>0蟷.霽/ｺP~衞ｯ釧ｫ鬼ぉ衰淪H3ﾈﾉ+ x%阪UTﾎｫaｵ整dMｴjF｢襄`ﾏIﾖXw尹ya,ﾗﾇa?a鱗･v吽_nWﾘ夫鋪_mﾗﾘ'Gﾘz｡8I6*盖h"o"7oｦJﾞBsy+敞ﾛﾇﾛi6ﾞIｻy蠹mﾀU脂j/恢k!ﾞuﾝｷ鏨9K<ﾇ署冥､,晧琢吁犲~刃8BeFg只4~ｶｨｯP$ｽ克ﾑgh0め|ｶｵ亟r;ｷﾑ-iｾy8Dｾﾝ[ﾞ6灘f_H殱}ﾑ商=2J8ｿt?6Z唖ﾟC浹ﾍﾖ齠\藁7ｲ所ﾙt"h｡癖ｫ8Lkﾝﾊ1:九ｴy<>H_@]|ANﾙﾋｧ絳蒼.｣!ｾ悚G孜9ﾙﾁyVBq鋸ｸU慂婦必"(`$Kﾐﾐ}y0ﾝﾐｾ%ﾜB"{ﾚg)Y｣ﾜ:D_ﾉ罷qｪ7P)ﾟH廿ﾓﾘﾆ｡'ﾆfｻｩ)Qf	ｷH9Auлﾑm(%ZhJk\ｿ*ﾙﾃL66ｶV嫗7虻|DLﾝD
zｷﾐT2ｼfj膽｡A>Pﾎﾒ`晨q58ｺ塢ﾈ盈ﾝﾞGrR犧ｾf,bV｣|Us､$ﾑo&ﾆ%ｵ｣tGu施，Orﾔﾘ:Tｽwf籀炳
88ﾖ∃@/ｨz\}ｰG覲ｳ"
}嬶ｾ
ﾐ逃ｽ+DGﾉy&sI9ﾅ\,ｼ-ﾎﾝｭ0疸ｸ0閏･ｯﾃｫ蟋^M磴雁煩LKｿ梅鋏
ﾐ絛珀k@7=YﾉZjｷ]耘ｦﾚ=衂Cﾍﾖa麸/qﾑpZGｱp-o
ﾒ}ｼzeﾗfｮ&わﾘﾒ[@ﾙ?PｿM
'lll2?ｴWkﾈﾌ	螂誇_拂ｦ挫ﾌhxG､ﾝﾟﾃZ｡\ﾇfｪlﾞh筒ﾋﾗｫbC&弼ｾﾋｱﾄ餽]#那6'ｫﾍ｡ﾉｹｻｫ鍾Fｺﾇ戡｣.@DﾍｲUXJﾉsXｷmk4<椢ﾌM,ﾇdﾎ =\R{+.ﾜI謾	ｫ[SｴBﾑ僵壺ｱJMTTｪP4嗇8iｮR@摶*ｴF)｡feｵ).ﾚ｡白OOﾝﾊ鷁&R\僖(蚯･2勸U*關筥[秘t2~e而班ﾛﾇ3ﾋ)=ﾇﾒ#ｫxN5X&$clｺﾍ堤ｩ 5得
*椈､_hﾈ､襲ｾX2P甸2ﾊN)羹ｧ罰2繭2薜S｢9I裙ﾞ)ｮ｡ﾙﾊ:h防"6DiN新剤鈎ｨsO)?ｧ!ｹBBGｩC|ｵ疆?山G雁
\讖破&F+m髪廢ﾅﾊfZ､l･ﾊ6ﾚｾWiｺ薨.｡<ﾓ添^C4_wmｯv挾8F
ﾑT怐弼NﾟG蜉疫rｲ,喘"%<ﾀCﾔ)戝eﾌU/PKma5antlr/ToolErrorHandler.classu就Nﾃ0EｿK!P6,3ﾀｦ9@6)ｴ*ｵHｰ$V簇ｱｫ苔ﾂﾕXpUaCUｳﾍｼkｾv8術a pｱ%6#Fmｮｪｵrw7S2Ns(-ｮﾖ齡ﾙЛｩ%龍!_!Ok2U<ﾋ隆p'@｡z}#ﾟ障'Qﾘ胖PKgcuﾗ>PKma5antlr/TreeBlockContext.classePﾋNﾂ@=C･ｵ橿<茖hﾔ`1$jLﾐD%.ﾜ櫓ｵ商ﾄ_\姨H\ﾖ~非ｶﾑｰ鞋ｹ迸{踝|}|ｨcKリ5qd#ｫ ｧ ｯBﾆz0)((*(1$],NmpW\<ﾝx杼`ｱ#ﾋｵﾄ1サﾝｿc深^3$ﾚ麺ｯN練ｳk1ｦ-ｸ堋Cｹﾚ6]a凝F ｨﾝzｿﾇﾏｬP､縱~b{ｽﾇ也
2T0ｦﾋ:4,(cｼN;3ﾜ7ﾇ崢stl｢｢cI|羆:｢>qeｴ#N
ｿｶｽﾍﾍuﾒ<ﾍｳRoh|ym惶犂vﾘ嘲7唐eﾄﾔ-s'･旅砦*j<@=瑾Keｨﾝb峇｡W!xXﾄ#sﾑｨﾈA孺D7[ｴ｣照巳畳>'ﾙOｻ1ﾚ{i
ﾄ'ﾞ}ｰﾏ5ﾉ<$ﾛ髻&ﾋｺ"ｯﾀS7^$+:林ｳvY縟J-^掎n ~/>ｵｽ$餉ｹ､Dﾑ､WtｫQ**ZURﾛｼUｴ@x)QAG.C.vあI流3#ｮﾎ	&0D7iｽtﾗQｺｭB?C	e1Bｨ{0PK韃樊PKma5antlr/TreeParser.class･V]wUﾝﾓｯL&SJﾓ([ｾ$MQPСP(Eｪ･`S(ｱL妬	M&a2
(

* ﾊ禧+雰Aﾝwf囈4]>ﾞ3ｳﾏｹ釛樵~
ﾀJﾜVﾆ蚤ﾈK&紡｢
ｪKL,ｺXFﾄ2ﾃAﾄ=8､eLA5
0ﾄSﾊ4ﾋ0d`ﾉﾈ*8ぅ
斬ﾜ
訛Hﾆ嫦K,2ﾞ,郁'I
ﾟ}ｧd改@ﾆ^j:#罧茎|､ $ｴﾁy	朞ﾞ]==黝4ﾃJ和ﾗﾐ?榴ﾗK睡Lﾝ7u]ﾂ\M%zﾔ刊血､ﾄ衡ﾖ街哘ﾘb&忻jfF7#5S瞬1ﾂﾃJ埼Fｯ網3絃ｯ逅vD'4c4ｱﾌｸ1J浴ｳｦﾁkkｫｵR貂Aｨkｳ	M-ｪoﾑﾓﾖA	Rｷ━失ｷ6J(ｴ鳳ﾑ刳Q\MOﾜﾐ{ｳﾉaﾝﾗｴT碕｣1ﾐ:cぷ(/｡>殉DЙXdbﾝｭ･2ｫ
ﾋ\kﾉ
T&5+ﾊt3)]ﾇ｢L[%ｬ	ZﾂOｦ睿q+｢[鼠MY懸ﾖ警妃,ｨｩGyf1	>SOｧLｫﾋ4Sｦ賈H}z45ﾊR3ｯﾄ詭LOJﾘｫﾍ4h窖贄6ｦﾗVﾍrpｽ択斐ｾ=楹J詔=髪ｹ蒲ｱMﾈﾔガ*>ﾃ鈔蟯WT|/%ﾔ澗ZbL7ﾛ[爼殻闢ｾR5
w1ｲ{J+U僑ｳyx!~JﾌﾜLsｶWtﾅﾂﾇo彫.貮ｹﾟ+a芋ｴ絨I62楹$S甓0e'L<ﾞﾉl%Sﾗ直?鵯郎斡xKp*|Nﾐ]V<ﾁﾙｩﾔ效?X極H98w`卯ｫJKｧu#Vz讎{8MEｿTﾖｾx8ﾆ冤,/Z｢AｽbTゞXm{隨ﾘZﾗﾎ袖wN:Hb8ｹｾﾈｷm(ﾐｼ)eQ~A.怖ｯ篏苑ﾗ9ｨ"ﾟrﾔ zｬ@3UIﾘﾍ.Bし2xﾞｮUｶqﾗNl)ｭ(ｮ瞽ｭ.ｴ卅e"wB沸Uﾅ炯ｮ戍ｼJ1t#ﾕwｲ	hｭ袰侶=D}ﾛ|ｷQﾝT	nﾀﾕγfｵ-(ｿ恕ﾟ脇;u｢∋,･ﾈW"軅7z\m.y舖ﾙ!=ﾙﾗｦﾈ_;;ﾃ馥ｩwN皹_袷9U|E)ｿ銀ｦ須n｣Kｾﾒｮ7ﾑrｨ79ﾅ, C｣0vﾘh叡_s渋ｹ{f>2ｴ0wﾅ4ﾂ}ﾔv黌旒新|?!2佗lﾏﾏ｡M9,(ﾁ1F$h<膨當9ﾒ8LK?K穡,vﾅWﾛ8ﾅcбZxﾁｻ蝴ぱ皓b	祕覓4晋ｺﾌ	csｱ)ﾖ4-{Sｻﾁui,h｢W-ﾔNﾅｿ(ﾅｧ$鯰ﾟ(ﾕ1ﾅO&6馮｣嶷｡さCS}ﾞﾅﾙ@' bﾇ騁AﾐｲﾟﾏLﾙｽ灯ﾙ/3ﾇs綿悳慾8w8gﾅ6F踞&SA"=#Cﾗ汕:'磔ｰ5ﾌ｡\CE*PΝｰLK庇(隈ﾝ/="ｶﾟ:ﾄ:?ｬﾄt`#O迄fｵ啗Zｳ
ﾋﾃ<霰ﾓ.k#ｨkXｶｴｯQｸ筵ﾂKb猖ﾉezx%｢b]ﾈ-WYk!	N^ﾌ嗽粱儺g壗$ｾ僮ｵｦｩkﾄ:gPﾓﾔ
9ｵ擶_評vﾀ`?｢殪ﾙbｷy'脾OН[圍ﾝ｢ｶﾃgｲｻﾁﾊ?PK｣ｼ,ｧｸxPKma5antlr/TreeWalkerGrammar.class}T[Sg~vｳ,渇 ﾚh究$
=T
ｦD&=mﾂ4ｰﾙM7ｻﾖｺﾂ起gzﾃL
3係ｽ鷯ﾛ釡D@;凩ｿ7ﾏ{>|ﾟ
ﾀ4o`&ｋ穂=
k@ﾇｸ.ﾁｬ$s:n爬[誦,`Qﾃ墜okｸ｣aY'ｻ"ｻ剃､GV･ｼ{*ﾖt犬a]爪WQTQR\ﾓnUｷ｡@yｬoｮnﾗｽ
fmｩ匈Lｻ)znﾝｮeｦYnｦ8Vｸt≠諜%慚ﾗmｱ7ﾊﾂ-册笈VｶpM粛(!5;ﾏ*｢鰈ｻ･稍5ｦp,ｳﾕRp61y<рﾁｦTDｫｵ獰ｰ=j'棡廰､%ｼBBﾁ+gGﾘﾙIｯﾟｭ亥ｺﾌxｸ
ｱiZ;ﾂ]qﾍFﾃtｧ･列ｦ8.xM
<4愈ｦﾛ.ﾛ8ﾅｾVш'>ﾁｧ>日溘PF付T[ieｿnm-K*ｶ､ﾘPﾏ【\Rﾐ[5ｭ3孰ｭwれ
ｿ蠻ﾋ".u緕T2Pﾃ齟lcG、ｳｼYV髮&Uｦ疎*ｲ虧fCV}ｴK救ｵ*\YU譛ｳ泅V}ｫzﾜ[ｦzｮﾛﾎ｣m緲;ｱ Hﾝﾉ
[ﾀ4ｺ+祓cｨ;ｹN+ｯa?vﾌ困･んD?2ｶahe恍ﾊgｫvﾊﾛ｢穹"ﾑ}ﾟTﾞ褪ｳ合ｯq浬;ｮga辺K臈C協@螯瞭389ｹlvﾐz架{ﾜ申ﾐoﾉｱmzﾊJ'OZ緜H.移g6崢ﾞR>ﾁ顏裲塲h榠Aｸ,D.<ｹ^~ﾜ"o騒"9伸･ｧ$C/ﾑs`0Az
!ﾒQｨａDｯ*zﾓ	
ﾏH知ﾌt澗ﾈc'ﾈ碓&滝ﾆ)垢ﾑﾞ滾ﾍHｦ貿bﾅo飩豌ｺ1栩#覲3ﾑｾ6ﾔ辷%ﾃ/｡1zdｼ
}cRﾔ%ｮGﾙｮ B喃zS鰯 ﾃｨﾗﾈﾍ`盟,e､款\ﾝﾇ	ﾋ
Iど諌}｡.IRB^A7eﾜwAE*J2Vﾅ@ﾆW2ﾊ2ｾ&ﾟ(ﾐｭ穴━5Dﾇ羞g槃wKｦﾏﾀｶﾆIV4]nK<ﾍﾑ屹ﾝf^1mﾓｿﾋ0郎xﾈ+8MﾎpQ3m^鴈nsｷｮo[$閏d2ﾌfｴW=g騅;W]"Z^ｰe･ｴo=ﾟtlOﾂwIﾃ蠎ﾏﾋｶ鉈ｶﾁｫ-ｹｷPUｷw(臚	jCﾜu隆9ﾋ個ﾏ!屯涅ﾎS前妨+L^ｩ9ﾗ爿ｦHUﾙMﾋ[f*ﾒｸ*｡ｮbU|秀*ﾞﾃ隙M`Vﾂ槙0ﾋp鯑ﾉqﾒ*~ﾄO*ｮc
ﾌ0u[ﾘｾｹﾋ障ﾑﾘwZ-N&兵ｶ杰ﾓmﾓｸ天｡c[※ﾃH飮蜜樟ﾛ｡TFM｣XmTｪF餡ｹN5l髢ﾇUpｴ$ｴU<∨0ﾓnﾔJ甲yｽTｨ7
ZｾVkhﾕ|ｱ\y@>tﾛｷﾜ\P鹽ｴC飃+質黎f_~}窃ｦ.4蹇,狭u+oﾜ ﾉS艘縄ct\塁庠XfA兇hﾇﾛﾜ/8ｶﾏO法微r?ﾓﾛS	3ｴ!9χrﾜ汗KUｱﾓ7C
&鏨iv伏ﾆブ稿ﾊb<ｽ=nS6ﾗﾟｲ#ｳBﾄｲ$Qﾗ｡)ﾅGuXs=ﾏnﾎ罹0辰2ﾉ鰔|保ｶ胄ゐs勃W體7Mﾊ(bG陝"v駒a0ｱwt^｣ﾗｺﾝCﾙCｰ?ﾃ!D\,"鐵ｺ霎vп.ｵ辷柴?/fｻ:ﾈa@ﾎ7AH腺ﾞ)b碇･_感c､擒0&1G礦ﾉk｡ﾗtLﾄrォ胡◎Lｱﾎ#畿ｲｽar･}7Hｱ#絃┝河C\H]"I'ｻ=DcD&S"葱!-｢ﾉ此ｦL]Z<ﾄX巴(謇"C蜴Kﾞt@.ﾊﾄR罠花ﾞ鰾2q辿!ﾑT汕棲捺ﾌPDｩb"bQb刳ｧ郭П鐇PK笵lﾊﾉ-PKma5antlr/Version.class]尻Oﾂ@ﾏ､･ﾁｷHt&班B7$ｮ.0ﾝ喨兪I6衞ﾄ?ﾀeｼﾅﾄﾅ慘w2ﾞs鈬ゴE80pH02IォvF3ｱ抉ｨigｬ邸Mｯ	ﾕa､R-牌E露G+ﾍｼ"
觜h9*｡%ﾌcﾇЩ廛3鴉ｧｿB&P∪%-猶FﾉOG£ﾙﾜ橡｣Bvｬq%ｾｼrｰﾝNﾒF
uﾇｹﾂ､nP_-瑯c	ﾔ3濘nｪﾝｵｻ=ﾞｴ愧ys蠏pｰJｬ陶ﾙ\
ｳ7ﾗﾘfｮｮﾟ(祥ｺﾍﾎﾙ馳ﾎ+閻/ｵｼ4峡ｻﾋｲｽ/PK莅ﾎ'ｯPKma5antlr/WildcardElement.classuT[OQｽlｻ]n號｡ﾜ啄ﾅbｬｮｾ@4<陦ﾔnwﾉｺ倩ｯﾂJﾔﾄGQﾆ9ｻ[Сﾒdﾎﾌ7撕33ﾛ?Pﾀ[Iﾌｩ佗8ｱ GY9茹yG嚆街吾ｮ{*ｸ/ﾅﾊQE$ﾛD?S%/(k2径<`･髞ｬｱ箔愚ｨ諮Lc"]蔗耽?Al,ﾚIc$'鬲>i(ﾍ賽ｴﾗ3沿9}Qﾏnｿ乃
YﾒoLDbZｮ穎禍卓!ﾑ､蟒腴ﾘI[ｳfIﾎﾑ?ﾘ<｡3dwaPKｩ}4PKma5antlr/ZeroOrMoreBlock.classuRnﾓ0=nｷｦMﾓ抹^ｶ士ｰKﾓｲrｿuBbｦJ"mﾁ?oﾚﾐ4ｩ｢Oﾒﾔ
靭
9I走m廻ﾙ>>ﾇﾇ:ﾀｶUｰ"ﾋjyｬepWTｬcCﾎｮfq
ﾗlｪHC流ｺi4膵WﾐTp!ｵm9┌ｨ巖mｯｵ瘰{[ｹgnW0Lﾋｯﾆﾃ硼寳ｵ8;ZｻﾒtO8ﾂ>蒼zp弥ｺ釣ｩGdﾞｼﾛ&ｺ槫$｣n~茵xﾋ覩ｯ｢ﾄPﾜｱw(^XﾒｿAxk･ﾛ=lI≧X是､Q>-75ﾜﾂmw4ﾜﾅ=
@ﾁC
Uｮ*#ｫX卦嫖"w
｡*ｵl墜ｷﾂTpUzW捉YU!~褐1:AｶｨQ ｯP]ｦ1゜PKﾊY')PKma5!antlr/ASdebug/ASDebugStream.class舞KOﾂPﾏm*蝪tkAqｩ#!ｩｲ(qﾟ筵)ﾂmR虞ｯ/petat2N-峅ｱ漁{Oﾏ:冬~ｽｾh｡哥
Z蛎))(+ｨ0､讃'ｲﾞｸfH忝7廣5\ﾁｯfS廐ﾋ梵痴xp.ﾗ0黽%ｉﾟxｷ\ﾏｭiｧa遣{ｫ=ｱﾓ&ﾉN'JG｣;ﾄﾈc隶Jﾝｺ
ｷgN､.ﾄL巫ﾌ7M喩｡/BｵﾂｲPｰﾆP峻z1clf妥C-n勾ﾋｭi沈rﾗｯEp$咀唾ﾂ勦ｮﾓm:｣柩>=ﾑ〃ｦ奧ﾓdﾉ ｻｰR葎李｡6ﾟ!{/詬ﾕ摺ｪﾒ7
ﾕPD俄9l,0G束W"L>ﾄ\'!ｭ澣唄#N(;F%MBPK"､ｦaqPKma5"antlr/ASdebug/IASDebugStream.classU錆
ﾂ@DｫﾅあK人d%ｨd1^`ﾔﾎ'Gl.<'D餉ﾓ秀u}ｾｯ73Sﾂ\ｱﾙi填|爰!ｬ\/ﾎ蕕ﾔ*ｦﾊｴ
-Iﾓ姨ｧ%ﾁwcｩMQﾂ:ﾗF戍xW
m}0蠖:>+于6b[6溷ﾕｯﾖﾝ鍵CXｴｵ団ﾎ'3"zｨｧ7 1bd	ﾁｩ9ﾆ?PK渤YｲｰPKma5#antlr/ASdebug/TokenOffsetInfo.class]衆Kﾃ@ﾅﾟ6l囹､F=ｨﾁC佞s*ｈB@｡･g吐ｷﾆ
ﾄﾄO薤h<P$U^ﾞﾌ=跿ﾀ&4ｸ]ｨ4ｲcﾀ3ｰﾋﾐ及&$M毋ﾅﾀB=2ｫ駲&､ｨﾎｴa取麁叢FH~[?ﾆｼ廢qN+耻畢~)ﾊpDsZﾔ蛯_区7+OL(ﾓbｼ捲#]YﾐaXﾘっpﾉ*/ルiﾂ:y愴苟ﾌIｼ芫Mﾖﾇt詮gv64zｹ
ｰ0
1I{ﾔ抒ｯPｵ70`克ｸJ#:Ｕ@ OｺM6嶽｡M溲pﾒﾋ_層薇M^ﾜzｻH6ﾚPKV3ｲﾖ~PKma5antlr/build/ANTLR$1.classmQ]/A=｣ｵｫkiｵﾔWPmI礼灰DｲAT(ﾃｱZ@ﾘ1g醂	>Z#"NP競惧fx髪g|xgg2ﾄ	n･0L0L2彡PｹﾒW?ﾏ蝉ﾒ&Ba%ﾒ<ﾁ`0禄ﾏ窩aZﾄﾚ遏fx"ﾟ^bx貰9^"ﾃ,ﾃK^fx甼ﾗ^gx甌o悦[躯ｩｴ啜ﾒﾈTt:JFｵﾉPﾘ2Tmrq*j熊Sｷ｡ｯiﾄ*ｩ7椣ｦW5ﾕﾚ)ﾀ'｣!=Aｶ#ｪｦ掲R1ﾅ業稚"N*悶ｷ)ﾐQﾍ'鵬	K#QﾍJ!埼zr"`ｃ6ﾇ｣I518:6rl/VﾕﾛO赳ﾂzﾆ+Uﾆg9
?ｰ諭ﾙAﾛ>楼ﾘ)?ﾞﾅ{Ju8?vソ{lo~呉逗e蝪ﾉLLpW気Nﾇﾓ､WpPﾄ~ﾌ*e-'ｵ	e"8)-w6閥｡ﾇﾓﾔ旅ﾅ-Uﾗﾌ図ｹﾃpqK8朦幽W訪ﾍsQ｣ｨ猊 PE蝙,@!ｪcｨ3旅術'cJ3彦三Oﾈ~	a､OFMSﾟF､!栞ｮN6ﾗ	A;b鑛ﾅｰf蔗ｬP&舮ｮ亟ｦ[ｲ､jRｦ?蝟殯ﾋFYu$Q哄R閏ｺ1Cｧ･
`d ﾃ圜C暫r漲ｾ0Tｼ#哢+ぇﾋ1ﾜN知'2ez基929\ﾙﾌﾄ頸'嘩躙?殼F	J)ｫﾚｼ+ｨｽｸ0.ﾖI ｵcyｧ測ｭ"`IEﾙ魴WvJｾﾋ:`ﾗ的ﾅQcW怛ﾔT:)ﾎ$嚢 ,rｸﾁp姉(漕Rｪ/ )鯆%矣ﾏﾘgLKIﾑ4Yﾍ$`[rｸT杁戞^^2孝Pwﾎﾃ&;f鴿4拍!{6U:輳5ﾟｶyｻﾑM{脊頸(ﾁRｧ嘴犠ｾlｳd{s'ﾉX@Oｲﾜφh默jﾌ蒔ﾓ{iﾚ9Vﾑ掠淦nRﾑ､]-ﾙｺ;ｷﾒpﾕK/(ﾑ}ﾄB
茂9Rﾍ-ｸｾ6\堤ｼﾖ{Q'*捜`9ﾑfﾔcｵ蝉譛q;sI箙#ｯ}ﾔFt;械/\ｶｫｿ;ｻｲ`ﾗ狎ﾙuｵ9靹,$?,eｱｸLPｿ摺a!ﾁ着ﾒBとぢ5ﾐzMwｯ紂Aﾃﾅ5ﾉ)/+nｰｷMｭ9ｳﾜq2ﾚﾕ摘l昨ｿsﾅDbﾑU`XMuYGｴ晝ｷ桎ｹ殖.｣逃SｾA7~C_託#"K9ｼTﾈ!ﾇｸDu+u銜J-褞Zﾁﾕ挾ls｢ﾛRPｯ絹ﾍ示ｭh5｢X~ｶﾙ訝L	ｰ叡ﾚLｻ^4a+ｶcﾚv雍f(ﾂ欽｣nﾕﾍﾁ0q^ｲ軟ｼ壌ﾆｬ糊~｢臾X同唆ｪmuﾍﾗ
R[ｻﾚｺRｵ;h襲庄ﾏ"0ﾚsｬ鉋V%Vﾎﾞ鑼､ｰﾏﾝﾎ｢ｫﾏﾓｹﾚfﾏBｺKｹoﾒ5皆｢{(!Jﾙ>鬻ﾓ{:@:>* 放,･*Jﾂｸ@ﾍqﾇq'N礙Dpｧ;NS{!｣Gmﾘ喉wH=)o｣U
ﾑKnх".iC8笆6#iS8笊6#｢ｴ%aRo8ﾒ熾ｶ･mD匐拮ｭﾔｾ恨9 ﾂCｷ淅ｨ｣1r佩jp3ｴHｳﾝﾆPKWｧ/ｧPKma5antlr/build/StreamScarfer.classmR[oQ.lｷ薹Zｪ｢｢rGｭw睡MH(劫倨ﾛｧu+ﾝﾅｮﾑ泙&窺|バｾ[ｬs･R6ﾙﾙｳﾍﾌ7ﾟﾌﾛwYeﾂ5aﾖﾙ晴)ﾃ惚nﾉ壬[从	I､d､&+!'cw$ﾜ頻消｡3ﾋ5ｧｹ釣ｱｭｪer(ﾏ犂>u8CpｷU G丿1ﾃhLﾕｭｶ冖ﾘZｻ吻聡ｰｹえkV贈欹rｽﾋUｯ峨ｹﾑ"~_Yﾓyﾅ>jpｳｦ6ﾚ舍垳N6.ゆｪa娥R@pﾄPmｪ>7ｳGAQA,!ｬ`+ｫ3ﾚ緞魚"~蟻oﾀｶｽO･xkむWI豎ﾕ2lKﾂ#杖DﾂS	@Ccﾘ}ｱﾉ;貿
!Jﾕﾗ12巓[BZ胎S磴hﾔﾟﾐybhKﾄｬｧ}､ｿｷﾕｶｸ
ｻ垢ﾞｴ73ｽ｣ｩﾐqqﾑ7I艮C>jXmｾｫ冕#Fw5@ｷﾘI/ｭ筍ｭｿｴｲz#Xﾃ:鞜%bｰdｪG2ﾝ3咎ﾁuB~ｫﾃL7ﾙ浬>ｲ~ｪ ｢絆_STﾚ;ｻ檣
ﾇs藉HﾔVI皴Wﾎ&ﾌy滲>?c対ｮLJﾗｸﾐ=ﾙｧ懋ﾃwB@	e毒<ﾙ0ﾄe頭R#M[ﾔI:*aΔﾗｰブｼﾂ&e]*ｿPKｿ柾RPKma5antlr/build/Tool.class昂[ﾗ~ｽﾌ0LAﾖb#ｮvhl｢u5F$ﾚﾒﾂJ$+1ﾍｰ0ｺﾌ拙Y汎&ｩ垳I圖ﾍｽｶ肯ﾛ､腰d｡｡喊5Mｷﾟｷ驅f累
ｬIyﾌ懶|ﾗｻ戍狒^ﾐｪhﾂ2t#*ｪ審眦ｨ姦0ｪQ1*&`Vs9｡爨4&X2l慕Xｦ< 梹\Yﾓ*ZqJﾆi
か3byPp<､煬`ｲ欠宏<*_ｮ恤qNﾅy<ｦ爿*ｾｯ挙ﾇ-鉾d|Sﾅｷｬ{T憙<ｯ`Hl^ｼ$綟ｻDHｻmｱ\栴ﾟU=ｯﾈｸｨ.
ｾ/?aPﾁｫ
^Sｱ?単eg$йN勒zGZｷﾆ;]ﾇｴﾆHX憂儉ｳnｹiｧy$kｦGl;-｡ｾ現K聖ｺﾆr'ﾗLI5-ﾓﾝ'ﾁﾗﾒzTちﾋ5$ﾔ桝ﾈNﾎ>&ﾅ?ｩｴｯ4/)ﾃｳ扞	ﾛ[VrT	ff2ｮA揃DCﾀ季0ｺ｣vﾖﾍｿ)ｮ6淦ｴ=.!ﾑ&朦Sｮi[yｫyｨ$lｫdｵ\jｿ掎Rﾆ!S澑-`mL~後ﾂﾋｶ{ﾈﾎZ｣E｣哽,	ﾛcｺﾛﾋ3(4ﾌ竰冠Wﾃg9jgﾚ-}ﾒ栴
?ﾅﾞﾀﾏ$lﾍfq#Y
{ｴ{駭~伐(肅ﾞﾄ ｳ_ﾎﾑ9"a膝hBJﾃ3	吐&CﾂﾔTﾘv
ｺ4$1(羇9\族ｺｪｴr3ﾞﾂﾛｬ泌ﾘﾈ詩4ﾌ笈~k,;慄ｦ&ﾙｴ參ﾆｰｰ:ﾌ2\ｭn|~)ごｸ5ﾜ九~『yX9ﾙ湟F-縢~壌"ﾁ74ｼ/ﾞ RHRｺeﾙnﾘ8m､ﾂﾜzﾖLｻCT怕?	ｨ桑K瑪pｺｭi=m紙ﾇ}rRwﾂc窮ｪ｣ﾍ&U秬ﾍ;圈Umｶｿ牘&
,ｴ\｡ｪFｸ勃y愡;At^Im繙ﾛkdD]2-ｭ墓S9ｅｦｯ｡X歡snｸ3n惑,jyｿｶg	>ﾒﾝ<ﾘ{ﾊ *#吟$vi６棟|ﾐ5ﾓ"ｯ)椽Fｷ敏u+ex?5%ｦe73dｺ7`ﾇ8kX^5*!熔*W\{ｩﾐｪﾓｶ>鷆?ﾟ=､ﾝ	Wﾐ8ｼbz保p験4}ﾈk峯7;｣罔5m歸>wｷｬ~x%ｩ"D%ﾚ速蝴KﾅRﾜｬPｱﾈ脚寅Rｲ)#ｱ|R7｣+]:9W%ﾔﾒ)o/Lﾃ団｢ﾙｬｩlｩﾀｶT<ｨp,ｳﾞ#,碧"ﾊ%zJ7yq8ﾞEﾜ抂u溥ﾏVｽKｷl泣*ﾝｧ汲ﾓFφ3絲xERZｦ毆mﾖM蟒AOp狙ﾟRｱ〇獣3ｿqｶsｬ
頂引ｦ茜ﾋﾝ ~5|-ﾅ5ﾁﾝ.X僭0"ｽ9RPﾍ9%ぁ\wwpｿ苫>|ｱ$ﾉﾏ<ﾁｱ-rﾍﾚｨ｡ｴｹﾐ'z"ｾｽ卿Mﾎ｣.ﾑ榊ｰｪ､v=v#8}ﾞ:ﾜIﾕｰOMﾘ叔t駐w[ﾞ荊ｲ'鑾ﾈｱP#｡BsRB棋･x ｺﾕﾀ,｣｡ｵ9ｬｻ
吃bﾛ?
d"ｲDｿ･Do豌qMqｹ筰ﾌﾓｶP7燹k櫛ｯ｢)鮟M7P
/`s-l哘数ｶﾄﾆ匕&}嚊鸛Qｶe辷a6"ﾌ/ﾅ-ﾆ}|曚指笞\Lｩﾂ､ﾖ2･uLh=Sｹﾉl ﾇF^｢a訶ﾅ `z┬$迯88ﾋﾝ9顰IQｵ渋脛LZT>｣A`pkoнn孫!Z跫羶ｳ薤ｳｷ 小敘｣;If7宝l_ﾄ]<ﾞ殄+獰IﾜbﾘｫX巍w@脣$ｩO1ﾗOｳ-榱艀愉}皿帛Ef%x%害5SｲJｴtEE+娟隸0ｻIｹｧ嫡ZI禧JｼFJｲ(ｱ+N6Pb)ｻﾋ｣^｡c査DﾊｱJ:ｺ釦HｯSﾇﾃ旄矼sM鰯$C%Uｵ楝婬u-3ﾇ問'ﾕ'<頤.".,ﾂ陸&<y瀞ﾏか*	zｽ0Y%6利ｻ_PK7ｭwﾔPKma5antlr/collections/AST.class}苔N1ｧ橿(x>瓊z#ﾀ1嚼5』畩♀ﾕﾒﾕnﾗｨ乗澆ｧﾝa濠ﾅ~ｧgｦﾓ訟78 {9ﾘg千斟控KA挂ｫL･*%ﾚV:ｪ5墸ガYs郤bPH\uYS_竄+ｹJ
M#Djp"5莪･)\U,48~｢缺0ﾜ*薨ｻﾂ曷Yｺm9#;伍3dｲ･､bWhbﾁ,ｻ蜿ｼ｢ｸVﾖ烝ﾏxｩ矜冶ｺﾔｨGquｪｸｧﾌｸｼqｯ%ﾌｵoﾃ､粍G;ｿ{ﾉ8壯斷>T言_ｩl;ｷ=ﾎｾLPs⊂
杜e惓LｯﾐcﾓｧR｡ﾈ聢]ｬ4pｨﾘWﾖ-ne0387ﾈ G #謇｣ﾄqﾆ=尭LxNｧ`ﾚsf=辷ﾄ"秤竰2*ｬyｮﾃ&裃"n;竝v?ｻ蘖KﾚｫjPKma5&antlr/collections/ASTEnumeration.classmﾎｿ0ﾇﾟ!｢ラ筒#,tﾏ[ｭ坑j0>寃澆ﾛﾍﾁ[.誑ﾉｽ?ﾏ｣)ar褊ﾎXｹ7gﾙY^-/и撲ｹ覇ﾂ(%EWﾝｲUy\ﾒﾒVﾈMｭ愡ｶﾖMZMﾑ;',ﾞ8ﾂﾔKｦｸｾｰﾃｩq*"	BBﾀ!"WｱHｾPK頁ﾃdﾋPKma5"antlr/collections/Enumerator.class]鎖
ﾂ0ﾄﾟｯhtpﾚ･yg7ｷΖﾄﾒｴl>%ｦ ﾞp7ﾜｻﾗﾐ`ﾎP2ﾌ}痙ｧPK4ｲﾇﾍ%PKma5&antlr/debug/DebuggingCharScanner.class晃y`斗v届萓ﾈﾍ&獅ﾈU!IﾝL^6CXﾘｮ転ｪｽｩhﾅ嬲AｩｵX｣B-TﾘTQｱﾔｫZｭｶjｫｶjｵV{ﾟ恋ｾ厠Nv尸ｽﾟ{ﾟﾞﾞｷOﾀﾃD4SｪrﾓｹｴﾟEﾟpSﾝ砲k陋,ngｷXwﾅ,ｾﾍ祚ﾃ,bq7宮ﾜ@tﾑ!}5ｲ貊Lt8社Xw競,竺圧a}ｶｻ淒n:Nｺ!&:ﾈcﾛ	条\(?cﾇﾝ昜ｱｲIOｹ韜lzﾆMﾍｬ宀Dﾏﾛ.1嵜ﾀ/ｲ$ｿе/ﾛﾋ,~ﾊ?耜WXｼﾊｺﾗX~ﾁ+z?ﾟ`&祇ｲ狭Xｼﾍｿf.隅~{渝~ﾋoﾛｼﾔﾟｹ顆.ル(QqDﾑTｭmｻ革ﾇ"族物ﾁｧ┐Aｭ･WﾝkY3ﾆb船yﾂﾑ<ﾞU%6J肇ﾅＫｧﾒｯHTrｾoｫｲ]i	*｡ｾ矢ｨ%ｨk4ｵﾗ0r.ﾑ･府ﾛC噌tylfU[ﾔｸN"Gｫ`/Bjgｬ頭(宸ﾐ4"|齔ｪuoQﾀ*ﾀﾝQ%ｪ
lｱﾒﾛﾛ｡(}ｪ/0UCｪ埋ﾓﾗf7q晝 Oi教\p^%`4[凾*7QJﾔｿ%搨喘cﾁ┨ｩ｡S澳lｾnｵｦ?&猊%Xｼｩ,ｶ魔ｫ婿v┐?=Y套ﾌﾖTｰくGSIuｩ)｣胄Cｱ~$HｦｿﾝmC~5
@亨ﾝﾐﾔｶPTﾕｺb廚Y樢v6着~(ﾕﾕu9f｡mﾛ描ﾏ^､-p択5ﾂrﾌ*V* ﾛﾕｦFjぉﾞf<踟ｫj/[蔕ｩﾂ)>/冨ﾚﾓ擡|Xu'b_ｸ'ﾜTﾕ(Iﾇｻｿ3|ﾋpｴﾀﾖ
ﾛ~e*ﾒ;ﾎ,4猥迪cVﾞｪI｣アﾕ/6ｶ%ﾐ	ｶ,ﾀｨB冏ｬ流ﾏ\拌TｷxａCｫ wﾔﾁ N4ｵ?ｼ]sz
侖Yｪｭｧｯ2Ym9^)c魅Sｯ渚s,客朕D7ｱdpｮｦrmﾓｴｰ牟ｱ#jo+J劔ｴbﾛtﾈzEa'EMｮｼﾏFｶﾊ6>aD`ﾗ"ﾜﾝ癢觚W8ｹ+M棹ﾛｯ獰L有驂d･洒$S7ﾈｴ蒙蹙2]L泱I｡M2ｩW&6ﾋﾔG[d
ﾐV匕QPｦ~
ﾉ"\ﾐgG5U7+S"2"ﾓ鉅2譴ｿﾋｧLKｦ([ｦAｶbｱηz:Oｦ
t梛#ﾓ	ｮK$a;z-ﾁｱK夥4 ﾓ苓ﾋ2､ｯﾈ}ﾌ%lｼxﾈht,eH.ﾉ!KY駐ｱ+ｹxﾌzlM}ｽ姜DｼWｻ\Rｶ,薊nYﾊ$ｬﾛIｻ2)eｺﾞIZカ'ﾆﾕ3_:ﾚ淫戊#｣凖ﾄｭｺﾞUｭ4ｼ^ﾖﾙ肭Jﾎ
x\a3o｣a]*蹣[轆ﾚOQ班｢ЮV5|ｪ｡ｾﾑ(xo禰D
｡U｣渋1ｽ/OSﾅ46ｦｲｹ｡｢A$･ﾐ4ｧ*>UxZmfr｡]D冉4cﾊｮ蔗"Pわ宸ｫ鑼xﾑ囲_Vﾐ.d苗ｼﾜex86漆ﾜr悁7ﾏ｡ｨ]-Ke尺Tﾚ-s 智垠~ｧCﾃaﾊきXﾅQ鎰ﾓﾔ､5樋hs>族'V早7｢ﾎF[9ｺ嚆X痰ﾆﾎ*<7睨x6
<ﾝｹt3ｱ+ﾚ諫Zﾏｭh
ｷYVw桶8-ｱ?cﾜﾌX0ﾕ{jfﾜdﾆｻ｣w礬
ﾃﾛｻPF｡;d
	ｯ{ｾﾍﾈ一:S怎0B吉ﾄiﾊ,惧YﾘBﾓI{ﾜxZ%F8ﾑ%觝q/ｴﾑ]餐l｣｡･etﾛGｽﾟｲ悪ﾌﾒ2ﾋ(|hWKEﾕ欣'縟矛ﾇbD@Ｗｷ硬匏Y曄V?ﾍﾕｶ7貞Vﾈ｣<ﾍ5ｶ7歎+	@NBsｭ硬$ OAs晨墾ﾍ
y身｡ｹﾞFｲﾒ
y千｡ｹﾁFrｶ /Bs｣硬 /Cｳｾf@f酢ﾒﾎSﾖ仞ﾜｫｸyｼ&ｰｻlｰ0ﾖgﾅｾﾀｾ	MｶﾘﾆvZｱo6ｰ@{3}ﾝﾀzMlh繍ｹk}ｸﾙkfp･ｰﾀ/aｪ7憐ﾑC冉&_meﾙ!4ｷ;ｸPK,>ﾎ
=PKma5&antlr/debug/DebuggingInputBuffer.class拘]OG=]ｹ]jBﾈｰm&ﾒﾄ!)狛､!間ｼTk<ｸ巓kｴ^ﾓだ｡Hﾅ瓢ｩ殉闖ｪzx-Hy匯s迸sｹw赱ﾀ:^ｦ1ﾛ)LY$p7
ﾛr(慣#ｻ	ﾜKﾜ々%ｱ慣'ﾖ#ｱﾋﾅ:'	
ﾄｫ撻#,ｻ~ﾘ
q'|旱fｽqD瓣鋩ｸ未坎v黹ｨﾁ02､t@･US跨LX|/ﾜ50綵尋ｫ､ιﾊ椡柧啅ｼtｫ
zfﾜZm ｸｵC薔ﾗ暝6F'[~ｻﾓ$馴錺G^｣ﾁﾍﾙ祐zｧCuz牽ｺ
/睿筏Z~缺ｸN5
ｯﾔaﾘ巽eｼﾃｾPSjﾒkWﾜU3+ﾟ%*qkﾒｩc
ﾌｪﾙ:Qﾊ鶉ﾏ'ﾚnｫpﾝr^Z杳P=､7sｾｪu)ﾔﾆ%\ｷ妥ｼ杭|l獺N@sﾄﾆ\ｵ)ﾖ勁,}aﾜ諍ﾋl\$Oﾌﾆ卜8Xｵqk6槭lﾘx!崢ｶ%ﾖ
,s胥<ﾓNo
ﾗｯ朸ﾟpzﾄ#/P･ｷcｶ恍8聹8%=熙8*z
i1_>S4`"&擇陜縅ﾃ`cｸ^讖ﾄ缺ﾋ#o!棒;ﾖｷt骨!~ﾊk贋:ｮ｣d青ｭ,ｩﾇyﾋFК､ﾂTwﾄﾗｺH疂}1$ｦ鐶ｳ#ﾈw巖Wｲ畿｢Lｫ掬X9t第!ﾌu9%ﾌ､1ﾖﾐ#^@BWgRｲMﾑYJ枡e半Lﾑﾌ的3Igﾗｷﾀ.c胞ｿ､;*]舅pOJ-]|ﾛ96ｮWｸ豎E_瓦GDﾀｯC｡"ﾆy 1%Gｯp褫4ﾜ｣RSｭｧ!ｹﾓk-eﾍﾓ16ﾟ'丐ｰｪ兎决札ｬ｣"ｶ｢ﾖL簡｣誌鋺l｣:{ｴIｶ-z7ﾏGｿ盖ｧ70ｾ箇!M狩ﾇw嫂｢ｽ｡ﾇ#Q轍ｩa&ｿﾋ葩~ﾏ#ﾕﾏ鋩ｺﾃ僚KﾏMnPKu‰v､PKma5!antlr/debug/DebuggingParser.class;oﾗ>=.vvNFﾔ帳ﾒ弋ｿﾄﾜTFQ
OM洳ﾄｲD愼ｼt熬｢ﾌｼtkF>ｪ獪ﾜ｢ﾔBｮ珱ﾒ｢腟ｷﾌ Gﾄ%5ｩ4=ｨ4 ｱｨ8ｵHd#フb^IN掻
HRM	#ﾂ､ｬﾔ6FF&`bad`f`a`ﾒｬ (ﾃg`PKBzﾂPKma5antlr/debug/Event.classm析NﾂPﾏmK+･( D]闃氛>ﾆ采т錚ﾂｾRR求牝wrc祕篦｡県ｷDeﾑ匯ｧﾟ劔{ﾟﾞ_^ﾐｴ舛ﾕ〇棕naﾇBCﾀoo､佗Aﾄ'ｵﾖ`豁<7｢ｩ{鰕8>j省榻'dﾋ ﾉｵ/Cﾏｩﾔﾗｩﾃ毀xｨ隴6GXﾋｯｳﾑR@楪ﾈｹｰｯ賈b,ﾏΧ･}ｶ嘆ﾜKﾛ:ﾘ@ﾞALX/甘;掻2uﾇ旌I剪maｮ9>奔Y藕ｳ｣ﾍﾓ!u裁t!Y`ｴ伏ｾYAﾎ'ﾟ･ｮ3ﾟﾙ{c*ｩ_E哽ﾋT峡2>ｳHﾇwﾟ}[L%Vzvﾚ}wｧ*ﾛﾗ波
k搆o塵RﾙbｭaPKCPKma5antlr/debug/GuessingEvent.classm醒Nﾂ@mKm)"`｢^JIhｼ5$D-l囃Zhy*/&*ﾀ2ﾎ6姶ﾙ叨ofｻ殪z8ﾔ｡｡.ﾂ~*｢:ﾐｩjjhih3艫煩軋0ｰ>ホﾆarﾎPｵo盪ｭ?皀莇3dP.ｦcﾎP1ｿI|>ｻHC_8劇'ﾗ!ｲﾝ｡1ﾆ|)v&,za憚ﾏ~7Mg#~ﾖｷ蚌ﾁ网'ﾆ厰aP4賎ﾁD哩2,'ﾑﾌs?
ﾜ_N觝ﾆ#z喉舉ﾊQMﾝ)垓;&.QV晟)SPﾔ3'u!ﾓWﾈ壞m-!mg)awehSfbｬq-W3X､E.ﾍﾈﾛｭﾋt脚{+}虜ｸ吟4猶慓+r?ｦbvT%Sﾔ鰻i/｡PK~A+耽FPKma5$antlr/debug/InputBufferAdapter.class摂Jﾃ@@gz郷ﾟ-ETｦ>4ｵ(ﾟ7ﾍｴnm7e屯Iﾁ｣ﾄI-6%9統恙變ﾇ釡;t｡父$ﾔ
hﾐ4`!s"峰OｩｾBﾙ抽ｮ儁z )g辞鏃hOｪ1ﾂﾎ%?ﾕｦCv06Z驂Aﾊ?嶽､Y0宅ｻﾊfﾜｻ舐ｭｬ拒BｫﾇcDﾎWB?!T#;z面A044yｹ{7ﾐCｺ雪ﾄｭﾈ=Gﾌ}ﾒﾝ厩､!Σｷa囎咳	es*ﾔﾘｼｱ'47ﾔXﾒI鮮u ﾁ5ｲ
旨ﾓ獗.G苻>z|-f;ﾉﾌBn･ｶIﾆ_-ﾋﾌC!N+1虞Z拑陥ﾌrｼﾖdV~ｶｽ裳bV=j_PKﾇｸｵｴ?PKma5"antlr/debug/InputBufferEvent.classuSkSa~^ｮ+ｭｷMｼ$j B望ｳpﾅ"Sﾔｦiｰﾈ.,ﾎW}颪ﾍﾎﾔL?ﾕtﾎBﾉ ~ﾘsﾞｼ逵9酩/1{0G恵ｹ焼c	ﾆV{ﾂbﾕ懇Hx&!ﾉz喉Uﾂｺ7|.i6^Jﾘd捍cﾋ混8､O,W*ｵc]+$O+
ﾃ$4-澤ｷｳｹｭ如ｿZ1ｦfZｹ｡ﾛ!l$氛c+ｹｻﾉg它k7:拆gﾋNﾖJﾉ(勠ﾞP襯;ﾓ稙ﾍ(ﾆｷ'｡PｨZ)錺 S2l4ｯﾗｴ|剞i5ﾍ1｢nｪﾇZMﾀ
{Lwtﾅ%ﾔｹ:B*ﾇ*ｾ諮聞情ｬD<ﾔ~L2+9ｳV2#｡pｧ*載｡ｾQbﾚﾞｴQm鰐坤#ｽ:ﾓ
3ﾆ2f1'.ﾉﾇъｱｹ(ﾓｨ2`Q`ｴ;w+ﾇnsyバeｼﾂ詞],ｨ｢Aｪ&東eD0ﾏ9啼TFl託Nﾆi槫Zｼﾅx7mzｰｺ慌Sｩ%.ｭZﾕ高@4tｹ夕ﾔﾊ喇ﾍmC兵茱a\逎q\u)Z1Z.}ﾔJ^E&ﾉ	Ixq南ﾉ;HT=ML}ﾁc"y寳iﾂlNd筬ｵ!雁nﾇ ｰ#ﾗﾑ"nv恭奈'ﾆﾔ
､搗oｰ箚@?I喊WGｷ､ﾅ#~ｩﾟwﾘｻ+&&3､iz;ｺgﾉ4pﾛ英鬘茨戉hﾂ}ｩXa褐P幌R!ｗｯ拌20蝓窃悒O4q-ﾒ辻	Ne61､ｷﾎJﾗ:7ﾒﾕﾉﾖ8PKEZ>ﾖJPKma5)antlr/debug/InputBufferEventSupport.classVkSSW]<.щB$Qhｭ!綣VﾅAｱﾘｸ`4$鯱
>ﾚhg:ﾓ2SﾃXgｪ｣3:ﾓ湲Omﾗｾ7$iﾋL9{毳ﾖﾙgｵﾏ蜿ｿﾀ漓*ﾆ=hﾀD犂IS*ｮx")筱8L{hｾｦ簽fhq]ﾄg">W/="ﾙ2ﾞ阻ﾄｬ茎ｴa^t"Uﾜﾈt3ｺq[fwﾄ弉ｱ､"ｫﾀ]ﾈ9]7q;ｵ怺fRﾙﾅ顏m}ﾎTﾐ榻諡貉篦Ｏ$ﾒSﾏ鵲｡禺4ﾓ呵4=s}[k|廉ｬｩ`g"53Ft^-.F縉ﾜ｣ﾆﾆ鉄Wﾇ(q-ｱ\ｶ`rﾋt*Sﾔﾌ4$dｦ(p
M写ｼ‖O_'ﾏ区v*扨岌Boﾑ;ﾍｭｱﾜ<ｸ5対ﾉ簫ｬn\Iﾍfhｧ跚肭ｨ`ohｳﾘﾗ|,琥ｴ｡Kﾘﾅ%｢9C116衛-｡ﾖv檪tﾁSqfb^融r妓bH+給｡Qc)緕ｯM黔ﾓﾙyﾛusyD{ｨw｣ｩｾ`閻[ﾕﾖﾐZｨﾁrd｡ﾃﾐ羊ﾋiLYｺ趨dwﾕ3`ｪ佰悸(F頤!ﾆ委1
!jﾘ急>ﾂ~Vｮ愃褥膚ﾓ8｣`ﾗ燃メSDQﾄ2xｻ=U*ﾅ3}12Y隨9|oNﾏ幃ﾇ_u2衡vﾑF&	fSA~^jｸ宮"3ﾖ滷ﾎVJ礒潴ｹﾗ7ｾﾅC
条Xﾃ|ｧ`ﾇfｼﾑp
殄ｸ4|奨
z>隼rｦﾗ旦ﾓｬ{`8｣/Y|m*钁1Pﾜ&峭ｦｵ+dﾟｽiﾘﾝ-ﾟｲwk肱胴ｭﾆｲF^w*湶eｩmg;ｽｽLfr8ﾀFﾘ|ｵﾑﾌﾙ繭ｨｮ{=ﾖ弱-\s兔VｯﾟVy$揣ﾝjｾaMｺ數!Snhｱｦ汀
_ｭﾘﾍﾇｺ慳ﾏﾙ.ﾞﾙｻFﾟﾈeｧ~F蹴?X｣｢~ｸF?ﾂO"Ey恂8i甼(癡h倬[9憮ｾ輛ｭXｯ	J/ﾀ/酷ｳVl\9縁ﾋ8パX8ÅｯpｿﾇBｩ3ｫh|ｷXJhｪＮ⊂痿BmG'vﾐ:@鑄9vns:aﾑ,jj躪ｫ3ﾐ%ｵsnRｻD?ﾉﾚ	∃ﾑF8VｮｾO\ｭﾁ@ｸ6D3ﾋﾞnﾆ2к38Kｹﾁ0.!ｺ9*ｭｩlq[ﾆ余,裂QﾟLM歉浤~棉3瑟ﾛ痞y縟wﾄｪ?ﾒm玲v)x鸛YZ!ｓ盒Y蟲Fｼ=h､ｼﾈﾕK,L恪2Bｪ薯/	`畠｣g弖;凡D崢mψﾛzｬ伯pｖﾑJﾛ｢]Vﾚdﾇ;謹ﾒｫｻｯﾕ'j凋彙軅｡5aｽ$cPKﾓﾘﾓ
PKma5%antlr/debug/InputBufferListener.class;oﾗ>=>vnvv^F｡ﾌｼぴｧﾒｴｴﾔ"錮ｼ簫ﾜTFE
淨ｼ凋"番､ﾒt}Oﾗｲﾔｼkﾍ0F^$>詞H|ﾟﾄ｢lFA$蔵ﾔﾌｼFｮ珱ﾒ｢腟ｷﾌ5Hd陸讌馥%%22ﾈ羃ｦ倦A､P?'1/]ﾟ?)+5ｹhｲ&労ｧﾄ禝6FF& f氤早ﾈ`d`υPDﾕqI&.PK[｣Fﾇ2PKma5%antlr/debug/InputBufferReporter.class穀ﾑNAﾏ絢ｸBUｨ-ｱ\PMﾜﾐ4ｩｦMLｶｭ)ｦ8
ｳd俔Xzﾑ&ｽ｡LﾏnｴR"	ﾏgﾏｷ3sfﾜ
`uxｵﾗ((纃括
窮ﾚh^ ﾓx]`8(＆P%ｴ=働>募Ndﾔｩｴ#mz彦(鷺ﾛ｣Zq/8ｳｲｭ>^)帖ｴﾆ(v=>率ｧ:ｵ蒼'ﾋ02｣xﾀ咐cb〔?K{)ｰ6ｦ|Sﾗﾚp:ﾏｪｮU｣sｿﾅｶｭ>馘･賭0ｲNﾙy%s染ｰ匹ﾛj9牆@uﾊYﾕﾜeｵu｡ﾚn:齣SfjﾞP0(&ｺｦ_t彁m\ﾓY%ﾅgdnrt}CｮNｮラ｢y率M>(-ｴ･ｶ･侃iiﾊR､ﾚ褒貝qﾔ	ﾉky4MbBﾁﾙuﾜqPﾔﾑtｨ､肩韋韋3羣壌韲ｾoｹ5yyI垣ｾｼｼsﾎｹ迸蠕Dﾔ*VｹｨtﾒCN:爐ItﾐEｰ勤｣G徼ﾈENJ孟ｹ4ﾆ0ｳｿﾎ膕&GX読<ﾁ('<ﾅ.ﾀ枅虍廏,孵ｮ╂Eﾏ3&ﾟf&/2.難ｱﾞ匸茲
'ｽﾌ枅ﾙ+l鏘ｽFｯ3
貎鬢-貍ﾍﾞa.ｿｾﾇﾞg#&0惜徐ﾉO咨庫ﾏ咨Ｂｿｿｿｿｿ螂ﾇ蔔ﾅTBｦｿﾓ_]7ｻ/(ｦ:饑ｿ矩?ｬ_~_ｱ <(wQ(EN疸鈎m%ﾅﾂﾅﾏR&
橡ﾅb
 ﾊ彙ｪS;E勘?WcﾛﾕｰKD｣遭.ﾈﾝ｡X[Pﾝlﾍﾒh4pD_ﾃHP$6ﾃ｡X"､ﾕｸi輻moｷ眞6ﾓﾂァ)quｸ7ｦM･ﾆ@ﾈ7ﾊﾅ蘆江]Cﾒ ﾆﾂぬ-ｦV3褒|;ﾃVUﾗがｭf"Cjｪ畚旦堰ｶYｴLk
AOgﾓﾙxｬ杢(ﾒﾂjObxo	3ﾛcﾃﾆｷﾕ;ﾃﾑﾓｺﾚ.ﾑﾕ絆5rIｿI?V縡ﾚ･ﾅu5ﾌnｹ=｡ｷﾉﾛW憮Kﾖ猖qbｨｪｪﾛｯｶｦ｡沙:6ｼﾜﾈ1:_ｼOｪﾐ^ﾚ7ﾓJ^Miｫ枸碾⌒ﾆ嗄ﾆｪJkSaｭ/Xﾌﾌ4!g '~wuｨQ]ﾗ)ｦ｡:ｴ俑ﾖﾕﾘ'Q｡ｧS椹";4ﾝ`ﾏ葫ｬｽvlx則ﾀmnBiﾕIﾍｬ混k!ﾖｫﾏ-Fﾆ､揉づn=cUBﾗ#aｧ8Ahﾔ)*b8Qﾐ:ﾋﾝZ婦A,靹#D\uﾋ:[SGZﾜ[:k瀟竡ﾆﾔ8ﾐｭﾝ;岨ﾕ]+}ｾﾞ扶懌$E,fgN謫ｯ唾h庖0ﾒ2-ﾑ､ｭ胝k碧ﾒ圄ｪ
ﾝO｣
mcﾕrCﾕR:

ﾙF)b8(ｽ踰-ﾛﾐ拊ｩ"ﾚﾅ23Pﾈ底U2ﾍ!39Qdｾｻｶ｣Cﾚﾃﾔ亮ｱ\ｬ`rｪ"NUｖT?Ｋtｷｾ瓮怡∴ｮｻ1Pﾂｭ
ｶｸ鷺ﾗﾐiﾃhﾄｼzk Y)ｵVSｮ+]劭ﾑ8ｧﾖ
ﾉﾒ?.ｫY案繋萃|2GF'ﾋ隗Fe*ｹz|ｮｻｴﾔﾛ咥
ﾈｷ	苻_Λ(:昆.ｯN<'#~
ﾓｭ})9ｩｫ丗Sﾘｲq,TjyﾛSwXﾂﾀnc､V{:ｳ收~係ｽX>乗bﾘx.OｸDj\雄WLs6XG‥ﾎｾｴrjﾎ!ﾘｨk!|B売"ｬﾍ弧ﾄｸEq3篳ｴH[/<ﾕﾍ6^O冤D5ﾊo!ﾄﾗ｡澳畆'Ktx醍悽	fﾍｵ:ﾀ1kｳｰZ
ﾘXX鯑;J93/c朔<ﾍf!iﾑｨﾆｮ｣ﾖﾚﾚm9ｰｩャﾑ_ｵ◎4_｢迹I珮HﾌG<<ｱ舖@>胸uBW#弛ﾛ2ﾞ,oﾍﾆ[;,Lﾂｳﾚ[;FEﾞ#蓆参!*"ﾗE@+HTI4厂ｩ謙cCQﾓﾐ2ﾈ憮mｮ｣ﾒcZ哂EｰTKﾕT#-]責池LKｵKuﾒR,ｧ･ﾉﾇｴ4ﾓbｩ\;LKs$S悔*iNﾒ4ﾔ%ｳ袢珥鋳Rf42\i@ｦﾚ!PHｹэﾗ･<
;d> ｭ珥r2ﾍ9珥*2ﾝYﾈ霞猥wｬ0!US.:探ｹUﾅﾚ$UｧUHB｢賭ｴKｨНﾁ-Ebｶﾓﾅｲ}ｺﾔtdI*	4c7M賑@j｡肚探峺;E-Gｵｭ@
ﾜeﾕJ昊ﾊJXY+ｫ⊇悵HU[｡卒弼i･ｮﾞｴ豆ﾑQ孱Z
Y熾病h1%8｡r6抜2ﾓﾌ匆ﾑuﾃﾆUﾍFﾝﾆzﾘ閻叉`cﾗGｳ盡ﾛﾁFlljｺﾆｴﾑ`ｻﾀYｵJ♀､餉ﾗ覽椌ｭｼx]ﾊ;ﾎH#4g?9ｺH%ﾜhﾌp\ﾎC>.ｾR),､dｬ袍CNL顧Vﾞ垂xLﾈT3ｷ蹉Aﾅb&8ﾁn敗椽ﾜﾈ$_gO!ﾀChOﾃ暴藺ﾚ籘Xﾇ3/I柤YG+ﾘn4ﾛ:~垉ﾔaｾ｡,ｮｷﾈ[jG9^e易<ﾙB"ｲ攤@uﾔ]嚴贏>1ｩ	Mfﾚﾌt謝ﾑ
.杢ｬ砒ﾍｦ邑嫂vﾚｽl｣ﾒ肴ｴｭｹﾜｴﾈﾛRnﾎE3ﾝｼn^
ﾉ蚪
ﾈｯﾆU戦B羯埠
ｪ:屁ｷ､ｙﾗM{ｴ#'pzｸy$7ﾂﾍ ｿ
ｷ@ｶn○ｷﾂﾍｽ67wM駆錯$杳ﾉ;哢ｴC舅pnﾍ;哢ｲCd8ｷM駈須ｹ愎yGﾓﾉvﾈ撃s{ﾞﾑｴﾄyﾁｹ#h:ﾅ9ﾈApqmBZMﾈｲ敗ｵﾝﾞﾟ瞭8豚ｻ`1vｹ(ｰG}ﾜｻbe骨jﾇI`滌&ﾖ崢ﾖ7ｯ;廠ﾗｧ＋怡ｴﾟﾄﾍ｀｣ﾅ
ｬx,ｲ9	ｸ7ﾐ,r4ｫ}ｰﾓﾀ睫zjeﾅｪﾃｴzﾓ~壗s蹟Tt$iｭ0擔ｱﾜ檠E輯gﾁA:9*ｫ80u?Lgｧ"p|祉ﾔﾍﾟ-ﾝｾﾂΧ檠ｽｽ莟%鬯･Ln/ﾞﾕｰ}Xｽ姥?Bﾇ韲凱Iﾘ$'i3ﾜaｷﾎ1ﾝ:-R)ﾏﾏ+ﾐJﾌﾍｮ@ｽK請漉ﾁywWqE}
\(ﾟ=ﾞB{y!y.弟}ﾈｿ\ｳﾌ1R庵q{庚lﾏ縵ｭ$$ﾖ86tｽ|':婁､&n5ｧｱcm垂e膂XOiｴ"cｮ杏ﾈ>焔i族1'ｬﾐｺ｢4ﾕﾑ/_宀ﾐlｲ.ｵｻdﾉSｺ互?ﾂfz･(｡ｬpｰｦj)ｴ靠ｵ改嫣FS+ﾓｯ睇qjﾉY鼠BU端:zﾉｭ\鵙
ﾑrt*j9ﾚ百pﾄﾌiｧb7ﾋｮﾁ<ﾑ圀ｪUDｷ7cUﾑV僕PKｱ6P!	PKma5antlr/debug/MessageEvent.classuRﾛNQ]ｧｷ儂Vﾊﾅ"U8Bﾑ6ﾁb
ﾁ翕ｴ囃:mｦSﾔｿﾍW-&~eﾜ{ｱｶaﾎ>gｽﾖ^g漱ﾛﾋﾘﾐ0
I浪Z倔纈Ｆ
dUｬpｼﾂ澡ｮｹｦ篌|ｾｩ'o3~Gﾁ]ｫ!Wｾu端ﾖ装ｭYv%ｻ:UｻB9襌Fｱ/<yÅfｱｸ]井ｪvﾕ]1:Hﾛ･CYvWHa}_
$ｶｪｶ,ｴ^陸ｳk彬}ﾞﾆｬ｡T､ｻ96zk)ﾇFD*ｬZK6FQﾝ驩ｶｹrﾍｿYﾐ燧ｶSo9eｨﾊﾞ淕fﾓｪﾈﾍ#iｻﾋｬ･ctLcFﾇ0Fx燐1)jﾗﾝA漾:ﾌ乂=ｳ惡t:'_ｸ5ｸｯc酲ﾎﾋｱ凹｡卯ﾇｩ;0AoJﾇ,&t､ｸ,eﾙnﾍﾉﾋRｫ弟$ﾋ)yｾZﾄj4､ｽ/宣7ｼ靫ｪ,ﾒQS'
ﾑｯDG@ｻ(庠bﾊ
初ﾖq:MS]bﾄ\zｧ^S_65L#^ﾕ契ｿH87児'劔6ﾂﾝ朿D#ｾ勞'斐+ﾟyq%ｩｶ5ﾛﾐ>#jRpr鬼H&hi綵ｷ4TﾌaﾞW暎0噎ｱﾐ1ｻoｦ220~PK杵ｰﾚ_NPKma5!antlr/debug/MessageListener.classmﾏ1
ﾂ@ﾐ?&
ぺkﾀNUﾄBﾐzﾕ!DﾂFf79怛Pb,,7|ﾝ顯|тP幕汽r!ﾌ豎6.u甦捉-[ｫ捌6nｵ8}ﾔbR}^ﾈ7iﾆ良ｩulX妨]jﾂﾏﾅF5R6蝦攬|vﾉB#ﾗﾚr諭hUﾓｮﾞhyﾊn拔ﾗ=zoPK梁ﾔｫPKma5antlr/debug/NewLineEvent.classuRMOﾛ@}ﾛ1&@
!iBn揆ﾆ類ｨzhﾕJH=P!!ﾄﾁ!Kdddlｧ8Fj･ｨｪo擽z劔}f賚ﾎ6ｳxaﾂﾂj’ME:6L莖i`Kme^x･ｼｭ｣｡｣)浅ｽ@
=ｭxﾑ;%ｻs^ｻ趣}輳\曦ｻ垢r?z萸u亟_teﾅDﾊO$ｩｽ/｣Nﾚ k7ﾘBｿsﾎﾙ)｡@獎cy%`Dャ(だﾀ｢ﾝｫ8Dwﾌア槎O柬ｺｰ/ｿｪZｯeｵﾛﾂ<,TQｱPﾄ怛eT(nｲﾐL含(燦Y;ｶｰﾗﾊｴ&'椒&Pqκ撼ﾆ}g廾絽#献r2ﾍｽｼ尿O`ﾇezｺ｡(ﾎX翕ﾜ,7.寝2ﾒsjﾚOﾄ3
mｶ!R3Z3E
.ｾ泉G,Lﾊoﾖd%WLｲ?ﾊ｣ﾄzA殪ﾞ#{7EKA･軌?･ｩ､ｦﾋｫS)~ま$ｿL2.fﾄC\uｭGZIO`(Y	
%賭ｙﾛ	Uﾚ:}+ｿPKｨJ有ﾍDPKma5!antlr/debug/NewLineListener.class;oﾗ>=nvvNv.Fｮ故ｿﾔr淮ｼTFY
淨ｼ凋"番､ﾒt}ｨｸkYj^卸fPqp~iQrｪ[fPｱTﾚ'ｳｸ$5/ｵH/+ｱ,荘A	0% E9謁鴾IYｩﾉ%ﾈ`*鬼ﾙ鑠FFV求
H21ｰPKﾙdﾑ4ﾐPKma5&antlr/debug/ParseTreeDebugParser.class昂ﾋRW=#	ﾄ謐E,Fﾎﾃ$1岌ｭD<慧ﾅNﾂ ]ﾄ4｣熊ｮ埜WvﾙdWTｪRY逎R9=ヱ親ﾞ鰥鴃3#ｯｿL｡ﾁ5ﾌq/w*貲,Y筏%1ﾋbV"=設C1I1ﾟHﾜｷ扎aUﾖﾂX葎0ｱﾙ》}ﾈDﾐ局籬刈Oﾄd$;1Y1ﾟ4携rUﾇQ冥a8敏卑ｴmWCwjﾟxn$ｪｮYL､]#w0｣aｰdWﾜM府;ｺ?eXnﾑIﾔﾝﾕ｢Vｵｴ｣懾ﾝ%蝌ﾏ
ﾗｴｭｴｫﾊ
ZRCｬi咒怕P,9ｾﾅeﾑﾎ+
由ｦ･ﾖｼcｧHﾏhｬﾟI写'ｭrﾕ%5Wﾍxｷﾟee-Tww辺$:ﾊ('zAﾕKﾑﾐo.ЕDｴｮ:こqVﾒV2ﾜﾜ梟ﾈ/9U悶J?c彎,ｪ忤0K蘆bﾁtﾓﾊﾞ5ieﾔﾈ匝t3vAfctﾘu懸JZ{ﾌSﾑｰ
田Zﾏ宜ｯ/銚ｫNNｭ來ﾈ｡Sｬ%ｵS-cｸﾉﾞ7M]ﾜ_ｸ:F｡誌ｱ稈&ﾄLBB>ﾁM1wtLﾋ'lAﾔ珂!ﾏ豸粋]jｰ鯤+ﾝ久ｩd['ｾ瑣侃ｽ+ｦcｦ枝辛ｷu覗魏%ﾝur^鶚ｴ*崘!ｩﾔﾁﾏUﾟｳjVｼ→ｼ廉tｨ2拉!5FﾌSI鍔0ｾs鴫PU
ﾊ｢ｬﾔｻDuﾖｧｽｾｳO5'椙ﾟ ｰ股=)R'ﾇﾏ_tｶgﾙｪh+火ｧ3ﾞPﾅ|｡ГｵB￥ﾅﾞｦﾐ旦ｰl窯ダk	qy+ﾄU&ﾂ｣朔i荘ｮﾃｴ1ﾙｇﾅｵCｴﾅChﾅc
羔h｣･DFﾐﾏTQ`p園Aｮ#苑ﾂ蹌C;ｻ8@ﾄaｵﾞｱ綵鰯&ﾄ	qｲ%b郢ｧ<ｽEｯ駿ｫﾆｵ-m杰m悄ﾒ&pｻEhM｡ﾓｴ|ｭ9著WEﾀN$~ﾄ?錚旌Eｯそ:1ﾋ$ﾀgﾜﾃｸﾓc｢ｽ1cｾ	cﾝ<>hﾆX"ﾆ21Vﾎ`;uん+ｻ(Yﾅﾗｸ｡Wﾜ社ｴﾕ8ｷ=｡ﾟ0x伍1ｲ=5ﾔ0ｸ;ｺﾄ'怜ybCucﾌl Gｸ4逑ﾁe<ｦｷﾘ,ﾌcｩ+vﾎ鋏ﾂ{U^ﾇ靜ｲSﾑU游Kﾖｩｮﾝ碇ﾌu腦<ﾋ1ｶﾏ(ﾆgｴMF褸A椡･籐.ｳﾇｮ們F3ｧ梧Nｺm函
SL=w漁lfCpﾎﾎrﾀﾗPK9｢ﾀ&Y	PKma5antlr/debug/ParserAdapter.class掴n1ﾇﾇ-ﾍ豕Iﾓ噪Pﾂ!UU{JKD"8;ﾞ!ｸlｼ泰[ﾁcqB簑P鯵ｷ畝[a{~ｷﾗ棔ｿｾ#xZM(ﾇ秤AzｰAMJｽHｻC#4ﾒﾈhﾜz
ﾘW
ｨAHnﾑ又|左鞆ｰﾄMﾌjﾅ､U?V$ｭﾁｶ+替俤ｮｿXｴ鯢ｪ､ｻ~ｬFｺ酩磔ｾDﾋeoﾁ熙w癰ﾏｭAz猊ｩZﾐaMﾒﾜaｻ､]?ｶGﾀ常ｺ菘ﾟPKkﾓ}_PKma5"antlr/debug/ParserController.classe廠
ﾂ@Dg5
66bg帑ｭﾁ結&9.ｲｹq~%^ｰｰH1,ofﾘ錏a#11$ﾉ酷|%ｬrB;\湯AIﾉｲyｰｱﾇ黯/ﾄ趁Nｫ%ｾｹｺﾆMdYｧツQIﾂﾛTｳｫAﾂX)ｴf2PШｳ靠ﾆ5keｮ徠簇ｧﾍﾄ.--.ﾐrjｻZﾁCpｷﾟ9Э｣PK｢ｳPKma5$antlr/debug/ParserEventSupport.class校\班ｵ?]Xﾘx** 0篌寄I\>01ｸﾀ'ｬﾂそ錦$Mlb呈m^mc嵌垳6&ﾑ,ｱ&ｶ贄4ﾍｽｷ鮟Mﾚｦiﾚﾛｦｽm{o巖ｾ醤o畆P{fﾎ劔恙9醂兢^hｿ､ﾃｬ､ﾑﾍ懣'ﾙ8S,g;)Egr<ﾅIi:3ﾕﾁｹNRtf噬ｧ;)Sgf88ﾏI9:難'裲ﾌL!Bf9ｸﾈIｬ)vp遠
ｹTﾈl曾"}8ｸﾌI･ﾒｧ皮:!q休档=.塒蠶TxｾB*,ｲHﾈb魎DﾈR!
Y&茣4,cｹｬe[刎ｬ鍔ｬ黙ﾗｩr蠑VHｵヌ､WｭﾌｺNｺzｼﾞE5ｼAﾈFﾗｹﾈﾋWﾙ萵zm!>!坑ｼﾙE
ﾜ5rｫ-Bｶ:x寞Zxｻ6U_鬚m|父w:j'`%保･ﾜ%ﾄ淕Rv:ｩ砂doT!ｻEｱnﾑｳGHﾃq^'pｯ徃櫞Bﾙ'$$Nﾃ)G<(ｸ)ｼ_ﾘk腥ﾈQﾖvﾗﾊﾗﾉ]/ｲ	{ヰq!7	ｹYﾈaﾟ籵[儚ﾂΓN)ｧ~ｿｿｲﾗｮlﾘ｣vFV1･wﾕ@8｢ﾕP)W4	Vn{"賛2対SﾇSﾇｭﾀ｡WVｻﾍｽj0Nw嘴dﾕｾｦ接':+
ｪﾗﾔ穰uj:yｫﾁﾓｬz0ﾒｪR;ｻ+廏｡ｰj宛C7ﾅﾐﾍ陝ﾗｿﾁﾔｾNM	深｣Ｍ,ﾀI\ｵlS::56J_｣1jNｨγ袷ﾓj牢ﾛ>cﾐ減Aｭﾑ7ﾋrｹ>S嫣v#｡ﾞ^5dｽﾜﾚh;z;j}-[ｼL\B[8![ｽΜ
Q頷ｵz巒峭ﾔ{EﾂLiﾞuｭQASR}ｵﾔlLﾉ
ﾕｭｵｱ｣淅ｴ[E昔卑Pﾗ垂u柵｣}5{媼ﾛｽﾍﾍ栽"Kｲmﾕﾍｾ:ﾟ即AoCSｳw擴Ntji	ﾛｾｾｺｮ^亮2G･-ｭﾕﾍｭｺXaﾊ至ｷﾔﾖzｽtｨ頤nkｯｯiKﾋ:}ﾞｦc祗ｬ+4ﾘｫｮS"=ﾈﾕ〜 Rgs舜ﾉy[呷ｵ]pﾘL9#ﾟ`_MﾜWﾗ:禿2ｺ緕kｴ｡ﾆV5ｨ敬wJｦbｷ報掌Gﾇ=nﾜｸ1ﾚｸl胡m&6ｬﾈmaRq｣ｦEG5佚|ﾉjh\1綣ﾍﾑ&ﾁｸ>ﾚ?ﾎQc(ﾄ.U(X聢7V榮ﾓ耙ｲﾖj湾Pxｯ聚ｩ笆マｰｻｻN"ﾛ=ｻ冤n息衿肩｡襤1ｱw]6 Mk0Bｻnb3sF;#.OCq翼Rｴ^c*aｫﾜｦ)ｵﾓYｭ&ｻﾄ]kLﾝ);Uz+k5ｲJ6ﾝbｾﾔ	a越ﾋｲｨ>ｺ繋-ﾓﾜ	碑|ﾙﾋZ}3ｰﾀ	ﾂ}ｲﾝﾐ	Ff哦jiox･ﾑﾞｬ"ﾞPｨ?$j丐ｼ:鴫ﾚﾑ膸ﾌｫsd?ﾔg綿,5\(ｻeｱﾜuvﾀｱｴｮ絖|ｽ?ﾐ+ｭ媼"T箱}ｰｳSUｻｴｩB億`ｬﾑe=ﾌｹKHﾟｯﾆGﾒ\]8.Xqﾁpｪ.ﾌ1ﾑ,ｮmL､*ﾒﾛ&BﾅF	bﾋｽﾋ疝ﾑ2ﾀqｺ鴾埀ｶﾈﾁ.図S陋3ﾎﾓq	､Rﾒ[
ﾝGﾃ蕷
=@Zﾅ2'｢OJｶLa}湊t\J｡Oﾑｧ冉_D､ﾐﾃtt顧觸H｡G鑚
ﾝBｷ*t}j
+|｣);/u渤jH瞻ﾙ棔(|'ﾟ･ﾐ掖oｬU*|ｷl+ｪBG､ﾅ.ﾅ.痣z博)&妝N｡ﾐkm~H?R閔烹ﾟｧ(t;aｻﾜ#膺!w<Wｽｭﾐ/餮
ｽｨｱ|淞
?ﾈ9
?ｭﾃﾀ倆1zﾞ｡_(|ﾂC)壻rUｳ按溘G`	/-蘢
桴Y"ﾆ9堕ﾇ1ｿ 芫Bｾﾄ!yｾｨYeｦｲ興~~悄PI!OL膈
欸!ﾏﾊ:
&H>ﾉｧ`ﾚ&ﾂIw{ｫCﾝｸｲヱhhw訣ﾊ5ｻw鬼ｧuｻ#ﾔbｿﾊﾏ	こG/c<ｴﾘ葹ｬ敵yﾏﾀ隗糀暑1|]ﾎrJlｦﾚ?ﾎ)7ﾄX^Pｬ<'D3淀慵-M:瀰Iﾗ
ｿｬ[ﾘ+ﾒ曖ﾊDﾒG
ｿﾊ蘖5ｶﾁｫ
'ﾃ9	ｦﾌ)0jN=ｳﾌｩ\3絎ﾁｵF=ﾋ<#ｧ餬Aﾋｬjｫﾗojﾀxｷhﾙ^3ｶ、契n1"敲ﾗｼｽj泱6蜀ﾕ補ｳｭｲRs祀ﾃhMｹｰ~｣9RrgoｿﾜSﾝ訳ﾛｪﾑ?oｴU;ﾞ ﾌ*葫.{heﾙ|｡ﾇn閾裴鼇ｵ=ﾁ
ｪ"ﾑ59;{ﾔﾎｽ5!ﾕｿﾊh<$｣QKﾏ9Kｦﾝ鉄潮書/M榊ﾙｭiﾍ]ｱ關`Fﾓ_g炉hﾒｨ 嘲eﾇｴN	2攣鴇b鍋ｧ9ﾉ1綢F陶b薗+dﾎ-_ｱiﾒC)洵ﾋrp"ﾑ4ｳﾐQカｨAhPa秒鴦mBﾝｭｩ掻]2ﾖ`xB8pｭ*ｶ･[nｵcXｬiaﾜ$癩(;ｰｦNｬｩ-x宜 .海\$嫡綾Qvｱｴ9c∈8qｱH"Eﾙﾄ> ﾑす竰8ﾄ%"I8rC@｣.ﾄ･qKEq蛬 ^ﾄh1ﾄ@\fｸ4詣擇Kﾃｴﾌc=ｦﾋb8$_,_K
]ｼR､ﾆ[ﾀd媒敏竃ﾛlｶaZﾁﾜ瀛ｽ､ｻeﾊ'･6L+ﾏQ~'ﾈｹﾒ>|l･W謠ﾐjFﾐ梹ﾊFﾄｪjdeﾂi/?ﾑ{<)R糊ZF,ｵA塑T演金朿VﾒｭﾔUｮ｢Lﾐ(｡v0Fﾜむｷﾂ塵ﾃﾒoGhｹ.}'戌.8ﾍﾝ0#0ｶp裼ｶｱDｯdJ鞘>gﾑ}ｸ糒_ｼ済G政ﾆｧｲﾕﾈi傘m杳ｬｿNx薑h=x ﾆoﾁ'襲晰oﾆ+?7	l険ﾙ#FSGｨIC1~ｳ1ｾY]濕ﾀｧ傘ｫM1~愚k+teｷ
ｳ際ﾀO｡ﾂﾏ>Cmmgh懌ﾊ忰i'ﾌ龕vTiﾗi沚搶嘗>堅y牌!E@zp	ﾂ$ﾇ<桐ｮﾃ7ｼ#Dxﾋﾓ纜EOr1=ﾅ駟^Cﾏp昶>\ﾟ,ﾟv豐'+ｱ}ｸw齎黙sｰ緕續W遡ｦNﾘｶﾏS0ｦ}ﾘﾎ'>zwｼu宵Y草
H垂 ﾇｸKQw翦ｯﾄMｿFﾁnﾔZｷﾖZ｡ﾛh預｣ﾉ碕6ﾜ･ﾛpﾒQrxI栽准ｹB:riﾈ椛ﾌE~Plｦ_ﾓ{ｦﾐa球爵3%t､$ｯ tｼ
{
ﾒﾟﾐF5･jｭrY&泙3ﾔﾓVp<ﾓ}ﾚ縡ﾈ`:|;P

ｷﾜJﾀﾉﾂuｸｽ\81ﾎ對[*7金ﾎｧwr懶-烟_ﾃOgpﾄ
t慇ｊｹ堰~8#愧5ﾟ广ﾉﾛｧ`‥.ﾘｧ｢蟹)馮ﾘｧ殘p0ｭﾏ[_ｿｭ|ｲ~ﾖKH歪ｩ盆|3褸
\jｸw｡ﾖｯ｡ﾖ{ﾜ\些]･覿ｮｻ61ﾞ4FP｢燹｢ﾕ齦燦Oｮｨ=椪xｿ~ﾞ5ｼﾟ嚴ﾓ;N土%'遏5ﾟY^ﾐ_W4ｺcｵﾆ赦ｶﾘｱI鑓wlﾙ?FWｵﾘﾕ猯髻0ﾙQ}ｨ!ﾙzｶ岐Iﾖ芋塲L怱_ﾌ)鵲装ﾀhﾙNﾓ9價8Eﾃｻ=0蒜p粉ﾒｿDsｨ%FV6E."\8椪Iﾕ-J蚯ﾊHｪ擂ｬ0菽築揮!

Sﾘ%訖b摘
]r4仭Eｲ-塒0`L%躋.O0":FZﾀﾈF>､ﾐ,I0ﾉpﾈ7靄rJ
青ｧﾆﾌ$iﾏ｢ｻｺﾔﾐdｪ6l~O訪f=J(幸i
ﾏ"(	｡s!ﾗ	ﾁвﾈﾆt0^be9Ral5遞ｴﾁ"?(ｶUﾙﾁｴ械=9｡LmH
ﾞ?	;貶J6.ﾐ霈･0dd蹕滷ﾘﾃ"塰叫圏ﾐ+xｩ)L4O8痳､庠A淳ｬZｹﾈ(蘆｣ﾄR孜2Xeﾕ蝌rJr*Z咽灘久cｺ,､VﾘO圈羝*,ﾜｩ=ﾈｻｪ
蹴ｦﾑxｶﾚn'z嫐WA⇒i*ｯﾕT#`ﾔﾀﾉﾗﾑﾒ"ﾞ ｬE弔o僻WlｺDﾏｲ臑~ﾝ6y+]?&c+ﾈﾁ峅ｸzﾘ5^詬鏡ﾌﾍ8e:NYb廡4g3pG0}78E2cBnr｣燭B>.荐ｱｻﾞJﾉｼ愍2yｿ暈ｸ糠'G湃f%鵯.Lｬ膓Pr'半J篷.ｿ宜,ﾒq%ﾆｧ8畋ﾁC]~UｱﾀYｬ,N元8ﾝﾀ樒ﾃﾎgIb愎ﾀNp(痢z,p爺8KgpBｷ涜賊?坪PKaq&D'P+PKma5 antlr/debug/ParserListener.class}ﾎKA狒ｽﾊﾛ`Ks+BﾂJｫ径ｴ､ｧI\ﾍﾂJ虎ｵｨJ%ﾟ_ｩﾇv0A猶#ﾔ	
B寅"x6｡｣P]斟Vﾋ4轡｡ｻd享ｱ#vｲ+ﾙｸﾈ[ﾙS(xo紲lｱﾙ久
｣ｬ_ﾉ1YCｽｴｲ
5;I｣ﾃｻsvz頼AVﾌ%9歙bRﾑﾋ慣e扞?ｾｼﾇﾗ%Jﾈ｣b2	eｼK｡碇ｪ/PK際眄fPKma5$antlr/debug/ParserMatchAdapter.class析N1ﾇｧ vｿ1jｸ4&ﾆ	船篆ｻ;b	tIｷ^朖<>拝ｺ慧O;寶ﾎ釋顱9p8舊ﾄx)4W晟撥(DｵｾT8Xﾌ|ﾔ#甍ﾉ繙堕｡ﾐｱTcﾇ收Pfｪｽﾅﾘi瑙併ｰEﾜ9qｨ	^ｴ7ﾙaK3ｪkκ､ﾏ~ｪ46	ﾄ5>k)Lﾅ*ｾP猾,ﾎ'ﾓ
粕ぢL*ｳ栂(ﾝｸ5ｽｬKﾌ&Xﾉ,ｧﾒs
Bｽ<撼K*Pﾅ=ｫ\ｱ鐶叉ﾓ^h螽ｶﾍｦe+/l几f｢`7緊-kﾝｾﾆSﾌB府|ｶﾈ｣Yｱﾋ&5∨|1oO)案室](K9鏈ﾈｭtu'k3fｶ@fｪﾍT(wﾔﾔﾚ噎2olｴﾝ
T8ﾁ?-hｯQｰﾚｸegl匪
+ｩfｮﾈｬ9ﾌ拉ｾBﾋn-bNﾂｵﾁﾊaLj･ySｹqﾏ妙Z･uｺ/睦ﾔd*
箜ﾍ.5'ﾗnYx衛･T-ｯ[7艇ﾈ痛ﾋNﾌﾉ=ｫh暑Kｯ癩%ｼｩ.ｸ蓋u\A\ﾇｼ｢罎ﾀｾﾔ柁｢孜ﾟBJﾇmﾜQﾐ
mｦｺｱa頁3;3=v梹}|･c7hi;ﾎ4dﾍOL
絳/f@ﾇﾗ俔qqiﾘﾒｶU隋ﾍ詢謚ﾚｲｸ出ﾘﾛ愎7dｭ趣0Kｾ仔ﾌ搭$&ﾎ局Aｳhﾊ奥墳n&ｼ!*wy志ｩ^圈廷ﾌﾝ]ｫ投ｵｩｪ装fw>ﾞeIXg粹榴ｳ蘊tﾛｧ1BP2ﾈQPr瞿qﾗ&\;瞽種声;｢kﾙ漆箘ｳCh{H'9;Mｾ6`;+G
ｮCﾛ?"止ﾊﾕ_ﾆ>GoE}Q$Q#ZｻﾑI罫?=親･]Cｴ罪ﾑKkKﾀ!eq3m､>ｯt佇nj#綜ﾙ､m､ｯ,qｮｭTJG逶:通'xSg*ﾆhoｷﾗｫ^}	ﾚv･zNｯRvｾvz欷越i~ﾚﾅ胱ｯR/ﾃ辞ﾏｰﾄc ?fﾖ4ﾆ繊]FDｭC7｢ｾ:;v*q遅拈)gc彖kｱ#Nﾝ夕ﾕﾟ	堤ｭ?ﾑ}=當u7-O{DD>!N4~CGrﾂ
487>ﾙｿXﾇps|Jﾓﾗ1穃ｱYﾞp7mﾄ鍍8ｶug
Q_
g5ｼｨ皰ZﾃﾋZ
ｱﾃkﾓ8｢:_ﾍ1ｦｲ/[ﾁ[ﾎ{\PK褒tH>PKma5%antlr/debug/ParserMatchListener.class;oﾗ>=>vnvv^Fて｢籌"ﾟﾄ剃FE
淨ｼ凋"番､ﾒt很Yj^卸f#ｿАfq.ﾄATｰ"ｮ珱ﾒ｢腟ｷﾌ弋F	$マ2規RR偶ｲﾋ舍ﾘSﾆﾈ Rｨ沒琉沐伏4\YL･Sbq*##3=ﾎﾂﾂﾈﾀﾂﾀ
d02ｰAiv(ﾍ｢8$PK旧ｸ+PKma5 antlr/debug/ParserReporter.class･甜OAﾇC-Kﾋｭﾜ/ﾊE`HｽI逝SA"聽t;瀉;ﾛﾌ挺ｱ4ｦ$奢Pﾆ3ｻｶﾀｾ恙殱~s賣ﾌｯﾟﾟXﾇ哩^<霖",姨驟	Kﾏﾚｬhｳjb

ｬ(xﾄﾐｽ飃ﾇﾟbHYﾎｷ"KAｭ,ﾔ1/WIﾉﾖｹﾚq･ﾔh=g丙ｫｪP裄ｬpz醤ﾏB^5,蜚ｶz｣>OH}ﾍ萓膜ﾗo
燦(70ｨW下ｫ]･\ﾅ0ss毳痒L4ﾈFﾑｸ虫<ｩP錮Ｈ職氈ﾇ<ﾁSQｭｪ\RAｾ｢Nｼ
NOﾊ枷/ｵﾙﾈ^(fｰ7ﾔｫ
^ﾁ0ﾔ6ｲｶwﾖﾗﾌｬfiDDｧdｻvﾅVUｭ^vY殀ｲd;ｶｻ,7rGﾖｩ)[ﾎa訃瓸ﾝﾅ萓?[))∪懦ｨｭqAUｬB卻`SWﾈC蘿/ｮI!ｸﾓｺo矛h~ﾃ+車.x~#yｯｫ	ﾓﾌ{ﾄｰ[ﾙuｫｶs(0`$/ｵr.RﾝJｽZTｶ6ｱｫ自綻ﾜｮｪ綻ｴ\ｵ~ｪwNﾗIﾜﾄ6ﾓcﾇ
46%$%R伜sﾛoXｭｨｪ.{%0ﾜ&^Kﾜﾂ月ﾞPｴﾄmﾜﾑYN-f}搆ﾀ(W3%Uｨ鮪'
圭&mR嬖(
ﾓｭ蜚ﾒﾆU}ｮJv 
伶Wo7渤nyS倅ﾇ9~形C慘af]ﾌF0z)OpQx/ｦaSh'儁｢ｦf_ｼ泙鉱h7ｺﾅ氣zCｩﾙｱ&ｺﾚzD~Jｫ`弯ﾐR_磊ﾀ~ZXｪｿ:ﾀﾅ損ﾒv|]ｱm|NW'ｾｿ?J~>砂-唱q5X;ﾞ@陲6FAIC濡Rﾐ~V
=mｭ3r<[w>磔MDbﾑｺS
ﾈzbｽgq_ﾗﾎ縷塞7psﾛｵｼOｼPKﾛ姪`ｧPKma5+antlr/debug/SemanticPredicateListener.class}ﾏﾍ
@琶ﾙ･ctﾕﾅ}nA揆｡ｪΞﾘﾃuzｨh=ﾐa>`~30ﾏ ﾂ<ﾀ4ﾀ,@HXﾕ|瑠ｪj8W匐|jeﾕｸｶｻﾘﾍ*#rN妝$Cﾊﾚ7B<二YULX`ｬjﾋ哺TﾊV6ｯ于雕ｨ､.ﾄ%-9ｳ襃j/彰f檗ｹｻﾉ#xt|宥ｾPK莉Eh･PKma5+antlr/debug/SyntacticPredicateAdapter.classQﾋJ1=imｧ/m}b)
.緋｢ bWE-3ﾉｵｦ見d2?ﾋ歩ﾂ｣ﾄd(憾ｴ亨帑7稼#Vｻﾇｵ庚()JG瞎pA7Sﾒﾜ%ﾉ狂\X%､ﾜR劉$Coﾄ`N嶼廾Xnｬ淑-潦!愛g+オju柄ﾂ磬W?[21漑
(2/j訌hxOs=
｢1	ﾋpｲﾜﾚS%MGﾈｹ_p常ｾ､鑠!ﾃﾀｭ\eｮﾎﾞﾀ^ﾝ┌4!ｳ撚僮嬾莨篩ﾌc'ｱ匈dﾃﾖW･nｬ抹ﾖWﾋ|轟ﾜPK町權7PKma5)antlr/debug/SyntacticPredicateEvent.classu逮nQﾆｿ‘ﾙ.ﾛbｱ･RｨｧﾕｸｮmHm!i蕁ｶﾁ･Yﾎ6ｭM|>T纜-枦fvﾎｾ撕ｽｽ@ﾇ66Qﾐf_嫦%,<ﾗ
eU,Tｵｯ･q佝ﾁ<_ｽ!ｺ躙礑ｴﾇ"ｵ?ｯ､ｧN=んn2推ｹﾈ肖ｷｾ?3&6ｦRﾄ8担Bﾊﾄ9KMｺ*aﾇｭ/¶ﾙみ戰｡'?Zｻﾔ()ﾟｻ蠡抵odZtｰｬ69Oｱﾃ擣ﾊｽ号C齟淀ﾂ#Z/^ﾁuPGCGM}uｰ<｡&5ﾛﾙ醜a桾劉ﾎxﾞ){q葉ﾘｦｸｾ銘pｮﾏｼｾｾy剔Tcｭ｡钁%Pｼ	 ｽｶOｭﾀl4遐ｶﾙﾚq6ｬｸ>ｷｨｯ!ﾉoﾍﾒ蔚ﾀ{^Pd ｹ
l1{皴.ﾗ'･ﾟ0.踪衫ﾃ3X3l舁使ﾈｯbﾆｵﾛlﾘ'/PKﾑｭ$ｫPKma5,antlr/debug/SyntacticPredicateListener.class}P;
ﾂP懾ｿ`ｩXﾘ6v７Bﾀ~}Y$橇ｲｼ嚆P(襟)fvfwﾏﾛﾀｽ]ﾂ ｻZe｣菓9ﾃ*kNR	ﾓ驢ｭｦ.悟ﾃｨ$\]ﾄ鹵ｶ'ﾋ.卒ﾓﾂfνｶ捏gd#	縒ﾆ&ﾉTｬｸ/L傲ﾟ陬&}亟=ﾛﾃI厚Sｿg?ﾊ%gﾒ *ｾｪ=ﾕ｡:牾ﾆ@ﾏ7}ｯPKbSetｾIPKma5antlr/debug/TraceAdapter.class棲Nﾃ0ｷ4iﾒB[` Bl｡y"$ЯAﾅ$Gp$ｯﾅﾄﾀPsｨ(Rw>ﾙ醯ｯhc鐫臙ﾛﾅ死s｢ｴｪNﾚ罐{″"%、､4]ﾕO1劔茎ｮﾒBﾓ4･ﾒ丗8勅ﾊM漏\g睥ﾈ.､ｫｩm穢B豸ｶｾ.ｽｨ'u
=*ｻ｢6	]*[5ｳT>ｳi2ﾙG実ﾞﾊKH`hｱ0:ｯ9%鼻ｰBGｪｬH特!Z<5ﾇ_ﾐ睚ﾝY]ﾞpｶzﾊ	?俔i関簔_｢ｯ%bV{1侶ｿｲnｾ/hNﾁ<ﾖｭｦﾇPK吩ﾈﾜPKma5antlr/debug/TraceEvent.classuTiOQ=熟ﾓ2XhｵｴeS-Kqﾃ幹ｬBﾁﾒ1fﾚ､､27~Tｴ$奢QﾆｦeIﾁ&ｽﾝﾎ]ﾞy/鉐ﾏﾟｦ濯!ﾛ>\ﾃ/ﾍ]if%vOb･y狠Cﾌ)HIH艇Xﾁ2^;K
貌新ｰ"絛Iz*Mﾆト<偖椛ｭｿgIｷtW:娑ｦ_fF6vs!ｷ碧ｮ
ｸS號ﾙﾄﾖC=Yﾑｫｻﾉ債朮ｴ趙ﾛL[ﾚ/ｵrU.f^/T.Iﾈ'<ｻｵlwwﾄﾅﾇ8w2岌vｲ骭ﾙl_ﾜｮ涼ｶ^ｩ52c'kﾋ2ﾋﾕ]∪X\&:GFｪXi=eﾕｭｺY4VﾊrXﾞﾔ祈ﾐｨZﾓ2YﾅUL`REaﾒL`MEq1ﾄわm;;)sgｴMﾝｬQ砕ﾂCｯUｬ#ｫbc*｢S]ﾂ9ﾉK0ﾞ-夕ﾘ
1z1.ﾞｨ伉ｴ9ﾂL鷆ｫb&KF｡ｾｿﾟｺRBｮ:､橈^ｩZ~ｰ蜈ﾔ柧ﾑﾄﾄ1ﾄWｮｮﾓlTeﾝ.｣ﾅ!筥ｶ羽4ｸ8ﾋｼｭ涵nﾚ｢｣keG驟6煮ｧ)n･ｿ緋lｧｹp8ﾚﾏ$架ﾎv~(=歿?ﾋｹ襍D8zﾌ"
ｦ
xﾎr58i8ﾟ0:叟CTﾈgﾕｪ組
9y埜ﾇjｾ:
ｨﾟﾐ革\堊疫7ﾐ｣iﾍuｯ\qﾝ@潭
｣%y#ﾍS6t9社9wﾉL5nY｢
=ﾃ.PHi:ｾｵFｻD?ﾊﾊｼPｲy.ｿ\ﾗｷﾘVｰｲ繰ｨ*ｸきBｮ%q7$,)娠｢	ｩ	ｩ+Xﾆ械74dnIｸ-CﾂｲMnｻ曼倉l=ﾃ黠ｮcﾙﾝ&yﾗ,ﾛrﾗ｢Z!ｶ=09Cｺeﾙｹﾗosgﾟhﾈ0y@I池逡'%ｭeﾘnﾏﾑMﾞｺｾctﾎ14K跣,7T榠睹,qH阪怕ｨFEｨﾈ"'皸顎ｸｯV%ﾍｩ#ﾞqﾏ
累ﾁiW9mf袢1HCqﾙ｢J_hﾘ4i憊i､逆ZBdKﾕOﾀ齷ﾈWD?ﾑEｪ"6$信$U_艤Dｺ.繋P2RHR)T靈cｸﾒｹAHqY3ﾟ!ｽ>ﾀ突>)洌q/q2鱒F哄dｸｦQﾊﾜﾄi圷2Kｴﾜyﾚ熙ﾝﾒ)覡ﾀﾉ､I4cfjm,苓=ねｿPKw_FePKma5 antlr/preprocessor/Grammar.class標}`[Uﾝ6i>ﾖnlJﾉﾛﾚｴ]a ｫﾝ@GWｶﾊﾖ矛6PyK^ﾗ@噪$vPﾁ/安ｦ"礙E)ｶﾙﾆ腓EAﾅﾟy%mﾓﾗRﾈｹ7ﾎｹ迸{>{ｷﾟ	`ｩ梦ﾇﾉｸﾂ\)萢Bｮ!WｹFﾈｵBv
ﾙ%茘Bｾ戝ﾗ+Xd
?ｪdﾖ亠o
ｹAﾟ壷ｷｾﾇ ｾ'oｱ冷ｸIﾈﾍﾜ"
ｹﾕ!o""ｰy0ﾇ"ﾙoFｼﾈﾊｸ[6ﾟ#ｰｽ~ﾜ枝>wｹSﾞ蠻ﾝ^ﾄ勝?~{9ﾁ~/馴bﾗ"s=(ﾆBfｿﾂ静<菁ｯｼｵ`ﾘ#ｲｨ節ﾈｿ1/	只O苅O	ｽ鞘稱ﾁ=翆=xVﾁﾗ{
隔g鱸
1=ｾｵ｡3投ﾆｷｮPvGcF峪ｮ･巽jMJﾕS般$ﾉuｧbFZa:=梔･ﾂ厩ﾌg｢悦ｺ!ﾚ寥5ｴﾆ#FｿﾙHf"E込Dﾒ\･ﾂL稷#ﾞi｡ﾊ)Cﾝ3Vﾙｭﾗ鞏b､r]=QVﾙ扠%ﾂF:扎5ｬ蜥
p?W"Fw4nDﾔfr=Fﾍ早､Ncﾈ撥N疉w杷%ﾂ明yﾀ譏棣q･4>駄俯g埴3-鍮$b4ﾒ6Gq瀦ﾑx4sｼﾂｦ転ﾀ剔k6ﾒﾍ]_ｾ使lu鴟俺'-wUU;9ﾊZ5ｵxﾞﾐ'b侮PY3ｳﾓqｭ侍&ｼｸZｸ･[採懐8ｺﾆ)|<Y?gｹ岷&z矮･ﾜ+ﾄﾊ9ザy=,ｷﾗ)=ｷ@ﾄｲEｬ2｣ﾗ桜ｩhF｡i:wMｷ恢｢qjｾ苓QﾕSFﾂ2Z4ﾝ1.ﾆy侯ﾒ8ﾐAｭ)JT>Y8>邦"RN託2ﾑw5ﾕ3ﾜ9(ﾈY/W贖ｮ]黹'攴5o&a襖t&RaCﾎﾃﾙNZ*Gﾗﾐピ4|gjﾐlFｧCﾈ!ｧ9ｧi霹V
孅堋39宕ﾒ榲1癈陪､lQ|LC
i､睹xﾁ5曜8輕+^瀑
∩S炊ｸ@CﾎUL｡:_ﾃｫﾂｼﾂ?｡ｯｻﾛｱﾄk,+4\&V炒
1z甌ﾞﾒoqﾅﾛBﾞﾁ/eYｰ4m$釆3{
4ｼK+･釜h讎ﾑDCk{Kﾘｰkﾐﾂｰ'2A^m╂LﾇUﾕ(jｪi8Cﾜ5tqｦ\ﾊｭa｣ﾌJ班n2A諚ｰGO#Q9ﾏﾓﾑｭq=ﾓ2ｙ=N]^ﾑGBﾃ鬚pｳ蘢]KYｧ
_ﾐ靠偉ﾋbｹｱ｣iﾊｯJyhｿｦ45KSeｪ\SｳﾕＷ･0"ﾁT｢7ｸﾕ
ｵ ﾝｪ*:ef醤H無:頚=勁-1｣QX2>_-ﾐ緩I弧ﾖｪmV6綉ｦ)-"ﾅ炭5=ﾂ*4cｭﾔkXG`%艘@_&kh悔ﾒ*ｳ~ｲ9.0ﾍy｡)｣%ｯ･4ﾎﾊeb_ｱﾝ`u=.19ｿｳy%ﾓｭ-剔酘;ｾﾒ谷ﾉ∽vﾉs蕘ﾒRﾘ;sｵa
悸ｧ粫ﾑ\ﾕｭfｱ洽]6ﾓ4ﾓ&輻kｮtt麼lj9|Yｶ:ﾆ駘#%ﾒ釆{｡rﾗｽG
Lhｩp2?ｵ貘%3濫]s<ﾅ7ﾚ#｢9nｲﾇﾍ6t{<ﾃﾙﾌﾖu{ﾜb渋ｱGﾃﾙr9ﾅ%=ｶ｣n詩｡ﾝP｡	)
ｩｸ鵲
ﾕ沼
ｸFﾕ滋t梓
g.ェZﾍ}(ﾃ｡球ﾜﾎqV%｡ｵﾄﾖa9)ﾉｮh[ﾒ恵ﾚｶe｡}亰i7ﾊF	ｧ6脚f塾Xﾁｭ#眞Qﾍﾏｭcｸﾂ仕+ｬｱﾎ｢ｸ泙s&棋ﾍﾅ蟠ｺｾ$,ｱ｢QJﾐ6k(泌Z~
ﾃｳ･!r贅!ﾔw8r荷1縮ｳ8h}+Wnｫﾏ竦&Wﾀｵ
;拙｡
w｣ｪﾉ
ｸ9lﾝ85
zW$ﾜw^ﾂmK,h*	J]H	ﾊ(ﾊeｨ8<#Fy%ｦﾃMﾃ"oq-歳bIE5I5ｼ逅ｹoｵT4Q(ﾉ｢ｮﾉcDﾀ冥
&]j7yMｸ7究&_ 'Pq､pﾔ,ｳPYｽ%ドｰﾀ_ﾇﾒz1ｰ4's,ｱ｢ﾈX>竡4驛CPjｵjWｮｮfｫxﾕ'ﾀyｽｵ儲ﾞNﾂｬg莊ﾊﾛU_]8檠ﾕﾌLZk贊ffﾃ3車1ﾀ\ｹиr5ｹﾗ3n.O1%礒ﾐkHｪHｫﾈｨﾕﾘｦﾚq!ｭﾙｮｺpｾJ米ﾅj泯u|wﾚ疱(Gﾅﾑﾍ36ﾝｳ廿yﾒ#ﾔ[ﾝAﾊ'ｨT+ЭNz#ﾔ_ｽ株fｺ愕/ﾑ?蘖ﾟ~ｸﾕｭf頸O+ﾖﾕ	1k厰;q v遜ﾍｾﾂｮ##te!R>ｩmhｆI^ｯ推虜>z吏ﾇ儔RmV膰萍c洸ﾑVｿ溷kﾇr|!｣d
ｺ倉r+ﾓﾍ萬ﾂ1ﾄﾘｺ
M67ｿﾀﾞ
W67r%ﾃT]ﾕV?揮z?~ﾖ1z･HK
ﾔ"K*>LR7冩ｪAﾋﾌﾆﾌ<{Y2ﾑﾌ;Xﾜapﾞk嗹｡mﾞｱ剤愍qT*ﾏｨAcaUｼｿ衍ｦﾉソ瞹津UﾝTp掻ﾙﾐv粕ﾈM宝ﾖﾉGﾉｹﾘﾌオyﾇ惧ﾏ:o,ﾄ?IS艚ﾎL曵xｭ4ﾏ浅gﾍ辷棡Kp$!ュ像ﾎW秬"erｾ闌_YWﾉｹ,5EﾅV4ｪk$ﾜ,區-}ﾍ｣{QｧZ	|X. O楳dQW%ｵﾝ｣XVШcﾍﾝ胙｢封{:ﾊxｻﾖｹﾑ^ｶ娩ｬAｫﾍZ=巻悛ｹ臭b/h悽ｹｸJﾉﾔ,Nｺ	儷fｱNV調~ﾍdｩﾉ巉&髦[)ﾔ佑1_ﾛｧ8ﾌﾅEjﾝｵ籀nﾆ<ﾒﾗlx暹M^[lAo｣_|窘U┰｣ｪ脩	蠹ｪ8ﾀﾟﾅｪ\-'p3?ぅjｮﾚAﾞ浜B
_｢"\PK >ｷAﾊ
ｴPKma5$antlr/preprocessor/GrammarFile.class攻mSW~.l\ﾁZQP 	`j[ﾛ
JKxｩ@ｨDｩﾘｷ%ｹﾀﾚﾍnｺﾙX{/L?Ug$ﾚ:ﾓ鮃ﾎW龍}nv	遁s=釛郛ﾞ徳gｳ惨溝0ｯﾈ浬ﾓｰ#該uXTdIﾇIdoY1ｫﾈ:ｮcEr:n爬"ｫ>ﾒW)ｵﾞR:kj雷盡誌奄Tﾇg\ｱMｹﾞ<
芥
ﾊTNﾃｦ-ﾘeﾋ%ｳ(wﾌｻfﾚ6斛奇Yﾎ謾ｱ%ﾍ.蛩ﾋu4ｷ､6e¢ﾓm/掫m[ﾖ､蟠U,ﾙ騫ｧ ｷe&勸Gﾘｦg協ﾇ;1ｹ]2).5∴ｺ6MЗ9棹ｽ`9?-0x^ｲsﾉ寇ｸ閊轤衒･Jq]z9sﾝ&G7ﾙﾀｰﾀ云､'K椦怜ｲ･Cq
ｧ{S:ﾒ3}	=愕JkB	ﾌv^qkｰﾚ7･?[*践7/ｹ讌&ﾙs(捍ｽ]/B+3#&9hﾒ^盆ｦ樣HbMﾑﾉﾌｽPﾋ枅x*\^ﾏ9叮_p鹵ﾌwbｬｸ//ﾇｻ繻2iiHaﾌﾀi憊-I$慶ﾂﾀ$ｦﾜﾁ.爐ﾛ@氏ｫ來(癇/墳#今^ｮllHby(qQ燿ﾍ&:S%桃炳*笋＿$4|e`皮_ﾟjﾎﾀﾁﾀ醸鴛{u	ｼZfhﾏｻF)pｸﾆｲﾜ|ｶﾞ~fｩ$截ﾆ胞餘kWｧ^贇ｪｺｪK罵ﾅ/Uﾀ∽ｫ{.,ｯz/Unﾂfo琳ﾉｦ塾yﾛ-3*0ｾｯﾆ
B5-ｧR^6ｭ諜rｯﾋb=碼乢wﾎ龝[w3+Wﾎﾉ6uｳﾗIﾌﾗ咯5鰡}ﾌﾟｲﾓｧRT｣│ﾔi*S[fyﾑdｦ篠Yﾃ叮ﾈmｿ^ﾞﾇDXMrﾂ溪Klｸ卿T[ﾙｫｵ5ｮ|[ｵ扮ｫﾁN得ﾎﾓ
ｴｧ曄､-;hMｵ ﾟA[｢ｷ曄ﾛA,5ｶ妾(p釦iAｻ	x8ﾆ]?N8ﾝﾖx34側ｮｩﾇ攻｡kﾟυkﾂA!rﾞﾂ9榕ｵUｮﾊｳQ^屈な｣Tｪ
｣且2聰89拔t晃qｨﾑｷaﾒﾄCｿ消1v-{蹐/峻8bﾐa,Zc%蝌i｢ﾚﾖｨz飼s(Tｽﾆ~ZqﾏgBﾇｻｫ	ﾃ8ﾂmG種!ｬ~Lﾑirｧ^8D<Mcﾓxmｴ)>.ﾓ｡C｡鰆ﾚcｴﾒ$-ﾄ_{巌ﾀ<ﾞ5ﾋ｢ﾌ壮勣左ﾙ
}匙ﾗh{●ｫDJﾛQｮEﾚbﾐﾔ^焚/d鑠ﾇ父Fｻ棧iByｷ:1ｮｨｪGﾇ'#ｽ逮0 pjwB澎惧l幄mｫbP)>	癖Fﾈｲ黙ﾗY柮ｸﾍｮﾟb	d(oﾁﾌPKiY0ﾘｬ	PKma5"antlr/preprocessor/Hierarchy.class標kxW~ﾝl&塘H	XJ
巛@JﾁJﾈ%6	)	珞･ﾙIｲｰ;ｳ昊PｽﾑjｽｴﾐjﾕZ憾蓑ｨｰiｭJｭwｭﾖﾋ駮ﾟofｲﾙ,K｢ﾏ>ﾏwﾎﾎwｿ无ｷﾚ6瀰ﾞΕﾕﾘ営ﾒ2,vY
!ﾜFNE^C
F褻ｸ褪о1ｹ8)ｻSﾐx0&濛
鐘t
ﾅc>"tｸ	ﾇﾇEﾊ'T|RﾅV緝Oﾊz&元楪ﾓr矧OﾋL櫺Y渾ﾐg5ﾄyﾑ廩:ｧ窕
ｳ躑|Aﾃf|QﾀﾎxQﾅKa|Iﾃ列_
緻｢t綢ｼ,ﾛｯ蟻ﾟPMTw'Lgｿmｬ6ｬ|ﾚiﾏ:fﾖｱﾍ\ﾎvﾚ8F&c8
ｴ>ﾃﾉMﾓﾖ
8ｦY咳sc#v:ｧ`IQ羣ﾑ>唹･ﾛｹ他q$m珍j(6y_jｰｴﾝW)'嫡ｶｦｬT~宸h颱Aﾁ掀ﾒ胼wﾊ2{G3GLg@萪,#咆控ｰ*:"ｧn|wJﾗﾌﾅ"$.ﾛbDﾖｰｦ9s]棉ｼ$96ｬ磋ｼ憧]PﾊJz髦ﾛ､ｹcｮ孳Oﾓ覊壽ｳ慯｡btn?e請ﾞﾎ覺ｶｰ=tﾚtoﾛS冤ｺｽﾋJｲ俺ﾅｳktQ彡ｳﾃｯ:1hz:T|KAqﾓI

ｽ)ﾓ1愧続ｮﾜN
ﾌ<ﾑﾖﾃ^\ｼ
ｪ狂ﾎｮ!57}･ﾛ｣ﾎ鳬ｩ+Jﾛ v鳧ﾅｷuﾂn{ﾐﾋｮｱﾛ/ﾂ稔ﾗﾔ4ﾓ
U(aｸｨ｣ﾕqｷKｮ趣盍+(陂ﾀ+:^輔aｼ_ﾇ~x
*ｾｯx]ﾅuｼ▽睇:~"ｦTｨ滔x:ｮ祟+邂榊9ﾙ1:4$FWy慈ﾒｼﾅx･ﾙhrfﾖpｦSﾅ/u
ｿﾖ\VﾐTAﾑ>WげV♯犇ｲ庇)1乳處Qﾖ0}!FyH	ﾐ!ｿ{8･ｚｾ茶沍?[Z蛸Gﾃﾘｧ緡ｩ倡亙1ｦ)未Ｖ.:痴ﾓql'"ｵﾋ職ｽFsｭ嚏?xG/ﾄm鞐_"hﾙy9&c0bﾙHﾒ萵0咏ｿ潼ｹ+*Uｬeg2ｺﾈQｶ[ｨ4ｼｽv~ｷ=j%KLbqD%f菜k峽{ﾖﾑ.Yjﾙ貝箱Z垤ﾗﾈｰG+N院v馬l)抃柞旛bZｯE1狼\｣ﾕGp詑5ｹﾆ浙杪53c/Vｴ8c踈ｽXｱsﾓ1fﾚﾌ老楪屹c潘珪ﾖhf	'･-ｩxﾁ1:b艘lﾇﾜU燃c'ｱ<ｮﾅｰﾔz醜臨6鱧"zﾙ?5ﾟUﾏ2,ﾇJt杆"@k+$ｬ｢!#5-D[ﾅｩ語弑cｹｼ呶ﾕ釐ｴ6?Vfﾁu蕾R8_|ﾏﾚ豎ｺﾌE>9ﾛﾋ媾nｬ椥吁
ﾋyfｹQn憮(ﾎｿKｦyJｷｲ*mﾆ授<余2yﾇﾌﾘﾇMﾋ奩葆ﾉOe0(ｯ!wAyﾝuｯｿﾙrﾗｻ変$W
G>ﾂ>@ﾑ｡bｱ幼Pbﾊ,固ｯ*6臼"ﾞ*ﾊﾂr抬sﾀ?k9ﾈsMb｡6
jKuｱﾋX,枳ﾀ_Z+w,ｨ
箱*(ｨKｴ[ﾁ=┰q疵ｸﾕX:4bV`)ﾅJlﾁ*F%鼓ｬﾁQｴﾀﾁﾍ8疫8CﾑﾊW=Fi|ﾂｽﾈ0zﾕX
｢>NﾝqﾗﾂE,i綰ﾉ昏"\Oﾘ~/ﾇｭTｺ温|}ｱ1
斧K8ﾈﾞ溏頑ﾞﾞZﾜNﾌA駲QNﾍﾜXﾀﾒﾞｯ｢Iﾁsh臟卍渚PGｰ禾Y>>ﾏrﾃ:X-攤[q!w!ｾT .｣WQｿﾈMsO崕慌ﾟﾊ菊vｰvv2ﾞｻ=向^ﾞ;ﾈ隣By竓;ｺ
Df$┷ｩ`算#TﾎﾑG}ﾂｽ>ﾇ9ﾟfgｫｸｩaM-
7ｿし\Xﾗﾍﾔ-icﾔ鶸QtKｮhｭ･經o猶5ﾄJ苺椎ﾋc1ﾀZ;ｵLX7c嗽｣a&o〔鄙H糶ﾔ$竕Iｴ%X?
=l食ゐVﾑ^ﾀ-豚鷲崑ｭｽｩ~ﾓ$6'H.Iｩp[Sｷﾈeﾋ8ｨ昼i;h^ﾉZic昴偉ｾｿc%垤ﾃｼﾛ]cixNmC=眇XH'"d{$ﾜd#
a;?ﾆﾒfXｹｳﾈ%4ﾜ▲ｰﾙr't嵋蛋ｽﾜ*).`[17ｦ鷯ﾖ_h|ﾜ5具Wｧ^ﾅ暉B$'wy	｡3W&ﾘ~h|裹躅ｸPｮhmEE1Wｺｬ;ﾆｧﾞ	^(,3Pc('9ONｱN玳x04(ﾃ8ﾃo滉g4/J3:/ﾍ\･餅ﾔｳﾃﾓ纖碕ｵDﾈ敘藉窕F<1#ﾜ/@ｿPK)ﾞGPKma5antlr/preprocessor/Option.classR]Oﾓ`=oｷｵ[)_ﾛ@ﾁveｨ佑/$~\H1ｲe僕ﾒv.Md$奢Qﾆv眺ﾁ并ｼ=y樒惴ｿ∫:Qﾉﾁﾀ＞ﾇ:瘟<ｪ:TTｲｰd=ﾌ｢&k]CCCS ﾙG zeｱ孺ﾛ5ﾛQ炳ｽ法*
ｬ8^ｷ､ﾞ``･Sﾛ釧As8ﾃﾀ:aﾍ-ﾔcﾗs｣'蹊ﾘ譫aﾕ抄x秬ﾐ糘ｩ9g｣Aﾇ	>ﾘ>傳ﾏ運ﾏ叺6ｫﾛﾓﾘvｧ.R嚼[･ｻ6Иvﾌ9ﾖﾂﾖﾞTｨ疸E6'ｴﾞGAﾗy飜l酖ﾈｽ6Pﾀ早%,X善ﾂ磨Uﾖgｧｿ]^:4)r樞/bS`#ﾁd	ｿﾝ偈ﾎ辺鮭ﾍﾘｧ=:ﾞ@-)ﾈ5ﾙﾞB卅ﾞ"ﾌﾒﾒ6Oi<ｮﾍ_/監5>C
Pｴn ｬﾃk(V)ｫ>Fy%ｮ#C\･2ｻ鱗_`ｿﾀ<廸ﾚbｬ;2_o[ﾕ箸
l&H漂i恢(Q囹楓翁X"･{犬ﾈ;#sg^詔
#拙ﾆN耽叟嶽Wﾉ箔ｩY}匙:吽[-ﾒOｨ殤蟲c臈b名>9ｧXﾆX
vDﾜcUｰPKp)lnjPKma5%antlr/preprocessor/Preprocessor.class	tTﾕﾞgL~ﾂ	!$塘  `X$!棚	K@遠'8 ｶ[[ｾUｭV\c]A`い竓kｫｵｵｭK]ｪﾖﾚﾝjmｵｭﾞL&ﾃPﾎyｿﾞｻﾋｻﾞ幤ﾒ7>3=ﾂ2S9AﾀWNﾂｿfo'┸ｦﾂA46ﾒ
Zlﾄsﾈﾄ<ｦpO癰ボNｹT'訛ｾGﾋ#Q羈Q28a"伺d瞬yｩ[ﾆq<,携!ｸW$絅'批$享P雌避ﾈｧ:畚懈 ﾇ0舒`)諸1H9*郎%椴`散,mｦ孤ﾊ8ﾋ	却窒ｳ;ﾁqｬ00 ,ﾄｹ2ﾎ｣虱0/ﾎg蕊sｯ噤｡Yﾀ"'ﾜ暑Yﾀ	.aP｣潦k\ｦ立3ｨ賭ﾖa=ヵV1h`ﾐﾈﾀﾇ973+瀟ﾓｯVpﾗ:[_ﾏ3ﾗ闊ﾄHudlS
ｶ+ﾘ｡`ｧぜRpｳ!ｷ(xｪＢｻQ0｢`ｯぉ)UｰOﾁ
nUtｷ)xめRﾛ
棠澪
椚9
椨炸
椡
^ｨ潸
^ｬ烱ｮめSｿﾏ嵜範|.gp+\ﾅ瀚ﾗ0ｸ銘u2^/dｼﾁ怨｣-践Am0*ﾆ 荼ﾅ"ｧ=ｾ`ｷﾞ0jCﾃ籾ﾖ`U8ﾘﾓUEC=]Ckzｬm&ﾂ$帰G$ﾖ;b｡HO_Uｨｻ7\ｵ4｣%ﾃﾗ;5=3;n6w6o6Aﾓc跏F幡ｮl
く6ﾒｩﾓDCｨGwｷﾑ冒{炉莪Q~iY哺｢zo$F｣(ﾂ靨Cmﾂ'%d皐WO-矍ﾖ｡rﾇX組Y公Bﾎﾂ-[0vHMﾚﾅﾒM幺閧z&妬'盗zｰ;5ﾃﾍﾁh
lFﾎ槲X 碁ﾆ壘ｮhｰｻ;]b嵶NP呈ﾑHﾞﾗ鰻ｭ鰉`ｴc2ﾂ吁u沍71拭ｯﾞｰ,#ﾋ:S黷ｲlｾTﾟﾓｩoﾓ;ﾗﾐ`$JG粨ﾚ:Mｾrxｽﾋｧ)ﾜﾗﾟｫGkYByCｰEﾙBｿｶFls4rz淹|=a埃h､ｿ予"9`.p%ﾁ榻ｰN儲}ｰxｳ楓mX6|l>+
沱ﾏIﾃ習ﾃ遖碯ﾒp
2eaGﾘr_ｩﾔﾘh ﾒﾐMﾏﾙ彙l?}dｰ![ﾖﾓwﾃ%]｡ﾈ0漆秡仂ｷ娯ｨﾞ鼡鱠ｯ*ｼｯｪ
Dﾅ巵ｨ簣x
?･a|箝ｸ]ﾅﾛﾐﾘk*ﾞﾎｳ?c｢ﾗ砠*<将xBﾟ wｪxﾞｭﾞ｣竢^S~|@ﾆU|EPq'ﾓｿｿAg楾/ｲ&ﾄ殴&KﾎﾜV畩xOﾅ]ｸ[ﾅ=ｬS>LReJ
*ﾂ*<Uﾜ居 L=`?Gpgｾｦ､2宵ｸ->N｡ML(ｬ液ﾛU|Iﾜ虹矧Si墻ｷ･L>ﾃ|欖ｱ欸'I?byｯ
3ﾋ銖JBｦﾞM抉Gﾊ!鯖3u!ﾒ齶Bｦ
#寢ｭТｬ站抽/ｳｬﾗ巳ﾉ2ｯxa蛬ﾂ66U>｣ｧﾘ険睹T-|ｨﾂﾓｬ3ｰ髷1椛NJｽﾑﾐVr<ﾊﾂｽ甕
ｱ闖痺萓怪SｼｳﾜﾗU9K7鎮ｯﾗﾜ{ﾟR畉)孱_劇*<ﾇｪ勺躊琲3ﾞ`4HG)聟*ｾ膽ﾎdｫ	ｫs舩c尸

?ﾏ#ｮtR.慄｡鑪ZﾎYﾔ藜ﾝﾐﾐﾖ糯zﾛ囹Vﾕｬﾖ,｣ｸ-1｢ｸｯВ哦ｼｶ壗愈&瘁ﾕKｫｼmK嗚W袋ﾄЫb､["ﾄﾂQ｢o矩=<`xﾉZ啖y}ｶ@ｳｷ553!｡-5ﾚWM P_輒ｯWjC+ﾑ$ﾏ｣兒'Rﾂ:喩ﾂ輪齪α.ｩｧ｣$ｪﾇ｣ﾆ惓
ﾓﾞ欣ｸｽｶｩｱｱ$mZblМI=ｩｦ匿
ﾞFｯ循9
ﾍ5~ｯ衝ｳ:yﾋﾚ奩mｫｼｭk廏ｴ漕ﾚｦｨｶ@m此-ﾖﾒd毆mCｽﾏK=jｰsﾚ脆Dｭ]Q縊kｨokﾈ-z_ﾝﾐ
ﾋ鷓ｭuVｧ隹E
ｿOﾙ;ﾟUﾜ#?13α0+α1>･L愧ﾉSｳ6I謚Sﾍ｡4FﾉﾑrF/ﾗ弱ｩBRC.U[|SP扞*ｷhｺYg鋲ｺﾖｩ7jﾄﾎ(ﾏI港誘ﾎq紅ﾜN茴ﾂk#n.沾ｨﾀ惓ﾅnﾉ#C檀ｨ+ｸ框
v!S.ｪ
ﾝd2"冪ｸZﾄﾔﾔｼ4軼ｪ,S_0立)ﾒｭ:問a粃)|;;WﾐｪGk:ﾌc)V;fｫｨｼ6>續蒔d3翰>sｧ>ﾐ;;-uH｢軋ﾕｭｦ%悗Qｶ3ｮ=*W9R･ﾆ3UﾋR~nｽ,9=Sﾒcﾁ｡#ﾌ#G?ｭ?K{%$ｬｧ､ﾜGu^hSﾃwm8%@墫2蕗9"]1%G_{泄ﾇ白ﾗg,JｩﾓM箕$-;t*jn｡"#m讚晁嚢$qｵ{xｧsn4爪ｨ咐	誉悶0桍Fu2ﾒｨ/ｱ&ｧﾛ@ﾍｸ$ョｯ9^Gｭ<ﾖ/!ﾀOﾔ喇9J>ﾆuｶ&ﾗﾍ･T%ﾔ讌KネT杠ｵﾂ｡g ｿ剞ﾂsﾔrｪ｣ｻﾍﾜ災;9sTﾍｩｭtﾃﾊｲ50a/UT宗..ﾀﾍ･ｵ･Rﾖ>i}浚ｾO[ﾟgｬｳﾖ9{ﾀ>o|笈"ﾁ[I釖
<艘ﾊ@ﾞ>ｭ4ｶ;ｷx劬6ふ@c`ﾇr｡'η9SAv豬#I膨V､rﾒZｺﾘ応8ﾘ@ﾊ	yO (鬚迹顋PHﾔ"ﾟkｿUｿ&ｿ"ダﾔ慟rｩｩC候ﾒ/#ﾆ^ｲ
ﾚﾙJ奠ﾙﾑ)嗤対D粡'EW討kiЭHｿdo伽橙	瑣<#6D殪ﾌｮ'｣m<8宇__XｴSｬｳ=蠍A5D4ﾛ郁CﾘdﾖAt$L72｣ｰﾑ鯆6Qﾈ U0a
#1Yу屋寇ﾀH5ｼID橘Hm冉>ｬｶ{lqｫlｧS､N｡ﾏ｣ﾄﾁ]^q敏	ﾟ7勿g8泅ﾍp+l}姆ｭﾜCﾏﾅ｢j}0ｱﾕ`ﾍ8賑ﾜ\ｭ身HlOLqｵﾍm;圀>ﾏPﾁm湘d;Sｷ昨池7QL8hpﾀ俾;'ﾓ姻1d駲(ﾝIｺﾙ)梟ｩ-6Qﾄhｧﾓﾌﾙd孕ﾎ･ﾑ.「p鈑ﾐﾗﾒｱﾜ[畄ﾝWﾃp3ﾜwﾃ]pﾁ0@Yb'$ｻ(w=P`ﾄﾉ	ﾂ[F	蹄6ﾙ巫ﾙ命卵ﾔ嘴mﾛeｭ瀛ｸhｦ	ﾛ甄ﾋ.5ZXmｸ	ﾙ蟄|ｼﾕ
6L%枠ｵｪ8ﾌｼ
ﾊm{濆ﾃN胱ﾀｬ＜ｷ8x恭`6/8x9'0sl捍8nﾌ-/ﾟ
s0昭ﾃﾗﾋﾀv紀x>ｸbﾙ5vnｧｲ侠li'ﾛ膕E{/｢ﾙ)筏ﾊ(kﾍ$;ﾍ･ROﾞB權IQ｢hｧ ｸ|fｲﾟｽ|ﾝAｵ.zb｡ｷ>zO課ﾓｬ.ｼgZW哥ﾉﾄOﾉｶ萸X揀ﾕ2V+鐵Kｻ:碾jV;ｱ:7鯢{ｸ蠖nﾋ{ﾋ巽絡ｭg]嵐<ｻuV.gr(g顏9ﾓ,99万\j%ﾄｫｺ:7ｫ\b`/斟_ｨ笶,lﾝ曲ok'ﾄa5ｽ$5袰_ﾊv弥ﾟﾞV株衄
朔nﾇ ﾔ*ﾝｹ{`融i}ｽ｡貎`$tﾓｵ檍&欣p｣y*9ﾒ拑6Cﾊ;*ﾝd桾C｢(ﾓﾉZg瘟/ｷR9｣&=.ｺ[ﾜ貧ﾙﾘﾄｪﾃ%C瓏y-|ｭﾍﾔﾖ&)O1｡ﾒｭｲﾈ捺ｪC｣!5ｾ駛'ﾋ4
@ﾑhﾕvﾀｸCH.Tq珥O8ﾆT充干f干J竺$b5ｺ7>ｧｼﾓ?ﾀ_
､ﾚ+括ｯa&ﾁ蔓
ﾐ腰ﾍ閼襪'qﾘぅ4,ﾓq4怛c滷裏ﾁ	 ﾁNｻqy寐=&q揄ﾔ-SNｦ復HﾅV穰ｰ盈 黍C8F乙ﾀ-ﾎ*q>/.ﾄﾁ*q1ﾄ5W@昇b*ﾘ&ｮsﾄｵiﾛ8ｹ鰺｡ｽ5ｿｵ)v耜ｪ7ﾟｹ･ｻX>ｮRﾖﾐﾞｨLj｡崑.ｶﾃq維ﾁ#Jqﾌﾃlﾌﾂbｱ#Mｻﾟ%ｴﾃｳI7;ﾗ|8欧qﾓ^鐫ﾋnN怱ﾋ掏ﾜ諡nｵ,<ｽﾝ挽2ﾍgZﾓ殞MﾂW
ｲﾊa上Lk|)ｴ鮒ﾖN-	{OJ鯀I{"Nﾞ2Hﾞｲ&杏ｨ黝nOﾁ稱ｸG<Og)<+~o姐=|$~_?ﾀﾅ燿糯泙K､ｿS>Izﾍ~+hｺ個N`\Jﾌ､DeQx､ｦ尺6ﾓ6邦叟杷ﾊ6Cﾋ-mｷﾉlk&ｫﾉｦi嵬FｧL贖x<ﾞCﾔ陀ﾟ桀ﾏ]ﾎ=ｽ轜毳f?ﾁt[Aﾄ顎ｩｷBﾅgf慍"淕ﾎﾏｭ>贍?$ｴﾂ/eﾏWf|mﾁ7Vｴﾃｷfﾋ咳|'ｿｷNZ｣ｶ熹ｧ-?Yｳ$rF_$8+ﾉﾔs I $P$P%0I$〆ﾁX%詑ﾆTｨｩｭDﾛI`Wz荒{	BﾍﾔAﾖat箱	ﾔﾙJ猷掩ﾋVW3u3Sw+FS34S/3FEX鮮}ﾌﾔﾗ概麋E&養FZ)瓦蚌DH0P
筑ο#!V菻PI?VvﾇﾉYｲ5Lｶ,4\"#$2Rｶ%%A廷K妙	FK7､J4MＵ猿惰3,)w+{ﾆﾉｱ,漉	喇｡lM湛溺ｧｵｧMﾆ?ｻﾁ=ｿ錣ｧvｸgﾕﾊN7,ｯ陵ﾗ4ﾐﾙK[杳Z擢ﾐﾒｰ悳ｴ-ﾌ+ｹﾈ宕ﾋ溜)L描ﾓ%(秦3%%ﾁl	譏ｩﾐL李ｩﾈLs	!看ｮ<僚p｡ｧｳｨﾜ]ZS\QZ*v裕埜ﾅ粕-)巧+q撚Mmで6ﾁ笞`MｰaMｰ&ﾘ&ﾘ&ﾘHはgwf7(ｩ､ｼﾄ截ｸ,ﾊｹｨ闃｢抽豫%ﾕ【建!ﾗ+eﾓ)Kuﾚ門MI拇)ﾋpfLﾌﾈﾎ力Iｦｹ,5=?kR6X沫泝=ｶﾐ剳汨幀$ｴ)K履ﾛ[ﾊｲ3ｦ9ｳｲ3ｦｲｴﾔｱｲﾎﾋ佛墻(ｦJzｹ餞rｲ衫Iﾍﾍﾈﾖ祁ﾛｲｬ1途'dL對;Fｲ愬0ｴL[｣sZ璃圀)ELﾍﾋﾋ嫋;.ObyﾎB/ﾗ!e}0ｵ,#/]0&kl&ﾓt｣ﾅ4rﾇ6HﾘｦlqoU｣｢g樹鼇ﾇ痃~xｼ>ﾌOﾃ#然I魚ｺｩ%ｩｸﾔpT%Jﾚ啗Q]Yﾊ,掻ﾘ)ｧﾒｵ､ｲ｢ﾘUUUQｩ9ﾗ`髣ｻ?i+ﾜ.ﾝmx習背0ｰqp;｡kN*ｧﾔﾘｨ俶ﾙﾈ:-ｪﾝ%･1繩ｪｺe`ﾈIｳﾑ|Z@險Kﾍﾎw賁	V%袰ｴ､zniI1O･編｢4nﾗ*ｱﾑ"ZﾌV\ZTﾅ膺XYｱｬJvｹ及凉Ieﾉﾌｷ8l\褫x,礦ι5旬+]ﾊrmｩﾔｦv5ю巷%容TnC-麝TAKlﾘﾍ-描%8 ﾁA	IﾏK｢/IpXぅlﾆ-%伽 )Wﾉ剤TM隴ｫ#ｻbj花Tjｩ;ｳ｢RZ ｣俗+h剄盲
]ﾉｰﾒLｫlｴZ蒙ﾘh-ﾂuJｹｮ竓ｼﾒKひﾏ釛ﾐｲ跏Iﾚ]@滔CｨｫXﾖ$湲nﾛﾛ*ｺZnq漉Y汢>ﾓｮeyyﾚu6ﾞLﾗﾛ)鼾t
ｳ6ｱUｪfv<-]ﾎﾞ,ｺ7ﾙｴ^頂ﾅFｷ2<+5\ｺGｶﾄHN4y!IFﾚ`ﾃｫrﾏxdﾟmrﾇﾗ$ｰ\溢#/ﾋｾmｽ摶ｱ3-ﾔ{ﾝAmxTﾎ}E2fｮﾐﾏfﾝI乢ｭ穃cb$p0pﾄﾘpDRz]Nﾞ5iﾃxS閣ｷ
oﾉﾖﾛEＸ$xW$x_Ｄ| ﾁx寅Wｧｽﾄ躓	8"8黥啓\T^.｢ﾏｳT3a%ｮ*zｫrｼUｹ8ﾔﾘﾕｮp9Kﾜｮﾊ｢R朏3ﾘpU.wｺ0殘･ﾞ斛%|颱流消G98ﾗ/ｨ,萼0ﾂwﾝ､ｹ宜ﾋ｣{｢ｻ勢t1ｫ|ｦｰﾙ惓:疸;赫Aｷｻ档ﾊ\29ﾐｧｳｼ跛%m虹".+Z2Vﾙyﾐoaﾈ夕樔薤eｬ堂ｨ錙甥Ov}ﾌxzEiuYｹL^ﾒ妖iﾊﾙJ'"ｭﾇﾆsｻｪﾜ
1ﾉ7S6W5Lﾙ棲4w|h*%^ﾓﾉﾔｩ1G5ﾍｩ&5]geF&ｲG-瀘:6cbﾍ柤ﾍ]>来>ldUﾎbkｰ>ｸﾊEｿ-ﾔｨt-ﾅb髴ﾆ赤aﾃ|
ｰ栽Q3ﾓuﾍ區>u椄VNｷhﾛdW|sｹkYｩf*Mﾟ ﾗﾒjﾝﾏ幇K-Vm}.:STzｺ銭ﾚUﾚﾈ5s|T襾ﾜ p/Cｺﾈﾛ.ﾜﾔｭFQ?hﾔｵﾇｨ6鶉頚娉?ｪﾕaﾂyﾃ'区ｪ犲皇ｨ`@D肌ｴﾗﾋｭﾚ`/~公ﾖ卜of*吏唳ﾖ廉ﾕ=ﾕﾌｲ ｹﾌ\ｲｼ,R[V｣/｣襞ﾘ較蛋ｺVZｦb+ｨC嫋hﾘ恩{ﾐｮ ﾔｨC=-ｰﾖ｡C-ﾂｦy:z,C攵C:{ﾂ.ｵｲ{C]ｽCｺ5Gｺ{u15嘯v壗Mpｰv06aﾄ`1:eﾇ亥D)識｢x|渋d紲}$3ﾘﾉｺg+ｨO!H>:2rﾒD%ﾅQﾒ
=ｷb#ﾌe5o洪d,ｾK-ｭ.0鹵淦,涎?_ﾄ>s拇爿ﾆ聯J蜀f5ｷM彪ﾅﾖﾛ鬘ｮ0生馗 $太:ｓ馮 檪､ｿ滴､⊂&(yV"ﾑｲC"yH"d泥ﾈMd k$2ﾘ@*5ﾟｴGmFﾄ8L菰bﾈ&ﾘePcﾒD$ｭ;ﾖ鎭ﾐｺC6｣{yｼC｢ﾃv｡ｷﾝ ｡@蛛畚FpYﾄr飫9![ｵ補鐃共衛#Yﾖﾛﾕ=]ﾐEｭﾃo$ｪ]ﾔォﾛ{石}ﾏ"m'ﾆﾔ!翅d2^恭uwCﾎｪtS造TFﾊZﾃ3測盍NT2eｭbｧ;1ﾏo?頴Nｽz')?R屬p岩ﾊﾀ堙Oｪb呵q
｢2ﾓｲﾐ~ｲﾑAｲﾓ1鵯ﾇｩ}Mﾝ!ﾚS/ﾑ越kmﾂｼ､j.ｾｻﾁﾅﾉﾎ.n贄收.ﾞ;YIﾒｽﾗfﾘ^ｬ#ｻ敦ｬuk]ｩz廉>ﾎﾔｴV嶇徇ｱ=鞅1Hﾝ"-qN_D檄M"R?｡ﾜ鼇ｶ錯4]iRﾓｧXL8膕ｪi$亡"VRVS2nﾜB｣･b･*L~}ﾐuﾅiｳvﾂWW]徒0･ﾑﾑ{jｱｴ擽F{ﾔoﾕ2ﾕS･館_F;Beｲ朗｡ASｼ槎祟C	彷傴怪柢｢Eﾄ'Z忤irj"DhQs1Q]ナ砕7!ｹﾗ7礙ｿShoD|ｼFﾄﾇ憎dﾒxrｵ札檄ﾁ>県gggｧ%ﾖ|Z]ﾟﾑﾌｷKﾉ
/ｲｧﾈ擔F黹-
Zﾗｻh]ｴｮzﾗ靉ｲ熟ｭ#伺ｳﾍaﾟ+Bｳﾍc寶,*ﾁ\*ﾃZ喚ｩ
{
､ex朷%Z縟5Nﾐｵ|p]GV=R7R<ｭｧ$ｺ曇t7ｭ{hmｦ5|ｰﾝIﾓｽｴ刻ｶGh{弯'mｧ)vﾐ龍得｣g,*ｴ_Dﾒ÷ｰﾝ=稠a扮ﾏwKZq)ｳaｻﾃvｲ詒&s4n､(.E\Yﾁ{+ｹdI广`脈ﾊ#庭~v;ｮ{0FﾖC=ｺﾏ_材ﾖﾆﾁh-fｶ曜ｷ9靂ﾍClｷ釐n/"歐Aﾆ,:"z->7ﾞF)ｽ･>ﾜWｬｿa}Ｖ)ｮ｡ﾘ@ﾀ=vﾑｷ8ﾄ睛ﾛ|I'ﾎ埒ﾞ胄ｸ｡;}ﾞGﾗｻ=f3:ｾcﾜｳ<,ｴﾟ佚巛中.H6ｧSｬ｣ﾓｬ｣3謂ｼﾗAH@ｦP8ｯ5｣亜9"nﾎ766ｲﾜ>]v夥+ｻ厮ﾙ圃鐃ｽY6n=抵ｩQ涎ｲY}=麼Y騒蝪7ﾇﾐｩ_UtOCﾑr&跖罠ﾗ=ﾕﾑﾂ^<ﾚ,5ｴｱ^
;7ﾎ,ｮ栩ﾅa_ﾝ
ﾒt站ﾌﾑmQ&ｺｷG冶ﾊ俸琲ﾁ型Xﾏ諸困vCe溯D$>ﾑ"&b)\ﾄQ､逢AbMﾃ)G0~ｯS2戌J_ﾃFｲa#ｼ抛hrOw5(jw65pL滿*nﾋOｭ惰ﾍHG1E&簀X$紀H軾W侍見"余7+	/ﾝｯtﾒﾝ+].ｲWｹM､渠ﾒｵxｹEｶぺ奥bダ!｢ﾅ槐bﾏaｱY"{.駈bqK0祇%b1;B)nｵｷﾄｳﾞmg粟ﾃWdoP.mｷﾊ;ﾙﾞFｪﾃn焚ﾅ功NｳセwﾜZw冐ﾟaｯ蠱Uｬ啼ﾋ%V`ｰｸﾃa=ZｬF-?鞅ｲ関ｱ完ｵｿﾗ8Vnﾄ聹fﾔ?xﾉAｯ流1T5ﾁWUﾘKzｷＶ# ?'ﾝﾊ"l`ngﾞﾁaｽ鯛Nf.wｰvｨeﾖB端逡ｧｳv/ｳvｳv?ｳｶ漂{Y{榛c/ｰ\ﾋｬ]ﾆｬ
l5ﾖeﾖcﾖ枦ﾖｶ3kO1k5ﾌﾚNfmWkﾏｷﾌZｻ葷9ｧuﾖv3kO3k{匏}ﾌﾚ~fｳv榛;ﾀﾚ-ｳﾖﾝxｰｴk/0k/2kｯ0k匏W匏?3kG亰ﾗX{ｱeﾖz$|ｰ&ｳｳｳ.ｳｳ>ｳｳak/5ｰｦT隸zq/k=)Q{ﾕﾏ董ｺﾕbｿ^]ﾞ3愴6錯ﾞﾛ/醢]P球(ﾒE
|Q･奪xC*ﾐｾ1h募,彭､踉y4Rtｧ造;咲辺HﾕﾇｩｹﾓHﾍ戳*~O]f萩i|ﾊﾕ?gdJ{Tﾒﾇﾊ ｻ2叛Pb+%∪UFﾑI%円RRDG%M81YﾉﾊxQLｳ祢｢Pﾉ.e街ｨﾌﾕﾊ,ｱR-6)秧褪ｼ稙o(ｮﾕO	E
ﾅ琅ﾄ(ﾌxM^ｩ隸SﾂJ庵ﾇ樵Fqﾘ駆Wﾖ｢ﾔ!{ｪ}ﾖ邁jﾟ-ﾎｪﾛ､ﾗ昼ﾁCg3.ｰｸZ(卅RﾟwｲQ嘱5蓋gw{~qCgpﾘﾘGj}嫖`;x9ｸﾋ.9ﾞ!彡｢!ﾊ<ｴU脱YJv･:(ｫｨｫｲ營(ｨｯrE*ﾗﾑo縛ﾅZ{e｣ｸQﾙ"nSw(閲昇Oy\x'ﾄ6･F<ｮﾔ荷庇笘ｴ8ｮ<#ﾎ*{Eﾙ岷xsﾆ+}olj謨~{･溽袰埀休GｷN^陵ｪ,幤 幤y)ｯｷrYﾊｫ豫ｼ
)Gｱ^y聞ｰKy背咄.ｾQ>ﾂI8ﾟﾑ	SN蟲梧ｰﾗT+
S5)ｮmr繽>diｳ_}tﾍ犀弦ｌq<ﾆﾘ~.ｰbﾍ2ｩu)ｺYﾁfは:+_｣ｻ
+? N9ﾉｦﾊ),UNcｶ(?ｼ｡愬15ﾇU3ｾV-A
ｦjuRmｪ7ｰｹo|}｡蠏Fb#5爺ﾕ帙｢ｿﾑ4zｩz怨
Pﾛ!Dｵ｣ｭﾚa麁vA産j間>(Wﾂｭﾃ5ﾕｨｹuﾇ紙ﾜｯﾊﾝ丞ｮﾊ星`eｹ躱､ｽX=ﾝ]ﾂｻｷﾊu+j +*ﾏﾆ開ﾀLuｮVG&5封陪ﾔt<ｨ蔀sj&^Vﾇ(5ot二ﾃﾓv_EQ;ｫ皖ﾕR1泡'ﾐ?ｾi\ｿpjﾔｱFgﾔｹ‖F拜ﾔﾃ鉱欄ﾐ?狒ﾏeｮ釦ｹｼﾄ･慷V.表聹"･ｩf\/縒ﾔa/覧%ﾕ9瓢	ﾝｭ5tﾘ輕砿Z6}曼ｸ/^ｭｱN遑褝w0U鞣{hｾｼ}ﾙ冠ｺgﾙろﾖﾈｭXﾕ`ｪF/>ｲﾔ;9ﾚ;ｵﾔｻ%誦(ﾋｶ徠ﾌｦﾏ{眄B\_ﾆ;%`湎ｩ鋒ﾃｫ+ﾀﾛﾚa駸黜視	ﾙ9ﾘｫ趁椙ﾔ騙U-ﾀu6ﾞV鈞]u.ｪaｺ'ﾔB-ﾅｷjｾW冷ｴZ押ﾕ+慰e､ｪ+ﾉｪｮ｢6鷸槇ｮ翕:遙^O呟
4Aｽ岡ﾔ嬖･ｺ6ｨ鏖u#R｢ﾔｭｩQ=｢pｨ初tuｧﾈRw瑛ｵV茫ubｺｺ[ﾌV劉ﾄ
ｸN=$nRﾛﾔﾄ縄qzﾄ{ｯ3ｶ伽q杲ｶﾊg
V秣V稾隍AuDｫG1V}Nｭ訖U･ﾌ9G綣ﾊj2ｨｿｸｰ"ﾗ忰ｾﾒﾒ墮,ﾚPｼ:beJ?_kFﾊ>Sk"@Q6ﾞｻlｼc8｣~ﾄ|慘麋ﾔN=A｡齬ｮ~EﾝﾕQ･ｫ')KｨｧｨT=設m9cｯ幃Mﾄg&3[ｸ:{sｹｾj/0?Oｿ$箋[+經fｳ彗ｳﾔ#ﾌ､｢ｷﾉﾑｦ 5YPa
ﾆ2Sﾖ嬪ﾘhj犠ｦvﾘgj粧L｡ﾆ雌ｦｮDｦnd6uｧ~ｦ樔03Uｸ)ﾆ_f12ｻ累ｲ70T螽I]Ω｢撻kｪsｮ!ﾔﾘ/埜ﾀﾔ&S?傅｣))ｾ螂8&ｳD7&Xﾀ門ｨﾁ9&.A\ﾌﾁ9|ｨimp入蟾[潴ﾅ5ﾊ|ﾅ2_qL/-P\yA3ﾅLq$SLd奇x)&程4ｫﾏ#k
ｺ僥3掫ｽtｲ
ﾎ{9[薙`JrL-ﾗI~3･3c仭ｴ7e｢ｯi,ﾓ~ｯｩｯｾ ｩ'0U'S敲Rg3ﾅ[璋Z際ﾟ]ｷｹL7城3ｷS俚ｩLXｴｯｾﾚ3偬Lｦ=喫ﾏfﾚs偬邏ﾖ垠n<招豐ｵ鎌ﾎ遉sﾑYﾀtr3蛉nﾙｻqKnﾝﾙ!NｹMC&ﾈ5d且ﾜｮ!ﾓt
劭#5d試ﾜｩ!E:ｲIC跛ﾈ]簫遜5､､$<mL9>!ﾒ売xS*RMYﾈ6藾ｦi:.GｵﾉｫL休ﾕG2酩PK<滷ｸﾍ APKma5/antlr/preprocessor/PreprocessorTokenTypes.classmﾔWsﾚ@;cﾞKﾜk奈(奥┳轟51倹遶! *ﾉ%匸鮃ｷｺ]cl殉Iｲﾃ$ﾌYBﾘYﾎｸﾁﾙﾞlｴ#ｿｳ 4ﾎﾙｸU6Mﾏ稗xｦmｴｼﾐ2j)ﾁﾙ進ｸBjｦ5ｿ左革b!､ｧ魄a[*ﾘSNﾋｲ)ｼｴi谺_J)ﾗｻU~;ﾞｬｳ#.ﾖﾋﾙrp阪8｡承NG
ﾜﾏYｿk蛉NI*4M*§ｫIW9ﾓﾇﾈY槊;*2Н､^匁｡ﾒ0g｣ﾗ･Za3
ｪQpｬFHｭｰvGFﾉZgGZUEﾇﾐYZｳr點\U92	ｲUDg砒&匝{HStﾈ'a{7ﾍY溶禦ﾂ7ｸｨｭｨﾖlｨY:R?ｪ棹ﾎ[3紜ﾌsｦ(
+ｦ`4)ﾕLnt[ﾏ某AVl淤
ﾇSｻlﾗstMfﾕﾂ2鹿Ov%,Q1
K(ｮがｫ殻\ﾇHd鯛ｭﾈgz^奈ﾕ葎ﾘ&篋ﾒｰr4ｺ･nｲ漲6謫1rFｼﾃｾ萵Fｻｪf,ｬﾙZ=瀝ｾ8號ﾐn7CW]cG+h曉>g;-ﾔﾃT倶､g#齦Tﾝo|MﾙGｧｸ5ｸ黴ﾍｲ┝ﾖ
'閲濘>ｸ毋$ｇ烏濂1x忸$桙ｧ曳澪9h栞^$ｾ//ﾃ+ﾄｫ:ｼAｼ	ooﾃ;ﾄｻ]窖}=8E~H~L~J~N~I
~M~K~Oﾖ意ｰN怐qﾎ軋#\ 6"ｱﾛﾄ%ｱb.ｫ?vV押PK_ﾂﾁPKma5antlr/preprocessor/Rule.class攻kSg~僕Hﾋﾅ jo	新[mEQQT*机&,ｰｸﾙﾄMすｪｭﾖ[ｽﾌｴﾓi3?ﾔm;ﾓ':ﾓ傷隸hｼﾉﾂｲv尽=9=sﾎ謠~@ﾐゃ
lﾃﾇBqJ意3粱ｬ辟8ﾇ>ﾁEtﾑ習~ｨ".ﾄｨiB	1ﾇzｫ0ﾇ､ﾐ羅06瘍飄ﾒ週W` ネ%ｦpUk>\~ﾜ甦nI信5｡IMｪSjﾔPﾍ鎹ﾆﾒﾍN	ﾞ糟_&Fｵﾆﾓ*--瞳ﾌﾕﾈ2"杉ｰ淡ﾓC)-ﾎn齷捲4%)ﾁ域>ﾕﾌV44-MGDﾊ因團ﾚ5mtﾆ､ﾅSzZ城椹.｡V3紮2ﾍ珊j"｡ZD)KKYﾉｸ鋒'ｭｨeｸcﾝ､ｳﾊRｺ$-K丈bYVｷ{?%%5}ｺｩ
d1ﾍVc-ｾq-s Oﾞﾊ坊7;_ｼｧ･la=撰H5ｿN^EﾃH	MASｵﾘﾍ*56ｴｸﾕz2kh"}U垰qSebQ_ｺX_ｽ]禀1_ ﾗu\,餔｣ｶ･U1ｮｷdH\遉ｵey}岡ﾓN^h.僞ｱ.･ﾄ櫑ﾎﾃM炭+ｮﾖEo*+簟
v皖ｱSA+ﾂ
"Bｼヘ#mbﾙ.ﾄv9bｩlﾌﾐ>ﾜVp1除aﾚ(JY爆ﾑﾃ截bﾞSI:DHX$ｼ;;6ｦ閃發･|悉
N引ｽ澑Kk"	'ｭ#ｭ･TK%1>ﾜSｳ5?P楯xｬ潭t)xぉB.}*Al碁(ｬ~ﾋn.ﾔ<帑刳<楊Wｲｪ癧ｪB@~ﾋﾕTJ3IW巒ﾘ-1磯\ｼﾗtFKU箏8n%S%壥ｼｬ|ﾌｴe9ﾇVh孟ﾌﾏ*ﾞ瀝F7｢=f6｡掃F2[ｽｫ/ﾂ夭OZZﾏ|褒Sｻ務緑Wﾁ&ﾈﾁJ存ｷｱ&>-	@耆/YLp^ｷﾙｺﾝﾖｶ尺咾槞ﾛ5ｧ4ｯyｨWpJwﾊｹDｼﾔ冴ﾗ青杠賠#ｳﾛf!ﾛg
ﾊ_Anﾊ
Qｮcｺ*ﾐjｬGｭkﾐHﾙDｯ掟=5o入ﾟ)ﾊﾆﾍ莫hﾙKt>ﾗｬgﾖ蛬Wｨﾟ	抗pV8｡;(ｻqﾐﾞ%geﾔﾝ膠9載引P^ﾀ+ｿｼﾌ;ｪ且j:ｦKﾕyﾗﾃ>ｨ､ﾜ&ﾔ燈ﾕIﾋ1z龕x串4-}鑿ﾃ{曁)箟ﾒ2燼ﾟﾄﾟ &-逼m糀ﾐrﾜ_眛ﾟ%-'鑑,ｽ∞｣i"Xﾟ';ﾁнﾁｪ3ｯｱ:ｸ&晴S蟆ｶ_欠
会｝ｦih7Xｿ[ｶ"ｰ
G:a｢'ｸｾ整 ﾇxｨﾄSj/"ﾛ
歯6悄ﾞ9ﾜ*
nxェ｡妍Ehw{Cﾞ涓Iﾂ4ﾂ%aﾂｸYﾂoﾘ津ﾖﾒｰ,ﾍﾞｼ4kﾝ6..ｻﾎZ瀕kd眞錚
盛湃ﾇ懽'S|夙x鋩_痂|-ﾕ)Ｐ･N:司i/伜$耆0PKEmkzｼ}PKma5antlr/preprocessor/Tool.class晃itTWﾝd貯ｯ$5ﾀ栂$Y-a)
｡糠AァZ^fn&gﾞﾞｼﾄiｫﾖ･ZPｻ`mDQ[$
6｢ﾖ｢ﾕｺ~ｻzN症sZｽﾉﾚ=sﾎ]ｻｾyｽｫZ0v縣*q$ﾌ甦A|:qｯﾚUΓﾁ*$BｱCRsJ
ﾃa8ｦﾏ(;2ﾊ├6vﾙ0籾ｸﾚ8a@n\蒄p"投7ﾄh
>ｵｻ_
ｨ眞0ﾂﾃaﾔ･ｨ>ｧhｧ毘ﾇBx<ﾌ侵ﾎｨJﾉ朿/ﾅ*|	OeEJ_UｯL_Wﾋoｨ畉ﾅ<ﾄ9ﾜ7ﾕｭｾﾄs;,1･c8蚊Qﾕ]螯捶ﾖ塑ﾇNﾈ\ﾎv簽6齡cd2ｳﾗLﾋ##"]ﾇF)者ﾕｰ渣pベAﾃ8ﾏ疲sW~hH:ぐ;xIﾃwrcｾｾｯ|Aﾀrﾋﾖ貴ﾒ｣寨ﾊ9dﾊ､(ﾑ鞘cu7ﾃ
瑤ｻﾐｮ瘍Q?ﾖ滑U\bI襾ｦ'ｸ ｰﾊ｣孥ﾜﾃ夬ｵVｲc$!ｳ
я
｢[ｶｫ)ｮﾋﾊｸ
ｫ ｮhx
W5\ﾃO5ﾅﾝAｧﾗUv度Y`｡2ﾒ囀Yﾃ12
?ﾃUtﾊug,･\掖LW靡$kXI劈[
ﾗs
ｿﾀ/鰄zZZ)wX7
ﾗﾍ覇ｫ,[[[5ｼ｡ｭhI･ﾍﾁ ~･甌UqqDﾃ
Z炯升ﾝ&･替O垓ﾕoﾐmK7}ﾛ|N
Gﾚ
ﾞ(kｱ6fﾌ\仕ﾝﾎｻﾙ<ﾍ指曦}[-ｶn{ﾍﾐ[Uﾀﾟｩ疥椌ｸ鮹Tﾝユ?祕[#苫ｹﾔﾓFﾎ1ｯﾛｼs憺ゆ｣]x去ﾑ+3d0棆ｮｩ&｣U厘詮FﾝF6+ｭ､@sc3ｨrm"ｰｸビmｳP1ﾋ!ｻ誘;u祠_A勝&~ｪ\ﾐﾇｱyｪ軆SJ.$ﾓｲx#,漑毆ﾍtｼﾃb揶Nﾕ#ｺ)ﾉﾁa#ﾗm;ｲcﾚﾊK失ﾅ戛ｫ廬$椹ﾓﾙﾒ1Fﾌｵﾛlｸtﾉ_ｿｨ畷ｴ|ｵ`JｺjKﾉｺ虜fｹe$ｫo.!ｰﾂ窖ｳﾗv:osﾃﾕlyﾇﾎJﾇUﾏ薙｣	;ﾋuｴﾎ､NﾕJ酒 ﾏ71xﾒp,移+ｦ)
剏m､woVcｧﾒ叶蕪}ｾЛﾏPｩ^ｴ7ﾏｶB(堺J$]6憚ｮｸﾝ沽ﾄ-ｹ\ﾉ@=ｿpvｳｬ鶴%|ｸ
ｨwﾆ孳A{3ho賤簣|9W@ｨﾇ阪>6｣蝨ｫ｣ﾑﾘ8ﾊ｢ﾍ($￥s訓Xﾊqｪｰｱ'ﾐW4p囿
ﾎｽﾗ陝@Eﾗ5Tﾇh-ﾘﾝ\@ ｪ橙ｭ∠@ﾋ艙ｬｿ5,ｹ･-ｵ｀
ｨ.覽@舷WJ｡6ﾐｰ
!ｬf0k莞ﾏｰzﾒﾗ2zfy+YOiｾﾖ~Pb!1(ｱ4zXﾈｩ,ｲｨﾅｹｬ}ﾑkXﾒｯﾈX:仔鎧ﾀｮﾘkX!pﾛｸX)ﾕu瞳栗ｬ{o=Ja*5憲}*ﾟｲｷｯ<
ｧ"(`ﾌr]wｳｿｸｵｧﾅ_ｬ?\m因_Fﾃ@琲8｣o陟qｫ鐇R@
 z1UK?ｪﾕoﾌ雫eｸﾈｦｷ=,騏ｼヘﾑ\,ｶDjeﾁ巍RZq籌ﾚHｽｭﾔﾜLm｡mﾈ｢
#ﾘ収A vvﾜ臥(}□ｼﾎｽA(ｾﾃﾖｼK=bzE-Q$ﾔﾗUI{ﾘｲ2ﾎ:coxu]*Xｹﾚ^AｫEze6'浤ﾐﾂ｡)l階ｴHp吃ｴ\ﾕ46Iｫ4Rｾ｣.6y^,苛{sﾄｾどﾘ8ﾙ蔟dﾗ%l四+Iｭp[ﾙE鬲橈ﾛQｵ9ｫﾝTﾓvGｩ2ﾂｲ2sｻｧﾛ=ｯ蔬Q>6bﾑﾔlﾃ｣ﾔ+!ｩ$ｼ8ﾛﾆp/lｯiyﾋKﾈ斬G樋8"
ﾎ7PC撰隸	O`'絣4oｻ<迢2ｩRaｿ徐cwGdx|ﾂz&､淞#Liﾏpﾞｳ歡y
_/: _b/s+2x蔽k^ﾗ
釈蔗o鵁6ﾇ0ｹcoN釀ｻ忝輯3ｩ~霏条cn?ﾕ3?ﾗ｣纓:~･	ｿﾖｿﾕ;ｦ=Wﾁ:菎簪:b牘寰ｿs:ﾉ%O2`	f鵤錚ﾒﾌY.Tﾎﾕt｡ﾂﾐCaｺp"\
tﾑP.]D"R衡ﾑ俯4aﾐ尿3"-嘖*慨-4ﾑﾒﾗ碍慱塰ｶaｴ-ｧ｢9ｯ.ﾚsﾁﾄｧ霾9掖ﾑw碆ﾎ牙縛S]9ﾕ喉w=ﾄ楴霰H<ﾞ疊}cﾐ灌0Hdt ｧ1Hb0价鉅"Y鉤"Eｩｬｬ個/0Q粐J;gYve螻_:ΔUV楙鰍ｾ笠曙嵶UﾝO義23Gｫ%D魚反LYｻLT違愿キGZ羆ｵ北Eﾃﾃﾂﾑ\8:ﾀ｡Ht囈xｾﾛG鈔{劬V鴪裴ｾﾄI_秣3｡壊XﾈCi鼈aﾎ烟ｩF0ﾉ 挫(｣､3ﾃ`,d2ﾏ`ラ.`0加dSLe0挫ｦ3ｸHY囗｡瑛MﾌDﾋ枩\),ﾍ弌AHﾋ*,ﾍ/残ﾜ｢9圭O｡ｧ8ｫｴｨ｡<･hｦgｸ/嵬8
=99%朿L･Jfｹﾌ｢｢|ｧ]1ｦWZ弑X短牢ﾐﾌ~莫]啗T倬{@･ﾂｦﾍ受年禍ﾖ.余函1ﾋ牝ﾌﾍ;7ｯ矧T-ﾟｫ
_]Kｨｩｭｫｯ
.ｵﾞｳ*ﾚｫ*_]Mｨ揮ｩ揮ｭ揮ｫ揮ｯ碍*ｾ*WUｹ官ﾊU|Uｮ筬r_吻x祀埜聾:!#&mvﾖぎｸｬﾂﾜｸq･ﾅyｹｫｩT:T"ﾄN@聖$Bﾃ4ﾒｱﾑfx3ｳfｰｶ銅･)凸5B,ﾍkｬz,ｬﾘ3ｷｨｸthq1ｫs[ﾟOvQ.u∠ｺ(ﾛ3f&5t印ﾃ-:ｳ)｡ｹ].ｯ(.ｵpR*ﾉ*06
<ﾊdﾍ峪M}M崘ﾏ據田?因=H,鋤俵冓椴*櫓沓ﾏ"!
w1ﾖﾟGﾊ犹韵A	ﾉ｢ 9%35}4g2ﾗUﾆe6決$祥悚9tU)ﾈzﾑRﾒG::徒祥ﾌH=A)H9?9耄牽C､ｉｦ曩2-頗1=yﾜｸﾔ瞞射､將>坎三ﾉLﾏ爬LﾉD(ﾜ$0}hﾚPｫ0"ﾀ佶ﾉd,T9鏖Aｪ囘"$%Ｊsﾅ颯jXZzｲﾙ篋ｴ.
ﾂ艪｡絣XH逾O5ﾎｩb苻ﾘ)#Bｲ{瑰!x｡}C3fﾍ4>晩PN紊94>晩PNﾙ@驛ｲm%ﾅ4p+喟懦棉vﾄeYsﾂ犹Jｺ茆ｲﾖ惺&ｮﾏﾅ4餒lｭ旙ﾛ:ｱ#vr
wb{@;ﾔ^Xs岫ｭ!;1nqaiﾖ｢h霈ﾂ,ｳ鯑hｧﾈｹf9E椈s芫ｧ((r籏bｮO0'ﾄ\籘奚..ﾍ`a
!Bﾋ:ﾌ
ﾗﾄhlDｱS [.ｳ+K耒ﾏ*儷ﾊVﾗ)Jﾅ|ｧXk彙｡X萋8ﾁ)%Nq1- ｴｳ]4!壌$逞+*f^ｦ曜b儡\ﾆ]\4ｧ[ﾔn:9ﾋｸﾖT収1!*ﾐ{ｫl｡味ﾏRﾓ楔ｪﾖLﾐcｧX!.gﾎW
*T
ｻ+ﾅU垪ﾚ)VQNbﾐｻ8ﾅ5bｵ'ｲ珪｡ﾗ5ﾜﾈuNｱ{
ﾗ毀R^'ｮwHﾊ8勠角蕾ｱ槐H}ｸBｷｰNﾜ霪XJ4ｮ贇悁ﾎ馬ｳ5ｱﾁ)nｷ8ﾅFq+ﾋﾋ!ｻ7ﾓ鼎)咬ｼJRF^N｡剞=%3穩刊p&ﾇﾚBﾟｧxｬUﾉ姜ﾎ$U彈恤[@Iﾋ+ﾌﾎ?4ｬ+ｳpｳ親rﾟ｡&69ﾅf1幄ﾒ束-NｱUlChﾓｾCﾑE･ﾑｲf<)摯W拆TXJKGa宅8,=--}｢ｻ1鴃fpﾊﾄv竒ﾓ鱈,Bﾗﾄ顋s
F'MｳoFﾖﾌ顰｢｢9Yｳhv
Y港jﾇaｩ2昶6ｦｧYXｧｲ賽%	PﾌMtﾗ､h鵞Gﾋﾉ､ﾀﾅﾑｨ97%椈3<ｹyｱ｣ﾅ･ﾑ4O{7,kmﾊ\<ﾗcf紐ﾂﾌﾒ;謦Gc1ﾉ摸櫺RZlﾓff蛔
sKgﾅﾄvｷsb>脅A!ｬ;H0ｻ ｴｮﾅ｡曄X訴Jﾈeｳ4ow8ﾅN疼;ﾅ.ｧﾘ-｢ﾁKLtbOｦｸｬ跼b7.qｷ{@舍幇悁4ｽ9並ｾf冕ﾐ}ｰ1ﾚ淬r僉9rﾞ ｳM籌`C愿 哈%粐ｸ	ｸ緞ｦｵop秉愽s'sｪБ)0Xﾈ`η0ｸ价R0ｸ斑21Xﾎ`νｬdp+\ﾅ瀚ｫ\ﾃ`5ﾎ啼=wn\ﾐﾂD>O仙ﾊﾎ*,莨.uﾖ1ﾕ寓ｩﾄ_;ﾈ`Y柮9甼櫟wｫﾉ皴貌ｫ!ﾅﾓgﾌ&!ﾗU\/-ｲrh昆^樹q､ｼ*f[Zｮ就ZｶSﾍｽhiJQ4死k[ﾓﾆ｣ZNｪｹ?h樽途悸ｰﾖ楸ｼR嗇$!ｲｪ"王?&橦%圖ﾕｰ"霧ﾘS笵｡"-ﾙﾚ王6ｩﾘS:ｿｸﾐ樊!楴6.ｭ]鬥35ﾇc羊Qﾝ垂ﾍcRjLXPIK^07AfJ9鈿I`=Xuﾟ耽u Z｣<%%YｹlKﾍﾎEｶi｣3ﾓ2BﾆｶY-秋ｹ,翔~ｵｷo翻&[ﾃ+ﾄｮ5鵜漁鋳ﾘﾆ勵*Y･ﾙｳｸH既ﾐｳ0ﾟT
ﾗｦﾝ>gfUｿ!mTﾃ&ﾔｹ卩O*ﾍ└ﾚｲﾕvｩ5iｲ齷7ﾟﾒ囹ｾaﾈﾆﾘR~FG嵬ﾟ､ﾆﾆﾌ=l量(*｢札ﾖﾔvC昿踉guE
ｽIｭ托\覧:_Uﾝhnｬﾍﾜ笋lﾒ	ｫ09uｴlｧ摺K狗g\/AｭЪghｾｧﾀtj更$qﾃ告ﾁ*lGZﾇﾚZｾjnﾒa#ﾘﾃ迂1碧儷R苧K3ﾔ呈裔ﾅYYﾅﾉ･E5+1SFﾄNvﾘ｣@`l	ﾑ Nbﾚ,19ﾙﾞ-)#(鈎ﾇﾐ慶8ﾖ爵vﾜﾕ悉ﾙqw;aﾇqvﾜﾓ施ﾙqｼｶ;cﾇ}ｸｷv徂ﾇx'ﾙ`;bﾇ釐qｲHｾD
ﾁ
ｲyﾚﾚ}pRﾗ ゆvdwｸ｣ﾞﾋRﾁ｡尹Sﾀ	蹉Un
ﾃｧｧﾃpｸMｲ=Pﾝ-+@ﾔu仍#隠蝨娼ﾕﾊw=zh1T~,蛹ﾀ宋ﾊ']ﾜA?ﾆ､煦ｫgﾗ
ｯ
hHﾁE!｢"C	紫ﾎ0ﾁ$惑elﾂｻ椶dhS(g帆H??TｵﾏT*墸@ｰq`$茸tﾐ"Jﾏ ｾｲﾍｱm磁蹲8愴ｦ	舟ﾓσ,孔産-ｽjﾍｹZT
ﾕfQｵ<ｳﾚｪｵ瀚-BｫﾐjsｨZｾYmｬ]-
$Iｴ妛ｴvK惚tｦｭ[ｮｼCﾐ紙ｧﾔTｅ$ｵ．ｵﾂ\帝｡瓩ﾐ条
&ｮ4.諭謁ｩ3ｾ
祟懊KrlId44"8滉ｸa1{	ﾕｸﾚﾀ･ﾐ泡WXAsrｸｮ$
W他ｮｦ牒ｨﾄjzz-･ﾖRjｬaﾜ冤ﾖ｡Di-ﾏR4込ﾀﾑﾔｳﾄ
ﾘWﾖ彫ｾｪ)冥ﾌw7]ﾙR`Cﾘ達GNｻ･
艱雌ｼ0ｰ婉*`ﾈF聢sｼﾐｩ*o'1BZ%ｽREo藪-7BﾏG[+ｱ恨L+ﾑﾝA$匡s嵎6sM苹!･ﾎcCﾔ%>#hｮl0ﾘ甕.靡Oﾘ	}ﾀ.H=d胯単ﾑ<ｿUﾃA$､ID韜Cｰ6･ﾇﾑPθ|`	K8IT､ｦｴKO
Hjﾉ@uﾙY-ｬ妣2ﾔ2ﾇﾃｼﾛ螽$ｽ巧ﾃWFSD癆{M9ﾅﾎ3･呟gｬR疇ﾐﾂz譬室#GTﾀH粁抃←e､ｦfe4=\SｹWﾄu*独科Q0ﾚ%ｶﾛ匹ｺYﾏﾃFnWW｡ﾌ
罕6|ｭｻﾜｮp?	060甬|ｬYｼｹuｦc}%ﾊ索4ﾖOC<炸/C2ｼB巾､oﾐXｿI尭;dL蔀B8N腋.窄{p|@ﾚ!氾Gp?|/ﾀｧ	|_ﾂ|頻晰-ｶｱ#内Wｿ曽甍,％ﾕ沾(ｻHOﾂhｶﾝ､'.5	ULﾔ0Qｷ$Iφﾛ&2MｱｾJﾐH)ﾓwﾒｪ+ｼ{拡g#ﾔﾆﾓYi沚Bｦﾚﾖｹ群諄Syｴ(ｭ&$(fjLLtD9桙QFY｣n覿Lg忠ﾘeDN2ﾏ｣ﾔd3必ｩ)fj･ｦ圸q爆fｦR)u｡Bｩ馭ｪ･.2S])鋲ｦﾚQj冕Fｩl3Nｩ剩ﾚh:sf|^-g尿ﾜ:bｯ<｣娚ｱfIRYBsｼc闌孑楊
Mﾂ7Mw,ｶｹA~
RlｶｫﾃXly閧b(a$,ﾇﾆb*6Yﾘ\ﾌﾄX窓ﾝﾅeﾘK\‰b5&ｰ昇屑0Q<鴻･sp､4ﾇHﾅ8VZHﾋq超
/銚`牟gH{0[:3･ﾑ#=嫉ﾒ8K:宍･1_ｪﾄ9倶8W印e7.y^,ｧ
y^.g疔y	^'_k5ｸNｾo煎磅jF|佃kﾇﾉ7
HDｰﾗF
Lt`b5*ﾋ0ﾚﾒ紳eﾘﾔｭr*ｽ晟ﾈBﾒ瓶(
-07ｰﾎ^c%uｹ0ﾗAﾞﾗ`視iｼ{ﾛﾎﾇ疱mﾇ|ｧf`ｽ撃+ﾕﾍ3ｵﾜ疱ﾅZﾏ
懆d珥?!ﾑi''Gｷo役,tｲｺ2假寶ｼ]U>徇鮎ﾁ/ｦv~15ｳﾄ濃碚ﾈ｡bﾚXELｫ}bZﾓﾂ 1厥涌N	ｶl9%ﾘrJｰ4鑼*ｧ0亡XU9-
辺禹$]^悧B沮>KNYeｰﾋｹ､ﾂvﾀﾌﾞ&5>ﾈｷ緝;貔&朦_UｫｯｾN\ﾌ ｱOｰ-峙*躁觸q.fX恬秤ﾜ銭}惱2ﾋ烝鴬qG^rv､Uﾓ･ﾜ'ﾍ鶸茣::ﾇｷﾘ/*ﾝﾈﾋｪｰﾏﾏSｽ*ﾋｽ1!謎cﾅ2ｸﾋｹ｢*ﾜ1ｪ~ｹｽﾗﾅ;ﾌｬﾓｭ1ｧH虎ｩﾜ2h緕\iｭﾉAﾋ&l惰｡説Z$oｦEr#-長ﾒｲﾉﾍﾐｷ@kﾜ
ﾑXヒ;怫;=x'ﾜ興`?ﾞ
^xﾀXﾇ |ﾃgx偬沼O(￥｣三b8>,ﾇﾑ/|7皚ｾ｛纛o<ﾑﾟ/榮遵─?
h酸禁崎衣応閭?緩(ﾂ?ﾄ褸ｧX補!ﾄ釘OM<'ﾂﾄﾇ｢｡術頴DID玩Ecｩｱh"ﾅ頑R宙坦DKi｢h%Mm､E;i｣h/m擂mﾂ-ﾝ/zH8駲ﾑSzF耽	ﾒ	ﾑG｢ｿﾜT深堰rｦ,OC茫"E.ﾋ尭HR&_.Fﾉｫﾄhyｭ#ﾟ)ﾆﾊ鵜1^~SLT\bｲﾒDLQ嚥飩K俗$\%QﾌRsﾛﾏｮ']ｴxp悪!Lｬ禹h/ﾖ[ｬﾁbaｺﾘ稠(ｷﾀ:q+ﾜ$6Uｯｳ{ｽ$ｸﾗﾍ爪ｮD6ﾏﾌ^]ｭｮVVjｧYo;V3Y_6=ﾄ｢ｹ秤$§ ﾉbｺ､剪*
$M禰X)5OH)R営舐ｾ+5HｭﾄoRI:J甞'ｩ態Yj%ﾅﾈｿH]伴)ｪﾔ]i(P"･s&ﾒyJ驂･沐ｪ巽(C･駄Hi2UﾊP6K纒;､	ﾊni｢r殳ヽ!MU.R捌s/･|薑ｩ@M*T%ｩHuIsﾕｦﾒ<5A*QH･ﾕVﾗﾏｲg_ｯｮｭ/ﾐuIｴeMSﾅIﾐ屐ﾅVｱ2v3｢)ﾛ9V紡ffﾖｸ壤ｽｲｲﾍﾗ@A4ﾖ｢3UB亢HK!BZ擘ﾋｫｴzI+ｿｴﾎ憤待U0^ｺ.醗〆ﾒj(醗ﾒuｰLZWH濟i=ﾜ#m{･嫗ｿｴ貧#ﾒ&Dﾚ存Vt滲･ﾇ-ｿN,$9ﾇｦ[e^chu烹hｻ]8稷ｷ+ﾋｵ､nﾂｷ+ﾙ5ﾙLpｻｦ:ﾖﾉｹ柧ﾐuﾙﾄrｸﾑ羲`gｰ@O[ﾎ9VｽﾃｳBﾛ拉ﾇπF症ﾉ]8ｹﾕ`&ﾗﾛCs{hN.ﾇ6適
M｣4賓｣ｩｼ;J{ｱ峩网ｱ殳･ﾃx呪ｦHO`ｪ$ｦIﾏGzK､｣bｿtLKｷ8,}*皐汢giﾃTZｼ.}OVｲ?居･_ﾄgﾒﾈ.R#ﾙ諏ﾉaR_ﾙYmz_葹ｶｶｷmﾁﾓ;銚mIm[ﾒ6heｽU癪:黯偈(%3ｾV琥ﾕ[naｲﾈ頃ｱﾜ粭賻On	酲ｭ`ﾜfﾉm｡@式ﾖ,l&ぞujp/,hｩ橙ｸGzｺﾞz､ﾝ#ﾝｲﾓ
>ﾍ艨ｲ=ﾐAｶ:ﾈ@ﾙ樒
ﾓ8>5+獅uGiFY4ﾅKｶWｷﾇt[ﾖｱ|Sﾁ:=ｺV^z｡ｭｼﾔ衆ﾗｴ*tﾌ捉GiOA;h浩ﾑ8#ozﾙﾄ/Wr$T､ﾊlｩｱ2G蓋
､~Ja5ﾛ0=卜pｦ[ｶﾁｱC"{ ﾇﾝ喧夙ﾟTｭboｻ姪ﾖｶｴﾕR挧ztﾝｹ\ｰ>桿ｽﾃv'clｷｱ蘊em躇矚ｫ
ｪx椰ﾝ痙ﾉvｹ墨ﾗ ﾒ灑ﾘV袿`ﾍWfbxｽｮﾍTﾀ甚(暦\L\BI貅~J-|+\D`;ｵﾌm址\$Yｱハ瑶尠o+ﾌ欷G{-d=ﾂﾟA絖Chｻgｯ}V倣｢
ｺｪ-ふg|ｴｾｵCｳ竒Bﾃｷ!4ﾎ4┯{ﾖﾚｯﾕFﾔm醜KｼｾS/s::hkﾞﾋﾞ奘ｲｷ貎ｭ9ﾇ龝臺cｾﾎﾊ]､ｾG4Sﾊﾄ蕚ｷ暾ｾ懶辰pLワﾖ7v~VS^h/ｿθ刎ﾐvﾏZgｻg|tWs奎.ｭ穎ﾒﾚwy:z$ｻﾛザﾗvﾊﾇXy|hｲ･籖ﾋﾀm9ｲν 埒gﾕｷ､Gｺ#oｪ*†9ﾉｵ城57	>ｶｲ憔rｸ=PJ&縢9YoW踵ﾟｮ苙ﾆ･gｾﾜ]ｿKﾏﾖ-ﾃﾊ瘤*\飮kﾔ蛛賜宗裳艪ﾇｺ[ﾎﾟ;瘧ﾏ	W|N8ﾚﾞ･ﾕ執Bｰ2湎艷/とﾊR.ｶﾊ%0PｹﾎS泡ｪr係V@屍,Sｮ簿-蚫xWｹ	ｾR6ﾀOﾊV]ﾙ'[(waｴr7参ﾁIﾊ^ｼPﾙｳ瓶\ｫﾀ;･別斤*螽ｴ^yUﾚｨｼｮ*o)(o++背盤ﾊ1:藜蚫薑eｷ騎ｮ*ﾊﾕP^Tｨｲ｡ｫ琢ﾗHmｩ6Vﾛｨﾍﾕvj+5Q昂ﾏ｡T舘YｦﾆｪcTｷ:AｦT胖jO}ｰﾚKｮﾆ#ﾔ磅(u､椒ｦsﾔｱjｦ~ｷ:^/W'閾ﾔ戒ﾃQuｺ字ｭ､噛g韭l#L挂Dｨ掲jｱﾑB]`Dｫ歳"#Vｽﾘｩ.5ﾆｪ惇eﾆ,uｹ1[]a,UWﾋﾕ+光*uｵ吸暃ｧｺﾖ黝､ﾞh･nrtTｷ8ｨe紗鶩Gｮｺﾛ1_ｽﾋｱTﾝ聒､ﾞ聒ｮｭｶﾕﾈﾟﾊpﾛ
ﾟ
>ｳｯｶ}Fｮｰ;
ｷｹﾖMｮu亰K蟆3士}ｵj%ｯ_ｹ拉劔`?筒E(qｦ黹p斯ﾎWほﾃPｬ>Wｪ渉u澡沼~ixP}ﾞR气肚ﾕ､俯嘲ｷ袍`)ｶﾜmｩﾞﾉ;芟l^V_｢>ｿL}~
"ﾔ7iPﾞゐ1HWﾟ=ｯ~3ﾔa愈ﾉXｭ~Zｭｿｳ溏j蒙ﾈCX殲･棚6^WﾈｪOｰ?ﾟﾌ./ﾜXEﾓ寵程M8m
ｯﾒﾇn?C耽w娥P|'(>
ｬ絎I[凝{qa/#ﾅ…7ｰ~g胛vﾇq}?sｵo｢原鯒ﾙ耿ﾅﾎiﾇ郤]]ﾍ%ｺ渺ﾕﾝLp3勾ﾁ{ｽ:欖ﾗﾉqm!溥ｧﾐﾓ欖ﾗﾔｿｻ>ｧ6ｷC|{ｦｦk+ｫ･勸宣ﾕ`檄=八ｿﾀbWXｪ裲歸ｦ++ｲﾀ?jkLﾒ忸ｭﾖｯﾗ\x｣ﾖoﾖ壹>ｭ5[業ｵv茄	ｿﾔ:聆ﾔｺ簪Zｩ%(m｣6HUKﾐ2､Jmま\,Gk3蒡Zｶﾜ[)衝r	Zn5咏ﾋD
%ﾘD6ｼJｻ
g-ｯｷcﾋυ6Vﾕ3ﾌｫ｡ｮ/ﾌ;K｡ｦvﾏZｬ施ｼ0ﾔ6瓷Rﾒﾇ^Jｺﾛ?ﾍﾒﾉg9c4ﾐfC6hｸRｻWiﾋHY/'e]Iﾊz5nﾔV畴m-nﾗﾖ硼ﾚ査Kｻ	hｱ\ｻh[Em;ﾓnﾃｴXｩﾝ!dmg5E懦_ｫ{"ﾁｬ
}/址電5$N牒ﾝ
靜鶫ｲ澆皋{｣5L|諱ｲ ﾎﾈｸ｢跂ﾝ{點ｼ[砕dｮ{ﾇｻ蟆7P|_!∠	>nｺｸ映&踵+ｶ9ﾓ[e@ 餘ｿｯy0(4傾AぶWa{0(Tﾆ{OWﾆ罩HｩOJRj皀Wｷﾖ%ｷﾞiｩ鄰fy邱ﾔ挂=Y8 3'pﾌ@ﾘ4Kﾘ改茅j[藕""p竺ﾇ弃幀9｡ﾎﾜ0護ﾐ.ｲCｻﾉhｪVﾚｽﾐ_+d>ｦｭｲｵ`ｩ0ﾑrqP{ｾﾔ桷oｵｧilｧ=蝦Q忰ｽ希ｵ7q咢^｡ｽ耕ｴ/	+|A;；ｵｯﾉf}j?設ﾓ~ｧﾅ!(T].]MuMﾓu属"Sw逆ｧﾘｨ7蚫#qPo"ｾﾕ寞_(qRo!izKﾉ｡ｷ閉Rgｽｧｻ･ｱzw)S!Mﾔ､iziﾞW濶ﾒ}4W$戊C､幺s､MzｲｴCO鐸ﾃ､ﾒ;H驀=M:ｩ叙%=ｽ-昴ﾟ-ｳyxNｰ-mYe湶ﾁｿﾏ*}! ﾂｮ^起Zｴ({t從W圸ﾋﾛ
茆ｬﾓ'Wﾞ禮:縡函ﾇ*UXzS`~!Lﾓｳ"}dｸXﾏ＆,ﾘｬ鄰ﾘｫ酖}.ｼｩﾏ%ｭ~	rlｪｯﾀV蝌ｨ_，+ｫ稿ｾ,ﾇﾙ'?銃$wdｹgﾛ ﾙ=	!ﾁDL3/ﾌｼm陏旁cｾﾋ<莟ﾝﾔi欣2/mｰd愉M紆蝮ﾖﾗ+uZｪ
8Lﾅot楡監

4ﾖoｮzｧﾟS-0Wﾟ
寓2ｸ\ﾟﾗ;`ミ;lﾓｽpｿ~Kﾟﾏ鑿ﾃK=pBﾟﾟVw＼ﾜG_ﾋ	w}~qｻﾟ罨ﾑ/ｿﾜｾ5､]`
ｩｱ塵Pﾕｾ薫G走"ﾁU/Tｴﾞﾛｧ'Cz亭#ﾔ5@(ﾚGｨY唇wN~灼O｢[n7鵆iﾐﾟO#昨ﾃ4ﾂaLﾗqｸEｶ鶲ﾒ:B縄i8ｮ?ﾏaｴ<ﾆｯa:ﾒﾟﾀs7"m韵TBEﾂｾｧﾊ7ﾍ南_ﾘ8"斷3!ﾄQ敖^voﾇｽyﾜEq;kﾇx*cfP8ﾀ#ﾀ?	ﾀｷｪ)lｦPJ｛6,p象UhｺIﾗｻ]ﾅf稻ｷｫﾔL,sｻnﾗ3Q炯蝌甥ﾖ|?ﾈｴﾝV/ｽ侈ｨｮJｿ畩鶸逐:ﾌ2ﾍｯｿpｬｿpｭﾇｨｴ桍ﾓｵｮ束z｡nWｼZ-u8D	ｮ~ﾁ舉_i5ｷszo'ﾎh訥.8ﾍwi|@3#ﾘ｣
褝gｴл	ｯ濛[xB手?ﾁ疇7xCﾞﾖ+=6?4dﾜP潭ﾃh4ﾟ傑ｧﾑ｣v7喞ｼﾑ'-qﾑﾑxτ	w1佯5{｣fF｢p迥cc候Eｩ1B,6FV娉E#趺r5*xFE%ｾ:S!ｵ=｢1ﾂ荊h`d@Sct02!ﾖﾃ拷診\ﾂ\ｿ_ｱ=ﾏﾛhｯ0fﾃ1爺ﾉ枕矜菱.ﾍ}ﾌ5ｦＣL｣6/6ﾆt｢X\ﾅ鵙1(ﾎ$｢呂K槇xｨ^gﾅ9D1(ﾅR?ﾅDﾚ ﾅm謂$｢ﾐ露rc8:火!｢ｳ｢ﾖI=跂a囂瞥k褂ｳzqq$ﾑYY+/%挌夷ｳD迥Z{e=z"%｢reｭﾜ惠7ｯ7ｯ抬j･巧扈Sﾐy玖ｼMtｮｮ偏ﾇ火ｻDgUｭt~ｪ火GD逧Z鵈\ｯYﾑ懆ｬｮ偏ｯ｢ﾑ9:^橘,:ｾcﾝめ'ﾝ?/79i"Ri"cMﾁDﾆY嚠ﾇBчYd"s-D6繕｢佇jQM腱ﾑLd｣&ｲﾉBﾙb!ﾙj!a&ｲﾍB&Rf!&ｲﾃB佇ﾒﾐDｰ莱ｴﾙm!&r羅42遜-､ｱ嘩c!MLdｯ45挿ﾒﾌD
cFｳhA｣固人\
｣才a干faｾqｬ0ｶﾀZ6ﾘlxa粒*口瀲縷xﾙx消#ｳ<ﾊﾆ+aｼ［慶ﾘﾕx游P?和|Cｭ^毋ｬ?PK<ﾘ､<,4|PK#ma5-antlr/actions/cpp/ActionLexerTokenTypes.classmﾓYoﾚ@ﾙprAﾒHOﾜn#ﾋbﾕﾘ朕､}ｳ\dUI羨@ｪｫ｡ｪｷM;凧ｶｿafﾇ3+~揶:ｴoﾐkﾞﾊ9AO壬ﾕI6_$ﾙ0洟9､	AM閇ｱ'もｭu濆]SNPﾑｲ･JyAH{=あﾉﾘ偏@ｹ(ｨ,暝ｼｺQ扛がvﾇs/Uｬ,ｨｮ.ｰ?低ﾐ泡ｨﾂA
yｲ丸蜻*ｾ@wｴﾂｾr
仏諍+假oul覦uCﾐ牒^EｧC+遣(rz5ANｫ唏鮎櫓ﾖ怏l`zﾀﾒ#mbﾑu｣-俗杓Xhﾗｻｺ｢ｸｻｸ講c=/ｰtlﾟ.Rｧ]ﾕ~r2･ｽ｣q*ｨmG椴Kｿ､39杷4掫雌ﾏ旺=ｼxf&:en示Sｿ鰄*0ﾇIﾑ>ｧ｣^=UkjQ儒PZ｢"l0伶2s^fｮﾂ5ｸﾎﾜW燮&:ｼﾁｼ	o1oﾃ-6ｴﾃｼ歡>_`ｾ_bｾ_aｾ
_cｾ1ﾟo2ﾟＰ3ﾟ2w`廿|漱旋傚	毘戍SﾓK}~PK｣%PK#ma5&antlr/actions/csharp/ActionLexer.class}	xﾅｲpuﾏLﾏﾉ	5l法[ `[ $H"ｨﾂ	ｲ` 瓦 l
\8お!(xqｹ額篝瘋^7T\ｮ
yU3sﾖ$ﾞｾｮ･ｺｺｺｺｺzｦ鈕･縵@7~ｯﾎ;ｱ,姦0ｬ$ｰ澗
背#･nﾒﾙﾍ0ﾘ-吊JmVXCuﾖXG`ｽﾝﾎ ｰﾀF昊騾ｶ果*tｶﾙﾍﾘ
昊蛟谺2vｰhv7q＋)o勤ｼhﾋn｡戔(g+［ｧｼ
@u5｡xPg93ﾛ畫ｳJ剰lｧﾎv9;ｫﾒﾙn=ｪｳﾇ靄8 呰ﾕﾙHbp@v=ﾜ軈Oｰ'茄S棣ｼ:({ﾐguUxﾞi｢"eｿD瀑ｯﾘO澡ﾉ^｣uｪ/ﾉP蛸7e､ﾔ對z騎oSﾕ}u｡dIｱd$DｲO%Lｲﾏ%Bｲﾃ筑)ﾙWﾔ?ﾔkﾟHｭマﾇｾ霊庵~`?J菩gｪ＼)7譱.ﾙIYﾇ$;Nｹﾕ茶膈r.ｹ"ｹ*ｹ申貼予JnH<p'？
.oH)･｢ty#ﾊi4y｡M(ﾕ飛啣ｭX苣7'ｴ｡-%oEZﾒｲ(ﾕ乏(ﾕ曄)ﾉ;O ÷奸g*B+］迫H;｡=(疋'‥ｽ名丈}%'ｪｫｫc?L\^m,ﾊｯｮ~7〔Bｯｮ>ｾ0+Gｩ6V	l湮晝Ef山
?LｰH?猿R-oｳ禦ｯyｩ(ｪｭ.ｨ<ﾞｪ｣ｬ2s秡_(至窩B9Mﾊﾛ}ｬ>ｰﾊN\齏!
ﾇjｻHﾇ}厭fB)$ﾒｸ>J･H`《	､L 畋C	#0愨FE 涜hYｲ	!pｱr8淆8搶ﾗ:泛"逍冨Jﾊﾇﾎ-0位ﾌ+)/*K$lpQiｬ碁OY^yiｻ<ｽt喩ｸ/8
K<ﾙs<X62蝟1pﾚ#z蘰y%s2J
J4ｵ斤ﾋKKr}X+bry,OI而|rwmz･EEｳ愼ﾂ籐E宴ﾋｱJh!XRﾖ3Kﾁz`ｽCｰ>!Xﾟｬ1ｨ｡h襲4)&｢ｽBﾑﾞ｡h蘖ｴo(ﾊUR(WI｡\%rﾊUR(WI｡\%!Wﾚﾂ陳ﾆﾆgﾎﾌ尢郵埜2=1ｧｼｬｰdz*Uｫﾕ｡	ｨT鄭ﾃLﾔｱｬｹﾅS=eｹySI[#Qﾝ2O済:"匁5V=*(ﾌ.-+ZVFﾜﾆW>ﾖ点:}ｽ4ﾟ3f六D暃ye%佛兢ｯｰ41｣dﾜrｬﾉ+6ｫ6
索膊漠ｹM|]嶐ﾏ-(ｰ窩辨K=e93ﾊ<ﾓl馳ｳ害篁G@CL3h-G0eQ恂椦増Eﾂ僣mｵ笨ﾜ
C"ﾅi9ｹ3r屡&ﾅｹC/!ｲ8={陦Yｹﾔ:'wlFﾖp｢8}DﾚX郭ﾇﾊ@)櫃0cﾊｴx\ﾚﾘﾉi99ﾃｱ悠7=;屓沾=娘2ﾉｧ孔B&∨C3Z]D FL｢Q幹h`罌｢+2ﾉDIj4ﾓ研淘ﾔｰﾌ4ｳﾇ慘ﾉ!Fﾂﾔ筍9$､!ﾃ3ﾌｶｳB0idXv0<)'眇ﾂﾞax0ｼoｽA?ﾝﾃ3zg$gﾏHﾏ樮;<｣OxFﾟ継N督9M
4)慱､pN督9M
逕神d(%椁#ｧtnYｾgX!ﾙ容uﾌﾗ斎*齟oﾉZkﾞZｸNﾖ
%0ﾂﾉbX'kﾊ9Y+ﾖﾚﾉ'ｱs擣k;ﾜ^Xk尹-E;袖､<ﾒ8ｸﾂ頂<ｳ8'ｿ神D瀉'淮ｧ8y←<ﾟﾉｧ|掉懍^濺宴ﾃｼｹｶ蝙@ﾃ	dﾓﾑ|XZ愨ｬPｫ鮮ﾋ;t>ﾃﾉY6Z.s(sﾋG莽儔NVﾗﾉgYN^ﾄ:y1/qｲ,弥茹|ｶ点ByeｭN[ｫｫｬﾒqﾔ&ｭｨ|Xi7Mﾘ!/ﾗ\'檬C慫ﾎeﾐｼn[ﾌc髄ｳ渓mhh礎｣ｷj^桝TﾚｲF7AﾅN~)_@彑詒6ｨbPｵﾋi+t~･/ﾂｲPJl,6鋺*~ｵ桃!ｻﾂﾕﾅﾉkｨ%N~-Mv.ｵ:洟ｼ/sPﾊ,壺ｰ
_N稍Q}ｨA[鸞)ｿﾞﾉﾚa轄｣)5朿･|莞W:*~ンﾟﾈoB7ﾍS[)Zｹ%魯黼TOﾍ｡"Oﾉ4-ｲjzｬ]T滂ﾛｵ2ﾏtSﾖｴﾒNﾖ⊆曄]O4ｹnﾟ^7;-|
Rﾂm#W邱:m|5ωﾚｷoWRZ7/ｯｨpｭ浄s糘KKﾊqﾋsｲaｽﾃｰﾌﾌNﾖ践櫃`綱
_規ﾝ.宏$0陷7ｷdVI鵈頂2@穡ﾕMﾍWTZ:+oｮj､]賢 ﾏﾒ柎｢ｯu16'ﾗﾉﾗ=ﾝﾂ)7{6ﾝ筥[嚔a∠ﾁr?r1輸;ｳ0ﾓS2ｽ|F\jﾜ茫(q｡M┸}慢ﾂzﾔ~ﾁl徐U	3Kv疾栗6ﾁ$深jiIｼEｶK\Pg]ｭｼ'清L'ﾐb=*吉HｴUｾ8ﾄJM+じB竟'ﾟﾀ7:掟涛WﾍN)ｻm姚ｴﾝD爽｡w;Yg嚥ｩ悲Rｱ享ｬ+･ｺH$身*Aﾗ¨ﾖ斷$0ﾚﾎ 0后2襄"唇hoJ!ﾐ諭?)ﾄOL$澁潘ｬ{ﾖiﾁﾉ
ﾙLZa8ﾙ,J(&PB搬l(#0@9∋楼潦\F灑	\A濳\E瀚	\C`	實槐k槝g4Lｳプ$tvLV~^I	蟷OﾖﾌT0ﾒｨ9~Aﾆﾊ3ﾍuｬﾔｺKmﾎn,ﾛW
ｫ=u&期DﾕeｹｭｻｸｻﾆﾗｬGg8Tvﾚ銭椛-}ｺ就ﾜｲ3ﾌshyziﾑﾜb\6死[+｣ｶCG骨l董7ﾇ薙)刄ﾆｷｬﾄ^闡a^ｺ>w6[ﾙｦ#7ﾋcﾗraﾛｰ艦簽LDPMK^1@f愈9ｧ｣I`/zfﾉ=8蹟hﾏ9yﾓ争Zn.ﾖwDﾋﾊﾍ6ｷM(B*2mﾔ:ｺY冑Mｧｯｹﾕ(2=~RzFg*希ﾊgP付ｳﾄ3ﾟﾚ}ﾒ_孥ｻ<0廈Mi｣Z<ﾌﾎ-x2p%､ﾖ}鹿qBｭM5ﾏ%s-ｭｩm財-'4ﾋT六;3ﾏｯTkli)$ｺｶｾﾒ*2ｷ@k:ﾕ2嚮Zn@miｻ5沸ｳｨｳﾖｳﾋJQ'ｬﾊ靤瞶搦./屁o
忝%ﾒ28C<ﾅ梺:т3剤P'hｰﾊ=>ﾛﾑｳﾎｹｶｯﾚｻt倥及荳ﾄｧ嵬萠3ｧp:ｮPK|這怜逡･風ﾗbHj･/'広mYﾎｱﾆ*0ﾆモ｣ロ1ｧ=a､ｳFｱ嘔[;ngﾇｸwｴ縱ｸﾇﾛqｻｸｳwｱ羂vﾜﾍｸｻｰ$;iﾇﾉvﾜﾋ施ﾛq;kﾇ8ﾅ狐ﾎﾄ┼
ﾕ|ﾚﾊｽﾘﾎｻﾅﾝeｨｮｻ@ｸcﾕ]=LRa61+ｧ@6nﾃ%ﾇﾒA\嫖;璧@sｷｨ=ﾐﾖa謗B
劍独ﾗｨﾟyﾈcｰy鳶ﾘﾓ1J:ｹwまﾆﾝ煦耳g*握*h庵!ｪ
｢ﾃ	鄲8内P嫣嫣|呈｡1Lﾂ彗譽`ﾋ邀｢R詐ﾐｴｍ｣Q鄭)條|蝗s3ﾜ&怙薀8&讎ﾉnhﾎ遒ﾀl6｢貿ﾍｨYl-ﾍf`ｳBｳYF-ﾍ售ｳｻ｡exｳYﾘｬﾈl6ﾒn	該酥&ｭﾜﾊ.hF拱綏ｫ0o/ｴﾅ駟ｷﾚ(5
a	Jｭ?R-0ez	ｴ2ｬ1各祿Dﾊｬ/ﾖ#mﾛﾁ2ﾙhe 官ｨmf"
ｪFｱbtｧL/6｣+VOpﾞ攵ﾐr/t杼Oﾇn頸5}4oFJUAﾗｷｪＯHQB	ｱ麩頌Dｫ>=ﾗC｣ｽ酔yOBﾏ斷k7~b/Aｼ
~O ﾗ恬+ ﾅｼﾐ	_I&N)ｶ$ﾎE9^鞄ｰﾇ}ｶｸZﾃ片AgX渓ｸ"e(ｯｰ誡ｬｱKWb鵲Lﾝｷﾂﾍp7ﾜﾆF#5(z`ﾋ3
Mﾇ綻,G乏{ｫzｪﾒ[3ﾅr?ﾐｿﾎh6ﾛch■･ﾝJB:ﾅｩ^鐇	ﾍ&U0h=DPｹ^｣ｩ娉糊ｮNI/ﾑ亶zu寓ﾐｽﾐ･%ﾟКｦ%NPVﾗｽ6ﾁ稱p桂3｣Nﾛ
餠0Qｧ呼ｵpDﾀ
p瘰ｻﾃ^C*lG
uｮGPPUp9FQ>Bﾚ"ﾚ凶擴ﾏ妊Nﾄｩ埼o	;QTｨｦxｺKｦ$5ッ.ﾀｶdﾄｬﾐ	侫2ﾔﾋT括y甍ｷﾋQﾃQ#ｼｽIﾃ氷゜DPﾊｽ	梨ｰLifx瓲ｫVd4ｷﾊ8Pwﾈ*e損ﾏｪpaｪｩY｡}.ﾗﾔ将=A:dR"ztdya質ｶ武mｶ3邁苔菱M0ｳ
ﾆxｱ_.ｷ+ﾒﾏzr%傀Hｬ~杠ｽｵuｺsｽﾚ"|鋺Y罹 ^~
ﾗ!
嶢Aﾔ7qｮﾟﾂM秕4&ﾁ|錏C懃汁Bm*甦x>|疚
~oｾeｾcN8>ﾀ小さ_4nｿｳ1+…lｯ｡'錏DlB=佳ﾕ
ﾒ蘭ﾊR4未ｳiI'ｧｧ5Mh|EﾐL	)ｬ;膜N頑UﾛZ**!ﾇ?WJ瓜wﾜF｢;ﾀﾀpｦﾟｴﾃ!;ｧO7廬Zｧ>"LEOAaﾓ)寅昔青" 阪	邀Pﾈ\P~ﾄ･x惻5ｲｦ<5耨X湮ｺｫX~-K+X2ｿ糯ｰｾ鳴_`圃l､2粗+3ﾘ･晃豕忍lｲr+屬l`yﾊ]lｪr?ﾋWvｰiﾊcｬ@ﾙﾏｦ+oｰB蘊6Kｩ:+QｰRｵ9+W聒\5-Pﾏe掠Cﾙﾕj6[ｬ使ﾗｫｳﾙ*
vホ
ｻQﾝﾌnVｷｰ[j偃ｱ>ﾓｭBﾓﾝ1ﾁｦ[蕨肪ｰK臆f･C教4dXk籔(評ﾁ懣鐫ﾔ弼(	L貅J(
ｮﾗ孛ﾑkｽﾚL録ｼ 沂fCﾘ&ｻｧRPiﾇqvLwfﾗﾋｸ礫ﾝｱhｶｩｷ+ﾁﾒR'ｭq)NﾓH81樗ﾈﾘﾈ!ﾞ[eｴ
擘s眉ﾖ綵ｯPｨﾞG貞Po叫ｭ_LM-1eTｰHwｼp1ｭﾓ
沽ﾄ4?HLｦﾋ蜩Sｲ-ｧd[Nﾉｶ恍m9
89Eﾋ)ゆ*ｧ疵ｺｴN9)ﾋj蒼R謫L]ﾈGｪ櫛(uﾏTWﾑｭ<[ﾝﾎﾇｨO ﾏUﾟ聽Dc>Aﾄ欧%ｿXｴ甦E_^ "斫ｼPdYb/Wﾙb
+ｶybｿT<ﾋ"5ｿJﾀｯﾖkｴﾆ|I栽?ﾇｷ綺ﾑ<ﾟﾃ壟ﾍｿQｪz$_竇ｾ疇nｻﾚｿﾓMK'_:hﾀW@;ｾﾜﾈoa侘WC_e|-ﾜﾄﾗﾃj~{慌鋺Gｴ=ﾋGﾝ4ﾕjg/d奄9ｪ･ﾞ*aY`ｷv垠ｮVｿkU?ﾝ託&ﾃﾃ7篳ﾄ僧ﾆ^hﾍｷﾀ9>H觴!?鮠ﾆG`ﾟ	蠑
ﾝ5Fwｾtﾙ｣ｻ5xtMpt挧ｬ!｣D｣;｡ｹt截>'ﾟεﾞ凝ﾞﾃ~8gpﾘﾏ縣_+PﾈC)VﾗｯC銷e[!ｴ扉｡Kﾛ侶
r概z{磅	.ﾇnX鯛:ﾅﾗ Y9鏖ﾂﾛvﾙﾁ鰌
>Z?ﾚ!ｼｼｶｼ3~<僑ｶｱ摯ｾ渡7}s~ｲ昃ﾟ
KW4ﾅ$cｦsly将ｪ煕 ｧ坏Cm泪ｿsｷ}^ﾌt｡y4x
ｯ ﾅRｻbｳ｣Az尺!8}ｺﾁG;隣殆ｦﾃg1ﾔ6ｶｳﾒ燮kﾝﾖkoﾗcﾃｽﾇ恊Gｿｷkr'ｭGM>5OVﾓﾝ｡~｡ﾓ'7Pqz｢ﾛｸKｽｭ{ﾇﾟﾎ#ﾜｩ>~7鎔y'ﾃｼ締畧t%Sy5ｧ(|ｲ｢i癌ﾅ竿(/Q"3葛W｢%堊ｧ4*M!･]iｧｨJ{%R鬆4R:*-逼麸骸0･ｳﾐ.｢｡ﾒUD+ゥ健.ｺ)ﾃEed娃ﾊH1Jﾉ*迚
JｮｸW9_lSﾆ烏非｢J$S&ﾊLｵ2KU監Jｱｦ(%哮)ﾕ(ｳｵd･Lｧﾌｩｱｻ樹ｿ9ﾋｷﾟ怡ｼｻｶｿ:｣%qﾗ4MW&A|Xﾕ*ﾈﾍ暗l/XY册郎9ｵｿu`e/Ｉﾖ}ﾛ晩UP襤2(佑排%tTAg*陦\
}斌`ｰｲF)K痞e\ｬ,ﾊP｢ｬｹﾊ*X､ﾜﾗ*7ﾂJxPY
+k`ｧｲ朿ﾖﾃﾊｹｲ｣lｬ!|禪[~擇?*ﾕgﾎYcl冉s8K｡qX芦lｷ+ﾏuYﾜ艱nW嗅｢呷钁M6ｨnsW	7=^ｶﾄ/ｿ|､ﾙﾝ棒v=C	ﾂ正ﾂ拮ﾇﾎFﾏﾁ98ｾﾙ麋&ﾗﾘﾓq|ﾕﾟv6	ﾍqU煢Fﾙ+^&僵y5Rc-=ｬｵｲ瞬P杼摧ｲs風X薬
_ｩ莵)oｵﾊﾇ|途衣･贔/ﾊ7藜^鋩ﾗ?ﾊ1詠\｡ｲｫsﾔｵﾍ>uｯﾎhXﾊGｩﾃu8泛錫惇他BﾍｷｪYA5幢Vﾇ=j.zSｽH碎ﾅJ:Y嘘ｧ(ﾍﾕｩ鷁ﾕ｣SWｧuh.Q鷆8KDOZﾑW]*ﾒﾔebｸｺ\\ｧｮ7ｫｫﾄｱIｽQﾜ･ﾞ*Uﾗ笠qPﾝ$ｾSﾑ悴W飢ﾓZｨ[ｵﾔ･｡>$ｨ;dSaﾙ\}VｶR_反ﾕr穿ｪ｢ｾ&Gｫｯﾋ\ｩ鉢ﾕ7褊鷦nmｹE}_nU?飽ｫ_ﾊgﾕo艸yXA~ｫ(Qｪ嫗ｨ5:ｩｿ]ﾔ?倦1c啝m\"ﾀ/亞Z(ﾆ頌ｻﾊ入ﾇli4ﾘUﾇ?ｮﾅ=ﾘﾁ鰌
>Zﾅ硅ﾚp_^}ﾂ悦ｨ/砕
ｵ{ﾖｯﾏ]･ｷV	kﾓf哢ｦｶｬ["詢柢Dh]ﾈｵｷﾘJXｸa熱ｹ:ｸｬｳﾟz>+8ﾝS襯hｆ[!｡｝ｲ/ECｭpｱ#｢Iﾄsｧ靆基ｼ霖{京|ｬHEo>K絳ﾄ ｾE觴E:ﾟ.ﾇﾄ0ﾎ?1ｲﾆRｻﾐｷﾔTﾀKIｼﾔ:nﾞ
ﾖﾍsZn+,ｼF(ｫ#Lﾅg)\VKｿgｭRﾐｱ^VNq＠Q|x/ﾋｷｯOﾟ&ｿﾝ>hﾓ
ｽjﾞfﾒIﾚx'嬖頻G`梱ｳﾖｿｽｷnBcﾛ畭妄鈩ｰ､
}c
iﾞｬｹﾎﾟ壁AvRﾙ柆_枢ｵc^z吉ﾟ{ｪ+ｮﾟﾑｸ~ｳp氏(妥ｮ聒*1槹$&ｱﾕ磽ｶNｳ;E	ﾛ,ﾊﾘ1mﾘ?ﾄ|愃反"ｰ2々ﾈ~Wｰﾟﾅﾄ"n悪x嚢ﾌﾄ5(ｸﾌ毆ｮﾔIﾂ悦ｨ/3ﾂ={討ﾜ5ﾐ>ｻﾋ泛贐1?ﾙ!8}ｺﾁGねjﾋGﾎ3ﾂ=kﾗi!N|b'-{ｷ^ｦ-黔m竸:E~ﾌ漣^ｵｩﾒﾛhlR_cｿmﾟ蔟L>5ｿ'ｯｧｮｻｧT魃蹙贔蜴1ﾒｯﾀaｱｾｯﾂo穹ﾖJｼﾁz狭漣Zﾟ+mﾄ･｣QYﾑ@*嚏ﾟDsﾍ)Zi.ﾑ[k,jmE墮QLﾔﾜ&ｭｫXｯuwj可ｫuﾛｴdﾖW<ｧ
ｯhｩ5mｰ8
kﾃﾄ'ﾚqmｬ湊ｿ､斎ﾟﾐｲ7ｵｩ;Z｣6SU+吊ｵRﾙO-j諒畛ｩﾍ謄ｵﾋd」･,ﾕｮ7kK舂ﾚｵrｭｶBnﾔVﾊｻｵUr久倒AｻYｾｪﾝ"ﾟﾒn董kk臑mｭｯｶ^ﾗn7\ﾚ戳ｪVa婆wｴ{桁ﾚ}ﾆ"mｻｱNﾛaTh僻ﾃﾚ.%mｯｩ､广肇ｩOG+ｮd}"ｷﾊﾃ瀋}мｼ晢Ftfﾝgｶ済9np#ｬS'Lｭ┰*ﾖﾆﾗｺIｵYs･{ﾍｸpﾌT?ｻ楞eﾞyﾖ^hｽ輕ｯﾃﾌﾔﾞ2 ,ﾕﾞｴwﾀｫｽ;ｵ`蒸!ｼｭ}hjHq簔ｿ[Y+Ηﾘﾝpgｱ擱k,!enﾂｰ8,d疆<怛t;ﾁPﾃ0ｽV･QﾛS録	ﾛｭGZ
ｴNqﾓ9ﾀM11ﾛｶz2ｽﾕ_ｴzﾌ鱆[)^ﾟｱｾｱ圃ｺkg=|列S報!R謫Rﾇ爆錵陜x%xFｯﾕA刃擘&ﾖ}辻咸xe漓ﾐVｲｧ<[Oﾒﾑ鰰j馼〃Z'!J夊愈ｳﾐWﾒ軋虎_|}?ｺ5A~ｱｿA岷ﾕﾟw}|ｿBBiｩVﾚ鸚+暄oｷJ?2ｷ)WJｮ,投rｽﾔ俵2Bﾙ"*ﾛ･KyHﾆ(粉咄ｸ袈椁-eKﾙJﾙZuﾊ8uｨlｯ^,;ｩ2Aﾝ ｻｨﾊｮ6ﾙM}D&ｪUｲｧ們｣ﾕ隋廊 Eﾌ
腥%ｳDS-Zﾊ1｢,膈ﾑ_毎ｲTdﾉﾙ｢H哩Kdﾍ屹檬ｰNﾒﾜ珎ｪEﾈIｺｽ$[	Ьﾙ鉤-:ﾐｼﾐqｺ]勗Zﾙｯ寞jｩPdV蕨U錻HKｳ|<授ﾒｴ稜c;納ｿｭt=視｡)
{Dﾈﾐ@^QJ)Aｹ.潰ﾂｹ蚌ｸ\^K腴ﾘ WﾁｽFxHﾞｻ舂暴
ﾉ;瘉ﾜﾌy/k"ｷｰ猛ﾋR膩6Hﾖ|-ﾏel鬧犹l懋止ﾈ-皿先ﾖﾅ人"ｦqVﾆﾙ6OM賈骼7`ｯｿugoNﾗ	ｽxФY踟j^HﾗwZ_ｶ斷ｾTﾁ意ｿ竒(｡ｱｬばr7菠G瓧ﾌ飽ﾃ\#氤奉yX#_MexTｾ祥ﾗ瓲/xMo蠢瓱yｰｸ>`NdAｰｸcPﾜ;穽ﾓ養ｾ_寅ｼ勾･卓璃ﾛgﾛ,ﾍ	}ｫ广ﾍOb`~:斡	伐ｺﾌ?5｡y>=ﾐ電｡ﾎBq>BMлｺs;wﾃ(3rKｾ3ﾎ8ﾃp?ﾁ&ﾈﾏ`ｲ
臑X'ｿ;藐ｸｸｾﾆE
| ｿﾏ蔔,Na	7(ﾋﾈﾟﾙ`"1小k蒋W[ﾙ醉ﾂ獻n頬ｦｦ倶犂ﾏ囂ﾚ准楷ｼﾖｻﾂ7lｷ筐v啓3[q/;mﾇ}B/a蛎ﾐｷ.ﾀ
e韵苗ﾘ钁葺NﾍunW劔X舸副謁nﾗT3Qv永ﾖozﾐ&W.ｼlｬ5(/ﾋoﾚzVﾁM~;ｻﾔogfN`g俟ﾖ_9ﾁ_ｹﾎ醴ｸ}|覺ｭｨj｡eﾚ箋M匙O犒$ｻ｢~|eﾖﾞﾏｩｽﾂ9-ｿ.ﾕ"

1ｰﾍ傑違*｣1ｬｭﾑ銃)en' ｽ=c&ｨｨ>c&cﾌ
ハDﾏp&hiﾜ荊JtﾚtZﾑ1NBe547ﾖ 編:ｩｫ保
ﾗ:ﾇdｽﾆｴ	ﾇ&a娟-sﾒ~z)=3F弃跏ﾏﾌE冩(ﾃ口迅ﾙ	h?hoGﾚ鞅"潜､=ｧﾎｿPｯﾄB:蛄ﾒyﾉ､ﾊIA:WﾔI逑zI､s饅Y遞>ｫﾇｨｾﾆQ}サﾕﾉﾍ粫rﾒｹｪN:_嗾s:?#拈石ﾕuﾒｦ^ｺ;ﾒ,ｮ鳶w｢S
-tｮｩ鳶凧ｬP閣ﾒYR'Eﾇ@:川Zｶﾔ｢ﾃ>6!峇晒x~ﾞ
ｿ〕ﾟ@6!信dｲﾙﾀ@vP ﾘｪﾀV%ｶ*!ｰU	ｭJlUｵJZTZT9!;&caﾒ紆ﾒ9募E･ﾔﾑ｡z沸¢傷 亨ﾍ3Hｩ2濫ﾌu慕賺J甫ｧirLｺﾈｯcｪZ]i!螳ﾅe蝠i裹B;zﾒｳ]eｩTwﾚﾗb0Gﾖﾓ!j祗ﾍ//･(ﾖVｾ｢ｲﾒﾅK*)ｫ+ｿﾄﾈﾚﾂ濫ﾊ溽*7b[zｪ6ｲ十RXh%D{2\ﾋ]9ﾋ],ﾈJ卵E/u-ｧﾒ.ﾆzHby{PAｲ(IIﾍMﾏﾊﾂ&ﾊｪ%9ｹ敵&崇莫ﾜﾙ鮖iｨHInﾚE陸fM趨+J鈕fｧg拶PJRﾇｦd?7;-
A*I%靫段ﾉ粕ﾙ)99馗ｨ○囎IE'ｧ詛e喬罵
5fｧe､儷随骨F脂A谷ﾒMﾏ	BrD紆1CEﾁﾙ5:#+ﾅｨ1'cｶｷ!%8ｹ$-'UiTt｣｢G脂>.(ｺoﾄ'A ~`?(逢吽,=}#G$G$G手1 8b`pﾄ煦燒&ｷ4!ｸ･	ﾁ-MniBpKﾅzﾄ[+#ｴﾞ亡ｶ､ｼﾀ5ｺH,s1觚o15Iu<3ﾔ懌<ｵc+H?;2肥(｣bGﾘY"ｴ#G晄q`NeQbZrV之/竣快&ｺｨ4:ﾟｨ:)ﾚﾎｱｰｳ〕雀
$
ｱｳ｡l鞍弟lng#ｨlNｭ6gﾈ._奄&ｦﾒja&"ｴmd･ﾘQEﾍﾎRﾘH;KEZ8Z]YRYT?6ｿbA･XdlKｳｳﾑxｱ搓acﾔﾄt6ﾎﾎﾆ矯F+F'ｳｪﾌｲ)E｢LJq裴ｲrﾑJDｲL稿ﾙﾙDﾑﾅIﾘ｡MﾃK/B7ｿ5ﾍ\Kﾋ'A:褄ｽ燮ｨmpZz棒jｻ:ﾕ%ﾛY6ﾋ-ﾏ6ﾖ/｣_ｶﾉbｦｰｩｻﾈﾎｨ廊Rﾂaぺ1ﾔﾎｦｱ騅*dV;崔f開fﾙﾙl｡n#Dｩ!9,ﾟﾎ謦拝ｸ(ﾊBm'ｲ4sX寞ﾐ<｡#E1ｱ*ﾊｺﾘ ﾚﾙ|ｶｴL
i｣Dｮ4AF疹ｺhｬﾈﾎ2圻2-盪[dgﾅｬﾖｮ｣ｳ22ｲｦﾚ1\罵!ﾈ]ﾊﾈR綏jﾙwｱqIﾑKJ楓-+.ｧ}>囈}nｼ鞣ｲｲEh2E舶泉蝗4ﾏﾕｮ｣ﾓｳsrlｱﾀﾓL.F/v偏##｣銚ｹﾞ&G	rWs苫･X┛F｢0\･+ﾄﾌ橄喟T;$:ｰ臣m銅ｹ@D'G犠FT%(ﾞu>ﾙRﾗｲhslb,J1躓LlOｳ満F|ｱYql/ｫj;Nは$G18ﾓ b$"ｴoﾀf截\1嬖ﾇ
	竜
;ｫdKl)[fﾇg9MS/`[	0ﾊK9Vﾘｱｵ有%B8ﾎ士Dｨｭ DB;j/HA:
!r(Hｴ壱$H冒;輝Aｺ
ﾒM扇｢Z/嶋3ｾ.冉ｸ'｡ﾚ+8U.$O進Ld 3%ﾈlA/ﾈ\A
'K殖Aｲ@"A
ｲH臣AJ)､i`63ﾟj｢1ｲ&奄ﾒRﾓx!Cｯ"Ux屑-ｦ*lSRt>ｬﾏ脈e凾Aﾙｳ.$	7慢W侭1ｴ崘ﾔﾍ'ﾎD､ﾉb,ﾍ/｡fi=
､-2ﾝ8ﾗUｦ/)｡ﾙbYﾍ4\ｦｱ[殞_'&ﾝ4ﾁ遥翳
W辞ｴ７･ｮ犬Jｲ紀f､ ･'S/歓9"3ﾙ焼ｱﾜU癨ｬ,#ﾅ4Sﾅ勁ﾜUｹ､ｼﾔ夾｡Afｱｶd1Y蝗ｿﾈe蚌Pﾙ遣cR鷏_NSよRb8+*ｶ\|ｻﾉ逝CBV9ﾃFX\	Dｮ4:9e詛d貢ｫ辿ﾝﾌuIｱ.qV23ﾍ`O&aﾇ鎚ｴ倬ｩ鮴3轍ｫR胆Yｰ@dI5h9,6ﾔ､sﾌNﾝﾆﾑﾄｻ"[10[ﾔs3ﾆaqnｹﾋ逼s#ｹ痺c#a}ｺﾝ<關ijｻ`3
m小ﾋ8浬ﾙeeﾔﾎz｡ﾅｴ16;ｳ=麒lzｽﾍj&ﾊ轄ﾍSﾒﾍ腐梦BZｱｫﾄUZtﾔﾌwi8aﾐﾎ廱J･ﾋ3ﾅs;ｩ_J6｣l#(1ｩﾆﾛ+*頑ﾓｴ1e0ﾘ<ｦ<ｿ､$ｿ<･ｲｬ､框^/ｾ3}\ｧ｡刊zAﾆ3d?>ﾙ昜3a@吉jﾂ､&/JﾘJﾟﾌ媼ｾﾃﾃ,?ﾜ[X~薑Z~Kﾋoeｭ-?ﾊﾛX~[ﾋog-ｿ蚰ｴhﾋd-ｿ句wｵn戻ﾝS{`ﾑX簫@6+ｶwﾌ;HﾎAv:3J>鵑B$ﾚﾒﾈ
vaTｸ%傑v0R羃ｧﾙP拯k@雰ｱ	!ッza:ﾎ檸'RL<ｱｧR粂鱆<閇ﾀRｸｭ’ﾎhNﾎA.ｬﾂs｡;L6Z}-ﾀHw窕ﾓ(&ﾁ[|ｼｷ=Tﾕ/PjZﾕ'ﾙﾌ
fSx.ｵk16p,･澑姨16-Aｫ璋ﾒXﾌ7忌ｫｧXkQ,ｪ枌ETl｡Qｬ=ﾅﾚbmAｻ瀉ﾅTｬﾄ(6ﾀ*酎､"旆A鞨$晞阡k(t｢硅|ｺ接Jｴ研6ПCsｸ賄ZNSｲＳﾄA4	處ﾕﾐｶdN炊諾ｺ
ﾐnhkﾂ+ｻ蕩{dｸaS-({ｬSｰﾎσﾃ
察\梠?｢1PﾝｵｻDｨz
~-I闢%だO$ﾉQS精Z×$$`ﾀG` 50~ZmｬＹXｾ獸CっQ癪ﾉD嵐Wﾐ ｬ､~_B%.ｰｺﾀWﾐ\[Gｪr5!\C2[ﾋ畛BﾙH96ｷ6ﾀ
ｰn;`+ﾋ 0q0ｶF&ｸ露=Kｪ!d-Ybｹﾗxy'@r]ﾈｵ%ﾗU抒
uCｪ鈍0､Ej`ｱ#ﾜﾐ-R庖｡sヲ^ｧ｢ｻvkﾛﾐｧﾗ1鞁種ｦ)ﾓ(ｳﾗHﾉ3ﾛ42Rｶ)ﾏ;ｩ50J,D=|3取
ﾀN‐
{ﾀwBpCｸﾁ}ﾃﾘOB}ｦﾀﾔ!#$ﾎﾃ$､#$ｦﾇ漓x彝0ﾅI√i(B8[ﾂ:F｢"5･#ｮOX<ﾙ'ｩ砌$cZ鋸騷尽
側ｹ疇瘴vﾃ1ｧﾃVcHcﾝpﾘﾀpﾄWﾑQDﾈｹ屹彙ﾅﾒLwﾃMfｮﾐ*hcｦﾙｪH若緞`ｼ	S痳餤
Fc8Z8｢.堪	nﾊr8｡ﾞVｫLﾟRL#{ﾃﾓ臀m)ｴ'4
ﾛ34lG｡<痒
/A
ｼLﾉk4ｴｯﾓｰｽ内mZﾞ‘
ﾙ4dﾀv'
鼇Pﾃ汝朋^/-7q_ﾁｷ-r#l'ihﾂas!N1ﾛOCL<~7ﾄ5典Lﾒ0央庭R画ﾐｪﾉｨ8]0燕､ﾄ,層｢X/探7ﾎ名ｪ&ﾆfyc･ｳ犀Z之9I:1J箱j
&ﾙ｢lG在))Rﾙ)E5ｹｦﾕ冕V拿
"7ｼﾜ埼g錻樮ﾞ狸ﾌZ檳:hｺ箔ｲLｧｭ7|ﾚ{獄ｵRｧV蛙ｻ｢0ｳｱVwｵZ鉉畭鎬Wﾟ"+4>ｵﾐ褐ﾂ8dﾐ曙ﾂ$!阜ﾂｱｨﾂ$ﾒｪ"2ﾋﾑﾋﾉ \プｸｩ菜ｶnｧuﾕ冴(ｶcﾘ
^ﾀ&v聒擽ｱ1H;%哲2翳齏=ｱ7ﾙ}p6ﾅB
甫\E;ﾟZiﾉｹ	ﾇ8繆|致ｿ纔押`V]贄e#ﾒ蘿dBEｲ贊eLﾒ1ﾉI!ｦ､ｻVaｴ9ｦ｣ｫｰ･S｡ｬ*ｴ;ﾃgﾑ鏃ﾃlﾟmｯ9>ｾﾖﾈK;#`ﾀK渋貊ht｢ｵ<
?ﾔ｣-_ｼbｽ:6ｺ;;bрRRｾ｡6ｧ#ﾖﾔX｡yIv13lb2$ﾙ巧cｧｹI｡Q｡ﾇ ﾆ魍H;｣BO	2雰
ﾝメ
KK臈ｷ|妓L攵bje)ｽ
C昵ηｴ#@Lﾋ7媽Qﾅｦ:ﾃ=ﾍw膩ﾁ!3ﾅU;ﾃK;6ﾔｯ_}ｭ~ｵﾕﾗ鷂_ｫ_ρｦ_Z`ｿJEｿｴ&ﾟｶﾙｲ*ﾘ/?ｮﾀ/軫lzｴｷﾍｦｯｨ{昵6ﾏ?z`ﾛﾋEﾛﾆﾛFLｳSｫ阡^!:蜿^i珱iR｢ﾙ9ﾐ'ﾓ`
m#Siｻﾚ`ｴﾇi3`ﾎР8*1ﾃyｺﾁ!,仝bﾚ猝=ｬ床ｾﾀK;ｼ~ﾄU;ｮF嗣0噺ｲｼ憾ｱkﾑpnﾂ[z|oﾄwpｾ7?)ﾜ懇ｱ蟹ｸ騙;k樹ｰﾖｸ招ﾇ{YWｼ滸ﾁYﾜﾏｦV床+Qｶ床'q,>ﾁﾏｰｿ1)掵/ｰoE#ｾﾄ~ﾃW､(ﾔ_友ﾒX|K噤oKs]i;~ ﾂ絣~,ﾝ◆K障淋ﾓ付ｿ某ﾄo､ﾗ;梵U<)ｷﾁ乕Yｾ蛭穉ｬ$_ﾊ4y-胄ﾕL71崗ﾙ襠Xｨsﾈoｰ0=ﾖB荏-(ﾖJiﾇﾚ*YGe｢c]謬ﾖMIgﾝ,｣,`ｱﾊ*ﾖKﾙﾆ媒,Qﾙﾏ+ﾏｲﾁﾊq6T%+'ﾘ0ｵ9｡Fｰ:pﾏ喩ﾘ豼ｷH"Kﾜ0(8ﾍi･-3Mｯｰ遁=
BX4cc｡3K'ﾃX掲Y0嫺C1ﾋ〉巍ﾘﾊｦﾖ鵄oｯ涕zｽﾒｿﾗｭ喋斜ﾖD譏aj匳D5听ﾞﾝﾚn膸皸}ﾗﾌ~ｮ= 6鉱6掏6"ﾘ\霏
;sA?VﾉｬRYLd蟻
ｻ*Yｬ`埠z冷ﾝ?ｭﾞm]K鷯循z苛ｰ2w=D]z怫n'	專-｣n/ｧn_Bﾝ^Eﾝｾ玄}9u{
u{u价ﾖCｻﾊﾘﾘﾄ6ﾁ作ｺ:]魴eﾌs呟:ｷlYkAN簫\堤ｰK斗~囗Mｷ}ﾆ磨?ZﾅJ
ｿmｹ->W鄰ﾞrﾁ鵄ﾅ捐tぶt3ﾞR伴ﾊｧ)%eｳ,ﾇﾋ|ﾖﾆTrｪ･;I妙租ﾙI妙!|1msﾉYｶﾍ俘=ｫﾘs~
ﾝｳ~ﾆ冬門NZﾎ?|ｮﾎブﾂrﾁ鵄ﾅ捐wｺvA>ｬ>kｪ>泙左ﾍkﾝﾇN:ｩｯ6	yﾔ;ﾖ_ｽﾏuGI6ﾙ
ｴ#ﾝH;ﾒMﾆｶﾒｮt3ｴgﾛ!夬8ｶ砺ｦ]斉n｣
ｹ界ｳ;X,ｻ匂fwｱ〕/Kb床d崢枦ｳﾙSl{囎ｰgX+[ﾅ山ﾊsY<;{鎖ﾀﾞdｯｰwﾘ{攷/))"ﾘwｿS4Lﾑﾘ迥｢┫ﾟ俸(*$ｦ$K鋳*ﾉﾊIU6JｺｲUｲ)ｷH!ﾊ綻ﾙ+9倍､虔ｩ｣ｭ|*uRｾ:+?H]T声ｪｪﾔM*Pc･:ｻiｪg7便嚀└ｦaﾉ柆#ｨd慣澗rA.ﾄjﾇﾂ9歯5pｹ8)司Fｰ嶮1幺ｰｱyV
kｼ&ｮﾊｯ0Xﾋj｢+hﾄ瑳@.ｸﾞi?B8慇ﾏ;ｧ8}ロ6k8Noﾓ#｡
ﾍ8想B3ｩri0:､$l!債ｶRv脊ｱｫ4{H8B嚮參TｶQ堙n梯ﾙﾍﾒ"ｶ[*fｷK虱鬱ﾁ蘭ｱ･螫Fｺ反,]Mﾀ5ciｽﾒI6ﾖ劑｣ｼｯ
ｬwr_ﾏﾎvﾞ羊篆MｴPK
釈ﾛ､fｶ*aG\hF颶馬D袂hｨmｼZﾃl齶ｼ9:ECp=
ﾁfZｬ･孱峩筅ﾐWｺI;a､ｴﾆKｻaｲTｳ､ﾛa》寧wﾂi/ｬ勿p･t7l誹､!顴8 =OIﾕpLz>ﾂ由MｧyOYｬSVｩｿﾃ髞菩=e%vF=3菖ｱ毅AX{ｮp艦Wz$p$裾Ｙ駟(=｣､｣0N:F=~J､鉈bｴｧ!忝A8Mｽｰｽﾈmｶﾓ_?斛｡｣ｳ3&ｯ:?ﾍ3"ZF膠ﾋj舛-縡
ｹ卍?ﾇCﾑGﾕｰﾎ糸ｽfｽcaﾏ{ﾟｱ0ｿﾗlｲ訳ﾈ窄(ﾖｷNｯ/.8ｽ)|`W_ﾟ.Hﾝ軅ﾏｵ?Oﾏ饑#%SﾏwCｬ唳%63ﾌj&{ﾌK;｢
Qfﾘﾋ=@8寃 恬ｹﾀ酊$hﾚK712lﾋ7jｰ-MkｧcｦｿFO碇((tｲ妓u+^wS｢xｽYﾞI^_O,Pdｼｪ&滔ｻｷｹpﾙz/眺ﾙzｯ牲ｲ^Vﾒ-ｽﾝ･7ﾉ{巍･X､>k#}ﾀｺHﾇYw驅+ﾄFJｿｲﾒol｢;ﾋ哲ｱﾙR-ｫｻG木ｲﾌﾉ
;,/r({S利ﾜB
#､09Rj#ｷ丹ﾊm膣r[ﾉｹｽﾒLｫﾉiﾔ+詠2H｢､ﾈC109EｹAｩl鉄鋪(蛆yｬr梨｡<.ORﾞ尽ﾈyｪ]棕Fﾊ3ﾕｶ,ｵｫ<ソﾀuyo&ｻx+ｹ盛糎e|ｼ留爛舫||%ﾏ賊虧VyｿEﾞﾈ7ｽ
y+Zﾞﾅ泄胄]y/Fv滉{)y湮艝h~ｽ廏*ﾗgﾊﾕBa}ｱ|@ｿNｮﾑｷﾈﾘﾈcｼ就ｲﾌﾄﾟF=ｰｻ澆ﾋﾏﾕyｰ>ε楮ｦｸﾆﾚﾐT茎uﾕ{ﾁ麸ﾊK:fWﾃﾕｾg
Rﾝ誦聚ﾎtMﾀ攘ｨjXｻbﾕ%bｽyhﾖ`ｽM<`橄rｴC|塰O狒荅N~節cvCﾖ\?e蔆Yｶ&-珍f蔡ﾙ^GZ^~bﾉｿｰGｲ'臉ﾙcT擠6ﾖ;ﾕ棗宇SI
殍ｺ8斯mﾜ誦Y1ﾝ6|Wﾞ@tk/深YOｽｬ~｡ﾝ8AynLｵSﾝ8ﾔｼｧｼ={yoｺvi勘	ﾁeｦ泯L^侭p/vRcﾗQｯ勞ﾏHｸﾖx {by-nﾜ)ﾖ底ｽｶ:LﾗVEnBﾜ..&)｢ 4S$STｼFﾑq澱ﾃﾍJ3ﾜｪ4ﾇJ4ﾞｦtﾂ=J7ﾜｫtﾇ{嚢銀ﾄ｣Jｾﾄ7膿'>ｫﾒ浴賃t%槽)Yｬ2%(ﾙ eKQｳｱJﾋTｲe岫gﾋ乃ｶAﾅnPﾒﾘSﾊXｮ2栲｡dｰo	R%9秤u&x:宍7ｹﾍ	n"ﾑ､命邁CdﾝeX4罨aバﾈﾛ{Jｩ>P5ﾌﾃ^"2z切ｺin痞ｭi~ｨ薑[ｾｸｶ圏[ｴ8ﾋiｽ,ｿ7萇[|ｲ薜ｧｻﾗｴuZﾒA@wWﾃF_wzθ6,Qﾖ欽ﾆｳ)6･3球VYﾙsn･ﾅG,ｧZﾎ?|ｮﾎﾂﾘMiﾞｸFﾚ[gp嵯｡ｩ酖ﾗ{碎幹ﾉ8luｲnｪ?ﾙｰoZﾋﾏﾕyｰｾｳZ}qﾁｻ&ｺ〈>\pｽｬW鞍ﾏBKﾜｧﾞmﾒﾒ	Mｻﾄl|閂弥1^ｻ･ﾗ､ﾖ75ﾓｫﾘ6]ﾄMﾏeﾏ3ﾕ=={ﾝ=軾NT?goIｻEr綛ﾎ銃ﾝｧhﾝ-Tﾗｴ｢痍9ﾙｰJﾅ&ｧﾁ廓囀ﾕp捐OｿｲｮYﾋﾌ給ｽﾇ"_ﾓ>0?ｰ]
ﾌｬ
防ﾌ
N健就L<ｴnOfｰBﾖﾟV<ｰ1ﾅ=ﾚﾝ轗,6M<6WｦSｦ)|卍ﾓ BQﾊL險ﾌ!ﾊ･腓ｺ2&+Pｫ秒腴6S.ﾆaJ9参*0Cｩﾄ渠･ｸJY⊥藩､ﾅﾊ
ﾒeｫｴZﾙ&]ｩlW(ｷ*EﾊN･Tﾙ･,SnSV*ﾕﾊ*･Fﾙｦ&亟G;^QｾS^Sｫｼｮ弖ﾞP5藪ﾕｦｼｫ*ﾇﾕﾊﾇjO5^履|･UｾVG*硼ｼ幵=w*?D$r>Xｵlﾕﾁｧｪ痞ｳﾉwｨ-mj+V[}j;~ｿﾍ宵]ﾋj~Bu屠YﾋOｩ	ｺ､&ｪ圖su萎FｪTyj汗Y･oUﾓjｺ~ｫ:A?NﾒSsﾕ)鉤,ｽV挂Ul<[｢Zhｬﾎｯcﾂ譲ﾞ;pZ/ｾ埴湲Cｬ+缸=ﾟ
柘鴟=FlKb}:ｷnｩSGO髢ｾﾒFﾎUﾞｫ轗@､l･ﾝgｸ憲ﾊj)┴eﾐL-j袈梁Bu)鉢ﾋ*u\ｧ^
nu5P/ﾃx[ｽ>Pﾗﾕ礎ﾀﾖ麹Rl羹ｽQｷ甜嘸ｽ笨l\JWｯｦ>_C}ﾞa4(孱亮ｲﾔm政ﾞ惇0Wｽｨｷvﾁｶ:杳魃｢兒#Oｯﾃ澗Z 膾|c.ｿ)ﾎzｧorﾃM奚閥oﾊYkxcﾃｶz$jﾘ諚Gｫ	ﾟ;ﾏ}屑dCﾒ趙>ﾎZﾜﾇY屑8kqgR!ﾛ<､~/ﾋ~}ﾟM杖^ｼ5N=ｬｸ>?ﾒ驤3ｶﾃ¨G/#ﾐﾛ)pﾆ嶺簪pIﾎwｨ榲ﾈG訳洵`ｷZ}qﾁxﾝﾀ8.ｸﾞVS豪Mﾟｿ;ﾗ･6｡4Cﾔﾛi鰛ﾅ=pｱｺ*ﾕｰB}.%;ｩZ=Hﾋ!Z}NｪG0T}惇ｿ礑ﾞ
oR_ﾀ嶐Wpｿｾｯｾｫ瀏布｣~'ﾕOg<･求5騎OH'ﾕ瀞ﾕ･ﾟ5]ｪﾕB袒ZｭEﾉｽｴ6r｢ﾖV椄ｵ立h,鎗ﾞ(1幽ｦ/堆|冢ﾟ&7Xｾpkﾂﾂ竇[ﾟD\ﾎﾟ]|―}^ｰ:ﾞ4k	OｶｶﾖVﾒﾋA渡%ﾏｳ?ｦ@$ﾖ	BｴﾎﾐLｴｸ^ｵ$ｼA7iﾃq6wj｣q6ﾔﾆ=ZﾞｧMﾄjmﾔ&絳ﾚE椁iﾓｰV崔dmfEﾌ("ﾙ4壓[輩韓ﾜﾆ|Bｫ?｡ﾝ^ﾏﾚ:/{U[?
ﾑﾄ'ｴﾆｾ#o{ｹﾙr[,>Wｷｹﾟ
桐(i橇ﾚｸ3ｹ3ｵ8ｩw#}ﾓ]ｽw4｡wｭJeﾏ｡w5ﾜ+=ﾖSzｸｯt?Ok窩ｭ妻ﾃｽ<ｯ淀奢ﾀF3OR
ﾟｩ[ｧ｡tｵ∀ﾍg>ﾗK>Fﾐ:?ﾖ|Z LsAKｭﾚi`新)ﾚBｭ-Ｍｭ
ｴﾅpｩｶЬ､-gｳｴ菩:vｳv)ﾛｩｭbwkｫﾙ芹Zｹｶ^jｧ]+uﾒｮ凪ｴ･ｾﾚfiｰV%-ﾖ新hwJ擁wIWk{･kｵ}ﾒ&iｯV-ﾝｧ=,=ｨ="UkG､ﾇｴﾇ､ｧｵﾇ･ｵ'､ﾟｴ'eﾐ梺ﾚ3r嘛T棗=/h/ﾈ;ｵ怜ｻｴW艟ﾚ?艸ｵWMQ]Uｸ樢掃JT3EﾒｾRtk･咢ﾆ%%ＬJ/｢$qｻ2ｇ*ｳxs･;IｽO帷e眩'ｵ
8/w棊｣ｪ瞶[瑶翠轍mｪ鴈霰ｱ;\cf(ｮ'Cｱ疎ｾ劭ｷ8*奧緤oS揮7ﾛX肢mﾚyｮvﾅ,hEﾂn!<夾ﾖﾆﾛB"oCxG佶;ﾃﾞ
xwｸu<vr'ﾜﾅ{ﾂｼ艟-腓;>u>[TlﾇGa催:c9ﾉ;9ﾖ､ﾇ2"ﾙｾﾋ)ｶﾝ絶ﾄ`ﾞ30冒ﾙｷ[輝+ﾟ"dwﾇ_墨ﾆn
圀ｪｲ7ﾊzﾅ
ﾞv;友W{ｮ7~ｸ緒#'gBﾏ89|2ﾌ犁`1
+x>\ﾁ酊F>ｶq^杖x似ﾂﾋｼｾﾃｼｼ失ｳｽ窰ﾕ=ｺBqG頂o丸)ｾ胝ﾒｦz､ﾑﾏ+=ｧg}膽ﾟ~V苹=Tt身|竈耨ﾕﾒﾖaQmｹwh@q_=ﾓ冬8Pｴｨﾈ｣;ｧﾟM｢9/Wｨ皈4ﾂ+h/｣^M#|9蓴50岷Bｾｶ+6~MｮkhRｭｵ)ﾟ尉|ﾆｭﾏｷ甕~3惹ﾛqｿ]ﾖ:｣昴ｽBﾕﾞ:E竣dｧcg2v[qﾖ塊aﾎSﾖﾃ慵ﾀ|s啼?ﾑiﾆ蔔ｷ?ﾐg須棡ｸUｱﾄ融+%ｷ―99?ZU紬蚯ｦﾋ5NGｹXtT▼Nﾇ\#P穰【跣mｸqｺnﾌ6;衄t_b
\]gｯｮｳ陽Fｿﾂ7虎ﾖ9ﾖ峪ﾁｧﾏｴ}|鷁ｭ0殍ﾑﾊb':w5b幺sDﾓﾚ媛=gR贖ｯ&ﾛH痍督ﾟN
'ﾜﾉﾝｰ鍾
濛~?ﾔhｪ'x
<ﾋﾁﾟx?澎梯?g瓩~>睹ﾃｿﾟ疚
應ｯﾑﾎ:v穉b:'wpﾗ術;籬爛;亜ﾀ盜?ﾍtﾆKﾓeVｫlｮﾕ8ｹﾞ'kｬ]iﾄ雨|Yzｮﾂ,車ｺ
Bhｦ7ヶzs陲; V1zﾈﾐ#ﾗFgﾖO蜴ｲ~a7ﾚﾁ"j｢<ｴｭz港ﾛｸ}:$ﾋ蛔轜o}ﾆ/ｭAﾑ｣ｨﾎ6ﾐAoKSAｼｳI	1;bgBｼｨﾄｽMBN=1cﾅoIyﾑq@|ﾝ$}bwOﾌS(､蔦峨ﾐ検ﾖ{Aｽ7｡Lk%止BI$秘
｢ﾜﾗC}｡ﾌ｢$Y(,墻ｧ｡ﾐNO&恙^廰Kﾖﾝｽｲﾞ?ﾑIHﾕ彦%nｷ曖IO0}tﾕﾓ{V#ﾘv:a填｣'ﾂ曄ﾘｳM日?戒櫪8sﾄyﾄﾀ9|)3頻ﾄyｬI儂83gn88Og砌NA8O8=視p
	g^8G$氤┻p\
jﾟ國e､	･ｰﾁﾖ3ﾇg,;襍A/
z%ｨ焙ｮ 	jﾘﾓ|ｾHﾅA:9ﾎ
(ぼﾁﾈ9N竍kﾟｱ鷁APﾙｲ･JEA･X蚕W｡$ｨbﾅ2､3T.ｪJ釼ｿﾀTT'ｪuEP]溥ﾎﾐ	､ﾊｪｚ;b考F*ｮ	j趺ﾋＫ^'uｼhEv椈ﾗｭ`ｾｿ#垪?ｻ[ｖ<=*:XQbﾅｱ7ﾐΡ	2pxｲｫ高ﾘOXｲ仕x*ﾙﾀｾ･Gﾚﾄ-bD/ﾐ左ﾔﾗmｵﾜﾆｽ〒wt須ｿ7wq]X&ｸﾗ-晨ﾞﾆjｵｫﾚO夙耄=彭ぜﾖxq8ﾍK6噸什.ｿ~ﾊ貎｣s*h_z23S]27Uhｷ立Nﾒｾ?ﾊﾆ|R4UｽｩC*B%h果ｰﾁ\↓ﾌ5x匯7聾&s^e^ﾛﾌ&ｼﾅｼ
w仆ﾐ.|,|需<|"|懐2|*|酵ｾﾎ|ｾﾉ|ｾﾍﾜギ;]諚}C襾c'S詒ｯｦ轉PK｣U?S
PK#ma5&antlr/actions/python/ActionLexer.class}	|Nﾇ9sﾜ衢"ｱﾆ桍鱒 b草ｵ串Bﾈ｢IﾔﾒｪRE許｢･ﾕ穫_ｵ幡EK隣ｼﾖｪ幟ｯｭWT几ｷf造~0g賣r賣3gﾎﾜ;ｻUﾅmｸﾄ*ﾞX*ﾀ2nyﾋE&Wﾘ@ﾇｮﾍﾜ"ﾀjQgkｸﾕｷ:ﾖpｻlEﾙ&ｰAcｼAﾅ;mﾐ7歌ﾍ6ﾔpｳ鐵w仮ｻUﾜjシｸR葆#r`･"oｻPQ!ﾐｸ_ﾅlﾐｴ瓩濛wｨ
ｺ筌*Tq頼城興mﾐｨｸ
bｰﾌ=q 
淨ｽ７ｹDﾞS6Eｧm粋ﾏDa9
!優鼈Hｽ,堊"ﾐW唏ｽ.ｽaﾃ祺Q/Qｦ(xKc[ﾃｷmｾｫ痣:ｾhx\ﾃEﾑG~ｬ'~ｪ	
?ﾓs
ｿ4ｾ+Ak
ｿﾑ?｢ｷ~'ｲｾﾗ､ﾕ
OixZﾃ3ｨ畉
ﾒgQ~7A駢凧C､T
nﾀ"ｧ３$CB｣
L",P.PEcｪｨ	Dﾙ6
)ｻHPGuE*Dz
P_4 L"ｯ.RMh*@3ﾐBc-5｡ｱV｢Zk嵯ﾑX[嵯_SU$?蛤ｶﾂﾊY綻QqWｮVT彑Iﾓﾚ@@	4RｾﾉHP?ﾏ蟹迂卷iｩB8D[%?#sﾌ!D$?1#sjr赳態$?sUnDﾋOJ9rpjｦh搗辨:∫'
KLqf`ｲR~ ﾇe伸ﾇ&ｦOMﾌﾈHJt瀞Rｩ髦､ﾌｴtﾑ柊>1ｦNlvD┥倭rﾙ5)ﾊO6#キ=Ioﾞ<_埣｢甬"5$%-ﾑ1#eｪgA#}0%淅 ﾆ$ﾎH茖ﾉ9~H詞8< ｻ[ﾇ珎x\ﾞ3ﾓｯ翩Oﾗﾀ系1ｱﾝ3zfﾄfﾌﾈiL ｧ1●ﾆrﾈiL ｧﾂ0i}ｳ,ﾓ$E
ｷeﾎ+ﾊvﾉ#ﾄｴ6ﾆB"ﾖ(髏{ｩ嗅ﾝ\ｰv寄$ﾘ1vﾆ:vｬ
lｰc=･h'ﾌ5-咯K!caAIﾖｧ0<ｹYFﾗv6
 ﾙﾎｳv"ﾀH頬gi,Ue｣l4Kｷｳ窶e0ZM!誡ｸｰﾄ鳫｢ｯ%ｧ6ｫﾔ弘ｱ9Y錫|ｦY汪>ﾕf音ﾋeｳU6ﾇﾎh8└Гﾃv妄易ﾁBﾆ!鹵glｮ鞴j;+齧,Z
R.f%v6商古DSl｣_･fｦ､ﾌv｣j芥ﾝﾓ.`ｧ8w咄兪Nｰｻ恥Idj萋､dﾋ阨軾錨ﾏU柱lyｼqﾌ-翻奎ｫ8=07ｳﾈ餃ｦｵ善!ｴﾒｲ*ﾝｮp`5ｵ]ｩｶUIﾋ8[謌Z驟ﾄgh弗ﾅｲ161sｪ`6ｹJｶ鼈ｶbﾓr7ﾕ鬥莞Mｻ08ﾏ呻,(	8ｶｺﾗ;4派ﾐ譫Dv･ﾄ饋箜ﾕNｹﾉT-%嶝{:蜻Hxd1ﾃｬ粐ﾜ匐lLvSZ舶沺U嚢R論ﾅ:ｯ>除8Iｭ?Q]ua!ﾉt-ﾉkｩﾆL､%H罰ﾕﾚｶN#･~$ｾｶＩ;e;45窰+%ﾛ蕩;､ｸ ﾎﾈ,T=ﾊ!Pﾇ^鞨Ｇ｡繆｣ﾔw:Aｧﾃ｢P\T9t'粫衵Eﾄ{粢σu|ｸｼｺ似ﾃ裼 vﾔ?ﾝ)Y}zｸﾃ｡'砒ﾐk>L\ﾛﾀ	!fﾁuF,!ﾆﾀEｼ丐M王B}べ淋$,｣qﾟH-V@X	m`tﾕｴPﾗﾀｸ(ｬｹｰ樔v;QﾙK`QﾚL5ｶﾀｸ{p0gﾐ皷ｳｵ%ﾏz､h*菩ﾅTY|9遠ﾕ)N1ﾄｨ"､｣0ﾚPhJ｡ｭH;､r齏$'ｸO3囈C-$rｸ]"o'1Bj%ｽ\AWﾅｦｦ[k#ﾐｩﾛFKｦMPj辜8ﾞ臺`詫1&ﾏﾘI0H｢^ﾂ:?A ﾃ◎ﾐvCﾘｽ潛Hｽd缺"｡'ﾃ4	0)ﾖｳ$ﾞ蹣H/占Aｵ_｢哦Ai､ﾀﾑ4=｡8N[ﾂ:B｢"5ﾅ>ﾂﾒｼ底OA2iﾄﾌﾐ≠Cdｰ至x8Bl0汎0ﾌ!ﾑ･ｴDｸH9ｶﾑ偵V!ﾍdl4k唯ｳﾌVJr^#L2ﾅ2ｭﾊ ﾅｨcLG}GHｴ闍2ﾋa､喬ｻ	8B=\t/サST｣zﾋ膤ｧhNU垳ﾗhﾚ	ﾝ甌
oA_x畩ﾇij?､i因Oﾉｦ 9Mﾙ4e_中M
氾ｷ4'稼畧ｵ漁1芝ﾏq\%]ﾖe}ﾒerb/}uY2ﾆoﾃ SﾒmKﾙsN規Y砲)g)抒6勍ｰﾏｬ,]社ｩa夲ｯA7ﾜ'ﾓ8ﾘ#ｬXｼmLｱZﾖｸD
E､｢i襭pДQﾛｽﾋ"2昧ﾐｵ髢ｮﾙu柵ﾆｸnO壘鳴#社l_kkkkﾟ軛ﾗ!ﾗLｫc]>a}ｯﾉﾂRxﾔgﾝﾘzﾜｼwｷxnﾞﾝ篆ｻﾅ{ﾟ吟]=Gｮ_^ﾕSｷ4[R
L幸+E#t&
ｯfyMﾂe尖5圻玄蔘-1ﾏWr襁ﾐfﾊﾂｲtva盈ﾂfr珮vﾊ|"n堆"ｳｻu54ﾏ能9莉､ｺﾒﾒcｿ{ﾔﾊ#､Fｦ崇K1ﾘZ(､-~BZﾒ2ｯ先_Q	
粘瑞S請
4ｷZ9瞹Uﾈ	ﾟrﾋ	bﾜ諡ｨr售J紹ｫﾅZmZd4ﾜ稱hﾙｴ,ﾃｦ_Q屹ｯｫ1x･6
施ｸ4ｹ殃v^･ﾁ^cTﾟ鬩~ｳYｽ之;/ﾂ沌ﾐ能^)mﾎ｡汚ｫｭ4ｪ-0ｪﾕx竒疊｡ﾁﾏﾟｶ吶g萬Nﾍ|"m謫i3檻ﾛ禝ﾚﾌｧAﾌよ8"pC'ﾂ冪ﾎ)86b>lﾁﾘ界ｰ
ｯ〒pﾂkｼ^ﾁﾅpo萄.ﾇx6ﾃ紛
ﾟゅq5Nﾂﾛh聳Nｼ7纃ｸoﾆｻ(w+>功3X覚穽|g!Ck件ｲｦｸ孛ﾇ'X<>ﾉ綽6ﾋﾙ|艦ﾀl!>ﾃnﾇ釖|＆繼+<"5ﾃW･V墻繍4ﾟ膚炮ﾒ|_H胙4
?糖ｹ這_J+i1~-ﾝﾟI駑<%ﾇ3r桾/r2*ｧ燹ry灘ﾆ蘆ｦﾈ*/au膓ｬｮｼ妹ﾈYｨ\ﾊﾋｲｫｬｱ	k&歡ﾍｹﾄZﾆｬ5ﾄﾚﾖ煮b<檸ｹｬ3/fﾝﾖﾟﾎ糲擣'ｿ糯ｳxﾃﾟaｷｬ??ﾅﾎ)疝惟
Uｰde
ｮﾌd#Xｺｲ燕Uc纒ネ岑|ﾂ&+_ｰ)復杪nｧ>0ﾏhpｯﾓS?ﾁs2
?V-rAｯﾀ2Uvﾟ駻ﾆ搦YﾄｦCｭﾙLpｰ\霽fﾃSY1莖(b`巉J｣N厚ykﾔ弓Gﾝ8ﾁﾒﾚ26B&Y｣ｺﾎUqｺ{w
ｻQzWﾅfKY0珠Zﾙu4ｲ%ﾐﾝ-ﾘrhﾏV@wｶﾘm斉ﾖﾁ(ｶﾆｲﾛ｡mуlS･ﾑ
乞kt|GﾗFﾗ｡貫Al册ﾘﾜ｣ FW｣Ip/|mｶ刎ｽｽ膚}/
{
{;
>4ﾜ0=ｹQ(d;a-{ngｻ+
}к鑠軽UｾCﾗ,ﾞﾚ45)N?7ｱΗ6气\d漓ｮﾝ#ﾆﾖ?Y{ﾚ"Jｿg洳燬ｾﾔ爬uﾆ
∝U蘊p
ｪﾆvENｺqvvﾏｼO+*]贏ﾃ3	ｷY槓洪ｯqﾅﾒ捶ﾋ換｡xﾋqL
戰|他ｻS){ﾅG｡;UｭﾐxﾖG渝ｵﾂY+ｦ/5ｸi攜B`yUy;慇ぃｪｱ]太/ｿ>ｫ､ﾏﾟｪﾏ鉅_Jｼ`脛C'ﾆ褂ｳ0ｷzGｪ･H?CHeｴ#=A;ﾒ^ｨﾇﾊiWz
垉ﾁ@GL ｦ
9ﾁﾁ｢ﾘ峡{快dGX<{%ｰ証XvMe浤s妄ｾ`ﾅKｶ}ﾍ枅ﾟRﾘｫ{v拳dｰﾓﾔ'vIﾏI悃翌Xﾔ@B$ﾋｿI\>/)\謬n督yｰﾔ惺融hｩ5.ｵ	R[$ｵ#･|堺燬､周.ｩｿ_ﾌ勅Rｼ4ﾒ@ｭ汎) 
Vi惟VｦDIﾉ夫ﾓn*-3	IﾝM%ｸ鰯j7ﾑｲ"pBムdﾓ諮ｬ職蚪ｺ:BC&ﾉv諮ｩ､5ｭｳ2X痃ｱpｹG~ﾙDｳｫ%ｿｴZﾂ+拜ﾅｽｯDﾌﾁ撼98ｿﾝﾒ5､ｷ他ﾃ嚴kｶﾃﾈlhBｫ"う善丁4C､厩樽･l!ﾍﾆｶﾒ Lｰ5ﾒRｶQZﾆ磐ｰmﾒZv浙="mdｻ､ﾍ	i+齢aG･ﾙﾒ咆ﾒN卯ｻ*ｭﾎ憎ﾗkﾙﾖｻﾈ|WgsﾏﾋHｾ*ﾂ筬｡賁-ﾚBｳZз&ahp児･Yｺ装QﾋｯｾfｶJﾍfmﾟ`Nｻﾔ)ﾈ｝嘯=4蒋棲満Ｗﾒ~(nﾒA%=･C0BzﾆHﾏﾁ%
､a柎蓬/ﾃMﾒ+ｰFz梼ﾂ耡ｿ潛-xN:G､ﾃ淋;ｭn%ｧzNY醜ｧｬ_ﾒ)+ﾁsﾊJﾘﾍﾌ77簀尼$L~猿]白ﾂﾊK斧Clｾﾒ$√$￥｡♪DK櫃O+$}
ﾃ･ohﾄﾟBｾ]･Q､ｹG､ﾑ(疾ﾑw6xﾞﾍv｣9美ptqﾎ茗ﾃ托>Nd_ﾋ餓k9挿-'ｲｯ<磁0Yﾄ踊(:Qf=ﾈ[0;f=gｯz樸3ｫ>6	ﾙxm+ｸee帆嶷V,ｯ*/ｰｼ6疵ﾐｸ｡ｪｱ]太/ｿ椨沾ﾓｿKｦ柞(35ｹTlﾂXﾄ&{ﾌﾋJｇpv｣spﾟﾋｲ4ﾟｵ0jTｬﾔjy鱚れ_潰煮惜ｾm<ｱ禽ﾃﾕ裏峯xXｼｦｷﾞ龝YﾂｸｮUYﾅ>ｵﾄEﾅﾕ0覲ﾟﾑMｫﾈﾗ/z?星w埔ﾝ3蔡墾 BﾚKｿ撰ｳKｲ0k"挌m､
ﾖ^ｮﾏ｢腱lﾜ剥菅ｱQrs6^nﾁｦﾊｬTnﾃvﾈmﾙcr;ｶOnﾏﾈ五ｽ#ﾇJL.ﾉ=､zr慟D%泄ﾈ鈕ｾ慄	(ﾏc4ﾅ>巣ｽ就>ｭﾂ/ﾔ
ｾ飫
nZﾄ鬪pw^mBM<ﾔ免･ｪｽbﾗ訝ｳﾋ`桜ﾅﾙlﾃｻTｶC桝0ｮ曙ﾖﾝﾕ/ゼｽwNぎ榑Dｮｧﾜｪｷ廳=^Nq?:ｧ刷9梍ｿﾀSｯ｣'ｳsduｹﾌｺqﾎ篋ﾊﾒｹﾆ&p崚ﾙr^=ﾄｲｼﾛﾉﾃﾙ~ﾞ覡ﾙGｼ9弦ｨｴﾔF{目橋ﾐh)I|履.璽ﾟ7yMX,ｷﾕ&^)U9ﾃｲ+Uﾑ_((xm綵ﾘﾗｼ沚ﾝ=\;{nｶｩjｬIﾛLｼ@幇.xﾝﾓfｪﾟ}獏ﾕｶ｣ｷﾅｩ跌3Lｽn1ﾞ!ﾅ}`ﾍ註fﾜｲﾉ剃ｹｮﾛBﾗuｫ､ﾝ┷O\樞ｭ 姐:ｼ-ﾔpw濟ﾞﾗhﾜﾄｻ稠梭∈ﾁPﾜﾁ3|ｾﾄSu>ﾟ讖ｧh擧3L逋ｬﾋ｢8ﾃｯbｽx綿'ｰa|"K蜩Y淕ｦil>淬Vs'[ﾏsﾘs<抑ﾀﾘﾗ<沱R+ｫ+-tﾌｰ7ｹﾌn#ﾑ｢=b趁ﾉｺﾃg4;銘:7wｷRｼ｡bｸ戲=_3z切ｺｧｨk瞽2ﾓ75秡+鴫bqim9/ｷﾜaﾅｭｸwｶ.Sm	V<第Qﾓﾗﾕ侭ﾛｿﾖ{ﾛﾍ}/1ﾒ{/ｱz$憾JMﾜ娚=ｦtaｱ枢鋪躔2>ｲdﾅ
ｾ飫
-ｷﾟ膽賈ｫ｡?樵u￣ｵ･q9B`ｿWｮ｡(ｷ{ｳN朞G+hﾟ･7ｭSV-ｫ*/0悴eｸ4.G忌_ｭｨ]3ﾐｺ9ｹﾁ簍`_G仆avﾅ夬< 并ﾀr+|-4煖!彑-
ﾐ/A|$aｿ	r*Xﾂﾗ｢ﾆﾗa~;p(ﾟ)|^ﾅﾄﾅ.ｼバ捺2i/蘭}ﾒM|?淅滓ｹ^ﾀ0_ﾄ杖ﾅ]~?ﾎ裃{~滓ｧY押?+*Eｱ?覗^｡ｴW$･"+ﾑ完ﾄ(v･ｯｬT麕ﾍ捻ｭ抒_s(
ｴX%L鬼｢ｴﾞJg-]鬥拘bｵuJ惴E鬩ﾝｫﾒ\Jo%Aﾛ･$j/)Ψ｣ﾊ0ｴ2B;ｫ､hｿ(鰛9%C濫L]Q&齲2Io｢Lﾖ;)ﾓﾊt}昶ﾔ7)9feｶ~ｷR?ｩ餔+%ﾊ|+e運｡ﾜhV杢(7ﾙb封ｶﾞﾊｪJ.|ｦ釵ﾃzｱ=ﾈｺ2ﾞﾚ$9ｯﾓﾙﾒﾄ6:ｱAﾖ'ｾﾓﾋｯ:ｵtｷn鑪mﾔ\貉zﾞu;勦ﾞVﾙ轣ﾋｸｩｬﾜAﾊ:ｨ｣lﾊFｦﾜｳ;｡Hﾙ+判澤p)･$1~@ｹﾞS諸+Iq檎ﾀｿｭﾛk|･ﾘﾔ{{｣ 7ﾗzﾅ%詔ｸ醗HW桙1ﾊ舒Шﾊﾓ$イｰZ9\iｼcﾝ肄ｪｩ58ﾟx｢B.~ﾅYBVmVoqﾁF?MKzJﾚ7｢5ｼｦ蟻wy超2ｸﾛ囚w;ﾓﾞwﾔ_y冊Cﾒｦqn癘qn礦!ﾒﾍCｪwｶ禀ﾗﾊ閔oz顕錵[ﾔﾁﾊjﾅ!削ｰｧ#､ｳ題t嶺｢/pIﾎ{9Qﾅa舮|ﾓﾜｴ>ｶＰYUy≪綮ﾋA縒ﾀ~ｯXｵu.nwy鶻MﾗｽB-慕ﾉtｽ@ｦ)ｯﾂﾕﾊkP｢ｼ	聞:蚓(Sﾞ!3|ｯｼg1X/q柵
ｮW蕪xｧr(?繚ﾊo咄;~ｩ愽
ｯ*畉Uﾆ_T
ﾏｩ:5ｫ｡ﾒY5LMm(ｩ:､
ｵ衿X国#ﾔxｹｳﾚG散ﾊ｣ﾕ~Xｵ%9ﾎc
ｦ嬰ﾜﾗDﾖｾgｺｼｾ8ｮｷb愈､Eﾘ却s-C`;ﾟp
U{ﾅｸﾕ-杼m%=ｬｭ､ｳC.ﾜ&?ﾆB:ぶ$ｨ｣ﾁ裲XｼYkﾔ穏^揆ﾕiｸEﾍﾂｭ鶚ﾜｮﾎﾂﾔ<ﾜ｡跂Nj,S却ｯz
S]杏ﾕExBｽ+ﾔﾅLVｯｯ､WｹQY@芥{溂ｫuﾝoaﾌ'ｴJﾚ{ｪxB[~gQ/<｡5yρﾃﾈuVﾘ`ﾟ･uﾕﾄVZ\F+sｧ臂(\+､.5勾oU?ｾｷｽ+iU｢h{ｽﾋ`峭0wﾞﾖﾝﾝﾜtr!俶~Zqﾈz*2]ﾟyｴｴZﾂﾅCｲ萩ｼc>$ﾃ･R懋~Hｭﾍd2ﾞvｱ2'･.n)ｵJｩ央^=/ｽ啗ｸGｗ単-ﾘｨ覈ｪ;uﾋUt/>ｰﾙzﾒ陽ﾉﾁｲKﾉﾎ/#;ｿｩ+｡ｺ圸7C/HTWﾃu
､ｫｷBｶｺｮS`Wｩ[ﾘnvｫｺ鋪ｩﾞﾃｶｪｲﾕRJｩ哄ｨﾔJﾝ-uTHﾝﾔﾇ･ﾞ黌ﾒ\ﾒBE騷%i･zDｺE}MZｫR終;ﾕKｻﾕ･2C駟#騫骭ｩzB3ﾙｮ~!Vｿ密ｨﾟﾉﾙ鶫yｫzJ~P=-?｢梠蘖藩ﾕ_[j|\c9行ﾐ.ivｮkﾁｼ桟ﾗﾓﾚZ$ｬu糂Zg>@ﾂｧh]yｶﾖｭﾒ4ﾞﾔa准^ﾆｾ{R3ｿrﾏy9ｼJnYﾓ&摧RhRﾛｽt諮CyVｪｨ身T亙V"至ｦｸy鱆1ﾉｯi読机En6ﾈK+ｦ@#vwﾒz@ｭ7ﾔﾓBｬ}ｴ0YKＪﾚ ﾈﾖﾂｵﾚ0Xｮ
ｭﾚxP	ｻｵTﾘｫ･ﾃｻZ|｢M４ﾚTﾔｵllｨﾍﾀf羞叮_婉i.'x2ﾗa8?GｷA#ｾJｿﾆqｿ猾ﾔd$zｾE!ﾁ7｣,{佐eyﾍ吊i|ｯﾐﾓｺ｡邉ｻ{p.:ｺﾊ,縵D{ﾛﾍ/_jｴ+0R'$斉賻葭Bｭﾚk A[Nmh+`匕Vk7ﾃ&ｸW[kk痃mｼｪmjwﾂqm3慴ｶ@v7ﾊﾚﾖJ0ﾑsﾚﾘfMﾂ樟寅&瘁&ﾁ!ｾq"篦,曙2=2ﾞｽ@憑蹠ｾ油A縅｡ﾑﾝCEﾅz鬮ﾜｳ壽旌ANx;駛uR+1	臾ﾍcnﾕﾎ:z;角wﾔﾈﾛ措cﾏﾟjt}ｰ{z.ﾇ7ｯwA{ﾒ塾､r･､r凸=D*ｷ典nｩﾜc0Gﾛ
Wk{`鐸8,ﾑﾊ`崩$ｬﾑﾂf)Rｹ/ｼｯэｵｧ疚|ｧ_ｴ1J{｣ｵ`/ELﾐ^ﾂ!ﾚﾋ8\{ﾇjｯ肬ﾚxｷ>}ｻｴ脛!>ｭ}┗h絏<ｩ畋3ﾚg謬w堤ﾙﾖ閭ｾｪf=℃(6ｿ{ｫxﾙlｪ･ｦﾆqk/u
ｺｬﾐｾ､)寒炮揆d2ｻｧﾈ
ｵﾟ潘w2ｹﾂ\%ｱL\枳n=?ﾈKx#d畜2,qﾝBｬg	OY杖楜晨1ﾋ-qｬ畷)aﾅqVﾜﾓ'qJq滓!ﾟｺｫ)Qﾘp¨!ﾓｺﾊRd$8BJ呼5諮颶"ﾟ団$f仭ｴ篦画o昇0ﾝ毒浤蚪堵]瞼aｯsﾏeｱw.gｬｧr肌rｵﾈqﾂｽ俯y3@oﾔ|vｭTｼﾒ!=}Q;ｾRｪ鈔^ﾇ]･4rﾛフ:ｺ
tﾐuxDｷﾁ.ｽ<｡ﾗrｽ><ｭ7ﾃzcxQ廉跼Oｽｼｩｷw6∇>ﾕ#疽ｽGﾟ1pV∀8l･ﾂdｽ7蛇,ｽ.ﾕ菟ｳ>ﾗﾓpｿ梹'>×ﾗｧｱ}ｯ;ﾙ`=eｳﾘ,=ｷﾒﾂ吮ｱ'K-{2ﾒw4IpS|ｩﾂi-ｦ閇$忿ﾎ\hｨ_
m"惟蟻ｨ>Rk鰐"
ﾇ｡Yｿ)｢=4ﾂ!5｣萓M方i6GG-GYﾏ8x3~[_\ｿ愈ｼZ闍ﾅ/yﾕ@qWｭ(.%翰遺好q9Q弯ﾅﾝｵ｢ｸ(ﾞLo!喚叡ｶb/:奇ﾁ>jｼﾜ5朶J｡凜FP3~X[ｿ
夊位桂ｨ4'止*果&｢筮面ﾞZPﾙBT"*9*扶ｵﾓｽﾐLﾟFtfz隍Zｲn託Q｢tpｯQ簇ﾏﾎ篤 ?ｭ"ﾚｳjﾌ_(ﾑﾞIｴwﾇ因n｢拏ﾗjOﾐ$:ｳｫ･廣辣ﾐy願':sｪ･bｭy":yﾕﾒ9bﾐyt':/暼j鮠fﾐyt摎丑Aｵt蛇J>ｯ7NaｵZf-ｴMﾒｷ位ﾜjｹ9fp霈CﾜｼKtｮｮ茂ｻｵ｢s懆|Ht巻･~ｭ､)ﾑ9At喚偏ZH蹶槻WD･､Zn>ｪ7ﾟ7ﾟ掣ﾕﾒﾄst~ :ｧ夷5ﾕﾒｼVk,ﾑ芽ﾌｯ茂侶｢ﾑ晁,ｨ茂ﾗｵZ[迚NﾑYX-ﾔ皿Ｇ64\ﾗ嗾ｨ{盻Oﾁ琅禺◯ﾗ@RLI5全2ﾚDNﾈX9c ｳL腮ﾉ5袖ｲﾘD~2%&ｳ〓0狙臟ﾕ@ﾖ佇orｫ改n LYo"ﾈ9g M莨〕2
ｹﾃ@.AｹﾛD⌒c"秩ﾜk"ｲ〕3n ･&｢ﾈvｯｻdｺ汗ｴ`ﾖBv隶ﾟ	戒VHﾕｷﾃD}ﾌﾒyt[ｦﾛgaｫ"ﾐ_%(ｼ･ｿﾃｷ銜
ﾊIｬｧ淬/ﾘQ{ﾙﾛ:]ﾍPKPｫ鬟+~PK#ma50antlr/actions/python/ActionLexerTokenTypes.classmﾓYoﾓ@ﾙ覩&mz%･懷*sﾟPV雌Zub)ﾞﾞ,Yﾐ9U"ﾕx｡ﾝR労ｼovfgw,5I詆'G･ｿ-Hｸぬ8厥｢dｶ克ﾒ│Zo炸｡;N顋權udKo･e･ｭ\ｿｧ	ﾔﾝﾖﾈﾊﾋ@ｮrｺﾚYA蛞ﾈ	J:/ｨdNw<ｧ博UｶﾟT`+ｿｯﾃEAUyｼ｢ﾛ竭n`:ﾊ~Gｻ弧3ｼｼoL覦uUﾐ很ｽNｲﾊ p;趁KＳｶﾟ=ｫｪ!!BYﾆd箭>ﾐXﾁvﾜ*FaJｾ5u{ｦｺ4ｭ蓉慯r;ｮｩh o`vXGﾛ･云ﾀeO嬶ｻ件'ﾃｸ}05舊v0Nｼ[Yﾇﾃx8ﾃF[ﾝ晝箸4煤(逖p∋ﾏ3伶2\aｮﾂ粁Kp酵^a^ﾗ俎:sﾚ`ﾖﾟdｾ_bｾ_aｾ
_cﾞけ3ﾟo2ﾟＰ3oﾃw假ﾂ峅ﾅ|~ﾀ~ﾄ~ﾂ~ﾆ~ﾁ~ﾅZﾆｬﾟPK皮Nｰ,PK#ma5$antlr/actions/python/CodeLexer.classｵW	|TOｲﾙｷyy$$$痘ﾀr｣\Jh`(	ﾐ6%Yﾘ#n6ﾀｻxｮｶ*XﾔTｭ(
kT!腦Q~JE~!ﾝ_
yZxJﾅB<#徃<酊ｯﾅﾜ.Fﾚ秩yﾑ陸}ﾙW\xﾕﾗRzzｶﾋﾇ輛ｳKｿﾙﾗeﾎ7蓁Mo)ﾘｯ瀘Tｿ/hT75ｵURｽﾁ?\
	塢ｸ･7生:Zok己ﾉ1`cﾈ7#ｾPｰﾍｴﾝeｾ,?燧"	ﾓ<ｼｼnｿ7ﾘｮ延}ﾁ99sｯ 8ﾊCk
ﾂP;\ﾕh0ﾂｵﾞ?sﾒﾙwO\爾
前ｭ｡pdQ8
ｳｷEｶｽeFcｨau4ｭaﾚﾏﾀ-皎[vVzﾃAfFﾘrｾ製"ﾘﾚaQﾃ0E
-3ｼk魂ﾉﾍ旡/kojｲ
{ﾎ#幻ﾄｽｶhｦHK(闔ｭBf\ｽﾁW2ｱｮﾝﾔjｴﾅﾔ聰ﾁﾞy｡,ﾋ7ﾀ=ｧｷｵﾕ+hﾋﾇｲwｬ黽u`箘Hﾈ糅ﾚ//'Dsｼ[Jsｯｻｼ敲Iﾄ請=ﾀeｨﾃﾚﾓ 1Oec旁鑪3j形ｯ
ﾇ1ﾂ^?#H\郡y0G瘴I艀XﾇFjﾘ`ｽZﾞｩﾈ\6"癶ｽgｧ'ﾘiq]+bﾉ泄*+ﾉ艦$GLﾟj孕ﾙS}･ｲｭJ｣ｭﾍﾛﾌFﾓ<{Uｵ枡	ﾙ~!.NHs､],ｰNﾓr1濔oﾘng0+!.ﾉUｯｾｬ｡ｭ*ｷｱ升Fﾙｲ46ﾍT;袒<ﾒ萩ﾊｸ｢ｸ]威阿C･;UJﾟﾃeNZ訂儀-)^ｱ|:IX5poﾗ|mM痴ﾛ<ﾙWﾌｶﾙlEｶ>ｦｸｷ亥Sｸ･w鵯ｺ赤d}Tｽ4=ﾏｱﾎ],@Xﾏ4ﾗ艮児侘)黄<鶉ﾀ69而N籔ｩｰ>]ﾕ萸`3Dﾈ/g詞｣ｳJ]\YｩQｨ%Q､E｡餡､EF｢ﾁﾙyｦﾁVﾛﾛ`,ﾈFsﾎ茜/笹ﾃ奬XQｬD胎蚊ﾌ3佛X櫛"/aｿ<&ﾖaﾛp1暑疸ﾆz倭昊廛ｪﾛjSｭmｵ\Q>ﾚ)ｬｶﾌT6Bﾔｺ澄ｨVﾋjﾋMｵv[ﾍヅs､Pg=yF鷭｣tG｣ﾙﾔNO醐ｳ'ﾓ阜ﾚQl{ﾊwlﾔ+eKlﾀFｶ'戻gﾋR=M茖ﾊ蕀ﾟ81:暸=ﾊ#d悃=+乾蹶ﾋu8Aﾚg;ｺQT礼錚ﾞﾙ<ﾇ(ｹ	ﾃｺQﾊｼﾇQｲｻ0io7ﾜﾜ獣rｦ蟷T`蔀hｮPi･<ｿ|､/4ｦﾒZq!Λ,$/CﾗﾀQ5ｲF3ﾇﾓﾂｬg-?ｧ4ﾀﾕdﾍVｮ3X;ﾂﾔ
宍/>lﾁﾁdu5ﾈ周F.	ﾁh
Uq4S｣6ﾓ｡ﾌ内ｧ;oCｮ痩Hﾓ謄价 ﾜﾉ｡tdﾒ6ｮﾃ漸ﾌｬ壓杭u愈ｱ9ﾛN残m視bｶ>q殊ﾋﾉ､2=i8鮑姐胸 ｮ笊w5趙ﾎﾎuｼ]\o箴ﾃ(ｸ9ﾊ-ｽ>ﾓ妄邉ﾋ9ﾃｽcﾒｷq}･ﾘ<ﾓ9攤ﾇ谷ﾟ旨kLﾝ=kn8鴣;qiﾌﾌﾘpｼ)ﾅ	弃=ﾃﾅ撕Q盃｢!f(CﾏHS}ｩﾅ6ｭfｨ1Pn侍ｶﾒﾙJｹied7ﾖ+ｷ遇)ﾊ
T霊ｦ∫ﾃﾍﾀｾ+c/ｨﾄmｼｺvpﾍﾜﾎﾀ掟盻穗\施p-eﾉq,ﾏ`>槫ﾍyｮﾃ･･了B_蟐|ｭ_ﾔgﾅ靡ｳ]佑筌貲dｧ鏈'I捍7Cｬ随ｬ%ﾑXﾍl緞-*'ﾗL",饉у&6ﾌn~刀77ｷ1`?F'=F#!_ｮ9.絽ﾚuｷ+ｭ?ｻW獸xｯS2> >ｦ~(釆米ｬ憚尓､fﾎ環.ﾜ泄ﾔyﾉ3捍黄$1ｺ,赭zuvRfｷb8ﾏｴ7kﾍﾇrV册Mﾓ'ｳ鯰;bffuN_V'ﾛﾋT},ｹ0u^
ｫ孩M藉ｭ>8稜ﾃy､es'4､ﾆ3児賠|BﾊF1
ﾇT
砕hｩ>0催F峻馼l･	ｸ滑ｱ鍍ｦZJ!ｾ$tP%]ﾀ#猷5ﾝEｧﾐNZﾖｯﾏ盈ｯﾘﾛ盞%ﾘ{bn?ﾀｲ&{ﾞｶﾄR)頬器9R'ｺ-g聾0ﾌｧ｢年ﾃZZゴ憶裝C椅

$/ﾏp楔ﾐｾﾞfｸI[ｪ'g｣訶ﾇﾜﾕｲｱ莚D=滔|=･3殖a楞
｣)ﾂﾏﾄ簗ﾃｲﾘﾁ7ｱﾅﾍlq{}lｵ-ﾎbﾏ藐ﾐ瑳ｺPﾟU窗ｫsｪﾙ)Oｸ脊､ﾓYﾌｹﾀ|ﾁ\-PKV'x`PK#ma5.antlr/actions/python/CodeLexerTokenTypes.classmﾐﾝNァ3･ｭVｫｧ}ｯﾊ3%ﾕKｲ礑[	4j^>拝ﾖｫ5nｿ=3ﾉﾉ|}|歪f翊ﾆ覗i@0營ﾓ下ｻﾕVz"監｡vﾓﾁﾜ除a顯ﾞp.ﾃ`豢{cB鵐r~ﾊｲFｧ9炙珊晤ﾊﾀｻXL\/ﾗ躁B熊┘ﾆ､證ｾ廰}5lｫ-ﾘﾋ吃陜KﾅﾋZcq/,dｰmﾁﾀ｡ｼﾖﾁB&aB^_wﾎ･;覦ｼ{｣9ﾀ>)ﾅﾇﾓ@ﾊ_､性Nﾇ,W\k恚+ﾈNｼ@ｳ牀?ﾇ哺5πｱﾂｱﾈ*
ｨ$眼ｰ傭肥%tj	ZｿeﾒAﾏ~偕:仇ｹS)~PKTｧm7PK#ma5*antlr/collections/impl/ASTEnumerator.class抗]Oﾓ`~ﾞｵ｣ﾛ(屁ﾌ朔ｵ\ﾐ1$ﾌdﾌ!ﾉﾆn4Pﾒｵ､?ﾇoｼﾐB"ｹG殼(bﾚ､yﾏ銛懽橸?>Pﾆﾓ !ddc0+ｹ(o轍Laﾚ?fﾌ*ﾈGP!｢ｒ9ﾂｶｳmt
Uﾝ,Wk9貌ｴ<ﾓｱ;壑ﾞｷｴMj纂ｱｻmﾃﾕy[&5＝遖mzﾋｹﾍﾙKMy菱ｷｪｦmﾔｺｦ疣鎬uWｬ;ｮQ1沢-∴mzｵ c,ﾟ賞J}サbuｧｶｦ_(Nﾛ%ﾑ桎ｫｸΥ8ｳﾙ｡沒T1ぽ*4ﾝeﾇxﾀ|ﾉ'evﾚ ｲ秣+vﾛ総Vﾜ&}iiI?鵝ｩﾑi
ｫ耻<((ｼ
3!s｡_Ea`､ｭ詆,ﾘｺ$ｺ 鶉ﾐｪ敬フc`j3｢%T[b｡跖弭[Cﾚｦ骨iｭ384ﾆﾗ#UﾑH｣:舗ｭmｫﾉw51｣ｵκ齠X耜街,ｰA"/Z.ｳ;]ｨｿ-L!3ｸｶxｴ6k4ｦﾇUｧﾒ栴祐d慓｣±咫l^4ﾖ杏Cｱｾ･銹/ﾝ_FｩgH就ﾂ
;%ｩ%ｧrsS|MOﾚﾗqSｯN.j｣mｱﾐｼ&Y･to諒｣FlE+%m	nr瀁ﾜ"狎bﾔｸｵVｼﾀ)惴5ﾎ牀ﾀﾘ､AｳeｱﾕD羞m--ﾑX<惱ｾ>ﾔ"	Oｲ#h$極Tﾝc｣ﾙｧiU｣輛ﾞ5ﾒｪ_盒
ﾒﾒｹｱHﾙ兄｢rｶ78ｰ+X各ｬBｭﾔ鄲lｿ都Xz*ﾛB1^ﾇ置｣愎iﾅﾞﾂﾛｴH｡ｬ鬮ﾁP8ﾔ監ｩｵﾜ『Nｦdｧkdｹ･嗹9ｻｩ浬UｴｮJJz
i呈iｽLRｫ5l#ﾍM｣+{渊｡5jfd9ﾕG[XR>:攸底0Y＊鳳$8Wｷｰ6)貘zｶｽEp｢	ｮｪ,uWｳ,dﾏ黔wHeﾊ7KｲﾘﾊfAｪ_ﾆ萄
{:
x%Oβt倔ﾂ敗>肉ifq]卒ｮ艘vﾊzﾗsSﾖﾉゆｼ4ﾖ'ﾇｹﾃ=#ｬ樌YﾝG9ｨ禀焜ﾅJﾚ.w柤dxｼﾇaJﾊ┥ｯ絏翠雨ｮﾆ菅ﾄ=)7Dﾉ虔ﾁlﾋFmﾕ}(廊Sfｩ
"wN@帋鯲ﾘｳg･ｯMｻﾆｨI對ｩ;
ｸ埼ｰｯﾑ緑8ﾘﾗ飢;lJ啗ﾉﾟ:ﾀｽ撩｢ｳgﾎ>ﾀ|}h7:w腋(羮ｷcｶc?wﾇﾃx棺l?fz馭Nﾋpｵ{ﾎズ労ｦ{<靴ﾉﾏAI:悋ｶnｩ1I畝;P'YM[UfqZ<ｬｲ蒋RﾂﾕV=	恤;胎naﾙﾙI譬淞ﾐ･ｧF^sI7彎ﾖｮ促ｳ8ﾙｲﾀ_Wfｼ@t/ﾒﾚ嶺o+限QV1vﾓ.~迩ﾈｫl2ｧ佻ｧiIｾﾎ1ｻﾏ3]ﾘﾆXﾈg疎
ﾔ(峡HOｶ楙n?3\ｧﾔｨD/NdｹｧｸWﾋﾔﾋ鐓:=ｼ-!ｼﾏｬｻｫT扣ｲﾋ2ﾟｫBﾍzRｸTuｪｵj斷RがｷｾyﾂGﾔ1ｩｫQo陷kt垂2LuRｹ#ﾟhIuz#剥l"歟4ﾄ _WYﾂｯT9ﾐhﾅUﾄ#ｽ髱sﾔ%ｩ
掩6漱"eﾇ､ﾀｩ琲賄ﾑ;ﾛﾅﾎ扶ﾍ+6ﾞ徽iOXﾆ祭1ｱ吝ｦ_釈ﾌｿ)：C嗣=.6ｿｼrｷ ﾜn:ｽLﾓ詰E)W弥zﾋKRaｮ6wDO"oｪ腋ﾟ惘QmQ0ﾚｸ}ｭyLﾖ｢ﾚﾝXCkﾙ5u謇FrNﾁｶ4W[ﾅｽﾊ巒ｼﾋ|z	(-:DﾊW｣+jﾘYﾂFjs稻Wc･ｺUTﾁ甓ｫnｸｯ篦ﾜj\露/ｩ.ｲxﾖ@ﾙ+ﾃ'r0罪
1能ﾋｭ$Fｰｿ呼@窓!ﾂﾅcﾜD4｡zｾQｭ｣Nｨﾎｴ`Uｧ>甜ﾖｨc｡衛T:#ﾅｵ%腓ｬ%qｱL･/ﾛｲ>-ｶﾂﾋ(ﾅnQ鮠羞ﾖﾒ吐8ｯｻｼBｩﾚg0G1ｲ｣督*ｭﾅdw
)D,ｾ應ｽｨﾉfﾆｹｼﾄexﾔｫ介ﾓｦ'餒露ﾏVﾐ\&9ﾜ蟇罌[y倖l	q蝓ｶW冉跨ﾒﾁpw｡`/膏Qｻ{測｢/SｲYO旋ｰﾈ~1Z\杖戔ъﾟ:ｾﾙｳﾜU6Is熏+･Grﾎ5]鳶\ｧ7ﾌﾛjrﾆVB_nｿﾎﾗqO`ﾘ)檎S藥ｮ
環.Uｧ席$e肓箸SｯCAO鴛,Vﾑ芫ﾕ$ｘGZ鰭Tx4"ﾙ渡ﾉkﾜ	Dxﾝ)H搭{A*NBｪI!憇Ix3`ｨﾛ補td-Dcﾝｴﾂ%#ﾚP&ﾖa1iub｣BｶYG&LｲnﾟｦｽWzr口{0｣S｣ﾇ|06e/GRﾔ鉄bｰub＾RJ/貍ｮﾎQｽｦﾐ9LH5ﾖﾃｧｲBｴｳｾwﾀ.fﾜｷｸ擁ｷﾅ>ﾌﾃ/ﾀZZﾅﾃﾘ#瀑讐ﾃ]<ﾄx9	<|bUｲﾔｶｹbｸ！圄3ISﾕ$lｩLa(錚YﾎdΛﾁﾍﾟ#ｫ黜SJ閃
ﾁ^*:諠海,荅1E<ﾃ0w"(昿D<ｸxｻﾈｳ[ｦ莓婦ﾂ､ｺﾉ簍ｭ,ﾏﾊ嚴["恍嬉l
Bu寢cDxｻ芦8ｯ'ﾉ到ﾒ7ﾑﾟｧﾖEｦ駈GSｵ泝万ｱGLmﾏUﾞ3%i諚ﾒｴ*BﾁHﾍi-巣､ｴt"ﾋi-ｳｴ[峨ｳ+､)ﾍpKjnQ昌$ｵｬR3sjEHK/ｧE>gｯｨｴﾝLhRRv1ﾄﾖ鷓vﾊs$ﾎ#GｼｧxΛ{-蝿ｷ1Sｼカ.;ﾋ[,｣V|;DﾅGxJ|跨ﾄｺ_?稾ﾝｿ5`qｭﾓ慷K5ﾇm槨?PKﾈsｩ∂PK#ma5*antlr/collections/impl/IndexedVector.class抗[OAｦﾛRZｶ\忌B-ｹｴ韮UBB
ﾂ｢o杳弟ｶiｷﾄ孰ﾐDJ｢憶&(7ｻ宸ｰ3ﾉ9s譛;9ｿ~`/@>勧8B(ﾄﾐ城(赫DO冲娜#ﾔ鷆	ｷﾑs5z喪└^t車*u充U 訃Aｫpw|ﾐｮｻDD;ﾍﾄｾﾟjｾvﾚ!b~%ﾉ6逝&ｰEｲ2雲1;\ﾟ髟w('ﾝｽﾈPK;宕PK#ma5%antlr/collections/impl/IntRange.classuQﾛJﾃ@=屹Wﾓ況ｶjｫｵ^ -<ｾ(>(△`E1mｷ%%ﾝ曝]
ｶ?ﾀgS/`13ｳｳ醂ﾎﾙ}xy``?%白HaMﾂz)ｨ(I('P倉SﾂVﾕ8ｶ｢mﾞwｳ"\tb'姿４ﾚﾒ-ｫ~ﾋ桀]ﾎ仁:_紫mﾟﾘm*佳kｾ#ｽﾞﾘｶ鰛｢oﾎｫﾇｩ7;ﾂ琢ｴ%Ｌﾚ諞djﾈ｢ｦACZCi秬ﾙｸﾗ羸2(!ｳ=
+(0Tmｸｾﾙ\謡ﾇｦ3ｹ踟ｹﾟvW楕.ﾄﾑ(4Zﾖｭﾅ｡辯ﾒ｢｡鬨Aﾞ<ﾐO ｿLﾐﾕ!GｸLｫCZG(f3ｰFy･Q D%Eｧ_,dKj8LPKzj,PK#ma5#antlr/collections/impl/LLCell.class}粧Jﾃ@ﾆｿmccﾒﾘﾖ"zlS>筵瀛ﾑυ&]dﾋv#q+ｾ<>枇･ﾞ彳>冩ﾃ|~ｽ話?Eн61vc｢Z`ｨ愈IKｧｽｼ)岬逵yN崩ﾁﾕｲｬ懊ﾀVQﾚﾕンJﾍ茎4v.ｬｷ甞濮3椏4ｫFｯｬ7ﾗUa;]8vﾒﾛj]玲ﾊ6E8meﾘBG琅ﾟﾟ;ﾚ｣g<4粃-&Ah"ﾆ6U%Hｩ]V9'ﾍﾟ ﾉ+Z/OF痴ﾄﾇl或oPKﾙZ晢UPK#ma5*antlr/collections/impl/LLEnumeration.class}Rﾋnﾓ@=萄1qLÅﾌ｣b^bSｱ0｢	v3"ｮ&vｷ
]燃	$ﾘｱ爛gPﾄ｣ｨ竚釵s=sfｾﾀ桿ｮVa｡YEmﾗｱ&6,Ttｮk陏ﾘ4qﾃﾄM゛X､Y
t ﾎU黼嘘2ﾌ｣$ﾎｼhｺｯ<ﾟﾟ谷=0T泌ﾓ歌展yﾅQD`ﾃYLｽdﾓｭd,V(杢ﾅt$ﾓﾁH鯤$ﾈ'ｩ*9敏	駁ﾞk〇,yP狆ﾓす〒差3ﾚJｰv"
衲Hwｪ0.ｦ2
ｴａｦﾛXツcｫ&z6\,ﾛ8ｫ｡ｿ:y､ｼdｷ'qﾃケ&6nimｺｧ橙ｯｹｫ'
4Lﾊ｣ﾒ帶"hﾝDcﾖﾂ{#Mﾆe艨6?ｻpﾘ()ﾑ闖ﾋ険｡N<ﾇﾝC24ｧCｸ#能wﾒ#倨0MbUｴ0Co輓\ﾗ牛oX2ﾋｿ距9ﾘ_(F/簫ｼﾙ|~ﾗ挨wｨ}F袗1ﾌｯｺ庄･3悖ﾕ'葆蜑q歟0s匈ｮPK\ﾑ懊APK#ma5"antlr/collections/impl/LList.class控MOW=ﾏ3cB
!#ijﾆｷ!M$iS ﾊPｩD蔵ｪﾚﾁ~ﾅCｱk蒋ZｩｪｻlｲH､､ ｵｻV鶲髀h{ﾘ倭ﾂﾍｼ9ﾜsﾏｽﾏWSﾄBｮ･pﾓｮKxﾟbｸ詑MqﾜJ1ﾌ$0k!%ﾀ8ｸmﾁﾆ9zWｰH0＋	|搬|
fIｻE他н5W(ｾ.Э9ｨ蠑搖淪鉗ｵﾏｺ椡uｰﾔ2_n{ﾞU0ﾒ	/ｵﾂﾙｼ靱ﾎｦｮ>p7}n9ﾒm騒ﾝ`+鱶6ﾌﾉｱｸ[ｩ閠ｫｨ}･HQoz8恫ﾅﾇ]*､衣ﾑAx/$ﾂﾏPﾖCﾏﾏ-]u寛xI{[･0*%ｽ獸脅v喜
*ｚｮ
ｵF･\｡布斎｡ｼXk蚫ｵ{窶変{ｵpJl痰>ﾛ0印6F1｢p? Gl,｢_aｰ遮ZｽPZlTﾙrﾇﾆ}|ｬp薺ﾆ7ﾊ%ﾋﾈﾘﾃｸ混>(+Q鈩7E｡v璧ｵﾐ-|Cﾇｳ閹ｮBﾏI
K>嫖o倹ｶ5ｪ?ﾇa障-ﾂ)&倪sｴﾒjｮg､古|ｻNｼ籘A9j1	cﾂ|ﾁ}ｶｱ弓 櫑ｦ.)\ﾂH殿1ｮq'
gｬh:"臧職ﾘf_ﾏ!ｱ箴3'ｻﾁﾔ"ﾁdｧ#ｻ共I兩ﾑ5$聟ｼWﾑ購XW嘴8lb祷a4･ｫﾔ"ｹ2ｳｨ"st#ｵｾ7y}火ｼﾓxH恰(]鷹2ﾏ[Y
pgq.ﾜ"3ﾍ穩/ｯ$Wｨｧ啄W徒ﾚｸ#ｼｫ徳cﾂ/HN2ﾗ'1ﾅ5ｹ涸dｴ倡tr踴8ﾏポﾅﾒ曾WYsﾃﾕ1V&}Lﾃ^g/ﾏ且GVﾓ鷲ﾂ/r鋪Y3F.6T!Vｲｬ!KuﾗO0潁%ｹﾂ靴満ｨ
*恷mpｾ潘ｶ5_6'`:bt襦L蹤ﾔVｯeﾘｨｨ1mi6臾GｻDk<\ﾃ6ｯﾒqｲ5煉&ﾓ叢^o左7Fs}wﾄｩ/Aw%'潘ｮ彬ｺyNﾄﾔ?r筐I.歡x_PK3ﾂ#PK#ma5#antlr/collections/impl/Vector.class}U[wUN.$MｴP叩Jｱ
釘ｸYﾐ^-ｭ岬Dﾊ}堽dM&<與pｹ麺ｺx癸ｺ､uﾉ}ｯﾔﾌL＠sﾙg淇ｿﾌﾏoｯ慊B aｮ.*HﾎK4O*漏0ﾆ%\a&Yﾌﾉﾃ+Z,($Ｏ\静ｧ!,ﾊｪ"錚6e+ﾂｪ5　Aｳ5∪ﾛﾙ-ｱ)iﾆ｣ﾌ譁楾'ﾚKZﾕ/馥ﾝｰﾄ｢@ﾛdﾑ(ﾚﾓﾔｼ=gtｮlﾑﾐWj藪ﾝｺｮm防	､蠣Vｩ錻｡｢?4ﾒ/蕃*Zｾh?u3O0_2
ﾆ9:ﾑ
XXw#ﾎ81[<洙ﾀ烝爆],e謐ZYｷ4ｻhtﾔ綱ﾍﾒ鉤:,ｽl>ﾖﾟ錠法ｴｪs#aｴps8T均XI$gﾖｬｼｾP簸ｴﾟ牾i搨7｢8蛎9$｣H煦@ws(bGｩｺ･pB ｡vﾉﾊ莽R寡ｬ｣)+･U炬#ﾂ應qﾅｴsｵJﾅｴlｽ0$ｯWﾗ｢XG呪5ﾃ0､ﾃyﾒシｭUtKﾁ(>ﾃ(ﾎa4観qS ﾕ>cYﾚﾓE｣?Yｭﾙｫgﾍ啣ｨﾖ嵩kﾎｶ竿｣ﾙﾚﾃｺﾅH` 9=部ﾛQﾜﾁ]I
&'透｣ｭqｿｦ%ｯﾝ｣妍ve併ｧU[/S_ｺEﾝfﾍﾌqﾙDｧk蜑0o矧ﾜ阜&1ｸ59k抽ｼY｡ﾔVJharﾔﾑ貔ﾘﾛ2~/k庖ﾝ!ﾛt-ﾍ/ﾈｻ*p,扶/ﾁｬ
Cｮ p>ﾎﾔ ?QｩQﾎｴSｲｸｦ牀ｨﾝ=亜ｸd
ﾐ~酊ｰwa忻yﾒｫﾁｧ^ﾂｯﾆ~G%ｍｻｽL蒭0?X=萬脛ﾀ1ﾉ#ｮｪｿﾀ|ｰ6.れwｷ3挂DЮQぇ｡u｣^$ｹ汝暾ｯ_ﾔｴ9ﾖ<ﾟﾇ:柁E木?ﾊ>G銓ﾏ咽ｶ"*vﾒ.:ﾜZd8Zﾒ+:ﾓ;娯#V蓙
鯉カ{'cﾄz|p嚮效y彳niﾃ3ｯ{絃Bﾗﾆ+to｡'ｶ謹ﾞｾ]pﾎｸﾙE}#ﾍn鱶Kﾘﾙ掏ｬSrﾆ]"塚X籬f綾!2!
ｿﾂ｡
ｲ1ｸﾓDﾝ]Nﾕ嫂bHﾙﾒ恭ﾀﾜ62r^v6ﾁ/ｦiOlC4ｭ&\
ﾇ営ｯﾉ^｣夘ｨL*Uｸﾄ?[縫-S\+ﾌｴF聴rﾌ!h77^誦T\雁ﾉｰｳﾚ'ｷg?聒EN竇鯑w椥8 W`+ﾂﾟ菌ﾈ斈-ｷｹｿCﾁﾜe{lﾞ}\：t侫ｧﾏｶﾓﾅU&*)ｦ凅祈ﾆﾟﾑHH:ﾞFHI堙､ﾘ"/ﾙｩ2?ﾜ&&Pa,z忰khﾉ:ﾏ･Y_q<ﾏﾙPKｧ泙yPK#ma5.antlr/collections/impl/VectorEnumeration.class柘kﾓPﾆｿﾛdﾍZ聚ﾕｵｮﾚｺﾚﾍ-Mﾆ *ｾH｡嫣eﾐｲｴ[F嚮4|ﾅ香%~7-t1ﾜﾋwﾎ捏Oﾎ?ﾟﾘﾀzYﾜﾋ ﾒT2ｨ竅4Kjｳx櫓u
ﾋV4<Hｻｽ8忙N貸}汳ﾛvB@x\oy螂x+⊆;肯uｸ
膸^瀟
]7炙}ｩ8ο0r崟ﾛwベ ー＋OD｣ﾑ:tﾛw}]薪ﾖ知ﾃｨ鄒$ｩ4Nﾗ}7rd且^ﾗ｣｢qImﾇ匠ﾆｱﾈ$､81萇ﾑ*\yﾌﾓ[琺	#dLﾎ<0ｭ3､Lﾊ7JﾌI[J[｢ｽK"!ezPﾞｺDﾖﾍS､:ｭ_ﾜy<	奧ｪb裟lZ｣FjｨpNﾁUKq嫉П｡ｷ*G冕菓ﾆ3悔u4cvｨｨｻｬｱ5餒A;ﾇﾅ4ｯ鴬､Xx野羮%ｲY9ｽﾋ|ﾏ
ｽｫｮﾑｻH=_PKＷsPK#ma5-antlr/collections/impl/VectorEnumerator.class柘kﾓPﾆｿﾛdﾍZ綮ZWm]賍&cE_､ひMXeﾐbﾚ-#MF嚴?>窿ﾂﾆ@ﾁ±ｿ婬*cﾌﾀ=rﾎｹｿﾜ弐ｷ6ｰ昿w3ﾈ燼4ｪｸ/ﾍｲﾚ<d詮]ﾃ恰U
ﾒﾇﾎ 
B∝種G^h
ﾏ｣ﾋ
大8G%ﾋXI4ﾗ>z鋒ﾂ衞YLof,ﾆｷｳYﾕkﾑ紅叔ｽQﾈｸｪxｻQ顫ｨq(ｲ 	)ﾎｱ?ｴ
Wｷ-2'g廚Rr+]ﾔ､-@･-ﾑﾞ!t艶2#(Nﾛｼ.爽ｩ^'7EO｡~┬~が苫帶dｙ*彝pﾕ=ﾑX	Fｫr宣-Q-瘍競ﾏｮ笳噸慯｣wWﾀﾊ剴/ﾟ宅ｴsﾌ_ﾌt
ﾙ}Zﾊmﾆ｣､#ﾎeJP9ｰ,ﾊ
pT<ｼﾃ&ﾃﾜcｹ釿=ｪｶPｦF滸\ｭ1ﾁｻPJ$k-4ﾃ鳶ﾎB>4"aﾈﾖ^騫4ｼｮ0癒暾V#ｮｺﾁﾗv_tﾍﾗﾕﾂｴ､夜tｲ7[ﾓ	･ﾆZBOｵVｴ]R栫]Sy丼6駘oﾜﾝｰﾝｽ沽喪)(ﾅWX?!trqoの/d?g&俥 欷､_8$蝋ﾅT{oｭ!旄
PK熙9幅yPK#ma57antlr/debug/misc/ASTFrame$MyTreeSelectionListener.class控ﾝRﾓPN)Mァ･ ｱ@*"E*Z棲#絛ﾚﾚ0mﾒIR倍o}	oｼﾖﾃ湖>｣Ia造卷ﾙ槹vｿ=9?~};0「aﾐｷ1ﾂﾄ$ﾉhFﾃB縞#!ｾFﾅ2&cIaBﾊ､Xｦ$ﾜ0#Cﾀ)騅l庁'｣NﾙR独p禁Ix==?]ﾀﾎ協/Gﾎ!aﾉEpﾜEﾈ笞薄恨ﾄ<娃3ｮﾗﾉ5O涅ｶｾｳOｿ仲狂SAi!ｸ^ｺﾃ｢F?&ｩｱﾉWｴ.5ｼ未ｸ/國ﾈvLPKJｵｶｱPK#ma5antlr/debug/misc/ASTFrame.class}T]Sﾓ@=K[C[衢DJK!"*Eﾘbj+Xﾐﾐ`4a 陬ﾈ要ﾆﾎ8>:(ﾇｻ
((ｵ3ｽ{ｹ=ｻﾙ?ｿ|07
.a\ﾂрnK狼ﾃQL)ﾄ]ﾜﾇｴ
ｺ極a2f筍91>挺XﾆｼＴX紳ﾈX伐$cY`燈芯(|(yｹﾍ+∝:yﾋｸﾃ=5醪hﾘｦs!ｶ措,e%uｮｦｬ广无･ﾜ斗"岬hﾖrｬ`!ｭ裃呻Mﾝ6ｽx無橡Sｪﾗ>ﾅR&ｹﾎ5ﾜ*g靉[_ﾝｫmsｯdnﾛ4ｭ剿ﾃﾐｯm[O$*EwﾏｫeKｻｩﾜｲgﾖﾀｪｸﾉｰk賓5ﾋｯ鍜ｨmD碓I\pﾊ~f:ﾜ@ｻｱE匸0ｫX#qﾜ汝Lﾅsｼ`ｸﾘ樛$TQRｴﾏｳ!Tｬ尓ﾀ>按､ﾏ況5ﾂｼB雙1[ｫｹ!:栗嵎0SCm2ﾄﾉimbd鯊ｬﾚ\ｴｹｩbｯBﾕﾝﾟ'陛叛SZﾌｰ撲ﾛｨｸ>dﾃｪGﾍb､Z-a3'ﾖ{RU? [･zvx@&qn.%Cﾊ諧ｺa=ﾜﾟﾉYYｭ2$ｵ)ｵ]ﾗ｡r冂;_ﾛ~Gｽ[
續ｱa9UwﾏW5z,?$|ﾑJ培ｭ愁1ｦ蚌b&｢	ﾛYｸpQ薇ｻ轟21ﾞZ6Wｨｺ藜7･m&ﾗqガ
wﾐx#`4#｢Q官怯ﾓ汢[@ﾍ|､掠独袂Xｬ猿rｪ∧jﾑrｱrｺ¨ﾖ4Mﾕ!ﾏﾄbCﾑﾄ:乃]ｪﾖﾑ搖縵悋顋L4ｲ｣惜ﾞ｢)`､ｩ8tz!3-ag畝ﾕ隻'z｣4R釵rgc船ｼ柴7+､ﾉ?u鴎D4;jbｰ"ﾒVﾇ｣u\娑,=ｦI9糘鮎ydｱRfｬ･Qﾃ4&ﾈj^&ｿｭﾟ/PKｽIBｿIPK#ma5$antlr/debug/misc/JTreeASTModel.classUﾟSW=K6ﾙﾒ@ﾔPﾐ挨｢ｕB$
ﾁﾆ>8ｳI.d斛ｮｳﾙ ｼvK:S}」ﾚ2鶚ﾎ?駝ｶ輜Q0ﾔﾉﾝﾜｻﾟwﾎﾎwｿ
ﾀ8
!D1ﾞ賛､5L1Sｮt ｫｮ1BSr~=n1B'ｦｘmﾇ-|ﾄ跼ｵy
2
Tﾇｶ]銓ｺ蝴Nｺl屹(ｻmﾕﾓﾅ漂ーeｸｷ%NyL珪
ﾎ
Kｵ恥V痛豹ｽRYqЧ龝3oﾔ]a	GA"ｦo陋鴾ﾃZO
aｹ髀<鞨ｺp3Uﾃｬ(nf･M9ﾋ･gT1xMA蹉RﾆnXｬ/ﾚ"s$Gﾁ戸Yｱｹｼ?ｭs5>ﾜMｴ0點｡ｯ敖┛;｢fol鑁Cdm遑V3U	j8塒<ﾏ4ﾔJ$ﾝSYC6#r_FｳgﾛｸL#;a愿yエ9ｶx]7逹F痕Yﾜ,狗ｲ
ﾂrﾃﾄ鉱ﾜj丿ﾌ^d}-7FYﾜeｫ襲Gﾟjﾚﾝp隣ﾘ妍?ﾘｽuﾅｫ:ﾁxYﾃV$Lﾔ羞晄qｾfｺ`裲｢)NH`e&9\%紙\rｫ｢嚏ｿｨﾚQY7M:wｫ慟ｶﾘg+^nﾕｮﾌiﾈｱ$ﾋｿﾐ,ｿ"J索tﾍｨ燐ﾇ|Vﾐ}ｲ5|媚6r?ﾞ乱ｭ;ｶk完ﾃHｯ･rog
ｧ~VﾄｸN{{ｻ[嬾ﾑ(ﾉB鯖)ﾊzjdｳ
iv!兔	ｽFﾋﾜﾏ衫ｴpR
ﾎまFﾛ?>次s悶9ﾕﾆ@rJRm｣ﾐｾﾕ絢nr葱?2@A?ﾇ>_ ｨ△<ｾﾎzｰУ0ｰ1^V9J
x9^D|?;ｲKﾀ諦倣ﾑﾟ(舷ｦ`F昆梵瀚､}｡]ﾟｴ?ｦ痞ﾔﾟ="1-:dﾔKｿ?c!ﾏ8:8^､ﾄ8ｱ9ｻ|A舛
sL`#ｸ$Oﾛｳ.qｽｩﾇ?読M声乏椣ＰZﾛC佗_xｩｯｨ謳Kｨ魯ｮ穿*]ｻFoｦIt昜7(qﾑ)ｪIjﾟｧ｣{ﾐRﾔ鶲YSS?ｴｰ$
→ﾍ{tｮFｺvpfP4ﾜ踟h枝徃hXzP[面フ衿yｬﾀ!ﾖﾗﾔ<ﾀｻlｨ?3ﾚｶOtﾇa目ﾍｲ<ョｮv殫45Tﾟ総<蹂-m\･弘d萼)ﾇ$Fﾃ$ｩﾛﾂg楕ｯ9
y:M(q%裔PKv敗	4ﾑPK#ma5$antlr/debug/misc/JTreeASTPanel.class百[kAﾆWﾗmｭ4Sﾓ\t｣n
JQPRｸ ﾖ]YﾇXBM｡Uh殉闖*=｣*J｡,{偈捏;ｷﾛwy惠cKﾁｶ
ｶTﾄ慎ｰ｣bB､､ぺ
筍ﾔ､ﾘWpB到U､	B預G
ｲ
r~痃ﾎ/]7襾｣ﾛｷ恂ｮF`!pb9堀ﾃ6=c1)ｻMnfl;blｬr7:%ｫ+ｸﾃｽB謦ﾃ)YｯﾚuﾕﾌｺMZu{^Α[R燕S8ｭﾖ.LﾛyI>ｫl}a愡^怒%s璋｢sUﾈｨﾇVｰJ彡$osU$M獪iﾙｼｩ	柬xk3WT枳ﾛ2	
/Rﾁ+
ｯqL薦*怒R｣F%MGﾘ樮蔟^ﾋh[ﾝ1?ﾕ3s\Jﾋ┝\L柿HL<.oｕMﾇlM[ｷﾏ)H宿ｧ'憾Eｩ]xn{bﾀp8ｽﾓ6)諳喃R賂dｺﾙl.C6_Cｷｸｸｴxｿ縻TﾕF:3ｻ^L8ﾔﾊAｫEｷﾝq-d刔ﾎ徽E萱@弯｣欸c|bｴ)k$ﾗI?}@E鮃]魂4─射WG#ｾBﾑｿ@c｡!ﾔ├"|骨TrCﾜ娩z.vo郁1ﾏI*ﾉqｬ Bｬ	lﾛ'iS8ﾆ.ﾎｱ2)b倒}HPK$ﾏDPK*ma5	META-INF/ﾊPK*ma5RぃWFF=META-INF/MANIFEST.MFPKma5ﾛ}Qﾔﾎﾅantlr/ANTLRError.classPKma5ﾀﾂﾇﾗantlr/ANTLRException.classPKma5=)ｳ$KO%2antlr/ANTLRGrammarParseBehavior.classPKma5靆\)ｯDﾐantlr/ANTLRHashString.classPKma5iｮFFﾈ
antlr/ANTLRLexer.classPKma5Τｴ7E.ﾊmｺ'antlr/ANTLRParser.classPKma5ｫQｵｰ｢DVantlr/ANTLRStringBuffer.classPKma5w稍謝
 ?Yantlr/ANTLRTokdefLexer.classPKma5Jｸ\gantlr/ANTLRTokdefParser.classPKma5ｦ鴫;H'6pantlr/ANTLRTokdefParserTokenTypes.classPKma5Tﾐ7ｸﾂﾆqantlr/ANTLRTokenTypes.classPKma5Lﾇ}&Jﾇuantlr/ASTFactory.classPKma52M#>ﾄUantlr/ASTIterator.classPKma5+ｲhv#ﾘantlr/ASTNULLType.classPKma5ﾄDu宕antlr/ASTPair.classPKma5聿喀antlr/ASTVisitor.classPKma5YT}ﾅｭﾓｵantlr/ActionElement.classPKma5_rｨｯｩantlr/ActionTransInfo.classPKma5Γ7lY嚴antlr/Alternative.classPKma5ﾊｨ&nd
Kantlr/AlternativeBlock.classPKma5Gｱ眦dantlr/AlternativeElement.classPKma5ﾙｺ央2antlr/BaseAST.classPKma5z覡伶Fｪantlr/BlockContext.classPKma5K尨｣ｫﾇlｬantlr/BlockEndElement.classPKma5ﾁЫﾂhZ$`ｮantlr/BlockWithImpliedExitPath.classPKma5^ﾓﾛｰantlr/ByteBuffer.classPKma5[+ｮcj$Yｲantlr/CSharpBlockFinishingInfo.classPKma5ｿﾜｩﾈｨｴantlr/CSharpCharFormatter.classPKma5B<ﾏnﾓｷantlr/CSharpCodeGenerator.classPKma54歩a｢&antlr/CSharpNameSpace.classPKma5ｾｰQ8(antlr/CharBuffer.classPKma5ﾌ]軸%ﾆ*antlr/CharFormatter.classPKma5uF@ｫﾌｿ+antlr/CharLiteralElement.classPKma5粒Aｫｶ.antlr/CharQueue.classPKma5xffTﾏ,1antlr/CharRangeElement.classPKma5[s禿
ﾓ5antlr/CharScanner.classPKma5椦ﾆ>ｿﾙCantlr/CharStreamException.classPKma5?u#ｩ!薀antlr/CharStreamIOException.classPKma5､w纐#
#]|antlr/ImportVocabTokenManager.classPKma54:antlr/InputBuffer.classPKma5d.ﾍc"ﾂantlr/JavaBlockFinishingInfo.classPKma5:ｹ~uantlr/JavaCharFormatter.classPKma5Ds､Vjﾏﾛﾐantlr/JavaCodeGenerator.classPKma5ｬ+/qantlr/JavaCodeGeneratorPrintWriterManager.classPKma5ｮU8R隋antlr/LLkAnalyzer.classPKma5P~Qwﾏantlr/LLkGrammarAnalyzer.classPKma5ｾ･\,Uｫantlr/LLkParser.classPKma5
ﾞgQ*
antlr/LexerGrammar.classPKma5D横	:!X$antlr/LexerSharedInputState.classPKma5)#@T2*'antlr/Lookahead.classPKma5p{ {CQ-antlr/MakeGrammar.classPKma5&@ｲRﾂ	#Nantlr/MismatchedCharException.classPKma5):ｶV]
$ｴSantlr/MismatchedTokenException.classPKma5^O;4cZantlr/NameSpace.classPKma5@ﾃ{Bs ﾚ]antlr/NoViableAltException.classPKma54衂ｾ'ｲ`antlr/NoViableAltForCharException.classPKma5本(嫩antlr/OneOrMoreBlock.classPKma5 2'ﾇfantlr/ParseTree.classPKma5働不
+uhantlr/ParseTreeRule.classPKma5ｻ;ﾌ沺ｼﾉkantlr/ParseTreeToken.classPKma5ﾉf
ｰmantlr/Parser.classPKma5R?鰭ﾓxantlr/ParserGrammar.classPKma5ｨｴｵsw"}antlr/ParserSharedInputState.classPKma5甌/ﾂ Eantlr/PreservingFileWriter.classPKma5鉈Yｶ!antlr/PrintWriterWithSMAP.classPKma5ﾊLh$ﾇantlr/PythonBlockFinishingInfo.classPKma5|*s=″antlr/PythonCharFormatter.classPKma5(｣ﾐxUjCﾕantlr/PythonCodeGenerator.classPKma54TｦjU ｭantlr/RecognitionException.classPKma5‡｢E
ﾕantlr/RuleBlock.classPKma5ﾜ沺Wｲﾔ	antlr/RuleEndElement.classPKma5$%I7antlr/RuleRefElement.classPKma5｡M碍antlr/RuleSymbol.classPKma56 ﾗ%antlr/SemanticException.classPKma5ﾐf|~antlr/SimpleTokenManager.classPKma51Wﾛw Oantlr/StringLiteralElement.classPKma5^2ｩantlr/StringLiteralSymbol.classPKma5[呷綸hantlr/StringUtils.classPKma5i)ﾕ(!antlr/SynPredBlock.classPKma5ﾜ}ﾒU#antlr/Token.classPKma5%m}9ﾔ&antlr/TokenBuffer.classPKma5柘5*antlr/TokenManager.classPKma53阡w+t,antlr/TokenQueue.classPKma5d%jﾞQ/antlr/TokenRangeElement.classPKma5/kﾏ^`3antlr/TokenRefElement.classPKma5
ﾞmｲﾊｭ6antlr/TokenStream.classPKma5寳"7antlr/TokenStreamBasicFilter.classPKma5坐g g:antlr/TokenStreamException.classPKma5紂ﾐ(ﾑ;antlr/TokenStreamHiddenTokenFilter.classPKma5ﾝｧ惶	".@antlr/TokenStreamIOException.classPKma5c`lc0+Aantlr/TokenStreamRecognitionException.classPKma5nt眇ｲ%Cantlr/TokenStreamRetryException.classPKma5:ﾗｮ6ｼ&Dantlr/TokenStreamRewriteEngine$1.classPKma5QT-Eantlr/TokenStreamRewriteEngine$DeleteOp.classPKma5/|ｦ@q3QGantlr/TokenStreamRewriteEngine$InsertBeforeOp.classPKma5G相?ﾆ.#Iantlr/TokenStreamRewriteEngine$ReplaceOp.classPKma5鷙|OE5Kantlr/TokenStreamRewriteEngine$RewriteOperation.classPKma57Mﾟﾅ$ｸMantlr/TokenStreamRewriteEngine.classPKma5"tK櫂D	ﾏZantlr/TokenStreamSelector.classPKma5\ｴ`_antlr/TokenSymbol.classPKma5\ｽ]o5aantlr/TokenWithIndex.classPKma5X >U/cantlr/Tool.classPKma5gcuﾗ>{antlr/ToolErrorHandler.classPKma5ｸﾔf,3|antlr/TreeBlockContext.classPKma5韃樊繃antlr/TreeElement.classPKma5庚暝
antlr/TreeParser.classPKma5ﾄﾓﾕ&Zantlr/TreeParserSharedInputState.classPKma5｣ｼ,ｧｸxヨantlr/TreeSpecifierNode.classPKma5{ﾗgantlr/TreeWalkerGrammar.classPKma5笵lﾊﾉ-ﾌantlr/Utils.classPKma5莅ﾎ'ｯﾔantlr/Version.classPKma5ｩ}4<antlr/WildcardElement.classPKma5ﾊY')antlr/ZeroOrMoreBlock.classPKma5"､ｦaq!antlr/ASdebug/ASDebugStream.classPKma5渤Yｲｰ"7antlr/ASdebug/IASDebugStream.classPKma5V3ｲﾖ~#7antlr/ASdebug/TokenOffsetInfo.classPKma5
KｿQN､antlr/build/ANTLR$1.classPKma5Wｧ/ｧpantlr/build/ANTLR.classPKma5ｿ柾R勍antlr/build/StreamScarfer.classPKma57ｭwﾔ8ｨantlr/build/Tool.classPKma5ﾚｫjPｰantlr/collections/AST.classPKma5頁ﾃdﾋ&/ｲantlr/collections/ASTEnumeration.classPKma5J泝ﾄ""ｳantlr/collections/Enumerator.classPKma50ｾ|
ｴantlr/collections/List.classPKma54ｲﾇﾍ%Oｵantlr/collections/Stack.classPKma5,>ﾎ
=&gｶantlr/debug/DebuggingCharScanner.classPKma5u‰v､&Nﾁantlr/debug/DebuggingInputBuffer.classPKma5Bzﾂ!ﾅantlr/debug/DebuggingParser.classPKma5Cﾆantlr/debug/Event.classPKma5~A+耽F管antlr/debug/GuessingEvent.classPKma5ﾇｸｵｴ?$5ﾉantlr/debug/InputBufferAdapter.classPKma5EZ>ﾖJ"ﾆﾊantlr/debug/InputBufferEvent.classPKma5ﾓﾘﾓ
)ﾍantlr/debug/InputBufferEventSupport.classPKma5[｣Fﾇ2%ﾉﾓantlr/debug/InputBufferListener.classPKma5XYPｫ%耿antlr/debug/InputBufferReporter.classPKma5ﾉMｪ
h$瞶antlr/debug/LLkDebuggingParser.classPKma5LV\ｮ=antlr/debug/ListenerBase.classPKma5ｱ6P!	 7antlr/debug/MessageAdapter.classPKma5杵ｰﾚ_Nｦantlr/debug/MessageEvent.classPKma5梁ﾔｫ!Qantlr/debug/MessageListener.classPKma5ｨJ有ﾍDKantlr/debug/NewLineEvent.classPKma5ﾙdﾑ4ﾐ!dantlr/debug/NewLineListener.classPKma59｢ﾀ&Y	&Kantlr/debug/ParseTreeDebugParser.classPKma5kﾓ}_antlr/debug/ParserAdapter.classPKma5｢ｳ"3antlr/debug/ParserController.classPKma5aq&D'P+$6antlr/debug/ParserEventSupport.classPKma5際眄f ｯantlr/debug/ParserListener.classPKma5ｧ3$ｻantlr/debug/ParserMatchAdapter.classPKma5褒tH>"@	antlr/debug/ParserMatchEvent.classPKma5旧ｸ+%ﾎ
antlr/debug/ParserMatchListener.classPKma5W,Pa ﾙantlr/debug/ParserReporter.classPKma5ｻ=$$ｰantlr/debug/ParserTokenAdapter.classPKma5脇V暢"&antlr/debug/ParserTokenEvent.classPKma5zﾍﾇｬ%antlr/debug/ParserTokenListener.classPKma5ｬa	*antlr/debug/SemanticPredicateAdapter.classPKma5ﾛ姪`ｧ(antlr/debug/SemanticPredicateEvent.classPKma5莉Eh･+antlr/debug/SemanticPredicateListener.classPKma5町權7+antlr/debug/SyntacticPredicateAdapter.classPKma5ﾑｭ$ｫ)antlr/debug/SyntacticPredicateEvent.classPKma5bSetｾI,  antlr/debug/SyntacticPredicateListener.classPKma5吩ﾈﾜ8!antlr/debug/TraceAdapter.classPKma5ﾊsgﾛ-"antlr/debug/TraceEvent.classPKma5D｣ﾜｺ%antlr/debug/TraceListener.classPKma5w_Feｪ&antlr/debug/Tracer.classPKma5 >ｷAﾊ
ｴ 6)antlr/preprocessor/Grammar.classPKma5iY0ﾘｬ	$N4antlr/preprocessor/GrammarFile.classPKma5)ﾞG"x9antlr/preprocessor/Hierarchy.classPKma5p)lnjﾟAantlr/preprocessor/Option.classPKma5R4aｨe*%:Dantlr/preprocessor/Preprocessor.classPKma5<滷ｸﾍ A*5Yantlr/preprocessor/PreprocessorLexer.classPKma5_ﾂﾁ/Zsantlr/preprocessor/PreprocessorTokenTypes.classPKma5Emkzｼ}xvantlr/preprocessor/Rule.classPKma5e6ﾃx|antlr/preprocessor/Tool.classPK#ma5<ﾘ､<,4|#ｾantlr/actions/cpp/ActionLexer.classPK#ma5｣%-Kｱantlr/actions/cpp/ActionLexerTokenTypes.classPK#ma5ｱｨｰaE,&糞antlr/actions/csharp/ActionLexer.classPK#ma5P:0.antlr/actions/csharp/ActionLexerTokenTypes.classPK#ma5at?*ﾁz$antlr/actions/java/ActionLexer.classPK#ma5｣U?S
.
antlr/actions/java/ActionLexerTokenTypes.classPK#ma5Pｫ鬟+~&Yantlr/actions/python/ActionLexer.classPK#ma5皮Nｰ,0P;antlr/actions/python/ActionLexerTokenTypes.classPK#ma5V'x`$ｫ=antlr/actions/python/CodeLexer.classPK#ma5ｬn｡N｡.]Iantlr/actions/python/CodeLexerTokenTypes.classPK#ma5Tｧm7%ｻJantlr/collections/impl/ASTArray.classPK#ma5SｺB*ELantlr/collections/impl/ASTEnumerator.classPK#ma5ﾈsｩ∂#ﾟNantlr/collections/impl/BitSet.classPK#ma5;宕*
\antlr/collections/impl/IndexedVector.classPK#ma5zj,%^antlr/collections/impl/IntRange.classPK#ma5ﾙZ晢U#ｨ`antlr/collections/impl/LLCell.classPK#ma5\ﾑ懊A*鐶antlr/collections/impl/LLEnumeration.classPK#ma53ﾂ#"#dantlr/collections/impl/LList.classPK#ma5ｧ泙y#5hantlr/collections/impl/Vector.classPK#ma5Ｗs.$mantlr/collections/impl/VectorEnumeration.classPK#ma5ﾇ*q-oantlr/collections/impl/VectorEnumerator.classPK#ma5熙9幅y!鑷antlr/debug/misc/ASTFrame$1.classPK#ma5Jｵｶｱ7ﾔsantlr/debug/misc/ASTFrame$MyTreeSelectionListener.classPK#ma5ｽIBｿI黐antlr/debug/misc/ASTFrame.classPK#ma5v敗	4ﾑ$zantlr/debug/misc/JTreeASTModel.classPK#ma5$ﾏD$antlr/debug/misc/JTreeASTPanel.classPK2D怐antlr-2.7.7/aclocal.m40000644000175000017500000004771010522211616014452 0ustar  twernertwernerdnl --*- sh -*--
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##
## This file is part of ANTLR. See LICENSE.txt for licence  ##
## details. Written by W. Haefelinger - initial version by  ##
## R. Laren.                                                ##
## ...............Copyright (C) Wolfgang Haefelinger, 2004  ##
##                                                          ##
##xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx##

dnl
dnl ===============================================================
dnl A couple of Macros have been copied from the GNU Autoconf Macro 
dnl Archive: 
dnl            http://www.gnu.org/software/ac-archive
dnl ===============================================================
dnl

AC_DEFUN(
  [AC_CHECK_CLASSPATH],
  [
    test "x$CLASSPATH" = x && AC_MSG_ERROR(
      [CLASSPATH not set. Please set it to include the directory containing configure.])
    if test "x$CLASSPATH" = x; then
      :
    else
      echo "CLASSPATH set to:"
      echo "$CLASSPATH"
      echo "IMPORTANT: make sure the current directory containing configure"
      echo "is in the CLASSPATH"
    fi
  ]
)

#dnl /**
#dnl  * Test.java: used to test dynamicaly if a class exists.
#dnl  */
#dnl public class Test
#dnl {
#dnl
#dnl public static void
#dnl main( String[] argv )
#dnl {
#dnl     Class lib;
#dnl     if (argv.length < 1)
#dnl      {
#dnl             System.err.println ("Missing argument");
#dnl             System.exit (77);
#dnl      }
#dnl     try
#dnl      {
#dnl             lib = Class.forName (argv[0]);
#dnl      }
#dnl     catch (ClassNotFoundException e)
#dnl      {
#dnl             System.exit (1);
#dnl      }
#dnl     lib = null;
#dnl     System.exit (0);
#dnl }
#dnl
#dnl }

AC_DEFUN(
  [AC_CHECK_CLASS],[
    AC_REQUIRE([AC_PROG_JAVA])
    ac_var_name=`echo $1 | sed 's/\./_/g'`
    #dnl Normaly I'd use a AC_CACHE_CHECK here but since the variable name is
    #dnl dynamic I need an extra level of extraction
    AC_MSG_CHECKING([for $1 class])
    AC_CACHE_VAL(ac_cv_class_$ac_var_name,[
        if test x$ac_cv_prog_uudecode_base64 = xyes; then
          cat << \EOF > Test.uue
begin-base64 644 Test.class
yv66vgADAC0AKQcAAgEABFRlc3QHAAQBABBqYXZhL2xhbmcvT2JqZWN0AQAE
bWFpbgEAFihbTGphdmEvbGFuZy9TdHJpbmc7KVYBAARDb2RlAQAPTGluZU51
bWJlclRhYmxlDAAKAAsBAANlcnIBABVMamF2YS9pby9QcmludFN0cmVhbTsJ
AA0ACQcADgEAEGphdmEvbGFuZy9TeXN0ZW0IABABABBNaXNzaW5nIGFyZ3Vt
ZW50DAASABMBAAdwcmludGxuAQAVKExqYXZhL2xhbmcvU3RyaW5nOylWCgAV
ABEHABYBABNqYXZhL2lvL1ByaW50U3RyZWFtDAAYABkBAARleGl0AQAEKEkp
VgoADQAXDAAcAB0BAAdmb3JOYW1lAQAlKExqYXZhL2xhbmcvU3RyaW5nOylM
amF2YS9sYW5nL0NsYXNzOwoAHwAbBwAgAQAPamF2YS9sYW5nL0NsYXNzBwAi
AQAgamF2YS9sYW5nL0NsYXNzTm90Rm91bmRFeGNlcHRpb24BAAY8aW5pdD4B
AAMoKVYMACMAJAoAAwAlAQAKU291cmNlRmlsZQEACVRlc3QuamF2YQAhAAEA
AwAAAAAAAgAJAAUABgABAAcAAABtAAMAAwAAACkqvgSiABCyAAwSD7YAFBBN
uAAaKgMyuAAeTKcACE0EuAAaAUwDuAAasQABABMAGgAdACEAAQAIAAAAKgAK
AAAACgAAAAsABgANAA4ADgATABAAEwASAB4AFgAiABgAJAAZACgAGgABACMA
JAABAAcAAAAhAAEAAQAAAAUqtwAmsQAAAAEACAAAAAoAAgAAAAQABAAEAAEA
JwAAAAIAKA==
====
EOF
          if uudecode$EXEEXT Test.uue; then
            :
          else
            echo "configure: __oline__: uudecode had trouble decoding base 64 file 'Test.uue'" >&AC_FD_CC
            echo "configure: failed file was:" >&AC_FD_CC
            cat Test.uue >&AC_FD_CC
            ac_cv_prog_uudecode_base64=no
          fi
          rm -f Test.uue
          
          if AC_TRY_COMMAND($JAVA $JAVAFLAGS Test $1) >/dev/null 2>&1; then
            eval "ac_cv_class_$ac_var_name=yes"
          else
            eval "ac_cv_class_$ac_var_name=no"
          fi
          rm -f Test.class
        else
          AC_TRY_COMPILE_JAVA([$1], , 
            [eval "ac_cv_class_$ac_var_name=yes"],
            [eval "ac_cv_class_$ac_var_name=no"])
        fi
        eval "ac_var_val=$`eval echo ac_cv_class_$ac_var_name`"
        eval "HAVE_$ac_var_name=$`echo ac_cv_class_$ac_var_val`"
        HAVE_LAST_CLASS=$ac_var_val
        if test x$ac_var_val = xyes; then
          ifelse([$2], , :, [$2])
        else
          ifelse([$3], , :, [$3])
        fi
      ]
    )
    #dnl for some reason the above statment didn't fall though here?
    #dnl do scripts have variable scoping?
    eval "ac_var_val=$`eval echo ac_cv_class_$ac_var_name`"
    AC_MSG_RESULT($ac_var_val)
  ]
)

AC_DEFUN([AC_CHECK_JAVA_HOME],[
    AC_REQUIRE([AC_EXEEXT])dnl
    TRY_JAVA_HOME=`ls -dr /usr/java/* 2> /dev/null | head -n 1`
    if test x$TRY_JAVA_HOME != x; then
      PATH=$PATH:$TRY_JAVA_HOME/bin
    fi
    AC_PATH_PROG(JAVA_PATH_NAME, java$EXEEXT)
    if test x$JAVA_PATH_NAME != x; then
      JAVA_HOME=`echo $JAVA_PATH_NAME | sed "s/\(.*\)[[/]]bin[[/]]java$EXEEXT$/\1/"`
    fi;dnl
    ]
)


AC_DEFUN([AC_PROG_JAR],
  [
    AC_REQUIRE([AC_EXEEXT])dnl
    if test "x$JAVAPREFIX" = x; then
      test "x$JAR" = x && AC_CHECK_PROGS(JAR, jar$EXEEXT)
    else
      test "x$JAR" = x && AC_CHECK_PROGS(JAR, jar, $JAVAPREFIX)
    fi
    test "x$JAR" = x && AC_MSG_ERROR([no acceptable jar program found in \$PATH])
    AC_PROVIDE([$0])dnl
    ]
)

AC_DEFUN([AC_PROG_JAVA],[
    AC_REQUIRE([AC_EXEEXT])dnl
    if test x$JAVAPREFIX = x; then
      test x$JAVA = x && AC_CHECK_PROGS(JAVA, kaffe$EXEEXT java$EXEEXT)
    else
      test x$JAVA = x && AC_CHECK_PROGS(JAVA, kaffe$EXEEXT java$EXEEXT, $JAVAPREFIX)
    fi
    test x$JAVA = x && AC_MSG_ERROR([no acceptable Java virtual machine found in \$PATH])
    AC_PROG_JAVA_WORKS
    AC_PROVIDE([$0])dnl
    ]
)


#dnl /**
#dnl  * Test.java: used to test if java compiler works.
#dnl  */
#dnl public class Test
#dnl {
#dnl
#dnl public static void
#dnl main( String[] argv )
#dnl {
#dnl     System.exit (0);
#dnl }
#dnl
#dnl }

AC_DEFUN([AC_PROG_JAVA_WORKS],
  [
    AC_CHECK_PROG(uudecode, uudecode$EXEEXT, yes)
    if test x$uudecode = xyes; then
      AC_CACHE_CHECK([if uudecode can decode base 64 file], ac_cv_prog_uudecode_base64, [
          cat << \EOF > Test.uue
begin-base64 644 Test.class
yv66vgADAC0AFQcAAgEABFRlc3QHAAQBABBqYXZhL2xhbmcvT2JqZWN0AQAE
bWFpbgEAFihbTGphdmEvbGFuZy9TdHJpbmc7KVYBAARDb2RlAQAPTGluZU51
bWJlclRhYmxlDAAKAAsBAARleGl0AQAEKEkpVgoADQAJBwAOAQAQamF2YS9s
YW5nL1N5c3RlbQEABjxpbml0PgEAAygpVgwADwAQCgADABEBAApTb3VyY2VG
aWxlAQAJVGVzdC5qYXZhACEAAQADAAAAAAACAAkABQAGAAEABwAAACEAAQAB
AAAABQO4AAyxAAAAAQAIAAAACgACAAAACgAEAAsAAQAPABAAAQAHAAAAIQAB
AAEAAAAFKrcAErEAAAABAAgAAAAKAAIAAAAEAAQABAABABMAAAACABQ=
====
EOF
          if uudecode$EXEEXT Test.uue; then
            ac_cv_prog_uudecode_base64=yes
          else
            echo "configure: __oline__: uudecode had trouble decoding base 64 file 'Test.uue'" >&AC_FD_CC
            echo "configure: failed file was:" >&AC_FD_CC
            cat Test.uue >&AC_FD_CC
            ac_cv_prog_uudecode_base64=no
          fi
          rm -f Test.uue])
    fi
    if test x$ac_cv_prog_uudecode_base64 != xyes; then
      rm -f Test.class
      AC_MSG_WARN([I have to compile Test.class from scratch])
      if test x$ac_cv_prog_javac_works = xno; then
        AC_MSG_ERROR([Cannot compile java source. $JAVAC does not work properly])
      fi
      if test x$ac_cv_prog_javac_works = x; then
        AC_PROG_JAVAC
      fi
    fi
    AC_CACHE_CHECK(if $JAVA works, ac_cv_prog_java_works, [
        JAVA_TEST=Test.java
        CLASS_TEST=Test.class
        TEST=Test
        changequote(, )dnl
        cat << \EOF > $JAVA_TEST
/* [#]line __oline__ "configure" */
public class Test {
public static void main (String args[]) {
        System.exit (0);
} }
EOF
        changequote([, ])dnl
        if test x$ac_cv_prog_uudecode_base64 != xyes; then
          if AC_TRY_COMMAND($JAVAC $JAVACFLAGS $JAVA_TEST) && test -s $CLASS_TEST; then
            :
          else
            echo "configure: failed program was:" >&AC_FD_CC
            cat $JAVA_TEST >&AC_FD_CC
            AC_MSG_ERROR(The Java compiler $JAVAC failed (see config.log, check the CLASSPATH?))
          fi
        fi
        if AC_TRY_COMMAND($JAVA $JAVAFLAGS $TEST) >/dev/null 2>&1; then
          ac_cv_prog_java_works=yes
        else
          echo "configure: failed program was:" >&AC_FD_CC
          cat $JAVA_TEST >&AC_FD_CC
          AC_MSG_ERROR(The Java VM $JAVA failed (see config.log, check the CLASSPATH?))
        fi
        rm -fr $JAVA_TEST $CLASS_TEST Test.uue
        ])
    AC_PROVIDE([$0])dnl
  ]
)

AC_DEFUN([AC_PROG_JAVAC],
  [
    AC_REQUIRE([AC_EXEEXT])dnl
    if test "x$JAVAPREFIX" = x; then
      test "x$JAVAC" = x && AC_CHECK_PROGS(JAVAC, javac$EXEEXT "gcj$EXEEXT -C" guavac$EXEEXT jikes$EXEEXT)
    else
      test "x$JAVAC" = x && AC_CHECK_PROGS(JAVAC, javac$EXEEXT "gcj$EXEEXT -C" guavac$EXEEXT jikes$EXEEXT, $JAVAPREFIX)
    fi
    test "x$JAVAC" = x && AC_MSG_ERROR([no acceptable Java compiler found in \$PATH])
    AC_PROG_JAVAC_WORKS
    AC_PROVIDE([$0])dnl
    ]
)

AC_DEFUN([AC_PROG_JAVAC_WORKS],[
    AC_CACHE_CHECK([if $JAVAC works], ac_cv_prog_javac_works, [
        JAVA_TEST=Test.java
        CLASS_TEST=Test.class
        cat << \EOF > $JAVA_TEST
/* [#]line __oline__ "configure" */
public class Test {
}
EOF
        if AC_TRY_COMMAND($JAVAC $JAVACFLAGS $JAVA_TEST) >/dev/null 2>&1; then
          ac_cv_prog_javac_works=yes
        else
          AC_MSG_ERROR([The Java compiler $JAVAC failed (see config.log, check the CLASSPATH?)])
          echo "configure: failed program was:" >&AC_FD_CC
          cat $JAVA_TEST >&AC_FD_CC
        fi
        rm -f $JAVA_TEST $CLASS_TEST
        ])
    AC_PROVIDE([$0])dnl
    ])

AC_DEFUN([AC_TRY_COMPILE_JAVA],[
    AC_REQUIRE([AC_PROG_JAVAC])dnl
    cat << \EOF > Test.java
/* [#]line __oline__ "configure" */
ifelse([$1], , , [import $1;])
public class Test {
[$2]
}
EOF
    if AC_TRY_COMMAND($JAVAC $JAVACFLAGS Test.java) && test -s Test.class ; then
      #dnl Don't remove the temporary files here, so they can be examined.
    ifelse([$3], , :, [$3])
    else
    echo "configure: failed program was:" >&AC_FD_CC
    cat Test.java >&AC_FD_CC
    ifelse([$4], , , [  rm -fr Test*
        $4
        ])dnl
    fi
    rm -fr Test*
    ]
)

AC_DEFUN([AC_TRY_RUN_JAVA],[
    AC_REQUIRE([AC_PROG_JAVAC])dnl
    AC_REQUIRE([AC_PROG_JAVA])dnl
    cat << \EOF > Test.java
/* [#]line __oline__ "configure" */
ifelse([$1], , , [include $1;])
public class Test {
[$2]
}
EOF
    if AC_TRY_COMMAND($JAVAC $JAVACFLAGS Test.java) && test -s Test.class && ($JAVA $JAVAFLAGS Test; exit) 2>/dev/null
      then
#dnl Don't remove the temporary files here, so they can be examined.
      ifelse([$3], , :, [$3])
    else
      echo "configure: failed program was:" >&AC_FD_CC
      cat Test.java >&AC_FD_CC
      ifelse([$4], , , [  rm -fr Test*
          $4
          ])dnl
    fi
    rm -fr Test*])

#dnl#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
#dnl#                      AX_TRY_COMPILE_JAVA
#dnl#xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
#dnl $1 => import section
#dnl $2 => class body section
#dnl $3 => if_good_action
#dnl $4 => if_fails_action [implicit action: candidate is removed from
#dnl       list]. This cannot be overridden by providing a action.

AC_DEFUN([AX_TRY_COMPILE_JAVA],
[
  ## make sure that we do not use an existing file
  i=0;cn="Test\${i}"; eval "fj=${cn}.java"
  while test -f "${fj}"
  do
    i=`expr $i + 1`
    eval "fj=${cn}.java"
  done  
  eval "fc=${cn}.class"
  eval "cn=${cn}"

  cat << [_ACEOF] > ${fj}
  [$1]
  public class ${cn} {
  [$2]
  }
[_ACEOF]
  ## wh: how do I check that a file has a non-zero size (test -s)
  ## wh: is not portable.
  if AC_TRY_COMMAND($JAVAC $JAVACFLAGS ${fj}) && test -f "${fc}"
  then  
    $3
  else
    ifelse([$4], ,[
    echo ""
    echo "@configure:__oline__: failed to compile java input ...."
    echo "======================================================="
    cat ${fj}
    echo "======================================================="
    echo "exec $JAVAC $JAVACFLAGS ${fj}"
    echo ""
    rm -rf "${fc}" "${fj}"
    ],[$4])
  fi
  rm -rf "${fc}" "${fj}"
  ## eof [AX_TRY_COMPILE_JAVA]
])dnl

#dnl AX_GNU_MAKE
#dnl $1->var that contains list of suitable candidates [not empty]
#dnl $2->action_if_not_found || empty
#dnl $3->action_if_found || empty
#dnl => $MAKE

AC_DEFUN(
  [AX_GNU_MAKE], 
  [
    #Search all the common names for GNU make
    ax_gnu_make_list="${[$1]}"
    [$1]=
    for a in . ${ax_gnu_make_list} ; do
      if test "$a" == "." ; then 
        continue
      fi
      AC_MSG_CHECKING([whether ${a} is GNU make])
      if (/bin/sh -c "$a --version" 2> /dev/null | grep GNU  2>&1 > /dev/null );  then
        [$1]="$a"
        AC_MSG_RESULT(yes)
        break
      else
        AC_MSG_RESULT(no)
      fi 
    done 
    ## handle search result 
    if test  "x${[$1]}" == "x"  ; then
      :
      $2
    else
      :
      $3
    fi
  ]
)dnl


###dnl Like AC_PATH_PROGS. However, each argument in $2 will be checked.
###dnl The result will be added to $1. There's no caching etc.
###dnl

AC_DEFUN(
  [AX_TYPE_DASHA],
  [
    for ac_prog in [$2] ; do
      set dummy $ac_prog; ac_word=${2}
      ## if argument is absolute we check whether such a file exists,
      ## otherwise we lookup PATH. Each hit will be added to main
      ## variable.
      case $ac_word in
        @<:@\\/@:>@* | ?:@<:@\\/@:>@*)      
          AC_MSG_CHECKING([for $ac_word])
          if test -f $ac_word ; then
            [$1]="${[$1]} ${ac_word}"
            AC_MSG_RESULT(yes)
          else
            AC_MSG_RESULT(no)
          fi
          ;;
        *)
          as_found=
          as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
          for as_dir in $PATH
          do
           IFS=$as_save_IFS
           test -z "$as_dir" && as_dir=.
           for ac_exec_ext in '' $ac_executable_extensions; do
             if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
               [$1]="${[$1]} $as_dir/$ac_word$ac_exec_ext"
               AC_MSG_CHECKING([for $ac_word])
               AC_MSG_RESULT([$as_dir/$ac_word$ac_exec_ext])
               as_found=1
             fi
           done
          done
          test "x$as_found" == "x" && {
            AC_MSG_CHECKING([for $ac_word])
            AC_MSG_RESULT([no])
          }
          ;;
      esac
    done
  ]
)dnl

###dnl Like AC_PATH_PROGS but if  is given, then it's argument
###dnl is taken unconditionally(?).
AC_DEFUN(
  [AX_PATH_PROGS],
  [
    ax_arg_list="[$2]"
    if test "x${[$1]}" != "x" ; then
      ax_arg_list="${[$1]}"
    fi
    [$1]=""
    AX_TYPE_DASHA([$1],[${ax_arg_list}])
    if test "x${[$1]}" != "x" ; then
      ifelse([$3], ,[:],$3)
    else
      ifelse([$4], ,[
          AC_MSG_ERROR([no suitable value has been found for [$1]])
          ],$4)
    fi
  ]
)


AC_DEFUN([AX_JAVAC],
[
  ## make sure that we do not use an existing file
  i=0;cn="Test\${i}"; eval "fj=${cn}.java"
  while test -f "${fj}"
  do
    i=`expr $i + 1`
    eval "fj=${cn}.java"
  done  
  eval "fc=${cn}.class"
  eval "cn=${cn}"

  cat << [_ACEOF] > ${fj}
  [$1]
  public class ${cn} {
  [$2]
  }
[_ACEOF]
  ## wh: how do I check that a file has a non-zero size (test -s)
  ## wh: is not portable.
  if AC_TRY_COMMAND($JAVAC $JAVACFLAGS ${fj}) && test -f "${fc}"
  then  
    $3
  else
    ifelse([$4], ,[
    echo ""
    echo "@configure:__oline__: failed to compile java input ...."
    echo "======================================================="
    cat ${fj}
    echo "======================================================="
    echo "exec $JAVAC $JAVACFLAGS ${fj}"
    echo ""
    rm -rf "${fc}" "${fj}"
    ],[$4])
  fi
  rm -rf "${fc}" "${fj}"
  ## eof [AX_TRY_COMPILE_JAVA]
])dnl

AC_DEFUN([AX_WHICH_JAVAC],[
    AC_SUBST([$1])
    if (/bin/sh -c "$JAVAC --version" 2>&1 | grep -i 'GCC' 2>&1 > /dev/null ) ; then
      [$1]=gcj
    elif (/bin/sh -c "$JAVAC --version" 2>&1 | grep -i 'jikes' 2>&1 > /dev/null ) ; then
      [$1]=jikes
    else
      [$1]=javac
    fi
  ]
)

AC_DEFUN([AX_VAR_HEAD],[
    set x ${[$1]}
    [$1]="${2}"
  ]
)

AC_DEFUN([AX_VAR_ADD],[
    ifelse([$3], ,,[$1=$3])
    $1="${[$1]} $2"
  ]
)


AC_DEFUN([AX_JAVA_PROGS],[
    case $LANG_JAVA in
      1)
        AX_PATH_PROGS([$1],[$2],[$3],[
            LANG_JAVA=0
            cat <> "$[$1]" </antlr.jar

       $ java antlr.Tool mygrammar.g

  c. write a driver program using source code generated by ANTLR, ie.
     Main.java, main.cpp, Main.cs or main.py

  d. link generated code, your driver code, ANTLR's core library and
     any additional library you are using together to get an 
     executable

  f. run the executable on arbitrary input to be parsed

 For a set of standard examples have a look into directory "examples"
 and appropriate subdirectories. You may want to run make like

  $ make verbose=1

 to see which compiler is used and which flags are passed etc. You may 
 also follow a simple mini-tutorial at

      http://www.antlr.org/article/cutpaste/index.html

 if you are absolutly new to ANTLR.

______________________________________________________________________
BUILD AND INSTALL ON WINDOWS NT/95/98/2000/XP?

 There  is no difference in building and installing Windows. However,
 you are need have either Cygwin or MSYS installed. We haven't tried
 MKS yet.
 
 If you run configure with Cygwin (or MSYS) then gcj will usually be
 chosen for compiling Java and gcc for compiling C++. In most cases
 however, C# will be  automatically disabled as no compiler can be 
 found. 

 Configure is not looking up the registry to check for installed soft-
 ware. Instead, configure will just check the $PATH for known compiler
 names and also check some well know locations like "/usr/local/bin"
 etc.

 In order to make configure aware of a certain compiler or tool you
 need, make sure that your compiler or tool can be found by looking up
 $PATH. For example, Microsoft Visual C++ comes with a batch file 
 named vcvars32.bat. Just run this batch file prior of running bash to
 have "cl" in your $PATH.

 Configure knows about this compiler names:

   bcc32 cl g++        for C++
   jikes javac gcj     for Java
   csc mcs cscc        for C#
   python              for Python
   
 The order in which the names appear is also the  search order. That
 means that the whole $PATH gets searched for bcc32, then for cl and
 finally for g++.

 In  other  words, it is sufficient to have "cl" in $PATH to have it
 selected by configure, regardless whether there is g++ available or
 not. Similar, if you also have bcc32 in $PATH, then the Borland C++
 Compiler will be choosen.

 If you have more that one compiler in your $PATH and the "wrong" 
 compiler is selected - Do you have to give up on this?

 Not at all.

 In case you have more than one compiler/tool in your $PATH, you can
 tell configure which one you like to have. For example:

  --with-cxx=g++

 This  will favor g++ regardless whether there's a cl or bcc in PATH.
 You can archive the very same by

  CXX=g++ ${srcdir}/configure 

 That is by using an environment variable. Try --help for the full
 list of --with-xxx options and environment variables.

______________________________________________________________________
DETAILS ON CONFIGURE?

 This section will present some further details on how you can tell
 configure to behave the way you want:


 1. Choose Language
 ==================

 ANTLR is implemented in Java and has code generator plugins for Java,
 C++, C# and Python.

 The default behaviour of configure is to check whether a suitable
 compiler or tool for a particular language is available. If not, then
 configure will show a warning  message and will automatically disable
 support for this language.

 In a very bizarre case it  is  therefore  possible  to end up  with a 
 configuration with no language support at all. Please study therefore
 configure's output whether you end up with the system you want.

 On the contrary, configure will enable, as mentioned, every target
 language with sufficient compiler/tool support. To speed up the 
 build process you may also disable languages (and configure them
 later again). This can be done by command line options:

  --disable-cxx    | --enable-cxx=no        --> disable C++ 
  --disable-java   | --enable-java=no       --> disable Java      
  --disable-csharp | --enable-csharp=no     --> disable C#
  --disable-python | --enable-python=no     --> disable Python

 Be warned that when disabling Java you can't even build ANTLR itself.
  
 
 2. Be Verbose
 =============

 A typical 'make' run  reports all kinds of actions exactly the way 
 they  get  carried out. This makes the output of a make run hard to
 read and it's difficult to keep track "where" make is right now and
 what's going on.

 ANTLR's make run has been designed to be readable. By default make 
 will report what's going on in a kind of logical way. For example,
 when compiling ANTLR itself you will see a message like

  *** compiling 209 Java file(s)

 This information is usually enough to keep track what's going on. If
 compilation fails, then the exact command line causing the problem 
 will be shown and you can study the arguments whether additional
 flags are required etc.

 However, you can tell configure to be verbose as usual by

 
  --enable-verbose


 Having enabled verbosity, the command to compile ANTLR will be shown
 similar like this (using javac):
   
  CLASSPATH=
  /opt/jdk32/142_03/bin/javac \
     -d . \
     -sourcepath /home/geronimo/src/antlrmain \
     -classpath /home/geronimo/obj/antlr-linux/lib/antlr.jar \
     Version.java \
     ANTLRParser.java \
     ...
     [[skipped 206 files]]
     ...
     /home/geronimo/src/antlrmain/antlr/debug/misc/JTreeASTPanel.java


 You have used --enable-verbose and output is too much. Do I need to
 configure again?

 No. Just run make like

  $ make verbose=0

 to turn off verbosity for this make run. You can also do this

  $ verbose=0
  $ export verbose
  $ make

 to turn verbosity off without using arguments to make.

 Of course, you can also turn verbosity on (verbose=1) in the very same
 way, regardless of what you have configured earlier.


 3. Debug Version
 ================

 A typical open source configuration sets compiler options to contain
 debug information.

 ANTLR's approach  is  a  bit  different. We believe that you want to 
 u s e  ANTLR  and  not to  d e b u g  it. In other words, we believe
 you are voting for speed.

 Therefore configure will set compiler flags that go for speed and we
 omit all flags introducing some debug information. 

 If you need to go for debug information, turn those flags on by using

  --enable-debug

 Similar to verbose discussed in the previous section you can override
 this configuration setting by using

  $ make debug=0         -- no debug information 
  $ make debug=1         -- turn debugging on
 
 without the need to reconfigure. But be aware that --enable-debug is
 just  changing  flags given to your compiler. It will not change any
 names. For  example,  the name of ANTLR's core library is libantlr.a
 (using g++) regardless of whether debug is on or off.


 4. Examples
 ===========

 You may leave out the examples just by

  --disable-examples

 Note that you can't undo this  without reconfiguration. Nevertheless,
 we recommend to configure with examples, test them and to study them
 to get a full understanding  on  how  ANTLR works and - last but not
 least - about all it's capabilities.


 5. Bootstrap
 ============

 ANTLR's parser engine (ie. the parser that accepts a grammar file) is
 written in ANTLR  itself. From a logical point of view you would need
 ANTLR  to  build ANTLR. This chicken and egg problem is solved simply
 by having generated source files enclosed in the package.

 However, if you are doing some surgery  on ANTLR's internals you need
 to have a existing ANTLR version around.

 You can tell configure about this external ANTLR version by

   --with-antlr-jar=${some-install-dir}/lib/antlr.jar

 or by

   --with-antlr-cmd=${some-tool-running-antlr}


 The former version will  add  given  jar  file to the $CLASSPATH when 
 trying to compile grammar files ( *.g).

 Very similar you  can  also use --with-antlr-cmd to provide a program
 or  shell  script  to  compile grammar files. The name of the program
 does not matter but it needs to be exectuable and it  should  support
 all flags that can be given to ANTLR (check java antlr.Tools -h).  

 NOTE:

 Bootstraping  ANTLR  with  an  external jar file or program does will 
 only taken into account if there's  no lib/antlr.jar available in the
 build directory. In other words, if you bootstraped once and you make
 changes later on ANTLR's internals, then  the  previously  build  jar
 file antlr.jar will be used - regardless of your configuration 
 options. 


 6. Which Make?
 ==============

 You need a GNU make  to  run  the build. This is especially true when
 building  ANTLR  on Windows. Nevertheless, some efforts has been done
 to lower  the  dependency on GNU make for portability reasons. But we
 are not done yet.

 If  you  have  GNU make installed on your system but it's not in your
 PATH or you want to have a special version of make, you may tell this
 configure by either

   --with-make=${list-of-candidates}

 or by using environment variable $MAKE like

   MAKE=${list-of-candidates} ${srcdir}/configure

 Which  variant  you are using is a matter of your personal taste. But
 be aware that the command line argument is overriding the environment
 variable. Consider this example:

  MAKE=x-make ${srcdir}/configure --with-make="y-make z-make"
  
 Here configure will check your $PATH for y-make and z-make bug x-make
 is ignored.

 Note that the withespace seperated ${list-of-candidates} may also
 contain absolute path names. In that case $PATH is not consulted but
 the file is directly checked for existence. Here's an example:

  MAKE='make /usr/bin/make' ${srcdir}/configure

 Here your $PATH is consulted whether a "make" exsists. Then 
 /usr/bin/make is checked for existence.

 The first make found which is then a GNU make is the one choose to be
 used to build ANTLR.

 For consistency reasons you may also use --with-makeflags or variable
 $MAKEFLAGS to  pass specific flags to make. However, this information
 is not yet used. Right now the flags used are the flags provided when
 calling make.

 7. Which Java?
 ==============

 ANTLR  has  been tested with SUN Java 1.4.x using either SUN's javac
 Java compiler, IBM's jikes or GNU's gcj. Other systems have not been 
 tested and are not expected to work.

 The default search order is 

  jikes javac gcj

 It  is  therefore sufficient to have "jikes" in your $PATH to get it
 choosen by configure - regardless whether it precedes a javac or not
 in $PATH.

 You may change this default search by providing a list of candidates
 by either

   --with-javac=${candidate-list}

 or by

   JAVAC=${candidate-list}

 The candidates should be seperated by whitespace and may be relative
 or  absolute  path  names. Only in the former case a lookup in $PATH 
 takes place.

 By default options passed to a Java compiler are those who are 
 sufficient to compile ANTLR. You may pass other flags by either

   --with-javacflags=${flags}

   JAVACFLAGS=${flags}

 In most cases you want to leave the default flags intact but rather
 add your additional flags. To support this, ANTLR's build management
 interprets ${flags} like this:

    ${flags}        STANDARD FLAGS           RESULT
    --------------+-----------------+----------------------
    + f1 f2 .. fn |     F1 .. FN    |  F1 .. FN f1 f2 .. fn 
    - f1 f2 .. fn |     F1 .. FN    |  f1 f2 .. fn F1 .. FN
    = f1 f2 .. fn |     F1 .. FN    |  f1 f2 .. fn
    f1 f2 .... fn |     F1 .. F     |  f1 f2 .. fn
    --------------+-----------------+----------------------

 In other words, you can either tell configure to append (+), to
 prepend (-) or to substitute(=) your flags. 


 Note that this is also possible when running make. For example,

   $ make JAVAC=jikes JAVACFLAGS="+ -verbose"

 would use jikes to compile regardless of what has been configured
 before. Additionally the flag "-verbose" is used.


 So far we talked about compiling Java. Let's have now a look on how
 to execute class files. By default configure searches for

   java gij

 to run Java. As discussed before it is sufficient  to  have a Java in
 $PATH to get java selected. It has also to be noted that gij is still
 in experimental stage and not fully supported now.

 As before you may also provide additional flags to Java by using 
 either

  --with-javaflags=${flags} 

 or by using environment variable

   JAVAFLAGS=${flags}

 Again, ${flags} are getting interpreted according to table shown 
 above.

 8. Which C++ Compiler?
 ======================

 The algorithm  on  how  the C++ compiler is choosen and how to pass 
 additional flags are very much the same as discussed before for the
 Java compiler.

 The default candidate list for choosing a C++ compiler is

  bcc32 cl g++                      on Windows ; and
  aCC CC xlC xlC_r g++ cxx c++      on UNIX.

 To change this list use

  --with-cxx=${candidates}

 and use

  --with-cxxflags=${flags}

 to pass additional flags to the standard compiler flags. You can also 
 use $CXX and $CXXFLAGS if you like. This  will  then  also  work when 
 running make. 


 9. Which C# Compiler?
 =====================

 The only candidate for C# as time of writing is 

  csc

 for compiling C# source code. To change this option

  --with-csharpc=${candidates}

 and use

  --with-csharpcflags=${flags}

 for providing a list of additional options. Note that ${flags} are
 getting interpreted as discussed in the previous sections.

 Instead  of  command  line  arguments to configure you may also use
 $CSHARPC and $CSHARPCFLAGS.  This  variables  are also working when 
 running make.

 10. Which Python?
 =================

 Configure is  searching for "python" in your $PATH and in some well
 known locations. If  no "python" can be found, language support for
 Python is disabled.

 You may use

  --with-python="${candidates}"

 to provide a list of Python candidates and further you may use

  --with-pythonflags="${flags}"

 to  provide  a  list of (additional) flags to be passed to Python on
 execution. Note that ${flags} is getting interpreted as discussed in
 the previous sections.

 You may also use $PYTHON and $PYTHONFLAGS instead. This variables are
 then also working when running make. Note  that  those  variable  may
 override what has been configured before without any warning.



______________________________________________________________________
FURTHER DETAILS ON ANTLR'S BUILD SETUP?


In allmost all cases it is assumed to be sufficient to change compiler
settings by using either --with-${lang}flags or by using ${LANG}FLAGS.

It's most likely not sufficient if you want to support a new compiler,
tool or a new operating system.

The general idea is  to  have a configured shell script for each tool 
or compiler being used rather than doing the scripting within the
Makefile itself. The reason for this is that scripting in Makefiles is
rather hard  to read and a pain to debug (for example, there's no line
information).

The configured shell scripts are to be found in subdirectory "scripts"
within the build directory. Their originals are located in 

 ${srcdir}/scripts

This scripts are known at time of writing:

 antlr.sh.in  -  runs "java antlr.Tools"
 cxx.sh.in    -  run C++ compiler
 cpp.sh.in    -  run C/C++ preprocessor (for dependencies).
 jars.sh.in   -  how to make a static library (aka jar file)(Java)
 javac.sh.in  -  run Java compiler (also when using jikes etc)
 lib.sh.in    -  how to make a static library (C++)
 link.sh.in   -  how to make a executable (C++)
 python.sh.in -  how to run python

A Makefile contains nothing more than variables and rules and in all-
most all cases (but simple exceptions)  the command behind a rule is
just executing a script.

Note that these scripts are not intended to be used  to  compile C++, 
Java etc in general. Instead this scripts are specialized for ANTLR.

For example, the script "lib.sh" has  a  very simple interface. All 
you can provide  is  a list  of object files. There is no option to
tell about the library  name  to be build. Instead the library name
is set by configure and available by using @ANTLR_LIB@ in all
configured files.

Unfortunatly, all scripts are rather complex and limiting ourselfs of
not using  shell  functions  (portability)  is not going make changes
easier.

In  general  you  should  only edit the upper part of any script till 
there's a line like "**NO  CHANGE NECESSARY BELOW THIS LINE - EXPERTS
ONLY**".


Then let's have now a closer look at cxx.sh.in. The other scripts are
very similar. I'm going to discuss here only the relevant parts - this
is open source  after  all any you may try to understand it by reading
the source code :-)

 ARGV="$*"

In general all arguments given to the script file are collected with-
in variable $ARGV. In some scripts, the very first  argument  has  a 
special meaning - usually it tells about the target to be created. In
such a case 

 TARGET

would hold the first argument given and ARGV would hold all others.

 if test -z "${CXX}" ; then
  CXX="@CXX@"
  cxx="@cxx@"
 else
  cxx="`basename $CXX`"
  cxx="`echo $cxx|sed 's,\..*$,,'`"
 fi

This script snippet checks about the compiler to be used for compiling
C++ source. Note that we have two variables,  CXX  and cxx. The former
holds usually the absolute path of  the  compiler  as  configured. The
later, cxx, contains the  logical  compiler name. The logical compiler
name is "gcc" for GNU, "cl" for Microsoft C++ etc. etc.

The logical compiler name is usually configured and available as @cxx@.
However,  a user  overrides  the  configuration  by  using environment 
variable CXX, the  logical  compiler  name is computed by removing any
extension.

In a further section (similar in other scripts) we set specific flags
depending on the  l o g i c a l  compiler name.  As you can see it is
rather important to the logical name proper.

case "${cxx}" in
  gcc)
    cxxflags="-felide-constructors -pipe"
    case "${DEBUG}" in
      0)
        cxxflags="-O2 -DNDEBUG ${cxxflags}"
        ;;
      1)
        cxxflags="-g ${cxxflags} -W -Wall"
        ;;
    esac
    ;;
  cl)
    cxxflags="/nologo -GX -GR" 
  [[skipped]]
esac

In the snippet shown you can see the handling of "gcc" and "cl". Note that
the compiler flags are saved in $cxxflags and not in $CXXFLAGS. Reason
for this is that handling  of environment variable $CXXFLAGS is rather
longish due to ANTLR's  special interpretation mechanism (as discussed 
in an earlier section).

In some cases flags may depend on platform in use. In that case you may
do something like:


  case ${cxx} in
   gcc)
        case @build_os@ in
         cygwin)
             ## cygwin specific flags ..
             ;;
          sparc)
             ## sparc specific ..
             ;;
          *)
             ## all others
             ;;
        esac
   ..
  esac

Of course you can utilize here the full scripting power to set flags
required to get compilation job done.

______________________________________________________________________
FAQ?

 1. How to setup jikes boot classpath?
 =====================================

 Jikes (http://www-124.ibm.com/developerworks/oss/jikes) is just a
 Java compiler that needs to know  about  Java's core classes, ie.
 rt.jar, for a successful build of ANTLR. By default configure tries
 to locate rt.jar by searching $PATH for a java executable and 
 relative to where found, for ../jre/lib/rt.jar.

 If this search fails or if you want to pass a different Java core or
 further core libraries, you may use either option 

   --with-bootclasspath="${args}"

 or environment variable

   BOOTCLASSPATH="${args}"

 The list of arguments, ${args}, is supposed to be list of whitespace
 seperated files or directories. Configure  will  validate  that each
 argument exists and will fail  otherwise.  Besides this there are no
 further validations  done  -  you  are supposed to know what you are
 doing. Note also that  configure will not perform any search in case
 a bootclasspath is given.

 The arguments given are concatenated using platform specific argument
 seperator (ie. ";" or ":") and passed to option --bootclasspath.

 2. Can I just say "make" after having unpacked ANTLR?
 =====================================================
 
 No - as explained previously you need to run "configure" before you
 can issue a "make".

 3. How do I cleanup afterwards?
 ===============================

 You do a "make clean" to remove all object files. If  you do a "make
 distclean", then all files generated by ANTLR are  also  removed. In
 this case you need a external antlr.jar somewhere to rebuild.

 If you are using a external build directory you may just remove the
 whole directory without any harm.

 4. Is it safe to edit a Makefile?
 =================================

 In general do not edit  files  named  Makefile.  Instead edit files
 named Makefile.in. Configure or config.status will override changes
 you made in a Makefile on any run.

 5. I changed Makefile.in - what's next?
 =======================================

 Just run make again. Each Makefile contains a rule that automatically
 remakes itself if corresponding Makefile.in has changed.

 This automatic rule works fine in general.  However,  if  you change 
 Makefile/Makefile.in in such a way that make rejects it's  execution
 then you need to remake Makefile yourself.

 This can be done by

   $ cd ${builddir}
   $ ./config.status ${your-makefile}

 Here's an example. Assume that "antlr/Makefile" is corrupted. The do
 this:

   ./config.status antlr/Makefile 

 You can also issue just a 

   $ ./config.status

 In this case all configured files are regenerated.

 6. My configure has changed - what's next?
 =============================================

 You need to reconfigure each build directory to get the changes. So
 far no automatic rule has been implemented. The easiest way of being
 up-to-date is:

  $ cd ${builddir} && ./config.status --recheck && make

 7. Where do I find antlr.jar?
 =============================
 
 Have a look at "lib".  Should  be there - but it is subject of having
 enabled  Java  or not.  Note that Java gets automatically disabled if 
 there's no  sufficient  Java compiler found (warning message would be
 dumped in that case).

 8. How can I make "make" nosiy?
 ===============================

 By default make just tells you what's going on in a very brief way. 
 To change this just do this:

  $ make verbose=1

 You can also tell configure to turn verbosity on by default by using
 option

  --enable-verbose.

 Run "configure --help" for a list of options available.

 9. Am I able to run "make" in a subdirectory?
 =============================================

 Sure.

 10. Is it safe to remove configured subdirectory?
 =================================================

 In general "yes" but you want to do this only within the build tree.

 For example, let's assume that you are tired of getting standard
 examples tested. Then just move on and remove subdirectory
 "examples".


______________________________________________________________________
LIST OF CONFIGURED VARIABLES?

 ANTLRFLAGS
 ANTLR_ACTION_FILES
 ANTLR_ANTLR_FILES
 ANTLR_COMPILE_CMD
 ANTLR_CYGWIN
 ANTLR_JAR
 ANTLR_LIB
 ANTLR_MINGW
 ANTLR_NET
 ANTLR_PY
 ANTLR_TOKDEF_FILES
 ANTLR_WIN32
 ANTLR_WITH_ANTLR_CMD
 ANTLR_WITH_ANTLR_JAR
 AR
 ARFLAGS
 AS
 BOOTCLASSPATH
 CSHARPC
 CSHARPCFLAGS
 CSHARP_COMPILE_CMD
 CXX_COMPILE_CMD
 CXX_LIB_CMD
 CXX_LINK_CMD
 CYGPATH
 DEBUG
 EXEEXT
 JAR
 JARFLAGS
 JAR_CMD
 JAVA
 JAVAC
 JAVACFLAGS
 JAVAFLAGS
 JAVA_CMD
 JAVA_COMPILE_CMD
 LIBEXT
 MAKE
 OBJEXT])
 PATCHLEVEL
 PYTHON
 PYTHONFLAGS
 SUBVERSION
 VERBOSE
 VERSION
 WITH_EXAMPLES
 abs_this_builddir
 cxx
 jar
 java
 javac

______________________________________________________________________
PLATFORMS?

 ANTLR  has  been  developed  and  tested on platforms listed below. A 
 platform is considered supported and tested if basically all standard
 examples are working.

 Devel for ANTLR 2.7.5 took place on:

 i686-linux2.6.3-7mk  
   - Java 1.4.2, gcj 3.3.4, jikes 1.16, 1.17, 1.18, 1.19, 1.20, 1.21, 1.22
   - gcc 3.3.2, gcc 3.3.4
   - Python 2.3, 2.4 
   - DotGNU 0.6.0

 i686-cygwin_nt-5.1
   - Java 1.4.2, gcj 3.3.3, jikes 1.22
   - gcc 3.3.3, bcc32 5.6 (Borland C++), cl 13.10.3077 (Microsoft C++)
   - csc 7.10.6001.4 (Visual C# .NET Compiler)
   - Python 2.2, 2.3, 2.4
   - Mono 1.0.5

 ANTLR has been tested on:

 MinGW-3.1.0.1 (needs manual install of cygpath!)
  - MSys 1.0.10
  - Java 1.5.0-b64
  - gcc 3.4.1
 
 PowerPC or RS/6000:
  * powerpc-apple-darwin6.8 (MacOS 1o, "Jaguar")
    - Java 1.4.1, jikes 1.15
    - gcc 3.1
    - Python 2.2
    - Mono (?) also reported to work.   

 SPARC:
  * sparc-sun-solaris2.8
    - Java 1.4.1
    - SUN CC 5.6

 Known  n o t  to work:
 - jikes 1.13 and older due to missing classpath and bootclasspath
   options. Jikes 1.14 and 1.15 are not tested due to compilation
   problems compiling jikes itself (on Mandrake 1o).

 - Python < 2.2 will not work.

 - gcc 2.* will not work.

 - You need to have GNU make (for building).
======================================================================
             INSTALL.txt - last update January 11th, 2005