commit 063194f8befbf2f48e69847ecb0abd4b67ec4b89
Author: Jeena Paradies <spam@jeenaparadies.net>
Date:   Tue Apr 19 11:37:05 2011 +0200

    first commit

diff --git a/.j b/.j
new file mode 100644
index 0000000..e69de29
diff --git a/AbsJavalette.hi b/AbsJavalette.hi
new file mode 100644
index 0000000..695a23c
Binary files /dev/null and b/AbsJavalette.hi differ
diff --git a/AbsJavalette.hs b/AbsJavalette.hs
new file mode 100644
index 0000000..927aa33
--- /dev/null
+++ b/AbsJavalette.hs
@@ -0,0 +1,87 @@
+module AbsJavalette where
+
+-- Haskell module generated by the BNF converter
+
+newtype Ident = Ident String deriving (Eq,Ord,Show)
+data Program =
+   Program [TopDef]
+  deriving (Eq,Ord,Show)
+
+data TopDef =
+   FnDef Type Ident [Arg] Block
+  deriving (Eq,Ord,Show)
+
+data Arg =
+   Arg Type Ident
+  deriving (Eq,Ord,Show)
+
+data Block =
+   Block [Stmt]
+  deriving (Eq,Ord,Show)
+
+data Stmt =
+   Empty
+ | BStmt Block
+ | Decl Type [Item]
+ | Ass Ident Expr
+ | Incr Ident
+ | Decr Ident
+ | Ret Expr
+ | VRet
+ | Cond Expr Stmt
+ | CondElse Expr Stmt Stmt
+ | While Expr Stmt
+ | SExp Expr
+  deriving (Eq,Ord,Show)
+
+data Item =
+   NoInit Ident
+ | Init Ident Expr
+  deriving (Eq,Ord,Show)
+
+data Type =
+   Int
+ | Doub
+ | Bool
+ | Void
+ | Fun Type [Type]
+  deriving (Eq,Ord,Show)
+
+data Expr =
+   EVar Ident
+ | ELitInt Integer
+ | ELitDoub Double
+ | ELitTrue
+ | ELitFalse
+ | EApp Ident [Expr]
+ | EString String
+ | Neg Expr
+ | Not Expr
+ | EMul Expr MulOp Expr
+ | EAdd Expr AddOp Expr
+ | ERel Expr RelOp Expr
+ | EAnd Expr Expr
+ | EOr Expr Expr
+ | TAnot Type Expr
+  deriving (Eq,Ord,Show)
+
+data AddOp =
+   Plus
+ | Minus
+  deriving (Eq,Ord,Show)
+
+data MulOp =
+   Times
+ | Div
+ | Mod
+  deriving (Eq,Ord,Show)
+
+data RelOp =
+   LTH
+ | LE
+ | GTH
+ | GE
+ | EQU
+ | NE
+  deriving (Eq,Ord,Show)
+
diff --git a/AbsJavalette.hs.bak b/AbsJavalette.hs.bak
new file mode 100644
index 0000000..f645838
--- /dev/null
+++ b/AbsJavalette.hs.bak
@@ -0,0 +1,86 @@
+module AbsJavalette where
+
+-- Haskell module generated by the BNF converter
+
+newtype Ident = Ident String deriving (Eq,Ord,Show)
+data Program =
+   Program [TopDef]
+  deriving (Eq,Ord,Show)
+
+data TopDef =
+   FnDef Type Ident [Arg] Block
+  deriving (Eq,Ord,Show)
+
+data Arg =
+   Arg Type Ident
+  deriving (Eq,Ord,Show)
+
+data Block =
+   Block [Stmt]
+  deriving (Eq,Ord,Show)
+
+data Stmt =
+   Empty
+ | BStmt Block
+ | Decl Type [Item]
+ | Ass Ident Expr
+ | Incr Ident
+ | Decr Ident
+ | Ret Expr
+ | VRet
+ | Cond Expr Stmt
+ | CondElse Expr Stmt Stmt
+ | While Expr Stmt
+ | SExp Expr
+  deriving (Eq,Ord,Show)
+
+data Item =
+   NoInit Ident
+ | Init Ident Expr
+  deriving (Eq,Ord,Show)
+
+data Type =
+   Int
+ | Doub
+ | Bool
+ | Void
+ | Fun Type [Type]
+  deriving (Eq,Ord,Show)
+
+data Expr =
+   EVar Ident
+ | ELitInt Integer
+ | ELitDoub Double
+ | ELitTrue
+ | ELitFalse
+ | EApp Ident [Expr]
+ | EString String
+ | Neg Expr
+ | Not Expr
+ | EMul Expr MulOp Expr
+ | EAdd Expr AddOp Expr
+ | ERel Expr RelOp Expr
+ | EAnd Expr Expr
+ | EOr Expr Expr
+  deriving (Eq,Ord,Show)
+
+data AddOp =
+   Plus
+ | Minus
+  deriving (Eq,Ord,Show)
+
+data MulOp =
+   Times
+ | Div
+ | Mod
+  deriving (Eq,Ord,Show)
+
+data RelOp =
+   LTH
+ | LE
+ | GTH
+ | GE
+ | EQU
+ | NE
+  deriving (Eq,Ord,Show)
+
diff --git a/AbsJavalette.o b/AbsJavalette.o
new file mode 100644
index 0000000..70c1dd6
Binary files /dev/null and b/AbsJavalette.o differ
diff --git a/Compiler.hi b/Compiler.hi
new file mode 100644
index 0000000..b0c2593
Binary files /dev/null and b/Compiler.hi differ
diff --git a/Compiler.hs b/Compiler.hs
new file mode 100644
index 0000000..45e99d9
--- /dev/null
+++ b/Compiler.hs
@@ -0,0 +1,195 @@
+module Compiler where
+
+import Debug.Trace
+import AbsJavalette
+import PrintJavalette
+import ErrM
+import Control.Monad.State
+import Data.List
+
+type Variables = [[(Ident, Int)]]
+-- vars, stackCount, localCount, labelCount, finalCode, tempCode, classname
+type MyState = (Variables, Int, Int, Int, String, String, String)
+type MyStateM = State MyState
+
+
+compile :: Program -> String -> String
+compile (Program fs) classname =
+  do let code = evalState (compileProgram fs >> getFinalCode) (emptyState classname)
+     boilerPlate classname code
+
+-- initializing functions
+emptyState :: String -> MyState
+emptyState classname = ([[]], 0, 0, "", "", classname)
+
+boilerPlate :: String -> String -> String
+boilerPlate classname code =
+  ".class public " ++ classname ++ "\n" ++
+  ".super java/lang/Object\n" ++
+  ".method public <init>()V\n" ++
+  "  aload_0\n" ++
+  "  invokespecial java/lang/Object/<init>()V\n" ++
+  "  return\n" ++
+  ".end method\n\n" ++
+  ".method public static main([Ljava/lang/String;)V\n" ++
+  "  .limit locals 1\n" ++
+  "  invokestatic " ++ classname ++ "/main()I\n" ++
+  "  pop\n" ++
+  "  return\n" ++
+  ".end method\n\n" ++
+  code
+
+
+compileProgram :: [TopDef] -> MyStateM ()
+compileProgram [] = return ()
+compileProgram (f:fs) = 
+  do compileFunc f
+     compileProgram fs
+     return ()
+     
+compileFunc :: TopDef -> MyStateM ()
+compileFunc f@(FnDef t (Ident i) a (Block s)) =
+  do compileStmts s
+     addFinalCode f
+     return ()
+  
+     
+compileStmts :: [Stmt] -> MyStateM ()
+compileStmts [] = return ()
+compileStmts (s:ss) = do compileStmt s
+                         compileStmts ss
+                       
+compileStmt :: Stmt -> MyStateM ()
+compileStmt s = case s of
+  SExp e            -> do compileExpr e
+                          return ()
+  Ret e             -> do compileExpr e
+                          return ()
+  VRet              -> do addTempCode ("  return\n")
+                          return ()
+  Cond e stm        -> do compileExpr e
+                          addTempCode ("  ")
+                          return ()
+  _                 -> return ()
+
+compileExpr :: Expr -> MyStateM ()
+compileExpr expr = case expr of
+  TAnot t (EApp (Ident i) exs) -> do ts <- compileList exs []
+                                     let tss = intercalate "," (map (\a -> jType a) ts)
+                                     ci <- getClassIdent i
+                                     addTempCode ("  invokestatic " ++ ci ++ "(" ++ tss ++ ")" ++ (jType t) ++ "\n")
+                                     addStackCount 1
+                                     return ()
+  EApp (Ident "printString") a -> do let EString s = head a
+                                     addTempCode ("  ldc " ++ show s ++ "\n")
+                                     addTempCode ("  invokestatic Runtime/printString(Ljava/lang/String;)V\n")
+                                     return ()
+  TAnot t (ELitInt i)           -> do case and [i >= 0, i <= 5] of
+                                        True -> addTempCode ("  iconst_" ++ show i ++ "\n")
+                                        False -> case i == -1 of
+                                          True -> addTempCode ("  iconst_m1")
+                                          False -> case and [i >= -128, i <= 127] of
+                                                    True -> addTempCode ("  bipush " ++ show i ++ "\n")
+                                                    False -> addTempCode ("  sipush " ++ show i ++ "\n")
+                                      addStackCount 1
+                                      return ()
+  TAnot t (EMul e1 op e2)       -> do compileExpr e1
+                                      compileExpr e2
+                                      let ts = case t of
+                                                Int -> "i"
+                                                Doub -> "d"
+                                      case op of
+                                        Times  -> addTempCode ("  " ++ ts ++ "mul\n")
+                                        Div    -> addTempCode ("  " ++ ts ++ "div\n")
+                                        Mod    -> addTempCode ("  " ++ ts ++ "rem\n")
+
+  TAnot t (EAdd e1 op e2)       -> do compileExpr e1
+                                      compileExpr e2
+                                      let ts = case t of
+                                                Int -> "i"
+                                                Doub -> "d"
+                                      case op of
+                                        Plus  -> addTempCode ("  " ++ ts ++ "add\n")
+                                        Minus -> addTempCode ("  " ++ ts ++ "sub\n")
+                                      return ()
+  TAnot t (ELitDoub d)          -> do case d of
+                                        0.0 -> addTempCode ("  dconst_0\n")
+                                        1.0 -> addTempCode ("  dconst_1\n")
+                                        _   -> addTempCode ("  ldc2_w " ++ show d ++ "\n")
+                                      addStackCount 2
+                                      return ()
+  TAnot t (Neg e)               -> do compileExpr e
+                                      case t of
+                                        Int -> addTempCode "  ineg\n"
+                                        Doub -> addTempCode "  dneg\n"
+
+  e                             -> do addTempCode ("    ; " ++ (show e) ++ "\n")
+                                      return ()
+                              
+compileList :: [Expr] -> [Type] -> MyStateM ([Type])
+compileList [] ts = return (ts)
+compileList (e2@(TAnot t e):es) ts = do compileExpr e2
+                                        (compileList es (ts ++ [t]))
+
+--
+-- Helper functions
+getFinalCode :: MyStateM (String)
+getFinalCode = do (vars, stackCount, localCount, labelCount, final, temp, classname) <- get
+                  return final
+
+addFinalCode :: TopDef -> MyStateM ()
+addFinalCode (FnDef t (Ident i) a (Block s)) =
+  do let p = intercalate "," (map (\(Arg t i) -> jType t) a)
+     let rt = case t of
+                Bool      -> "  ireturn\n"
+                Int       -> "  ireturn\n"
+                Doub      -> "  dreturn\n"
+                Void      -> "  return\n"
+     (vars, stackCount, localCount, labelCount, final, temp, classname) <- get
+     let newFinal = final ++
+                    ".method public static " ++ i ++ "(" ++ p ++ ")" ++ jType t ++ "\n" ++
+                    "  .limit locals " ++ show localCount ++ "\n" ++
+                    "  .limit stack " ++ show stackCount ++ "\n" ++
+                    temp ++
+                    rt ++
+                    ".end method\n\n"
+     put ([], 0, 0, labelCount, newFinal, "", classname) -- state
+     return ()
+                   
+jType :: Type -> String
+jType t = case t of
+  Int   -> "I"
+  Doub  -> "D"
+  Bool  -> "B"
+  Void  -> "V"
+
+
+addTempCode :: String -> MyStateM ()
+addTempCode s = do (vars, stackCount, localCount, labelCount, final, temp, classname) <- get
+                   let newTemp = temp ++ s
+                   put (vars, stackCount, localCount, labelCount, final, newTemp, classname) -- state
+                   return ()
+                     
+addStackCount :: Int -> MyStateM ()
+addStackCount i = 
+  do (vars, stackCount, localCount, labelCount, final, temp, classname) <- get
+     put (vars, stackCount + i, localCount, labelCount, final, temp, classname) -- state
+     return ()
+     
+getClassName :: MyStateM (String)
+getClassName = do (vars, stackCount, localCount, labelCount, final, temp, classname) <- get
+                  return classname
+
+incLabelCount :: MaStateM (Int)
+incLabelCount = do (vars, stackCount, localCount, labelCount, final, temp, classname) <- get
+                   put (vars, stackCount, localCount, labelCount + 1, final, temp, classname)
+                   return labelCount
+     
+getClassIdent :: String -> MyStateM (String)
+getClassIdent i =
+  case find (== i) ["printString", "printDouble", "printInt", "readDouble", "readInt"] of
+    Just _  -> return ("Runtime/" ++ i)
+    Nothing -> do classname <- getClassName
+                  return (classname ++ "/" ++ i)
+                      
+                  
\ No newline at end of file
diff --git a/Compiler.o b/Compiler.o
new file mode 100644
index 0000000..de2312c
Binary files /dev/null and b/Compiler.o differ
diff --git a/DocJavalette.aux b/DocJavalette.aux
new file mode 100644
index 0000000..f23e546
--- /dev/null
+++ b/DocJavalette.aux
@@ -0,0 +1 @@
+\relax 
diff --git a/DocJavalette.dvi b/DocJavalette.dvi
new file mode 100644
index 0000000..22e0997
Binary files /dev/null and b/DocJavalette.dvi differ
diff --git a/DocJavalette.log b/DocJavalette.log
new file mode 100644
index 0000000..b174c2b
--- /dev/null
+++ b/DocJavalette.log
@@ -0,0 +1,215 @@
+This is pdfeTeX, Version 3.141592-1.21a-2.2 (Web2C 7.5.4) (format=latex 2010.8.12)  19 APR 2011 11:09
+entering extended mode
+**DocJavalette.tex
+(./DocJavalette.tex
+LaTeX2e <2003/12/01>
+Babel <v3.8d> and hyphenation patterns for american, french, german, ngerman, b
+ahasa, basque, bulgarian, catalan, croatian, czech, danish, dutch, esperanto, e
+stonian, finnish, greek, icelandic, irish, italian, latin, magyar, norsk, polis
+h, portuges, romanian, russian, serbian, slovak, slovene, spanish, swedish, tur
+kish, ukrainian, nohyphenation, loaded.
+
+(/usr/share/texmf/tex/latex/base/article.cls
+Document Class: article 2004/02/16 v1.4f Standard LaTeX document class
+(/usr/share/texmf/tex/latex/base/size11.clo
+File: size11.clo 2004/02/16 v1.4f Standard LaTeX file (size option)
+)
+\c@part=\count79
+\c@section=\count80
+\c@subsection=\count81
+\c@subsubsection=\count82
+\c@paragraph=\count83
+\c@subparagraph=\count84
+\c@figure=\count85
+\c@table=\count86
+\abovecaptionskip=\skip41
+\belowcaptionskip=\skip42
+\bibindent=\dimen102
+) (./DocJavalette.aux)
+\openout1 = `DocJavalette.aux'.
+
+LaTeX Font Info:    Checking defaults for OML/cmm/m/it on input line 9.
+LaTeX Font Info:    ... okay on input line 9.
+LaTeX Font Info:    Checking defaults for T1/cmr/m/n on input line 9.
+LaTeX Font Info:    ... okay on input line 9.
+LaTeX Font Info:    Checking defaults for OT1/cmr/m/n on input line 9.
+LaTeX Font Info:    ... okay on input line 9.
+LaTeX Font Info:    Checking defaults for OMS/cmsy/m/n on input line 9.
+LaTeX Font Info:    ... okay on input line 9.
+LaTeX Font Info:    Checking defaults for OMX/cmex/m/n on input line 9.
+LaTeX Font Info:    ... okay on input line 9.
+LaTeX Font Info:    Checking defaults for U/cmr/m/n on input line 9.
+LaTeX Font Info:    ... okay on input line 9.
+LaTeX Font Info:    External font `cmex10' loaded for size
+(Font)              <12> on input line 11.
+LaTeX Font Info:    External font `cmex10' loaded for size
+(Font)              <8> on input line 11.
+LaTeX Font Info:    External font `cmex10' loaded for size
+(Font)              <6> on input line 11.
+LaTeX Font Info:    External font `cmex10' loaded for size
+(Font)              <10.95> on input line 26.
+
+Underfull \hbox (badness 10000) in paragraph at lines 51--52
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 53--59
+
+ []
+
+[1
+
+]
+Underfull \hbox (badness 10000) in paragraph at lines 60--61
+
+ []
+
+LaTeX Font Info:    Try loading font information for OMS+cmtt on input line 64.
+
+LaTeX Font Info:    No file OMScmtt.fd. on input line 64.
+
+LaTeX Font Warning: Font shape `OMS/cmtt/m/n' undefined
+(Font)              using `OMS/cmsy/m/n' instead
+(Font)              for symbol `textbraceleft' on input line 64.
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 62--72
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 77--81
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 82--85
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 86--89
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 90--94
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 95--98
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 99--104
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 105--108
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 109--113
+
+ []
+
+[2]
+Underfull \hbox (badness 10000) in paragraph at lines 114--128
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 129--133
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 134--138
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 139--145
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 146--151
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 152--162
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 163--168
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 169--173
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 174--178
+
+ []
+
+[3]
+Underfull \hbox (badness 10000) in paragraph at lines 179--183
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 184--188
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 189--193
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 194--199
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 200--204
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 205--210
+
+ []
+
+
+Underfull \hbox (badness 10000) in paragraph at lines 211--219
+
+ []
+
+[4] (./DocJavalette.aux)
+
+LaTeX Font Warning: Some font shapes were not available, defaults substituted.
+
+ ) 
+Here is how much of TeX's memory you used:
+ 252 strings out of 94501
+ 2714 string characters out of 1176789
+ 56348 words of memory out of 1000000
+ 3492 multiletter control sequences out of 10000+50000
+ 9370 words of font info for 33 fonts, out of 500000 for 2000
+ 580 hyphenation exceptions out of 1000
+ 21i,9n,19p,381b,185s stack positions out of 1500i,500n,5000p,200000b,5000s
+
+Output written on DocJavalette.dvi (4 pages, 8352 bytes).
diff --git a/DocJavalette.ps b/DocJavalette.ps
new file mode 100644
index 0000000..d08b5c8
--- /dev/null
+++ b/DocJavalette.ps
@@ -0,0 +1,2067 @@
+%!PS-Adobe-2.0
+%%Creator: dvips(k) 5.95a Copyright 2005 Radical Eye Software
+%%Title: DocJavalette.dvi
+%%Pages: 4
+%%PageOrder: Ascend
+%%BoundingBox: 0 0 595 842
+%%DocumentFonts: CMR17 CMR12 CMR10 CMTI10 CMBX12 CMSY10 CMSL10 CMTT10
+%%+ CMMI10
+%%DocumentPaperSizes: a4
+%%EndComments
+%DVIPSWebPage: (www.radicaleye.com)
+%DVIPSCommandLine: dvips DocJavalette.dvi -o DocJavalette.ps
+%DVIPSParameters: dpi=600
+%DVIPSSource:  TeX output 2011.04.19:1109
+%%BeginProcSet: tex.pro 0 0
+%!
+/TeXDict 300 dict def TeXDict begin/N{def}def/B{bind def}N/S{exch}N/X{S
+N}B/A{dup}B/TR{translate}N/isls false N/vsize 11 72 mul N/hsize 8.5 72
+mul N/landplus90{false}def/@rigin{isls{[0 landplus90{1 -1}{-1 1}ifelse 0
+0 0]concat}if 72 Resolution div 72 VResolution div neg scale isls{
+landplus90{VResolution 72 div vsize mul 0 exch}{Resolution -72 div hsize
+mul 0}ifelse TR}if Resolution VResolution vsize -72 div 1 add mul TR[
+matrix currentmatrix{A A round sub abs 0.00001 lt{round}if}forall round
+exch round exch]setmatrix}N/@landscape{/isls true N}B/@manualfeed{
+statusdict/manualfeed true put}B/@copies{/#copies X}B/FMat[1 0 0 -1 0 0]
+N/FBB[0 0 0 0]N/nn 0 N/IEn 0 N/ctr 0 N/df-tail{/nn 8 dict N nn begin
+/FontType 3 N/FontMatrix fntrx N/FontBBox FBB N string/base X array
+/BitMaps X/BuildChar{CharBuilder}N/Encoding IEn N end A{/foo setfont}2
+array copy cvx N load 0 nn put/ctr 0 N[}B/sf 0 N/df{/sf 1 N/fntrx FMat N
+df-tail}B/dfs{div/sf X/fntrx[sf 0 0 sf neg 0 0]N df-tail}B/E{pop nn A
+definefont setfont}B/Cw{Cd A length 5 sub get}B/Ch{Cd A length 4 sub get
+}B/Cx{128 Cd A length 3 sub get sub}B/Cy{Cd A length 2 sub get 127 sub}
+B/Cdx{Cd A length 1 sub get}B/Ci{Cd A type/stringtype ne{ctr get/ctr ctr
+1 add N}if}B/CharBuilder{save 3 1 roll S A/base get 2 index get S
+/BitMaps get S get/Cd X pop/ctr 0 N Cdx 0 Cx Cy Ch sub Cx Cw add Cy
+setcachedevice Cw Ch true[1 0 0 -1 -.1 Cx sub Cy .1 sub]{Ci}imagemask
+restore}B/D{/cc X A type/stringtype ne{]}if nn/base get cc ctr put nn
+/BitMaps get S ctr S sf 1 ne{A A length 1 sub A 2 index S get sf div put
+}if put/ctr ctr 1 add N}B/I{cc 1 add D}B/bop{userdict/bop-hook known{
+bop-hook}if/SI save N @rigin 0 0 moveto/V matrix currentmatrix A 1 get A
+mul exch 0 get A mul add .99 lt{/QV}{/RV}ifelse load def pop pop}N/eop{
+SI restore userdict/eop-hook known{eop-hook}if showpage}N/@start{
+userdict/start-hook known{start-hook}if pop/VResolution X/Resolution X
+1000 div/DVImag X/IEn 256 array N 2 string 0 1 255{IEn S A 360 add 36 4
+index cvrs cvn put}for pop 65781.76 div/vsize X 65781.76 div/hsize X}N
+/p{show}N/RMat[1 0 0 -1 0 0]N/BDot 260 string N/Rx 0 N/Ry 0 N/V{}B/RV/v{
+/Ry X/Rx X V}B statusdict begin/product where{pop false[(Display)(NeXT)
+(LaserWriter 16/600)]{A length product length le{A length product exch 0
+exch getinterval eq{pop true exit}if}{pop}ifelse}forall}{false}ifelse
+end{{gsave TR -.1 .1 TR 1 1 scale Rx Ry false RMat{BDot}imagemask
+grestore}}{{gsave TR -.1 .1 TR Rx Ry scale 1 1 false RMat{BDot}
+imagemask grestore}}ifelse B/QV{gsave newpath transform round exch round
+exch itransform moveto Rx 0 rlineto 0 Ry neg rlineto Rx neg 0 rlineto
+fill grestore}B/a{moveto}B/delta 0 N/tail{A/delta X 0 rmoveto}B/M{S p
+delta add tail}B/b{S p tail}B/c{-4 M}B/d{-3 M}B/e{-2 M}B/f{-1 M}B/g{0 M}
+B/h{1 M}B/i{2 M}B/j{3 M}B/k{4 M}B/w{0 rmoveto}B/l{p -4 w}B/m{p -3 w}B/n{
+p -2 w}B/o{p -1 w}B/q{p 1 w}B/r{p 2 w}B/s{p 3 w}B/t{p 4 w}B/x{0 S
+rmoveto}B/y{3 2 roll p a}B/bos{/SS save N}B/eos{SS restore}B end
+
+%%EndProcSet
+%%BeginProcSet: texps.pro 0 0
+%!
+TeXDict begin/rf{findfont dup length 1 add dict begin{1 index/FID ne 2
+index/UniqueID ne and{def}{pop pop}ifelse}forall[1 index 0 6 -1 roll
+exec 0 exch 5 -1 roll VResolution Resolution div mul neg 0 0]FontType 0
+ne{/Metrics exch def dict begin Encoding{exch dup type/integertype ne{
+pop pop 1 sub dup 0 le{pop}{[}ifelse}{FontMatrix 0 get div Metrics 0 get
+div def}ifelse}forall Metrics/Metrics currentdict end def}{{1 index type
+/nametype eq{exit}if exch pop}loop}ifelse[2 index currentdict end
+definefont 3 -1 roll makefont/setfont cvx]cvx def}def/ObliqueSlant{dup
+sin S cos div neg}B/SlantFont{4 index mul add}def/ExtendFont{3 -1 roll
+mul exch}def/ReEncodeFont{CharStrings rcheck{/Encoding false def dup[
+exch{dup CharStrings exch known not{pop/.notdef/Encoding true def}if}
+forall Encoding{]exch pop}{cleartomark}ifelse}if/Encoding exch def}def
+end
+
+%%EndProcSet
+%%BeginFont: CMMI10
+%!PS-AdobeFont-1.1: CMMI10 1.100
+%%CreationDate: 1996 Jul 23 07:53:57
+% Copyright (C) 1997 American Mathematical Society. All Rights Reserved.
+11 dict begin
+/FontInfo 7 dict dup begin
+/version (1.100) readonly def
+/Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def
+/FullName (CMMI10) readonly def
+/FamilyName (Computer Modern) readonly def
+/Weight (Medium) readonly def
+/ItalicAngle -14.04 def
+/isFixedPitch false def
+end readonly def
+/FontName /CMMI10 def
+/PaintType 0 def
+/FontType 1 def
+/FontMatrix [0.001 0 0 0.001 0 0] readonly def
+/Encoding 256 array
+0 1 255 {1 index exch /.notdef put} for
+dup 15 /epsilon1 put
+dup 60 /less put
+dup 62 /greater put
+dup 120 /x put
+readonly def
+/FontBBox{-32 -250 1048 750}readonly def
+currentdict end
+currentfile eexec
+D9D66F633B846A97B686A97E45A3D0AA0529731C99A784CCBE85B4993B2EEBDE
+3B12D472B7CF54651EF21185116A69AB1096ED4BAD2F646635E019B6417CC77B
+532F85D811C70D1429A19A5307EF63EB5C5E02C89FC6C20F6D9D89E7D91FE470
+B72BEFDA23F5DF76BE05AF4CE93137A219ED8A04A9D7D6FDF37E6B7FCDE0D90B
+986423E5960A5D9FBB4C956556E8DF90CBFAEC476FA36FD9A5C8175C9AF513FE
+D919C2DDD26BDC0D99398B9F4D03D5993DFC0930297866E1CD0A319B6B1FD958
+9E394A533A081C36D456A09920001A3D2199583EB9B84B4DEE08E3D12939E321
+990CD249827D9648574955F61BAAA11263A91B6C3D47A5190165B0C25ABF6D3E
+6EC187E4B05182126BB0D0323D943170B795255260F9FD25F2248D04F45DFBFB
+DEF7FF8B19BFEF637B210018AE02572B389B3F76282BEB29CC301905D388C721
+59616893E774413F48DE0B408BC66DCE3FE17CB9F84D205839D58014D6A88823
+D9320AE93AF96D97A02C4D5A2BB2B8C7925C4578003959C46E3CE1A2F0EAC4BF
+8B9B325E46435BDE60BC54D72BC8ACB5C0A34413AC87045DC7B84646A324B808
+6FD8E34217213E131C3B1510415CE45420688ED9C1D27890EC68BD7C1235FAF9
+1DAB3A369DD2FC3BE5CF9655C7B7EDA7361D7E05E5831B6B8E2EEC542A7B38EE
+03BE4BAC6079D038ACB3C7C916279764547C2D51976BABA94BA9866D79F13909
+95AA39B0F03103A07CBDF441B8C5669F729020AF284B7FF52A29C6255FCAACF1
+74109050FBA2602E72593FBCBFC26E726EE4AEF97B7632BC4F5F353B5C67FED2
+3EA752A4A57B8F7FEFF1D7341D895F0A3A0BE1D8E3391970457A967EFF84F6D8
+47750B1145B8CC5BD96EE7AA99DDC9E06939E383BDA41175233D58AD263EBF19
+AFC0E2F840512D321166547B306C592B8A01E1FA2564B9A26DAC14256414E4C8
+42616728D918C74D13C349F4186EC7B9708B86467425A6FDB3A396562F7EE4D8
+40B43621744CF8A23A6E532649B66C2A0002DD04F8F39618E4F572819DD34837
+B5A08E643FDCA1505AF6A1FA3DDFD1FA758013CAED8ACDDBBB334D664DFF5B53
+9560176671A33FC55340CD04C2DE46FD812FC2711A85F39CC27C9356D9B94484
+F4DD09C2306A64DF9B1F15CD359927567E58F06A57B7CA0B3CCB3A4447F431A3
+29C3B79D8CE702D8D8B1E49D8B502021CBDE13253EB066C3021294F19EEC5A8A
+C6280628E069D9C605D472CBBB6B6C84745DDDDB875B10CA7D1DC633818BFD55
+6ACEF83DDBC493FC3269C142777A4305D9619731F7A35DF7B2EC7253CF47CA94
+5C26C11BC1BB05F75428548308015DD8F7EF30201EA9771220CE3CA9C10061CF
+DAEF337865E4AAA1901938B55DC80BE672BCB862A1573B3E289B9E857B08C656
+05D073B0D3A9BE3FBFB836F4D8E1FD9E5EDF3321B15EB3EE3AD76279AD7E5DC3
+A70BFF0DB0FF3BC7C6206933A01FF7266D9717D42E978840DEFC005F64753624
+8BC9EF741E96DA08D450E3016119546CC540CDC7E8CBB8E44BDD6B5C9C6570EF
+CA1FF3CD16DE9DF7FD80077962E9C0A7D73C8E64E11E7E4CA3D17C34F29608F5
+B75546D203ABB42D460FD9F6E03034B2A5D0E55637612776B52F974BFF49BAC9
+50CCCDF3058C1585E2FFCA4E27EF9EFD663005AB08152B63B73BC2F749E75756
+C6A9C4FB6D3E7D830B235715B7963D7D636F60A45076FB5875074B198C842AD1
+8711AF657982ECE8DF082DD15D9C257667955868C36946C1C4E6B2B51E7FFE12
+FAE8A884992C309538C0CFF46C14532CAB5A0DEF8F9C462AFCB2F8169236BC36
+C4FD2A0AA248C51CB9475A233CCF83C91C2F8268F1409ABF3A86525EDB656DF0
+94D0E29F855FD164FCF18E59E980F7967E7983B703D10831BCA8572796922EB6
+1B50EA39181F49E3533D4AE74E0E2C57820C23B7B7BB892E4D7FF1B683F1434C
+0A2BDB687BDF2D895D9F3CA1129355E32F6BD885940478A650CE4BAF9CC62667
+D8874D8952BB9BA21ED2E41235D95509A09C844E1259025AF3C53CF74895974E
+7E39F53618C710110C13D450D650D094C5DF6441DBC0BE7814DCBF72AC1D1EEE
+F5C2525733815ECFF2E2164D75967D3A04530B4332C697BC5BD925657EA7034A
+89800857C32512C60C86C7BD5463C1DD143D
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+cleartomark
+%%EndFont 
+%%BeginFont: CMTT10
+%!PS-AdobeFont-1.1: CMTT10 1.00B
+%%CreationDate: 1992 Apr 26 10:42:42
+% Copyright (C) 1997 American Mathematical Society. All Rights Reserved.
+11 dict begin
+/FontInfo 7 dict dup begin
+/version (1.00B) readonly def
+/Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def
+/FullName (CMTT10) readonly def
+/FamilyName (Computer Modern) readonly def
+/Weight (Medium) readonly def
+/ItalicAngle 0 def
+/isFixedPitch true def
+end readonly def
+/FontName /CMTT10 def
+/PaintType 0 def
+/FontType 1 def
+/FontMatrix [0.001 0 0 0.001 0 0] readonly def
+/Encoding 256 array
+0 1 255 {1 index exch /.notdef put} for
+dup 33 /exclam put
+dup 34 /quotedbl put
+dup 35 /numbersign put
+dup 37 /percent put
+dup 38 /ampersand put
+dup 39 /quoteright put
+dup 40 /parenleft put
+dup 41 /parenright put
+dup 42 /asterisk put
+dup 44 /comma put
+dup 47 /slash put
+dup 59 /semicolon put
+dup 92 /backslash put
+dup 97 /a put
+dup 98 /b put
+dup 100 /d put
+dup 101 /e put
+dup 102 /f put
+dup 104 /h put
+dup 105 /i put
+dup 108 /l put
+dup 110 /n put
+dup 111 /o put
+dup 114 /r put
+dup 115 /s put
+dup 116 /t put
+dup 117 /u put
+dup 118 /v put
+dup 119 /w put
+readonly def
+/FontBBox{-4 -235 731 800}readonly def
+currentdict end
+currentfile eexec
+D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891
+016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171
+9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F
+D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758
+469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8
+2BDBF16FBC7512FAA308A093FE5F00F963068B8232429ED8B7CF6A3D879A2D19
+38DD5C4467F9DD8C5D1A2000B3A6BF2F25629BAEC199AE8BD4BA6ED9BBF7DABF
+D0E153BAB1C17900D4FCE209622ACD19E7C74C2807D0397357ED07AB460D5204
+EB3A45B7AC4D106B7303AD8348853032A745F417943F9B4FED652B835AA49727
+A8B4117AFF1D4BCE831EB510B6851796D0BE6982B76620CB3CE0C22CACDD4593
+F244C14EEC0E5A7C4AC42392F81C01BC4257FE12AF33F4BFEA9108FF11CF9714
+4DD6EC70A2C4C1E4F328A1EB25E43525FB1E16C07E28CC359DF61F426B7D41EA
+6A0C84DD63275395A503AAE908E1C82D389FD12A21E86999799E7F24A994472E
+A10EAE77096709BE0D11AAD24A30D96E15A51D720AFB3B10D2E0AC8DC1A1204B
+E8725E00D7E3A96F9978BC19377034D93D080C4391E579C34FF9FC2379CB119F
+1E5BBEA91AE20F343C6420BE1E2BD0636B04FCCC0BEE0DC2D56D66F06DB22438
+452822CBEAF03EE9EAA8398F276EC0D92A7FB978C17805DB2F4A7DFBA56FD6AF
+8670EB364F01DE8FCAFBAF657D68C3A03112915736CEABAA8BA5C0AC25288369
+5D49BD891FABEFE8699A0AE3ED85B48ACB22229E15623399C93DE7D935734ADA
+DA7A1462C111D44AD53EA35B57E5D0B5FC0B481820E43222DB8EFCD5D30E15F9
+BA304FA879392EE0BCC0E1A61E74B3A1FC3A3D170218D7244580C7AA0DC65D19
+741FA5FE6F8CBF60250ACC27454BBF0897CA4B909C83A56672958752ED4B5E79
+E18660764F155E86F09EFA9F7685F2F5027EC85A775287B30E2069DE4E4D5712
+E7D033481A53A2702BA7542C71062173039030CF28D8B9C63B5596A9B42B33E7
+D922944A38713383D3648A4AF160A3B0C8F3379BA4372BE2E7EA49AABA75AEEE
+C5DDE1D8BF68483C3D21271280ABB91D54CC819680322EAB72E1250A760BC8DC
+FF798F2ABFC4F3539392985C4CB324B0007229586D1E0321559F67C057FD7902
+194490A4C133DA790FF3BF23A13C2B1B69EEB75950F9106F2BA1E3CA65C90FF5
+931DADF03DA48AFB8561FC2E710087251BFC42B80B297A3DB0DA138A7622A931
+DA293B0C740987ACE9F2A8EC2DB98F85783C01623FD3612C7E4A84FD93446770
+C3DD7431F955A5F3734F6931BD790F0A45B8D17CB74BDAA4BFF6DAB5380CBF61
+72F37CB67A909E2842E0AC5D9D07D01A4BABBDE2AC70FE5753460D7E1A708B7D
+0EFB2B5FF55F9E4571C466AF1F91E545585845B09D855C3A01F713C1BF081EB2
+7E2A0E598708737D475BEDAF60BC100FD0A0628C6001A203348CF6A3AFEE6DEA
+A2EB57E35599FAD0B8A52BE1B081FC4B5664114E7A71906DB43D150337D2F47A
+6AE31CB21F0A689336D70C3119180B78C2066FED4D6719AC8D52F7CA1D32A22C
+09EE6ED97334091442AE7417DF9AA9D14397AC32017884DF605AEB4271A8D232
+06617653EF1066578DBC01294709653F77EA622BCD4D19839334B2425736AA29
+1CFE694FA12EAA14F25DFD9925604E5B30C8EB8F4A04DEF3A43B137D875DBDD1
+5F05B2612654089FB0876EB67AF788FDFF37ACDEA67110CE092C31968B963BA2
+03D323057B3EAA23081670127085D745EAF4A52419DEFC59E595F5973AA1543F
+24A008F388A239D55F0B521B7EA7D5A39787EED0C73F2E66357E103D36D963DA
+AA5339BD24E9D4657DE64E8EF4CB6CA788EB5539C901B0396F46EA09BA1C1859
+64E756683FE2CD5FEDE68A73DA2412F1D78103258ECE2E18AC24D4178D209BC1
+39C7B4AECF379125EDF7B7AB388AF123CEE7F06744A2D3B40DF9EBCB26E1CBC2
+E264626AAE1C596C6A07E580024A80190F53E2C94C91A317E3F41308E6BED5DA
+E3C007B5DE689D8856E7B83085EFBD29DC8E75DD226926619882E5BE36F7E01B
+E2D8A47F8A396C254A09FF0295271C31B607FD9464980B842B69FC014A2B1911
+8FE2563054B5D3D327D0492E90EE5086040B2E32A7B4B68EE185F75070ADF01B
+643EB4ECB8173C32125DDDD1F0EEACD779FE6DFDA74CB393AFC449938336BFCE
+D707C4A3521626E3EC116F06C44925EC195D43A9B75DC9BF52862E1D401F2BCA
+19EF593B59EC55BD66119A0B88EDBC4E1BBDC6CBFBCE178D1D323FF8BA1FBFFF
+F234F60A9DFF18AA3A8AD93F5A138E8F074CD92631540E0151D78A609DD4868C
+41C29887544014E05D13CA026903A2E9F6CA07DCDB53F04D423B34DA516B73BE
+FED82617649D9706CE03C21523C22A119F7A4FCBE65C48866C48A1C90071BFEC
+54B5E5ADDA5155E9805BF4270476E6D9CF026D8859B4209B27A9623907074DDB
+84DC5FFB1974747BF5CEBA79A364B783307F854EA2CF71EF79732C471D4EEDB1
+9ECE691B83B346635FAEF4B5C3D6956E0F79493863AAD0C7D56875B8516B3D7D
+01C98233B5756CF5FCB8EF94198E8BB963AFF05EA9B94795151BF638275CBA7A
+3EE3D68DF81488B84D0F756E4ABC8C11335431042127C3A48DA29C692E50265D
+BB159366755B6FA626EEA7AA110FF5DDCA758CA3B50F96F5A04FA0DA8285A68B
+6881AC4A62E631CE2592CC9088C207048F73C18B5C5DBCE96D675CAE0DFD9F16
+D2574330989FBF05526081B76E131A25F65677AE01CE03556701276B016EF03C
+BBF66921A915021284E1C3C262C128689D095E4BFBCBC49F93D14A5C823D85D4
+8648CD99090132FCA4842D555C48E6F8485E59A79D0FCC4E7F8F1B004C9B0B16
+D10C9D5402530AD37E9CA44EB317E0D01D2BD8FE22340A39ACA6D3B569EAAFC7
+419D69546D7234178C95209EFF0C1051238A208A7D9F94BBD240DD35F46E0B1B
+738812BA87E9473A040428AC0FFDA37A27672DF68BD488D7C6852C0D0CF4B7B0
+BBEA56FE18A703160B91D6E556990EF88BEC569F7FD3AECAF6BF371E1C7DB210
+3C413FF23225FFC70E80DB507AC87BB85B21CC588048070B9655A9BB8C52EA09
+A809879674E94FB5C0D158314DE7F5CF723474DD53D7B39817A17AEE41D42670
+96F40A8F667117B0E81D6AC3ACDBCB116BEE0D6E008A9524309E9A9E6B777918
+0CBAF06D47D82E755026594BA31CA0610ED17A3B16435F1BA09885D2BDB6D241
+9DB7D852E2022A57DD08701ABE97409093AED3270F9E2DB6E562932232B167DC
+745A66EE947C15B009D59B6604E95BDFA295D4270F9CA69067041D75A2C35088
+C164A090042E5E8B31429C4B5E4599119386527844E14EA08DF2D5C8ADF60A06
+2CFD3381561B5D367620A79C8F59FF9AE882697367A420C590CD8D246546BAC7
+2392321E12D40F462ECA2F5D6E77702C990AD2C2235A987CC04711F1211B61AB
+6D791951D4A15351EDAD82380B514BA6905601A13B5EEB2C9C5349809D93B48E
+211298A8DAD318A85921997DBBC8DF48ED37691665EE55ABC8B09B4B01A8B3C6
+70901E5ADB8E4B41F1516D403AD1154898E729502D34B5ACD799B909F15477A1
+915556F9239E180C3DE62E018CC4C1CA9384E766AADDC90F013A8A650D9F504C
+55527BE6AE842D66795C1C9FB44EAC3AC2A88F8AFE8D81D8D44CF0E613FB3005
+885BD15AE91BC06C73AD49BC7433248F4816458A483F679A7AC49EFB19BEFC69
+3BE9DFD6715EC63FD24165D96A6CAA38DE8FB84A50B17D22FEC305803BDC310A
+797988887872D3962237155E3CBD97EEF0F9F89BEA97DE7ACBF608998AF3C349
+B805D1EBDEE2D6D6BB660513AA7F5E82867F95C5F9BBE2FFA0DD362C3A895DCA
+D56C93F78985D0B08C03D4221D8A956C03FC122EE2E741F860AD937013D7D6ED
+4005CDF5B607D639DFE8C306A07F4B5E9678F01E5F311EB19DC5ED6415CBDBE5
+5969D8CA35791C46737F9E7C672584F438CE00F33E0BF9A2650D3A124D6D02D9
+6AE4529C2887FE9BFA94F2E67D07588954563DCD20A3430D8B02204E3A84A497
+33987864C23231028569627E498F7E536EE4AC37897D0C8D3296DBBE17C83E93
+5FA47AB5FDDE6BF3499F351F1AA31EBE7658D6E3D61665E0AEA282B3C667AED9
+C44125F8E5A6A31885AF783D191A856DB89F3BF9AFFF1DD879787D85003F55E0
+6739036B6F9E00BC55D0306D3ED87F5762C2303B563689405829F8D3E3D7FEEB
+C37DAE6DDAEF1D15287566FE4A1D26F6454149E2D29B59B36D146BF7310E5F06
+122D87EF80482E6CEE1532B8E2A0F8A344C280BB589BD8612677C2E8E675B450
+FB1BDCC242E8AB3A6D3C54E7DED1CEC708D115F748D9DA30EEDB9692E8B5F624
+1ACD181FA1EA7A440A5395C27E117F1B507C108FB3EC1EC98F34FCB7F88EB5EB
+AB5F463C582D12BC967BE2ADA2F6B44B2EC3F4E883A11D87507D2D8CC9B2CFC0
+0BCC712EA2817B3B5B5390649C4C1A77D767E9B84ABC974BD61AECF35F1DE0E6
+E03E12AA6B216261F6AAB4041121400D456E4F9CA5CB0F25A5BCDB21D5FD296B
+CB939F930B075355CBCA45EB1864D4CD83BA8829024BBFC258A865BD1C73C8E7
+5AF9D7CE61329CB21E7CAF3A458D700FA48437989528E177119D61A9D03A070F
+B078585A2B19CDEABF8BAC338099909DE9F37B5523F4B6586FE0D61F15262AE2
+B16189B1EFE42082EBEB1F4A88D53BAF5628550D58387A91E925E611FC1DE1AC
+13F9AD7858052000706ACCC0B5FB56ABAB595E50B07B2BC4E103ABD2B83AE8AF
+A1611219F29AA02EAC3F6C2676703D0569A856EE619D83F6063904E946BB51AA
+7519AA55170CFCA8A29DA4FF92135DBB66D05DF5108E9F73D36088C7DC22B1C7
+26611C734E562952B9E0EF6358A8EB350382922FC32F20D37A24E194BABA694F
+6D2D20DBE4D956F7D20C2363181A26CC6E53C8D58F086A2F253497101102E343
+8FFA8AF25DE3730712F8E212403C56AC2F8F7ED72AEB19FCFEC0F250E5CAF550
+873A44F52F010DB1640C429406B1EA62122FB18C67F88C7C41207BF838CE952B
+2616A5E423D97924C4E42FAFB22CC1C0778BEF78E113BC61E05281D0EEBFF1B5
+134CD4873411AC9DA8C244773EF518293A1B066A19C578A23AC8CCCA32EC1DE1
+F13893C9C4A44757C340A7E010583BC20D2108F0F46FE3DE745AA7A0384FCEB8
+2351968700D0E586BD4A456C36ADAA6A62C73249C91CD871E7A79131C6EF31F1
+79B1F68A27261051C5F9651E07869AF3EC8B6FC3B67CE12D60FF7899EFDCD5E9
+5567337E1736BE06FC42FA82045EFA7DDA1414C74CEBA65558A3B6AC933FBB7E
+F84A3E7F2A905AECAC5D3882297FF4BE0841E7E1066025B92134062D5D2B3E6D
+D4EFDBEEB41D37BE67A8145991F3BB92BDD977564F3668BF1B4D5967FBD167C8
+59952F16F26F48672AE145A3BA5417C0303E1301DD2658FFEC9F2F29B5DF55A4
+2E3796A9ADEBFDE141B26D0B5315D8250397FBE5D293903B042897A5F4CC1C8E
+59348BF5D948C540CB282326AF97B616F0A03CAD643ADF400A51001CE587AADE
+DED79EF0CCCD920ABE00CB328FB119D14D7271D4023747EB011DA15D32E8B6F1
+14B7AAF9BD1D9543828B8567AAC243E94811CF9B1FB4356FAE252606DD60EC7C
+741B6DBBCF6DD18D757F281D007F71F6DC06BF878AF028DDE9B30C8C4317BFBA
+72D8C95B91CCFFB0A6C0DF90FCAB9738AC6F628DE893D7F2F21F2C2A0A8A3AF0
+A13B0C2262511B884C4CC4CC86C72DCBCAEF8997CE44C4ECAD1A24EFB96A6825
+2D56C8726F67021316F2F6B2007BC22519B2424D5A632FE8F334C65570ABF985
+6392E038684BA24393BDE6F81E7325B1A17D54C495F5F2F137A7BA5878188237
+A35285ADACE49BE62D7335CB14E2256A7F9C66EA820DAC94FEDC7206AB2C7678
+8C12D386CB74084CC03B1F6E5EFD0C7B0AE1C4AFFF0FC7EE75460016955BA001
+790029A5732C908181A1973ADF7507AF6DAB6F5661E1015E627CB2FEF1E55625
+1BEF868EB9EB6113294D14B1A8C98A3CF3C5A73D15BB29746D18CD25432E650C
+FC2F589A7B734043D6447CB90CF4E8DC36EE0DF8A53AACD2EED9FA742E83D162
+80C2ADCE247BB2AE9130FD80A2E4F73E623FA14F07C73E0F2A4C70A224C1E507
+00FA3BFDB28C085525AF22E9F77DE284D019041A0A591D779B88BD3948F568AF
+57DC1483EB0B9A612A1EA5F9FF333CEA3E76C7D6A26A16062FF6D9EED2487070
+8A5EAD791DD3C79DE9A20BF338F089D21EEF2165C33CF15BBF8CA14813633713
+E4C2F73E525B09AB76F03C252F1AA995941E53C6A34494C39ED7063FCE4DD1C1
+2809E9E705EA063A0B5FC594BB5B6FDB201670EBF39B18FC3F4ABC31298B836C
+10FF99A8805E15617EF566DCFA45959D233DC284A1892E3CAA4B90F6ED4DC49B
+CB4E1B3A35DF3EF2D8A239172EAA288C66D58692373FBCFE4DF17906815D7C2B
+1687AAF8F136D93A2745C11FD14107E601DC2A2CAA82C0780768973D9DD53303
+BF03795C70E246B7292E5BDA8EB4C54F1B489E9D3ABAAE3421B3A1848A0C5855
+5909AA98EE9DCCF467DEB69894203769BA34CAE70886339A7E1260ED54142B6D
+E2C6DE5615496369EF0B8BC772F8229EACE6AAD643D1CDFF1672ACD46383C603
+820E7C26C989CD5019A276DF6B8156944F517EB54676D9A6D4BD612067A5BABB
+2E5439C1A5CEA27412CEE2D0453D520A7437363CB7B79A54F4F4D4447A8FF55D
+A653121456BE162DFABC78935FBED26A8F2F628890910DCC7E83E1404805086F
+6A67F7BFF1B67D25F823D3D1BD0832FC48E493A8CC54E83B3B3B9EFDF7239472
+794049B3CFBE90891463364DAF41ADF9492C9C7C7184506F67862227E0A4EB02
+928FBCA400934875E736C57FFE7E060DCAD782A9FC0E8927F6F77C1E13B6DF9D
+D7E1006F65E2E9B45562CE7BB65BCEA62361D16788C20E4CE13BBE5C99A4ABE3
+264DF918ECE88E125A3EFE4E4D65A5684BC6A26FDD6FE79646FA154F48C15345
+C74B15EF11AE0D348A9A519EC172132E278EDB808B30BD786CCD55B72148FA41
+5D37AAED8E8839FF52A7431AD07EC5F070A192615C27386488106D66BC1BEE0B
+4D3665CAD8D96770F05E53207D53BC6DAADF552074EE3805BD6CC83ABA1B2030
+4671DA54CA3E0F7CC525E1A17E5FE1A6FCBEB4E002C74DAA8CF7C0358942CADB
+8E2346E04295523753FFF7D0D584CDD85274C6A3D8BBA1801BF21AFAE8F9E3E6
+0B4972657A70FF45FA07EC7B76B4BBA5F76324899C9DAAD57307DFAA6A9C7C95
+0922494BB09DBCC688F805D421AC775FCF5F723B8BE1B3D81A374016CD9D47F4
+67DA170C74C9E6F046B47E320B634DEEE9AD8AB0A199B673A64A427FE03D3845
+6586EF16F152C5AD885F1C2096F33B11F5B90B5A7FDF714E0727352DA3C85031
+1CECAA87D763AF82153D489F4E12F6A37F24F4BD34EDD035A5D1A660A945B76C
+74B81A03F4F19D7E19FA91408A93E200ADCC999AE8804E211345FFB362B8A53D
+8E174E3A6D9CBB51ED2E9B08B61029429B6BAA92E985D42F5C9C0DBE9DD7A2CF
+0D9DF52786ECAA30F3612ED6D38368AD76A3021E88D2CACBA1C42F07214B3705
+F9C1910AFC668EAE9369E10C004A0E25185E7D7B13D6E86A0280330138B9FD1F
+283E2DD2F0B9D348005459CD9B955A5324088AC59D17037DA9F5E754BAB5228E
+52144C489DF3DCE539A29C825C2390E65ECAB9502D40C7E9869C6F6A6B13C23E
+D52DE912D74763FC7912E0CD86F41A057CB0BB8F8188B66451DF0CB817E81920
+5F1C60BFC47287BF5681DFA8BD4670145D461151048EDA8153CC06A20B0820ED
+A151C43EC7FD38DD38D4FDB20AD936D4057E3576C41213C4FEE650E2C046E3A3
+7590C769CEE47621ACBA65E411BD6DC71C9031C76C30C37C92030C482AA31AF5
+ECA5D5ACE3D3BD4B786E028809702691707A1F5692E4E27EC1B98B8A5105B445
+FC
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+cleartomark
+%%EndFont 
+%%BeginFont: CMSL10
+%!PS-AdobeFont-1.1: CMSL10 1.0
+%%CreationDate: 1991 Aug 20 16:40:20
+% Copyright (C) 1997 American Mathematical Society. All Rights Reserved.
+11 dict begin
+/FontInfo 7 dict dup begin
+/version (1.0) readonly def
+/Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def
+/FullName (CMSL10) readonly def
+/FamilyName (Computer Modern) readonly def
+/Weight (Medium) readonly def
+/ItalicAngle -9.46 def
+/isFixedPitch false def
+end readonly def
+/FontName /CMSL10 def
+/PaintType 0 def
+/FontType 1 def
+/FontMatrix [0.001 0 0 0.001 0 0] readonly def
+/Encoding 256 array
+0 1 255 {1 index exch /.notdef put} for
+dup 49 /one put
+dup 50 /two put
+dup 51 /three put
+dup 52 /four put
+dup 53 /five put
+dup 54 /six put
+dup 65 /A put
+dup 66 /B put
+dup 68 /D put
+dup 69 /E put
+dup 73 /I put
+dup 76 /L put
+dup 77 /M put
+dup 79 /O put
+dup 80 /P put
+dup 82 /R put
+dup 83 /S put
+dup 84 /T put
+dup 97 /a put
+dup 98 /b put
+dup 99 /c put
+dup 100 /d put
+dup 101 /e put
+dup 102 /f put
+dup 103 /g put
+dup 105 /i put
+dup 107 /k put
+dup 108 /l put
+dup 109 /m put
+dup 110 /n put
+dup 111 /o put
+dup 112 /p put
+dup 114 /r put
+dup 115 /s put
+dup 116 /t put
+dup 117 /u put
+dup 120 /x put
+dup 121 /y put
+readonly def
+/FontBBox{-62 -250 1123 750}readonly def
+currentdict end
+currentfile eexec
+D9D66F633B846A97B686A97E45A3D0AA0529731C99A784CCBE85B4993B2EEBDE
+3B12D472B7CF54651EF21185116A69AB1096ED4BAD2F646635E019B6417CC77B
+532F85D811C70D1429A19A5307EF63EB5C5E02C89FC6C20F6D9D89E7D91FE470
+B72BEFDA23F5DF76BE05AF4CE93137A219ED8A04A9D7D6FDF37E6B7FCDE0D90B
+986423E5960A5D9FBB4C956556E8DF90CBFAEC476FA36FD9A5C8175C9AF513FE
+D919C2DDD26BDC0D99398B9F4D03D5993DFC0930297866E1CD0A319B6B1FD958
+9429B9D40924DC059325D9D4CC0344F3F997A99E6CC0676735EBCD685AAC9142
+08DAFEC78BB41AFC2F1C219910BDF41D6279284EF600B69776CA15BC8A34347C
+30783C52AFA60FBE3E353E2AE354CF87B558776A22C776C7A0B5AB5CE1F941EF
+C2D9CAC37294BF407A671F10E4743BF842143F4F7DFEE643BA3BBD8BB9E3F24A
+BCCF7F0ADF8BA500620C81033EAE8C4EF2C1DEF13AC575F1B3BBB66F093D3B78
+5412B82B67FFA087AF57182B2230F9F2137180CA58A7D9B2C822FF04BE6CD01D
+43B2CA7058C7B953F6D9B5D6E91ECBAA5CDE1159B0E59C83DBAD96D6C8C8BAB1
+374EF652D10C0F3EE7104472C98DD3572AAF2D45A70BF7061447E21EE3C3BF23
+DF39C2D1B35B42CD5297BEBE6BC94F7C9DC6E61EC67E4F677256FED9064BD3E4
+B51A71B1D27CA4E5AA9E1D8080E6DAB5310711EEF87C40859FA935B19524AE83
+63B163FA8397BDFF443227FEDF7DB27DC35D89FB1C5E435DA0619A5C88AFC73B
+89A2DF5E767C5B536BC7167A840A0C32BD57A14DE69A7D0D819AC36FF32F908A
+5070F32983BB007437E3500799DF5E0AD3710A4C0000F0098D5BE99F2EB9C1C2
+C444FD9552D0DCA098A94B3BF176F511CEE13DB7EFFAED7C47B5ADCF8D4700F5
+7A5FD1B49560969BF5C44F3749370663A04776F749DDD7B50674D93254426C4B
+EFE264BEE7810EC93784B7C01A7F29EFD92547E13A2C7851A2E709FBD5B87850
+4A44F08F56A542DBE072D2FBC58D9E6468E1AB858DC35240E30D31C7AC13D6C5
+7D2BB634BEE96FA0E10F842B11A789F72A333DD6DDCB1BC23227EBC406E50B40
+30AF0C48E6359AB0C46898CDAF1118E46BFF8B00F54EACBC2AC262AB898C42B9
+2E080C10DE923C1F7BD11CA700DA95F7E94C4C77EB24EFB7D5DD3ED0602D3D65
+14BC25BAA1CED09CAFC735E4C0FA85C8CF554EB15D588234F82643141E259C7A
+EA84EF6B3D2E9D383A26147FB26BC8F89FA85A7B1AC827872D13D91B04138D68
+4DAC1154B4B86132CBB0DF09821892318A3908DD663B1B1F2B81AD55EBB25018
+C5C9B8BA52022C403798792B16B0FF5F1DCF6532AAA161A8C48F2432F559AE3C
+185C589DCC920A2D93175124CD798F376594C2E9A23958DA73436805F2F7BDD9
+C8EE927FA2BDC0206EE968A05798DC4363E1730870E8527B3A54348B943FFA66
+5AF717106A48253BF23C425CF7EA1A7C2CF70CC32515D7087C76507060235ACF
+ADE77A0AF3AAB23B78B71D4AC37C9ABBB5B4A788793C16AD03A683566912DCAA
+DFFA9D5AF206BD07A48D506A9F896684524BACAB2BDE3443C738C72F25391A91
+8750D4933C2937FCB2407AD1EE6E5D008AF7ADDE86B3EB663D02F415DB11EB3B
+949D2397E2B41D64B0D990D5EAD631C3FAC1FE3287BBB90E4C4CF7CF602FD7BD
+8F3F787968F7675C941F95938CA2E09433966D335FD2CE9D32EB6B4D1E18F353
+7DAB8055C9713EC69D16C20709356A7028F14BA584777113EBE50B4A7D0295D4
+0CE05CBE3B17274FB95791DB5A1EF1D04A81DD761FD044578D9AA77FAF70D5DD
+364DB768295641D49A3F4F8ACA7F09B80C353E186B81256AA7E2DDC94EA4787E
+7FD154DD0D3D749B6D96A9344B697E9E0DDDD98534F58E50A85D566CE80A375A
+1C036324819433F19450D3120B0F46150212465B6066BC1FABEF5F8652B3E683
+34E9ED29D042B0D0DEBD52F84C9E77084E2AC27503DE0AB421573C51F58ED884
+4E1B22E1D79659BCD04376A9E8D36B04A4254C57169F7C1F6EF8F76BABA5E1B0
+5E503AFACB16C99D06DEAF6138B04E70E59B3A675A63477E94239D48FD3A8EB1
+5E5E16735601B09F0C4D1A82FEE250303F21D899F2D371D609B040B65C2A4B49
+216B6E25A576B3EB600A2CB6499D3AC981544114849F34A4B01EEB4BF5229C38
+AFE55309ECE6E6D5440CA9AEB984138F87BD4972BEE85077AAE4DEF05537F952
+656CD64AB0EE1A00012ED859838AD75DE90D99C573E1B26D975D27FE836F5D7C
+7B49129A03C6D3A8374013863604712CAA032074DE18AA98007C43BD89A9F462
+C66B7549E9D184ECEAB2B5477D65191FDFE600715AEDF0C7766B907D49A77FC6
+BD47618E6FA0DFB15B26F9D22D145D719B4F5C27503FD314C44E8A9AE7D7ECAC
+BA4141F92DD694B14FB5DAF6CC5996F23D0ABB88294A1865B8CDD55E8F52BC64
+C6871FBAF53E3650285095D61DCEB116E75ED2F92692988E93DA5549FB940EA7
+DFB27C6EC7869D1D7DC53D1E2EC0D6BC4309ADE335D9A3257EBD1706960BFACE
+C713CC8B92C853CBDB0AFF0DE02658FDE0D8454ECD6369F87D7071938F7123AC
+B02DA1A015BA1359330D435EFF45102920C8E056EC78449D77F64566D3432B59
+355671FF37478CF6BA69B5E31A6B6C36D2DB1B397412DBB014DCED07778D81F5
+887DB5CCD8395C1459FE900F3EA80DC74A381B719B8B46BCC82014DAC1020A7E
+4E5F9E0062053FF071DBCEC77C592E314CC82380B689B6143AD5B3F9D4AE6845
+14EBE919B10927659ECB46962305A601D3CDA7FBFB7653BADA268A7A9CED596A
+6D3FB8F18D2E76D4CAC10EE29F04035D5EDDAB08B9DF17D44881A019951A145C
+84D930A1B97704B3FA6D62C0DF84FED4D47497D92E73BD0D9728AAB4C99ADD5C
+111647ABF1F7E01FEA488665487F5A3EFCC33D67C2B672E6E8E49F35A1753594
+40A69F396460D7A85E7669963B77461F8F6C8F6BE9EEFDA1C1D108083C8C72BD
+4795234074329495499453AD1152868C3F1441809196A23A462F9B883E8CC855
+7A3389E6755CCB9BFE8EE9D69FC55EF852A9E0838E642F129A2C2FE9247E1F56
+7674C1659D3E2A03F59F008E45E7A48FEE18A3ECC3D265A236774F982070F5A1
+BFB8444E8BAE77AD6682DC89D2C2A96840FA672B05F9A804632F7925D2FCD830
+89E0CDC565F0094771AC161D613CD5DEA01ADFE784F8C527394C2C2543F26AF7
+7B18BF1B9C8C3522506A0F69E06A88D7DA7BC8F36709D52C1AFB00A88FDC3E6D
+03479B860914994EE0E436C9A6B124F2BA74842EBD2BA8C39861FEC01D337662
+7A88CC2E6AC125DFE7A670DA13ED8D4774A4F9A906E5D3B6660D248D7C08035E
+454366E370798D6483F1AEFBECCD320FCC4C46902BD3D64D4A3883987930FAB0
+81D4F7F285D717C00849DF311B0876CD63733222DA646F5FF087A18AD4F42BDA
+69BE3F5055D9E40AEE4029698E9F5373DF9284A88E40FEE59DA3E75E743CBA49
+CE82376003390E926D307D52B79D1B0644FFBA9CCACEAAFDD14EAF62A7801E9F
+8D666C5FD235E40A0B9D8CE641C28F954A11AD65C96B4693D05DEA075A038E06
+AED19E664A144E1DE00EFD994237ADFA4F28D883684A3EE3036216DDB4026A04
+A36A540D7A45600394E538D22FEAFC1B45F476B17A99F001D66E5AC00A7C4E83
+C95E6CC857277A169E6F368F3F98100A48E3134F244346018B7DD01DA0A39A14
+575765C9990939AC46D9E827B1A38FF275A83271B42F07F13EF869F52CAD4A6C
+861874F431CDDFB64007D078BFA0B9BD6C2203194299405C46EA941E9480C9D2
+3F18C3654086A2AECC3466647B88C79BF8A1307517C3BFBABF24903B60D47CD8
+A623C81F8B9434537C6725B9231D2EB6983AADEC835E719F974F7E394F0786FA
+BD0473FE3EF199B4F83BE26F7CF76A0D641B3E4DB86349B57F3A252AAF20B3B0
+A7B822BE26E126E62459FFF84AA79EC7A69A8B09F501AA51468F1D0A8A2EC28B
+6B8A465EAB3A7AC2C27B10D87513679B06409C1FA6C552672BFB24DE23B0058C
+FB5C51A9465AAAAF205FE26E853103C40004B16B3FE0721CD2FE27BCF12D14B0
+429D7B2F3D136E45D6303E7111231B8185112142F75D626B3BBACF5FF166F016
+D31D7F177EEDC5546CF8AC5F9A6B7A14BCF4781646043B4F47AB0812697A5CEE
+9D8EE51797A5707C18F5119B2EFCE640ECF1A0B8A41C0F9B23395BCF15156E0B
+43E6BB9D596EFF20147428A6F56104238A1FF4BB4AF5C461F7436BCF20B5B614
+6DC12B326B4F34A481DDA4FCFE050465B61651F7538833CD62EA782BF24F4078
+5E47ADCED28139ADA923BDA48F1D2A59A9C5F3D033E641CE720A0FC64382C7D6
+B9B8C8FBCBCF0D033113AA287A5227DE17AA9475001CE00E3AE898CC5BF123CF
+639305A6F39D71C71700F70ED14017E6DDB4CC09CBC9CF8852F2429191FA2A7C
+33910BC91E5D39D83F5979803781A60F26CC2737FAAC5D25E391852BC8DFD188
+EA300D54E5778F47307A656AB2E6D2BBF677B0367C416FAA8C364106FFC1F928
+10D6BE88C972EF9E131231B783A23B8C84D1FA9AA71AB4E5A7A616DD6566D79F
+A3D31EAA0FA80046BB5E95E8475656BC99D0848243A84476350BA202D75CD251
+569793B54DAEC7DED03AE3A9CA120A2C8929FE734950996C7E9566329BD6FF9C
+A7E29DC2832CAFE88E7CEAB5022EEFE94802203FF7C879A742930C68754FB8D4
+F6A213BF5304A45C67725F60A8D519E1401A14ACD6B3249FCA6A46A033ED4DF2
+7A46B406886CE6E868A2433248B32DCAD6F472859E7D0271DD7E7F0F55CD55FD
+BEF1505A86477A66D04866C73AB4CA9855F5624E407CB343427AE58711D1753A
+AB25DA5DB1663FF6D7CF45E95706BE5A2C96E13C848D8F57D8B4C58BFA1266E4
+3B20F4C42BD8A89A156E335656E2B253ACA9A6CC7FB026E0D32A8077B1B36396
+FABDD1DC8B5A0692A5440567DC5D1E6BF68B9235F4A33F087266CF12E2395F18
+6DFF023ECA68A8811C3A8C19176190872DFFCB24642B13DE65581E1EDE92C741
+0B744ACD5124139D4C4ADEF9D017413ACB83C34B92A888EFCDA760AFFFD8DF2C
+094A735C32FED79A83345DE9ACF772140E0569D64CE3C495D559A0A325CF53BC
+9FC55E224F8861CE74C0FFE4C64A7F88C772D80DE8BD006022713BE5D56D014B
+CD18EED0DD49B111DBCB05BE53919EC840A0786659C83CE5A1BBF60F5FB09CAD
+33C23058EF69E650A42CCA14B7360269FD20D74401E2BF3788FFEBF5AD13A7F2
+E109D995D8B71642A6FF6EB8BAE3433E55473B39C07C0580D203D93DC3A9FC3D
+A4D145DA6AF463FB12EC03BBA33963BB7C851540680914A43A4B68F2798759F6
+E99AC01215760D4459ADDA69ED2E9F313D2959F04A0B40BA1905ECF68E6F86D4
+B89FB440B45B90685D80B8012C31FE34675F947BB16E19FAB4CD6EDE10D23C77
+94CEDC9A10D03103512EE6E099DAF1E348FA939CF59D7091F0E1DAA611FAA7BF
+86241A93BE5FE110EE81E0C4C6B23EB6608EBF6AAB7A93DCE6E57EA9AFEF22ED
+CEFBE18BCCCF2946EF53032BA5685E4926968B863371D782461786DB4AB30DA9
+FBD98AED89F2A15DC275ED1BC1902AA4D43C920D3A38EED58899E99282E847FE
+8A08171ECB45C8F58560AD0AEE9DE4A65282DC322B5CDE434C5F36713D9179FF
+153608653E8F384218B9AB9B0B29D870E0E41EE65F70CD17A21DB41C16B8B4A3
+E9CEC7A59DE5BCB05A14BE0E0722601CBC51F6AC25B561B3EE18A602768F601B
+45551EE4901915253479A0FAECA90DD7EA6A378B8646F94C5AB307ABE239649D
+B05E00E48B967221F94F5A6D8BEC49108E503E2CFC6745FCF3776FBE7F22806F
+EC8DF010CD77C9B71E6EF9E36262960937C2EDF9539618C21E11CB149DBDF912
+00251F1039D1FFE0D20B0D328F7454537A68F5B34BF8362235BBCF1B1A0C2F72
+E7F512E78A6DEF858B317F17726A3A68959C1F22D814FA6DDB123C108C1027FF
+E5A843F32BF3B5E4BEFBE6BA09B18122574487DEBB3CE20648612FAD05F2E6F2
+D0BAA481067B9451F7802F6A6593B47BB02446D6501500B9A9218D83B5333520
+24A7D970A01D3B6BEFE24A4DDEC1F64DFA5480E1D34635901E454480B875D2D7
+7C455FE639D60D767679A6E58A51BF30CF843D3DB04165600A1349AC8BAA77E1
+CB7F10EBF5E053B67236935BC55992D574727E1D41A2097E76AF553C9F380DFD
+92B684982B85AE7DA45769BC09A1AEB83BC6B8755DDD8C6DD74710FD7A735941
+2C7614CC38C0E134859321B3F00CD6B8773579A553C06638154D09A471EDFDFF
+33C33578A2AA2410F5FC016B1C509C8141E769F039F1EDED33C7FFC9D0C0448D
+434E5B072911ECEF9D5338DF5F8468BC86CAAC0A7CA99FA953F9F4DDB14C101E
+C5A9DE7698E8DF237A5D03D6BFF32B9C47CAFB7426C9176619429776BC219A62
+183ED559F1D2CA027AE10753B587F2D6CB5E6E0CF154537163971141972856FF
+EF298EEE3553341F553B65DE40D799B507165B973F3E0D4B7DEC8A8022F9A476
+2564B002199B43F7EE8F0407EE8A99DA97C613F9689FD2044D3E37F95BC7C0B0
+231616BD87538BA29840BE633255FD87C7E148316F9014B3691BE92A46BEB4E5
+41112F982A8ADEAC45427D58AD58E25CF8FFF158B263D23F0A22963019394AFD
+4E0703C8C4BE1FC568C899821CBE4B08E791B0C4AEF4A9BBA82663E809C30FB9
+7CFE00D79BBA1BF86CCB82ABF02F80C7E8799723A7B3C75FE3A1F3DE049DB389
+89FD8AED3CD9A23EB5F3E18D3307444556A5160586AA27D875FE6F7E3846180B
+9066FF81C85B663CDEF3748CD1D0BB1D80CECD2052F4D9DA90D4D72F9C109A30
+55BC2E68C1795550790008EAD17EDD9F8E3A0320AD51720FFB3368CC1CC56EC0
+74B20B27EFA94B09D8213129A206A29E189310780A1F12031BA158F7768D8779
+A7A8BF7613A4A47E60B17EE68531BFF85B8072B348E12B082AEB1FBC345E8BA7
+4E668691530FF39BED83A631A4C66AD291D5A618B7012284E602780FFBE8D45A
+EADDF549596827AAC1F4752AFDC844D67A97EEB903397A1911866CFC78AD8F8B
+36D248CE657B96B44B2548C29B57D7694D5D0A677B4998B106AE1738C77A2D28
+1B4EF7EFD4B732827738560937FCA08B013F2CED6C9C6B364E25BE8B81667704
+DF76541D950AFBC862B06445589E1E4C91A048C993E429CF083AD855287B3576
+EB1B58700AEC170D1FFA31850C6EB08130F6B009D9527AE7938058D7BE2B42EA
+3323DEA2662AB1CF5A9E9BAD30F467459F761F2ADBF08A1F0C4EC937E0A5FDA9
+ED94D2B6DF7434E0DBE43E3F973D15D43FC1F6F2F9A801D00CB9F7D5E7530428
+26AC32DEC7E39F9BDF6B1EBF22125175AAF51DA6B115869DEC1495CADBA20D29
+817291A25832D578CCBF9B8A7CB48BC96063B66358E830C64C7E21F79BB21E4B
+FA2B65506053234771F7165D715D9C35B6E7C0517249A650213734A9B247EFBB
+A47C20BBC5B43E427DCA3DD15C31B7DD37FA37B9DFBC24ACA0CE7C5CCF98BDFC
+D1CCD3931E6E9D54C00655B048430669A54C0F96C7A360420B7484A9038D32AE
+A04E08462CAB42657F2F2EB2A1B2B3100FC54278884EA30F50B51BD4442D55F6
+E33E156BAB20BC6709A9523A8A310D77A6638F8186D0F82ED5007F7DAB4597C2
+4641B3096B0D1A8363F60F2E9408340A9E0BF3AF940AA2730347F144F849E7DF
+537EE6A6AAF14D1323BD13F3FBA2B256D9339620A3360D2F4781EAD57147361B
+5BD9DF23FC647F7861027789C5096E9D5750C93E4D4353524D85947AB4F406F5
+44EB34497DE13013B1D9E59587076FBEF49DC11EE38ED1CC7E7735AF2D5A700D
+74FF83F2C961B1B33A9B154F7E9007D3E084C3A027D4F78E9AAE108F342A98E1
+74B755BD40914CE985871F61C41C54A4FD1F23979ED02C3DF8956C05FEBC1CEF
+EA75FC3C7D49C28EF751C8E9EAA916FBEB352C97CCFEFB542D5EEADACC9E9343
+E50D374D80EB7C838CCD935AA6CCC8FC135FBAD5BD95DEEF0DF97DE68AFFCBD6
+827FCDF3D3FBDF202B24A959CC0A6646330066B2EA98D03EE38DA092B8DE6034
+8FD673A7F4F32F65E450634F35781748DBCAC3849535C79F95CC57CC1895C146
+946D28A22AB7C30BF0BC48268AC1A55F1DE9B2E27CC941A2F3720D7533476593
+1DD612E1B9F4A763275E575B58AEBBE184A283368CA5C6E3A90ED77C1DFD836A
+841174D815F781E84CE1BFEA8DD2F237455A5486E08B4B6CB481752D79C7549B
+8235E112D1A827753AE59046B2A9495C90A4B1416CCCA89E8B8593D5107EFC49
+712D42B2A80BBDA4520A2BAA7A4AC7BE2844CBF26EE3AF6187063A81524912BF
+787B9A833F0E1ECEFB3C8EE0C46DFB79EBB06BBF01CC50EE56C17C9FEE28271E
+E48FCAC88B5A3FD0B980423BB51DE40D3B2A3E1FE0B3B73D9B182B12F4E9A571
+DD480F249E63470033A7A7CE88484810473E0A7816AFF2ADFA716ECB569DEC39
+655FA05B58ADABC79DC28EBA0F7BCB393D3705809F7F32B57F0079E5DD6D4BD5
+198421EB5011ED244B836B12CA657E4EA8ECEFB681EAC8034A7A7170B647175A
+A08F63ECDDEBAB7E6A3111300F5EF6D218E7DD93D42072ED443C7D9C675EFA4A
+BC825BF14C940F5CEE6705B1500739FB4646A67D7C94DC08B5E366CAF6EBB528
+1F29CB572A6E372E0C3B337AF7BC37AD6B93D905BFC6841686A12BE2A11D6D4B
+A61903141E8651008A65A10AE8F7F7AD34FC787D87EF2BC89A5FA8E3EB037AA0
+F8676F4C81BBE4F599F1846770FD819E51019C0BD1622D836AF585864A25944F
+AF0EB699E19F1EF68FECBDC9E315EF155555D867F1E63BD62450C1748B945899
+2258D41E7BBC48695AAF176B7DCEDBCC211AA36C96B90B224926A3DD47FB4902
+6F08C828F06B9340AA0CBB371912E9F70371F62EF14D9C62CBA28C0CE8459E49
+8405957DEE0F88E86FF3F3D0DCEB4AC6A3D33EEA9EDE786B99CC343418CFFF10
+C3935DA25AD65E364A43B58F5C5B7D9FABD170728091A63BF6ADF027632AEB6F
+9B6AF7E8DCDE2B072DA5564F91797891D52333E54BC730A4054038A9E9A7B457
+6BACAE6A776CDEA871FD1D7D5AB62778812EC1E7251491DBEB293D36552A543E
+CAC713FEA1586F82DA8B9E9B935EF513F8E245CC543BC4C0F1904EC569093F35
+06279DEEB9698B8325669D947BEE78BF3FF30B45A06EA7AA5D603DC05E008497
+85E541D2FD829F18C3F7D9693CEA67DCED23EE9613EE8A11E1D33BD631B9DAEA
+A230316A39224E071463D7197819FBD41AB23B550481CAEC03785FC675D706CE
+FB0D9EB41C4BA9B8CD5BC6865FE425D87004969A32C4EEFC99187D4E2BB0D140
+B9BCACA0D8CD5B4DEE19077B01C82B6358FC4FC0A842C8E6950FA12054F13FFB
+B2F8A1620BA3B21A0214C3305584236512C32C55C89F1C95C27AA50D6C8435AE
+9E400598B69251773063BDBD07424CC68D545BEE404F0318CCF9DF2C9B8A564F
+9D5F5266BEADDF1C7D10C45F1C6A79A2BBFCEC4C866077FC5061163A760E42FB
+766EA6CF2A6357E19FD2F0572A1C2DC0FC02AE5D203925B70C1CB59408587DA7
+A368A05358BBD1EE6D7CB766C9D54248A05EB4D7E148057B173871F3EF342886
+F15577E27DD8FDE6D16955CC1C67EC0FD1A6A9A62D85890BE1221813CFF6BBF3
+46BED8930828C25999809B32FE3A352E6B49F808357D8B525E2B90D9D9EB2C3C
+CCA8963DC983961771C8DE1A75BFAA2AEB16383221FE56066C4913B3322AE401
+6864AEDE2683AA3906ACC077F259058C671B734FB8B75DB9BBCF6C18227DFD4D
+A8DB3A3CE0AF9382821A7BFC4A0D29AB806C4243C4546A5143AE09DA8E1CC991
+3AD67AFBB15209105BE7157866B4AF12BEBDCAF639CD0FFB501DD5D25235FDF5
+78AC0B5E564A4FFE53E69EFCD658E4A51FAF0E47BDB1A543AF21BC9109B74302
+8D51D7C197A0906E6EC25A40C9B67F12BE690855C6E8782AEF153C9421C0F46C
+FE9E7C978196888DBD54E9096769F0EA261688418C80A933F0BC984F196D1247
+28E25AA92D7B33C6ADE645C02BF8061C157FD01AD04EF6F0F0357EFD3DC9941B
+CC2CAFC9CF40C04C7141D4EAA00CF9C790742614CFD5A55B35EA7B374F97A34C
+58F8E5C8AB3E50350DF9EA171E7A779CAAC5FA591769628B5239351C3C5EF12B
+A0A0B5BFA852C0C3DE5960F680EE3DA26A8F21B03BA6F8E3638F9B3037C69E85
+C50509F4348FB8595827B20E4CAB9823C580F83DADCFD3CE073DFE89E682EBA2
+AFA67D6499837388014C68B71A2A5398E999ABCAE218B80B98FF736F803F85BB
+FC35A58E847B06E64E8430EBC9124E8AAB98743D6DC95AC473C52650F12C09DF
+64C5A1373FDCB881492BE0ABC3EEAE064BA609763F66871E7DDD03693170DD7D
+4BB0E03C30F41C2B7AD3E6918C4A0276B691FB176799EB3D77ED02E08600BB22
+EBEC1EC60BA57294D5799311A96EF28841FF1E6E0C64C729089DE6BA2BAD6533
+541E1A334FD5599751109578D1845625436FA4AE2DE4DE91BB9BC65A9237EDB1
+F3E5DC1C3509A82E114AF84A77A246B286F05C7CB5062522A58234C674410050
+8471CC81C67D163F525922A899FCFB74C469BF01138C4CF29CA9090C21B859FA
+72BBDCDC49DA515D2DDE96625C54A77CB3127C893D7096A799E3C8AD5FF618E0
+B1C5EFA243EB37E4C45D6B5AC733AB67B374FA99A7FED41C69B7833649DDEEFE
+59A90AE5497DA7326BE9A7AEB1998E3A0613EAB68A6D4952926FD5C6541F8D01
+77E903A500BD0B77E25B1D5D5E1662E213F153B9C55F172F3306B08772B31F45
+92B1C35C284BF9E46FF98FBC11915EFDA1B193DD3360872C06EA392E853D8814
+C110A9B9116CAC841953E74FB07ED1C4FC4A1900E73319A89F45B71D808F753B
+3C342117054D603057EB27986C35D11C797E21073E4B6BEE54CE160BA2D3C62B
+5EE22A2271A91FDF556E2B95CFE5BD36B3A0EAEEDAD787CC28CD8E6986A56562
+1E2371168AD2327669771784CD864D19027A916FB8816635D66D54E7C11C94B1
+5E903919C3F5F1224E2F6ECAF3E1B755DD55BC4F0CB0EF2DB05ECA668017AC57
+FA3755E728DDA126A5EE2416EC70D9FC23F005A75DEB289599463EA7DDF85A6A
+B4924BC7EE89A34DEC101B6A76D5D95D2427ABD8850AC682529144FADD2C85D2
+123CC622EC68CFA6C9AC7AA463E5CE1EC5BD30971042D0828C29EDFC444C209D
+8AA1906D30AFCF63CD51F6E9C7F72061E0FEF703F11665D909D1F88C72CCC7E7
+AEAD130C668372953FB84932780779776A917818FD71857A9DE5AFE8FBBDA8E7
+C5277E65070ED981E0C73617294BA4DC72237DE5D366B468B52FB1F16A8B2D13
+1BAB4C12EE82A9E6C7DB7DB63F62BC4E4C60FA2105EA7382DE6048F031E8E9EF
+4821F687B79DDD02A3CA1AAB01D0CED1DDBF6D2EE582AAF14D9067FFECBB89C7
+8B8DD5
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+cleartomark
+%%EndFont 
+%%BeginFont: CMSY10
+%!PS-AdobeFont-1.1: CMSY10 1.0
+%%CreationDate: 1991 Aug 15 07:20:57
+% Copyright (C) 1997 American Mathematical Society. All Rights Reserved.
+11 dict begin
+/FontInfo 7 dict dup begin
+/version (1.0) readonly def
+/Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def
+/FullName (CMSY10) readonly def
+/FamilyName (Computer Modern) readonly def
+/Weight (Medium) readonly def
+/ItalicAngle -14.035 def
+/isFixedPitch false def
+end readonly def
+/FontName /CMSY10 def
+/PaintType 0 def
+/FontType 1 def
+/FontMatrix [0.001 0 0 0.001 0 0] readonly def
+/Encoding 256 array
+0 1 255 {1 index exch /.notdef put} for
+dup 0 /minus put
+dup 102 /braceleft put
+dup 103 /braceright put
+dup 104 /angbracketleft put
+dup 105 /angbracketright put
+dup 106 /bar put
+readonly def
+/FontBBox{-29 -960 1116 775}readonly def
+currentdict end
+currentfile eexec
+D9D66F633B846A97B686A97E45A3D0AA052F09F9C8ADE9D907C058B87E9B6964
+7D53359E51216774A4EAA1E2B58EC3176BD1184A633B951372B4198D4E8C5EF4
+A213ACB58AA0A658908035BF2ED8531779838A960DFE2B27EA49C37156989C85
+E21B3ABF72E39A89232CD9F4237FC80C9E64E8425AA3BEF7DED60B122A52922A
+221A37D9A807DD01161779DDE7D31FF2B87F97C73D63EECDDA4C49501773468A
+27D1663E0B62F461F6E40A5D6676D1D12B51E641C1D4E8E2771864FC104F8CBF
+5B78EC1D88228725F1C453A678F58A7E1B7BD7CA700717D288EB8DA1F57C4F09
+0ABF1D42C5DDD0C384C7E22F8F8047BE1D4C1CC8E33368FB1AC82B4E96146730
+DE3302B2E6B819CB6AE455B1AF3187FFE8071AA57EF8A6616B9CB7941D44EC7A
+71A7BB3DF755178D7D2E4BB69859EFA4BBC30BD6BB1531133FD4D9438FF99F09
+4ECC068A324D75B5F696B8688EEB2F17E5ED34CCD6D047A4E3806D000C199D7C
+515DB70A8D4F6146FE068DC1E5DE8BC57032092296D5371C275E56FB4903A60E
+73A22818DE22EB78EEE0E69EDE2E31BA367FE9AFFF8C7D74AB1E2400953F643B
+7BC604F821A4CCC56FC4E40E0B40B8CB82A045EFB4B9F681EDBD012AC35166EF
+62940137319D3082A03402A7DF7445D6DF72A08C50D42FA9522541426CE2EFFA
+6B5FAEBFD9303E4C83BC87126457252C8F0FEDA1F4F7B15900778B124787518C
+144A2871765EBB27D77495285E7B598849208778032914459C0FDDF918D0571A
+5053CA94A1C275C3561BEFFBDE1A783B9CC3A8F96907FD937813C4144B49FACF
+401C9FECE2CCB8F5F20F587B6A2B69AB4ACE33E484F79F02A1D157E8B2646AE2
+3B45B8C5678306C54CCBD918EC6A29028B58E22AF7FD5AEE30FBF9BE83D1E978
+F785B2C153CC3BDFA58BE805BDEC19F9939744B5FECF198AD7694D93F87E736D
+CA393920209915426BE93C18ADAB32741E1B5DBA8ACF2A20B8D1E969E5864A89
+A09B38CD89FD63A5D8232798FAD5A18756D36289510E7426C9A8FC7EDCA96FEB
+F40095A02E09B967A15763B4B19FCCAFF9F2F22D4D173DBCFF0FC94BB52494F2
+15AF39264B66D459FB5FD724659809C363F979002C6E0A16E92BD911E4BB7737
+5008B1ED8BD0DABF276D766707A84B56F4C37AB5B492CD6A9A5E51EEC058A92F
+EA89CBF0BD957D37E0EEFC58A768E04DFCBBD2481931441646F45ECB90CAD8F4
+19D78718D20263B775569C4892D4F0E97C5B255D21DD8D4AF3C026E715BA4175
+5B0BA30CDB4B7BECC7A0633D3B04113B2902E40CFF408AECFED3251CF24654DB
+1DD8D815413485C2CDEC786402DA1AF6C6928AFA370A4545263131BB9FA6085C
+738AEBD097184D1CA4802D8F757EF292A9C899A42A9A40586F86C4642289A8EB
+DF2590C4A7536355AE8F6DA0D1FAF0B4D0992C9354B24CA5F34735D6CCA5B0AC
+D96D3D3865CFF14CE1B4753A5A03E8227BAE434AC47EAA24CFF0AA397C73806C
+6272DD939BF6DA1D114D0B4AF28ACB39EC53A50FC0E8EE359B6660D18844408B
+854D8FAC45357366372212DB734BFE90EBD9B38A8377DDEAB6A53F7CD43E2FF1
+5C7B427DB74C2DF808628240C337A1DE51C769D2D7C8DB906F2362B65F0C19F4
+D3A0B3A395EC999123CEF24C6B16E9E6EC76885E6AAF054B8CF869E974D01062
+78624184BEA285F0C3698560557161E77C6A24FB2171DEECEA6140094CBB6D0B
+514821A3BCADE3EFF02E399A3362DECE05AAE09B65C0999B9548CDFC0A313272
+F4DF655F39FAE7EE82C5BF72EA9EC85E3A788DC4EB4E6AFF20783FB337B115CB
+21AC4EFE148A
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+cleartomark
+%%EndFont 
+%%BeginFont: CMBX12
+%!PS-AdobeFont-1.1: CMBX12 1.0
+%%CreationDate: 1991 Aug 20 16:34:54
+% Copyright (C) 1997 American Mathematical Society. All Rights Reserved.
+11 dict begin
+/FontInfo 7 dict dup begin
+/version (1.0) readonly def
+/Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def
+/FullName (CMBX12) readonly def
+/FamilyName (Computer Modern) readonly def
+/Weight (Bold) readonly def
+/ItalicAngle 0 def
+/isFixedPitch false def
+end readonly def
+/FontName /CMBX12 def
+/PaintType 0 def
+/FontType 1 def
+/FontMatrix [0.001 0 0 0.001 0 0] readonly def
+/Encoding 256 array
+0 1 255 {1 index exch /.notdef put} for
+dup 12 /fi put
+dup 67 /C put
+dup 73 /I put
+dup 74 /J put
+dup 76 /L put
+dup 82 /R put
+dup 84 /T put
+dup 97 /a put
+dup 98 /b put
+dup 99 /c put
+dup 100 /d put
+dup 101 /e put
+dup 102 /f put
+dup 104 /h put
+dup 105 /i put
+dup 108 /l put
+dup 109 /m put
+dup 110 /n put
+dup 111 /o put
+dup 114 /r put
+dup 115 /s put
+dup 116 /t put
+dup 117 /u put
+dup 118 /v put
+dup 119 /w put
+dup 120 /x put
+dup 121 /y put
+readonly def
+/FontBBox{-53 -251 1139 750}readonly def
+currentdict end
+currentfile eexec
+D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891
+016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171
+9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F
+D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758
+469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8
+2BDBF16FBC7512FAA308A093FE5F0364CD5660F74BEE96790DE35AFA90CCF712
+B1805DA88AE375A04D99598EADFC625BDC1F9C315B6CF28C9BD427F32C745C99
+AEBE70DAAED49EA45AF94F081934AA47894A370D698ABABDA4215500B190AF26
+7FCFB7DDA2BC68605A4EF61ECCA3D61C684B47FFB5887A3BEDE0B4D30E8EBABF
+20980C23312618EB0EAF289B2924FF4A334B85D98FD68545FDADB47F991E7390
+B10EE86A46A5AF8866C010225024D5E5862D49DEB5D8ECCB95D94283C50A363D
+68A49071445610F03CE3600945118A6BC0B3AA4593104E727261C68C4A47F809
+D77E4CF27B3681F6B6F3AC498E45361BF9E01FAF5527F5E3CC790D3084674B3E
+26296F3E03321B5C555D2458578A89E72D3166A3C5D740B3ABB127CF420C316D
+F957873DA04CF0DB25A73574A4DE2E4F2D5D4E8E0B430654CF7F341A1BDB3E26
+77C194764EAD58C585F49EF10843FE020F9FDFD9008D660DE50B9BD7A2A87299
+BC319E66D781101BB956E30643A19B93C8967E1AE4719F300BFE5866F0D6DA5E
+C55E171A24D3B707EFA325D47F473764E99BC8B1108D815CF2ACADFA6C4663E8
+30855D673CE98AB78F5F829F7FA226AB57F07B3E7D4E7CE30ED3B7EB0D3035C5
+148DA8D9FA34483414FDA8E3DC9E6C479E3EEE9A11A0547FC9085FA4631AD19C
+E936E0598E3197207FA7BB6E55CFD5EF72AEC12D9A9675241C7A71316B2E148D
+E2A1732B3627109EA446CB320EBBE2E78281CDF0890E2E72B6711335857F1E23
+337C75E729701E93D5BEC0630CDC7F4E957233EC09F917E5CA703C7E93841598
+0E73843FC6619DE017C8473A6D1B2BE5142DEBA285B98FA1CC5E64D2ADB981E6
+472971848451A245DDF6AA3B8225E9AC8E4630B0FF32D679EC27ACAD85C6394E
+A6F71023B660EE883D8B676837E9EBA4E42BA8F365433A900F1DC3A9F0E88A26
+34C33065640AE2EB6C8AEB2D923557929EA9527421E1721B36B67C16197DCA2E
+75177C9FF7B1D83F3264323BD855016DD25AE33ACE9FBBFCA28D9F17A90F9CAF
+D2C1F22ECB6685CE21B67A5B564DDEC2194859A5A928D4D909428590175B6934
+2AD4C1BC3B62EDA1F932C5CC3CD5087234C9163A4AC3EC51FD2A85C080A0F5ED
+0B6E7959D5A2925D07F7FD1CA216FFCD05752AB60AB363FD5898A2DB23C91656
+A6EE6A516596F644EF38433FF2601A129056790D2FF16C70929D92861F233A94
+37671A110D28DA58C0D3110CD3F0AD7BF27D94832E6DB7D92F330BC669337880
+03A0A649F6CD20095CDB8543E12642C2C46BB0F5F3BA587C57A837AF07C89164
+DB2A16A42D84987086172DEF0ED3A76FB223E36ED772FEFEC435CE91633F7EB5
+662F6950D9E593B5C09AA35E061C5306416AE23C00309E955305CB502B054128
+6D922D3D9A8C0ABC8C6C9456FF0554B461B473C0EDCCF18AA5276447C66BC9B1
+88F02A4952163F43DC8649570C39424F6FB2229F32D02F10647355E49C326B51
+5F2FA1F6B70D9DB8DBBEFDAA8ED95F0C853428C199ECA7C40CC8DE720A24439A
+2073018B28B430C861205C07C913B33EE62E86B3D076093479ADF7731A937248
+25DF0B23EAD91752D4403BC64497C44D4985C6DE837EF58266BAEDDCCEFD9AEE
+C44C3E80D2030B4846690382A2D9E775D5F50119389DCA5AADF86F2BCB1470CA
+6E81C7743FA1F21C03AAE6FD189D7556BF44F29DC7A9363E0C0C87BC555E2472
+7EBE40FD9F446389FFC771F1C164989977702783EBA5CB421ECBA56F2E9102B4
+FD19CEA66B49E4EE5679B8FE0EF1D5F611AA8E02A30C52C13354EC78D0A8D3E6
+940EDB0816A9C7D089661195E38AF4CCD3E18A66E66FDE8C033560B93581019A
+2619ABABD92EF3A8A0E20837D7F51878CC8A29200C73F6985445DC557B219637
+4AEC25DC2A7E1DFCC8058D3D0F2EBBEC84AC1519042C222B5A1C446A4C5901D7
+F7D86AE18BC6B5A0BD6E41A3482DD7CA8E4D0ACFC4F24777B81540F66098A695
+E67F4E3F2A5758DF7EDD37D7959A0625D8B3ACE8BA90C5637D2CBBDA8644B7EC
+659E0CCD20EA1FF7F16210C0188CB8A561D486C05C1A854FC9C533B5AF1E83B4
+1AC9573D133924C924455A27211DB53898E8A8397A14583AF985EAB432042F73
+E315FDFAB4335DF0DC66770598EE4D9C4AD1E24209B8F7211C0F4907D8FBB163
+7BC494C7B11C5C19E8E74D7D55445E7382821CD616A026079564476BE55B7186
+A5559586352A79821DA6A8A8B49095C8F1EE28767F112F15452D679AF70B3E13
+07BE42B0496D6CBF24DB1BC6FBF26E7AB7EED25D29961CCA2AB415DC2C0459FE
+E6B501661120C87413096D85136CEAFEB7020CBDAC187CD38B694BB351D4D792
+9D58B46DE5E41562FEDD312337BE16086AC545B01DE2F5C4ECB05822FC766427
+9CC27F43DA0CA18DF123B1F635932CA8C8DDE505F98051AA8F6EA42F6C9E5ABA
+E812D4D6AADC2ADB0278A2FA28BDE6832F758BC71F38DB5B634B2523B7612967
+1C4D2809450FF0A4B7F4CE749EA812EDEC4ABB5799C79F71F2F8ACA1C0A8AE1D
+778A7A85054E63C018278FEA847E0E36001FF2AB343751D89DF4307744BE02E9
+53216FBBDFCC682D66F5C5CB7503E44F3BA3B854AF62EF1CBA883C03016E59B6
+C49332BE00199A64772DB85DAE0848D0843F1EF14F99FB230C45BF27E8B02852
+0862FFB47122C815169830843F31477D07575E828A6DAB2DAD8C77849ECBA3C2
+2C4EF6E42C80B96B37D805C666FDB68AB5B9C6F97E7AF516A5A399A99AFA8E62
+66CD652215A813284F04B43206BF41FD1F00E68E04630A82B140BFC3F91522EC
+B51784D9D4593257A681CDE6E2C4BA439972D9D6F5AEB9FD9A28E07C9C1E3926
+13C804A66649A4CC29D9637F585E0E3C503A31DCB5BFE2EC908E275B4D0FBFA4
+41957B4E2A14FB4424507D6FB44A7EB0A86EAD94D7C1EC5B77C8B05464463D44
+3D9A2691D8D6A8E0C65F0D6C71D9979E47E5CB6C8B8A1CA74D82568D0E6E5B93
+857054A519D03799C11DFD9E02176589AE0A79A08BFDB403E8C02A450425E1B0
+90C761A1A37E54C3B738FA9AE8E0A7E468C73D978D09ED2A2F9E6C4D578EE6BD
+D2D9BF001F5BC1369F0B2D64C2ECA855D5FCFA4E3414D1F3C0A810FDAB94C5E2
+D04F8799C7E95AC53D2D0BB89FCA4F07E7B8664C5DC38ECA9B96FB1EA4B634A2
+F795A4C63126CFD1F62E2FA649CD83A60534288E97E115BC5C70317E67DBAC6F
+7E6CEAE8B276582810C9DE838679F53D1B6F5357B65C242303AAA375365EB54F
+71D298E7BCB301EB03A52274357B3AE1641F063D0F500DC1822F2D0F01EEA326
+6901E0D1F678ED312FDE1271E91F2322A0B5C0CE21025AC7FA56872E582DE628
+BCA33D46C848D95EC8798461909CA9430887CCCB0A7AFD328D253412B7E1272F
+8BCE52415994BFAE2AA9BC5B15F88AF271F6BBD905A1BD56263ABB0CE18A590B
+F60D9D744E60E3B2268D487D41D75036B57F06090989FBDBF21DF07E0389E5ED
+BA749E34924FE624DDC926D64CA0074584907563B2729C6733CC9447655C9145
+5E8588FEB902A8F2C04EB992A82C0EB2D9F661FD316347FC2D292F86E7150395
+30032BFEFE0D06A4EB2EDF52116A28E179AAFF9370533074920349781CD7BA8A
+6E9566FB7BB8B8A447DDA86FAB54438A20A0423C063649B998D907E0225DD496
+58EEFFA64F6C4169757BD3F7346B3A5EFB69BD6E6CAE09889601AAB6A7CCB3AF
+74F19E564296364E2ECDE33CC45C66A34D60CED476F86117F48F1D6D37119238
+49E8AAAF99C803B30447EB3FD3CE0F46E5190C00078FDEE18A7F3F8BAAA68A77
+E5037AB225048FFC18D63DC425983DB5136D6C9EF7E41C17A28C989C5213A541
+A8D2668CCAABB766B5AE2D2C4398C9B603465A70ABEBBDC5FB143605FEEA369A
+E15C6D2A9269F499AE2212D3D4BBE155BAF9FDD7084F75AD5B9C9D86829473CD
+4BFA38B2226BA5FD39B7A11C7FA150B852163B8BC005179DE8FA9905D87F4560
+B3904C13B9C1F8C61183F6D884F5936EFE1A6F801E3008C380DC7C82FB772D20
+716962463255027A9A0855F0E0778067B5B88E1A12EA0AAF6F3DE89A49C7D207
+FD2F7C0B287AAC5CBC716DCCDE349B4ACEB38893EDCDC4E1D4B36A304609810B
+707BA0C4997B64AEE7E5CDAA7B5121490628D8BA707F66F584E0A8F74498A34E
+BEE01FE82AD441D38476B51E1C1EE9BE99D89B22DD0E9297152A4E09CCBD1CAF
+76CEB2923AEE8D4DCE0BA0D21EABC4DF0C7280C9CFCF4FBB195778F07605672D
+B776BFFC6E15BBD054C710EB0019F7C49DA1D2D1FBB756BE0F9442CEF0525905
+3C57BED93A6D436B14EB735199D360871581AB7AB85820FE99D0869F461DCDF6
+4B113A1C9E00573D73BD07B6679B40637DE21554CE46ED99A9A4C5D6E293FF6B
+2F772C9FBD41845BA5349AC975F15BC524E1AD86BB37982CBE76FC16F46A4F92
+3ECFAE2132C835E3A6CEF250CB7121BFA3C7400D4351806D4D5297FEE462B49A
+043CF43DD1187ADE46AB0454B542A4AC59813DEAAF9E54922E09F456B30BEFB8
+F157393D84A89FC8B8CA51FB718AAD8934886A72B5DFE0C34F63C6781C6B63C9
+7751A5332543E6D2778078845319BA0339E38B1D4E2A2D9D4150A714861E2ADC
+00B24208BEC268140402888ADBB63080EF73411A08DFE8522BDE3F6676BCBBD2
+12331FCF4E159FDED8C781065847378742FDFECCCC61E96D4BD79ADCEB20397A
+0642A3443C67EAE52A7901C6161935A6B5B610A872A6DDA3B95ABA1C9AE9E251
+1117AE1424789989578E3B14F9C39231F5A34775024C3C9B8D3B17D666176A13
+5860E38866A3ADE789B1C1C227D307293DBCB4FB39AA3471327E28A246DCEB00
+E27EA18172170CB0F08D00E2332741942158AE46A2C4C604DE489EAAC25B15EC
+053B76795EA4EB4BF10205E880ABC24966513C3D32B63A07668F71583EDB4DC1
+D7D878812B206D43658A26EC1744261C89106D7B5D164F9B5F2525A3EB38515B
+56A40EDE5693882EB3C084B7507390024BF0A8E57D770819B042E1F8F8970D57
+04220F03F50A14D8B7BFB774758412D84264520A9A3B0212C1AE990305FE1DAB
+87B81DA2D141B0AF6D54152998D5C1032E7BBABAF42542370B95F8CA9B3A47ED
+9EE0A6F9ABF5F6D960F2D003DBFD03C06E602F0EA1F9E41D832FA739113138AD
+6EE516FD76C69688EA905834F31E58AF5FD745744B617B668A43F0517F6E4261
+3B06B444E78B9ACAEB50BFDC25B551F393DD3F3784453776F4B634BFCB2DFB6C
+AF94576924972BFE1D344A5849EAE93807431A78BDFAA2060A1126D71881CDDB
+B5F520B1E6B4DA5AD0C9004B04F78B83A4972FA52D285807E14FF176B7FDA9AD
+838DC78D0988B8B6B0B994569B4DD30C0E2E5260676DBE1B9C04D1AA9586B85A
+03A30AB5B6F1EEAD506DD7D3BFC5316392C6B765B12513E870750019FB555515
+32CA850CD77B133F5C90B67534F1F983C7BD884EBE6D39E16E405280D5C800D3
+8F467960AAFA4E58779B4E62ADB885A977790C15A1F1416A5D5FAF60F540D40B
+3337855DF6F179530E6E581F888868A4DEA32A71A43C56B825AFCBF2F576E9F9
+1E14CBC5D909C84FE59237FD4E569039386F357275977AD7CB0948C0DF62A115
+1F6913576AEA2A769D61878E950AE3FCF93154831A86EF99ED630C074CCC16E9
+53953FF06C87E6ACED361FB42FFDC22729AF29DBBD1B1666DC34532E0B3E2387
+6AC5DF0AADC3E8E9E69E942073DC6CC6912D8FCC07C2E76B1A3C49D3E845C5C5
+4C2E8E26D7A96BB6FE33FDB5DBC43B6938B1538CC4DA7C9D0AB0DC2813BD21E3
+2CDB8EA5F0E8C5DA25E78E8160B850E6375D7091B6F597DCB0BA673237A1B3DC
+A1CA70E5E5F3B0A63D18512FA3DD664FFE9F521CA8FC13CAEA3AD04A0AD6F89E
+86A0BAC5311EE34233EDB6A1DF3980CA25329DAFF31C0E37526E4C00B55201C2
+DA63331299E36ECC8E6ED17825A9ABDA8C3FF60ABC502730FC79A1449E9DD257
+9644EC5A98A4B367F7785481C0443D35000A900573EBA9A13B64B5D2317F6E90
+1B7200E37D2F2AC6A09C7970B25F71CD3D1E3BCBE5927FCDDC53BBDEF4610E74
+1C1DB066D4A09B67F67F8871BDB3CE0AD7680F61E46F946B55E78056F54C4295
+1750E7FB0619B86EFDBC6B0B9B17FD7FFDF657CF28F59D1F0A259C3984A373CC
+72A20F46F9E998D19A7F3EE3AC371226536C69ADFD050097F341FAB96D73C3D8
+46F595567EF178C82C30A953648890E6D986BAAB2EA9BDB8D201364C84B22B05
+AB58F715370E3DFC29A3270EE8BCD80FAA23AB1E003B9B62F4A80729E3518D94
+53D171DEE19E26C6FC9C12199A6F3E997A690F4D26418FBBC5CC4770080FB0B2
+F32B1AE606114633D0AD431D05B0871C5C8A23ADF67C101889BDD1207BC2C01A
+F94F4F9AF2942FD0A978F60E607903CCC35F08E3763B5334760DA0C750C21D60
+3C09BA423FC85B01088DD57DD0AC85EE1AE5B801D1115E29704AA8ADE9AB323A
+E9C2BEC420B2244C652555DB8EB5B50F4CD286714E9084BF1F41FCFF4C040450
+4D01EAE466B2504430782B4B92B7259216531C0CBAD0C766B5155DDBB3A214DA
+129D940A82A692CD56EEFEDE2FE5FFA4BFBC1436BCB9D572C76E7D7EAE15B85E
+6DBE97E10EF5257945DD96B83565DC1332
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+cleartomark
+%%EndFont 
+%%BeginFont: CMTI10
+%!PS-AdobeFont-1.1: CMTI10 1.00B
+%%CreationDate: 1992 Feb 19 19:56:16
+% Copyright (C) 1997 American Mathematical Society. All Rights Reserved.
+11 dict begin
+/FontInfo 7 dict dup begin
+/version (1.00B) readonly def
+/Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def
+/FullName (CMTI10) readonly def
+/FamilyName (Computer Modern) readonly def
+/Weight (Medium) readonly def
+/ItalicAngle -14.04 def
+/isFixedPitch false def
+end readonly def
+/FontName /CMTI10 def
+/PaintType 0 def
+/FontType 1 def
+/FontMatrix [0.001 0 0 0.001 0 0] readonly def
+/Encoding 256 array
+0 1 255 {1 index exch /.notdef put} for
+dup 39 /quoteright put
+dup 45 /hyphen put
+dup 46 /period put
+dup 66 /B put
+dup 67 /C put
+dup 70 /F put
+dup 78 /N put
+dup 96 /quoteleft put
+dup 101 /e put
+dup 110 /n put
+dup 111 /o put
+dup 114 /r put
+dup 116 /t put
+dup 118 /v put
+readonly def
+/FontBBox{-163 -250 1146 969}readonly def
+currentdict end
+currentfile eexec
+D9D66F633B846A97B686A97E45A3D0AA0529731C99A784CCBE85B4993B2EEBDE
+3B12D472B7CF54651EF21185116A69AB1096ED4BAD2F646635E019B6417CC77B
+532F85D811C70D1429A19A5307EF63EB5C5E02C89FC6C20F6D9D89E7D91FE470
+B72BEFDA23F5DF76BE05AF4CE93137A219ED8A04A9D7D6FDF37E6B7FCDE0D90B
+986423E5960A5D9FBB4C956556E8DF90CBFAEC476FA36FD9A5C8175C9AF513FE
+D919C2DDD26BDC0D99398B9F4D03D5993DFC0930297866E1CD0A319B6B1FD958
+9E3948FFB0B4E70F212EC976D65099D84E0D37A7A771C3101D6AD26A0513378F
+21EC3643079EECE0C9AB54B4772E5DCA82D0D4ACC7F42FB493AA04A3BF4A1BD6
+06ECE186315DBE9CFDCB1A0303E8D3E83027CD3AFA8F0BD466A8E8CA0E7164CF
+55B332FAD43482748DD4A1CB3F40CB1F5E67192B8216A0D8FE30F9F05BF016F5
+B5CC130A4B0796EE065495422FBA55BEE9BFD99D04464D987AC4D237C208FA86
+0B112E55CE7B3782A34BC22E3DE31755D9AFF19E490C8E43B85E17ECE87FA8B9
+1485831624D24F37C39BF9972D74E6EC4784727AC00B9C4A3AD3DA1C22BD6961
+7E0ADAF55422F22ACA5E4DCD4DF9FCD187A566B7FB661D0530454D0DD6C6C50A
+7A3875C6CBF8EC7769F32A1F3F7FC1C072BADEC97794D4E90E0035282A170402
+356E5A9CD9ABD80AC4342A5283E458A7269252F4541CBB6452B39ED54D336D0B
+19928E9CD1AB26AD83EB209E2EC75011A2643813053B5DBB0246097C4821B5F2
+C92554E9140BE35B2DBFCD98809A8EC9FC910FDE9E0D86457C70ACB056EBF90F
+244DC0A5BBD455E15D6E3180311D52CF50B0BF7D0A7F64F3A1821E0AEDBC2E7B
+AEB549FE1D51088C153799C6E089B5D5D65E1C4E2D2B430CDF1FFA23CCB25D95
+5C405DBE86B7439E0ED3852DB08275EEA457F1244C29150228D167679D78E7B4
+9D7B67A1D3CBEC072A1A22806BB201318A8A03A41164024160CA501F200D272C
+713BA3B6124BCDAAF015B9D88D22D442A41D3F2BFC5D2A62DA183B416A9C1E96
+8A1E1A3762703996D9FED79367104EC44D61479A298C63AC064562B04E431B41
+2D4301E80344397713B6E0A5C2C75174A96B29A309C8C682A5D13D60C88DAC92
+657E7A26980893FEB5496F9D7C6BDE291A2BB41899BC9881BB6CE76FAFC31BD5
+EC1A698AFBEE2418DA80E93F82F7477A180FF3D6F876D5E3064BB81E68477D95
+26E492876E68EDFFADD2E4AA3D5831D8B65598F8F36DB986C6C618AA75E527C0
+4ED4016B8B54AF92AD30C02EE0CC7F10BB2127F7C006E1403DABB1EA22D44FA6
+51507C6739FA847B5C691FED64CF3791615E7783782D4F27F8F33BBC5A76CD95
+0530530F72971A48C4DDCC1F166FC377C2F39BE321A315C83604387EFCA580D6
+E4F60540738A238E22E1517F733FA8B908C7344E9B36F479D108CD6698F1CA23
+C254E2094856FC605BA12EC2286159485427B15AE6808DA9A7954F0C06170E9B
+56EA967C4057D972079E573860A09A4EC8247AA04A7302797CA90338A55D6AA6
+79F121AD1BBD62D02743145FB3B13F7FE4A19B9E2D6A42A3F8EC42F8D0AA2841
+C42884998B4184D30D4B23D93A698F9A833DB5D3FB49418977E5427B573554FC
+1F9DD4376159137BBF5089BB04C1E1BC3C347D686EFDC73BC41145E5B22C6816
+58595DD7FF87867C05608CC9338ED08DF09C2090A8A6D20104A5038F44C11BDE
+B755CB6F4CDCF72A51095A2283A78D7AF1406286CFC8DC4D01C46614D7777103
+47086C4A964CCA6567E5ACEF7CA5CF1A9962F922B325F1C66F2268C4C4C193C8
+8A6B27EA1D54B0507DFA53AC2CC496615C53441B7F870932C28106C84BF7FE05
+126E342682A59354DC3B88FD4BB58C1134FB55ACB6090AAD8A9CEEEF12222E47
+029CA2AD8518FFABFA1C5077329862E0219166E8CA7BC07CB837D81AA7FA5F57
+99345FF77C6F8D1DA423003EBDAFF5CD0448356C0198A099CDA62409AE6CAAEC
+271DB85AD5E47BC66DA59C1112DFE19BF97553A4F05A30B92A6521C1DF99B767
+A9600B7305B99AA2C48B0034A30F5B7CFE5CB05C4520B38ED1A80F95650CD0C8
+393EA2D79AF7154DE41E461E9F9D42B5E2F67016D68623B4D1F7746967ACB45D
+31EADF5D5A752C81E54ED171778245DE58AF396AE745B4E9E119553E90B51FF2
+631A0BE030E8ADF2DEC7AC6ABE7C6F7FA8F0D5607A3A1A89782FB3E2213173DA
+EFD3AEE2ABBC75710B7205B2A9C205FD4AACCACF3A18C94C0E080C3FEEC5B8B9
+2C3AE52B2C653252AE38E13ACCC94A179DFAC48D345FD8E5E596FBFA89D19941
+0209C14F68D67CD9C686AED5FE4C5ADE97F21B1B40101AE3303AD93CE9704914
+FD875E2F6F09BF40FA1603E147EE063FC4C743960396642013AA96363D07A240
+12A31426F0B7FA8F3086296F6044D377411CEF844E6D85DD4A440A1DC19E5163
+7B3E91729993F9C9B5AC21143A9F3813A4FD498EB19DC83C651C26805B4A0300
+D16739E72ED5CFB19134C3262E0650FC05703C9E3532482F3C6A96437FC949E1
+2172F9999B2CD1720348EAAD3097D46C3FE292635048AE33E17B01C281164E70
+CE4C181F1A728A89CDE1452F1C6A56A7087397345A480C50F7E9FDB0003A85AF
+435515697B8D906C33207DB831AAA29F3A14A005BE1A19DB7D1D499C5600989E
+C1BB9121156DAD956A6726141A72C1EFB85956C45D8A4F5878B58F6F52293B72
+4C128388633A48F8B3B9E3AAE3F8515F4C7E0B1BB45A981F72C2A922474081D1
+FE0533D320761321D0E868DB9A1993FB7D128CA9AE852A1D98164069C35EA9FF
+A99EE188AF378EA4C723893C8408A369B9FE2B438FCC6232604AEE65E75A4927
+0E9C92CB699B9B2AE28C8F7ADBC235DCB2190697BCDD1D682949ED23F9C9A3AE
+A7D1F0EB948A44E88495C3F47922A9C619F9AE7CB63F833C769F8BDFCF20826A
+D2D644FA55613CA3A4D653E57DA4D161202A5946A2ADCA1976AE7F0949970D83
+6B6C892BC1D63C6B50DD6852F4C84441BF14649E1B2ECB33D1A7061A29AF163A
+DE2BE0D88A003FFB55202F95F490E6D351382DD44167691118B7271595B95AE6
+57137349169A36A85EEEE6901BE0595787BD3B02ED825B8A31BEFE2DD1ECDC09
+3A68D9D7A39952DE982EDD694DECCDBED653FDE81314A2C901709B3829258C4F
+E8AF29BE571E8505B105439DEE433D756E39FAF7E89B111CF4B65A56F51CCAA7
+22231BF8FCD16DD5E226AB4969E123264EEB4E2CDD9A4DF03BBBC01B63683FCE
+CBB3D9F6113950EFB9504CF429E0C6805DAD619C7381062BA56D4F53ECDC78E7
+99BE44F37384E7439D0ECA6F4A36CEF107EE46D5DE4B474143EEF66886D86AED
+930E98E00B5E509219CB86A4809E2CF597FE376DBF0BA074D681640036AD5D02
+CB7FA2B1039C23F264211F51BE7F3C001654BC61D5952038874ED97EC3FFBEA0
+26C89F68013B494E15A5155B1B80F5EACD3C6638448BB68AF42EB17BC23CD0C3
+9E5FE2A71349F7ED831577A5576A6CD6D77063576B7A3240552DDE82D5EF6335
+0A7DA4DF70362B3ED0817CB0BEC29BA06DB492C6BEE867F6411DDA387EB09052
+C809A3B6B1A996748DA30FDFAF5F57CC28003FB0F2D5F9AD4484BA50AA672FAA
+3AD449C9C7DBCD8F956A0E2B313E3AFE5F65E55D980FBF7F716F8B1F31ADC961
+CA19F9EFAD2FA31B3782D393208349A46A4334D733C6E102A0247F4F305CBE17
+0C1C798CCA6E63001C542C7206FD1E0CCAA0A8ADF7D7121DB1C4DCA1992E706C
+E9AA929F0B870293E7DFE199750E3EC08C1314ACEE9773A7916F73BA1233A7B0
+C1C08C0E190454590B16192340BB9108CA0C6F85BB9B10C3D8EE63F711C4563E
+4621983AEAC378DAD2721E6A7710A1DA6693057C1FA4B697E5D5AEDF36738764
+3C957640B6C6A78782DC14A79F2A33297CBDBF02E8AFC5EBBEE3781D301ACD0B
+4C149982EEC7080386BE2B4EB0440D2F357044E3ED4B77BCF4375581F1E8A727
+E10C406728CAE6A00D64A5DAA43C80E929E56703C137D255EAB14FAD72C21D29
+8A0C4D62887EEE2E83DFE67108474D721E72370FC288D4753C16FB9EC9A3E244
+60CBC04064FB29001CC7A996C4F185D46C88AFB8D11FC8849E62B8E80BB70006
+97DE661A5DA90AAA6F9FD7698949514CD3169B8BDDC42AC5D8A423E4E1FDF475
+C8D4A653DA6BB084E3F285636DE8182FC2931450D1851669130861E9F9EB371D
+5457D0C2826BFE26D0F02C24F0FBC4D1EE611ABD65B0B352A37F21DFC7E385FE
+C059B12AF38A159925141482E7F5B68D8F62F162A2C458F7DF7DBC2E547E4F43
+5F09E4BCD5431614B2C81F9334A330D603FE8B4B72BB8273E366FC68EE6A0C63
+E18B7F4647C5FC2FDC609E71633B064A89028940FF455BFDBE291B7E965900C9
+F360A3233D5341755F5E1B40333B470C5FB2B18BBD3336A9F300B5BAE45AA2B2
+232DD19F86AB7D01D90487B241A9F321EB41D9E836F5DFC678DC69551701BF3C
+B02DA50B80EA569FB1D8741108C86297C38C55898EC4A31CD10565B211004F29
+BBAD22C404FA38B9D6517969F7017F390F617666ABE81A7804B513E2FBBC5DF1
+450CF4655F361CE2B610D4793E8703132E4CB48983FE7BD0E402ACA484E492CC
+C132239EB646D7D33B1FC677FB223E76B2F5A850A109273AA1061F86BF0F5E9A
+F4F6C152B643BF77CD305A4E696EEB17E74C4C99867D930A302E
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+cleartomark
+%%EndFont 
+%%BeginFont: CMR10
+%!PS-AdobeFont-1.1: CMR10 1.00B
+%%CreationDate: 1992 Feb 19 19:54:52
+% Copyright (C) 1997 American Mathematical Society. All Rights Reserved.
+11 dict begin
+/FontInfo 7 dict dup begin
+/version (1.00B) readonly def
+/Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def
+/FullName (CMR10) readonly def
+/FamilyName (Computer Modern) readonly def
+/Weight (Medium) readonly def
+/ItalicAngle 0 def
+/isFixedPitch false def
+end readonly def
+/FontName /CMR10 def
+/PaintType 0 def
+/FontType 1 def
+/FontMatrix [0.001 0 0 0.001 0 0] readonly def
+/Encoding 256 array
+0 1 255 {1 index exch /.notdef put} for
+dup 11 /ff put
+dup 12 /fi put
+dup 13 /fl put
+dup 40 /parenleft put
+dup 41 /parenright put
+dup 43 /plus put
+dup 44 /comma put
+dup 45 /hyphen put
+dup 46 /period put
+dup 49 /one put
+dup 50 /two put
+dup 51 /three put
+dup 52 /four put
+dup 58 /colon put
+dup 61 /equal put
+dup 63 /question put
+dup 65 /A put
+dup 66 /B put
+dup 67 /C put
+dup 68 /D put
+dup 70 /F put
+dup 72 /H put
+dup 73 /I put
+dup 74 /J put
+dup 77 /M put
+dup 78 /N put
+dup 83 /S put
+dup 84 /T put
+dup 97 /a put
+dup 98 /b put
+dup 99 /c put
+dup 100 /d put
+dup 101 /e put
+dup 102 /f put
+dup 103 /g put
+dup 104 /h put
+dup 105 /i put
+dup 107 /k put
+dup 108 /l put
+dup 109 /m put
+dup 110 /n put
+dup 111 /o put
+dup 112 /p put
+dup 113 /q put
+dup 114 /r put
+dup 115 /s put
+dup 116 /t put
+dup 117 /u put
+dup 118 /v put
+dup 119 /w put
+dup 120 /x put
+dup 121 /y put
+readonly def
+/FontBBox{-251 -250 1009 969}readonly def
+currentdict end
+currentfile eexec
+D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891
+016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171
+9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F
+D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758
+469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8
+2BDBF16FBC7512FAA308A093FE5CF7158F1163BC1F3352E22A1452E73FECA8A4
+87100FB1FFC4C8AF409B2067537220E605DA0852CA49839E1386AF9D7A1A455F
+D1F017CE45884D76EF2CB9BC5821FD25365DDEA6E45F332B5F68A44AD8A530F0
+92A36FAC8D27F9087AFEEA2096F839A2BC4B937F24E080EF7C0F9374A18D565C
+295A05210DB96A23175AC59A9BD0147A310EF49C551A417E0A22703F94FF7B75
+409A5D417DA6730A69E310FA6A4229FC7E4F620B0FC4C63C50E99E179EB51E4C
+4BC45217722F1E8E40F1E1428E792EAFE05C5A50D38C52114DFCD24D54027CBF
+2512DD116F0463DE4052A7AD53B641A27E81E481947884CE35661B49153FA19E
+0A2A860C7B61558671303DE6AE06A80E4E450E17067676E6BBB42A9A24ACBC3E
+B0CA7B7A3BFEA84FED39CCFB6D545BB2BCC49E5E16976407AB9D94556CD4F008
+24EF579B6800B6DC3AAF840B3FC6822872368E3B4274DD06CA36AF8F6346C11B
+43C772CC242F3B212C4BD7018D71A1A74C9A94ED0093A5FB6557F4E0751047AF
+D72098ECA301B8AE68110F983796E581F106144951DF5B750432A230FDA3B575
+5A38B5E7972AABC12306A01A99FCF8189D71B8DBF49550BAEA9CF1B97CBFC7CC
+96498ECC938B1A1710B670657DE923A659DB8757147B140A48067328E7E3F9C3
+7D1888B284904301450CE0BC15EEEA00E48CCD6388F3FC3BEFD8D9C400015B65
+0F2F536D035626B1FF0A69D732C7A1836D635C30C06BED4327737029E5BA5830
+B9E88A4024C3326AD2F34F47B54739B48825AD6699F7D117EA4C4AEC4440BF6D
+AA0099DEFD326235965C63647921828BF269ECC87A2B1C8CAD6C78B6E561B007
+97BE2BC7CA32B4534075F6491BE959D1F635463E71679E527F4F456F774B2AF8
+FEF3D8C63B2F8B99FE0F73BA44B3CF15A613471EA3C7A1CD783D3EB41F4ACEE5
+20759B6A4C4466E2D80EF7C7866BAD06E5DF0434D2C607FC82C9EBD4D8902EE4
+0A7617C3AEACCB7CCE00319D0677AA6DB7E0250B51908F90A32C4175B6BFB279
+024EAE1B04D721A6C54FD62484F8949B2CE9B87D9CEE04DFF82BF14931B3CA03
+AA5F701B6F80BBCDF2C427C40A51597F0B1BFA25EDD7CE0EAF2EC676BF0059B7
+15DD5462BA30DE78A08DD533DC0E8D85F9DAFC5FD842F417265427E0F1B71834
+D2BF6EFAC3CCC40D3EF3B2E2080F148441BA45E5D0C0F7D8416730AF4BE4FC93
+1E965594E0364F0D4F1EC48004CEBDDAFB1F0EE0A8222358EAC0F62E6BFA3C9F
+46875EB4C999219B91E6147A49A668505667030CDF3495682B79C0F614AAEE68
+D976EFCDCB04127C0D7325A2211E49CD316935A0B472D1F9FFC68F7FBEBC7269
+79DE858914A95826CB2A8F0F17773C8DCBF6481A19CA03EBE2F1EEE59A3D6E3F
+C23B65AED2429ACE7D1CA1F45B06D9C952F6E026953949028A6B7A4138666C7B
+0A7B10F10DA7017B72F57DC4971A485ECAA7CBB1F832A94E176F8B529878D4C5
+E8A0F09E2150921985A94BDE6B1666471A95740E5F6371C4D75613C7B412A1C1
+38FFDD146B0B64AD4F04A51631C5EB5ED7C8166670286774E6F6DE84349A11F4
+E76B19B1A7164993C18C97C3DAD8B5F5A1DA74E8DBE68A92CAFAA72A6B274560
+0785C7B52C4EEB47FA5FD640739E1F09D5C68333DC61135BA3E5397F55DF844F
+9EFE1E760903FDA43C262935B16E6F19D676D79978415CCDF6AF7447548E5DE5
+D5D19E6310CBBC224F848F23B91849F5AD80F9C913136B46CE583D38BE039EA0
+81AE29A2FE3EBD7443C35BF9B78A2B7F54A48609AEC90E71132EA82236C9BCD0
+740A8A2C8303D177A2632301DEB9F7E09CAD2173C071C4A37B14CC70736B448E
+2B97608046795079819327C4ECBF72D946A1BBC62AE3CE6AC861327C6DB47384
+A7605A7B64FB9DB341259B91A98EC5637451A1A7159DDA13E066B21CB0E8B059
+74EEE9B9F95B5ADB9844C27ED4C80572B49954D81E4245F11C5A2B317440E323
+4D7D273AB1838330B58F96FE0386D048728E6C5FAB68358E1CD4481F6DEA7CCE
+2D711A218FC3953EA7B36F464567F20F78C5C18B4FC2D4E9A761CB53A2B9C0B7
+3863B4D8DC22CDA11119E4BA04E8112F4BDB701BB94B4E2A73F6C0BDB2D359E7
+8E2524AFD0906EF13FD61C0CD303F0DB6286A4C96B19722BD65B59507DBCF6EF
+84E03C0F850630AC64B3FB2B49B5A02CCBDC12B2C878FDE9B2318A214D6F84B5
+DA7785B657753159F4F6C81663FF30F73572C2861BDCD86BB33C5B99C749BD60
+737EA0ACF374733D744702FE26C4FA602661A6266C1517E4B22E4FA4CBF3DBEF
+35723043DF35532AE3CF6B4CC492912D9F2115A75D70CC34A975775C6475B155
+8AB65F0A28C42F26DF0960E2DCCAB7F5B7AD1D32634DA0015252177274BE953E
+B1442DDC534883AF9881C5FC191EF0B9EDAC431DEA67D5E4F4E0F9028D21A9D7
+47867EB25755EC5A3AB82BC4934C5020FCCF385748A6FC1B31FF4F3F3FB192E4
+2CE99CB5CC37916FA46985DBC1D93E255E70C065BC9C98D0ABD8936BE0A50844
+708D9DC95702912FCBE4A647ACA2C2F3CBD447FBF1CD01C8CC9CC39BA25245F7
+13FA5FDDF053954F20EA9A154C9C727F415F11A23EA01AF39E74986AD0D2F755
+B12C12F4F713A2B3CFB3C824BA4E35D3B3637CA82B8712699F04DB55B4C71B44
+FE937C1B332B826CD5D525C20AFDBBD7262F5E0059150E703F1848500E018E6B
+BD98DCE7ABE51F50E117D36042EFAF4B316F4D3B1E1AD9DEDB16EA64FCD27D1C
+B19265EC4883E1B6B167476CF6C2D0B53C1532CF5D4BF38D1CB5715299092725
+DCA0E4DD9320ED043B37B11D6B45D26742F2212987D55E5C675F0DA4B2719C6D
+70A9A4208FB0C6EB31A3B8C8E52B3866FB70FCB3020687D96B94355D20ACC40E
+309A3E96054DFA9C43DFE6C1773AF1A438B71E1C39997CAC9EC8CBAA1F881445
+E11D824FB43419C4C340EF3BA5D6C151D2E05179F6805DE9C16266A6F6B949DD
+2176886CF7C2B1B5146AE258B1ECE8E2BF4C53F14FC097B8A855EE9A4F2041A0
+19505533107532A2E04C32CFC15EC125094CC9EFE5B987A0BC67540A38EBE7EF
+29C9E5E4FBE1838AC31D2D59FABF7110720A0AECAC488604EAF3F99128B2E056
+AF840F34620EFA343159072ABA6C61F56A91F3E6D381174F0F67569B956C84D7
+74D3D9F9FECFE40B5C6638ED075E2B4B2ABB5270DDD015D8B3DD287A1F794C30
+171D2DB716A651547E16E17F20645878C6C2D2422052BB859568E6BFDA2F62CE
+5E64C53DEC0BCB9CC1C1AC7E0F0A34B185BAC9EDA57B71DE541EBEB7648D0E86
+4A3447A8FA9205130BF44DD0D1DB6A43F271ED64F843C57A8DF67E5726DB54F3
+CF2F8394F9F455AFFD94CC6E3B18A6C1DF83307A895A9D3851890A3EB85A5C73
+E39E649E6D0738B002015E948BC9D3E81E0F2A7EC77A9522BCA907DC49BA0476
+D4B28D703B01FC3DF868A43573E40A14CF5444F40D791864040BF93E8A833DCA
+5B11755ACD60461A7C35912BD1EF642351EFB0CCF7A01E5D098CADF9DCF1FA1F
+2CBCC58A195623FFE609F960E2FF4C2FCC4CFDCF4FD44CB8DB4EDFAE1F434782
+8FDE64AFB108778C26510298B8BDB827A48369DDB1FE6D068E4186630DD3476F
+33A4F0A0CC03BFE20C0D44DAFB33812F72CACFE57F7D7397CA7B828CFAEE178E
+534BAC86E6BF32230B2EB52579B1AB2EC4DB9AA29457C7346781685C94A1BB31
+041F3F35BDE6D5D747BD80725022599401EB5952800224CD845F48DB6A9BC9C8
+DC3AB86A6AA03CDB7BDC009E0136939EF423E52C52C5B62783DD53F4937AECEE
+9805003FD70BA4734E9DC3281E348715F5F39EC0360791B527973567B16CBA96
+DEDA5A6F89033CEE83E8C2E41D094866A6FB94D644DB5C97A32E25012E72606E
+8E8006DC92D360114ABA1288CBCC170AD24056FB70E033AB4EC308C5D8E41690
+37F8F672809F9C0C017184EE268BB9A9BB443B99A639A5A06662CCFA6BD03494
+FFF1503041FAD3B8DE74AEB70F61D988D161B929632E63B6C436476B066F2B71
+3C062AD25523654C8895428562C2FD70E46CDE9F30578BBC618E0F9F2754B13E
+46657A87D386E73842035B9F70A6AED1DB92F34E981009E22FE7973EBA89F81E
+B9F3FF9A6C819780B5A89F3F98E1107C55DE2361E33B05CCE5AA739E916AB4ED
+00F273E0B228750A03C58784A1D97610EF3857394729C6180EEDE72DA31EA5C0
+29F0C8C5673FC722F3BDEB806F9063C581BF88551F0A816723E98478AE80380D
+097DCBFA53D9E53569614427911851A269030F7B4E63D040998533075492215D
+32198168D739350BB3C453D1E618E83943D66AE963A5202F62A5ECD6CF74A60E
+D905A03EF234D7B56EB7E1D857841071203BC11A85E9B222EAF62719437A1A9D
+09146C9A2EA1EAE5BE5F8E9643EA120ED16F85415933EEE83DFC75FB8129A4E8
+EAC55CAA4F630C7728F95C1391964D97960A8298DF67C183493B38D2FFC06AD5
+3E7CF59ED497058F9E01D06AB9EF84BB4A2C368EF982F2883E4E324A969AB97D
+0F2A32F6E86D96D155494E9F9482FD128E16C94902A49BA9B047865DC85FB3B5
+05875071DD0298FE887A74F2F622FC87E4D10074F85C17E2D19F538634CE6974
+DAFC8A08CA9DCA525F3677392265A18D82FB9E2A1C8C78DA68DA13F8A187DDCD
+DC77B2B314CF8B8AF537D9AC3EBE008A13D00FBA34E96DE969946780D62F66C1
+AB172B6013950EC568F37AADBAB88F29016870C861B63D4266D9735066269ECB
+7F088B5A5CBB1D12427CD76FB24D88DC87CBC04D36E2DFD107428071BADBAF38
+DFF598ED58562072E11791CB1D36AB73656FB3237CC75CFF445A232E6A7186AE
+DF4A0A16C00C52DFF356D19EF7CF1E0E8800FF15CB79EA941191A2501057E3C6
+8745727F01A95F81638A5375905921266C6C3A164027BF210908EC09D87487B1
+7113791CF44938981C5E7304FDDFE18ECD600F55353F42C4EE76E556C7495EB9
+80DB8647822D02C27E650EFAD3B8AE6E1495761190BAB6105A7F13F1A510CA3F
+1CEEBCA69D3330FDFF77E565C58DFFC962E3B1566FED6CF48110607AFDECEB1E
+4A4CD54E901A2BE4047D31EC7040D4268CE88FFE9EB28B573213776816243FDC
+23D3712CF0293B8138953616217A113A61F52DA6DE6D607F23413B2CDF1FE0A4
+1E424EECF2E07479885795FE33DBE12DA392EF27E536BD694AFC0B9B7C1E713B
+2F4819858DA07E020A8BDDD26ACD7BBCC996A1A4B101ED1CA09F699D267506F7
+381C2D8FBE97BC15B09B742AE53C1F5D496AC831D17883C4C09843F6D9877369
+D57A5713897E8067FC12E3026E4082B01E509131BE4FF201C8AC2129DB74D394
+85433E8483D1BD14587655A98B5AE8EAF98183F9F28A3587E61F3C03D52BBB54
+7E3A50A4FEBC39E9C6AA3294187945E18DB4EDB2349C66CD6874D92CDC973EEC
+D551F863BED3ABB1A048C32311966A65EDDCB80C98778111BE299FE47F6D44E8
+541A908D01E2A413947291D13C3ECA7E512898D59536A1C57DF2709EC86670B1
+5F48A7E8F83C523F361C773F166BC4278B0720263668ED2E19332954BE3E3CD7
+6E114370E19EDB1CD2E9CB7A78059E681D6C04633D392CEF0BB2FE888254CAEC
+A08883ED913E026A8C95D63C6BF61E294ADA8EEF47443D63FE6C476B10888115
+9A6594AAA3BB7181207C4F932C2D14517ABBBF7E18C45582B98CF244BB34927C
+247F563D02F8F143E61A3C7EC1FF72A63A64624DBD82DBBCDD55858CA5E73341
+E476F6D8A6E1C329B0B741BB3E6F3DA7F8FF984D9F0BDA57BE282DEBE5A2804B
+E8305BC3932C90FE37341AC605C2C87F700FCCD03629E287B72A8DC3B179FB9E
+9AC3896C8D4A49D118D30B0391D7540CC380583094D6872240056CE0F1DBE044
+2AF63E9819447BE51FEA8AC137B16576780AF133516459DA66A9C09E8C0EFB1C
+7C7363895940EC8993CE212585F9E2051520D3E8ADD603B4A64FDFE34AD1A9FA
+B63881D6CAF62BA43B3C1F9FA4AC121DDA29BC9A63BD861E0AFBBCDB1C2D0C86
+DAEAC246A1C140C9CCAE2E71E4BA218E8A7B84D4A10E9DB725B9A2FA9A51C0ED
+1EE07088AC898C626D7541BCC0961DBD51881830AD90EB4DD27AC661FBF63382
+1E3DC9E2B90684610183F973281A36B2A415AE387CB7DE657FA971103C9DFA92
+E60DA6BAD348882F99995AF6451ADF1A515419D525E4A165C370182885C15B33
+A6A9CF8E575E0DDD0A768C1067D40775AF2EB7EF5FF9B8FF4601E137091D247E
+67C3FB90D003E70FA0C4BD0F9DDAF2842FFA83ED06C4266CFEA773B4555041CA
+8D5199216B991C964F1D5DA940A1F0F100C159E2549500747FEA85CFC878C533
+A67592AE43F639818F427A520A065447CBD8382E9B5A63A0000F820D506EDF57
+9E066C1F29419A37AB576EAFD0E6FF8DD68C157CC66BA3AEDA626B55CB310EEF
+43DDC55BE9ADD35E61EB424297C1B76EBC1567F3D4F06414101E9D9906EA538E
+170D4F8166C8429D4BA3B5A16CAEEA69E0BB9AD7D669CFAE3989E0EF7798FD76
+5F92FA4ABD0EFCB549632DAC66393B624B81103E0153DE8ABB2552BD7E2584B6
+19839372C5F6C6B39367D2CD802488F51B9CBBCE9F0BAAA8EA7BEFF22436D81E
+CCDF912D9FCA13419F46F3D95F291EF2074F22EBD429BD701C1B6A79751FAEB5
+57CB0378770DA726E6244A79DA800DB760EDBFC42EFED09E31586FC9A320C361
+0E055C19A9CC2B345EEF37DC133B2A695FAA487215DA7AA66CD4A490F38B3BBB
+87E468F0306CC5A5ABDC9CECB06A9BD23C3E935AA385D7F3FF2029F4B55DFF53
+71BE63422B0DCB0281EE3E2B5B8A3D8D70BCDD3CB1F6FDBF3BFEC9F77F4CE26B
+E722F0620C6176F889BBB70CAFECABFEA66B11D04611CA4070B5B84E738DCB7A
+4CEDB96470DA40A77B2455160E9B6FD1C9CE78F055E21EAE828086839609548F
+FBF0ED14222080AFF5A8B0B032247B70D4115C9DCC8C6B2BC93B7507F769EB9E
+AB025EBC493646CF5C85DFCA353870D495D7890861BE50376E5EE3367FDDFD79
+6A6BB1374EA89D97082799AC7D5D294A8B7A5CFA8694CD478305A7AC6536ED76
+3CCEEF1623A4F5A4ADA29ACABFAF8DF413966EC462132409F498CD0FDA999129
+807016B61B9A78FF002757728C37E2BEC98AE3A4168E812F94F05A2546EA6CEC
+6EAC17993BB7D5F5983ECB4C0EE5DF6FF638B29A7ABE6249AD346840EE520BFC
+53C11A5E50DC77CD071DF530804BD58E84390D4A638559E4E08E09AB34A46D17
+9337EA42A531655C0EB29EC07F1D7B4E55D31CEBA6A3DE5E1DFBF21F45B63068
+E18717158E799D7E2ABF88002FE9FA956AB2999BDCDACF2C5BC9E9114F3F5506
+0C45C775980E89C69D9F57E4C97BE28342E0860F99D043C443B02AEC59AEB684
+E865AA7DEDD0429AEA9D217D6A7957D0FE251495C60BA34DB63A84FF476255AD
+094E10752E2E7DA61A4FAE2E893F6130FFFE6B00CD97299E9E8508390A45E208
+55CE876F3D12B99DEF5C0B2863CEB16FEFC4426E577D7BE8E0C1C5C16D0E6E79
+5A5301DE570C7AF0CB3032BF24F609E9580C11DD664D35C6720E12A85EEA2A5A
+D2D1F792FB0E192CB64C0375666E652A0DF37CDDC1667C15D8D19DBFAA108A55
+CE347F664B8FAD71D9804651D004497197AB7259CE7625A0F5357D5A30661DC0
+3827A40128E413E726ACBD338037470F1AD612BAF9E0A065CE003AA128A75268
+66E1E5C19600C0B0DD753333E654E69CC8F59327A2D98D12642F29164C62CBDE
+4B2C78CA1356F00A18885F5C33962D27B70B44CD4F284AD287C8B783F6D6C133
+2AFE908F427F43B29E589118A4FF67799C1ACF93136B1A474541047713987767
+939E42CA51B282E148D08247442BCCC3959959ADCC344E2A3C6F0D1C565B4228
+E0ED4FEF48669F677F3BEE92A0969395901BA3A3431ABDA4B569AD5A0FC47F79
+9F37C2551DFA2491908F2F0D08012870C979408262A3E04F11E55E5F8FEE4664
+E6AB9F0BE650546A40D8C706D7B0C1A50B663BE893406184C53B4DB82D7F75DF
+7133C73AE2146E274E5519D305979A1B9964DD329B2B9C3E6844F830BAFA5C92
+AE307E3B7A6BE3F5CB0A2FE046F2358465DB614BE8C9E552DF34AD19A1433727
+6200441757D02371431092B185206357E42E494C47646668C60AB5B1E748547E
+1493ED3B9B406DC87049F86B4C3E9650B806462ECD9390FC61153915B752E3B7
+F802503C3AEC3665D66BDB463AD5A7F2C536DE50163EA2C247B137FA1259F299
+B93DF2590030FBFD746C91A71D941F1B97A60E995B90B7FCBCD9FE33BA6C23F7
+DB26A3B513887AF984BE07421F2B83F9990086CA79F03649CD847CD1721DEF36
+1BE45E90CA6DFA4781B2D1CDC8C9953486245E72F4F8EE96BC7026B43D4B1608
+B5C214E58EBD8FCCB36A09BDFDE3D9BD1888884198F85BC094630B3A9C88D01F
+C51E1ABBCEB5ED053C7AE01ABAD72E10F8D3314C0F875CDC4A4759D350ACE7BA
+5B2D0BF3083EAEB8AC1B686A34F3F69656FC2F5A843F38CA0CEF43DBC17C70BB
+D950B7BF601A464FDF76331B5B81A6D66B43888E8FC1F99020387349E981FC79
+3672B73289BBC02EB700F2E10DBC9E8AAB2840E0F603B9B6D267D455881F3E7E
+420D3AB18E32ECFFFCB317DB9219A482E66D5423FCC0F49E87DE82A5F1BB4230
+1F4260C1548C478A6EEB852356C90136A24A5E810806447AF315279961661D54
+FC5FDE675B61E36EE1D434337DEF088948E9DBD443BE1AD75CA415D092E2EB42
+BEDBA83E6EEC08CF2D171A8429082B2A49AFEF38CCD6957713FB365A2E99848A
+7E300742AF41D40CE6C7BD4F8CA89E8898A423660E8B379CC2DBB95621253695
+1EB3E9D93B457D654DAEF414D7B40FB28B320E88FD4938DAEFC0194761F60321
+AFAA5E85800383C05504D698C054AE66B3F571A15A5841656E75891601DF743D
+C27EEA8BC2B172602359541598C16083D19EDA2E1C7038E1E92C4AA0878B6A73
+7586CFC0416DFDA05FBCC45D7A2229480A374B82342FAA32CF348068B75F3E95
+77BC891DB6D770B5FA468E8291DAA85E5DD5E0A133ABA10609ACCCE9B91C93D2
+97C114B33B3A2332FE8ADC747C0A38DC58B61BE89B7BD41EDFA42994AC6B2BE3
+2567A524ED9BC2A0E92866A4BD1952B1A4611DFF8C9743F04D3E3EDCBC8DC10E
+47C0380AAA4EE0F969096DF2A5DFB6030F319DA8B0FC83712FDAD000999B4373
+198F8A07BB714F2840EA0D18F568698842829E6F38744115C65B877420B30842
+A5AF4AA800367FCBDDB8B36B955A9D012FE1D200C6FDD0CF776FF67FDFAC3B0B
+FD0E77FF4D4D07695C4D110A6220D199C614DE78C29C29346B245DD9AA9CFDF0
+1D438176663F481C16265A0C4FD04AE72B4D7C6E727CB3A3F9BC6414E3AE38C0
+CF8C668F94F7D75707AAE13A451E48DBEEFB00546AADE666D782EA01CFEB046C
+DB2144EBF821AB996447F3F461CF8B28B47119412C61B7D0540D8381544DFFE4
+EFAD4C7B51EE4CA0E11EC9E6AB03286E7734D890EBA2BEDDD20D60B3B4AB0E09
+E0F408A6DBDF764AB41596D234B523E8F3517CAD24A3174D679961D7A3BAC907
+30A09A44F75D23F013F37578141BC42D3F06368807900222FD73B72CF2CE12E0
+F5798A0067775AFDC6040FB2D730E1F8C925F88CD6A1337295BD5E58CC7405F9
+DEEBCEB5027954F8A58D4A97F4417AEA9A83637D36A12D111AF57A4F415D8429
+256F397B84C8D67FB2FD8922252A8B9C7292FDA3F011C1A8A901597E781444FD
+E4BD85FA5A0FD769FE7C2A3D96391385E4D67AC5E08C7D11ED0AE73A848AB130
+8F860BF92396C652C3758EB67B5A413438D7532C148AF5B986BCB13B0D2BB330
+5015EFA9F5914612A6814BFC48D258478D61B3F22D76E5816B657A246245BB87
+FE56A88D3D5E00B10C4CE26726F63A5E8279903278EFD93EDAA5A036784BD5C2
+F3C3A4A908D537FC50993057B80F536F767E864E29ED3C6FB9EB287ACCD36E98
+41AE061600D39B59A980A03FBCAAF4AF1A1235E264A31F6DF8C6DCA7DCDFB8CD
+44582779D5C2372C8A56EDF485CD9CA922F0E0E08DA6FF22FD5E252CA3E0AD59
+E298BF57554A83F647EB50A8E490D4460FC8F89A2858639F6AD82EE0670138E7
+B60558DE029E959AB616DEAE0C508112D8F78E48E77B5AFB13D3D3C599F598F9
+BF2DBB3E6FD8271D0F2D8F345B4515D49A1F7C25E299DE5E7D098A4DF2AA3EFE
+21BEC59E0A6AEC189E1E2455E3279FDCE1F0E1995CFB48CECDA42DE3F998E6DC
+5BDA7DBE78A280A72CA6DAE2B2CE48B1E5AD372AA627F786587543654EAA6C41
+AD324E6F1477838EFD9F2DE67EEF905C280BDFA85C15E18D9EE60E8C7F9168D7
+48AB8C946CEDC8F1EE932C38E546AD6A1734DD7332BF0BCDD3535566B5EEBC39
+1D5479B0D1EDBE1C97FF54A5AAAC8435E9C02239D7FBC6A2DBAF5AE75C101889
+8B3FE7CA596FE990EFC3EDEB32F3A444632424C34B9B233844DE2B5773839E7F
+E27DF63C664470AF8ACB24FFFE72148ED6EAA65327A53088711F058458A445E9
+B4DF39BEADC72B9ECD73C4934772CE62737FB7A50361A0F7B179BB303A0ED6ED
+A515FB2EE389D41DBBF0EF2C8857D80AEC3EE8A8AECD32E9B83BD9E609FF2AD6
+C2883318236BAE78FA6B06A3186C22C557A020F1C7EAC41374E4A24F6DBF2656
+366B49251B1EF2E8EFA837B7A97C4FF1F3B7BF05BD89C0F69CD9CFF0CC2DA394
+380003F71603D59B1D574F2D3CEDFB6E8FDE397320F1F0E5DADA15DB4A89627A
+1725EB1E12F44962DE7014FAE0FFC10EDE96C083D4D97A817C300D604C95E147
+F2B238462E38EA6D7A3D9E6E2B29493ADC7C16DC069D7A6E29CA2FD193410D12
+18199FC35B4A03C5079BF155A216EA17B01FBCD67D30F07F416C390A107D47B6
+1292D3E9640A7BA34D15CAACBA2CF0439CB0235FA8984523693ACE97ADA700F6
+FD64D6EB667168B4118B62225C761A282A60B5DFF28E23FE6F183D1A7D38C42E
+6E6E7FC4DFC9961EA47A06C7584D78B4E61DF8CCB4319C2CB91A09AC67BA7C8D
+F501034B9395F1502C07058E796A11D27369E1C61B40F86C2EB36D13C1FA8D95
+BAFB934FFB995E982388B2B45C082C29F8BC588BFB82B932E33B837D879C1CEE
+49095A80CDC4DF051FAA4A1ECB2E9473D4F1BCB6F7A7ED8769A3F5924FB9AA53
+3DFC9CA131C3D904F42CDDC96C767972565BE17C4415A4C77A182CFC2F7FBDB3
+91E3B051F6CB7BC200F603FCD1FC6A7BFC469A3E13F837D457C2062CFAF35CC6
+B1F2F57CF2BD623F2647967E7CAE1DC09DF0C35BE0BA229C027F8D22EC50BBDD
+B27F83E4650070610C6DAF87ECFF2473282B127C5AAA485E16B2476E466BDECE
+9EF8FDA294AC5B4F3510A4288B1AE7695B602BD8C482558A31F89CC270467EB0
+16FA7D764374DCE65583BF0892D1BCB040E5ED9DA8A300CDDB0FCE0C82BB7237
+5567DBA975514662C90E882B58C0C3E1CFBB3FC5780928A1B977E9EAFD15B3AB
+EBCB095870D50F80DFEE0E43DE94AF4D229B8B458345A945AA133A0EDC5F1ABF
+3C3F782EC26264E8887A3B438AE768214573D72C11A5CB432C67718F1E468FBB
+F3BAB85A0FC12BA633ECD4A25ECF221394DD4416BC2C0F90B756D7FB6D5ACF03
+D6B5E0336DDFE2C4C9286F9ACB953E506B6A2B1F015C35B7E750EA5794576C0A
+BA9DFD2074C5C093071BD8332B55A49AE1B938EF4ADC03765F51B41A0892783C
+63EC9D221C4CF30F62FD0E09B6E6F654F21816DB6AE4A82616B348FD64E8A392
+71F56CAD1CB207FE9BD16A8D26C629A9EDFECE6683ABFF9AD43EA9A64421C6FE
+7BD4F0BF49DEA0B327A3CC61375989F57157AC3FBA94A49DF972827B517FFF71
+050FE2B4DE00390B19152477359F08A79AE9BAB51D73719F0F44F2E50F60C21A
+C89DDAB195AA1AEB900829189A00573D6905B62B7DE59BC32E61600D25E8A77D
+9389206175AA070D0EE7B0308AC74CB5279570315EDD68767333E4321DC893D8
+1E768D37ED63B08D518EF1269E4F0C194E4B0BDB7F5EA0D5A9E421DFEFCBCDBC
+5F20CC58C69FD623752CD94EBC1A94E6D9D76DD7567B83526C426AF62165F2A5
+FF77A4A62E74B331F500CB4C133310EB822A8168BFB56BB9D14B1B68B397DD23
+EC5E17D46680EC92BEE91F0AA0571BD8A446591E50DF99A1A50EF6EC9E267DCE
+ADB0F389ECCD8AE143D0413470141F54EFF7E0BF7D49E84116D4E8B63E8A65B5
+78796DB1711181C24153FC46138DC6E1A31F9A390CFE7624F82F206C82DDB246
+F1C61116F12EE53845D7D930A14EFA505CA78CA4318B72B8973C991DCB1D79DD
+C4D274930D7E167D534CA562CEF0EB4BDA8481B318E43E70C465AA31EEFBC688
+55B54514713434DEEC4B75C123CC828B03B0879CAF9DC60BB6235F6D1144DFA6
+81BC13107AAC6FF032647460EDC29C17542F91F5C480179EE574B9212BC9D9E0
+122C764BAFA6D2C487BE84228F7D4683655930A9D0834A01EC494E2FAA7E5E27
+36541E54DD25A240BE24161C31281DBA5F2DBBD2E46F0F64EAA0A98E5B6F0CA7
+6F8E468A2AB20165BA1DFB29DBE6D2E1B8A7C4B266F75EB10AC991157FB81283
+B3D49421F32B049CA098AD48EDCD0E98A1B649E981C6F1AFE8E8FE0F98EBA82E
+F7072CE5475F7C9AF48D81A3E45C4DC08CF5BDA01D66B6A4A4B7366C8CE0FDAA
+4D4A582EFEDA587DA5B7B988C7BBFC1D2EA88E01C7DAE7CA803CD20CAD574113
+4F776AAA5903EF250AF4AE38476CA768F04ABE2BA6566DF34E8AA023D3D48FAB
+DABB918F79263FCDF3A1F5E40246B1549C5C4862BD0CD8C268CE85AC85BF3CD7
+65F9ADDB8039332AFA4058AA7A6771AAE4ED982D5CC6122C7AB3FC8E85F9BB18
+25A097E5AF7E67F603D118B437023F972BFFF2D7522132A995BDE3255201C634
+BAED26DA6E0127ED1AEDA9438B896E62388260F2BF11E06A06A9D591C97BB52D
+904144EC22A9362BA3D8FB7B7B93F8A1093F1A5799FD48953AE33A2970F64A39
+5B3C61EE064CAB785D0C5B3C2DD58015FFED2DC34A514652741E637D09CEA9D6
+E25783050263C7B807E21E8ABAC08A76F001B30A68084B9A5805BBB63F2B9BED
+4BF5D1044470FFB942EE6B00894BD9093CB8A7045618B312B4DAF77649B97D2D
+C6DA35D7239C8B3E46AB3761EBC472ADB8738E73900A980C425291FA4078BE9C
+0B606191477FA5604D1C923CD5F267D0CF0F49973D4E9324907E99A3BADB6053
+D75C51A3C397256184BA56E4764F191FBADB608E443FCAAABC89C0189709C958
+09F61E163AD9DD26850E35CBDC8F325CB920C281F42525B55E6B1E89A1051EF5
+B86F07D665D05B1B239D682170F06DE1DE1616602699AF63EFEC311BD26AEF46
+F3FA0AC2F6A76C364B4F36E5E0E9D534C1F33ADD2B68A3FB4D183A91685E6D91
+7CD8C70C0BFAFCE4ADCA7393773C9F1AD62558E9795EAF41493D47339C298FC0
+AEAD6D3D95F1E96239C7E972526E14FA04E3D677D43A6F272094A5EC431810D3
+BCFD698C37A2EE541E85C1A738F0BE7DF77A7BC58DA1B4E090418B260C559582
+71B0407E525D537E32D446C13CEED2C7167DACAEC308B0D5C724339EC4306C24
+3ED2CE312D02F74C7FA693A563E6A14749DA49ADC82F9A00B32490C54EBF3826
+4A636B7138E6FAC49FDA5D45A921174E0D57B8B5A8AD9C83C39947A4B6CB8356
+3435AA9B10221304174EA2E7AC0B2440945AD3B21542CAC6C21D75F80D83A718
+10D87B880D2028F089C8F66CFE3F8CDF1E38C6F9F0ED728F5DFDC34BE2A67F3F
+038493C2FEEB850A2C149C886FAF3DE7E3688DE55C970FC7B113D26AD2284552
+7708B57AA4B6EE88BDB90B4D7A55CA83C368C869B4D4FDED35A5750B7BAD5182
+281EDE484B172386E95496FEC79D65EFC458E6DD5E3D40DF87F929DF982776A8
+A128DFC28E904B72488B59A2B997F2E526E62B43A75AB0E3AA4003CBF1874498
+5696DA2B12D7350F3512EA4228DB5D75AF678C4ACFD30E243E6E2CBD801FF50B
+BBDCEF38D8E155A171ADFC52365C853DA3D06507F19F8F9DAEAA2A923DE37860
+BC6ED4106EC1B2E60CA6DCAE9AF3C600F4E1C7EDF86F467671838136260B213C
+8DB0047B755D35D7BFEE78DCC9F2DB56B1E020ABAA9D38D5A86C85B1364B7781
+964E7D066E0D5570736FC4016DCEF883FFA1DCDDE5BF338CFF7C197D9B3C7CDC
+D053A142A4013BFCADA5E2576A437FF145F149E9E056A95EA95AD80B93544E8F
+E5CD9C2153D99DCDA0BB7005ADFC7C5EE4692DD41725262836A6
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+cleartomark
+%%EndFont 
+%%BeginFont: CMR12
+%!PS-AdobeFont-1.1: CMR12 1.0
+%%CreationDate: 1991 Aug 20 16:38:05
+% Copyright (C) 1997 American Mathematical Society. All Rights Reserved.
+11 dict begin
+/FontInfo 7 dict dup begin
+/version (1.0) readonly def
+/Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def
+/FullName (CMR12) readonly def
+/FamilyName (Computer Modern) readonly def
+/Weight (Medium) readonly def
+/ItalicAngle 0 def
+/isFixedPitch false def
+end readonly def
+/FontName /CMR12 def
+/PaintType 0 def
+/FontType 1 def
+/FontMatrix [0.001 0 0 0.001 0 0] readonly def
+/Encoding 256 array
+0 1 255 {1 index exch /.notdef put} for
+dup 44 /comma put
+dup 45 /hyphen put
+dup 48 /zero put
+dup 49 /one put
+dup 50 /two put
+dup 57 /nine put
+dup 65 /A put
+dup 66 /B put
+dup 70 /F put
+dup 78 /N put
+dup 99 /c put
+dup 101 /e put
+dup 105 /i put
+dup 108 /l put
+dup 110 /n put
+dup 111 /o put
+dup 112 /p put
+dup 114 /r put
+dup 116 /t put
+dup 118 /v put
+readonly def
+/FontBBox{-34 -251 988 750}readonly def
+currentdict end
+currentfile eexec
+D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891
+016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171
+9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F
+D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758
+469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8
+2BDBF16FBC7512FAA308A093FE5CF4E9D2405B169CD5365D6ECED5D768D66D6C
+68618B8C482B341F8CA38E9BB9BAFCFAAD9C2F3FD033B62690986ED43D9C9361
+3645B82392D5CAE11A7CB49D7E2E82DCD485CBA04C77322EB2E6A79D73DC194E
+59C120A2DABB9BF72E2CF256DD6EB54EECBA588101ABD933B57CE8A3A0D16B28
+51D7494F73096DF53BDC66BBF896B587DF9643317D5F610CD9088F9849126F23
+DDE030F7B277DD99055C8B119CAE9C99158AC4E150CDFC2C66ED92EBB4CC092A
+AA078CE16247A1335AD332DAA950D20395A7384C33FF72EAA31A5B89766E635F
+45C4C068AD7EE867398F0381B07CB94D29FF097D59FF9961D195A948E3D87C31
+821E9295A56D21875B41988F7A16A1587050C3C71B4E4355BB37F255D6B237CE
+96F25467F70FA19E0F85785FF49068949CCC79F2F8AE57D5F79BB9C5CF5EED5D
+9857B9967D9B96CDCF73D5D65FF75AFABB66734018BAE264597220C89FD17379
+26764A9302D078B4EB0E29178C878FD61007EEA2DDB119AE88C57ECFEF4B71E4
+140A34951DDC3568A84CC92371A789021A103A1A347050FDA6ECF7903F67D213
+1D0C7C474A9053866E9C88E65E6932BA87A73686EAB0019389F84D159809C498
+1E7A30ED942EB211B00DBFF5BCC720F4E276C3339B31B6EABBB078430E6A09BB
+377D3061A20B1EB98796B8607EECBC699445EAA866C38E02DF59F5EDD378303A
+0733B90E7835C0AAF32BA04F1566D8161EA89CD4D14DDB953F8B910BFC8A7F03
+5020F55EF8FC2640ADADA156F6CF8F2EB6610F7EE8874A26CBE7CD154469B9F4
+ED76886B3FB679FFDEB59BB6C55AF7087BA48B75EE2FB374B19BCC421A963E15
+FE05ECAAF9EECDF4B2715010A320102E6F8CCAA342FA11532671CD8AB8FF325A
+62FC5DD3D91489C6571ABED041CC780CB6241753491E8ED99CE05D849D27734D
+705B556C1BA9394AD8E73330971B2B071E890359BCCEF830044969471431BD61
+A150893A6E4DF6B78DC4B6E73FA7A3E4327434A0D66281F5976E6F58BC2F7013
+ED318D38A606EFE49E9D1DA564BB271E8B02A62962FD782636A65D1361339F44
+A9FCC00796F580E5DDED76C0F22A334AC01F9AF7111D8B8E528D7D4C0A04065E
+A093C7835D8527F43BB8FF494031643BC51C53FB23D3CEDD27853928843A44E6
+109EA97EB5DBAF714AF06F71DB647E1E149B49B9CE6370CB5D4F9D26FE44B9DA
+575CD6FB7FEF3B3A6AB64D1AFA19116236A04AB1B3565028E0C2C18ACC75746E
+2B31C68B69E8D25C8C8F1E3B3545BB75F0C2099973B39D5C33FD6B913340C86B
+2CF669A801BB042A32A7FC301D93BB5F9F7792F64B7478634D65F87A6EE830F5
+C0012FFFA0D9E4CDE77D123883960B404B2C76401CCCB0AF8D84E10AFAE7C062
+F90598958119AEF48E6BD05CB23B2A00DB63711CB5B582F4538E75FA6AE72853
+4607BDF3629D0D40B10F8973DF7439BC334D8CB034A42B826205E83F059DB6F2
+CFC1B67E61C5D75A5AD220DBD353B366C790139D5633571F3C33DD97A4F58D35
+36DCE94FAB6FFAD2324DBA28E3E98734D27B9229017E5D48D601BA45212284EA
+90602CC59FD134EEC8E20E4CAC6B4DEC344FC4FC2D2DDD5A0A88029F26757B05
+1731D35B4E85D88F28709A90EFCB8673638883B9DD573D0C3BAE083AA9B732EB
+A3FA84B661B74D439CCD8F9AFE9BC98B8E142074C287F5FFF5656EE3ECE570BE
+8371A407B24FEF12C8A340D6AFFA05929E34D9EE813235F3CCA305CE585B1977
+6B45F4317D4503564423F19BFF878732FFDC0D0B23ACD0173D3941CBFAFE8410
+76B67E32E2E3EAA87C8D207941197F59F5F0F7E34731809506FA1AFBE20E98FB
+4FE068E2E2D36DF6B0961557EA07D5834FE6971CCE80E969EEF048FF5CDC754E
+2067F7CF225E00B866D4BE95862AD4ED147AE432D59F2BA57027F538AE32E56C
+0EDEA2E62E5F942F9108027D1F214FE3E987820B1EA3D35941C3D9AC3465DFB7
+537688DA96500145E7A7B0C3F9F74C3AD20FD3AC5B18DA9C48D935951A8D17FA
+50EF2495C7B294C5BA0BF1E2678C1362E8AEDE53B6E251BF2D30771125B2CB75
+AAE5D292142CF146D4873AAC5D8996D4B63680D2C6358B25D22E894C64CCAAD6
+C149D61389F1FD7B0F0EF7B113D380DAC4E97F59090F813890254DF063D7C57F
+04FB9B1924AC2E5D6CF812C2A6AC981340DC5CE2E89A18DC07D3F5FE23CBB7C5
+1F8EFB2F5306512BEA1F964D0EFD2F13D59D499F0AF95BC12D06BB81A4D416F8
+4D0869D361C37D1AD7F6B61198A575D7D998AC5C9E39FEF7F5C88FBD1187B59F
+1CCD417EB37751E900FB5547452D9A97AD17112C3C074C869F3A1B13F064F4C9
+B234F9094D75F49586F2E97319A9B7B16D7D4405BD80D740545B745ECF08C3BB
+3C423CAA3A528B40E76E64EF6F99995EAC427FA3E54F488F27E46F85EDC02193
+5FA23AFF80B091C5FA9AD585303622258DCE3D3B1826B66C4F1BABEAA47F91EA
+476EFAB9A828B295BB2FE111B9B4BFC9DBD102D2542B46EF2B24A285DAB53E54
+A18EB6BBBBA76D7AC3BE3CDF74498F2FE8BDF092BF5142FDAA6E9014A2C86FF9
+5E451D133029002B89C385A84741529EA886B054602474F6EE6976A9BFAAA841
+70BF90802400FF563B1DDE1890239E271F41A953C817E27FB2B6F8EEF2073A95
+F6213A492E8D2750601F39F4CB632D2F61BE1FAB15EB36194A772685609E8FDA
+B517BB13E7FD5AE95F50986A0596D5D609CCE6AA6255C5C86510128AB85AF55A
+1740434CB21DF3F3EA9A347EDC766DA4D7872F241F9D5C3792CE65583B4FCF1E
+91D41D3F8A1DCA257A8186334A518FCA11A797A76EDB21520D08B7894ACFE745
+BF48C26986E3ED1A351D79FB7CA2C759E7C11A991B4872E5E2A4342A8F70AE8F
+178A8896F50D7B92C0E64532CD68FB5236307D20B89361BD72CF00BE54BE27BD
+45F7A0DA1F240AF8266ABA4DC04F315B4107700240C009C9A0E81040F43BD1DD
+C4F3DBA4E8C68B1AD6DDC4D79663BA403EA12B6455FE400534D8C58F4748B865
+F4D2E92D068EAF1089053ED1F38C92DFCD9210638BCCAE58F5E5E824E03146B5
+9B41901164522696923C1B61DDF0BD5CB5D8CFDF3ECE4B9369190670BA96B6F1
+9090518827C890D785C9AB74B85B9A14F2153E922EA439E5F29A63FF1F6E9A47
+995E3235307D95A433245CFAB577B6AE35AFAAB38DBB93D9DF8C55D543ABE869
+0EB49E7E48779DE30B351D4E0F6D7BF38023B77D5600D60ED462385BFEFE83FD
+1549687588BDF1973AFC96C5C1DE61F1218A01989DBA8053A3CDD3B9DA778F7B
+576707B3D829F084AC4BD0414953703D0B4A1E5A7BC6A476497FA0A9137CD31F
+EE96C16CAF25FB3C20738A21984EBE7CA917730E63AEAFEFFEDCF0E2C6D089AE
+0690A0E0321B5C891C0DEFB26864470059761F0421B30C28406FB1A728231027
+B6618C93E1C2BEF2A8C972BE9749455A6FCF0C1B0F2B3ADB0F51E57D4178883C
+3C8006F97B62D6EADF82C9D14F2EDC92E855D25B9A32FF71A60692ACA0B39816
+E3FAD7405273408897C6314B477AB13E63113055CA87DB5FD7C09593BE7F1632
+F48F39BDBB6D250F2E20AE2D1C5DA611A3EF983C9C02BF63A0434DBF51D23686
+9963A7E50C0298326A00DE971D8DC6AB847FC4AF6B37F7FCBDB123637FF302D3
+5A94AA2916F0EAFC8E0376E2E99428791D66BE2FD1D26CDB80A8ABE9E1E3A2CB
+A1421712BBEA766564E907CC7B848232B5D08EDB66DC6C46D1C37417658CB754
+7D87A722957D6EF26FE08E1B7D94EEF6381B17F3952145F527FA863B4CC101FB
+0B42E4F5E0DCCEB42E0082047C2A5F242E4E6EE62FE29662ACC6A26DC15C55A0
+9191734B84E135C34C5D96E902E3E52F0F992B0AC615033062B4AF58BF46FA63
+DFB1054A78AAF62DAC6036412E2DA44040936DFED4453040E0D11F43E4FA7139
+7965AE2A92473242A9390BCBE3F788D03BC9E0952BE288B5026E5990E2A8A389
+562393B14624CA2E569CE0440B42E5B9632A392FA3158F579BCCF31602DDB9B2
+098A609F3B335D12A41D3F07A73A28E0C40A30AC2578A6199A4DDDFDDB5ED2A7
+D3DCE38E22C8A90A2A59A73A291C9C676075B600C31E019067F5BDA7A645BA32
+4E68868FBBCF62EE47E87DAB37C8EB6E8A86B012096E95FB4F37D78C4BDD1624
+3782DE79863137F7B979F372A3A842FDFC054373724EF69A5E78E6FAFFD107DD
+6427B846969F0B2DFF5BE4304AC64BF4D7317170F9F41B938FA9177F6FD90319
+D440BD5B3361C76D13AE5BA48CE1329173BCBD824E7BB361A688D4487E4A6578
+618734621CF8CD4FB20CF160B120F5009E3C74163FF412B0B44AD44326312CE4
+502806C519C7DB142AC8E9CD1C35932B95E0898485A8737173CCD10BB8DB4352
+7D9A909018C2EDDCDF0CE7CD42CB2EE40A28911756B0987B0228FC0C0160B9E0
+FA55B14A9C3F149CD64F922543B7E272D377CA6D59B888695A2FDDC157838F64
+E0B66036DE41244B0F5DF99BFF70AA7094A6BCE02AE211761E63ABB52C98912C
+99829FFEA7F1CFEBC1DABBB581FEC6AED85B4495F754EBC800C66441E668C587
+FA5DF393F961497E9A08305C5D10A13F114379B2DF361B136C299D3AF21C2DC5
+389DEB80C0766FE0435E887670DBC572F03864B7C234D47FF0C2259E100D4299
+B8B9FD9734AA92CB165183B1F8A3BD4FEBA4DB2E47C5C2B662E58CAEE624969F
+BC2F97E343C37A79FB4AB9329B3008F8D57AE1D02619BBD2624EBE8AB8F47FD4
+B797D93D522E8D8CC07A603299EFC1652927704007128003E7D6A1D98F888353
+D4EB7DD0F7CB17DAA4F2A4554C1DB3167D669E60D43D54DC5EB82450ED46C514
+C9051F8BBD17F0A203972DFF928130C95EDCD04B05A5EFEBA56A9FB0449111E0
+F568B9AA7FE134288972E5F490C31A67837002B635322548D4BA59DB8265E819
+90EF94D39341A98138ED1A4F74211933E2DA64A256E5C6447898A2B62E7BE7BC
+093A4A305A4A21
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+cleartomark
+%%EndFont 
+%%BeginFont: CMR17
+%!PS-AdobeFont-1.1: CMR17 1.0
+%%CreationDate: 1991 Aug 20 16:38:24
+% Copyright (C) 1997 American Mathematical Society. All Rights Reserved.
+11 dict begin
+/FontInfo 7 dict dup begin
+/version (1.0) readonly def
+/Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def
+/FullName (CMR17) readonly def
+/FamilyName (Computer Modern) readonly def
+/Weight (Medium) readonly def
+/ItalicAngle 0 def
+/isFixedPitch false def
+end readonly def
+/FontName /CMR17 def
+/PaintType 0 def
+/FontType 1 def
+/FontMatrix [0.001 0 0 0.001 0 0] readonly def
+/Encoding 256 array
+0 1 255 {1 index exch /.notdef put} for
+dup 74 /J put
+dup 76 /L put
+dup 84 /T put
+dup 97 /a put
+dup 101 /e put
+dup 103 /g put
+dup 104 /h put
+dup 108 /l put
+dup 110 /n put
+dup 116 /t put
+dup 117 /u put
+dup 118 /v put
+readonly def
+/FontBBox{-33 -250 945 749}readonly def
+currentdict end
+currentfile eexec
+D9D66F633B846A97B686A97E45A3D0AA052A014267B7904EB3C0D3BD0B83D891
+016CA6CA4B712ADEB258FAAB9A130EE605E61F77FC1B738ABC7C51CD46EF8171
+9098D5FEE67660E69A7AB91B58F29A4D79E57022F783EB0FBBB6D4F4EC35014F
+D2DECBA99459A4C59DF0C6EBA150284454E707DC2100C15B76B4C19B84363758
+469A6C558785B226332152109871A9883487DD7710949204DDCF837E6A8708B8
+2BDBF16FBC7512FAA308A093FE5F075EA0A10A15B0ED05D5039DA41B32B16E95
+A3CE9725A429B35BAD796912FC328E3A28F96FCADA20A598E247755E7E7FF801
+BDB00E9B9B086BDBE6EDCF841A3EAFC6F5284FED3C634085BA4EE0FC6A026E96
+96D55575481B007BF93CA452EE3F71D83FAAB3D9DEDD2A8F96C5840EAE5BE5DC
+9322E81DFF5E250DEB386E12A49FC9FBF9B4C25C3283F3CEA74B8278A1B09DA7
+E9AE4FBAAF23EDF5A3E07D39385D521547C3AAAB8EB70549756EBA8EF445AF4A
+497CA924ACCC3DD5456F8E2C7E36946A5BF14E2E959895F7C94F49137256BE46
+4A238684D52792234869EAE1A6D8ADF4E138B79472D2A90A6CA99E2394CC20CD
+3841733046175B20CEBE372327BF13428EED6A3E2FDF84C2DBA4B0AD584EE9DF
+B51828D3B8F385846158C29C9AC3496CB9692DD10219697B2ED4D425C3957FD8
+C4600D76E045C561216EF05D38177243C314877A69A1C22E3BEC611A2EE5A216
+9B7C264CF6D1839DBBD78A40610F2C0D7C2FE09FFA9822FF55035AD52546970F
+83EED2D30EABB1F303091EBC11A5379B12BB3F405E371519A53EA9D66174ED25
+A2E55463EC71A97BE4C04B39E68112956117C8252DB6FB14AB64534B4BCD568B
+246DB833982B38CDE7268BBF74B6B0C18091E1B1F87D32D66F4DD023D1F10D2A
+7736A960F72AC01F733A11023832CD68FB6288A5977743F781214D8FA9C0C3F7
+80001321D4397771F728FD9EE57CFE7D9192B887EC883EB1505068261DC40089
+7B7D2820F06515CD74513521F6397FEAB3AD3572D9A8269430E407E357422461
+1785FC2782047F4C0339D79B16862D939F3A37F78E4E2174E4FBF132539CB760
+207999FF86F6A3EBE48EB0A1CA635450FDEEF79EB16D853F3BF4B41EB1D90E43
+A8FD2EBD81EB1980071C0B0A0CAC92CECBDE786EFEB0404681B6B1722AF5029C
+D444FDDC58CE124D4185D506943E567493A3A0A084B4F2019BA0265DC8D58D98
+F6BD86EBC5E8A8778E794ABADD95CEB2C86C6295F394231344DD4B6B1CD685B7
+982BAFB830C4A9BCF5AA87457E03B147D37ADC5CCD40D023EC8393AB7857B781
+008C88F60EE14849E8ED5A13FAB600B77E35D20E9660AB002DFBD4681148F094
+B5339B78CCAD5FA28FB9F87318CF0E70CE350C433C09EE0D0AC9B2089BEBF0D2
+A73BE0AC58A23EA72DB9ABF975CA85595D3561EB058AAD18CD6BE66E503BAA9B
+BC24671D3C7F0A73C7DBB2ABF9008E0F18D92E6985C1ECADA59583285B55DD62
+70E9652B675122483EEAF348F57738023F047213AEFCB50B2871F99736BCD3D7
+789F532BA67BF8A8D8F226F2E6C2B38966CDE17DF1494890881CF9E37A997F79
+A92BE1D799C342DC8D9AF2E4A07FDF853B3DB6F17140DBCEE31D3C0AFC9466FA
+2AE4C920F9E4BA6831E87998FC54017619C9E16CB059ED70E4D6873EC1241CD7
+0DB8F5E915310E54B34D4720096EE6EC85800E7112E8AEA2D7B6D3D162882965
+D7D4BD396E200477FB6DC9C4FFE8B7B0E6CF5FDE279D674CF6A536D85A4E5D6D
+0FD03582DEBE0C523E315D6D86A2987082ADB0E6E0B7086958D2F56C95556124
+B1DDB34B93232084217E7AD16D70861FE2A9AD0FE364C300B6B9F50320EF290D
+8C8206D9A05689292E5C6C64CEC28057EE25DEA7E81343FDF4F023ABFA7F7743
+C32F0E53635ABD33C8159CE0171FA387B3B9C50AE8A28E76CA5CDCA80C6E9598
+1CD9B38E3C2F4F6111382EE57B9A6554EF6B21BEE8855BB7D9135D753CBF4B0B
+8A21E64F4A189878D23CE590D55D07929157DA7B8F5D8F9BC99DFBC21890249E
+ED21270F211C6143D424B4938B9FB0689A300DF2AD01AFDF33A572840A59F4F0
+69816841EE22AB82A1CA68CB0ED53D31C4CE5B34A43C9E8232CF00D598433D93
+DD89C07D905B55B876E3975C5FAF855F57AB5A6EBE2E15E45C0BC1ADB67978FD
+2ED7826F3EE28BA747EBBC71DE1BE13CC00E0F2A2800D85427DCE1708E44EC05
+261614FE3CBA06AD36C9789EB8A837C383600AE9311ACBC20A43161D60C3B220
+05663FF1C41B7C45BEDD5C16D0FB26D22EE550B974BFE0A2DDD45517BC655A26
+E14292931F6425F1A2ADDBCDD09C9E7DAC7D1F6DFC26368040F38535A132D5D0
+AAAD6B6ADCE08427B9B29E9D5DD01A75DBED44184AA5F8FE86FD079472E737C3
+90F809168B60BBF213EA910B9F33D7440C3B85EA22F5D13FC7932D85345AB8C8
+C21932169D2F28FA643FBDE7646717424C33901BFC9670F7D883E1BEDCB70FFC
+D53106622721088485553197B26A46F25126361D9FB44B4209E0ACF81EF449DF
+04415091745ACB67D636A9469DAF476335B6B461DBDB956151A79C6951E88803
+E5B0C41512CBAF8279F07B03AB2F13537BD67CF84C5D35565F445F1864F595E3
+262F2831203EFCE1E0BBCCF47DF3B0BA52731154C3F9A86BBDA66E33558BBBBC
+AB3550E4EC4FA0101D540AD666BF02801C89967DC2D1A4151CCE4E788A917073
+30A3544C46840C5CDA08B11CD6AFABD1D585A51FFDB732DAEC994210C8977E92
+5C3D030B2A8D2B604A5A1E86C423992291B926A8052E6B45D0D6D6C3E4A61760
+1305C73527F4C0B7688AC7ABFF9D39BF45E3B8AE914198E3C5B2852637D0FE8B
+2006C03BA269E4C2333DDA544A55B6D053B6F36D6E670218911EC545D98B0F04
+4855100995097717C534C492761F19C29244A9CB4B9C0FCD626BD51822267A9F
+DC276A7035FB0A79901C3343E31E68D806997A458F7097DA4B2DB3368E0E0BF1
+38BB71BB63326D31321A5A788C0C13523613FC367F06E8756BFC3C98FADC4BA7
+D70AD79ED0492158447D39F5A8C9AEBA9E32224B52865AACEFD8A2D0E4ED8B10
+3AEA25CB96FCC21C0C26495B4FE74CE9742B0C3C3852E06FA372516BDC78311D
+62BDDAD0C5CEA4AAA66518CB651B474B62EB9141D118973803C58010C0755BC8
+4EAB5F6493F3229F05E74B971B225CC89B245589A11C20A7C1A4729B98B061F4
+0EA91890E0C79D17BA0AC8081063D016B30C13D147E10BCDEC29156150EA9B1D
+76D198DF23D6FDABBDF5FC4CEF2D26551168A43331E19F2E9FA6C94908C966A0
+1F729D025DFF34E866D50F9CA16E2A2202A74EB7C743D54E4D3344A93FDE2D12
+2AFF6D9A813282A06B982E35B98B4AFD27127BEB8F29CBC7F353491CA19346EE
+54952F34B1F97B63BECBF82BE57EB83ED978D2D063B61D1902836EFFB9F3F259
+217574C753403D7A329ABC5902F04E4C7549E0F8AF50B1FDCB48C5801B279C36
+07135A3219151BD1FA92F7F05610D2A29CB5373B3C544EE47717934E88C8D04D
+09309A858048EE7184FB0480B5A237DFB9C65FEA4840957E4123F2578328819C
+51B3270783025D333AA734B6556D3B2B223F188E31FEE1B1DC17F6FBEBB740AF
+BB18D28394E4FC8F3BF9C820C26C62B646743025284E523A1A9971218EA9D72F
+0BDC7628FAA9AC8E0F042169E60B23DEE3BFBB22E37B12884D3FC75A174645E6
+131ED84129CB8D677448F18B7294EB542D79071703DC4AA175A640AC566D9486
+3FA715219CC60F45ED20F9B182547635870150FB1FB1C03EE53FAFFAD8D3F1A6
+15DCA958A7DB6B6EA8B42D4F7D428E288DA95423497B48C44AD335A862F5583F
+1880B8
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+cleartomark
+%%EndFont 
+TeXDict begin 39139632 55387786 1000 600 600 (DocJavalette.dvi)
+@start /Fa 135[52 57[71 1[71 44[37 15[{}4 90.9091 /CMMI10
+rf /Fb 136[48 48 48 48 48 48 2[48 48 1[48 2[48 48 1[48
+48 48 1[48 48 4[48 32[48 11[48 2[48 1[48 48 48 48 48
+48 1[48 48 48 33[{}29 90.9091 /CMTT10 rf /Fc 134[48 48
+2[51 35 36 36 1[51 45 51 76 25 48 1[25 1[45 28 40 51
+40 51 45 12[66 51 67 1[62 71 1[83 57 2[33 3[62 69 1[64
+68 10[45 45 45 45 45 45 49[{}38 90.9091 /CMSL10 rf /Fd
+149[25 35 35 45 45 101[71{}6 90.9091 /CMSY10 rf /Fe 134[59
+1[81 59 1[44 44 46 2[56 62 93 31 2[31 3[51 62 1[62 54
+14[84 5[67 2[42 5[81 54[62 12[{}20 99.6264 /CMBX12 rf
+/Ff 134[71 71 1[71 75 52 53 55 2[67 75 1[37 2[37 75 1[41
+61 1[60 1[65 12[94 9[69 74[{}18 119.552 /CMBX12 rf /Fg
+137[42 1[30 1[38 2[46 51 8[42 4[28 17[68 7[59 2[65 64
+19[28 33 5[28 39[{}14 90.9091 /CMTI10 rf /Fh 134[48 48
+66 48 51 35 36 36 48 51 45 51 76 25 48 1[25 51 45 28
+40 51 40 51 45 12[66 51 4[68 83 2[47 33 68 1[59 1[69
+66 64 68 1[43 1[71 2[25 5[45 45 45 45 2[25 30 25 71 1[35
+35 26[51 51 53 11[{}52 90.9091 /CMR10 rf /Fi 137[51 1[38
+1[38 1[54 49 54 1[27 2[27 3[43 1[43 20[73 7[64 3[69 73
+7[49 6[49 49 49 2[33 27 44[{}20 99.6264 /CMR12 rf /Fj
+137[70 73 51 5[73 1[36 3[73 66 1[58 3[66 12[96 7[83 1[68
+74[{}12 143.462 /CMR17 rf end
+%%EndProlog
+%%BeginSetup
+%%Feature: *Resolution 600dpi
+TeXDict begin
+%%PaperSize: A4
+ end
+%%EndSetup
+%%Page: 1 1
+TeXDict begin 1 0 bop 1188 912 a Fj(The)44 b(Language)f(Ja)l(v)-7
+b(alette)1561 1189 y Fi(BNF-con)m(v)m(erter)1574 1416
+y(April)33 b(19,)f(2011)382 1764 y Fh(This)c(do)s(cumen)m(t)h(w)m(as)h
+(automatically)i(generated)e(b)m(y)f(the)g Fg(BNF-Converter)p
+Fh(.)41 b(It)29 b(w)m(as)382 1877 y(generated)f(together)h(with)e(the)h
+(lexer,)h(the)e(parser,)h(and)e(the)i(abstract)g(syn)m(tax)g(mo)s(d-)
+382 1990 y(ule,)i(whic)m(h)g(guaran)m(tees)i(that)e(the)h(do)s(cumen)m
+(t)f(matc)m(hes)h(with)f(the)g(implemen)m(tation)382
+2103 y(of)g(the)h(language)h(\(pro)m(vided)e(no)g(hand-hac)m(king)h
+(has)f(tak)m(en)i(place\).)382 2409 y Ff(The)44 b(lexical)j(structure)e
+(of)g(Ja)l(v)-7 b(alette)382 2639 y Fe(Iden)m(ti\014ers)382
+2834 y Fh(Iden)m(ti\014ers)28 b Fd(h)p Fc(Iden)m(t)15
+b Fd(i)29 b Fh(are)f(unquoted)g(strings)g(b)s(eginning)f(with)h(a)h
+(letter,)h(follo)m(w)m(ed)g(b)m(y)382 2947 y(an)m(y)38
+b(com)m(bination)i(of)e(letters,)j(digits,)g(and)c(the)i(c)m(haracters)
+p 2589 2947 29 4 v 121 w Fb(')p Fh(,)h(reserv)m(ed)e(w)m(ords)382
+3060 y(excluded.)382 3324 y Fe(Literals)382 3519 y Fh(In)m(teger)31
+b(literals)h Fd(h)p Fc(In)m(t)16 b Fd(i)30 b Fh(are)h(nonempt)m(y)f
+(sequences)h(of)f(digits.)382 3655 y(Double-precision)g(\015oat)g
+(literals)h Fd(h)p Fc(Double)16 b Fd(i)30 b Fh(ha)m(v)m(e)h(the)e
+(structure)g(indicated)h(b)m(y)f(the)382 3768 y(regular)h(expression)f
+Fd(h)p Fc(digit)16 b Fd(i)j Fh(+)f Fg(`.')p Fd(h)p Fc(digit)e
+Fd(i)j Fh(+)g(\()p Fg(`e')o(`-')p Fh(?)p Fd(h)p Fc(digit)d
+Fd(i)p Fh(+\)?)30 b(i.e.)g(t)m(w)m(o)h(sequences)382
+3881 y(of)k(digits)g(separated)h(b)m(y)e(a)i(decimal)f(p)s(oin)m(t,)i
+(optionally)f(follo)m(w)m(ed)g(b)m(y)f(an)g(unsigned)382
+3994 y(or)30 b(negativ)m(e)j(exp)s(onen)m(t.)382 4131
+y(String)g(literals)i Fd(h)p Fc(String)15 b Fd(i)34 b
+Fh(ha)m(v)m(e)h(the)f(form)g Fb(")o Fa(x)p Fb(")p Fh(,)h(where)e
+Fa(x)g Fh(is)h(an)m(y)g(sequence)g(of)g(an)m(y)382 4243
+y(c)m(haracters)e(except)f Fb(")f Fh(unless)g(preceded)g(b)m(y)g
+Fb(\\)p Fh(.)382 4507 y Fe(Reserv)m(ed)38 b(w)m(ords)f(and)h(sym)m(b)s
+(ols)382 4702 y Fh(The)28 b(set)h(of)g(reserv)m(ed)g(w)m(ords)g(is)f
+(the)h(set)h(of)e(terminals)i(app)s(earing)e(in)g(the)h(grammar.)382
+4815 y(Those)36 b(reserv)m(ed)f(w)m(ords)h(that)g(consist)h(of)e
+(non-letter)i(c)m(haracters)h(are)e(called)h(sym-)382
+4928 y(b)s(ols,)32 b(and)f(they)h(are)g(treated)h(in)f(a)g(di\013eren)m
+(t)g(w)m(a)m(y)h(from)f(those)g(that)g(are)h(similar)f(to)382
+5041 y(iden)m(ti\014ers.)52 b(The)34 b(lexer)h(follo)m(ws)h(rules)d
+(familiar)i(from)f(languages)i(lik)m(e)f(Hask)m(ell,)j(C,)382
+5154 y(and)30 b(Ja)m(v)-5 b(a,)31 b(including)f(longest)i(matc)m(h)f
+(and)f(spacing)h(con)m(v)m(en)m(tions.)382 5290 y(The)f(reserv)m(ed)g
+(w)m(ords)g(used)g(in)g(Ja)m(v)-5 b(alette)33 b(are)e(the)f(follo)m
+(wing:)1854 5652 y(1)p eop end
+%%Page: 2 2
+TeXDict begin 2 1 bop 432 536 a Fb(boolean)97 b(double)h(else)432
+649 y(false)193 b(if)290 b(int)432 761 y(return)145 b(true)194
+b(void)432 874 y(while)382 1053 y Fh(The)30 b(sym)m(b)s(ols)g(used)f
+(in)h(Ja)m(v)-5 b(alette)33 b(are)e(the)g(follo)m(wing:)432
+1277 y Fb(\()193 b(\))g(,)432 1390 y Fd(f)j(g)g Fb(;)432
+1503 y Fh(=)170 b(++)99 b Fd(\000\000)432 1616 y(\000)170
+b Fb(!)193 b(&&)432 1729 y Fd(jj)e Fa(<)170 b(>)432 1842
+y Fh(+)g Fb(*)193 b(/)432 1954 y(\045)g Fa(<)p Fh(=)99
+b Fa(>)p Fh(=)432 2067 y(==)g Fb(!)p Fh(=)382 2377 y
+Fe(Commen)m(ts)382 2572 y Fh(Single-line)31 b(commen)m(ts)h(b)s(egin)e
+(with)g Fb(#)o Fh(,)h Fb(//)o Fh(.)382 2685 y(Multiple-line)h(commen)m
+(ts)f(are)g(enclosed)g(with)f Fb(/*)g Fh(and)g Fb(*/)o
+Fh(.)382 2995 y Ff(The)44 b(syn)l(tactic)i(structure)f(of)g(Ja)l(v)-7
+b(alette)382 3221 y Fh(Non-terminals)29 b(are)f(enclosed)g(b)s(et)m(w)m
+(een)h Fd(h)f Fh(and)f Fd(i)p Fh(.)40 b(The)27 b(sym)m(b)s(ols)h(::=)g
+(\(pro)s(duction\),)382 3334 y Fd(j)f Fh(\(union\))f(and)g
+Fa(\017)g Fh(\(empt)m(y)i(rule\))e(b)s(elong)h(to)g(the)g(BNF)g
+(notation.)41 b(All)27 b(other)g(sym)m(b)s(ols)382 3447
+y(are)k(terminals.)432 3697 y Fd(h)p Fc(Program)15 b
+Fd(i)100 b Fh(::=)g Fd(h)p Fc(ListT)-8 b(opDef)17 b Fd(i)432
+3946 y(h)p Fc(T)-8 b(opDef)16 b Fd(i)100 b Fh(::=)g Fd(h)p
+Fc(T)m(yp)s(e)15 b Fd(i)30 b(h)p Fc(Iden)m(t)16 b Fd(i)31
+b Fb(\()f Fd(h)p Fc(ListArg)16 b Fd(i)30 b Fb(\))g Fd(h)p
+Fc(Blo)s(c)m(k)17 b Fd(i)432 4170 y(h)p Fc(ListT)-8 b(opDef)16
+b Fd(i)100 b Fh(::=)g Fd(h)p Fc(T)-8 b(opDef)16 b Fd(i)1062
+4283 y(j)196 b(h)p Fc(T)-8 b(opDef)16 b Fd(i)31 b(h)p
+Fc(ListT)-8 b(opDef)16 b Fd(i)432 4476 y(h)p Fc(Arg)f
+Fd(i)100 b Fh(::=)g Fd(h)p Fc(T)m(yp)s(e)15 b Fd(i)31
+b(h)p Fc(Iden)m(t)16 b Fd(i)432 4700 y(h)p Fc(ListArg)g
+Fd(i)100 b Fh(::=)g Fa(\017)920 4813 y Fd(j)196 b(h)p
+Fc(Arg)15 b Fd(i)920 4926 y(j)196 b(h)p Fc(Arg)15 b Fd(i)31
+b Fb(,)f Fd(h)p Fc(ListArg)16 b Fd(i)432 5104 y(h)p Fc(Blo)s(c)m(k)h
+Fd(i)100 b Fh(::=)g Fd(f)30 b(h)p Fc(ListStm)m(t)17 b
+Fd(i)30 b(g)1854 5652 y Fh(2)p eop end
+%%Page: 3 3
+TeXDict begin 3 2 bop 432 536 a Fd(h)p Fc(ListStm)m(t)16
+b Fd(i)100 b Fh(::=)g Fa(\017)965 649 y Fd(j)196 b(h)p
+Fc(Stm)m(t)16 b Fd(i)30 b(h)p Fc(ListStm)m(t)17 b Fd(i)432
+816 y(h)p Fc(Stm)m(t)f Fd(i)100 b Fh(::=)f Fb(;)812 929
+y Fd(j)195 b(h)p Fc(Blo)s(c)m(k)17 b Fd(i)812 1042 y(j)195
+b(h)p Fc(T)m(yp)s(e)16 b Fd(i)30 b(h)p Fc(ListItem)16
+b Fd(i)31 b Fb(;)812 1155 y Fd(j)195 b(h)p Fc(Iden)m(t)16
+b Fd(i)31 b Fh(=)f Fd(h)p Fc(Expr)14 b Fd(i)31 b Fb(;)812
+1268 y Fd(j)195 b(h)p Fc(Iden)m(t)16 b Fd(i)31 b Fh(++)e
+Fb(;)812 1381 y Fd(j)195 b(h)p Fc(Iden)m(t)16 b Fd(i)31
+b(\000\000)e Fb(;)812 1494 y Fd(j)195 b Fb(return)29
+b Fd(h)p Fc(Expr)15 b Fd(i)30 b Fb(;)812 1606 y Fd(j)195
+b Fb(return)29 b(;)812 1719 y Fd(j)195 b Fb(if)30 b(\()g
+Fd(h)p Fc(Expr)15 b Fd(i)30 b Fb(\))g Fd(h)p Fc(Stm)m(t)16
+b Fd(i)812 1832 y(j)195 b Fb(if)30 b(\()g Fd(h)p Fc(Expr)15
+b Fd(i)30 b Fb(\))g Fd(h)p Fc(Stm)m(t)16 b Fd(i)31 b
+Fb(else)e Fd(h)p Fc(Stm)m(t)16 b Fd(i)812 1945 y(j)195
+b Fb(while)29 b(\()h Fd(h)p Fc(Expr)15 b Fd(i)31 b Fb(\))f
+Fd(h)p Fc(Stm)m(t)16 b Fd(i)812 2058 y(j)195 b(h)p Fc(Expr)15
+b Fd(i)31 b Fb(;)432 2211 y Fd(h)p Fc(Item)16 b Fd(i)100
+b Fh(::=)f Fd(h)p Fc(Iden)m(t)16 b Fd(i)802 2324 y(j)195
+b(h)p Fc(Iden)m(t)16 b Fd(i)31 b Fh(=)f Fd(h)p Fc(Expr)14
+b Fd(i)432 2492 y(h)p Fc(ListItem)i Fd(i)100 b Fh(::=)g
+Fd(h)p Fc(Item)16 b Fd(i)955 2605 y(j)196 b(h)p Fc(Item)16
+b Fd(i)30 b Fb(,)g Fd(h)p Fc(ListItem)16 b Fd(i)432 2772
+y(h)p Fc(T)m(yp)s(e)f Fd(i)100 b Fh(::=)g Fb(int)822
+2885 y Fd(j)196 b Fb(double)822 2998 y Fd(j)g Fb(boolean)822
+3111 y Fd(j)g Fb(void)432 3264 y Fd(h)p Fc(ListT)m(yp)s(e)15
+b Fd(i)100 b Fh(::=)g Fa(\017)975 3377 y Fd(j)196 b(h)p
+Fc(T)m(yp)s(e)15 b Fd(i)975 3490 y(j)196 b(h)p Fc(T)m(yp)s(e)15
+b Fd(i)31 b Fb(,)f Fd(h)p Fc(ListT)m(yp)s(e)15 b Fd(i)432
+3643 y(h)p Fc(Expr6)g Fd(i)100 b Fh(::=)f Fd(h)p Fc(Iden)m(t)16
+b Fd(i)859 3756 y(j)195 b(h)p Fc(In)m(teger)17 b Fd(i)859
+3869 y(j)195 b(h)p Fc(Double)17 b Fd(i)859 3982 y(j)195
+b Fb(true)859 4095 y Fd(j)g Fb(false)859 4208 y Fd(j)g(h)p
+Fc(Iden)m(t)16 b Fd(i)31 b Fb(\()f Fd(h)p Fc(ListExpr)14
+b Fd(i)31 b Fb(\))859 4320 y Fd(j)195 b(h)p Fc(String)16
+b Fd(i)859 4433 y(j)195 b Fb(\()30 b Fd(h)p Fc(Expr)15
+b Fd(i)31 b Fb(\))432 4587 y Fd(h)p Fc(Expr5)15 b Fd(i)100
+b Fh(::=)f Fd(\000)30 b(h)p Fc(Expr6)15 b Fd(i)859 4699
+y(j)195 b Fb(!)30 b Fd(h)p Fc(Expr6)15 b Fd(i)859 4812
+y(j)195 b(h)p Fc(Expr6)15 b Fd(i)432 4965 y(h)p Fc(Expr4)g
+Fd(i)100 b Fh(::=)f Fd(h)p Fc(Expr4)15 b Fd(i)31 b(h)p
+Fc(MulOp)15 b Fd(i)30 b(h)p Fc(Expr5)15 b Fd(i)859 5078
+y(j)195 b(h)p Fc(Expr5)15 b Fd(i)1854 5652 y Fh(3)p eop
+end
+%%Page: 4 4
+TeXDict begin 4 3 bop 432 536 a Fd(h)p Fc(Expr3)15 b
+Fd(i)100 b Fh(::=)f Fd(h)p Fc(Expr3)15 b Fd(i)31 b(h)p
+Fc(AddOp)14 b Fd(i)31 b(h)p Fc(Expr4)15 b Fd(i)859 649
+y(j)195 b(h)p Fc(Expr4)15 b Fd(i)432 816 y(h)p Fc(Expr2)g
+Fd(i)100 b Fh(::=)f Fd(h)p Fc(Expr2)15 b Fd(i)31 b(h)p
+Fc(RelOp)15 b Fd(i)31 b(h)p Fc(Expr3)15 b Fd(i)859 929
+y(j)195 b(h)p Fc(Expr3)15 b Fd(i)432 1097 y(h)p Fc(Expr1)g
+Fd(i)100 b Fh(::=)f Fd(h)p Fc(Expr2)15 b Fd(i)31 b Fb(&&)f
+Fd(h)p Fc(Expr1)15 b Fd(i)859 1210 y(j)195 b(h)p Fc(Expr2)15
+b Fd(i)432 1377 y(h)p Fc(Expr)f Fd(i)100 b Fh(::=)g Fd(h)p
+Fc(Expr1)15 b Fd(i)31 b(jj)f(h)p Fc(Expr)15 b Fd(i)813
+1490 y(j)196 b(h)p Fc(Expr1)15 b Fd(i)432 1658 y(h)p
+Fc(ListExpr)f Fd(i)100 b Fh(::=)g Fa(\017)966 1770 y
+Fd(j)196 b(h)p Fc(Expr)15 b Fd(i)966 1883 y(j)196 b(h)p
+Fc(Expr)15 b Fd(i)30 b Fb(,)g Fd(h)p Fc(ListExpr)15 b
+Fd(i)432 2036 y(h)p Fc(AddOp)f Fd(i)100 b Fh(::=)f(+)908
+2149 y Fd(j)195 b(\000)432 2317 y(h)p Fc(MulOp)15 b Fd(i)100
+b Fh(::=)f Fb(*)898 2430 y Fd(j)195 b Fb(/)898 2543 y
+Fd(j)g Fb(\045)432 2696 y Fd(h)p Fc(RelOp)15 b Fd(i)100
+b Fh(::=)g Fa(<)871 2809 y Fd(j)196 b Fa(<)p Fh(=)871
+2922 y Fd(j)g Fa(>)871 3035 y Fd(j)g Fa(>)p Fh(=)871
+3148 y Fd(j)g Fh(==)871 3260 y Fd(j)g Fb(!)p Fh(=)1854
+5652 y(4)p eop end
+%%Trailer
+
+userdict /end-hook known{end-hook}if
+%%EOF
diff --git a/DocJavalette.tex b/DocJavalette.tex
new file mode 100644
index 0000000..23dd261
--- /dev/null
+++ b/DocJavalette.tex
@@ -0,0 +1,223 @@
+\batchmode
+%This Latex file is machine-generated by the BNF-converter
+
+\documentclass[a4paper,11pt]{article}
+\author{BNF-converter}
+\title{The Language Javalette}
+\setlength{\parindent}{0mm}
+\setlength{\parskip}{1mm}
+\begin{document}
+
+\maketitle
+
+\newcommand{\emptyP}{\mbox{$\epsilon$}}
+\newcommand{\terminal}[1]{\mbox{{\texttt {#1}}}}
+\newcommand{\nonterminal}[1]{\mbox{$\langle \mbox{{\sl #1 }} \! \rangle$}}
+\newcommand{\arrow}{\mbox{::=}}
+\newcommand{\delimit}{\mbox{$|$}}
+\newcommand{\reserved}[1]{\mbox{{\texttt {#1}}}}
+\newcommand{\literal}[1]{\mbox{{\texttt {#1}}}}
+\newcommand{\symb}[1]{\mbox{{\texttt {#1}}}}
+
+This document was automatically generated by the {\em BNF-Converter}. It was generated together with the lexer, the parser, and the abstract syntax module, which guarantees that the document matches with the implementation of the language (provided no hand-hacking has taken place).
+
+\section*{The lexical structure of Javalette}
+\subsection*{Identifiers}
+Identifiers \nonterminal{Ident} are unquoted strings beginning with a letter,
+followed by any combination of letters, digits, and the characters {\tt \_ '},
+reserved words excluded.
+
+
+\subsection*{Literals}
+Integer literals \nonterminal{Int}\ are nonempty sequences of digits.
+
+
+Double-precision float literals \nonterminal{Double}\ have the structure
+indicated by the regular expression $\nonterminal{digit}+ \mbox{{\it `.'}} \nonterminal{digit}+ (\mbox{{\it `e'}} \mbox{{\it `-'}}? \nonterminal{digit}+)?$ i.e.\
+two sequences of digits separated by a decimal point, optionally
+followed by an unsigned or negative exponent.
+
+
+String literals \nonterminal{String}\ have the form
+\terminal{"}$x$\terminal{"}, where $x$ is any sequence of any characters
+except \terminal{"}\ unless preceded by \verb6\6.
+
+
+
+
+\subsection*{Reserved words and symbols}
+The set of reserved words is the set of terminals appearing in the grammar. Those reserved words that consist of non-letter characters are called symbols, and they are treated in a different way from those that are similar to identifiers. The lexer follows rules familiar from languages like Haskell, C, and Java, including longest match and spacing conventions.
+
+The reserved words used in Javalette are the following: \\
+
+\begin{tabular}{lll}
+{\reserved{boolean}} &{\reserved{double}} &{\reserved{else}} \\
+{\reserved{false}} &{\reserved{if}} &{\reserved{int}} \\
+{\reserved{return}} &{\reserved{true}} &{\reserved{void}} \\
+{\reserved{while}} & & \\
+\end{tabular}\\
+
+The symbols used in Javalette are the following: \\
+
+\begin{tabular}{lll}
+{\symb{(}} &{\symb{)}} &{\symb{,}} \\
+{\symb{\{}} &{\symb{\}}} &{\symb{;}} \\
+{\symb{{$=$}}} &{\symb{{$+$}{$+$}}} &{\symb{{$-$}{$-$}}} \\
+{\symb{{$-$}}} &{\symb{!}} &{\symb{\&\&}} \\
+{\symb{{$|$}{$|$}}} &{\symb{{$<$}}} &{\symb{{$>$}}} \\
+{\symb{{$+$}}} &{\symb{*}} &{\symb{/}} \\
+{\symb{\%}} &{\symb{{$<$}{$=$}}} &{\symb{{$>$}{$=$}}} \\
+{\symb{{$=$}{$=$}}} &{\symb{!{$=$}}} & \\
+\end{tabular}\\
+
+\subsection*{Comments}
+Single-line comments begin with {\symb{\#}}, {\symb{//}}. \\Multiple-line comments are  enclosed with {\symb{/*}} and {\symb{*/}}.
+
+\section*{The syntactic structure of Javalette}
+Non-terminals are enclosed between $\langle$ and $\rangle$. 
+The symbols  {\arrow}  (production),  {\delimit}  (union) 
+and {\emptyP} (empty rule) belong to the BNF notation. 
+All other symbols are terminals.\\
+
+\begin{tabular}{lll}
+{\nonterminal{Program}} & {\arrow}  &{\nonterminal{ListTopDef}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{TopDef}} & {\arrow}  &{\nonterminal{Type}} {\nonterminal{Ident}} {\terminal{(}} {\nonterminal{ListArg}} {\terminal{)}} {\nonterminal{Block}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{ListTopDef}} & {\arrow}  &{\nonterminal{TopDef}}  \\
+ & {\delimit}  &{\nonterminal{TopDef}} {\nonterminal{ListTopDef}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Arg}} & {\arrow}  &{\nonterminal{Type}} {\nonterminal{Ident}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{ListArg}} & {\arrow}  &{\emptyP} \\
+ & {\delimit}  &{\nonterminal{Arg}}  \\
+ & {\delimit}  &{\nonterminal{Arg}} {\terminal{,}} {\nonterminal{ListArg}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Block}} & {\arrow}  &{\terminal{\{}} {\nonterminal{ListStmt}} {\terminal{\}}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{ListStmt}} & {\arrow}  &{\emptyP} \\
+ & {\delimit}  &{\nonterminal{Stmt}} {\nonterminal{ListStmt}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Stmt}} & {\arrow}  &{\terminal{;}}  \\
+ & {\delimit}  &{\nonterminal{Block}}  \\
+ & {\delimit}  &{\nonterminal{Type}} {\nonterminal{ListItem}} {\terminal{;}}  \\
+ & {\delimit}  &{\nonterminal{Ident}} {\terminal{{$=$}}} {\nonterminal{Expr}} {\terminal{;}}  \\
+ & {\delimit}  &{\nonterminal{Ident}} {\terminal{{$+$}{$+$}}} {\terminal{;}}  \\
+ & {\delimit}  &{\nonterminal{Ident}} {\terminal{{$-$}{$-$}}} {\terminal{;}}  \\
+ & {\delimit}  &{\terminal{return}} {\nonterminal{Expr}} {\terminal{;}}  \\
+ & {\delimit}  &{\terminal{return}} {\terminal{;}}  \\
+ & {\delimit}  &{\terminal{if}} {\terminal{(}} {\nonterminal{Expr}} {\terminal{)}} {\nonterminal{Stmt}}  \\
+ & {\delimit}  &{\terminal{if}} {\terminal{(}} {\nonterminal{Expr}} {\terminal{)}} {\nonterminal{Stmt}} {\terminal{else}} {\nonterminal{Stmt}}  \\
+ & {\delimit}  &{\terminal{while}} {\terminal{(}} {\nonterminal{Expr}} {\terminal{)}} {\nonterminal{Stmt}}  \\
+ & {\delimit}  &{\nonterminal{Expr}} {\terminal{;}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Item}} & {\arrow}  &{\nonterminal{Ident}}  \\
+ & {\delimit}  &{\nonterminal{Ident}} {\terminal{{$=$}}} {\nonterminal{Expr}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{ListItem}} & {\arrow}  &{\nonterminal{Item}}  \\
+ & {\delimit}  &{\nonterminal{Item}} {\terminal{,}} {\nonterminal{ListItem}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Type}} & {\arrow}  &{\terminal{int}}  \\
+ & {\delimit}  &{\terminal{double}}  \\
+ & {\delimit}  &{\terminal{boolean}}  \\
+ & {\delimit}  &{\terminal{void}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{ListType}} & {\arrow}  &{\emptyP} \\
+ & {\delimit}  &{\nonterminal{Type}}  \\
+ & {\delimit}  &{\nonterminal{Type}} {\terminal{,}} {\nonterminal{ListType}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr6}} & {\arrow}  &{\nonterminal{Ident}}  \\
+ & {\delimit}  &{\nonterminal{Integer}}  \\
+ & {\delimit}  &{\nonterminal{Double}}  \\
+ & {\delimit}  &{\terminal{true}}  \\
+ & {\delimit}  &{\terminal{false}}  \\
+ & {\delimit}  &{\nonterminal{Ident}} {\terminal{(}} {\nonterminal{ListExpr}} {\terminal{)}}  \\
+ & {\delimit}  &{\nonterminal{String}}  \\
+ & {\delimit}  &{\terminal{(}} {\nonterminal{Expr}} {\terminal{)}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr5}} & {\arrow}  &{\terminal{{$-$}}} {\nonterminal{Expr6}}  \\
+ & {\delimit}  &{\terminal{!}} {\nonterminal{Expr6}}  \\
+ & {\delimit}  &{\nonterminal{Expr6}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr4}} & {\arrow}  &{\nonterminal{Expr4}} {\nonterminal{MulOp}} {\nonterminal{Expr5}}  \\
+ & {\delimit}  &{\nonterminal{Expr5}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr3}} & {\arrow}  &{\nonterminal{Expr3}} {\nonterminal{AddOp}} {\nonterminal{Expr4}}  \\
+ & {\delimit}  &{\nonterminal{Expr4}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr2}} & {\arrow}  &{\nonterminal{Expr2}} {\nonterminal{RelOp}} {\nonterminal{Expr3}}  \\
+ & {\delimit}  &{\nonterminal{Expr3}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr1}} & {\arrow}  &{\nonterminal{Expr2}} {\terminal{\&\&}} {\nonterminal{Expr1}}  \\
+ & {\delimit}  &{\nonterminal{Expr2}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr}} & {\arrow}  &{\nonterminal{Expr1}} {\terminal{{$|$}{$|$}}} {\nonterminal{Expr}}  \\
+ & {\delimit}  &{\nonterminal{Expr1}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{ListExpr}} & {\arrow}  &{\emptyP} \\
+ & {\delimit}  &{\nonterminal{Expr}}  \\
+ & {\delimit}  &{\nonterminal{Expr}} {\terminal{,}} {\nonterminal{ListExpr}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{AddOp}} & {\arrow}  &{\terminal{{$+$}}}  \\
+ & {\delimit}  &{\terminal{{$-$}}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{MulOp}} & {\arrow}  &{\terminal{*}}  \\
+ & {\delimit}  &{\terminal{/}}  \\
+ & {\delimit}  &{\terminal{\%}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{RelOp}} & {\arrow}  &{\terminal{{$<$}}}  \\
+ & {\delimit}  &{\terminal{{$<$}{$=$}}}  \\
+ & {\delimit}  &{\terminal{{$>$}}}  \\
+ & {\delimit}  &{\terminal{{$>$}{$=$}}}  \\
+ & {\delimit}  &{\terminal{{$=$}{$=$}}}  \\
+ & {\delimit}  &{\terminal{!{$=$}}}  \\
+\end{tabular}\\
+
+
+
+\end{document}
+
diff --git a/DocJavalette.tex.bak b/DocJavalette.tex.bak
new file mode 100644
index 0000000..a1f39c8
--- /dev/null
+++ b/DocJavalette.tex.bak
@@ -0,0 +1,223 @@
+\batchmode
+%This Latex file is machine-generated by the BNF-converter
+
+\documentclass[a4paper,11pt]{article}
+\author{BNF-converter}
+\title{The Language Javalette}
+\setlength{\parindent}{0mm}
+\setlength{\parskip}{1mm}
+\begin{document}
+
+\maketitle
+
+\newcommand{\emptyP}{\mbox{$\epsilon$}}
+\newcommand{\terminal}[1]{\mbox{{\texttt {#1}}}}
+\newcommand{\nonterminal}[1]{\mbox{$\langle \mbox{{\sl #1 }} \! \rangle$}}
+\newcommand{\arrow}{\mbox{::=}}
+\newcommand{\delimit}{\mbox{$|$}}
+\newcommand{\reserved}[1]{\mbox{{\texttt {#1}}}}
+\newcommand{\literal}[1]{\mbox{{\texttt {#1}}}}
+\newcommand{\symb}[1]{\mbox{{\texttt {#1}}}}
+
+This document was automatically generated by the {\em BNF-Converter}. It was generated together with the lexer, the parser, and the abstract syntax module, which guarantees that the document matches with the implementation of the language (provided no hand-hacking has taken place).
+
+\section*{The lexical structure of Javalette}
+\subsection*{Identifiers}
+Identifiers \nonterminal{Ident} are unquoted strings beginning with a letter,
+followed by any combination of letters, digits, and the characters {\tt \_ '},
+reserved words excluded.
+
+
+\subsection*{Literals}
+Integer literals \nonterminal{Int}\ are nonempty sequences of digits.
+
+
+Double-precision float literals \nonterminal{Double}\ have the structure
+indicated by the regular expression $\nonterminal{digit}+ \mbox{{\it `.'}} \nonterminal{digit}+ (\mbox{{\it `e'}} \mbox{{\it `-'}}? \nonterminal{digit}+)?$ i.e.\
+two sequences of digits separated by a decimal point, optionally
+followed by an unsigned or negative exponent.
+
+
+String literals \nonterminal{String}\ have the form
+\terminal{"}$x$\terminal{"}, where $x$ is any sequence of any characters
+except \terminal{"}\ unless preceded by \verb6\6.
+
+
+
+
+\subsection*{Reserved words and symbols}
+The set of reserved words is the set of terminals appearing in the grammar. Those reserved words that consist of non-letter characters are called symbols, and they are treated in a different way from those that are similar to identifiers. The lexer follows rules familiar from languages like Haskell, C, and Java, including longest match and spacing conventions.
+
+The reserved words used in Javalette are the following: \\
+
+\begin{tabular}{lll}
+{\reserved{boolean}} &{\reserved{double}} &{\reserved{else}} \\
+{\reserved{false}} &{\reserved{if}} &{\reserved{int}} \\
+{\reserved{return}} &{\reserved{true}} &{\reserved{void}} \\
+{\reserved{while}} & & \\
+\end{tabular}\\
+
+The symbols used in Javalette are the following: \\
+
+\begin{tabular}{lll}
+{\symb{(}} &{\symb{)}} &{\symb{,}} \\
+{\symb{\{}} &{\symb{\}}} &{\symb{;}} \\
+{\symb{{$=$}}} &{\symb{{$+$}{$+$}}} &{\symb{{$-$}{$-$}}} \\
+{\symb{{$-$}}} &{\symb{!}} &{\symb{\&\&}} \\
+{\symb{{$|$}{$|$}}} &{\symb{{$+$}}} &{\symb{*}} \\
+{\symb{/}} &{\symb{\%}} &{\symb{{$<$}}} \\
+{\symb{{$<$}{$=$}}} &{\symb{{$>$}}} &{\symb{{$>$}{$=$}}} \\
+{\symb{{$=$}{$=$}}} &{\symb{!{$=$}}} & \\
+\end{tabular}\\
+
+\subsection*{Comments}
+Single-line comments begin with {\symb{\#}}, {\symb{//}}. \\Multiple-line comments are  enclosed with {\symb{/*}} and {\symb{*/}}.
+
+\section*{The syntactic structure of Javalette}
+Non-terminals are enclosed between $\langle$ and $\rangle$. 
+The symbols  {\arrow}  (production),  {\delimit}  (union) 
+and {\emptyP} (empty rule) belong to the BNF notation. 
+All other symbols are terminals.\\
+
+\begin{tabular}{lll}
+{\nonterminal{Program}} & {\arrow}  &{\nonterminal{ListTopDef}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{TopDef}} & {\arrow}  &{\nonterminal{Type}} {\nonterminal{Ident}} {\terminal{(}} {\nonterminal{ListArg}} {\terminal{)}} {\nonterminal{Block}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{ListTopDef}} & {\arrow}  &{\nonterminal{TopDef}}  \\
+ & {\delimit}  &{\nonterminal{TopDef}} {\nonterminal{ListTopDef}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Arg}} & {\arrow}  &{\nonterminal{Type}} {\nonterminal{Ident}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{ListArg}} & {\arrow}  &{\emptyP} \\
+ & {\delimit}  &{\nonterminal{Arg}}  \\
+ & {\delimit}  &{\nonterminal{Arg}} {\terminal{,}} {\nonterminal{ListArg}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Block}} & {\arrow}  &{\terminal{\{}} {\nonterminal{ListStmt}} {\terminal{\}}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{ListStmt}} & {\arrow}  &{\emptyP} \\
+ & {\delimit}  &{\nonterminal{Stmt}} {\nonterminal{ListStmt}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Stmt}} & {\arrow}  &{\terminal{;}}  \\
+ & {\delimit}  &{\nonterminal{Block}}  \\
+ & {\delimit}  &{\nonterminal{Type}} {\nonterminal{ListItem}} {\terminal{;}}  \\
+ & {\delimit}  &{\nonterminal{Ident}} {\terminal{{$=$}}} {\nonterminal{Expr}} {\terminal{;}}  \\
+ & {\delimit}  &{\nonterminal{Ident}} {\terminal{{$+$}{$+$}}} {\terminal{;}}  \\
+ & {\delimit}  &{\nonterminal{Ident}} {\terminal{{$-$}{$-$}}} {\terminal{;}}  \\
+ & {\delimit}  &{\terminal{return}} {\nonterminal{Expr}} {\terminal{;}}  \\
+ & {\delimit}  &{\terminal{return}} {\terminal{;}}  \\
+ & {\delimit}  &{\terminal{if}} {\terminal{(}} {\nonterminal{Expr}} {\terminal{)}} {\nonterminal{Stmt}}  \\
+ & {\delimit}  &{\terminal{if}} {\terminal{(}} {\nonterminal{Expr}} {\terminal{)}} {\nonterminal{Stmt}} {\terminal{else}} {\nonterminal{Stmt}}  \\
+ & {\delimit}  &{\terminal{while}} {\terminal{(}} {\nonterminal{Expr}} {\terminal{)}} {\nonterminal{Stmt}}  \\
+ & {\delimit}  &{\nonterminal{Expr}} {\terminal{;}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Item}} & {\arrow}  &{\nonterminal{Ident}}  \\
+ & {\delimit}  &{\nonterminal{Ident}} {\terminal{{$=$}}} {\nonterminal{Expr}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{ListItem}} & {\arrow}  &{\nonterminal{Item}}  \\
+ & {\delimit}  &{\nonterminal{Item}} {\terminal{,}} {\nonterminal{ListItem}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Type}} & {\arrow}  &{\terminal{int}}  \\
+ & {\delimit}  &{\terminal{double}}  \\
+ & {\delimit}  &{\terminal{boolean}}  \\
+ & {\delimit}  &{\terminal{void}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{ListType}} & {\arrow}  &{\emptyP} \\
+ & {\delimit}  &{\nonterminal{Type}}  \\
+ & {\delimit}  &{\nonterminal{Type}} {\terminal{,}} {\nonterminal{ListType}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr6}} & {\arrow}  &{\nonterminal{Ident}}  \\
+ & {\delimit}  &{\nonterminal{Integer}}  \\
+ & {\delimit}  &{\nonterminal{Double}}  \\
+ & {\delimit}  &{\terminal{true}}  \\
+ & {\delimit}  &{\terminal{false}}  \\
+ & {\delimit}  &{\nonterminal{Ident}} {\terminal{(}} {\nonterminal{ListExpr}} {\terminal{)}}  \\
+ & {\delimit}  &{\nonterminal{String}}  \\
+ & {\delimit}  &{\terminal{(}} {\nonterminal{Expr}} {\terminal{)}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr5}} & {\arrow}  &{\terminal{{$-$}}} {\nonterminal{Expr6}}  \\
+ & {\delimit}  &{\terminal{!}} {\nonterminal{Expr6}}  \\
+ & {\delimit}  &{\nonterminal{Expr6}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr4}} & {\arrow}  &{\nonterminal{Expr4}} {\nonterminal{MulOp}} {\nonterminal{Expr5}}  \\
+ & {\delimit}  &{\nonterminal{Expr5}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr3}} & {\arrow}  &{\nonterminal{Expr3}} {\nonterminal{AddOp}} {\nonterminal{Expr4}}  \\
+ & {\delimit}  &{\nonterminal{Expr4}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr2}} & {\arrow}  &{\nonterminal{Expr2}} {\nonterminal{RelOp}} {\nonterminal{Expr3}}  \\
+ & {\delimit}  &{\nonterminal{Expr3}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr1}} & {\arrow}  &{\nonterminal{Expr2}} {\terminal{\&\&}} {\nonterminal{Expr1}}  \\
+ & {\delimit}  &{\nonterminal{Expr2}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{Expr}} & {\arrow}  &{\nonterminal{Expr1}} {\terminal{{$|$}{$|$}}} {\nonterminal{Expr}}  \\
+ & {\delimit}  &{\nonterminal{Expr1}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{ListExpr}} & {\arrow}  &{\emptyP} \\
+ & {\delimit}  &{\nonterminal{Expr}}  \\
+ & {\delimit}  &{\nonterminal{Expr}} {\terminal{,}} {\nonterminal{ListExpr}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{AddOp}} & {\arrow}  &{\terminal{{$+$}}}  \\
+ & {\delimit}  &{\terminal{{$-$}}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{MulOp}} & {\arrow}  &{\terminal{*}}  \\
+ & {\delimit}  &{\terminal{/}}  \\
+ & {\delimit}  &{\terminal{\%}}  \\
+\end{tabular}\\
+
+\begin{tabular}{lll}
+{\nonterminal{RelOp}} & {\arrow}  &{\terminal{{$<$}}}  \\
+ & {\delimit}  &{\terminal{{$<$}{$=$}}}  \\
+ & {\delimit}  &{\terminal{{$>$}}}  \\
+ & {\delimit}  &{\terminal{{$>$}{$=$}}}  \\
+ & {\delimit}  &{\terminal{{$=$}{$=$}}}  \\
+ & {\delimit}  &{\terminal{!{$=$}}}  \\
+\end{tabular}\\
+
+
+
+\end{document}
+
diff --git a/DocJavalette.txt b/DocJavalette.txt
new file mode 100644
index 0000000..77090b3
--- /dev/null
+++ b/DocJavalette.txt
@@ -0,0 +1,131 @@
+The Language Javalette
+BNF Converter
+
+
+%This txt2tags file is machine-generated by the BNF-converter
+%Process by txt2tags to generate html or latex
+
+
+
+This document was automatically generated by the //BNF-Converter//. It was generated together with the lexer, the parser, and the abstract syntax module, which guarantees that the document matches with the implementation of the language (provided no hand-hacking has taken place).
+
+==The lexical structure of Javalette==
+===Identifiers===
+Identifiers //Ident// are unquoted strings beginning with a letter,
+followed by any combination of letters, digits, and the characters ``_ '``
+reserved words excluded.
+
+
+===Literals===
+Integer literals //Integer// are nonempty sequences of digits.
+
+
+Double-precision float literals //Double// have the structure
+indicated by the regular expression ``digit+ '.' digit+ ('e' ('-')? digit+)?`` i.e.\
+two sequences of digits separated by a decimal point, optionally
+followed by an unsigned or negative exponent.
+
+
+String literals //String// have the form
+``"``//x//``"``}, where //x// is any sequence of any characters
+except ``"`` unless preceded by ``\``.
+
+
+
+
+===Reserved words and symbols===
+The set of reserved words is the set of terminals appearing in the grammar. Those reserved words that consist of non-letter characters are called symbols, and they are treated in a different way from those that are similar to identifiers. The lexer follows rules familiar from languages like Haskell, C, and Java, including longest match and spacing conventions.
+
+The reserved words used in Javalette are the following:
+  | ``boolean`` | ``double`` | ``else`` | ``false``
+  | ``if`` | ``int`` | ``return`` | ``true``
+  | ``void`` | ``while`` |  | 
+
+The symbols used in Javalette are the following:
+  | ( | ) | , | {
+  | } | ; | = | ++
+  | -- | - | ! | &&
+  | || | < | > | +
+  | * | / | % | <=
+  | >= | == | != | 
+
+===Comments===
+Single-line comments begin with #, //.Multiple-line comments are  enclosed with /* and */.
+
+==The syntactic structure of Javalette==
+Non-terminals are enclosed between < and >. 
+The symbols -> (production),  **|**  (union) 
+and **eps** (empty rule) belong to the BNF notation. 
+All other symbols are terminals.
+
+  | //Program// | -> | //[TopDef]// 
+  | //TopDef// | -> | //Type// //Ident// ``(`` //[Arg]// ``)`` //Block// 
+  | //[TopDef]// | -> | //TopDef// 
+  |  |  **|**  | //TopDef// //[TopDef]// 
+  | //Arg// | -> | //Type// //Ident// 
+  | //[Arg]// | -> | **eps**
+  |  |  **|**  | //Arg// 
+  |  |  **|**  | //Arg// ``,`` //[Arg]// 
+  | //Block// | -> | ``{`` //[Stmt]// ``}`` 
+  | //[Stmt]// | -> | **eps**
+  |  |  **|**  | //Stmt// //[Stmt]// 
+  | //Stmt// | -> | ``;`` 
+  |  |  **|**  | //Block// 
+  |  |  **|**  | //Type// //[Item]// ``;`` 
+  |  |  **|**  | //Ident// ``=`` //Expr// ``;`` 
+  |  |  **|**  | //Ident// ``++`` ``;`` 
+  |  |  **|**  | //Ident// ``--`` ``;`` 
+  |  |  **|**  | ``return`` //Expr// ``;`` 
+  |  |  **|**  | ``return`` ``;`` 
+  |  |  **|**  | ``if`` ``(`` //Expr// ``)`` //Stmt// 
+  |  |  **|**  | ``if`` ``(`` //Expr// ``)`` //Stmt// ``else`` //Stmt// 
+  |  |  **|**  | ``while`` ``(`` //Expr// ``)`` //Stmt// 
+  |  |  **|**  | //Expr// ``;`` 
+  | //Item// | -> | //Ident// 
+  |  |  **|**  | //Ident// ``=`` //Expr// 
+  | //[Item]// | -> | //Item// 
+  |  |  **|**  | //Item// ``,`` //[Item]// 
+  | //Type// | -> | ``int`` 
+  |  |  **|**  | ``double`` 
+  |  |  **|**  | ``boolean`` 
+  |  |  **|**  | ``void`` 
+  | //[Type]// | -> | **eps**
+  |  |  **|**  | //Type// 
+  |  |  **|**  | //Type// ``,`` //[Type]// 
+  | //Expr6// | -> | //Ident// 
+  |  |  **|**  | //Integer// 
+  |  |  **|**  | //Double// 
+  |  |  **|**  | ``true`` 
+  |  |  **|**  | ``false`` 
+  |  |  **|**  | //Ident// ``(`` //[Expr]// ``)`` 
+  |  |  **|**  | //String// 
+  |  |  **|**  | ``(`` //Expr// ``)`` 
+  | //Expr5// | -> | ``-`` //Expr6// 
+  |  |  **|**  | ``!`` //Expr6// 
+  |  |  **|**  | //Expr6// 
+  | //Expr4// | -> | //Expr4// //MulOp// //Expr5// 
+  |  |  **|**  | //Expr5// 
+  | //Expr3// | -> | //Expr3// //AddOp// //Expr4// 
+  |  |  **|**  | //Expr4// 
+  | //Expr2// | -> | //Expr2// //RelOp// //Expr3// 
+  |  |  **|**  | //Expr3// 
+  | //Expr1// | -> | //Expr2// ``&&`` //Expr1// 
+  |  |  **|**  | //Expr2// 
+  | //Expr// | -> | //Expr1// ``||`` //Expr// 
+  |  |  **|**  | //Expr1// 
+  | //[Expr]// | -> | **eps**
+  |  |  **|**  | //Expr// 
+  |  |  **|**  | //Expr// ``,`` //[Expr]// 
+  | //AddOp// | -> | ``+`` 
+  |  |  **|**  | ``-`` 
+  | //MulOp// | -> | ``*`` 
+  |  |  **|**  | ``/`` 
+  |  |  **|**  | ``%`` 
+  | //RelOp// | -> | ``<`` 
+  |  |  **|**  | ``<=`` 
+  |  |  **|**  | ``>`` 
+  |  |  **|**  | ``>=`` 
+  |  |  **|**  | ``==`` 
+  |  |  **|**  | ``!=`` 
+
+
diff --git a/DocJavalette.txt.bak b/DocJavalette.txt.bak
new file mode 100644
index 0000000..9c1a249
--- /dev/null
+++ b/DocJavalette.txt.bak
@@ -0,0 +1,131 @@
+The Language Javalette
+BNF Converter
+
+
+%This txt2tags file is machine-generated by the BNF-converter
+%Process by txt2tags to generate html or latex
+
+
+
+This document was automatically generated by the //BNF-Converter//. It was generated together with the lexer, the parser, and the abstract syntax module, which guarantees that the document matches with the implementation of the language (provided no hand-hacking has taken place).
+
+==The lexical structure of Javalette==
+===Identifiers===
+Identifiers //Ident// are unquoted strings beginning with a letter,
+followed by any combination of letters, digits, and the characters ``_ '``
+reserved words excluded.
+
+
+===Literals===
+Integer literals //Integer// are nonempty sequences of digits.
+
+
+Double-precision float literals //Double// have the structure
+indicated by the regular expression ``digit+ '.' digit+ ('e' ('-')? digit+)?`` i.e.\
+two sequences of digits separated by a decimal point, optionally
+followed by an unsigned or negative exponent.
+
+
+String literals //String// have the form
+``"``//x//``"``}, where //x// is any sequence of any characters
+except ``"`` unless preceded by ``\``.
+
+
+
+
+===Reserved words and symbols===
+The set of reserved words is the set of terminals appearing in the grammar. Those reserved words that consist of non-letter characters are called symbols, and they are treated in a different way from those that are similar to identifiers. The lexer follows rules familiar from languages like Haskell, C, and Java, including longest match and spacing conventions.
+
+The reserved words used in Javalette are the following:
+  | ``boolean`` | ``double`` | ``else`` | ``false``
+  | ``if`` | ``int`` | ``return`` | ``true``
+  | ``void`` | ``while`` |  | 
+
+The symbols used in Javalette are the following:
+  | ( | ) | , | {
+  | } | ; | = | ++
+  | -- | - | ! | &&
+  | || | + | * | /
+  | % | < | <= | >
+  | >= | == | != | 
+
+===Comments===
+Single-line comments begin with #, //.Multiple-line comments are  enclosed with /* and */.
+
+==The syntactic structure of Javalette==
+Non-terminals are enclosed between < and >. 
+The symbols -> (production),  **|**  (union) 
+and **eps** (empty rule) belong to the BNF notation. 
+All other symbols are terminals.
+
+  | //Program// | -> | //[TopDef]// 
+  | //TopDef// | -> | //Type// //Ident// ``(`` //[Arg]// ``)`` //Block// 
+  | //[TopDef]// | -> | //TopDef// 
+  |  |  **|**  | //TopDef// //[TopDef]// 
+  | //Arg// | -> | //Type// //Ident// 
+  | //[Arg]// | -> | **eps**
+  |  |  **|**  | //Arg// 
+  |  |  **|**  | //Arg// ``,`` //[Arg]// 
+  | //Block// | -> | ``{`` //[Stmt]// ``}`` 
+  | //[Stmt]// | -> | **eps**
+  |  |  **|**  | //Stmt// //[Stmt]// 
+  | //Stmt// | -> | ``;`` 
+  |  |  **|**  | //Block// 
+  |  |  **|**  | //Type// //[Item]// ``;`` 
+  |  |  **|**  | //Ident// ``=`` //Expr// ``;`` 
+  |  |  **|**  | //Ident// ``++`` ``;`` 
+  |  |  **|**  | //Ident// ``--`` ``;`` 
+  |  |  **|**  | ``return`` //Expr// ``;`` 
+  |  |  **|**  | ``return`` ``;`` 
+  |  |  **|**  | ``if`` ``(`` //Expr// ``)`` //Stmt// 
+  |  |  **|**  | ``if`` ``(`` //Expr// ``)`` //Stmt// ``else`` //Stmt// 
+  |  |  **|**  | ``while`` ``(`` //Expr// ``)`` //Stmt// 
+  |  |  **|**  | //Expr// ``;`` 
+  | //Item// | -> | //Ident// 
+  |  |  **|**  | //Ident// ``=`` //Expr// 
+  | //[Item]// | -> | //Item// 
+  |  |  **|**  | //Item// ``,`` //[Item]// 
+  | //Type// | -> | ``int`` 
+  |  |  **|**  | ``double`` 
+  |  |  **|**  | ``boolean`` 
+  |  |  **|**  | ``void`` 
+  | //[Type]// | -> | **eps**
+  |  |  **|**  | //Type// 
+  |  |  **|**  | //Type// ``,`` //[Type]// 
+  | //Expr6// | -> | //Ident// 
+  |  |  **|**  | //Integer// 
+  |  |  **|**  | //Double// 
+  |  |  **|**  | ``true`` 
+  |  |  **|**  | ``false`` 
+  |  |  **|**  | //Ident// ``(`` //[Expr]// ``)`` 
+  |  |  **|**  | //String// 
+  |  |  **|**  | ``(`` //Expr// ``)`` 
+  | //Expr5// | -> | ``-`` //Expr6// 
+  |  |  **|**  | ``!`` //Expr6// 
+  |  |  **|**  | //Expr6// 
+  | //Expr4// | -> | //Expr4// //MulOp// //Expr5// 
+  |  |  **|**  | //Expr5// 
+  | //Expr3// | -> | //Expr3// //AddOp// //Expr4// 
+  |  |  **|**  | //Expr4// 
+  | //Expr2// | -> | //Expr2// //RelOp// //Expr3// 
+  |  |  **|**  | //Expr3// 
+  | //Expr1// | -> | //Expr2// ``&&`` //Expr1// 
+  |  |  **|**  | //Expr2// 
+  | //Expr// | -> | //Expr1// ``||`` //Expr// 
+  |  |  **|**  | //Expr1// 
+  | //[Expr]// | -> | **eps**
+  |  |  **|**  | //Expr// 
+  |  |  **|**  | //Expr// ``,`` //[Expr]// 
+  | //AddOp// | -> | ``+`` 
+  |  |  **|**  | ``-`` 
+  | //MulOp// | -> | ``*`` 
+  |  |  **|**  | ``/`` 
+  |  |  **|**  | ``%`` 
+  | //RelOp// | -> | ``<`` 
+  |  |  **|**  | ``<=`` 
+  |  |  **|**  | ``>`` 
+  |  |  **|**  | ``>=`` 
+  |  |  **|**  | ``==`` 
+  |  |  **|**  | ``!=`` 
+
+
diff --git a/ErrM.hi b/ErrM.hi
new file mode 100644
index 0000000..50c7d1c
Binary files /dev/null and b/ErrM.hi differ
diff --git a/ErrM.hs b/ErrM.hs
new file mode 100644
index 0000000..0e410d9
--- /dev/null
+++ b/ErrM.hs
@@ -0,0 +1,26 @@
+-- BNF Converter: Error Monad
+-- Copyright (C) 2004  Author:  Aarne Ranta
+
+-- This file comes with NO WARRANTY and may be used FOR ANY PURPOSE.
+module ErrM where
+
+-- the Error monad: like Maybe type with error msgs
+
+import Control.Monad (MonadPlus(..), liftM)
+
+data Err a = Ok a | Bad String
+  deriving (Read, Show, Eq, Ord)
+
+instance Monad Err where
+  return      = Ok
+  fail        = Bad
+  Ok a  >>= f = f a
+  Bad s >>= f = Bad s
+
+instance Functor Err where
+  fmap = liftM
+
+instance MonadPlus Err where
+  mzero = Bad "Err.mzero"
+  mplus (Bad _) y = y
+  mplus x       _ = x
diff --git a/ErrM.hs.bak b/ErrM.hs.bak
new file mode 100644
index 0000000..0e410d9
--- /dev/null
+++ b/ErrM.hs.bak
@@ -0,0 +1,26 @@
+-- BNF Converter: Error Monad
+-- Copyright (C) 2004  Author:  Aarne Ranta
+
+-- This file comes with NO WARRANTY and may be used FOR ANY PURPOSE.
+module ErrM where
+
+-- the Error monad: like Maybe type with error msgs
+
+import Control.Monad (MonadPlus(..), liftM)
+
+data Err a = Ok a | Bad String
+  deriving (Read, Show, Eq, Ord)
+
+instance Monad Err where
+  return      = Ok
+  fail        = Bad
+  Ok a  >>= f = f a
+  Bad s >>= f = Bad s
+
+instance Functor Err where
+  fmap = liftM
+
+instance MonadPlus Err where
+  mzero = Bad "Err.mzero"
+  mplus (Bad _) y = y
+  mplus x       _ = x
diff --git a/ErrM.o b/ErrM.o
new file mode 100644
index 0000000..0eefbdd
Binary files /dev/null and b/ErrM.o differ
diff --git a/Javalette.cf b/Javalette.cf
new file mode 100644
index 0000000..c0715f0
--- /dev/null
+++ b/Javalette.cf
@@ -0,0 +1,132 @@
+-- programs ------------------------------------------------
+
+entrypoints Program ;
+
+Program.   Program ::= [TopDef] ;
+
+FnDef.	   TopDef ::= Type Ident "(" [Arg] ")" Block ;
+
+separator nonempty TopDef "" ;
+
+Arg. 	   Arg ::= Type Ident;
+
+separator  Arg "," ;
+
+-- statements ----------------------------------------------
+
+Block.     Block ::= "{" [Stmt] "}" ;
+
+separator  Stmt "" ;
+
+Empty.     Stmt ::= ";" ;
+
+BStmt.     Stmt ::= Block ;
+
+Decl.      Stmt ::= Type [Item] ";" ;
+
+NoInit.    Item ::= Ident ; 
+
+Init.      Item ::= Ident "=" Expr ;
+
+separator nonempty Item "," ;
+
+Ass.       Stmt ::= Ident "=" Expr  ";" ;
+
+Incr.      Stmt ::= Ident "++"  ";" ;
+
+Decr.      Stmt ::= Ident "--"  ";" ;
+
+Ret.       Stmt ::= "return" Expr ";" ;
+
+VRet.      Stmt ::= "return" ";" ;
+
+Cond.      Stmt ::= "if" "(" Expr ")" Stmt  ;
+
+CondElse.  Stmt ::= "if" "(" Expr ")" Stmt "else" Stmt  ;
+
+While.     Stmt ::= "while" "(" Expr ")" Stmt ;
+
+SExp.      Stmt ::= Expr  ";" ;
+
+-- Types ---------------------------------------------------
+
+Int.       Type ::= "int" ;
+
+Doub.      Type ::= "double" ;
+
+Bool.      Type ::= "boolean" ;
+
+Void.      Type ::= "void" ;
+
+internal   Fun. Type ::= Type "(" [Type] ")" ;
+
+separator  Type "," ;
+
+-- Expressions ---------------------------------------------
+
+EVar.      Expr6 ::= Ident ;
+
+ELitInt.   Expr6 ::= Integer ;
+
+ELitDoub.  Expr6 ::= Double;
+
+ELitTrue.  Expr6 ::= "true" ;
+
+ELitFalse. Expr6 ::= "false" ;
+
+EApp.      Expr6 ::= Ident "(" [Expr] ")" ;
+
+EString.   Expr6 ::= String ;
+
+Neg.       Expr5 ::= "-" Expr6 ;
+
+Not.       Expr5 ::= "!" Expr6 ;
+
+EMul.      Expr4 ::= Expr4 MulOp Expr5 ;
+
+EAdd.      Expr3 ::= Expr3 AddOp Expr4 ;
+
+ERel.      Expr2 ::= Expr2 RelOp Expr3 ;
+
+EAnd.      Expr1 ::= Expr2 "&&" Expr1 ;
+
+EOr.       Expr ::= Expr1 "||" Expr ;
+
+internal TAnot.     Expr ::= "<" Type ">" "(" Expr ")" ;
+
+coercions  Expr 6 ;
+
+separator  Expr "," ;
+
+-- operators -----------------------------------------------
+
+Plus.      AddOp ::= "+" ;
+
+Minus.     AddOp ::= "-" ;
+
+Times.     MulOp ::= "*" ;
+
+Div.       MulOp ::= "/" ;
+
+Mod.       MulOp ::= "%" ;
+
+LTH.       RelOp ::= "<" ;
+
+LE.        RelOp ::= "<=" ;
+
+GTH.       RelOp ::= ">" ;
+
+GE.        RelOp ::= ">=" ;
+
+EQU.       RelOp ::= "==" ;
+
+NE.        RelOp ::= "!=" ;
+
+-- comments ------------------------------------------------
+
+comment    "#" ;
+
+comment    "//" ;
+
+comment    "/*" "*/" ;
+
diff --git a/Javalette.hi b/Javalette.hi
new file mode 100644
index 0000000..8cf967b
Binary files /dev/null and b/Javalette.hi differ
diff --git a/Javalette.hs b/Javalette.hs
new file mode 100644
index 0000000..3f7873f
--- /dev/null
+++ b/Javalette.hs
@@ -0,0 +1,36 @@
+import System.Environment (getArgs)
+import System.Exit (exitFailure)
+import System.FilePath.Posix
+
+import AbsJavalette
+import LexJavalette
+import ParJavalette
+import ErrM
+import PrintJavalette
+
+import TypeChecker
+import Compiler
+
+
+check :: String -> IO () 
+check s = case pProgram (myLexer s) of
+            Bad err  -> do putStrLn "SYNTAX ERROR"
+                           putStrLn err
+                           exitFailure 
+            Ok  tree -> case typecheck tree of
+                          Bad err -> do putStrLn "TYPE ERROR"
+                                        putStrLn err
+                                        exitFailure 
+                          Ok at    -> do --putStrLn $ printTree at ++ "OK\n"
+                                         comp at
+                                         
+comp :: Program -> IO ()
+comp p = do a <- getArgs
+            putStrLn $ compile p $ takeBaseName $ head a
+
+main :: IO ()
+main = do args <- getArgs
+          case args of
+            [file] -> readFile file >>= check
+            _      -> do putStrLn "Usage: lab2 <SourceFile>"
+                         exitFailure
diff --git a/Javalette.hs~ b/Javalette.hs~
new file mode 100644
index 0000000..9cea2b3
--- /dev/null
+++ b/Javalette.hs~
@@ -0,0 +1,30 @@
+import System.Environment (getArgs)
+import System.Exit (exitFailure)
+
+import AbsJavalette
+import LexJavalette
+import ParJavalette
+import ErrM
+
+import TypeChecker
+
+
+-- driver
+
+check :: String -> IO () 
+check s = case pProgram (myLexer s) of
+            Bad err  -> do putStrLn "SYNTAX ERROR"
+                           putStrLn err
+                           exitFailure 
+            Ok  tree -> case typecheck tree of
+                          Bad err -> do putStrLn "TYPE ERROR"
+                                        putStrLn err
+                                        exitFailure 
+                          Ok _    -> putStrLn "OK\n" ++ printTree tree
+
+main :: IO ()
+main = do args <- getArgs
+          case args of
+            [file] -> readFile file >>= check
+            _      -> do putStrLn "Usage: lab2 <SourceFile>"
+                         exitFailure
diff --git a/Javalette.o b/Javalette.o
new file mode 100644
index 0000000..d3f97c2
Binary files /dev/null and b/Javalette.o differ
diff --git a/LexJavalette.hi b/LexJavalette.hi
new file mode 100644
index 0000000..a9f8689
Binary files /dev/null and b/LexJavalette.hi differ
diff --git a/LexJavalette.hs b/LexJavalette.hs
new file mode 100644
index 0000000..803c6a3
--- /dev/null
+++ b/LexJavalette.hs
@@ -0,0 +1,340 @@
+{-# OPTIONS -fglasgow-exts -cpp #-}
+{-# LINE 3 "LexJavalette.x" #-}
+
+{-# OPTIONS -fno-warn-incomplete-patterns #-}
+module LexJavalette where
+
+
+
+#if __GLASGOW_HASKELL__ >= 603
+#include "ghcconfig.h"
+#elif defined(__GLASGOW_HASKELL__)
+#include "config.h"
+#endif
+#if __GLASGOW_HASKELL__ >= 503
+import Data.Array
+import Data.Char (ord)
+import Data.Array.Base (unsafeAt)
+#else
+import Array
+import Char (ord)
+#endif
+#if __GLASGOW_HASKELL__ >= 503
+import GHC.Exts
+#else
+import GlaExts
+#endif
+alex_base :: AlexAddr
+alex_base = AlexA# "\x01\x00\x00\x00\x1f\x00\x00\x00\x39\x00\x00\x00\x3a\x00\x00\x00\x3b\x00\x00\x00\x3c\x00\x00\x00\x1d\x00\x00\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x20\x00\x00\x00\x21\x00\x00\x00\x23\x00\x00\x00\x24\x00\x00\x00\x48\x00\x00\x00\x00\x00\x00\x00\x2b\x00\x00\x00\x1c\x00\x00\x00\x1a\x00\x00\x00\x1b\x00\x00\x00\x25\x00\x00\x00\x26\x00\x00\x00\x33\x00\x00\x00\xde\xff\xff\xff\x9a\x00\x00\x00\x6a\x01\x00\x00\x00\x00\x00\x00\x15\x01\x00\x00\xe5\x01\x00\x00\xd3\x00\x00\x00\x3d\x00\x00\x00\xe5\x00\x00\x00\xf0\x00\x00\x00\x1b\x01\x00\x00\xc0\x01\x00\x00\xca\x01\x00\x00"#
+
+alex_table :: AlexAddr
+alex_table = AlexA# "\x00\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x0d\x00\x14\x00\x1a\x00\x02\x00\xff\xff\x0e\x00\x15\x00\xff\xff\x0e\x00\x0e\x00\x0e\x00\x0f\x00\x0e\x00\x10\x00\xff\xff\x06\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\xff\xff\x0e\x00\x11\x00\x13\x00\x12\x00\xff\xff\xff\xff\x02\x00\xff\xff\xff\xff\xff\xff\xff\xff\x0b\x00\x0a\x00\x0e\x00\x0a\x00\x09\x00\x04\x00\x0a\x00\x0a\x00\x07\x00\x08\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0d\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x00\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x0e\x00\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0d\x00\x00\x00\x00\x00\x20\x00\x00\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0e\x00\x16\x00\x0e\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\xff\xff\x00\x00\x00\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x1b\x00\x00\x00\x00\x00\xff\xff\x18\x00\x1b\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\xff\xff\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x19\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1b\x00\x00\x00\x00\x00\x21\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x1c\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x00\x00\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x22\x00\x00\x00\xff\xff\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x1f\x00\x00\x00\x00\x00\x00\x00\x19\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x1c\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x00\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
+
+alex_check :: AlexAddr
+alex_check = AlexA# "\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x0e\x00\x0f\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x26\x00\x27\x00\x28\x00\x29\x00\x2a\x00\x2b\x00\x2c\x00\x2d\x00\x2e\x00\x2f\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x3b\x00\x3c\x00\x3d\x00\x3e\x00\x3f\x00\x40\x00\x23\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x2a\x00\x2a\x00\x2d\x00\x2a\x00\x2a\x00\x2f\x00\x2a\x00\x2a\x00\x2f\x00\x2f\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x2b\x00\x3d\x00\x3d\x00\x26\x00\x7c\x00\xff\xff\x5b\x00\x5c\x00\x5d\x00\x5e\x00\x5f\x00\x60\x00\x3d\x00\x3d\x00\xff\xff\xff\xff\xff\xff\xff\xff\x20\x00\xff\xff\xff\xff\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x7b\x00\x7c\x00\x7d\x00\x7e\x00\x7f\x00\x80\x00\x81\x00\x82\x00\x83\x00\x84\x00\x85\x00\x86\x00\x87\x00\x88\x00\x89\x00\x8a\x00\x8b\x00\x8c\x00\x8d\x00\x8e\x00\x8f\x00\x90\x00\x91\x00\x92\x00\x93\x00\x94\x00\x95\x00\x96\x00\x97\x00\x98\x00\x99\x00\x9a\x00\x9b\x00\x9c\x00\x9d\x00\x9e\x00\x9f\x00\xa0\x00\xa1\x00\xa2\x00\xa3\x00\xa4\x00\xa5\x00\xa6\x00\xa7\x00\xa8\x00\xa9\x00\xaa\x00\xab\x00\xac\x00\xad\x00\xae\x00\xaf\x00\xb0\x00\xb1\x00\xb2\x00\xb3\x00\xb4\x00\xb5\x00\xb6\x00\xb7\x00\xb8\x00\xb9\x00\xba\x00\xbb\x00\xbc\x00\xbd\x00\xbe\x00\xbf\x00\x27\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xd7\x00\xff\xff\xff\xff\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\x53\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\x22\x00\xff\xff\xff\xff\xf7\x00\x5f\x00\x27\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x0a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x5c\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x22\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x6e\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x74\x00\xff\xff\xff\xff\x65\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xc0\x00\xc1\x00\xc2\x00\xc3\x00\xc4\x00\xc5\x00\xc6\x00\xc7\x00\xc8\x00\xc9\x00\xca\x00\xcb\x00\xcc\x00\xcd\x00\xce\x00\xcf\x00\xd0\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xd5\x00\xd6\x00\x5c\x00\xd8\x00\xd9\x00\xda\x00\xdb\x00\xdc\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xf5\x00\xf6\x00\x27\x00\xf8\x00\xf9\x00\xfa\x00\xfb\x00\xfc\x00\xfd\x00\xfe\x00\xff\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x41\x00\x42\x00\x43\x00\x44\x00\x45\x00\x46\x00\x47\x00\x48\x00\x49\x00\x4a\x00\x4b\x00\x4c\x00\x4d\x00\x4e\x00\x4f\x00\x50\x00\x51\x00\x52\x00\x53\x00\x54\x00\x55\x00\x56\x00\x57\x00\x58\x00\x59\x00\x5a\x00\xff\xff\xff\xff\xff\xff\xff\xff\x5f\x00\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2d\x00\xff\xff\x0a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\x22\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xc0\x00\xc1\x00\xc2\x00\xc3\x00\xc4\x00\xc5\x00\xc6\x00\xc7\x00\xc8\x00\xc9\x00\xca\x00\xcb\x00\xcc\x00\xcd\x00\xce\x00\xcf\x00\xd0\x00\xd1\x00\xd2\x00\xd3\x00\xd4\x00\xd5\x00\xd6\x00\x5c\x00\xd8\x00\xd9\x00\xda\x00\xdb\x00\xdc\x00\xdd\x00\xde\x00\xdf\x00\xe0\x00\xe1\x00\xe2\x00\xe3\x00\xe4\x00\xe5\x00\xe6\x00\xe7\x00\xe8\x00\xe9\x00\xea\x00\xeb\x00\xec\x00\xed\x00\xee\x00\xef\x00\xf0\x00\xf1\x00\xf2\x00\xf3\x00\xf4\x00\xf5\x00\xf6\x00\xff\xff\xf8\x00\xf9\x00\xfa\x00\xfb\x00\xfc\x00\xfd\x00\xfe\x00\xff\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#
+
+alex_deflt :: AlexAddr
+alex_deflt = AlexA# "\x17\x00\xff\xff\x03\x00\x03\x00\x05\x00\x05\x00\xff\xff\x0c\x00\xff\xff\x0c\x00\x0c\x00\x0c\x00\x0c\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x1b\x00\x1b\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#
+
+alex_accept = listArray (0::Int,34) [[],[],[(AlexAccSkip)],[(AlexAccSkip)],[(AlexAccSkip)],[(AlexAccSkip)],[(AlexAcc (alex_action_4))],[(AlexAccSkip)],[(AlexAccSkip)],[],[],[],[],[(AlexAccSkip)],[(AlexAcc (alex_action_4))],[(AlexAcc (alex_action_4))],[(AlexAcc (alex_action_4))],[(AlexAcc (alex_action_4))],[(AlexAcc (alex_action_4))],[(AlexAcc (alex_action_4))],[(AlexAcc (alex_action_4))],[],[],[(AlexAcc (alex_action_5))],[(AlexAcc (alex_action_5))],[(AlexAcc (alex_action_6))],[],[],[],[(AlexAcc (alex_action_7))],[(AlexAcc (alex_action_8))],[(AlexAcc (alex_action_8))],[],[],[]]
+{-# LINE 35 "LexJavalette.x" #-}
+
+
+tok f p s = f p s
+
+share :: String -> String
+share = id
+
+data Tok =
+   TS !String     -- reserved words and symbols
+ | TL !String     -- string literals
+ | TI !String     -- integer literals
+ | TV !String     -- identifiers
+ | TD !String     -- double precision float literals
+ | TC !String     -- character literals
+
+ deriving (Eq,Show,Ord)
+
+data Token = 
+   PT  Posn Tok
+ | Err Posn
+  deriving (Eq,Show,Ord)
+
+tokenPos (PT (Pn _ l _) _ :_) = "line " ++ show l
+tokenPos (Err (Pn _ l _) :_) = "line " ++ show l
+tokenPos _ = "end of file"
+
+posLineCol (Pn _ l c) = (l,c)
+mkPosToken t@(PT p _) = (posLineCol p, prToken t)
+
+prToken t = case t of
+  PT _ (TS s) -> s
+  PT _ (TI s) -> s
+  PT _ (TV s) -> s
+  PT _ (TD s) -> s
+  PT _ (TC s) -> s
+
+  _ -> show t
+
+data BTree = N | B String Tok BTree BTree deriving (Show)
+
+eitherResIdent :: (String -> Tok) -> String -> Tok
+eitherResIdent tv s = treeFind resWords
+  where
+  treeFind N = tv s
+  treeFind (B a t left right) | s < a  = treeFind left
+                              | s > a  = treeFind right
+                              | s == a = t
+
+resWords = b "int" (b "else" (b "double" (b "boolean" N N) N) (b "if" (b "false" N N) N)) (b "void" (b "true" (b "return" N N) N) (b "while" N N))
+   where b s = B s (TS s)
+
+unescapeInitTail :: String -> String
+unescapeInitTail = unesc . tail where
+  unesc s = case s of
+    '\\':c:cs | elem c ['\"', '\\', '\''] -> c : unesc cs
+    '\\':'n':cs  -> '\n' : unesc cs
+    '\\':'t':cs  -> '\t' : unesc cs
+    '"':[]    -> []
+    c:cs      -> c : unesc cs
+    _         -> []
+
+-------------------------------------------------------------------
+-- Alex wrapper code.
+-- A modified "posn" wrapper.
+-------------------------------------------------------------------
+
+data Posn = Pn !Int !Int !Int
+      deriving (Eq, Show,Ord)
+
+alexStartPos :: Posn
+alexStartPos = Pn 0 1 1
+
+alexMove :: Posn -> Char -> Posn
+alexMove (Pn a l c) '\t' = Pn (a+1)  l     (((c+7) `div` 8)*8+1)
+alexMove (Pn a l c) '\n' = Pn (a+1) (l+1)   1
+alexMove (Pn a l c) _    = Pn (a+1)  l     (c+1)
+
+type AlexInput = (Posn, -- current position,
+               Char,     -- previous char
+               String)   -- current input string
+
+tokens :: String -> [Token]
+tokens str = go (alexStartPos, '\n', str)
+    where
+      go :: (Posn, Char, String) -> [Token]
+      go inp@(pos, _, str) =
+               case alexScan inp 0 of
+                AlexEOF                -> []
+                AlexError (pos, _, _)  -> [Err pos]
+                AlexSkip  inp' len     -> go inp'
+                AlexToken inp' len act -> act pos (take len str) : (go inp')
+
+alexGetChar :: AlexInput -> Maybe (Char,AlexInput)
+alexGetChar (p, c, [])    = Nothing
+alexGetChar (p, _, (c:s)) =
+    let p' = alexMove p c
+     in p' `seq` Just (c, (p', c, s))
+
+alexInputPrevChar :: AlexInput -> Char
+alexInputPrevChar (p, c, s) = c
+
+alex_action_4 =  tok (\p s -> PT p (TS $ share s)) 
+alex_action_5 =  tok (\p s -> PT p (eitherResIdent (TV . share) s)) 
+alex_action_6 =  tok (\p s -> PT p (TL $ share $ unescapeInitTail s)) 
+alex_action_7 =  tok (\p s -> PT p (TI $ share s))    
+alex_action_8 =  tok (\p s -> PT p (TD $ share s)) 
+{-# LINE 1 "templates/GenericTemplate.hs" #-}
+{-# LINE 1 "templates/GenericTemplate.hs" #-}
+{-# LINE 1 "<built-in>" #-}
+{-# LINE 1 "<command line>" #-}
+{-# LINE 1 "templates/GenericTemplate.hs" #-}
+-- -----------------------------------------------------------------------------
+-- ALEX TEMPLATE
+--
+-- This code is in the PUBLIC DOMAIN; you may copy it freely and use
+-- it for any purpose whatsoever.
+
+-- -----------------------------------------------------------------------------
+-- INTERNALS and main scanner engine
+
+{-# LINE 37 "templates/GenericTemplate.hs" #-}
+
+{-# LINE 47 "templates/GenericTemplate.hs" #-}
+
+
+data AlexAddr = AlexA# Addr#
+
+#if __GLASGOW_HASKELL__ < 503
+uncheckedShiftL# = shiftL#
+#endif
+
+{-# INLINE alexIndexInt16OffAddr #-}
+alexIndexInt16OffAddr (AlexA# arr) off =
+#ifdef WORDS_BIGENDIAN
+  narrow16Int# i
+  where
+	i    = word2Int# ((high `uncheckedShiftL#` 8#) `or#` low)
+	high = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#)))
+	low  = int2Word# (ord# (indexCharOffAddr# arr off'))
+	off' = off *# 2#
+#else
+  indexInt16OffAddr# arr off
+#endif
+
+
+
+
+
+{-# INLINE alexIndexInt32OffAddr #-}
+alexIndexInt32OffAddr (AlexA# arr) off = 
+#ifdef WORDS_BIGENDIAN
+  narrow32Int# i
+  where
+   i    = word2Int# ((b3 `uncheckedShiftL#` 24#) `or#`
+		     (b2 `uncheckedShiftL#` 16#) `or#`
+		     (b1 `uncheckedShiftL#` 8#) `or#` b0)
+   b3   = int2Word# (ord# (indexCharOffAddr# arr (off' +# 3#)))
+   b2   = int2Word# (ord# (indexCharOffAddr# arr (off' +# 2#)))
+   b1   = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#)))
+   b0   = int2Word# (ord# (indexCharOffAddr# arr off'))
+   off' = off *# 4#
+#else
+  indexInt32OffAddr# arr off
+#endif
+
+
+
+
+
+#if __GLASGOW_HASKELL__ < 503
+quickIndex arr i = arr ! i
+#else
+-- GHC >= 503, unsafeAt is available from Data.Array.Base.
+quickIndex = unsafeAt
+#endif
+
+
+
+
+-- -----------------------------------------------------------------------------
+-- Main lexing routines
+
+data AlexReturn a
+  = AlexEOF
+  | AlexError  !AlexInput
+  | AlexSkip   !AlexInput !Int
+  | AlexToken  !AlexInput !Int a
+
+-- alexScan :: AlexInput -> StartCode -> AlexReturn a
+alexScan input (I# (sc))
+  = alexScanUser undefined input (I# (sc))
+
+alexScanUser user input (I# (sc))
+  = case alex_scan_tkn user input 0# input sc AlexNone of
+	(AlexNone, input') ->
+		case alexGetChar input of
+			Nothing -> 
+
+
+
+				   AlexEOF
+			Just _ ->
+
+
+
+				   AlexError input'
+
+	(AlexLastSkip input len, _) ->
+
+
+
+		AlexSkip input len
+
+	(AlexLastAcc k input len, _) ->
+
+
+
+		AlexToken input len k
+
+
+-- Push the input through the DFA, remembering the most recent accepting
+-- state it encountered.
+
+alex_scan_tkn user orig_input len input s last_acc =
+  input `seq` -- strict in the input
+  let 
+	new_acc = check_accs (alex_accept `quickIndex` (I# (s)))
+  in
+  new_acc `seq`
+  case alexGetChar input of
+     Nothing -> (new_acc, input)
+     Just (c, new_input) -> 
+
+
+
+	let
+		!(base) = alexIndexInt32OffAddr alex_base s
+		!((I# (ord_c))) = ord c
+		!(offset) = (base +# ord_c)
+		!(check)  = alexIndexInt16OffAddr alex_check offset
+		
+		!(new_s) = if (offset >=# 0#) && (check ==# ord_c)
+			  then alexIndexInt16OffAddr alex_table offset
+			  else alexIndexInt16OffAddr alex_deflt s
+	in
+	case new_s of 
+	    -1# -> (new_acc, input)
+		-- on an error, we want to keep the input *before* the
+		-- character that failed, not after.
+    	    _ -> alex_scan_tkn user orig_input (len +# 1#) 
+			new_input new_s new_acc
+
+  where
+	check_accs [] = last_acc
+	check_accs (AlexAcc a : _) = AlexLastAcc a input (I# (len))
+	check_accs (AlexAccSkip : _)  = AlexLastSkip  input (I# (len))
+	check_accs (AlexAccPred a pred : rest)
+	   | pred user orig_input (I# (len)) input
+	   = AlexLastAcc a input (I# (len))
+	check_accs (AlexAccSkipPred pred : rest)
+	   | pred user orig_input (I# (len)) input
+	   = AlexLastSkip input (I# (len))
+	check_accs (_ : rest) = check_accs rest
+
+data AlexLastAcc a
+  = AlexNone
+  | AlexLastAcc a !AlexInput !Int
+  | AlexLastSkip  !AlexInput !Int
+
+data AlexAcc a user
+  = AlexAcc a
+  | AlexAccSkip
+  | AlexAccPred a (AlexAccPred user)
+  | AlexAccSkipPred (AlexAccPred user)
+
+type AlexAccPred user = user -> AlexInput -> Int -> AlexInput -> Bool
+
+-- -----------------------------------------------------------------------------
+-- Predicates on a rule
+
+alexAndPred p1 p2 user in1 len in2
+  = p1 user in1 len in2 && p2 user in1 len in2
+
+--alexPrevCharIsPred :: Char -> AlexAccPred _ 
+alexPrevCharIs c _ input _ _ = c == alexInputPrevChar input
+
+--alexPrevCharIsOneOfPred :: Array Char Bool -> AlexAccPred _ 
+alexPrevCharIsOneOf arr _ input _ _ = arr ! alexInputPrevChar input
+
+--alexRightContext :: Int -> AlexAccPred _
+alexRightContext (I# (sc)) user _ _ input = 
+     case alex_scan_tkn user input 0# input sc AlexNone of
+	  (AlexNone, _) -> False
+	  _ -> True
+	-- TODO: there's no need to find the longest
+	-- match when checking the right context, just
+	-- the first match will do.
+
+-- used by wrappers
+iUnbox (I# (i)) = i
diff --git a/LexJavalette.o b/LexJavalette.o
new file mode 100644
index 0000000..e51fde9
Binary files /dev/null and b/LexJavalette.o differ
diff --git a/LexJavalette.x b/LexJavalette.x
new file mode 100644
index 0000000..002c641
--- /dev/null
+++ b/LexJavalette.x
@@ -0,0 +1,135 @@
+-- -*- haskell -*-
+-- This Alex file was machine-generated by the BNF converter
+{
+{-# OPTIONS -fno-warn-incomplete-patterns #-}
+module LexJavalette where
+
+
+}
+
+
+$l = [a-zA-Z\192 - \255] # [\215 \247]    -- isolatin1 letter FIXME
+$c = [A-Z\192-\221] # [\215]    -- capital isolatin1 letter FIXME
+$s = [a-z\222-\255] # [\247]    -- small isolatin1 letter FIXME
+$d = [0-9]                -- digit
+$i = [$l $d _ ']          -- identifier character
+$u = [\0-\255]          -- universal: any character
+
+@rsyms =    -- symbols and non-identifier-like reserved words
+   \( | \) | \, | \{ | \} | \; | \= | \+ \+ | \- \- | \- | \! | \& \& | \| \| | \< | \> | \+ | \* | \/ | \% | \< \= | \> \= | \= \= | \! \=
+
+:-
+"#" [.]* ; -- Toss single line comments
+"//" [.]* ; -- Toss single line comments
+"/*" ([$u # \*] | \* [$u # \/])* ("*")+ "/" ; 
+
+$white+ ;
+@rsyms { tok (\p s -> PT p (TS $ share s)) }
+
+$l $i*   { tok (\p s -> PT p (eitherResIdent (TV . share) s)) }
+\" ([$u # [\" \\ \n]] | (\\ (\" | \\ | \' | n | t)))* \"{ tok (\p s -> PT p (TL $ share $ unescapeInitTail s)) }
+
+$d+      { tok (\p s -> PT p (TI $ share s))    }
+$d+ \. $d+ (e (\-)? $d+)? { tok (\p s -> PT p (TD $ share s)) }
+
+{
+
+tok f p s = f p s
+
+share :: String -> String
+share = id
+
+data Tok =
+   TS !String     -- reserved words and symbols
+ | TL !String     -- string literals
+ | TI !String     -- integer literals
+ | TV !String     -- identifiers
+ | TD !String     -- double precision float literals
+ | TC !String     -- character literals
+
+ deriving (Eq,Show,Ord)
+
+data Token = 
+   PT  Posn Tok
+ | Err Posn
+  deriving (Eq,Show,Ord)
+
+tokenPos (PT (Pn _ l _) _ :_) = "line " ++ show l
+tokenPos (Err (Pn _ l _) :_) = "line " ++ show l
+tokenPos _ = "end of file"
+
+posLineCol (Pn _ l c) = (l,c)
+mkPosToken t@(PT p _) = (posLineCol p, prToken t)
+
+prToken t = case t of
+  PT _ (TS s) -> s
+  PT _ (TI s) -> s
+  PT _ (TV s) -> s
+  PT _ (TD s) -> s
+  PT _ (TC s) -> s
+
+  _ -> show t
+
+data BTree = N | B String Tok BTree BTree deriving (Show)
+
+eitherResIdent :: (String -> Tok) -> String -> Tok
+eitherResIdent tv s = treeFind resWords
+  where
+  treeFind N = tv s
+  treeFind (B a t left right) | s < a  = treeFind left
+                              | s > a  = treeFind right
+                              | s == a = t
+
+resWords = b "int" (b "else" (b "double" (b "boolean" N N) N) (b "if" (b "false" N N) N)) (b "void" (b "true" (b "return" N N) N) (b "while" N N))
+   where b s = B s (TS s)
+
+unescapeInitTail :: String -> String
+unescapeInitTail = unesc . tail where
+  unesc s = case s of
+    '\\':c:cs | elem c ['\"', '\\', '\''] -> c : unesc cs
+    '\\':'n':cs  -> '\n' : unesc cs
+    '\\':'t':cs  -> '\t' : unesc cs
+    '"':[]    -> []
+    c:cs      -> c : unesc cs
+    _         -> []
+
+-------------------------------------------------------------------
+-- Alex wrapper code.
+-- A modified "posn" wrapper.
+-------------------------------------------------------------------
+
+data Posn = Pn !Int !Int !Int
+      deriving (Eq, Show,Ord)
+
+alexStartPos :: Posn
+alexStartPos = Pn 0 1 1
+
+alexMove :: Posn -> Char -> Posn
+alexMove (Pn a l c) '\t' = Pn (a+1)  l     (((c+7) `div` 8)*8+1)
+alexMove (Pn a l c) '\n' = Pn (a+1) (l+1)   1
+alexMove (Pn a l c) _    = Pn (a+1)  l     (c+1)
+
+type AlexInput = (Posn, -- current position,
+               Char,     -- previous char
+               String)   -- current input string
+
+tokens :: String -> [Token]
+tokens str = go (alexStartPos, '\n', str)
+    where
+      go :: (Posn, Char, String) -> [Token]
+      go inp@(pos, _, str) =
+               case alexScan inp 0 of
+                AlexEOF                -> []
+                AlexError (pos, _, _)  -> [Err pos]
+                AlexSkip  inp' len     -> go inp'
+                AlexToken inp' len act -> act pos (take len str) : (go inp')
+
+alexGetChar :: AlexInput -> Maybe (Char,AlexInput)
+alexGetChar (p, c, [])    = Nothing
+alexGetChar (p, _, (c:s)) =
+    let p' = alexMove p c
+     in p' `seq` Just (c, (p', c, s))
+
+alexInputPrevChar :: AlexInput -> Char
+alexInputPrevChar (p, c, s) = c
+}
diff --git a/LexJavalette.x.bak b/LexJavalette.x.bak
new file mode 100644
index 0000000..3ca8407
--- /dev/null
+++ b/LexJavalette.x.bak
@@ -0,0 +1,135 @@
+-- -*- haskell -*-
+-- This Alex file was machine-generated by the BNF converter
+{
+{-# OPTIONS -fno-warn-incomplete-patterns #-}
+module LexJavalette where
+
+
+}
+
+
+$l = [a-zA-Z\192 - \255] # [\215 \247]    -- isolatin1 letter FIXME
+$c = [A-Z\192-\221] # [\215]    -- capital isolatin1 letter FIXME
+$s = [a-z\222-\255] # [\247]    -- small isolatin1 letter FIXME
+$d = [0-9]                -- digit
+$i = [$l $d _ ']          -- identifier character
+$u = [\0-\255]          -- universal: any character
+
+@rsyms =    -- symbols and non-identifier-like reserved words
+   \( | \) | \, | \{ | \} | \; | \= | \+ \+ | \- \- | \- | \! | \& \& | \| \| | \+ | \* | \/ | \% | \< | \< \= | \> | \> \= | \= \= | \! \=
+
+:-
+"#" [.]* ; -- Toss single line comments
+"//" [.]* ; -- Toss single line comments
+"/*" ([$u # \*] | \* [$u # \/])* ("*")+ "/" ; 
+
+$white+ ;
+@rsyms { tok (\p s -> PT p (TS $ share s)) }
+
+$l $i*   { tok (\p s -> PT p (eitherResIdent (TV . share) s)) }
+\" ([$u # [\" \\ \n]] | (\\ (\" | \\ | \' | n | t)))* \"{ tok (\p s -> PT p (TL $ share $ unescapeInitTail s)) }
+
+$d+      { tok (\p s -> PT p (TI $ share s))    }
+$d+ \. $d+ (e (\-)? $d+)? { tok (\p s -> PT p (TD $ share s)) }
+
+{
+
+tok f p s = f p s
+
+share :: String -> String
+share = id
+
+data Tok =
+   TS !String     -- reserved words and symbols
+ | TL !String     -- string literals
+ | TI !String     -- integer literals
+ | TV !String     -- identifiers
+ | TD !String     -- double precision float literals
+ | TC !String     -- character literals
+
+ deriving (Eq,Show,Ord)
+
+data Token = 
+   PT  Posn Tok
+ | Err Posn
+  deriving (Eq,Show,Ord)
+
+tokenPos (PT (Pn _ l _) _ :_) = "line " ++ show l
+tokenPos (Err (Pn _ l _) :_) = "line " ++ show l
+tokenPos _ = "end of file"
+
+posLineCol (Pn _ l c) = (l,c)
+mkPosToken t@(PT p _) = (posLineCol p, prToken t)
+
+prToken t = case t of
+  PT _ (TS s) -> s
+  PT _ (TI s) -> s
+  PT _ (TV s) -> s
+  PT _ (TD s) -> s
+  PT _ (TC s) -> s
+
+  _ -> show t
+
+data BTree = N | B String Tok BTree BTree deriving (Show)
+
+eitherResIdent :: (String -> Tok) -> String -> Tok
+eitherResIdent tv s = treeFind resWords
+  where
+  treeFind N = tv s
+  treeFind (B a t left right) | s < a  = treeFind left
+                              | s > a  = treeFind right
+                              | s == a = t
+
+resWords = b "int" (b "else" (b "double" (b "boolean" N N) N) (b "if" (b "false" N N) N)) (b "void" (b "true" (b "return" N N) N) (b "while" N N))
+   where b s = B s (TS s)
+
+unescapeInitTail :: String -> String
+unescapeInitTail = unesc . tail where
+  unesc s = case s of
+    '\\':c:cs | elem c ['\"', '\\', '\''] -> c : unesc cs
+    '\\':'n':cs  -> '\n' : unesc cs
+    '\\':'t':cs  -> '\t' : unesc cs
+    '"':[]    -> []
+    c:cs      -> c : unesc cs
+    _         -> []
+
+-------------------------------------------------------------------
+-- Alex wrapper code.
+-- A modified "posn" wrapper.
+-------------------------------------------------------------------
+
+data Posn = Pn !Int !Int !Int
+      deriving (Eq, Show,Ord)
+
+alexStartPos :: Posn
+alexStartPos = Pn 0 1 1
+
+alexMove :: Posn -> Char -> Posn
+alexMove (Pn a l c) '\t' = Pn (a+1)  l     (((c+7) `div` 8)*8+1)
+alexMove (Pn a l c) '\n' = Pn (a+1) (l+1)   1
+alexMove (Pn a l c) _    = Pn (a+1)  l     (c+1)
+
+type AlexInput = (Posn, -- current position,
+               Char,     -- previous char
+               String)   -- current input string
+
+tokens :: String -> [Token]
+tokens str = go (alexStartPos, '\n', str)
+    where
+      go :: (Posn, Char, String) -> [Token]
+      go inp@(pos, _, str) =
+               case alexScan inp 0 of
+                AlexEOF                -> []
+                AlexError (pos, _, _)  -> [Err pos]
+                AlexSkip  inp' len     -> go inp'
+                AlexToken inp' len act -> act pos (take len str) : (go inp')
+
+alexGetChar :: AlexInput -> Maybe (Char,AlexInput)
+alexGetChar (p, c, [])    = Nothing
+alexGetChar (p, _, (c:s)) =
+    let p' = alexMove p c
+     in p' `seq` Just (c, (p', c, s))
+
+alexInputPrevChar :: AlexInput -> Char
+alexInputPrevChar (p, c, s) = c
+}
diff --git a/Makefile b/Makefile
new file mode 100644
index 0000000..eba278a
--- /dev/null
+++ b/Makefile
@@ -0,0 +1,14 @@
+all:
+	happy -gca ParJavalette.y
+	alex -g LexJavalette.x
+	latex DocJavalette.tex; dvips DocJavalette.dvi -o DocJavalette.ps
+	ghc --make TestJavalette.hs -o TestJavalette
+	ghc --make Javalette.hs -o jlc
+clean:
+	-rm -f *.log *.aux *.hi *.o *.dvi
+	-rm -f DocJavalette.ps
+distclean: clean
+	-rm -f DocJavalette.* LexJavalette.* ParJavalette.* LayoutJavalette.* SkelJavalette.* PrintJavalette.* TestJavalette.* AbsJavalette.* TestJavalette ErrM.* SharedString.* Javalette.dtd XMLJavalette.* Makefile*
+
+jlc:
+	ghc --make Javalette.hs -o jlc
diff --git a/ParJavalette.hi b/ParJavalette.hi
new file mode 100644
index 0000000..4e6b0f0
Binary files /dev/null and b/ParJavalette.hi differ
diff --git a/ParJavalette.hs b/ParJavalette.hs
new file mode 100644
index 0000000..277e926
--- /dev/null
+++ b/ParJavalette.hs
@@ -0,0 +1,1214 @@
+{-# OPTIONS_GHC -fno-warn-overlapping-patterns #-}
+{-# OPTIONS -fglasgow-exts -cpp #-}
+{-# OPTIONS -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-}
+module ParJavalette where
+import AbsJavalette
+import LexJavalette
+import ErrM
+#if __GLASGOW_HASKELL__ >= 503
+import qualified Data.Array as Happy_Data_Array
+#else
+import qualified Array as Happy_Data_Array
+#endif
+#if __GLASGOW_HASKELL__ >= 503
+import qualified GHC.Exts as Happy_GHC_Exts
+#else
+import qualified GlaExts as Happy_GHC_Exts
+#endif
+
+-- parser produced by Happy Version 1.18.4
+
+newtype HappyAbsSyn  = HappyAbsSyn HappyAny
+#if __GLASGOW_HASKELL__ >= 607
+type HappyAny = Happy_GHC_Exts.Any
+#else
+type HappyAny = forall a . a
+#endif
+happyIn4 :: (Ident) -> (HappyAbsSyn )
+happyIn4 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn4 #-}
+happyOut4 :: (HappyAbsSyn ) -> (Ident)
+happyOut4 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut4 #-}
+happyIn5 :: (Integer) -> (HappyAbsSyn )
+happyIn5 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn5 #-}
+happyOut5 :: (HappyAbsSyn ) -> (Integer)
+happyOut5 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut5 #-}
+happyIn6 :: (Double) -> (HappyAbsSyn )
+happyIn6 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn6 #-}
+happyOut6 :: (HappyAbsSyn ) -> (Double)
+happyOut6 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut6 #-}
+happyIn7 :: (String) -> (HappyAbsSyn )
+happyIn7 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn7 #-}
+happyOut7 :: (HappyAbsSyn ) -> (String)
+happyOut7 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut7 #-}
+happyIn8 :: (Program) -> (HappyAbsSyn )
+happyIn8 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn8 #-}
+happyOut8 :: (HappyAbsSyn ) -> (Program)
+happyOut8 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut8 #-}
+happyIn9 :: (TopDef) -> (HappyAbsSyn )
+happyIn9 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn9 #-}
+happyOut9 :: (HappyAbsSyn ) -> (TopDef)
+happyOut9 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut9 #-}
+happyIn10 :: ([TopDef]) -> (HappyAbsSyn )
+happyIn10 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn10 #-}
+happyOut10 :: (HappyAbsSyn ) -> ([TopDef])
+happyOut10 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut10 #-}
+happyIn11 :: (Arg) -> (HappyAbsSyn )
+happyIn11 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn11 #-}
+happyOut11 :: (HappyAbsSyn ) -> (Arg)
+happyOut11 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut11 #-}
+happyIn12 :: ([Arg]) -> (HappyAbsSyn )
+happyIn12 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn12 #-}
+happyOut12 :: (HappyAbsSyn ) -> ([Arg])
+happyOut12 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut12 #-}
+happyIn13 :: (Block) -> (HappyAbsSyn )
+happyIn13 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn13 #-}
+happyOut13 :: (HappyAbsSyn ) -> (Block)
+happyOut13 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut13 #-}
+happyIn14 :: ([Stmt]) -> (HappyAbsSyn )
+happyIn14 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn14 #-}
+happyOut14 :: (HappyAbsSyn ) -> ([Stmt])
+happyOut14 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut14 #-}
+happyIn15 :: (Stmt) -> (HappyAbsSyn )
+happyIn15 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn15 #-}
+happyOut15 :: (HappyAbsSyn ) -> (Stmt)
+happyOut15 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut15 #-}
+happyIn16 :: (Item) -> (HappyAbsSyn )
+happyIn16 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn16 #-}
+happyOut16 :: (HappyAbsSyn ) -> (Item)
+happyOut16 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut16 #-}
+happyIn17 :: ([Item]) -> (HappyAbsSyn )
+happyIn17 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn17 #-}
+happyOut17 :: (HappyAbsSyn ) -> ([Item])
+happyOut17 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut17 #-}
+happyIn18 :: (Type) -> (HappyAbsSyn )
+happyIn18 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn18 #-}
+happyOut18 :: (HappyAbsSyn ) -> (Type)
+happyOut18 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut18 #-}
+happyIn19 :: ([Type]) -> (HappyAbsSyn )
+happyIn19 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn19 #-}
+happyOut19 :: (HappyAbsSyn ) -> ([Type])
+happyOut19 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut19 #-}
+happyIn20 :: (Expr) -> (HappyAbsSyn )
+happyIn20 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn20 #-}
+happyOut20 :: (HappyAbsSyn ) -> (Expr)
+happyOut20 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut20 #-}
+happyIn21 :: (Expr) -> (HappyAbsSyn )
+happyIn21 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn21 #-}
+happyOut21 :: (HappyAbsSyn ) -> (Expr)
+happyOut21 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut21 #-}
+happyIn22 :: (Expr) -> (HappyAbsSyn )
+happyIn22 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn22 #-}
+happyOut22 :: (HappyAbsSyn ) -> (Expr)
+happyOut22 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut22 #-}
+happyIn23 :: (Expr) -> (HappyAbsSyn )
+happyIn23 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn23 #-}
+happyOut23 :: (HappyAbsSyn ) -> (Expr)
+happyOut23 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut23 #-}
+happyIn24 :: (Expr) -> (HappyAbsSyn )
+happyIn24 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn24 #-}
+happyOut24 :: (HappyAbsSyn ) -> (Expr)
+happyOut24 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut24 #-}
+happyIn25 :: (Expr) -> (HappyAbsSyn )
+happyIn25 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn25 #-}
+happyOut25 :: (HappyAbsSyn ) -> (Expr)
+happyOut25 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut25 #-}
+happyIn26 :: (Expr) -> (HappyAbsSyn )
+happyIn26 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn26 #-}
+happyOut26 :: (HappyAbsSyn ) -> (Expr)
+happyOut26 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut26 #-}
+happyIn27 :: ([Expr]) -> (HappyAbsSyn )
+happyIn27 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn27 #-}
+happyOut27 :: (HappyAbsSyn ) -> ([Expr])
+happyOut27 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut27 #-}
+happyIn28 :: (AddOp) -> (HappyAbsSyn )
+happyIn28 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn28 #-}
+happyOut28 :: (HappyAbsSyn ) -> (AddOp)
+happyOut28 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut28 #-}
+happyIn29 :: (MulOp) -> (HappyAbsSyn )
+happyIn29 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn29 #-}
+happyOut29 :: (HappyAbsSyn ) -> (MulOp)
+happyOut29 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut29 #-}
+happyIn30 :: (RelOp) -> (HappyAbsSyn )
+happyIn30 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyIn30 #-}
+happyOut30 :: (HappyAbsSyn ) -> (RelOp)
+happyOut30 x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOut30 #-}
+happyInTok :: (Token) -> (HappyAbsSyn )
+happyInTok x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyInTok #-}
+happyOutTok :: (HappyAbsSyn ) -> (Token)
+happyOutTok x = Happy_GHC_Exts.unsafeCoerce# x
+{-# INLINE happyOutTok #-}
+
+
+happyActOffsets :: HappyAddr
+happyActOffsets = HappyA# "\x4e\x00\xa3\x00\x00\x00\x8f\x00\x4e\x00\x00\x00\x92\x00\x00\x00\x00\x00\x00\x00\x00\x00\xb0\x00\x00\x00\x4e\x00\xaf\x00\xae\x00\x8c\x00\x00\x00\xab\x00\x4e\x00\x00\x00\x00\x00\x00\x00\x01\x00\x78\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7e\x00\x00\x00\x00\x00\x05\x00\xfa\xff\x1f\x00\x95\x00\x97\x00\x4d\x00\x00\x00\x00\x00\x3f\x00\x3f\x00\x00\x00\x9a\x00\x31\x00\x00\x00\x96\x00\x00\x00\x00\x00\x00\x00\x4d\x00\x79\x00\x94\x00\x00\x00\x4d\x00\x00\x00\x00\x00\x80\x00\x00\x00\x4d\x00\x4d\x00\x4d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x4d\x00\x00\x00\x00\x00\x4d\x00\x00\x00\x00\x00\x00\x00\x71\x00\x74\x00\x67\x00\x4d\x00\x4d\x00\x64\x00\x63\x00\x00\x00\x00\x00\x5a\x00\x56\x00\x5d\x00\x00\x00\x2f\x00\x4d\x00\x00\x00\x05\x00\x00\x00\xfa\xff\x00\x00\x00\x00\x59\x00\x00\x00\x50\x00\x26\x00\x26\x00\x00\x00\x00\x00\x00\x00\x4d\x00\x00\x00\x00\x00\x33\x00\x00\x00\x26\x00\x00\x00\x00\x00"#
+
+happyGotoOffsets :: HappyAddr
+happyGotoOffsets = HappyA# "\x0d\x00\x00\x00\x00\x00\x00\x00\x57\x00\x00\x00\x4f\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x91\x00\x00\x00\x00\x00\x3a\x00\x00\x00\x34\x00\x21\x00\x00\x00\x00\x00\x2e\x00\xd8\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x08\x00\x00\x00\x00\x00\x20\x00\xf6\xff\xf3\xff\x00\x00\x00\x00\x49\x01\x00\x00\x00\x00\x83\x01\x72\x01\x00\x00\x00\x00\x32\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2b\x01\x00\x00\x00\x00\x00\x00\x14\x01\x00\x00\x00\x00\x00\x00\x00\x00\x0d\x01\x66\x01\x50\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x6a\x01\x00\x00\x00\x00\x6e\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x7b\x00\xf6\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x03\x00\xef\x00\x00\x00\xf0\xff\x00\x00\xe9\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\xc1\x00\xaa\x00\x00\x00\x00\x00\x00\x00\x73\x00\x00\x00\x00\x00\x00\x00\x00\x00\x93\x00\x00\x00\x00\x00"#
+
+happyDefActions :: HappyAddr
+happyDefActions = HappyA# "\x00\x00\x00\x00\xfe\xff\x00\x00\xf8\xff\xfa\xff\x00\x00\xdd\xff\xde\xff\xdf\xff\xdc\xff\x00\x00\xf7\xff\xf5\xff\xf4\xff\x00\x00\x00\x00\xf6\xff\x00\x00\xf5\xff\xf3\xff\xf9\xff\xf1\xff\x00\x00\xd8\xff\xd7\xff\xd6\xff\xd2\xff\xee\xff\xf0\xff\x00\x00\xce\xff\xcc\xff\xca\xff\xc8\xff\xc6\xff\xc4\xff\x00\x00\x00\x00\xf2\xff\xef\xff\x00\x00\x00\x00\xd4\xff\x00\x00\x00\x00\xd5\xff\x00\x00\xfd\xff\xfc\xff\xfb\xff\x00\x00\xd8\xff\x00\x00\xe8\xff\x00\x00\xcf\xff\xd0\xff\x00\x00\xe4\xff\x00\x00\x00\x00\x00\x00\xbb\xff\xb9\xff\xba\xff\xb8\xff\xb7\xff\xb6\xff\x00\x00\xbf\xff\xc0\xff\x00\x00\xbe\xff\xbd\xff\xbc\xff\xe3\xff\xe1\xff\x00\x00\xc3\xff\x00\x00\x00\x00\x00\x00\xea\xff\xeb\xff\x00\x00\xc2\xff\x00\x00\xed\xff\x00\x00\x00\x00\xcd\xff\xcb\xff\xc7\xff\xc9\xff\xc5\xff\xd1\xff\x00\x00\xe9\xff\x00\x00\x00\x00\x00\x00\xe2\xff\xe0\xff\xd3\xff\xc3\xff\xec\xff\xc1\xff\xe7\xff\xe5\xff\x00\x00\xe6\xff"#
+
+happyCheck :: HappyAddr
+happyCheck = HappyA# "\xff\xff\x18\x00\x01\x00\x00\x00\x0a\x00\x04\x00\x05\x00\x06\x00\x00\x00\x19\x00\x10\x00\x0a\x00\x0b\x00\x1a\x00\x18\x00\x0c\x00\x0d\x00\x04\x00\x05\x00\x06\x00\x0c\x00\x0d\x00\x11\x00\x12\x00\x13\x00\x18\x00\x19\x00\x0e\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x01\x00\x07\x00\x08\x00\x04\x00\x0c\x00\x06\x00\x0e\x00\x0f\x00\x0e\x00\x0a\x00\x0b\x00\x01\x00\x14\x00\x15\x00\x16\x00\x17\x00\x06\x00\x0a\x00\x19\x00\x00\x00\x0a\x00\x0b\x00\x09\x00\x18\x00\x19\x00\x01\x00\x1b\x00\x1c\x00\x1d\x00\x1e\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x1b\x00\x1a\x00\x01\x00\x00\x00\x1f\x00\x22\x00\x02\x00\x22\x00\x23\x00\x24\x00\x25\x00\x0a\x00\x0b\x00\x03\x00\x1b\x00\x02\x00\x05\x00\x06\x00\x1f\x00\x02\x00\x06\x00\x22\x00\x23\x00\x24\x00\x25\x00\x0e\x00\x18\x00\x19\x00\x1b\x00\x06\x00\x06\x00\x1d\x00\x1f\x00\x06\x00\x20\x00\x22\x00\x23\x00\x24\x00\x25\x00\x00\x00\x01\x00\x02\x00\x03\x00\x03\x00\x07\x00\x01\x00\x01\x00\x00\x00\x01\x00\x02\x00\x03\x00\x07\x00\x08\x00\x09\x00\x02\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x17\x00\x00\x00\x01\x00\x02\x00\x03\x00\x01\x00\x07\x00\x08\x00\x06\x00\x01\x00\x09\x00\x06\x00\x0b\x00\x0e\x00\x22\x00\x0e\x00\x0d\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x00\x00\x01\x00\x02\x00\x03\x00\x22\x00\x04\x00\x02\x00\x01\x00\x03\x00\x09\x00\x22\x00\x0b\x00\x27\x00\xff\xff\x0e\x00\xff\xff\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x00\x00\x01\x00\x02\x00\x03\x00\x22\x00\xff\xff\xff\xff\xff\xff\xff\xff\x09\x00\xff\xff\x0b\x00\xff\xff\xff\xff\x0e\x00\xff\xff\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x09\x00\xff\xff\x0b\x00\xff\xff\xff\xff\x0e\x00\xff\xff\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x16\x00\x10\x00\x11\x00\x12\x00\x13\x00\x14\x00\x15\x00\x00\x00\x01\x00\x02\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x00\x00\x01\x00\x02\x00\x03\x00\x10\x00\x11\x00\x12\x00\x13\x00\x10\x00\x11\x00\x12\x00\xff\xff\x10\x00\x11\x00\xff\xff\xff\xff\x10\x00\x00\x00\x01\x00\x02\x00\x03\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x10\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"#
+
+happyTable :: HappyAddr
+happyTable = HappyA# "\x00\x00\x45\x00\x27\x00\x4c\x00\x47\x00\x17\x00\x28\x00\x29\x00\x4c\x00\x48\x00\x48\x00\x2a\x00\x2b\x00\x3d\x00\x45\x00\x4d\x00\x67\x00\x03\x00\x04\x00\x05\x00\x4d\x00\x4e\x00\x4a\x00\x4b\x00\x4c\x00\x08\x00\x09\x00\x06\x00\x2c\x00\x2d\x00\x0a\x00\x2e\x00\x2f\x00\x0b\x00\x30\x00\x03\x00\x31\x00\x32\x00\x33\x00\x27\x00\x0e\x00\x14\x00\x17\x00\x3f\x00\x29\x00\x40\x00\x41\x00\x10\x00\x2a\x00\x2b\x00\x27\x00\x42\x00\x43\x00\x44\x00\x45\x00\x37\x00\x17\x00\x48\x00\x11\x00\x2a\x00\x2b\x00\x15\x00\x08\x00\x09\x00\x27\x00\x2c\x00\x2d\x00\x0a\x00\x2e\x00\x2f\x00\x0b\x00\x30\x00\x03\x00\x31\x00\x32\x00\x33\x00\x2c\x00\x6f\x00\x27\x00\x0b\x00\x2f\x00\x03\x00\x65\x00\x03\x00\x31\x00\x32\x00\x33\x00\x2a\x00\x2b\x00\x6a\x00\x2c\x00\x66\x00\x04\x00\x0c\x00\x2f\x00\x69\x00\x6b\x00\x03\x00\x31\x00\x32\x00\x33\x00\x06\x00\x08\x00\x09\x00\x2c\x00\x54\x00\x55\x00\x0a\x00\x2f\x00\x59\x00\x0b\x00\x03\x00\x31\x00\x32\x00\x33\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x5a\x00\x5b\x00\x50\x00\x50\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x51\x00\x52\x00\x53\x00\x61\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x56\x00\x6b\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x56\x00\x57\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x34\x00\x0e\x00\x0f\x00\x63\x00\x38\x00\x1c\x00\x3c\x00\x6f\x00\x10\x00\x03\x00\x1e\x00\x3d\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x03\x00\x17\x00\x13\x00\x0e\x00\x14\x00\x1c\x00\x03\x00\x6c\x00\xff\xff\x00\x00\x1e\x00\x00\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1c\x00\x00\x00\x6d\x00\x00\x00\x00\x00\x1e\x00\x00\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x18\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1c\x00\x00\x00\x1d\x00\x00\x00\x00\x00\x1e\x00\x00\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x25\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x66\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x55\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x5f\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x61\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x63\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x35\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x24\x00\x3a\x00\x1f\x00\x20\x00\x21\x00\x22\x00\x23\x00\x5d\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x1f\x00\x20\x00\x21\x00\x5e\x00\x1f\x00\x20\x00\x5c\x00\x00\x00\x1f\x00\x5b\x00\x00\x00\x00\x00\x38\x00\x34\x00\x19\x00\x1a\x00\x1b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x39\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"#
+
+happyReduceArr = Happy_Data_Array.array (1, 73) [
+	(1 , happyReduce_1),
+	(2 , happyReduce_2),
+	(3 , happyReduce_3),
+	(4 , happyReduce_4),
+	(5 , happyReduce_5),
+	(6 , happyReduce_6),
+	(7 , happyReduce_7),
+	(8 , happyReduce_8),
+	(9 , happyReduce_9),
+	(10 , happyReduce_10),
+	(11 , happyReduce_11),
+	(12 , happyReduce_12),
+	(13 , happyReduce_13),
+	(14 , happyReduce_14),
+	(15 , happyReduce_15),
+	(16 , happyReduce_16),
+	(17 , happyReduce_17),
+	(18 , happyReduce_18),
+	(19 , happyReduce_19),
+	(20 , happyReduce_20),
+	(21 , happyReduce_21),
+	(22 , happyReduce_22),
+	(23 , happyReduce_23),
+	(24 , happyReduce_24),
+	(25 , happyReduce_25),
+	(26 , happyReduce_26),
+	(27 , happyReduce_27),
+	(28 , happyReduce_28),
+	(29 , happyReduce_29),
+	(30 , happyReduce_30),
+	(31 , happyReduce_31),
+	(32 , happyReduce_32),
+	(33 , happyReduce_33),
+	(34 , happyReduce_34),
+	(35 , happyReduce_35),
+	(36 , happyReduce_36),
+	(37 , happyReduce_37),
+	(38 , happyReduce_38),
+	(39 , happyReduce_39),
+	(40 , happyReduce_40),
+	(41 , happyReduce_41),
+	(42 , happyReduce_42),
+	(43 , happyReduce_43),
+	(44 , happyReduce_44),
+	(45 , happyReduce_45),
+	(46 , happyReduce_46),
+	(47 , happyReduce_47),
+	(48 , happyReduce_48),
+	(49 , happyReduce_49),
+	(50 , happyReduce_50),
+	(51 , happyReduce_51),
+	(52 , happyReduce_52),
+	(53 , happyReduce_53),
+	(54 , happyReduce_54),
+	(55 , happyReduce_55),
+	(56 , happyReduce_56),
+	(57 , happyReduce_57),
+	(58 , happyReduce_58),
+	(59 , happyReduce_59),
+	(60 , happyReduce_60),
+	(61 , happyReduce_61),
+	(62 , happyReduce_62),
+	(63 , happyReduce_63),
+	(64 , happyReduce_64),
+	(65 , happyReduce_65),
+	(66 , happyReduce_66),
+	(67 , happyReduce_67),
+	(68 , happyReduce_68),
+	(69 , happyReduce_69),
+	(70 , happyReduce_70),
+	(71 , happyReduce_71),
+	(72 , happyReduce_72),
+	(73 , happyReduce_73)
+	]
+
+happy_n_terms = 40 :: Int
+happy_n_nonterms = 27 :: Int
+
+happyReduce_1 = happySpecReduce_1  0# happyReduction_1
+happyReduction_1 happy_x_1
+	 =  case happyOutTok happy_x_1 of { (PT _ (TV happy_var_1)) -> 
+	happyIn4
+		 (Ident happy_var_1
+	)}
+
+happyReduce_2 = happySpecReduce_1  1# happyReduction_2
+happyReduction_2 happy_x_1
+	 =  case happyOutTok happy_x_1 of { (PT _ (TI happy_var_1)) -> 
+	happyIn5
+		 ((read happy_var_1) :: Integer
+	)}
+
+happyReduce_3 = happySpecReduce_1  2# happyReduction_3
+happyReduction_3 happy_x_1
+	 =  case happyOutTok happy_x_1 of { (PT _ (TD happy_var_1)) -> 
+	happyIn6
+		 ((read happy_var_1) :: Double
+	)}
+
+happyReduce_4 = happySpecReduce_1  3# happyReduction_4
+happyReduction_4 happy_x_1
+	 =  case happyOutTok happy_x_1 of { (PT _ (TL happy_var_1)) -> 
+	happyIn7
+		 (happy_var_1
+	)}
+
+happyReduce_5 = happySpecReduce_1  4# happyReduction_5
+happyReduction_5 happy_x_1
+	 =  case happyOut10 happy_x_1 of { happy_var_1 -> 
+	happyIn8
+		 (Program happy_var_1
+	)}
+
+happyReduce_6 = happyReduce 6# 5# happyReduction_6
+happyReduction_6 (happy_x_6 `HappyStk`
+	happy_x_5 `HappyStk`
+	happy_x_4 `HappyStk`
+	happy_x_3 `HappyStk`
+	happy_x_2 `HappyStk`
+	happy_x_1 `HappyStk`
+	happyRest)
+	 = case happyOut18 happy_x_1 of { happy_var_1 -> 
+	case happyOut4 happy_x_2 of { happy_var_2 -> 
+	case happyOut12 happy_x_4 of { happy_var_4 -> 
+	case happyOut13 happy_x_6 of { happy_var_6 -> 
+	happyIn9
+		 (FnDef happy_var_1 happy_var_2 happy_var_4 happy_var_6
+	) `HappyStk` happyRest}}}}
+
+happyReduce_7 = happySpecReduce_1  6# happyReduction_7
+happyReduction_7 happy_x_1
+	 =  case happyOut9 happy_x_1 of { happy_var_1 -> 
+	happyIn10
+		 ((:[]) happy_var_1
+	)}
+
+happyReduce_8 = happySpecReduce_2  6# happyReduction_8
+happyReduction_8 happy_x_2
+	happy_x_1
+	 =  case happyOut9 happy_x_1 of { happy_var_1 -> 
+	case happyOut10 happy_x_2 of { happy_var_2 -> 
+	happyIn10
+		 ((:) happy_var_1 happy_var_2
+	)}}
+
+happyReduce_9 = happySpecReduce_2  7# happyReduction_9
+happyReduction_9 happy_x_2
+	happy_x_1
+	 =  case happyOut18 happy_x_1 of { happy_var_1 -> 
+	case happyOut4 happy_x_2 of { happy_var_2 -> 
+	happyIn11
+		 (Arg happy_var_1 happy_var_2
+	)}}
+
+happyReduce_10 = happySpecReduce_0  8# happyReduction_10
+happyReduction_10  =  happyIn12
+		 ([]
+	)
+
+happyReduce_11 = happySpecReduce_1  8# happyReduction_11
+happyReduction_11 happy_x_1
+	 =  case happyOut11 happy_x_1 of { happy_var_1 -> 
+	happyIn12
+		 ((:[]) happy_var_1
+	)}
+
+happyReduce_12 = happySpecReduce_3  8# happyReduction_12
+happyReduction_12 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut11 happy_x_1 of { happy_var_1 -> 
+	case happyOut12 happy_x_3 of { happy_var_3 -> 
+	happyIn12
+		 ((:) happy_var_1 happy_var_3
+	)}}
+
+happyReduce_13 = happySpecReduce_3  9# happyReduction_13
+happyReduction_13 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut14 happy_x_2 of { happy_var_2 -> 
+	happyIn13
+		 (Block (reverse happy_var_2)
+	)}
+
+happyReduce_14 = happySpecReduce_0  10# happyReduction_14
+happyReduction_14  =  happyIn14
+		 ([]
+	)
+
+happyReduce_15 = happySpecReduce_2  10# happyReduction_15
+happyReduction_15 happy_x_2
+	happy_x_1
+	 =  case happyOut14 happy_x_1 of { happy_var_1 -> 
+	case happyOut15 happy_x_2 of { happy_var_2 -> 
+	happyIn14
+		 (flip (:) happy_var_1 happy_var_2
+	)}}
+
+happyReduce_16 = happySpecReduce_1  11# happyReduction_16
+happyReduction_16 happy_x_1
+	 =  happyIn15
+		 (Empty
+	)
+
+happyReduce_17 = happySpecReduce_1  11# happyReduction_17
+happyReduction_17 happy_x_1
+	 =  case happyOut13 happy_x_1 of { happy_var_1 -> 
+	happyIn15
+		 (BStmt happy_var_1
+	)}
+
+happyReduce_18 = happySpecReduce_3  11# happyReduction_18
+happyReduction_18 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut18 happy_x_1 of { happy_var_1 -> 
+	case happyOut17 happy_x_2 of { happy_var_2 -> 
+	happyIn15
+		 (Decl happy_var_1 happy_var_2
+	)}}
+
+happyReduce_19 = happyReduce 4# 11# happyReduction_19
+happyReduction_19 (happy_x_4 `HappyStk`
+	happy_x_3 `HappyStk`
+	happy_x_2 `HappyStk`
+	happy_x_1 `HappyStk`
+	happyRest)
+	 = case happyOut4 happy_x_1 of { happy_var_1 -> 
+	case happyOut26 happy_x_3 of { happy_var_3 -> 
+	happyIn15
+		 (Ass happy_var_1 happy_var_3
+	) `HappyStk` happyRest}}
+
+happyReduce_20 = happySpecReduce_3  11# happyReduction_20
+happyReduction_20 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut4 happy_x_1 of { happy_var_1 -> 
+	happyIn15
+		 (Incr happy_var_1
+	)}
+
+happyReduce_21 = happySpecReduce_3  11# happyReduction_21
+happyReduction_21 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut4 happy_x_1 of { happy_var_1 -> 
+	happyIn15
+		 (Decr happy_var_1
+	)}
+
+happyReduce_22 = happySpecReduce_3  11# happyReduction_22
+happyReduction_22 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut26 happy_x_2 of { happy_var_2 -> 
+	happyIn15
+		 (Ret happy_var_2
+	)}
+
+happyReduce_23 = happySpecReduce_2  11# happyReduction_23
+happyReduction_23 happy_x_2
+	happy_x_1
+	 =  happyIn15
+		 (VRet
+	)
+
+happyReduce_24 = happyReduce 5# 11# happyReduction_24
+happyReduction_24 (happy_x_5 `HappyStk`
+	happy_x_4 `HappyStk`
+	happy_x_3 `HappyStk`
+	happy_x_2 `HappyStk`
+	happy_x_1 `HappyStk`
+	happyRest)
+	 = case happyOut26 happy_x_3 of { happy_var_3 -> 
+	case happyOut15 happy_x_5 of { happy_var_5 -> 
+	happyIn15
+		 (Cond happy_var_3 happy_var_5
+	) `HappyStk` happyRest}}
+
+happyReduce_25 = happyReduce 7# 11# happyReduction_25
+happyReduction_25 (happy_x_7 `HappyStk`
+	happy_x_6 `HappyStk`
+	happy_x_5 `HappyStk`
+	happy_x_4 `HappyStk`
+	happy_x_3 `HappyStk`
+	happy_x_2 `HappyStk`
+	happy_x_1 `HappyStk`
+	happyRest)
+	 = case happyOut26 happy_x_3 of { happy_var_3 -> 
+	case happyOut15 happy_x_5 of { happy_var_5 -> 
+	case happyOut15 happy_x_7 of { happy_var_7 -> 
+	happyIn15
+		 (CondElse happy_var_3 happy_var_5 happy_var_7
+	) `HappyStk` happyRest}}}
+
+happyReduce_26 = happyReduce 5# 11# happyReduction_26
+happyReduction_26 (happy_x_5 `HappyStk`
+	happy_x_4 `HappyStk`
+	happy_x_3 `HappyStk`
+	happy_x_2 `HappyStk`
+	happy_x_1 `HappyStk`
+	happyRest)
+	 = case happyOut26 happy_x_3 of { happy_var_3 -> 
+	case happyOut15 happy_x_5 of { happy_var_5 -> 
+	happyIn15
+		 (While happy_var_3 happy_var_5
+	) `HappyStk` happyRest}}
+
+happyReduce_27 = happySpecReduce_2  11# happyReduction_27
+happyReduction_27 happy_x_2
+	happy_x_1
+	 =  case happyOut26 happy_x_1 of { happy_var_1 -> 
+	happyIn15
+		 (SExp happy_var_1
+	)}
+
+happyReduce_28 = happySpecReduce_1  12# happyReduction_28
+happyReduction_28 happy_x_1
+	 =  case happyOut4 happy_x_1 of { happy_var_1 -> 
+	happyIn16
+		 (NoInit happy_var_1
+	)}
+
+happyReduce_29 = happySpecReduce_3  12# happyReduction_29
+happyReduction_29 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut4 happy_x_1 of { happy_var_1 -> 
+	case happyOut26 happy_x_3 of { happy_var_3 -> 
+	happyIn16
+		 (Init happy_var_1 happy_var_3
+	)}}
+
+happyReduce_30 = happySpecReduce_1  13# happyReduction_30
+happyReduction_30 happy_x_1
+	 =  case happyOut16 happy_x_1 of { happy_var_1 -> 
+	happyIn17
+		 ((:[]) happy_var_1
+	)}
+
+happyReduce_31 = happySpecReduce_3  13# happyReduction_31
+happyReduction_31 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut16 happy_x_1 of { happy_var_1 -> 
+	case happyOut17 happy_x_3 of { happy_var_3 -> 
+	happyIn17
+		 ((:) happy_var_1 happy_var_3
+	)}}
+
+happyReduce_32 = happySpecReduce_1  14# happyReduction_32
+happyReduction_32 happy_x_1
+	 =  happyIn18
+		 (Int
+	)
+
+happyReduce_33 = happySpecReduce_1  14# happyReduction_33
+happyReduction_33 happy_x_1
+	 =  happyIn18
+		 (Doub
+	)
+
+happyReduce_34 = happySpecReduce_1  14# happyReduction_34
+happyReduction_34 happy_x_1
+	 =  happyIn18
+		 (Bool
+	)
+
+happyReduce_35 = happySpecReduce_1  14# happyReduction_35
+happyReduction_35 happy_x_1
+	 =  happyIn18
+		 (Void
+	)
+
+happyReduce_36 = happySpecReduce_0  15# happyReduction_36
+happyReduction_36  =  happyIn19
+		 ([]
+	)
+
+happyReduce_37 = happySpecReduce_1  15# happyReduction_37
+happyReduction_37 happy_x_1
+	 =  case happyOut18 happy_x_1 of { happy_var_1 -> 
+	happyIn19
+		 ((:[]) happy_var_1
+	)}
+
+happyReduce_38 = happySpecReduce_3  15# happyReduction_38
+happyReduction_38 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut18 happy_x_1 of { happy_var_1 -> 
+	case happyOut19 happy_x_3 of { happy_var_3 -> 
+	happyIn19
+		 ((:) happy_var_1 happy_var_3
+	)}}
+
+happyReduce_39 = happySpecReduce_1  16# happyReduction_39
+happyReduction_39 happy_x_1
+	 =  case happyOut4 happy_x_1 of { happy_var_1 -> 
+	happyIn20
+		 (EVar happy_var_1
+	)}
+
+happyReduce_40 = happySpecReduce_1  16# happyReduction_40
+happyReduction_40 happy_x_1
+	 =  case happyOut5 happy_x_1 of { happy_var_1 -> 
+	happyIn20
+		 (ELitInt happy_var_1
+	)}
+
+happyReduce_41 = happySpecReduce_1  16# happyReduction_41
+happyReduction_41 happy_x_1
+	 =  case happyOut6 happy_x_1 of { happy_var_1 -> 
+	happyIn20
+		 (ELitDoub happy_var_1
+	)}
+
+happyReduce_42 = happySpecReduce_1  16# happyReduction_42
+happyReduction_42 happy_x_1
+	 =  happyIn20
+		 (ELitTrue
+	)
+
+happyReduce_43 = happySpecReduce_1  16# happyReduction_43
+happyReduction_43 happy_x_1
+	 =  happyIn20
+		 (ELitFalse
+	)
+
+happyReduce_44 = happyReduce 4# 16# happyReduction_44
+happyReduction_44 (happy_x_4 `HappyStk`
+	happy_x_3 `HappyStk`
+	happy_x_2 `HappyStk`
+	happy_x_1 `HappyStk`
+	happyRest)
+	 = case happyOut4 happy_x_1 of { happy_var_1 -> 
+	case happyOut27 happy_x_3 of { happy_var_3 -> 
+	happyIn20
+		 (EApp happy_var_1 happy_var_3
+	) `HappyStk` happyRest}}
+
+happyReduce_45 = happySpecReduce_1  16# happyReduction_45
+happyReduction_45 happy_x_1
+	 =  case happyOut7 happy_x_1 of { happy_var_1 -> 
+	happyIn20
+		 (EString happy_var_1
+	)}
+
+happyReduce_46 = happySpecReduce_3  16# happyReduction_46
+happyReduction_46 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut26 happy_x_2 of { happy_var_2 -> 
+	happyIn20
+		 (happy_var_2
+	)}
+
+happyReduce_47 = happySpecReduce_2  17# happyReduction_47
+happyReduction_47 happy_x_2
+	happy_x_1
+	 =  case happyOut20 happy_x_2 of { happy_var_2 -> 
+	happyIn21
+		 (Neg happy_var_2
+	)}
+
+happyReduce_48 = happySpecReduce_2  17# happyReduction_48
+happyReduction_48 happy_x_2
+	happy_x_1
+	 =  case happyOut20 happy_x_2 of { happy_var_2 -> 
+	happyIn21
+		 (Not happy_var_2
+	)}
+
+happyReduce_49 = happySpecReduce_1  17# happyReduction_49
+happyReduction_49 happy_x_1
+	 =  case happyOut20 happy_x_1 of { happy_var_1 -> 
+	happyIn21
+		 (happy_var_1
+	)}
+
+happyReduce_50 = happySpecReduce_3  18# happyReduction_50
+happyReduction_50 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut22 happy_x_1 of { happy_var_1 -> 
+	case happyOut29 happy_x_2 of { happy_var_2 -> 
+	case happyOut21 happy_x_3 of { happy_var_3 -> 
+	happyIn22
+		 (EMul happy_var_1 happy_var_2 happy_var_3
+	)}}}
+
+happyReduce_51 = happySpecReduce_1  18# happyReduction_51
+happyReduction_51 happy_x_1
+	 =  case happyOut21 happy_x_1 of { happy_var_1 -> 
+	happyIn22
+		 (happy_var_1
+	)}
+
+happyReduce_52 = happySpecReduce_3  19# happyReduction_52
+happyReduction_52 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut23 happy_x_1 of { happy_var_1 -> 
+	case happyOut28 happy_x_2 of { happy_var_2 -> 
+	case happyOut22 happy_x_3 of { happy_var_3 -> 
+	happyIn23
+		 (EAdd happy_var_1 happy_var_2 happy_var_3
+	)}}}
+
+happyReduce_53 = happySpecReduce_1  19# happyReduction_53
+happyReduction_53 happy_x_1
+	 =  case happyOut22 happy_x_1 of { happy_var_1 -> 
+	happyIn23
+		 (happy_var_1
+	)}
+
+happyReduce_54 = happySpecReduce_3  20# happyReduction_54
+happyReduction_54 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut24 happy_x_1 of { happy_var_1 -> 
+	case happyOut30 happy_x_2 of { happy_var_2 -> 
+	case happyOut23 happy_x_3 of { happy_var_3 -> 
+	happyIn24
+		 (ERel happy_var_1 happy_var_2 happy_var_3
+	)}}}
+
+happyReduce_55 = happySpecReduce_1  20# happyReduction_55
+happyReduction_55 happy_x_1
+	 =  case happyOut23 happy_x_1 of { happy_var_1 -> 
+	happyIn24
+		 (happy_var_1
+	)}
+
+happyReduce_56 = happySpecReduce_3  21# happyReduction_56
+happyReduction_56 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut24 happy_x_1 of { happy_var_1 -> 
+	case happyOut25 happy_x_3 of { happy_var_3 -> 
+	happyIn25
+		 (EAnd happy_var_1 happy_var_3
+	)}}
+
+happyReduce_57 = happySpecReduce_1  21# happyReduction_57
+happyReduction_57 happy_x_1
+	 =  case happyOut24 happy_x_1 of { happy_var_1 -> 
+	happyIn25
+		 (happy_var_1
+	)}
+
+happyReduce_58 = happySpecReduce_3  22# happyReduction_58
+happyReduction_58 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut25 happy_x_1 of { happy_var_1 -> 
+	case happyOut26 happy_x_3 of { happy_var_3 -> 
+	happyIn26
+		 (EOr happy_var_1 happy_var_3
+	)}}
+
+happyReduce_59 = happySpecReduce_1  22# happyReduction_59
+happyReduction_59 happy_x_1
+	 =  case happyOut25 happy_x_1 of { happy_var_1 -> 
+	happyIn26
+		 (happy_var_1
+	)}
+
+happyReduce_60 = happySpecReduce_0  23# happyReduction_60
+happyReduction_60  =  happyIn27
+		 ([]
+	)
+
+happyReduce_61 = happySpecReduce_1  23# happyReduction_61
+happyReduction_61 happy_x_1
+	 =  case happyOut26 happy_x_1 of { happy_var_1 -> 
+	happyIn27
+		 ((:[]) happy_var_1
+	)}
+
+happyReduce_62 = happySpecReduce_3  23# happyReduction_62
+happyReduction_62 happy_x_3
+	happy_x_2
+	happy_x_1
+	 =  case happyOut26 happy_x_1 of { happy_var_1 -> 
+	case happyOut27 happy_x_3 of { happy_var_3 -> 
+	happyIn27
+		 ((:) happy_var_1 happy_var_3
+	)}}
+
+happyReduce_63 = happySpecReduce_1  24# happyReduction_63
+happyReduction_63 happy_x_1
+	 =  happyIn28
+		 (Plus
+	)
+
+happyReduce_64 = happySpecReduce_1  24# happyReduction_64
+happyReduction_64 happy_x_1
+	 =  happyIn28
+		 (Minus
+	)
+
+happyReduce_65 = happySpecReduce_1  25# happyReduction_65
+happyReduction_65 happy_x_1
+	 =  happyIn29
+		 (Times
+	)
+
+happyReduce_66 = happySpecReduce_1  25# happyReduction_66
+happyReduction_66 happy_x_1
+	 =  happyIn29
+		 (Div
+	)
+
+happyReduce_67 = happySpecReduce_1  25# happyReduction_67
+happyReduction_67 happy_x_1
+	 =  happyIn29
+		 (Mod
+	)
+
+happyReduce_68 = happySpecReduce_1  26# happyReduction_68
+happyReduction_68 happy_x_1
+	 =  happyIn30
+		 (LTH
+	)
+
+happyReduce_69 = happySpecReduce_1  26# happyReduction_69
+happyReduction_69 happy_x_1
+	 =  happyIn30
+		 (LE
+	)
+
+happyReduce_70 = happySpecReduce_1  26# happyReduction_70
+happyReduction_70 happy_x_1
+	 =  happyIn30
+		 (GTH
+	)
+
+happyReduce_71 = happySpecReduce_1  26# happyReduction_71
+happyReduction_71 happy_x_1
+	 =  happyIn30
+		 (GE
+	)
+
+happyReduce_72 = happySpecReduce_1  26# happyReduction_72
+happyReduction_72 happy_x_1
+	 =  happyIn30
+		 (EQU
+	)
+
+happyReduce_73 = happySpecReduce_1  26# happyReduction_73
+happyReduction_73 happy_x_1
+	 =  happyIn30
+		 (NE
+	)
+
+happyNewToken action sts stk [] =
+	happyDoAction 39# notHappyAtAll action sts stk []
+
+happyNewToken action sts stk (tk:tks) =
+	let cont i = happyDoAction i tk action sts stk tks in
+	case tk of {
+	PT _ (TS "(") -> cont 1#;
+	PT _ (TS ")") -> cont 2#;
+	PT _ (TS ",") -> cont 3#;
+	PT _ (TS "{") -> cont 4#;
+	PT _ (TS "}") -> cont 5#;
+	PT _ (TS ";") -> cont 6#;
+	PT _ (TS "=") -> cont 7#;
+	PT _ (TS "++") -> cont 8#;
+	PT _ (TS "--") -> cont 9#;
+	PT _ (TS "-") -> cont 10#;
+	PT _ (TS "!") -> cont 11#;
+	PT _ (TS "&&") -> cont 12#;
+	PT _ (TS "||") -> cont 13#;
+	PT _ (TS "<") -> cont 14#;
+	PT _ (TS ">") -> cont 15#;
+	PT _ (TS "+") -> cont 16#;
+	PT _ (TS "*") -> cont 17#;
+	PT _ (TS "/") -> cont 18#;
+	PT _ (TS "%") -> cont 19#;
+	PT _ (TS "<=") -> cont 20#;
+	PT _ (TS ">=") -> cont 21#;
+	PT _ (TS "==") -> cont 22#;
+	PT _ (TS "!=") -> cont 23#;
+	PT _ (TS "boolean") -> cont 24#;
+	PT _ (TS "double") -> cont 25#;
+	PT _ (TS "else") -> cont 26#;
+	PT _ (TS "false") -> cont 27#;
+	PT _ (TS "if") -> cont 28#;
+	PT _ (TS "int") -> cont 29#;
+	PT _ (TS "return") -> cont 30#;
+	PT _ (TS "true") -> cont 31#;
+	PT _ (TS "void") -> cont 32#;
+	PT _ (TS "while") -> cont 33#;
+	PT _ (TV happy_dollar_dollar) -> cont 34#;
+	PT _ (TI happy_dollar_dollar) -> cont 35#;
+	PT _ (TD happy_dollar_dollar) -> cont 36#;
+	PT _ (TL happy_dollar_dollar) -> cont 37#;
+	_ -> cont 38#;
+	_ -> happyError' (tk:tks)
+	}
+
+happyError_ tk tks = happyError' (tk:tks)
+
+happyThen :: () => Err a -> (a -> Err b) -> Err b
+happyThen = (thenM)
+happyReturn :: () => a -> Err a
+happyReturn = (returnM)
+happyThen1 m k tks = (thenM) m (\a -> k a tks)
+happyReturn1 :: () => a -> b -> Err a
+happyReturn1 = \a tks -> (returnM) a
+happyError' :: () => [(Token)] -> Err a
+happyError' = happyError
+
+pProgram tks = happySomeParser where
+  happySomeParser = happyThen (happyParse 0# tks) (\x -> happyReturn (happyOut8 x))
+
+happySeq = happyDontSeq
+
+
+returnM :: a -> Err a
+returnM = return
+
+thenM :: Err a -> (a -> Err b) -> Err b
+thenM = (>>=)
+
+happyError :: [Token] -> Err a
+happyError ts =
+  Bad $ "syntax error at " ++ tokenPos ts ++ 
+  case ts of
+    [] -> []
+    [Err _] -> " due to lexer error"
+    _ -> " before " ++ unwords (map prToken (take 4 ts))
+
+myLexer = tokens
+{-# LINE 1 "templates/GenericTemplate.hs" #-}
+{-# LINE 1 "templates/GenericTemplate.hs" #-}
+{-# LINE 1 "<built-in>" #-}
+{-# LINE 1 "<command line>" #-}
+{-# LINE 1 "templates/GenericTemplate.hs" #-}
+-- Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp 
+
+{-# LINE 28 "templates/GenericTemplate.hs" #-}
+
+
+data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList
+
+
+
+
+
+{-# LINE 49 "templates/GenericTemplate.hs" #-}
+
+{-# LINE 59 "templates/GenericTemplate.hs" #-}
+
+{-# LINE 68 "templates/GenericTemplate.hs" #-}
+
+infixr 9 `HappyStk`
+data HappyStk a = HappyStk a (HappyStk a)
+
+-----------------------------------------------------------------------------
+-- starting the parse
+
+happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll
+
+-----------------------------------------------------------------------------
+-- Accepting the parse
+
+-- If the current token is 0#, it means we've just accepted a partial
+-- parse (a %partial parser).  We must ignore the saved token on the top of
+-- the stack in this case.
+happyAccept 0# tk st sts (_ `HappyStk` ans `HappyStk` _) =
+	happyReturn1 ans
+happyAccept j tk st sts (HappyStk ans _) = 
+	(happyTcHack j (happyTcHack st)) (happyReturn1 ans)
+
+-----------------------------------------------------------------------------
+-- Arrays only: do the next action
+
+
+
+happyDoAction i tk st
+	= {- nothing -}
+
+
+	  case action of
+		0#		  -> {- nothing -}
+				     happyFail i tk st
+		-1# 	  -> {- nothing -}
+				     happyAccept i tk st
+		n | (n Happy_GHC_Exts.<# (0# :: Happy_GHC_Exts.Int#)) -> {- nothing -}
+
+				     (happyReduceArr Happy_Data_Array.! rule) i tk st
+				     where rule = (Happy_GHC_Exts.I# ((Happy_GHC_Exts.negateInt# ((n Happy_GHC_Exts.+# (1# :: Happy_GHC_Exts.Int#))))))
+		n		  -> {- nothing -}
+
+
+				     happyShift new_state i tk st
+				     where new_state = (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#))
+   where off    = indexShortOffAddr happyActOffsets st
+	 off_i  = (off Happy_GHC_Exts.+# i)
+	 check  = if (off_i Happy_GHC_Exts.>=# (0# :: Happy_GHC_Exts.Int#))
+			then (indexShortOffAddr happyCheck off_i Happy_GHC_Exts.==#  i)
+			else False
+ 	 action | check     = indexShortOffAddr happyTable off_i
+		| otherwise = indexShortOffAddr happyDefActions st
+
+{-# LINE 127 "templates/GenericTemplate.hs" #-}
+
+
+indexShortOffAddr (HappyA# arr) off =
+#if __GLASGOW_HASKELL__ > 500
+	Happy_GHC_Exts.narrow16Int# i
+#elif __GLASGOW_HASKELL__ == 500
+	Happy_GHC_Exts.intToInt16# i
+#else
+	Happy_GHC_Exts.iShiftRA# (Happy_GHC_Exts.iShiftL# i 16#) 16#
+#endif
+  where
+#if __GLASGOW_HASKELL__ >= 503
+	i = Happy_GHC_Exts.word2Int# (Happy_GHC_Exts.or# (Happy_GHC_Exts.uncheckedShiftL# high 8#) low)
+#else
+	i = Happy_GHC_Exts.word2Int# (Happy_GHC_Exts.or# (Happy_GHC_Exts.shiftL# high 8#) low)
+#endif
+	high = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr (off' Happy_GHC_Exts.+# 1#)))
+	low  = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr off'))
+	off' = off Happy_GHC_Exts.*# 2#
+
+
+
+
+
+data HappyAddr = HappyA# Happy_GHC_Exts.Addr#
+
+
+
+
+-----------------------------------------------------------------------------
+-- HappyState data type (not arrays)
+
+{-# LINE 170 "templates/GenericTemplate.hs" #-}
+
+-----------------------------------------------------------------------------
+-- Shifting a token
+
+happyShift new_state 0# tk st sts stk@(x `HappyStk` _) =
+     let i = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in
+--     trace "shifting the error token" $
+     happyDoAction i tk new_state (HappyCons (st) (sts)) (stk)
+
+happyShift new_state i tk st sts stk =
+     happyNewToken new_state (HappyCons (st) (sts)) ((happyInTok (tk))`HappyStk`stk)
+
+-- happyReduce is specialised for the common cases.
+
+happySpecReduce_0 i fn 0# tk st sts stk
+     = happyFail 0# tk st sts stk
+happySpecReduce_0 nt fn j tk st@((action)) sts stk
+     = happyGoto nt j tk st (HappyCons (st) (sts)) (fn `HappyStk` stk)
+
+happySpecReduce_1 i fn 0# tk st sts stk
+     = happyFail 0# tk st sts stk
+happySpecReduce_1 nt fn j tk _ sts@((HappyCons (st@(action)) (_))) (v1`HappyStk`stk')
+     = let r = fn v1 in
+       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
+
+happySpecReduce_2 i fn 0# tk st sts stk
+     = happyFail 0# tk st sts stk
+happySpecReduce_2 nt fn j tk _ (HappyCons (_) (sts@((HappyCons (st@(action)) (_))))) (v1`HappyStk`v2`HappyStk`stk')
+     = let r = fn v1 v2 in
+       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
+
+happySpecReduce_3 i fn 0# tk st sts stk
+     = happyFail 0# tk st sts stk
+happySpecReduce_3 nt fn j tk _ (HappyCons (_) ((HappyCons (_) (sts@((HappyCons (st@(action)) (_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk')
+     = let r = fn v1 v2 v3 in
+       happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk'))
+
+happyReduce k i fn 0# tk st sts stk
+     = happyFail 0# tk st sts stk
+happyReduce k nt fn j tk st sts stk
+     = case happyDrop (k Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) sts of
+	 sts1@((HappyCons (st1@(action)) (_))) ->
+        	let r = fn stk in  -- it doesn't hurt to always seq here...
+       		happyDoSeq r (happyGoto nt j tk st1 sts1 r)
+
+happyMonadReduce k nt fn 0# tk st sts stk
+     = happyFail 0# tk st sts stk
+happyMonadReduce k nt fn j tk st sts stk =
+        happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk))
+       where sts1@((HappyCons (st1@(action)) (_))) = happyDrop k (HappyCons (st) (sts))
+             drop_stk = happyDropStk k stk
+
+happyMonad2Reduce k nt fn 0# tk st sts stk
+     = happyFail 0# tk st sts stk
+happyMonad2Reduce k nt fn j tk st sts stk =
+       happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk))
+       where sts1@((HappyCons (st1@(action)) (_))) = happyDrop k (HappyCons (st) (sts))
+             drop_stk = happyDropStk k stk
+
+             off    = indexShortOffAddr happyGotoOffsets st1
+             off_i  = (off Happy_GHC_Exts.+# nt)
+             new_state = indexShortOffAddr happyTable off_i
+
+
+
+
+happyDrop 0# l = l
+happyDrop n (HappyCons (_) (t)) = happyDrop (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) t
+
+happyDropStk 0# l = l
+happyDropStk n (x `HappyStk` xs) = happyDropStk (n Happy_GHC_Exts.-# (1#::Happy_GHC_Exts.Int#)) xs
+
+-----------------------------------------------------------------------------
+-- Moving to a new state after a reduction
+
+
+happyGoto nt j tk st = 
+   {- nothing -}
+   happyDoAction j tk new_state
+   where off    = indexShortOffAddr happyGotoOffsets st
+	 off_i  = (off Happy_GHC_Exts.+# nt)
+ 	 new_state = indexShortOffAddr happyTable off_i
+
+
+
+
+-----------------------------------------------------------------------------
+-- Error recovery (0# is the error token)
+
+-- parse error if we are in recovery and we fail again
+happyFail  0# tk old_st _ stk =
+--	trace "failing" $ 
+    	happyError_ tk
+
+{-  We don't need state discarding for our restricted implementation of
+    "error".  In fact, it can cause some bogus parses, so I've disabled it
+    for now --SDM
+
+-- discard a state
+happyFail  0# tk old_st (HappyCons ((action)) (sts)) 
+						(saved_tok `HappyStk` _ `HappyStk` stk) =
+--	trace ("discarding state, depth " ++ show (length stk))  $
+	happyDoAction 0# tk action sts ((saved_tok`HappyStk`stk))
+-}
+
+-- Enter error recovery: generate an error token,
+--                       save the old token and carry on.
+happyFail  i tk (action) sts stk =
+--      trace "entering error recovery" $
+	happyDoAction 0# tk action sts ( (Happy_GHC_Exts.unsafeCoerce# (Happy_GHC_Exts.I# (i))) `HappyStk` stk)
+
+-- Internal happy errors:
+
+notHappyAtAll = error "Internal Happy error\n"
+
+-----------------------------------------------------------------------------
+-- Hack to get the typechecker to accept our action functions
+
+
+happyTcHack :: Happy_GHC_Exts.Int# -> a -> a
+happyTcHack x y = y
+{-# INLINE happyTcHack #-}
+
+
+-----------------------------------------------------------------------------
+-- Seq-ing.  If the --strict flag is given, then Happy emits 
+--	happySeq = happyDoSeq
+-- otherwise it emits
+-- 	happySeq = happyDontSeq
+
+happyDoSeq, happyDontSeq :: a -> b -> b
+happyDoSeq   a b = a `seq` b
+happyDontSeq a b = b
+
+-----------------------------------------------------------------------------
+-- Don't inline any functions from the template.  GHC has a nasty habit
+-- of deciding to inline happyGoto everywhere, which increases the size of
+-- the generated parser quite a bit.
+
+
+{-# NOINLINE happyDoAction #-}
+{-# NOINLINE happyTable #-}
+{-# NOINLINE happyCheck #-}
+{-# NOINLINE happyActOffsets #-}
+{-# NOINLINE happyGotoOffsets #-}
+{-# NOINLINE happyDefActions #-}
+
+{-# NOINLINE happyShift #-}
+{-# NOINLINE happySpecReduce_0 #-}
+{-# NOINLINE happySpecReduce_1 #-}
+{-# NOINLINE happySpecReduce_2 #-}
+{-# NOINLINE happySpecReduce_3 #-}
+{-# NOINLINE happyReduce #-}
+{-# NOINLINE happyMonadReduce #-}
+{-# NOINLINE happyGoto #-}
+{-# NOINLINE happyFail #-}
+
+-- end of Happy Template.
diff --git a/ParJavalette.o b/ParJavalette.o
new file mode 100644
index 0000000..1b89752
Binary files /dev/null and b/ParJavalette.o differ
diff --git a/ParJavalette.y b/ParJavalette.y
new file mode 100644
index 0000000..ab8f3f1
--- /dev/null
+++ b/ParJavalette.y
@@ -0,0 +1,222 @@
+-- This Happy file was machine-generated by the BNF converter
+{
+{-# OPTIONS -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-}
+module ParJavalette where
+import AbsJavalette
+import LexJavalette
+import ErrM
+}
+
+%name pProgram Program
+
+-- no lexer declaration
+%monad { Err } { thenM } { returnM }
+%tokentype { Token }
+
+%token 
+ '(' { PT _ (TS "(") }
+ ')' { PT _ (TS ")") }
+ ',' { PT _ (TS ",") }
+ '{' { PT _ (TS "{") }
+ '}' { PT _ (TS "}") }
+ ';' { PT _ (TS ";") }
+ '=' { PT _ (TS "=") }
+ '++' { PT _ (TS "++") }
+ '--' { PT _ (TS "--") }
+ '-' { PT _ (TS "-") }
+ '!' { PT _ (TS "!") }
+ '&&' { PT _ (TS "&&") }
+ '||' { PT _ (TS "||") }
+ '<' { PT _ (TS "<") }
+ '>' { PT _ (TS ">") }
+ '+' { PT _ (TS "+") }
+ '*' { PT _ (TS "*") }
+ '/' { PT _ (TS "/") }
+ '%' { PT _ (TS "%") }
+ '<=' { PT _ (TS "<=") }
+ '>=' { PT _ (TS ">=") }
+ '==' { PT _ (TS "==") }
+ '!=' { PT _ (TS "!=") }
+ 'boolean' { PT _ (TS "boolean") }
+ 'double' { PT _ (TS "double") }
+ 'else' { PT _ (TS "else") }
+ 'false' { PT _ (TS "false") }
+ 'if' { PT _ (TS "if") }
+ 'int' { PT _ (TS "int") }
+ 'return' { PT _ (TS "return") }
+ 'true' { PT _ (TS "true") }
+ 'void' { PT _ (TS "void") }
+ 'while' { PT _ (TS "while") }
+
+L_ident  { PT _ (TV $$) }
+L_integ  { PT _ (TI $$) }
+L_doubl  { PT _ (TD $$) }
+L_quoted { PT _ (TL $$) }
+L_err    { _ }
+
+
+%%
+
+Ident   :: { Ident }   : L_ident  { Ident $1 }
+Integer :: { Integer } : L_integ  { (read $1) :: Integer }
+Double  :: { Double }  : L_doubl  { (read $1) :: Double }
+String  :: { String }  : L_quoted { $1 }
+
+Program :: { Program }
+Program : ListTopDef { Program $1 } 
+
+
+TopDef :: { TopDef }
+TopDef : Type Ident '(' ListArg ')' Block { FnDef $1 $2 $4 $6 } 
+
+
+ListTopDef :: { [TopDef] }
+ListTopDef : TopDef { (:[]) $1 } 
+  | TopDef ListTopDef { (:) $1 $2 }
+
+
+Arg :: { Arg }
+Arg : Type Ident { Arg $1 $2 } 
+
+
+ListArg :: { [Arg] }
+ListArg : {- empty -} { [] } 
+  | Arg { (:[]) $1 }
+  | Arg ',' ListArg { (:) $1 $3 }
+
+
+Block :: { Block }
+Block : '{' ListStmt '}' { Block (reverse $2) } 
+
+
+ListStmt :: { [Stmt] }
+ListStmt : {- empty -} { [] } 
+  | ListStmt Stmt { flip (:) $1 $2 }
+
+
+Stmt :: { Stmt }
+Stmt : ';' { Empty } 
+  | Block { BStmt $1 }
+  | Type ListItem ';' { Decl $1 $2 }
+  | Ident '=' Expr ';' { Ass $1 $3 }
+  | Ident '++' ';' { Incr $1 }
+  | Ident '--' ';' { Decr $1 }
+  | 'return' Expr ';' { Ret $2 }
+  | 'return' ';' { VRet }
+  | 'if' '(' Expr ')' Stmt { Cond $3 $5 }
+  | 'if' '(' Expr ')' Stmt 'else' Stmt { CondElse $3 $5 $7 }
+  | 'while' '(' Expr ')' Stmt { While $3 $5 }
+  | Expr ';' { SExp $1 }
+
+
+Item :: { Item }
+Item : Ident { NoInit $1 } 
+  | Ident '=' Expr { Init $1 $3 }
+
+
+ListItem :: { [Item] }
+ListItem : Item { (:[]) $1 } 
+  | Item ',' ListItem { (:) $1 $3 }
+
+
+Type :: { Type }
+Type : 'int' { Int } 
+  | 'double' { Doub }
+  | 'boolean' { Bool }
+  | 'void' { Void }
+
+
+ListType :: { [Type] }
+ListType : {- empty -} { [] } 
+  | Type { (:[]) $1 }
+  | Type ',' ListType { (:) $1 $3 }
+
+
+Expr6 :: { Expr }
+Expr6 : Ident { EVar $1 } 
+  | Integer { ELitInt $1 }
+  | Double { ELitDoub $1 }
+  | 'true' { ELitTrue }
+  | 'false' { ELitFalse }
+  | Ident '(' ListExpr ')' { EApp $1 $3 }
+  | String { EString $1 }
+  | '(' Expr ')' { $2 }
+
+
+Expr5 :: { Expr }
+Expr5 : '-' Expr6 { Neg $2 } 
+  | '!' Expr6 { Not $2 }
+  | Expr6 { $1 }
+
+
+Expr4 :: { Expr }
+Expr4 : Expr4 MulOp Expr5 { EMul $1 $2 $3 } 
+  | Expr5 { $1 }
+
+
+Expr3 :: { Expr }
+Expr3 : Expr3 AddOp Expr4 { EAdd $1 $2 $3 } 
+  | Expr4 { $1 }
+
+
+Expr2 :: { Expr }
+Expr2 : Expr2 RelOp Expr3 { ERel $1 $2 $3 } 
+  | Expr3 { $1 }
+
+
+Expr1 :: { Expr }
+Expr1 : Expr2 '&&' Expr1 { EAnd $1 $3 } 
+  | Expr2 { $1 }
+
+
+Expr :: { Expr }
+Expr : Expr1 '||' Expr { EOr $1 $3 } 
+  | Expr1 { $1 }
+
+
+ListExpr :: { [Expr] }
+ListExpr : {- empty -} { [] } 
+  | Expr { (:[]) $1 }
+  | Expr ',' ListExpr { (:) $1 $3 }
+
+
+AddOp :: { AddOp }
+AddOp : '+' { Plus } 
+  | '-' { Minus }
+
+
+MulOp :: { MulOp }
+MulOp : '*' { Times } 
+  | '/' { Div }
+  | '%' { Mod }
+
+
+RelOp :: { RelOp }
+RelOp : '<' { LTH } 
+  | '<=' { LE }
+  | '>' { GTH }
+  | '>=' { GE }
+  | '==' { EQU }
+  | '!=' { NE }
+
+
+
+{
+
+returnM :: a -> Err a
+returnM = return
+
+thenM :: Err a -> (a -> Err b) -> Err b
+thenM = (>>=)
+
+happyError :: [Token] -> Err a
+happyError ts =
+  Bad $ "syntax error at " ++ tokenPos ts ++ 
+  case ts of
+    [] -> []
+    [Err _] -> " due to lexer error"
+    _ -> " before " ++ unwords (map prToken (take 4 ts))
+
+myLexer = tokens
+}
+
diff --git a/ParJavalette.y.bak b/ParJavalette.y.bak
new file mode 100644
index 0000000..c2d982c
--- /dev/null
+++ b/ParJavalette.y.bak
@@ -0,0 +1,222 @@
+-- This Happy file was machine-generated by the BNF converter
+{
+{-# OPTIONS -fno-warn-incomplete-patterns -fno-warn-overlapping-patterns #-}
+module ParJavalette where
+import AbsJavalette
+import LexJavalette
+import ErrM
+}
+
+%name pProgram Program
+
+-- no lexer declaration
+%monad { Err } { thenM } { returnM }
+%tokentype { Token }
+
+%token 
+ '(' { PT _ (TS "(") }
+ ')' { PT _ (TS ")") }
+ ',' { PT _ (TS ",") }
+ '{' { PT _ (TS "{") }
+ '}' { PT _ (TS "}") }
+ ';' { PT _ (TS ";") }
+ '=' { PT _ (TS "=") }
+ '++' { PT _ (TS "++") }
+ '--' { PT _ (TS "--") }
+ '-' { PT _ (TS "-") }
+ '!' { PT _ (TS "!") }
+ '&&' { PT _ (TS "&&") }
+ '||' { PT _ (TS "||") }
+ '+' { PT _ (TS "+") }
+ '*' { PT _ (TS "*") }
+ '/' { PT _ (TS "/") }
+ '%' { PT _ (TS "%") }
+ '<' { PT _ (TS "<") }
+ '<=' { PT _ (TS "<=") }
+ '>' { PT _ (TS ">") }
+ '>=' { PT _ (TS ">=") }
+ '==' { PT _ (TS "==") }
+ '!=' { PT _ (TS "!=") }
+ 'boolean' { PT _ (TS "boolean") }
+ 'double' { PT _ (TS "double") }
+ 'else' { PT _ (TS "else") }
+ 'false' { PT _ (TS "false") }
+ 'if' { PT _ (TS "if") }
+ 'int' { PT _ (TS "int") }
+ 'return' { PT _ (TS "return") }
+ 'true' { PT _ (TS "true") }
+ 'void' { PT _ (TS "void") }
+ 'while' { PT _ (TS "while") }
+
+L_ident  { PT _ (TV $$) }
+L_integ  { PT _ (TI $$) }
+L_doubl  { PT _ (TD $$) }
+L_quoted { PT _ (TL $$) }
+L_err    { _ }
+
+
+%%
+
+Ident   :: { Ident }   : L_ident  { Ident $1 }
+Integer :: { Integer } : L_integ  { (read $1) :: Integer }
+Double  :: { Double }  : L_doubl  { (read $1) :: Double }
+String  :: { String }  : L_quoted { $1 }
+
+Program :: { Program }
+Program : ListTopDef { Program $1 } 
+
+
+TopDef :: { TopDef }
+TopDef : Type Ident '(' ListArg ')' Block { FnDef $1 $2 $4 $6 } 
+
+
+ListTopDef :: { [TopDef] }
+ListTopDef : TopDef { (:[]) $1 } 
+  | TopDef ListTopDef { (:) $1 $2 }
+
+
+Arg :: { Arg }
+Arg : Type Ident { Arg $1 $2 } 
+
+
+ListArg :: { [Arg] }
+ListArg : {- empty -} { [] } 
+  | Arg { (:[]) $1 }
+  | Arg ',' ListArg { (:) $1 $3 }
+
+
+Block :: { Block }
+Block : '{' ListStmt '}' { Block (reverse $2) } 
+
+
+ListStmt :: { [Stmt] }
+ListStmt : {- empty -} { [] } 
+  | ListStmt Stmt { flip (:) $1 $2 }
+
+
+Stmt :: { Stmt }
+Stmt : ';' { Empty } 
+  | Block { BStmt $1 }
+  | Type ListItem ';' { Decl $1 $2 }
+  | Ident '=' Expr ';' { Ass $1 $3 }
+  | Ident '++' ';' { Incr $1 }
+  | Ident '--' ';' { Decr $1 }
+  | 'return' Expr ';' { Ret $2 }
+  | 'return' ';' { VRet }
+  | 'if' '(' Expr ')' Stmt { Cond $3 $5 }
+  | 'if' '(' Expr ')' Stmt 'else' Stmt { CondElse $3 $5 $7 }
+  | 'while' '(' Expr ')' Stmt { While $3 $5 }
+  | Expr ';' { SExp $1 }
+
+
+Item :: { Item }
+Item : Ident { NoInit $1 } 
+  | Ident '=' Expr { Init $1 $3 }
+
+
+ListItem :: { [Item] }
+ListItem : Item { (:[]) $1 } 
+  | Item ',' ListItem { (:) $1 $3 }
+
+
+Type :: { Type }
+Type : 'int' { Int } 
+  | 'double' { Doub }
+  | 'boolean' { Bool }
+  | 'void' { Void }
+
+
+ListType :: { [Type] }
+ListType : {- empty -} { [] } 
+  | Type { (:[]) $1 }
+  | Type ',' ListType { (:) $1 $3 }
+
+
+Expr6 :: { Expr }
+Expr6 : Ident { EVar $1 } 
+  | Integer { ELitInt $1 }
+  | Double { ELitDoub $1 }
+  | 'true' { ELitTrue }
+  | 'false' { ELitFalse }
+  | Ident '(' ListExpr ')' { EApp $1 $3 }
+  | String { EString $1 }
+  | '(' Expr ')' { $2 }
+
+
+Expr5 :: { Expr }
+Expr5 : '-' Expr6 { Neg $2 } 
+  | '!' Expr6 { Not $2 }
+  | Expr6 { $1 }
+
+
+Expr4 :: { Expr }
+Expr4 : Expr4 MulOp Expr5 { EMul $1 $2 $3 } 
+  | Expr5 { $1 }
+
+
+Expr3 :: { Expr }
+Expr3 : Expr3 AddOp Expr4 { EAdd $1 $2 $3 } 
+  | Expr4 { $1 }
+
+
+Expr2 :: { Expr }
+Expr2 : Expr2 RelOp Expr3 { ERel $1 $2 $3 } 
+  | Expr3 { $1 }
+
+
+Expr1 :: { Expr }
+Expr1 : Expr2 '&&' Expr1 { EAnd $1 $3 } 
+  | Expr2 { $1 }
+
+
+Expr :: { Expr }
+Expr : Expr1 '||' Expr { EOr $1 $3 } 
+  | Expr1 { $1 }
+
+
+ListExpr :: { [Expr] }
+ListExpr : {- empty -} { [] } 
+  | Expr { (:[]) $1 }
+  | Expr ',' ListExpr { (:) $1 $3 }
+
+
+AddOp :: { AddOp }
+AddOp : '+' { Plus } 
+  | '-' { Minus }
+
+
+MulOp :: { MulOp }
+MulOp : '*' { Times } 
+  | '/' { Div }
+  | '%' { Mod }
+
+
+RelOp :: { RelOp }
+RelOp : '<' { LTH } 
+  | '<=' { LE }
+  | '>' { GTH }
+  | '>=' { GE }
+  | '==' { EQU }
+  | '!=' { NE }
+
+
+
+{
+
+returnM :: a -> Err a
+returnM = return
+
+thenM :: Err a -> (a -> Err b) -> Err b
+thenM = (>>=)
+
+happyError :: [Token] -> Err a
+happyError ts =
+  Bad $ "syntax error at " ++ tokenPos ts ++ 
+  case ts of
+    [] -> []
+    [Err _] -> " due to lexer error"
+    _ -> " before " ++ unwords (map prToken (take 4 ts))
+
+myLexer = tokens
+}
+
diff --git a/PrintJavalette.hi b/PrintJavalette.hi
new file mode 100644
index 0000000..d936d55
Binary files /dev/null and b/PrintJavalette.hi differ
diff --git a/PrintJavalette.hs b/PrintJavalette.hs
new file mode 100644
index 0000000..fe2f07a
--- /dev/null
+++ b/PrintJavalette.hs
@@ -0,0 +1,199 @@
+{-# OPTIONS -fno-warn-incomplete-patterns #-}
+module PrintJavalette where
+
+-- pretty-printer generated by the BNF converter
+
+import AbsJavalette
+import Char
+
+-- the top-level printing method
+printTree :: Print a => a -> String
+printTree = render . prt 0
+
+type Doc = [ShowS] -> [ShowS]
+
+doc :: ShowS -> Doc
+doc = (:)
+
+render :: Doc -> String
+render d = rend 0 (map ($ "") $ d []) "" where
+  rend i ss = case ss of
+    "["      :ts -> showChar '[' . rend i ts
+    "("      :ts -> showChar '(' . rend i ts
+    "{"      :ts -> showChar '{' . new (i+1) . rend (i+1) ts
+    "}" : ";":ts -> new (i-1) . space "}" . showChar ';' . new (i-1) . rend (i-1) ts
+    "}"      :ts -> new (i-1) . showChar '}' . new (i-1) . rend (i-1) ts
+    ";"      :ts -> showChar ';' . new i . rend i ts
+    t  : "," :ts -> showString t . space "," . rend i ts
+    t  : ")" :ts -> showString t . showChar ')' . rend i ts
+    t  : "]" :ts -> showString t . showChar ']' . rend i ts
+    t        :ts -> space t . rend i ts
+    _            -> id
+  new i   = showChar '\n' . replicateS (2*i) (showChar ' ') . dropWhile isSpace
+  space t = showString t . (\s -> if null s then "" else (' ':s))
+
+parenth :: Doc -> Doc
+parenth ss = doc (showChar '(') . ss . doc (showChar ')')
+
+concatS :: [ShowS] -> ShowS
+concatS = foldr (.) id
+
+concatD :: [Doc] -> Doc
+concatD = foldr (.) id
+
+replicateS :: Int -> ShowS -> ShowS
+replicateS n f = concatS (replicate n f)
+
+-- the printer class does the job
+class Print a where
+  prt :: Int -> a -> Doc
+  prtList :: [a] -> Doc
+  prtList = concatD . map (prt 0)
+
+instance Print a => Print [a] where
+  prt _ = prtList
+
+instance Print Char where
+  prt _ s = doc (showChar '\'' . mkEsc '\'' s . showChar '\'')
+  prtList s = doc (showChar '"' . concatS (map (mkEsc '"') s) . showChar '"')
+
+mkEsc :: Char -> Char -> ShowS
+mkEsc q s = case s of
+  _ | s == q -> showChar '\\' . showChar s
+  '\\'-> showString "\\\\"
+  '\n' -> showString "\\n"
+  '\t' -> showString "\\t"
+  _ -> showChar s
+
+prPrec :: Int -> Int -> Doc -> Doc
+prPrec i j = if j<i then parenth else id
+
+
+instance Print Integer where
+  prt _ x = doc (shows x)
+
+
+instance Print Double where
+  prt _ x = doc (shows x)
+
+
+instance Print Ident where
+  prt _ (Ident i) = doc (showString i)
+
+
+
+instance Print Program where
+  prt i e = case e of
+   Program topdefs -> prPrec i 0 (concatD [prt 0 topdefs])
+
+
+instance Print TopDef where
+  prt i e = case e of
+   FnDef type' id args block -> prPrec i 0 (concatD [prt 0 type' , prt 0 id , doc (showString "(") , prt 0 args , doc (showString ")") , prt 0 block])
+
+  prtList es = case es of
+   [x] -> (concatD [prt 0 x])
+   x:xs -> (concatD [prt 0 x , prt 0 xs])
+
+instance Print Arg where
+  prt i e = case e of
+   Arg type' id -> prPrec i 0 (concatD [prt 0 type' , prt 0 id])
+
+  prtList es = case es of
+   [] -> (concatD [])
+   [x] -> (concatD [prt 0 x])
+   x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
+
+instance Print Block where
+  prt i e = case e of
+   Block stmts -> prPrec i 0 (concatD [doc (showString "{") , prt 0 stmts , doc (showString "}")])
+
+
+instance Print Stmt where
+  prt i e = case e of
+   Empty  -> prPrec i 0 (concatD [doc (showString ";")])
+   BStmt block -> prPrec i 0 (concatD [prt 0 block])
+   Decl type' items -> prPrec i 0 (concatD [prt 0 type' , prt 0 items , doc (showString ";")])
+   Ass id expr -> prPrec i 0 (concatD [prt 0 id , doc (showString "=") , prt 0 expr , doc (showString ";")])
+   Incr id -> prPrec i 0 (concatD [prt 0 id , doc (showString "++") , doc (showString ";")])
+   Decr id -> prPrec i 0 (concatD [prt 0 id , doc (showString "--") , doc (showString ";")])
+   Ret expr -> prPrec i 0 (concatD [doc (showString "return") , prt 0 expr , doc (showString ";")])
+   VRet  -> prPrec i 0 (concatD [doc (showString "return") , doc (showString ";")])
+   Cond expr stmt -> prPrec i 0 (concatD [doc (showString "if") , doc (showString "(") , prt 0 expr , doc (showString ")") , prt 0 stmt])
+   CondElse expr stmt0 stmt -> prPrec i 0 (concatD [doc (showString "if") , doc (showString "(") , prt 0 expr , doc (showString ")") , prt 0 stmt0 , doc (showString "else") , prt 0 stmt])
+   While expr stmt -> prPrec i 0 (concatD [doc (showString "while") , doc (showString "(") , prt 0 expr , doc (showString ")") , prt 0 stmt])
+   SExp expr -> prPrec i 0 (concatD [prt 0 expr , doc (showString ";")])
+
+  prtList es = case es of
+   [] -> (concatD [])
+   x:xs -> (concatD [prt 0 x , prt 0 xs])
+
+instance Print Item where
+  prt i e = case e of
+   NoInit id -> prPrec i 0 (concatD [prt 0 id])
+   Init id expr -> prPrec i 0 (concatD [prt 0 id , doc (showString "=") , prt 0 expr])
+
+  prtList es = case es of
+   [x] -> (concatD [prt 0 x])
+   x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
+
+instance Print Type where
+  prt i e = case e of
+   Int  -> prPrec i 0 (concatD [doc (showString "int")])
+   Doub  -> prPrec i 0 (concatD [doc (showString "double")])
+   Bool  -> prPrec i 0 (concatD [doc (showString "boolean")])
+   Void  -> prPrec i 0 (concatD [doc (showString "void")])
+   Fun type' types -> prPrec i 0 (concatD [prt 0 type' , doc (showString "(") , prt 0 types , doc (showString ")")])
+
+  prtList es = case es of
+   [] -> (concatD [])
+   [x] -> (concatD [prt 0 x])
+   x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
+
+instance Print Expr where
+  prt i e = case e of
+   EVar id -> prPrec i 6 (concatD [prt 0 id])
+   ELitInt n -> prPrec i 6 (concatD [prt 0 n])
+   ELitDoub d -> prPrec i 6 (concatD [prt 0 d])
+   ELitTrue  -> prPrec i 6 (concatD [doc (showString "true")])
+   ELitFalse  -> prPrec i 6 (concatD [doc (showString "false")])
+   EApp id exprs -> prPrec i 6 (concatD [prt 0 id , doc (showString "(") , prt 0 exprs , doc (showString ")")])
+   EString str -> prPrec i 6 (concatD [prt 0 str])
+   Neg expr -> prPrec i 5 (concatD [doc (showString "-") , prt 6 expr])
+   Not expr -> prPrec i 5 (concatD [doc (showString "!") , prt 6 expr])
+   EMul expr0 mulop expr -> prPrec i 4 (concatD [prt 4 expr0 , prt 0 mulop , prt 5 expr])
+   EAdd expr0 addop expr -> prPrec i 3 (concatD [prt 3 expr0 , prt 0 addop , prt 4 expr])
+   ERel expr0 relop expr -> prPrec i 2 (concatD [prt 2 expr0 , prt 0 relop , prt 3 expr])
+   EAnd expr0 expr -> prPrec i 1 (concatD [prt 2 expr0 , doc (showString "&&") , prt 1 expr])
+   EOr expr0 expr -> prPrec i 0 (concatD [prt 1 expr0 , doc (showString "||") , prt 0 expr])
+   TAnot type' expr -> prPrec i 0 (concatD [doc (showString "<") , prt 0 type' , doc (showString ">") , doc (showString "(") , prt 0 expr , doc (showString ")")])
+
+  prtList es = case es of
+   [] -> (concatD [])
+   [x] -> (concatD [prt 0 x])
+   x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
+
+instance Print AddOp where
+  prt i e = case e of
+   Plus  -> prPrec i 0 (concatD [doc (showString "+")])
+   Minus  -> prPrec i 0 (concatD [doc (showString "-")])
+
+
+instance Print MulOp where
+  prt i e = case e of
+   Times  -> prPrec i 0 (concatD [doc (showString "*")])
+   Div  -> prPrec i 0 (concatD [doc (showString "/")])
+   Mod  -> prPrec i 0 (concatD [doc (showString "%")])
+
+
+instance Print RelOp where
+  prt i e = case e of
+   LTH  -> prPrec i 0 (concatD [doc (showString "<")])
+   LE  -> prPrec i 0 (concatD [doc (showString "<=")])
+   GTH  -> prPrec i 0 (concatD [doc (showString ">")])
+   GE  -> prPrec i 0 (concatD [doc (showString ">=")])
+   EQU  -> prPrec i 0 (concatD [doc (showString "==")])
+   NE  -> prPrec i 0 (concatD [doc (showString "!=")])
+
+
+
diff --git a/PrintJavalette.hs.bak b/PrintJavalette.hs.bak
new file mode 100644
index 0000000..809db80
--- /dev/null
+++ b/PrintJavalette.hs.bak
@@ -0,0 +1,198 @@
+{-# OPTIONS -fno-warn-incomplete-patterns #-}
+module PrintJavalette where
+
+-- pretty-printer generated by the BNF converter
+
+import AbsJavalette
+import Char
+
+-- the top-level printing method
+printTree :: Print a => a -> String
+printTree = render . prt 0
+
+type Doc = [ShowS] -> [ShowS]
+
+doc :: ShowS -> Doc
+doc = (:)
+
+render :: Doc -> String
+render d = rend 0 (map ($ "") $ d []) "" where
+  rend i ss = case ss of
+    "["      :ts -> showChar '[' . rend i ts
+    "("      :ts -> showChar '(' . rend i ts
+    "{"      :ts -> showChar '{' . new (i+1) . rend (i+1) ts
+    "}" : ";":ts -> new (i-1) . space "}" . showChar ';' . new (i-1) . rend (i-1) ts
+    "}"      :ts -> new (i-1) . showChar '}' . new (i-1) . rend (i-1) ts
+    ";"      :ts -> showChar ';' . new i . rend i ts
+    t  : "," :ts -> showString t . space "," . rend i ts
+    t  : ")" :ts -> showString t . showChar ')' . rend i ts
+    t  : "]" :ts -> showString t . showChar ']' . rend i ts
+    t        :ts -> space t . rend i ts
+    _            -> id
+  new i   = showChar '\n' . replicateS (2*i) (showChar ' ') . dropWhile isSpace
+  space t = showString t . (\s -> if null s then "" else (' ':s))
+
+parenth :: Doc -> Doc
+parenth ss = doc (showChar '(') . ss . doc (showChar ')')
+
+concatS :: [ShowS] -> ShowS
+concatS = foldr (.) id
+
+concatD :: [Doc] -> Doc
+concatD = foldr (.) id
+
+replicateS :: Int -> ShowS -> ShowS
+replicateS n f = concatS (replicate n f)
+
+-- the printer class does the job
+class Print a where
+  prt :: Int -> a -> Doc
+  prtList :: [a] -> Doc
+  prtList = concatD . map (prt 0)
+
+instance Print a => Print [a] where
+  prt _ = prtList
+
+instance Print Char where
+  prt _ s = doc (showChar '\'' . mkEsc '\'' s . showChar '\'')
+  prtList s = doc (showChar '"' . concatS (map (mkEsc '"') s) . showChar '"')
+
+mkEsc :: Char -> Char -> ShowS
+mkEsc q s = case s of
+  _ | s == q -> showChar '\\' . showChar s
+  '\\'-> showString "\\\\"
+  '\n' -> showString "\\n"
+  '\t' -> showString "\\t"
+  _ -> showChar s
+
+prPrec :: Int -> Int -> Doc -> Doc
+prPrec i j = if j<i then parenth else id
+
+
+instance Print Integer where
+  prt _ x = doc (shows x)
+
+
+instance Print Double where
+  prt _ x = doc (shows x)
+
+
+instance Print Ident where
+  prt _ (Ident i) = doc (showString i)
+
+
+
+instance Print Program where
+  prt i e = case e of
+   Program topdefs -> prPrec i 0 (concatD [prt 0 topdefs])
+
+
+instance Print TopDef where
+  prt i e = case e of
+   FnDef type' id args block -> prPrec i 0 (concatD [prt 0 type' , prt 0 id , doc (showString "(") , prt 0 args , doc (showString ")") , prt 0 block])
+
+  prtList es = case es of
+   [x] -> (concatD [prt 0 x])
+   x:xs -> (concatD [prt 0 x , prt 0 xs])
+
+instance Print Arg where
+  prt i e = case e of
+   Arg type' id -> prPrec i 0 (concatD [prt 0 type' , prt 0 id])
+
+  prtList es = case es of
+   [] -> (concatD [])
+   [x] -> (concatD [prt 0 x])
+   x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
+
+instance Print Block where
+  prt i e = case e of
+   Block stmts -> prPrec i 0 (concatD [doc (showString "{") , prt 0 stmts , doc (showString "}")])
+
+
+instance Print Stmt where
+  prt i e = case e of
+   Empty  -> prPrec i 0 (concatD [doc (showString ";")])
+   BStmt block -> prPrec i 0 (concatD [prt 0 block])
+   Decl type' items -> prPrec i 0 (concatD [prt 0 type' , prt 0 items , doc (showString ";")])
+   Ass id expr -> prPrec i 0 (concatD [prt 0 id , doc (showString "=") , prt 0 expr , doc (showString ";")])
+   Incr id -> prPrec i 0 (concatD [prt 0 id , doc (showString "++") , doc (showString ";")])
+   Decr id -> prPrec i 0 (concatD [prt 0 id , doc (showString "--") , doc (showString ";")])
+   Ret expr -> prPrec i 0 (concatD [doc (showString "return") , prt 0 expr , doc (showString ";")])
+   VRet  -> prPrec i 0 (concatD [doc (showString "return") , doc (showString ";")])
+   Cond expr stmt -> prPrec i 0 (concatD [doc (showString "if") , doc (showString "(") , prt 0 expr , doc (showString ")") , prt 0 stmt])
+   CondElse expr stmt0 stmt -> prPrec i 0 (concatD [doc (showString "if") , doc (showString "(") , prt 0 expr , doc (showString ")") , prt 0 stmt0 , doc (showString "else") , prt 0 stmt])
+   While expr stmt -> prPrec i 0 (concatD [doc (showString "while") , doc (showString "(") , prt 0 expr , doc (showString ")") , prt 0 stmt])
+   SExp expr -> prPrec i 0 (concatD [prt 0 expr , doc (showString ";")])
+
+  prtList es = case es of
+   [] -> (concatD [])
+   x:xs -> (concatD [prt 0 x , prt 0 xs])
+
+instance Print Item where
+  prt i e = case e of
+   NoInit id -> prPrec i 0 (concatD [prt 0 id])
+   Init id expr -> prPrec i 0 (concatD [prt 0 id , doc (showString "=") , prt 0 expr])
+
+  prtList es = case es of
+   [x] -> (concatD [prt 0 x])
+   x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
+
+instance Print Type where
+  prt i e = case e of
+   Int  -> prPrec i 0 (concatD [doc (showString "int")])
+   Doub  -> prPrec i 0 (concatD [doc (showString "double")])
+   Bool  -> prPrec i 0 (concatD [doc (showString "boolean")])
+   Void  -> prPrec i 0 (concatD [doc (showString "void")])
+   Fun type' types -> prPrec i 0 (concatD [prt 0 type' , doc (showString "(") , prt 0 types , doc (showString ")")])
+
+  prtList es = case es of
+   [] -> (concatD [])
+   [x] -> (concatD [prt 0 x])
+   x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
+
+instance Print Expr where
+  prt i e = case e of
+   EVar id -> prPrec i 6 (concatD [prt 0 id])
+   ELitInt n -> prPrec i 6 (concatD [prt 0 n])
+   ELitDoub d -> prPrec i 6 (concatD [prt 0 d])
+   ELitTrue  -> prPrec i 6 (concatD [doc (showString "true")])
+   ELitFalse  -> prPrec i 6 (concatD [doc (showString "false")])
+   EApp id exprs -> prPrec i 6 (concatD [prt 0 id , doc (showString "(") , prt 0 exprs , doc (showString ")")])
+   EString str -> prPrec i 6 (concatD [prt 0 str])
+   Neg expr -> prPrec i 5 (concatD [doc (showString "-") , prt 6 expr])
+   Not expr -> prPrec i 5 (concatD [doc (showString "!") , prt 6 expr])
+   EMul expr0 mulop expr -> prPrec i 4 (concatD [prt 4 expr0 , prt 0 mulop , prt 5 expr])
+   EAdd expr0 addop expr -> prPrec i 3 (concatD [prt 3 expr0 , prt 0 addop , prt 4 expr])
+   ERel expr0 relop expr -> prPrec i 2 (concatD [prt 2 expr0 , prt 0 relop , prt 3 expr])
+   EAnd expr0 expr -> prPrec i 1 (concatD [prt 2 expr0 , doc (showString "&&") , prt 1 expr])
+   EOr expr0 expr -> prPrec i 0 (concatD [prt 1 expr0 , doc (showString "||") , prt 0 expr])
+
+  prtList es = case es of
+   [] -> (concatD [])
+   [x] -> (concatD [prt 0 x])
+   x:xs -> (concatD [prt 0 x , doc (showString ",") , prt 0 xs])
+
+instance Print AddOp where
+  prt i e = case e of
+   Plus  -> prPrec i 0 (concatD [doc (showString "+")])
+   Minus  -> prPrec i 0 (concatD [doc (showString "-")])
+
+
+instance Print MulOp where
+  prt i e = case e of
+   Times  -> prPrec i 0 (concatD [doc (showString "*")])
+   Div  -> prPrec i 0 (concatD [doc (showString "/")])
+   Mod  -> prPrec i 0 (concatD [doc (showString "%")])
+
+
+instance Print RelOp where
+  prt i e = case e of
+   LTH  -> prPrec i 0 (concatD [doc (showString "<")])
+   LE  -> prPrec i 0 (concatD [doc (showString "<=")])
+   GTH  -> prPrec i 0 (concatD [doc (showString ">")])
+   GE  -> prPrec i 0 (concatD [doc (showString ">=")])
+   EQU  -> prPrec i 0 (concatD [doc (showString "==")])
+   NE  -> prPrec i 0 (concatD [doc (showString "!=")])
+
+
+
diff --git a/PrintJavalette.o b/PrintJavalette.o
new file mode 100644
index 0000000..e0d9c1e
Binary files /dev/null and b/PrintJavalette.o differ
diff --git a/PrintUtils.class b/PrintUtils.class
new file mode 100644
index 0000000..22fbedd
Binary files /dev/null and b/PrintUtils.class differ
diff --git a/Runtime.class b/Runtime.class
new file mode 100644
index 0000000..1d929d6
Binary files /dev/null and b/Runtime.class differ
diff --git a/Runtime.java b/Runtime.java
new file mode 100644
index 0000000..8f61829
--- /dev/null
+++ b/Runtime.java
@@ -0,0 +1,68 @@
+import java.io.InputStreamReader;
+import java.io.BufferedReader;
+import java.io.IOException;
+
+class Runtime {
+  
+  public static void main(String [] argv) {
+    Runtime.printString("Runtime test\nWrite a int: ");
+    
+    int i = Runtime.readInt();
+    Runtime.printString("Int: ");
+    Runtime.printInt(i);
+
+    Runtime.printString("\nWrite a double: ");
+    double d = Runtime.readDouble();
+    Runtime.printString("Double: ");
+    Runtime.printDouble(d);
+    Runtime.printString("\n");
+  }
+  
+  public static void printInt(int i) {
+    System.out.print(i);
+  }
+  
+  public static void printDouble(double d) {
+    System.out.print(d);
+  }
+  
+  public static void printString(String s) {
+    System.out.print(s);
+  }
+  
+  public static int readInt() {
+    String line = null;
+    int val = 0;
+    try {
+      BufferedReader is = new BufferedReader(
+        new InputStreamReader(System.in));
+      line = is.readLine();
+      val = Integer.parseInt(line);
+    } catch (NumberFormatException ex) {
+      System.err.println("Not a valid number: " + line);
+    } catch (IOException e) {
+      System.err.println("Unexpected IO ERROR: " + e);
+    }
+    
+    return val;
+  }
+  
+  public static double readDouble() {
+    InputStreamReader convert = new InputStreamReader(System.in);
+    BufferedReader stdin = new BufferedReader(convert);
+    String instr = null;
+    double val = 0;
+
+    try {
+      instr = stdin.readLine();
+      val = new Double(instr).doubleValue();;
+    } catch(NumberFormatException ex) {
+      System.err.println("Not a valid number: " + instr);      
+    } catch(IOException e) {
+      System.err.println("Unexpected IO ERROR: " + e);
+    }
+    
+    return val;
+  }
+  
+}
\ No newline at end of file
diff --git a/SkelJavalette.hi b/SkelJavalette.hi
new file mode 100644
index 0000000..28323e3
Binary files /dev/null and b/SkelJavalette.hi differ
diff --git a/SkelJavalette.hs b/SkelJavalette.hs
new file mode 100644
index 0000000..6692e33
--- /dev/null
+++ b/SkelJavalette.hs
@@ -0,0 +1,110 @@
+module SkelJavalette where
+
+-- Haskell module generated by the BNF converter
+
+import AbsJavalette
+import ErrM
+type Result = Err String
+
+failure :: Show a => a -> Result
+failure x = Bad $ "Undefined case: " ++ show x
+
+transIdent :: Ident -> Result
+transIdent x = case x of
+  Ident str  -> failure x
+
+
+transProgram :: Program -> Result
+transProgram x = case x of
+  Program topdefs  -> failure x
+
+
+transTopDef :: TopDef -> Result
+transTopDef x = case x of
+  FnDef type' id args block  -> failure x
+
+
+transArg :: Arg -> Result
+transArg x = case x of
+  Arg type' id  -> failure x
+
+
+transBlock :: Block -> Result
+transBlock x = case x of
+  Block stmts  -> failure x
+
+
+transStmt :: Stmt -> Result
+transStmt x = case x of
+  Empty  -> failure x
+  BStmt block  -> failure x
+  Decl type' items  -> failure x
+  Ass id expr  -> failure x
+  Incr id  -> failure x
+  Decr id  -> failure x
+  Ret expr  -> failure x
+  VRet  -> failure x
+  Cond expr stmt  -> failure x
+  CondElse expr stmt0 stmt  -> failure x
+  While expr stmt  -> failure x
+  SExp expr  -> failure x
+
+
+transItem :: Item -> Result
+transItem x = case x of
+  NoInit id  -> failure x
+  Init id expr  -> failure x
+
+
+transType :: Type -> Result
+transType x = case x of
+  Int  -> failure x
+  Doub  -> failure x
+  Bool  -> failure x
+  Void  -> failure x
+  Fun type' types  -> failure x
+
+
+transExpr :: Expr -> Result
+transExpr x = case x of
+  EVar id  -> failure x
+  ELitInt n  -> failure x
+  ELitDoub d  -> failure x
+  ELitTrue  -> failure x
+  ELitFalse  -> failure x
+  EApp id exprs  -> failure x
+  EString str  -> failure x
+  Neg expr  -> failure x
+  Not expr  -> failure x
+  EMul expr0 mulop expr  -> failure x
+  EAdd expr0 addop expr  -> failure x
+  ERel expr0 relop expr  -> failure x
+  EAnd expr0 expr  -> failure x
+  EOr expr0 expr  -> failure x
+  TAnot type' expr  -> failure x
+
+
+transAddOp :: AddOp -> Result
+transAddOp x = case x of
+  Plus  -> failure x
+  Minus  -> failure x
+
+
+transMulOp :: MulOp -> Result
+transMulOp x = case x of
+  Times  -> failure x
+  Div  -> failure x
+  Mod  -> failure x
+
+
+transRelOp :: RelOp -> Result
+transRelOp x = case x of
+  LTH  -> failure x
+  LE  -> failure x
+  GTH  -> failure x
+  GE  -> failure x
+  EQU  -> failure x
+  NE  -> failure x
+
+
+
diff --git a/SkelJavalette.hs.bak b/SkelJavalette.hs.bak
new file mode 100644
index 0000000..450658a
--- /dev/null
+++ b/SkelJavalette.hs.bak
@@ -0,0 +1,109 @@
+module SkelJavalette where
+
+-- Haskell module generated by the BNF converter
+
+import AbsJavalette
+import ErrM
+type Result = Err String
+
+failure :: Show a => a -> Result
+failure x = Bad $ "Undefined case: " ++ show x
+
+transIdent :: Ident -> Result
+transIdent x = case x of
+  Ident str  -> failure x
+
+
+transProgram :: Program -> Result
+transProgram x = case x of
+  Program topdefs  -> failure x
+
+
+transTopDef :: TopDef -> Result
+transTopDef x = case x of
+  FnDef type' id args block  -> failure x
+
+
+transArg :: Arg -> Result
+transArg x = case x of
+  Arg type' id  -> failure x
+
+
+transBlock :: Block -> Result
+transBlock x = case x of
+  Block stmts  -> failure x
+
+
+transStmt :: Stmt -> Result
+transStmt x = case x of
+  Empty  -> failure x
+  BStmt block  -> failure x
+  Decl type' items  -> failure x
+  Ass id expr  -> failure x
+  Incr id  -> failure x
+  Decr id  -> failure x
+  Ret expr  -> failure x
+  VRet  -> failure x
+  Cond expr stmt  -> failure x
+  CondElse expr stmt0 stmt  -> failure x
+  While expr stmt  -> failure x
+  SExp expr  -> failure x
+
+
+transItem :: Item -> Result
+transItem x = case x of
+  NoInit id  -> failure x
+  Init id expr  -> failure x
+
+
+transType :: Type -> Result
+transType x = case x of
+  Int  -> failure x
+  Doub  -> failure x
+  Bool  -> failure x
+  Void  -> failure x
+  Fun type' types  -> failure x
+
+
+transExpr :: Expr -> Result
+transExpr x = case x of
+  EVar id  -> failure x
+  ELitInt n  -> failure x
+  ELitDoub d  -> failure x
+  ELitTrue  -> failure x
+  ELitFalse  -> failure x
+  EApp id exprs  -> failure x
+  EString str  -> failure x
+  Neg expr  -> failure x
+  Not expr  -> failure x
+  EMul expr0 mulop expr  -> failure x
+  EAdd expr0 addop expr  -> failure x
+  ERel expr0 relop expr  -> failure x
+  EAnd expr0 expr  -> failure x
+  EOr expr0 expr  -> failure x
+
+
+transAddOp :: AddOp -> Result
+transAddOp x = case x of
+  Plus  -> failure x
+  Minus  -> failure x
+
+
+transMulOp :: MulOp -> Result
+transMulOp x = case x of
+  Times  -> failure x
+  Div  -> failure x
+  Mod  -> failure x
+
+
+transRelOp :: RelOp -> Result
+transRelOp x = case x of
+  LTH  -> failure x
+  LE  -> failure x
+  GTH  -> failure x
+  GE  -> failure x
+  EQU  -> failure x
+  NE  -> failure x
+
+
+
diff --git a/SkelJavalette.o b/SkelJavalette.o
new file mode 100644
index 0000000..ec06fce
Binary files /dev/null and b/SkelJavalette.o differ
diff --git a/TestJavalette b/TestJavalette
new file mode 100755
index 0000000..5bdc9cd
Binary files /dev/null and b/TestJavalette differ
diff --git a/TestJavalette.hi b/TestJavalette.hi
new file mode 100644
index 0000000..80bdf58
Binary files /dev/null and b/TestJavalette.hi differ
diff --git a/TestJavalette.hs b/TestJavalette.hs
new file mode 100644
index 0000000..32a8cbf
--- /dev/null
+++ b/TestJavalette.hs
@@ -0,0 +1,58 @@
+-- automatically generated by BNF Converter
+module Main where
+
+
+import IO ( stdin, hGetContents )
+import System ( getArgs, getProgName )
+
+import LexJavalette
+import ParJavalette
+import SkelJavalette
+import PrintJavalette
+import AbsJavalette
+
+
+
+
+import ErrM
+
+type ParseFun a = [Token] -> Err a
+
+myLLexer = myLexer
+
+type Verbosity = Int
+
+putStrV :: Verbosity -> String -> IO ()
+putStrV v s = if v > 1 then putStrLn s else return ()
+
+runFile :: (Print a, Show a) => Verbosity -> ParseFun a -> FilePath -> IO ()
+runFile v p f = putStrLn f >> readFile f >>= run v p
+
+run :: (Print a, Show a) => Verbosity -> ParseFun a -> String -> IO ()
+run v p s = let ts = myLLexer s in case p ts of
+           Bad s    -> do putStrLn "\nParse              Failed...\n"
+                          putStrV v "Tokens:"
+                          putStrV v $ show ts
+                          putStrLn s
+           Ok  tree -> do putStrLn "\nParse Successful!"
+                          showTree v tree
+
+
+
+showTree :: (Show a, Print a) => Int -> a -> IO ()
+showTree v tree
+ = do
+      putStrV v $ "\n[Abstract Syntax]\n\n" ++ show tree
+      putStrV v $ "\n[Linearized tree]\n\n" ++ printTree tree
+
+main :: IO ()
+main = do args <- getArgs
+          case args of
+            [] -> hGetContents stdin >>= run 2 pProgram
+            "-s":fs -> mapM_ (runFile 0 pProgram) fs
+            fs -> mapM_ (runFile 2 pProgram) fs
+
+
+
+
+
diff --git a/TestJavalette.hs.bak b/TestJavalette.hs.bak
new file mode 100644
index 0000000..32a8cbf
--- /dev/null
+++ b/TestJavalette.hs.bak
@@ -0,0 +1,58 @@
+-- automatically generated by BNF Converter
+module Main where
+
+
+import IO ( stdin, hGetContents )
+import System ( getArgs, getProgName )
+
+import LexJavalette
+import ParJavalette
+import SkelJavalette
+import PrintJavalette
+import AbsJavalette
+
+
+
+
+import ErrM
+
+type ParseFun a = [Token] -> Err a
+
+myLLexer = myLexer
+
+type Verbosity = Int
+
+putStrV :: Verbosity -> String -> IO ()
+putStrV v s = if v > 1 then putStrLn s else return ()
+
+runFile :: (Print a, Show a) => Verbosity -> ParseFun a -> FilePath -> IO ()
+runFile v p f = putStrLn f >> readFile f >>= run v p
+
+run :: (Print a, Show a) => Verbosity -> ParseFun a -> String -> IO ()
+run v p s = let ts = myLLexer s in case p ts of
+           Bad s    -> do putStrLn "\nParse              Failed...\n"
+                          putStrV v "Tokens:"
+                          putStrV v $ show ts
+                          putStrLn s
+           Ok  tree -> do putStrLn "\nParse Successful!"
+                          showTree v tree
+
+
+
+showTree :: (Show a, Print a) => Int -> a -> IO ()
+showTree v tree
+ = do
+      putStrV v $ "\n[Abstract Syntax]\n\n" ++ show tree
+      putStrV v $ "\n[Linearized tree]\n\n" ++ printTree tree
+
+main :: IO ()
+main = do args <- getArgs
+          case args of
+            [] -> hGetContents stdin >>= run 2 pProgram
+            "-s":fs -> mapM_ (runFile 0 pProgram) fs
+            fs -> mapM_ (runFile 2 pProgram) fs
+
+
+
+
+
diff --git a/TestJavalette.o b/TestJavalette.o
new file mode 100644
index 0000000..8d649f9
Binary files /dev/null and b/TestJavalette.o differ
diff --git a/TypeChecker.hi b/TypeChecker.hi
new file mode 100644
index 0000000..484bfe8
Binary files /dev/null and b/TypeChecker.hi differ
diff --git a/TypeChecker.hs b/TypeChecker.hs
new file mode 100644
index 0000000..a6d97e0
--- /dev/null
+++ b/TypeChecker.hs
@@ -0,0 +1,321 @@
+module TypeChecker where
+
+import Debug.Trace
+import AbsJavalette
+import PrintJavalette
+import ErrM
+import Control.Monad.State
+import Data.List
+
+type AnotTree = [TopDef]
+type Errors = [String]
+type Env = [[(Ident, Type)]]
+type MyState = (Env, AnotTree, Errors)
+type MyStateM = State MyState
+
+
+typecheck :: Program -> Err Program
+typecheck (Program fs) = do let (at, err) = evalState (checkFuncs fs >> checkProgram fs >> getAnotTree) emptyState
+                            if err == []
+                                then return (Program at)
+                                else fail $ printTree at ++ (show err)
+
+getAnotTree :: MyStateM (AnotTree, Errors)
+getAnotTree = do (_, at, e) <- get
+                 return (at, e)
+
+checkFuncs :: [TopDef] -> MyStateM ()
+checkFuncs [] = return ()
+checkFuncs (f@(FnDef t i a (Block s)):fs) = do (env, at, err) <- get
+                                               case find (\(ident, _) -> ident == i) (concat env) of
+                                                 -- TODO: check if args already in scope
+                                                 Nothing  -> do let args = [t | (Arg t _) <- a]
+                                                                let newEnv = [(i, (Fun t args))]:env
+                                                                put (newEnv, at, err)
+                                                                checkFuncs fs
+                                                 Just _   -> do addErr (show i ++ " already in scope")
+                                                                checkFuncs fs
+
+                                             
+checkProgram :: [TopDef] -> MyStateM ()
+checkProgram [] = return ()
+checkProgram (f:fs) = do checkFun f
+                         checkProgram fs
+
+checkFun :: TopDef -> MyStateM ()
+checkFun (FnDef t i a (Block s)) = do pushFunScope a
+                                      ns <- checkStmts s [] t
+                                      popFunScope
+                                      b <- addArgs a []
+                                      (env, at, err) <- get
+                                      let newAt = at ++ [(FnDef t i b (Block ns))]
+                                      put (env, newAt, err)
+                                      return ()
+                            
+checkStmts :: [Stmt] -> [Stmt] -> Type -> MyStateM [Stmt]
+checkStmts [] nss rt = return nss
+checkStmts (s:ss) nss rt = do ns <- checkStmt s rt
+                              checkStmts ss (nss ++ [ns]) rt
+
+checkStmt :: Stmt -> Type -> MyStateM Stmt
+checkStmt s rt = case s of
+
+    BStmt (Block s)     -> do pushBlockScope
+                              ns <- checkStmts s [] rt
+                              popBlockScope
+                              return (BStmt (Block ns))    
+  
+    Decl t vars         -> do nvars <- addVars t vars []
+                              return (Decl t nvars)
+
+    Ass i e             -> do vt <- findVarType i
+                              (TAnot et ne) <- infer e
+                              case vt of
+                                Just t  -> case t == et of
+                                            True  -> return (Ass i (TAnot et ne))
+                                            False -> do addErr (show e ++ " is not of the type " ++ 
+                                                                show t ++ " (" ++ show i ++ ")")
+                                                        return (Ass i (TAnot et ne))
+                                Nothing -> return (Ass i e)
+                                
+
+    Incr i              -> do m <- findVarType i
+                              case m of
+                                Just Int    -> return (Incr i)
+                                Just Doub   -> return (Incr i)
+                                Just t      -> do addErr ("(" ++ show i ++ 
+                                                          ") incrementing is only allowed on Int " ++
+                                                          "and Doub, not on " ++ 
+                                                          show t)
+                                                  return (Incr i)
+                                Nothing     -> do addErr ("(" ++ show i ++ ") incrementing is only " ++
+                                                          "allowed on Int and Doub")
+                                                  return (Incr i)
+  
+    Decr i              -> do m <- findVarType i
+                              case m of
+                                Just Int    -> return (Decr i)
+                                Just Doub   -> return (Decr i)
+                                Just t      -> do addErr ("(" ++ show i ++ 
+                                                          ") decrementing is only allowed on Int " ++
+                                                          "and Doub, not on " ++ 
+                                                          show t)
+                                                  return (Decr i)
+                                Nothing     -> do addErr ("(" ++ show i ++ ") decrementing is only " ++
+                                                          "allowed on Int and Doub")
+                                                  return (Decr i)
+
+    Ret e               -> do m <- infer e
+                              case m of
+                                  (TAnot t ne) -> case t == rt of
+                                                    True  -> return (Ret m)
+                                                    False -> do addErr (show "wrong return type " ++ show t ++
+                                                                        " should be " ++ show rt)
+                                                                return (Ret m)
+                                  _            -> do addErr (show e ++ " return not annotated")
+                                                     return (Ret m)
+                              -- TODO check if it returns the right type
+
+    VRet                -> return VRet
+    
+    Cond e stm          -> do m <- infer e
+                              ns <- checkStmt stm rt
+                              return (Cond m ns)
+                              
+    CondElse e s1 s2    -> do m <- infer e
+                              ns1 <- checkStmt s1 rt
+                              ns2 <- checkStmt s2 rt
+                              return (CondElse m ns1 ns2)
+                              
+    While e stm         -> do m <- infer e
+                              ns <- checkStmt stm rt
+                              return (While m ns)
+                              
+    SExp e              -> do m <- infer e
+                              return (SExp m)
+    s                   -> do addErr "Not an valid statement"
+                              return s
+
+addArgs :: [Arg] -> [Arg] -> MyStateM ([Arg])
+addArgs [] nass = return (nass)
+addArgs ((Arg t i):ass) nass = do ((e:env), at, err) <- get
+                                  case (find (\(ident, nt) -> ident == i) e) of
+                                    Nothing    -> do let newEnv = ((i, t):e):env
+                                                     put(trace (show newEnv) newEnv, at, err)
+                                                     addArgs ass ((Arg t i):nass)
+                                    Just ident -> do addErr (show ident ++ " already in scope")
+                                                     addArgs ass ((Arg t i):nass)
+
+                              
+addVars :: Type -> [Item] -> [Item] -> MyStateM ([Item])
+addVars t [] nis = return (nis)
+addVars t ((NoInit i):is) nis = do ((e:env), at, err) <- get
+                                   case (find (\(ident, nt) -> ident == i) e) of
+                                     Nothing    -> do let newEnv = ((i, t):e):env
+                                                      put (newEnv, at, err)
+                                                      addVars t is (nis ++ [(NoInit i)])
+                                     Just ident -> do addErr (show ident ++ " already initialized")
+                                                      addVars t is (nis ++ [(NoInit i)])
+addVars t ((Init i ex):is) nis = do (TAnot nt ne) <- infer ex
+                                    case t == nt of
+                                      True   -> do ((e:env), at, err) <- get
+                                                   case (find (\(ident, nt) -> ident == i) e) of
+                                                      Nothing    -> do let newEnv = ((i, t):e):env
+                                                                       put (newEnv, at, err)
+                                                                       addVars t is (nis ++ [(Init i (TAnot nt ne))])
+                                                      Just ident -> do addErr (show ident ++ " already initialized")
+                                                                       addVars t is (nis ++ [(Init i (TAnot nt ne))])
+                                      False  -> do addErr (show ex ++ " is not of type " ++ show t)
+                                                   ((e:env), at, err) <- get
+                                                   let newEnv = ((i, t):e):env
+                                                   put (newEnv, at, err)
+                                                   addVars t is (nis ++ [(Init i ex)])
+                                   
+          
+                              
+infer :: Expr -> MyStateM Expr
+infer expr = case expr of
+    EVar i          -> do m <- findVarType i
+                          case m of
+                              Just t    -> return (TAnot t (EVar i))
+                              Nothing   -> return (EVar i)
+
+    ELitInt e       -> return (TAnot Int (ELitInt e))
+    ELitDoub e      -> return (TAnot Doub (ELitDoub e))
+    ELitTrue        -> return (TAnot Bool ELitTrue)
+    ELitFalse       -> return (TAnot Bool ELitFalse)
+    EApp i exs      -> do m <- findVarType i
+                          nexs <- inferList exs []
+                          case m of
+                              Just (Fun t a)    -> case ((length nexs) == (length a)) of
+                                                        True    -> case (and [t1 == t2 | ((TAnot t1 _),t2) <- zip nexs a]) of
+                                                                        True   -> return (TAnot t (EApp i nexs))
+                                                                        False  -> do addErr (show i ++ ":s arguments (" ++
+                                                                                             show nexs ++ ") are not equal to " ++
+                                                                                             show a)
+                                                                                     return (TAnot t (EApp i nexs))
+                                                        False   -> case i of
+                                                                    Ident "printString" -> case exs of
+                                                                                            [EString _] -> return (EApp i exs)
+                                                                                            _           -> do addErr ("printString only takes one literal string as a argument")
+                                                                                                              return (EApp i exs)
+                                                                    _                   -> do addErr ("wrong number of arguments for " ++ show i) 
+                                                                                              return (TAnot t (EApp i nexs))
+                              
+                              Nothing           -> do addErr ("wrong arguments in " ++ show i)
+                                                      return (EApp i exs) -- TODO: check for Nothing or other
+                              
+                          
+    EString e       -> return (EString e)
+    Neg e           -> do m <- infer e
+                          case m of
+                              (TAnot Int _)     -> return (TAnot Int (Neg m))
+                              (TAnot Doub _)    -> return (TAnot Doub (Neg m))
+                              _                 -> do addErr (show e ++ " is not of type Int or Bool")
+                                                      return (Neg e)
+    Not e           -> do m <- infer e
+                          case m of
+                              (TAnot Bool _)    -> return (TAnot Bool (Not m))
+                              _                 -> do addErr (show e ++ " is not of type Bool")
+                                                      return (Not e)
+                                                      
+    EMul e1 op e2   -> do t <- findType e1 e2 [Int, Doub]
+                          case t of
+                              Just (Int, en1, en2)   -> return (TAnot Int (EMul en1 op en2))
+                              Just (Doub, en1, en2)  -> return (TAnot Doub (EMul en1 op en2))
+                              Nothing                -> return (EMul e1 op e2)
+                              
+    EAdd e1 op e2   -> do t <- findType e1 e2 [Int, Doub]
+                          case t of
+                              Just (Int, en1, en2)   -> return (TAnot Int (EAdd en1 op en2))
+                              Just (Doub, en1, en2)  -> return (TAnot Doub (EAdd en1 op en2))
+                              Nothing                -> return (EAdd e1 op e2)
+                              
+    ERel e1 op e2   -> case find (== op) [LTH,LE,GTH,GE] of
+                         Just _   -> do t <- findType e1 e2 [Int, Doub]
+                                        case t of
+                                            Just (Int, en1, en2)   -> return (TAnot Bool (ERel en1 op en2))
+                                            Just (Doub, en1, en2)  -> return (TAnot Bool (ERel en1 op en2))
+                                            Nothing                -> return (ERel e1 op e2)
+
+                         Nothing  -> do m <- findType e1 e2 [Int, Doub, Bool]
+                                        case m of
+                                            Just (_, en1, en2)  -> return (TAnot Bool (ERel en1 op en2))
+                                            Nothing             -> return (ERel e1 op e2)
+                                            
+    EAnd e1 e2      -> do t <- findType e1 e2 [Bool]
+                          case t of
+                              Just (Bool, en1, en2) -> return (TAnot Bool (EAnd en1 en2))
+                              Nothing               -> return (EAnd e1 e2)
+                              
+    EOr e1 e2       -> do t <- findType e1 e2 [Bool]
+                          case t of
+                              Just (Bool, en1, en2) -> return (TAnot Bool (EOr en1 en2))
+                              Nothing               -> return (EOr e1 e2)
+                              
+inferList :: [Expr] -> [Expr] -> MyStateM [Expr]
+inferList [] nes = return nes
+inferList (e:es) nes = do ne <- infer e
+                          inferList es (nes ++ [ne])
+
+findType :: Expr -> Expr -> [Type] -> MyStateM (Maybe (Type, Expr, Expr))
+findType e1 e2 allowed = do t1 <- infer e1
+                            t2 <- infer e2
+                            let (TAnot tt1 _) = t1
+                            let (TAnot tt2 _) = t2
+                            case tt1 == tt2 of
+                              True  -> case t1 of
+                                          (TAnot t _) -> case (find (== t) allowed) of
+                                                            Just _  -> return (Just (t, t1, t2))
+                                                            Nothing -> do addErr (show t ++ 
+                                                                                  " is not allowed here")
+                                                                          return Nothing
+                                          _           -> return Nothing
+                              False -> do addErr (show e1 ++ " and " ++ show e2 ++ " are not of type " ++ show t1)
+                                          return Nothing
+   
+findVarType :: Ident -> MyStateM (Maybe Type)
+findVarType var = do (env, at, err) <- get
+                     let m = find (\(i, t) -> i == var) (concat env)
+                     case m of
+                         Just t     -> return (Just (snd t))
+                         Nothing    -> do addErr ((show var) ++ " not in scope")
+                                          return Nothing
+                
+
+-- initializing functions
+emptyState :: MyState
+emptyState = (emptyEnv, [], [])
+
+emptyEnv :: Env
+emptyEnv = [[
+    (Ident "printString", (Fun Void [])),
+    (Ident "printDouble", (Fun Void [Doub])),
+    (Ident "printInt", (Fun Void [Int])),
+    (Ident "readDouble", (Fun Doub [])),
+    (Ident "readInt", (Fun Int []))
+    ]]
+
+-- helper functions
+pushFunScope :: [Arg] -> MyStateM ()
+pushFunScope a = do (env, at, err) <- get
+                    let args = [(i,t) | (Arg t i) <- a]
+                    put (args:env, at, err)
+                    return ()
+
+popFunScope :: MyStateM ()
+popFunScope = do (env, at, err) <- get
+                 put (tail env, at, err)
+                 return ()
+                 
+pushBlockScope :: MyStateM ()
+pushBlockScope = pushFunScope []
+
+popBlockScope :: MyStateM ()
+popBlockScope = popFunScope
+
+addErr :: String -> MyStateM ()
+addErr err = do (env, at, errs) <- get
+                put (env, at, err:errs)
+                return ()
+                
diff --git a/TypeChecker.hs~ b/TypeChecker.hs~
new file mode 100644
index 0000000..d434889
--- /dev/null
+++ b/TypeChecker.hs~
@@ -0,0 +1,8 @@
+module TypeChecker where
+
+import AbsJavalette
+import PrintJavalette
+import ErrM
+
+typecheck :: Program -> Err()
+typecheck (Program fs) = fail printTree fs
diff --git a/TypeChecker.o b/TypeChecker.o
new file mode 100644
index 0000000..b5c568e
Binary files /dev/null and b/TypeChecker.o differ
diff --git a/bnfc b/bnfc
new file mode 100755
index 0000000..86f4340
Binary files /dev/null and b/bnfc differ
diff --git a/jasmin/jasmin-2.4.zip b/jasmin/jasmin-2.4.zip
new file mode 100644
index 0000000..cd069c1
Binary files /dev/null and b/jasmin/jasmin-2.4.zip differ
diff --git a/jasmin/jasmin-2.4/Readme.txt b/jasmin/jasmin-2.4/Readme.txt
new file mode 100644
index 0000000..9ed2058
--- /dev/null
+++ b/jasmin/jasmin-2.4/Readme.txt
@@ -0,0 +1,116 @@
+Jasmin README file                         1 March 1997, Jonathan Meyer
+                                              Last updated October 2004
+
+Introduction
+------------
+Welcome to Jasmin version 1.1.
+
+Jasmin is a Java Assembler Interface. It takes ASCII descriptions for Java
+classes, written in a simple assembler-like syntax, using the Java
+Virtual Machine instruction set. It converts them into binary Java class 
+files suitable for loading into a Java interpreter.
+
+Jasmin was originally written as the companion to the 
+book "Java Virtual Machine", published by O'Reilly, written by 
+Jon Meyer and Troy Downing. (See http://www.ora.com/catalog/javavm/).
+The book is now out of print. However, the Jasmin assembler retains its
+usefulness as a utility, and continues its life as an OpenSource project.
+
+Background
+----------
+Jasmin is today a little long in the tooth. It was originally coded in
+1996 as a stop-gap until Sun released their own assembler. It has seen 
+no major upgrades since 1997. By 2004 Sun still has not released an 
+official assembler, so I decided to release Jasmin as a sourceforge
+project. Hopefully this will inject some fresh life into the project...
+
+Home Page
+---------
+Check out the Jasmin home page at:
+
+    http://jasmin.sourceforge.net
+
+Requirements
+------------
+Jasmin is written in Java, and should work with most Java 1.1 environments. 
+
+To run Jasmin you need to have a Java 2 Runtime Environment available (e.g. JDK 1.4). 
+This can be downloaded from "http://www.javasoft.com/j2se/".
+
+Getting Started
+---------------
+The Jasmin distribution contains a jasmin.jar file holding the Jasmin assembler. 
+To run Jasmin, execute the Jarfile, specifying any files to assemble 
+as command-line parameters, e.g. to assemble the "HelloWorld.j" file in examples,
+first use cd to change into the Jasmin directory:
+
+    cd c:\jasmin-1.1                                   [Windows]
+or
+    cd ~/jasmin-1.1                                    [Unix]
+
+Then, to run Jasmin, use:
+
+    java -jar jasmin.jar examples\HelloWorld.j         [Windows]
+or
+    java -jar jasmin.jar examples/HelloWorld.j         [Unix/MacOsX]
+	
+
+After running Jasmin as above, it generates a compiled HelloWorld.class file
+in the examples directory.
+
+You can then run the HelloWorld program by doing:
+
+    java examples.HelloWorld
+
+Build Instructions
+------------------
+Jasmin uses Ant as its build mechanism. See build.xml for instructions on how
+to build Jasmin. In brief, you need to:
+
+1. Start a Terminal or Command window. 
+2. Change (cd) into the Jasmin directory
+3. Make sure that java, javac etc. are on your path
+4. Run build.bat (Windows) or build.sh (Unix).
+
+For example, on Windows, this might look something like:
+
+    cd c:\jasmin-1.1                 # change to Jasmin directory
+    build all
+			
+Or, for Unix, it might be like:
+
+    cd ~/jasmin-1.1                  # change to Jasmin directory
+    ./build.sh all
+
+These scripts use the build.xml configuration file to specify build parameters.
+
+Where Next
+----------
+After trying Jasmin out, have a look at the HelloWorld.j source in the examples directory, 
+try compiling and running the other examples.
+
+There is documentation for Jasmin in the doc directory. You should probably
+start with the 'guide.html' document. 
+
+Files
+-----
+The following files are included in this distribution:
+
+    README.txt  - this file
+    jasmin.jar  - executable Jar file containing Jasmin assembler
+    examples/   - directory containing example files written for Jasmin
+    src/        - the Java source code and for the jasmin package
+    lib/        - Contains Java sources for the java_cup and jas packages
+    docs/       - various documentation files.
+
+Copyright
+---------
+Jasmin is Copyright (1997-2004) Jonathan Meyer, under the terms of
+the GNU General Public License. See license-jasmin.txt for more.
+
+Jasmin uses the JAS package which has its own copyright - see lib/jas/README.
+[sbktech.org no longer seem to be in existence, but the code lives
+on in this project].
+
+Jasmin utilizes Scott E. Hudson's Java Cup package v0.9e, which is also in 
+the lib directory. See http://www.cs.princeton.edu/~appel/modern/java/CUP/
diff --git a/jasmin/jasmin-2.4/build.bat b/jasmin/jasmin-2.4/build.bat
new file mode 100644
index 0000000..867a785
--- /dev/null
+++ b/jasmin/jasmin-2.4/build.bat
@@ -0,0 +1,107 @@
+@echo off
+
+REM  Copyright 2001,2004 The Apache Software Foundation
+REM
+REM  Licensed under the Apache License, Version 2.0 (the "License");
+REM  you may not use this file except in compliance with the License.
+REM  You may obtain a copy of the License at
+REM
+REM      http://www.apache.org/licenses/LICENSE-2.0
+REM
+REM  Unless required by applicable law or agreed to in writing, software
+REM  distributed under the License is distributed on an "AS IS" BASIS,
+REM  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+REM  See the License for the specific language governing permissions and
+REM  limitations under the License.
+
+if exist "%HOME%\antrc_pre.bat" call "%HOME%\antrc_pre.bat"
+
+if "%OS%"=="Windows_NT" @setlocal
+
+rem %~dp0 is expanded pathname of the current script under NT
+set ANT_HOME=.
+rem set DEFAULT_ANT_HOME=%~dp0..
+
+if "%ANT_HOME%"=="" set ANT_HOME=%DEFAULT_ANT_HOME%
+set DEFAULT_ANT_HOME=
+
+rem Slurp the command line arguments. This loop allows for an unlimited number
+rem of arguments (up to the command line limit, anyway).
+set ANT_CMD_LINE_ARGS=%1
+if ""%1""=="""" goto doneStart
+shift
+:setupArgs
+if ""%1""=="""" goto doneStart
+set ANT_CMD_LINE_ARGS=%ANT_CMD_LINE_ARGS% %1
+shift
+goto setupArgs
+rem This label provides a place for the argument list loop to break out
+rem and for NT handling to skip to.
+
+:doneStart
+rem find ANT_HOME if it does not exist due to either an invalid value passed
+rem by the user or the %0 problem on Windows 9x
+if exist "%ANT_HOME%\lib\ant.jar" goto checkJava
+
+rem check for ant in Program Files
+if not exist "%ProgramFiles%\ant" goto checkSystemDrive
+set ANT_HOME=%ProgramFiles%\ant
+goto checkJava
+
+:checkSystemDrive
+rem check for ant in root directory of system drive
+if not exist %SystemDrive%\ant\lib\ant.jar goto checkCDrive
+set ANT_HOME=%SystemDrive%\ant
+goto checkJava
+
+:checkCDrive
+rem check for ant in C:\ant for Win9X users
+if not exist C:\ant\lib\ant.jar goto noAntHome
+set ANT_HOME=C:\ant
+goto checkJava
+
+:noAntHome
+echo ANT_HOME is set incorrectly or ant could not be located. Please set ANT_HOME.
+goto end
+
+:checkJava
+set _JAVACMD=%JAVACMD%
+
+if "%JAVA_HOME%" == "" goto noJavaHome
+if not exist "%JAVA_HOME%\bin\java.exe" goto noJavaHome
+if "%_JAVACMD%" == "" set _JAVACMD=%JAVA_HOME%\bin\java.exe
+goto checkJikes
+
+:noJavaHome
+if "%_JAVACMD%" == "" set _JAVACMD=java.exe
+
+:checkJikes
+if not "%JIKESPATH%"=="" goto runAntWithJikes
+
+:runAnt
+if not "%CLASSPATH%"=="" goto runAntWithClasspath
+"%_JAVACMD%" %ANT_OPTS% -classpath "%ANT_HOME%\lib\ant-launcher.jar" "-Dant.home=%ANT_HOME%" org.apache.tools.ant.launch.Launcher %ANT_ARGS% %ANT_CMD_LINE_ARGS%
+goto end
+
+:runAntWithClasspath
+"%_JAVACMD%" %ANT_OPTS% -classpath "%ANT_HOME%\lib\ant-launcher.jar" "-Dant.home=%ANT_HOME%" org.apache.tools.ant.launch.Launcher %ANT_ARGS% -lib "%CLASSPATH%" %ANT_CMD_LINE_ARGS%
+goto end
+
+:runAntWithJikes
+if not "%CLASSPATH%"=="" goto runAntWithJikesAndClasspath
+"%_JAVACMD%" %ANT_OPTS% -classpath "%ANT_HOME%\lib\ant-launcher.jar" "-Dant.home=%ANT_HOME%" "-Djikes.class.path=%JIKESPATH%" org.apache.tools.ant.launch.Launcher %ANT_ARGS% %ANT_CMD_LINE_ARGS%
+goto end
+
+:runAntWithJikesAndClasspath
+"%_JAVACMD%" %ANT_OPTS% -classpath "%ANT_HOME%\lib\ant-launcher.jar" "-Dant.home=%ANT_HOME%" "-Djikes.class.path=%JIKESPATH%" org.apache.tools.ant.launch.Launcher %ANT_ARGS%  -lib "%CLASSPATH%" %ANT_CMD_LINE_ARGS%
+goto end
+
+:end
+set _JAVACMD=
+set ANT_CMD_LINE_ARGS=
+
+if "%OS%"=="Windows_NT" @endlocal
+
+:mainEnd
+if exist "%HOME%\antrc_post.bat" call "%HOME%\antrc_post.bat"
+
diff --git a/jasmin/jasmin-2.4/build.sh b/jasmin/jasmin-2.4/build.sh
new file mode 100644
index 0000000..4a97d12
--- /dev/null
+++ b/jasmin/jasmin-2.4/build.sh
@@ -0,0 +1,305 @@
+#! /bin/sh
+
+#   Copyright 2001-2004 The Apache Software Foundation
+#
+#   Licensed under the Apache License, Version 2.0 (the "License");
+#   you may not use this file except in compliance with the License.
+#   You may obtain a copy of the License at
+#
+#       http://www.apache.org/licenses/LICENSE-2.0
+#
+#   Unless required by applicable law or agreed to in writing, software
+#   distributed under the License is distributed on an "AS IS" BASIS,
+#   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+#   See the License for the specific language governing permissions and
+#   limitations under the License.
+
+ANT_HOME=.
+export ANT_HOME
+
+# Extract launch and ant arguments, (see details below).
+ant_exec_args=
+no_config=false
+use_jikes_default=false
+ant_exec_debug=false
+show_help=false
+for arg in "$@" ; do
+  if [ "$arg" = "--noconfig" ] ; then
+    no_config=true
+  elif [ "$arg" = "--usejikes" ] ; then
+    use_jikes_default=true
+  elif [ "$arg" = "--execdebug" ] ; then
+    ant_exec_debug=true
+  elif [ my"$arg" = my"--h"  -o my"$arg" = my"--help"  ] ; then
+    show_help=true
+    ant_exec_args="$ant_exec_args -h"
+  else
+    if [  my"$arg" = my"-h"  -o  my"$arg" = my"-help" ] ; then
+      show_help=true
+    fi
+    ant_exec_args="$ant_exec_args \"$arg\""
+  fi
+done
+
+# Source/default ant configuration
+if $no_config ; then
+  rpm_mode=false
+  usejikes=$use_jikes_default
+else
+  # load system-wide ant configuration
+  if [ -f "/etc/ant.conf" ] ; then
+    . /etc/ant.conf
+  fi
+
+  # load user ant configuration
+  if [ -f "$HOME/.ant/ant.conf" ] ; then
+    . $HOME/.ant/ant.conf
+  fi
+  if [ -f "$HOME/.antrc" ] ; then
+    . "$HOME/.antrc"
+  fi
+
+  # provide default configuration values
+  if [ -z "$rpm_mode" ] ; then
+    rpm_mode=false
+  fi
+  if [ -z "$usejikes" ] ; then
+    usejikes=$use_jikes_default
+  fi
+fi
+
+# Setup Java environment in rpm mode
+if $rpm_mode ; then
+  if [ -f /usr/share/java-utils/java-functions ] ; then
+    . /usr/share/java-utils/java-functions
+    set_jvm
+    set_javacmd
+  fi
+fi
+
+# OS specific support.  $var _must_ be set to either true or false.
+cygwin=false;
+darwin=false;
+case "`uname`" in
+  CYGWIN*) cygwin=true ;;
+  Darwin*) darwin=true
+           if [ -z "$JAVA_HOME" ] ; then
+             JAVA_HOME=/System/Library/Frameworks/JavaVM.framework/Home
+           fi
+           ;;
+esac
+
+if [ -z "$ANT_HOME" -o ! -d "$ANT_HOME" ] ; then
+  # try to find ANT
+  if [ -d /opt/ant ] ; then
+    ANT_HOME=/opt/ant
+  fi
+
+  if [ -d "${HOME}/opt/ant" ] ; then
+    ANT_HOME="${HOME}/opt/ant"
+  fi
+
+  ## resolve links - $0 may be a link to ant's home
+  PRG="$0"
+  progname=`basename "$0"`
+
+  # need this for relative symlinks
+  while [ -h "$PRG" ] ; do
+    ls=`ls -ld "$PRG"`
+    link=`expr "$ls" : '.*-> \(.*\)$'`
+    if expr "$link" : '/.*' > /dev/null; then
+    PRG="$link"
+    else
+    PRG=`dirname "$PRG"`"/$link"
+    fi
+  done
+
+  ANT_HOME=`dirname "$PRG"`/..
+
+  # make it fully qualified
+  ANT_HOME=`cd "$ANT_HOME" && pwd`
+fi
+
+# For Cygwin, ensure paths are in UNIX format before anything is touched
+if $cygwin ; then
+  [ -n "$ANT_HOME" ] &&
+    ANT_HOME=`cygpath --unix "$ANT_HOME"`
+  [ -n "$JAVA_HOME" ] &&
+    JAVA_HOME=`cygpath --unix "$JAVA_HOME"`
+fi
+
+# set ANT_LIB location
+ANT_LIB="${ANT_HOME}/lib"
+
+if [ -z "$JAVACMD" ] ; then
+  if [ -n "$JAVA_HOME"  ] ; then
+    if [ -x "$JAVA_HOME/jre/sh/java" ] ; then
+      # IBM's JDK on AIX uses strange locations for the executables
+      JAVACMD="$JAVA_HOME/jre/sh/java"
+    else
+      JAVACMD="$JAVA_HOME/bin/java"
+    fi
+  else
+    JAVACMD=`which java 2> /dev/null `
+    if [ -z "$JAVACMD" ] ; then
+        JAVACMD=java
+    fi
+  fi
+fi
+
+if [ ! -x "$JAVACMD" ] ; then
+  echo "Error: JAVA_HOME is not defined correctly."
+  echo "  We cannot execute $JAVACMD"
+  exit 1
+fi
+
+# Build local classpath using just the launcher in non-rpm mode or
+# use the Jpackage helper in rpm mode with basic and default jars
+# specified in the ant.conf configuration. Because the launcher is
+# used, libraries linked in ANT_HOME will also be include, but this
+# is discouraged as it is not java-version safe. A user should
+# request optional jars and their dependencies via the OPT_JAR_LIST
+# variable
+if $rpm_mode && [ -f /usr/bin/build-classpath ] ; then
+  LOCALCLASSPATH="$(/usr/bin/build-classpath ant ant-launcher jaxp_parser_impl xml-commons-apis)"
+  # If the user requested to try to add some other jars to the classpath
+  if [ -n "$OPT_JAR_LIST" ] ; then
+    _OPTCLASSPATH="$(/usr/bin/build-classpath $OPT_JAR_LIST 2> /dev/null)"
+    if [ -n "$_OPTCLASSPATH" ] ; then 
+      LOCALCLASSPATH="$LOCALCLASSPATH:$_OPTCLASSPATH"
+    fi
+  fi
+
+  # Explicitly add javac path to classpath, assume JAVA_HOME set
+  # properly in rpm mode
+  if [ -f "$JAVA_HOME/lib/tools.jar" ] ; then
+    LOCALCLASSPATH="$LOCALCLASSPATH:$JAVA_HOME/lib/tools.jar"
+  fi
+  if [ -f "$JAVA_HOME/lib/classes.zip" ] ; then
+    LOCALCLASSPATH="$LOCALCLASSPATH:$JAVA_HOME/lib/classes.zip"
+  fi
+
+  # if CLASSPATH_OVERRIDE env var is set, LOCALCLASSPATH will be
+  # user CLASSPATH first and ant-found jars after.
+  # In that case, the user CLASSPATH will override ant-found jars
+  #
+  # if CLASSPATH_OVERRIDE is not set, we'll have the normal behaviour
+  # with ant-found jars first and user CLASSPATH after
+  if [ -n "$CLASSPATH" ] ; then
+    # merge local and specified classpath 
+    if [ -z "$LOCALCLASSPATH" ] ; then 
+      LOCALCLASSPATH="$CLASSPATH"
+    elif [ -n "$CLASSPATH_OVERRIDE" ] ; then
+      LOCALCLASSPATH="$CLASSPATH:$LOCALCLASSPATH"
+    else
+      LOCALCLASSPATH="$LOCALCLASSPATH:$CLASSPATH"
+    fi
+
+    # remove class path from launcher -lib option
+    CLASSPATH=""
+  fi
+else
+  # not using rpm_mode; use launcher to determine classpaths
+  if [ -z "$LOCALCLASSPATH" ] ; then
+      LOCALCLASSPATH=$ANT_LIB/ant-launcher.jar
+  else
+      LOCALCLASSPATH=$ANT_LIB/ant-launcher.jar:$LOCALCLASSPATH
+  fi
+fi
+
+if [ -n "$JAVA_HOME" ] ; then
+  # OSX hack to make Ant work with jikes
+  if $darwin ; then
+    OSXHACK="${JAVA_HOME}/../Classes"
+    if [ -d "${OSXHACK}" ] ; then
+      for i in "${OSXHACK}"/*.jar
+      do
+        JIKESPATH="$JIKESPATH:$i"
+      done
+    fi
+  fi
+fi
+
+# Allow Jikes support (off by default)
+if $usejikes; then
+  ANT_OPTS="$ANT_OPTS -Dbuild.compiler=jikes"
+fi
+
+# For Cygwin, switch paths to appropriate format before running java
+if $cygwin; then
+  if [ "$OS" = "Windows_NT" ] && cygpath -m .>/dev/null 2>/dev/null ; then
+    format=mixed
+  else
+    format=windows
+  fi
+  ANT_HOME=`cygpath --$format "$ANT_HOME"`
+  ANT_LIB=`cygpath --$format "$ANT_LIB"`
+  JAVA_HOME=`cygpath --$format "$JAVA_HOME"`
+  LOCALCLASSPATH=`cygpath --path --$format "$LOCALCLASSPATH"`
+  if [ -n "$CLASSPATH" ] ; then
+    CLASSPATH=`cygpath --path --$format "$CLASSPATH"`
+  fi
+  CYGHOME=`cygpath --$format "$HOME"`
+fi
+
+# Show script help if requested
+if $show_help ; then
+  echo $0 '[script options] [options] [target [target2 [target3] ..]]'
+  echo 'Script Options:'
+  echo '  --help, --h            print this message and ant help'
+  echo '  --noconfig             suppress sourcing of /etc/ant.conf,'
+  echo '                         $HOME/.ant/ant.conf, and $HOME/.antrc'
+  echo '                         configuration files'
+  echo '  --usejikes             enable use of jikes by default, unless'
+  echo '                         set explicitly in configuration files'
+  echo '  --execdebug            print ant exec line generated by this'
+  echo '                         launch script'
+  echo '  '
+fi
+# add a second backslash to variables terminated by a backslash under cygwin
+if $cygwin; then
+  case "$ANT_HOME" in
+    *\\ )
+    ANT_HOME="$ANT_HOME\\"
+    ;;
+  esac
+  case "$CYGHOME" in
+    *\\ )
+    CYGHOME="$CYGHOME\\"
+    ;;
+  esac
+  case "$JIKESPATH" in
+    *\\ )
+    JIKESPATH="$JIKESPATH\\"
+    ;;
+  esac
+  case "$LOCALCLASSPATH" in
+    *\\ )
+    LOCALCLASSPATH="$LOCALCLASSPATH\\"
+    ;;
+  esac
+  case "$CLASSPATH" in
+    *\\ )
+    CLASSPATH="$CLASSPATH\\"
+    ;;
+  esac
+fi
+# Execute ant using eval/exec to preserve spaces in paths,
+# java options, and ant args
+ant_sys_opts=
+if [ -n "$CYGHOME" ]; then
+  if [ -n "$JIKESPATH" ]; then
+    ant_sys_opts="-Djikes.class.path=\"$JIKESPATH\" -Dcygwin.user.home=\"$CYGHOME\""
+  else
+    ant_sys_opts="-Dcygwin.user.home=\"$CYGHOME\""
+  fi
+else
+  if [ -n "$JIKESPATH" ]; then
+    ant_sys_opts="-Djikes.class.path=\"$JIKESPATH\""
+  fi
+fi
+ant_exec_command="exec \"$JAVACMD\" $ANT_OPTS -classpath \"$LOCALCLASSPATH\" -Dant.home=\"$ANT_HOME\" -Dant.library.dir=\"$ANT_LIB\" $ant_sys_opts org.apache.tools.ant.launch.Launcher $ANT_ARGS -lib \"$CLASSPATH\" $ant_exec_args"
+if $ant_exec_debug ; then
+    echo $ant_exec_command
+fi
+eval $ant_exec_command
diff --git a/jasmin/jasmin-2.4/build.xml b/jasmin/jasmin-2.4/build.xml
new file mode 100644
index 0000000..4fae2ae
--- /dev/null
+++ b/jasmin/jasmin-2.4/build.xml
@@ -0,0 +1,297 @@
+<!-- ===========================================================================
+
+Installing the build tools
+==========================
+
+The Jasmin build system is based on Jakarta Ant, which is a Java building tool
+originally developed for the Jakarta Tomcat project but now used in many other
+Apache projects and extended by many developers.
+
+Ant is a little but very handy tool that uses a build file written in XML
+(this file) as building instructions. For more information refer to
+"http://jakarta.apache.org/ant/".
+
+Jasmin includes its own copy of the ant library in the lib directory. 
+
+The only other thing that you have to make sure of is that the 
+"JAVA_HOME" environment property is set to match the top level directory 
+containing the JVM you want to use. For example:
+
+C:\> set JAVA_HOME=C:\jdk1.4
+
+or on Unix:
+
+% setenv JAVA_HOME /usr/local/java
+  (csh)
+> JAVA_HOME=/usr/java; export JAVA_HOME
+  (ksh, bash)
+
+That's it!
+
+Building instructions
+=====================
+
+First, make sure your current working directory is
+where this very file is located. Then type:
+
+  ./build.sh all (unix)
+  build.bat all (win32)
+
+To build the framework, examples, and tests or:
+
+  ./build.sh (unix)
+  build.bat (win32)
+  
+To list all the possible build targets.
+
+If everything is right (see *) and all the required packages are visible, this action
+will generate a build directory ./build, containing the jar file:
+
+  jasmin.jar  - This jar contains the Jasmin assembler
+
+This jar file can be run by the command
+
+  java -jar jasmin.jar <filenames>
+
+from within the ./build directory. 
+
+* On Win/98 you may get an "Out of Environment Space" error message. This happens if
+Windows provides too small a space for environment variables. To work around this
+limitation: 
+  Close the DOS window (the error can corrupt its CLASSPATH variable). 
+  Open a new DOS window. Click on the MS-DOS icon at the top left of the window. 
+  Select the Properties option. 
+  Click on the Memory tab. 
+  Adjust the "Initial Environment" drop-down box from "Auto" to "2816". 
+  Click OK. 
+Then try building.
+
+-->
+
+<project name="Jasmin" default="usage" basedir=".">
+
+  <!-- =================================================================== -->
+  <!-- Initialization target                                               -->
+  <!-- =================================================================== -->
+  <target name="init">
+    <tstamp/>
+    <property name="Name" value="Jasmin"/>
+    <property name="name" value="jasmin"/>
+    <property name="version" value="2.1"/>
+    <property name="year" value="2006"/>
+
+    <echo message="----------- ${Name} ${version} [${year}] ------------"/>
+
+    <property name="build.compiler" value="modern"/>
+    <property name="debug" value="on"/>
+    <property name="optimize" value="on"/>
+    <property name="deprecation" value="on"/>
+    <property name="packages" value="jasmin.*,jas.*,scm.*"/>
+
+    <!-- Define the source directories -->
+    <property name="root.dir" value="./"/>
+    <property name="docs.dir" value="${root.dir}/docs"/>
+    <property name="lib.dir" value="${root.dir}/lib"/>
+    <property name="src.dir" value="${root.dir}/src"/>
+
+    <!-- Define the source build directories -->
+    <property name="build.dir" value="${root.dir}/build"/>
+    <property name="build.lib" value="${build.dir}/lib"/>
+    <property name="build.jasmin.src" value="${build.dir}/jasmin/src"/>
+    <property name="build.jasmin.dest" value="${build.dir}/jasmin/classes"/>
+    <property name="apidocs.dir" value="${docs.dir}/api"/>	   	
+    
+    <!-- Define the distribution directories -->
+    <property name="dist.root" value="${root.dir}/dist"/>
+    <property name="sourcedist.dir" value="${dist.root}/${name}-${version}/${name}-${version}"/>
+    <property name="compiledist.dir" value="${dist.root}/${name}-${version}/${name}-${version}"/>    
+  </target>
+
+  <!-- =================================================================== -->
+  <!-- Help on usage                                                       -->
+  <!-- =================================================================== -->
+  <target name="usage">
+    <echo message=""/>
+    <echo message=""/>
+    <echo message="Jasmin Build file"/>
+    <echo message="-------------------------------------------------------------"/>
+    <echo message=""/>
+    <echo message=" available targets are:"/>
+    <echo message=""/>
+    <echo message="   all        --> builds all the jars in ./build"/>
+    <echo message="   parser     --> regenerates parser.java from parser.cup "/>
+    <echo message="   docs       --> builds the documentation in ./docs/api"/>
+    <echo message="   clean      --> restores distribution to original state"/>
+    <echo message="   sourcedist --> builds and zips the source distribution"/>
+    <echo message="   usage      --> (default) displays build menu"/>
+    <echo message=""/>
+    <echo message=" See the comments inside the build.xml file for more details."/>
+    <echo message="-------------------------------------------------------------"/>
+    <echo message=""/>
+    <echo message=""/>
+  </target>
+
+  <!-- =================================================================== -->
+  <!-- Prepares the build directory                                        -->
+  <!-- =================================================================== -->
+  <target name="prepare" depends="init">
+    <mkdir dir="${build.dir}"/>
+    <mkdir dir="${build.lib}"/>
+
+    <copy todir="${build.lib}">
+      <fileset dir="${lib.dir}"/>
+    </copy>
+
+  </target>
+
+  <!-- =================================================================== -->
+  <!-- Prepares the jasmin source code                                     -->
+  <!-- =================================================================== -->
+  <target name="prepare-jasmin" depends="prepare">
+    <mkdir dir="${build.jasmin.src}"/>
+    <mkdir dir="${build.jasmin.dest}"/>
+   
+    <copy todir="${build.jasmin.src}">
+      <fileset dir="${src.dir}"/>
+    </copy>
+  </target>
+
+  <!-- =================================================================== -->
+  <!-- Compiles the jasmin source code                                     -->
+  <!-- =================================================================== -->
+  <target name="compile-jasmin" depends="prepare-jasmin">
+    <javac srcdir="${build.jasmin.src}"
+           source="1.4"
+           destdir="${build.jasmin.dest}"
+           debug="${debug}"
+           deprecation="${deprecation}"
+           optimize="${optimize}"/>
+  </target>
+
+
+  <!-- =================================================================== -->
+  <!-- Creates the jasmin.jar in ./build                                   -->
+  <!-- =================================================================== -->
+  <target name="jasmin" depends="compile-jasmin">
+    <jar jarfile="${root.dir}/${name}.jar"
+         basedir="${build.jasmin.dest}"
+         manifest="${build.jasmin.src}/jasmin.mf"
+         includes="jasmin/*.class,jas/*.class,java_cup/runtime/*.class"/>
+  </target>
+
+  <!-- =================================================================== -->
+  <!-- Compiles the JavaCup library                                        -->
+  <!-- =================================================================== -->
+
+  <target name="compile-java_cup" depends="prepare-jasmin">
+    <mkdir dir="${build.jasmin.dest}/java_cup"/>
+    <javac srcdir="${build.jasmin.src}/java_cup"
+           source="1.4"
+           destdir="${build.jasmin.dest}/java_cup"
+           debug="${debug}"
+           deprecation="${deprecation}"
+           optimize="${optimize}"/>
+  </target>
+
+  <target name="java_cup" depends="compile-java_cup">
+    <jar jarfile="${root.dir}/lib/java_cup.jar"
+         basedir="${build.jasmin.dest}"
+         includes="java_cup/*.class,java_cup/runtime/*.class"/>
+  </target>
+
+  <!-- 
+  This task runs Java Cup to generate the Jasmin Parser (parser.java)
+  from the CUP file (parser.cup) in the Jasmin src directory. You only need to
+  run this task if you edit parser.cup.
+  -->  
+  <target name="parser" depends="java_cup">
+    <java classname="java_cup.Main" output="test.java" input="src/jasmin/parser.cup">
+		<classpath>
+			<pathelement location="${root.dir}/lib/java_cup.jar"/>
+        </classpath>
+    </java>
+	<move file="parser.java" tofile="src/jasmin/parser.java"/>
+	<move file="sym.java" tofile="src/jasmin/sym.java"/>
+          
+  </target>
+
+  <!-- =================================================================== -->
+  <!-- Build all jars in ./build                                           -->
+  <!-- =================================================================== -->
+  <target name="all" depends="jasmin,docs"/>
+
+  <!-- =================================================================== -->
+  <!-- Creates the API documentation in ./docs/api/                        -->
+  <!-- =================================================================== -->
+  <target name="docs">
+    <mkdir dir="${apidocs.dir}"/>
+    <javadoc packagenames="${packages}"
+             link="http://java.sun.com/j2se/1.4/docs/api"
+             sourcepath="${src.dir}"
+             destdir="${apidocs.dir}"
+             author="true"
+             additionalparam="-source 1.4"
+             version="true"
+             use="true"
+             splitindex="true"
+             noindex="false"
+             windowtitle="${Name} API"
+             doctitle="${Name}"
+             bottom="Copyright &#169; ${year} Jonathan Meyer, USA All rights reserved."             
+    />
+  </target>
+
+  <!-- =================================================================== -->
+  <!-- Build source distribution in ./dist                                 -->
+  <!-- =================================================================== -->
+  <target name="sourcedist" depends="clean">
+    <mkdir dir="${dist.root}"/>
+    <mkdir dir="${sourcedist.dir}"/>
+
+    <copy todir="${sourcedist.dir}">
+      <fileset dir="${root.dir}"/>
+    </copy>
+
+    <!-- Now delete what we dont want, probably a better way to do this -->
+    <delete dir="${sourcedist.dir}/dist"/>
+    <delete dir="${sourcedist.dir}/classes"/>
+
+    <zip zipfile="${dist.root}/${name}-${version}.zip"
+         basedir="${dist.root}/${name}-${version}"
+         whenempty="create"
+    />
+  </target>
+  
+  <!-- =================================================================== -->
+  <!-- Build compiled distribution in ./dist                               -->
+  <!-- =================================================================== -->
+  <target name="compiledist" depends="clean, all">
+    <mkdir dir="${dist.root}"/>
+    <mkdir dir="${compiledist.dir}"/>
+
+    <copy todir="${compiledist.dir}">
+      <fileset dir="${root.dir}"/>
+    </copy>
+
+    <!-- Now delete what we dont want, probably a better way to do this -->
+    <delete dir="${compiledist.dir}/dist"/>
+    <delete dir="${compiledist.dir}/build"/>
+
+
+    <zip zipfile="${dist.root}/${name}-${version}.zip"
+         basedir="${dist.root}/${name}-${version}"
+         whenempty="create"
+    />
+  </target>
+  
+  <!-- =================================================================== -->
+  <!-- Clean restores distribution to original state                       -->
+  <!-- =================================================================== -->
+  <target name="clean" depends="init">
+    <delete dir="${build.dir}"/>
+    <delete dir="${dist.root}"/>
+    <delete dir="${apidocs.dir}"/>
+  </target>
+</project>
+
+<!-- End of file -->
\ No newline at end of file
diff --git a/jasmin/jasmin-2.4/changes.txt b/jasmin/jasmin-2.4/changes.txt
new file mode 100644
index 0000000..4d16b64
--- /dev/null
+++ b/jasmin/jasmin-2.4/changes.txt
@@ -0,0 +1,114 @@
+Jasmin Revision History                                     Jonathan Meyer
+
+15 Oct 2004 - Release 1.1
+
+   * Switched to Ant Build System
+
+   * Moved java_cup and jas sources into src directory
+
+   * Updated documentation to use style sheets
+
+   * Changed docs to reflect using jar files rather than class files
+
+   * Uploaded to SourceForge
+
+
+-----------------------------------------------------------------------------
+
+11 Apr 97 - Release 1.06.
+
+11 Apr 97
+
+   * Fixed bug which prevented the source name from being written out
+     in the class file
+
+   * Improved README file
+
+2 Mar 97 - Release 1.05.
+
+1 Mar 97
+
+   * Moved scripts into a bin directory. 
+
+   * Added support for Visual J++.
+
+     Added vjasmin.bat, for running Jasmin using Visual J++.
+
+     Converted JAS/Jasmin to use its own internal RuntimeConstants, so that
+     there is no longer any dependency on Sun's version (needed by J++).
+
+   * Tidied API:
+
+     Renamed "Jasmin" class "ClassFile" (sorry to those of you using the API
+     from 1.04). The ClassFile class is documented in the doc/api directory.
+
+   * Mods for Java 1.1:
+
+     Classes now set the ACC_SUPER bit in their access flags.
+     i2b/i2s/i2c are now synonyms for int2byte, int2short, int2char.
+     invokespecial is now a synonym for invokenonvirtual.
+
+   * Mods to pick up documentation in book:
+    
+     "wide" is now a recognized instruction in Jasmin files - although the assembler
+     just ignores it!
+ 
+     Added the optional <high> parameter to tableswitch. 
+
+   * Fixed bug in .catch all
+    
+10 Feb 96 - Release 1.04.
+
+8 Feb 97
+   * Updated to use latest version of JAS. This fixes some bugs in the
+     earlier release (including handling of _w instructions)
+
+   * Split several of the internal classes into smaller pieces.
+
+   * Restructured internal sources so that Jasmin, Scanner and parser
+     no longer rely on static data structures. Now there is a public API
+     to Jasmin, for people that want to assemble classes using their own
+     data input/output streams.
+
+30 Oct 96
+
+   * Added support for more \ escapes in quoted strings. In
+     particular, you can now use \nnn to specify a character using
+     octal.
+
+2 Oct 96 - Release 1.03.
+
+1 Oct 96
+
+   * Added better support for interfaces: added the .interface
+     directive (an alternative to the .class directive), and also a
+     .implements directive. Updates guide.html to mention these new
+     features.
+
+24 Sept 96
+
+   * Fixed several problems with guide.html - thanks to feedback from
+     Shawn Silverman (umsilve1@cc.umanitoba.ca).
+
+23 Aug 96
+
+   * Tidied up documentation and implementation for wide instructions.
+
+     Now ldc and ldc_w are used for single-word items, whereas
+     ldc2_w is used for two word items (previously, I had ldc_w as
+     a synonym for ldc2_w - oops).
+
+25 July 96
+
+   * Added documentation for .var directive.
+
+   * Fixed line numbering produced by -g flag (I hope).
+
+   * Improved error reporting slightly.
+
+24 July 96
+
+   * Added fix to scanner to handle Ctrl-M characters,
+     for DOS/NT Systems. (Thanks sbk!)
+
+18 July 96 - Release 1.0.
diff --git a/jasmin/jasmin-2.4/docs/about.html b/jasmin/jasmin-2.4/docs/about.html
new file mode 100644
index 0000000..f891a75
--- /dev/null
+++ b/jasmin/jasmin-2.4/docs/about.html
@@ -0,0 +1,182 @@
+<html>
+<head>
+<title>About Jasmin</title>
+<link href="style.css" rel="stylesheet" type="text/css">
+</head>
+<body>
+<table>
+<tr><td width=550>
+<center>
+<p><img src=jasmin_icon.jpg></p>
+<p>
+<div class="h1">ABOUT JASMIN</div>
+Jonathan Meyer, July 1996
+</p>
+</center>
+
+<h1>Introduction</h1>
+
+This document tries to answer some questions you might have
+about Jasmin. In particular, several people have asked me what
+Jasmin is, why they might use Jasmin, and why I wrote it in the
+first place. I've tried to give some answers to these questions
+below.<p>
+
+<h1>Jasmin Assembler</h1>
+
+Jasmin is a Java Assembler Interface. It takes ASCII descriptions for Java
+classes, written in a simple assembler-like syntax using the Java Virtual
+Machine instructions set. It converts them into binary Java class files 
+suitable for loading into a Java interpreter.<p>
+
+To give you a flavor, here is the Jasmin assembly code for HelloWorld:<p>
+
+<pre>
+    .class public HelloWorld
+    .super java/lang/Object
+
+    ;
+    ; standard initializer (calls java.lang.Object's initializer)
+    ;
+    .method public &lt;init&gt;()V
+       aload_0
+       invokenonvirtual java/lang/Object/&lt;init&gt;()V
+       return
+    .end method
+
+    ;
+    ; main() - prints out Hello World
+    ;
+    .method public static main([Ljava/lang/String;)V
+       .limit stack 2   ; up to two items can be pushed
+
+       ; push System.out onto the stack
+       getstatic java/lang/System/out Ljava/io/PrintStream;
+
+       ; push a string onto the stack
+       ldc "Hello World!"
+
+       ; call the PrintStream.println() method.
+       invokevirtual java/io/PrintStream/println(Ljava/lang/String;)V
+
+       ; done
+       return
+    .end method
+
+</pre>
+
+<p>
+Jasmin was originally created as a companion to the book "Java Virtual Machine", 
+written by Jon Meyer and Troy Downing and published by O'Reilly Associates. The
+book is now out of print. Jasmin survives as a SourceForge Open Source project.
+</p>
+
+<h1>Motivation for Jasmin</h1>
+
+<p>
+Jasmin was written because, at the time that we wrote the Java Virtual Machine
+book for O'Reilly, Sun had not published an assembler format for the 
+Java virtual machine. 
+</p>
+
+<p>
+Generating a binary Java .class file is pretty fiddly. Its like
+creating an a.out (or .exe) file by hand. Even using a Java package like 
+JAS (a Java API for creating class files, used internally by Jasmin and written by KB Sriram), you 
+need to know a lot about the philosophy of the Java Virtual
+Machine before you can write something at the Virtual
+Machine level and generate a Java class. <p>
+
+We wanted something that made it very easy for a student or programmer
+to explore the Java Virtual Machine, or write a new language 
+which targets the VM, without getting into the details of constant
+pool indices, attribute tables, and so on.<p>
+
+<p>
+Creating a Java assembler seemed like a good solution.
+</p>
+
+<p>
+Unfortunately, Sun has not seen the need to define a standard Java 
+assembler format, and has not released tools perform Java assembly.
+</p>
+
+<p>Sun does provide a javap program which can print the assembly code
+in a class file. However, the javap output is inappropriate for 
+use as an assembler format. It is designed to be read by a person,
+not to be parsed by an assembler, so it has a number of
+omissions and drawbacks. </p>
+
+<p>
+Internally, Sun has a Java assembler tool. In hindsight, the syntax used by their internal tool is nicer than
+the Jasmin syntax. However, to my knowledge, their tool is still not widely available, nor is it a formally
+supported part of the Sun JDK.
+</p>
+
+<h1>Update on Jasmin Today (2004) </h1>
+ 
+Since Jasmin was written, it has become the de-facto standard assembly format for Java. It is used in dozens of compiler classes throughout the world, and has
+been ported and cloned multiple times. For better or worse, Jasmin remains the original Java assembler.
+<p>
+[As an interesting comparison, Microsoft .NET shipped out-of-box with an 
+assembler, a disassembler, a standard IL assembly format, and built-in libraries 
+for code-genning (generating classes on the fly). It would be great if Sun was
+as comprehensive in their support of the JVM].
+</p>
+
+<h1>What can I do with Jasmin?</h1>
+
+To give you some ideas, below are some theoretical Jasmin users/uses.<p>
+
+<h3>Teachers</h3>
+
+If you are teaching a compilers course, you could have students
+write a compiler which generates Jasmin assembly files,
+and then assembles those files into Java class files. Then you
+can integrate the advantages of the Virtual Machine (portability, 
+the verifier, an object model...) into your courseware.<p>
+
+<h3>Hobbyists</h3>
+
+Jasmin lets you poke around in Java at the VM level, so that
+you can gain a real understanding of how Java works and
+what the Virtual Machine is like.<p>
+
+<h3>System Implementors</h3>
+
+If you are implementing a Java runtime system, Jasmin is 
+an essential tool for generating test classes.<p>
+
+<h3>Advanced Programmers</h3>
+
+You could use Jasmin to write a critical class or method by 
+hand (e.g. if you think that Java isn't doing things 
+as well as it could). <p>
+
+Alternatively, you could create a syntax extension to the
+Java language which uses Jasmin (or JAS). <p>
+
+<h3>Language Implementors</h3>
+
+If you want to create an implementation of your
+favorite programming language which targets the 
+Virtual Machine, Jasmin may be a simpler approach than
+writing a Java class file generator. This is especially
+true if your compiler is implemented in something other
+than Java, since you can create Java class files easily
+without having to get involved in the details of the
+binary file format.<p>
+
+<h3>Security Wizards</h3>
+
+Sun's claim that the Java class verifier protects you from
+hostile programs is a pretty strong one. Jasmin lets you create
+'hostile' class files and see if a Java implementation is really as 
+secure as it should be. <p>
+
+<hr><address>Copyright (c) Jonathan Meyer, July 1996</address>
+
+<hr>
+<a href="http://jasmin.sourceforge.net">Jasmin Home</a> |
+<a href="http://www.cybergrain.com/">Jon Meyer's Home</a>
+
diff --git a/jasmin/jasmin-2.4/docs/guide.html b/jasmin/jasmin-2.4/docs/guide.html
new file mode 100644
index 0000000..6984b3f
--- /dev/null
+++ b/jasmin/jasmin-2.4/docs/guide.html
@@ -0,0 +1,689 @@
+<html>
+<head>
+<title>Jasmin User Guide</title>
+<link href="style.css" rel="stylesheet" type="text/css">
+</head>
+<body>
+<table>
+<tr><td width=550>
+<center>
+<p><img src=jasmin_icon.jpg></p>
+<p>
+<div class="h1">JASMIN USER GUIDE</div>
+Jonathan Meyer, July 1996
+</p>
+</center>
+
+<h1>About This Document</h1>
+
+This guide describes the rules and syntax used in Jasmin, and 
+how to run Jasmin. Note that this document doesn't
+explain the Java Virtual Machine itself, or give syntax notes for
+every instruction known to Jasmin. See the Java Virtual Machine specification
+for more information on the JVM.<p>
+
+<h1>What is Jasmin?</h1>
+
+<p>
+Jasmin is an assembler for the Java Virtual Machine. It takes 
+ASCII descriptions of Java classes, written in a simple 
+assembler-like syntax using the Java Virtual
+Machine instruction set. It converts them into binary Java class files, 
+suitable for loading by a Java runtime system.<p>
+</p>
+<p>
+Jasmin was originally created as a companion to the book "Java Virtual Machine", 
+written by Jon Meyer and Troy Downing and published by O'Reilly Associates. The
+book is now out of print. Jasmin survives as a SourceForge Open Source project.
+</p>
+
+<h1>Jasmin Design</h1>
+
+<p>
+Jasmin is designed as a simple assembler. It has a clean easy-to-learn 
+syntax with few bells and whistles.  Where possible, Jasmin adopts a
+one-to-one mapping between its syntax and the conventions followed by Java class files. 
+For example, package names in Jasmin are delimited with the '/' character 
+(e.g. "java/lang/String") used by the class file format, instead 
+of the '.' character (java.lang.String) used in the Java language.</p>
+
+<p>
+The Jasmin assembler does little compile-time processing or
+checking of the input code. For example, it doesn't check that
+classes you reference actually exist, or that your type descriptors are
+well formed. Jasmin also lacks many of the feautures
+found in full macro assemblers. For example, it doesn't
+inline mathematical expressions, perform variable
+substitutions, or support macros.</p>
+
+<p>
+On the other hand, using Jasmin you can quickly try out nearly
+all of the features of the Java Virtual Machine, including
+methods, fields, subroutines, exception handlers, and so on.
+The Jasmin syntax is also readable and compact.</p>
+
+<h1>Running Jasmin</h1>
+<p>
+The <code>jasmin.jar</code> file is an executable JAR file that runs Jasmin.
+For example:</p>
+
+<pre><strong>    java -jar jasmin.jar myfile.j</strong></pre>
+
+<p>assembles the file "myfile.j". Jasmin looks at the
+<code>.class</code> directive contained in the file to
+decide where to place the output class file. So if myfile.j starts
+with:</p>
+
+<pre>
+    .class mypackage/MyClass
+</pre>
+
+<p>then Jasmin will place the output class file "MyClass.class" in the
+subdirectory "mypackage" of the current directory. It will create the
+mypackage directory if it doesn't exist.</p>
+
+<p>You can use the "-d" option to tell jasmin to place the output
+in an alternative directory. For example,</p>
+
+<pre><strong>    java -jar jasmin.jar -d /tmp myfile.j </strong></pre>
+
+<p>will place the output in /tmp/mypackage/MyClass.class.</p>
+
+<p>Finally, you can use the "-g" option to tell Jasmin to include
+line number information (used by debuggers) in the resulting
+.class file. Jasmin will number the lines in the Jasmin source
+file that JVM instructions appear on. Then, if an error occurs,
+you can see what instruction in the Jasmin source caused the error.
+Note that specifying "-g" causes any .line directives within the
+Jasmin file to be ignored.
+</p>
+
+<h1>Statements</h1>
+
+<p>Jasmin source files consists of a sequence of newline-separated statements. 
+There are three types of statement: </p>
+
+<ul>
+<li>directives
+<li>instructions
+<li>labels
+</ul>
+
+<p>
+Directives and instructions can take <i>parameters</i>. These parameters 
+are placed on the same line as the directive or instruction, 
+separated by spaces.</p>
+
+<h3>Directives</h3>
+
+<p>
+Directive statements are used to give Jasmin meta-level information. 
+Directive statements consist of a directive name, and then zero or more
+parameters separated by spaces, then a newline.</p>
+
+<p>
+All directive names start with a "." character. The directives in Jasmin are:</p>
+
+<pre>
+    .catch .class .end .field .implements .interface .limit .line 
+    .method .source .super .throws .var
+</pre>
+
+<p>
+Some example directive statements are:</p>
+
+<pre>
+    .limit stack 10
+
+    .method public myMethod()V
+
+    .class Foo
+</pre>
+
+<p>
+The parameters used by each directive are described in more detail
+later in the document.</p>
+
+<h3>Instructions</h3>
+
+<p>
+An instruction statement consists of an instruction name, zero or
+more parameters separated by spaces, and a newline.</p>
+
+<p>
+Jasmin uses the standard mnemonics for JVM opcodes as instruction names. 
+For example, aload_1, bipush and iinc are all Jasmin instruction names.</p>
+
+<p>
+Here are some examples of instruction statements:</p>
+
+<pre>
+     ldc    "Hello World"
+     iinc   1 -1
+     bipush 10
+</pre>
+
+<p>
+</p>See <a href="instructions.html">Jasmin Instructions</a> for more details on
+the syntax of instructions in Jasmin.</p>
+
+
+<h3>Labels</h3>
+
+<p>
+</p>A Jasmin label statement consists of a name followed by a ':', and a newline.
+For example:</p>
+
+<pre>
+    Foo:
+
+    Label:
+</pre>
+
+<p>Label names cannot start with a numeric digit, and cannot contain
+any of the special characters:</p>
+
+<pre>
+   = : . " -
+</pre>
+
+<p>
+You cannot use directive names or instruction names as labels. Other 
+than that, there are few restrictions on label names. 
+For example, you could use the label:</p>
+
+<pre>
+   #_1:
+</pre>
+
+<p>
+Labels can only be used within method definitions. The names are 
+local to that method.</p>
+
+<h1>The Jasmin Tokenizer</h1>
+
+<p>
+Jasmin tokenizes its input stream, splitting the stream into tokens
+by looking for whitespace characters (spaces, tabs and newlines). 
+The tokenizer looks for:</p>
+
+<ul>
+<li>directive names
+<li>instruction names
+<li>labels
+<li>comments
+<li>type descriptor names
+<li>class names
+<li>numbers and quoted strings
+<li>etc.
+</ul>
+
+<p>
+The rules used by the tokenizer are described below:</p>
+
+<h3>Comments</h3>
+
+<p>
+A comment is a token that starts with a ';' character, and 
+terminates with the newline character at the end of the line. </p>
+
+<p>
+Note that the semicolon must be preceded by a whitespace character (a space, tab, newline), i.e.
+embedded semicolons are ignored. For example,</p>
+
+<pre>
+   abc;def
+</pre>
+
+<p>
+is treated as a single token "abc;def", and</p>
+
+<pre>
+   Ljava/lang/String;
+</pre>
+
+<p>
+is the token "Ljava/lang/String;", whereas</p>
+
+<pre>
+   foo ; baz ding
+</pre>
+
+<p>
+is the token "foo" followed by a comment "baz ding".</p>
+
+<h3>Numbers and Strings</h3>
+
+<p>
+In Jasmin, only simple decimal and integer numeric formats are 
+recognized. Floats in scientific or exponent format are not yet
+supported. Character codes and octal aren't currently supported either. This
+means you can have:</p>
+
+<pre>
+    1, 123, .25, 0.03, 0xA
+</pre>
+
+<p>
+but not</p>
+
+<pre>
+    1e-10, 'a', '\u123'
+</pre>
+
+<p>
+Quoted strings are also very basic. The full range of
+backslash escape sequences are not supported yet, although "\n" and "\t"
+are.</p>
+
+<h3>Class Names</h3>
+
+<p></p>Class names in Jasmin should be written using the Java class file format
+conventions, so java.lang.String becomes java/lang/String.</p>
+ 
+
+<h3>Type Descriptors</h3>
+
+<p>
+Type information is also written as they appear in class files (e.g. 
+the descriptor I speficies an integer, [Ljava/lang/Thread; is an 
+array of Threads, etc.).</p>
+
+<h3>Methods</h3>
+
+<p>
+Method names are specified using a single token, e.g.</p>
+
+<pre>
+     java/io/PrintStream/println(Ljava/lang/String;)V
+</pre>
+
+<p>
+is the method called "println" in the class java.io.PrintStream, which
+has the type descriptor "(Ljava/lang/String;)V" (i.e. it takes a String
+and returns no result). In general, a method specification
+is formed of three parts: the characters before the last '/' form the class
+name. The characters between the last '/' and '(' are the method name. The
+rest of the string is the type descriptor for the method.</p>
+
+<pre>
+     foo/baz/Myclass/myMethod(Ljava/lang/String;)V
+     ---------------         ---------------------
+           |         --------         |
+           |            |             |
+         class        method       descriptor
+
+</pre>
+
+<p>
+As another example, you would call the Java method: </p>
+
+<pre>
+   class mypackage.MyClass {
+       int foo(Object a, int b[]) { ... }
+   }
+</pre>
+
+<p>
+using:</p>
+
+<pre>
+   invokevirtual mypackage/MyClass/foo(Ljava/lang/Object;[I)I
+</pre>
+
+<h3>Fields</h3>
+
+<p>
+Field names are specified in Jasmin using two tokens, one giving the name
+and class of the field, the other giving its descriptor. For example:</p>
+
+<pre>
+    getstatic mypackage/MyClass/my_font   Ljava/lang/Font;
+</pre>
+
+<p>
+gets the value of the field called "my_font" in the class mypackage.MyClass.
+The type of the field is "Ljava/lang/Font;" (i.e. a Font object).</p>
+
+<h1>FILES</h1>
+
+<p>
+Jasmin files start by giving information on the class 
+being defined in the file - such as the name of the
+class, the name of the source file that the class originated from,
+the name of the superclass, etc.</p>
+
+<p>
+Typically, a Jasmin file starts with the three directives:</p>
+
+<pre>
+    .source &lt;source-file&gt;
+    .class  &lt;access-spec&gt; &lt;class-name&gt;
+    .super  &lt;class-name&gt;
+</pre>
+
+<p>
+For example, the file defining MyClass might start with the directives:</p>
+
+<pre>
+    .source MyClass.j
+    .class  public MyClass
+    .super  java/lang/Object
+</pre>
+
+<h3>.source directive</h3>
+
+<p>
+The .source directive is optional. It specifies the
+value of the "SourceFile" attribute for the class
+file. (This is used by Java to print out debugging info
+if something goes wrong in one of the methods in the class).
+If you generated the Jasmin file automatically (e.g. as the result of 
+compiling a file written in another syntax) you should use the .source
+directive to tell Java the name of the originating file. Note that
+the source file name should not include any pathname. Use "foo.src"
+but not "/home/user/foo.src".</p>
+
+<p>
+If no .source directive is given, the name of the Jasmin
+file you are compiling is used instead as the SourceFile attribute
+instead.</p>
+
+<h3>.class and .super directives</h3>
+
+<p>
+The .class and .super directive tell the JVM the name of this
+class and its superclass. These directives take parameters as
+follows: 
+</p>
+
+<dl>
+<dt>&lt;class-name&gt;</dt>
+<dd>is the full name of the class, including
+any package names. For example foo/baz/MyClass.<p>
+</dd>
+
+<dt>&lt;access-spec&gt;</dt>
+<dd>defines access permissions and other attributes for
+the class. This is a list of zero or more of the following
+keywords:<p>
+<dl><dd>
+   public, final, super, interface, abstract
+</dl>
+</dl>
+
+<h3>.interface directive</h3>
+
+<p>
+Note that, instead of using the directive .class,
+you can alternatively use the directive .interface. This has
+the same syntax as the .class directive, but indicates that the Jasmin file 
+is defining a Java interface. e.g.</p>
+
+<pre>
+    .interface public foo
+</pre>
+
+<h3>.implements directive</h3>
+
+<p>
+After .source, .class and .super, you can list the
+interfaces that are implemented by the class you are defining, using 
+the .implements directive. The syntax of .implements is:</p>
+
+<pre>
+    .implements &lt;class-name&gt;
+</pre>
+<p>
+where &lt;class-name&gt; has the same format as was used by .class and .super.
+For example:</p>
+
+<pre>
+    .class foo
+    .super java/lang/Object
+    .implements Edible
+    .implements java/lang/Throwable
+</pre>
+
+<h1>Field Definitions</h1>
+
+<p>
+After the header information, the next section of the Jasmin file
+is a list of field definitions.</p>
+
+<p>
+A field is defined using the .field directive:</p>
+
+<pre>
+    .field &lt;access-spec&gt; &lt;field-name&gt; &lt;descriptor&gt; [ = &lt;value&gt; ]
+</pre>
+
+<p>
+where:</p>
+
+<dl>
+<dt>&lt;access-spec&gt;
+<dd>is one of the keywords:
+<dl><dd>
+   public, private, protected, static, final,
+   volatile, transient
+</dl>
+</dl><p>
+
+<dt>&lt;field-name&gt;
+<dd>is the name of the field.<p>
+
+<dt>&lt;descriptor&gt;
+<dd>is its type descriptor.<p>
+
+<dt>&lt;value&gt;
+<dd>is an integer, a quoted string or a decimal number, giving the
+initial value of the field (for final fields).<p>
+</dl>
+
+<p>
+For example, the Java field definition:</p>
+
+<pre>
+    public int foo;
+</pre>
+
+<p>
+becomes</p>
+
+<pre>
+    .field public foo I
+</pre>
+
+<p>
+whereas the constant:</p>
+
+<pre>
+    public static final float PI = 3.14;
+</pre>
+
+<p>
+becomes</p>
+
+<pre>
+    .field public static final PI F = 3.14
+</pre>
+
+<h1>Method Definitions</h1>
+
+<p>
+After listing the fields of the class, the rest of the Jasmin file lists
+methods defined by the class.</p>
+
+<p>
+A method is defined using the basic form:</p>
+
+<pre>
+    .method &lt;access-spec&gt; &lt;method-spec&gt;
+        &lt;statements&gt;
+    .end method
+</pre>
+
+<p>
+where:</p>
+
+<dl>
+<dt>&lt;access-spec&gt;
+<dd>is one of the keywords: public, private, protected, static, final,
+synchronized, native, abstract<p>
+
+<dt>&lt;method-spec&gt;
+<dd>is the name and type descriptor of the method.<p>
+
+<dt>&lt;statements&gt;
+<dd>is the code defining the body of the method.<p>
+</dl>
+
+<p>
+Method definitions cannot be nested. Also, Jasmin does not
+insert an implicit 'return' instruction at the end of a method. It is
+up to you to ensure that your methods return cleanly. So
+the most basic Jasmin method is something like:</p>
+
+<pre>
+   .method foo()V
+       return     ; must give a return statement
+   .end method
+</pre>
+
+<h3>Method Directives</h3>
+
+<p>
+The following directives can be used only within method definitions:</p>
+
+<dl>
+<dt><pre>.limit stack &lt;integer&gt;</pre><p>
+<dd>Sets the maximum size of the operand stack
+required by the method.
+
+<dt><pre>.limit locals &lt;integer&gt;</pre><p>
+<dd>Sets the number of local variables
+required by the method.
+
+<dt><pre>.line &lt;integer&gt;</pre><p>
+<dd>This is used to tag the subsequent
+instruction(s) with a line number. Debuggers use this information,
+together with the name of the source file (see .source above) 
+to show at what line in a method things went wrong. If you are
+generating Jasmin files by compiling a source file,
+this directive lets you indicate what line 
+numbers in the source file produced corrosponding Jasmin
+instructions. For example:
+
+<pre>
+    .method foo()V
+    .line 5    
+        bipush 10    // these instructions generated from line 5
+        istore_2     // of the source file.
+    .line 6
+        ... 
+</pre>
+
+<dt><pre>.var &lt;var-number&gt; is  &lt;name&gt; &lt;descriptor&gt; from &lt;label1&gt; to &lt;label2&gt;</pre><p>
+<dd>The .var directive is used to define the name, type descriptor and scope of
+a local variable number. This information is used by debuggers 
+so that they can be more helpful when printing out the values of local
+variables (rather than printing just a local variable number, the
+debugger can actually print out the name of the variable). For example:
+
+<pre>
+    .method foo()V
+        .limit locals 1
+
+        ; declare variable 0 as an "int Count;"
+        ; whose scope is the code between Label1 and Label2
+        ;
+        .var 0 is Count I from Label1 to Label2
+
+    Label1:
+        bipush 10
+        istore_0
+    Label2:
+
+        return
+    .end method
+</pre>
+   
+<dt><pre>.throws &lt;classname&gt;</pre><p>
+<dd>Indicates that this method can throw
+exceptions of the type indicated by &lt;classname&gt;. 
+e.g.
+<pre>
+    .throws java/io/IOException
+</pre>
+
+This information isn't required by Java runtime systems,
+but it is used by the Java compiler to check that methods
+either catch exceptions they can cause, or declare 
+that they throw them. 
+
+<dt><pre>.catch &lt;classname&gt; from &lt;label1&gt; to &lt;label2&gt; using &lt;label3&gt;</pre><p>
+<dd>Appends an entry to the end of the exceptions table for the
+method. The entry indicates that when an exception which is
+an instance of &lt;classname&gt; or one of its subclasses is thrown
+while executing the code between &lt;label1&gt; and &lt;label2&gt;, then
+the runtime system should jump to &lt;label3&gt;. e.g.<p>
+<pre>
+    .catch java/io/IOException from L1 to L2 using IO_Handler
+</pre>
+
+If classname is the keyword "all", then exceptions of any
+class are caught by the handler.<p>
+
+</dl>
+
+<h3>Abstract Methods</h3>
+
+<p>
+To declare an abstract method, write a method with no body. e.g.</p>
+
+<pre>
+    .method abstract myAbstract()V
+    .end method
+</pre>
+
+<p>
+note that abstract methods can have .throws directives, e.g.</p>
+
+<pre>
+    .method abstract anotherAbstract()V
+        .throws java/io/IOException
+    .end method
+</pre>
+
+<h1>Instructions</h1>
+
+<p>
+JVM instructions are placed between the <code>.method</code> and
+<code>.end method</code> directives. VM instructions can take zero or more
+parameters, depending on the type of instruction used. Some example
+instructions are shown below:
+</p>
+
+<pre>
+    iinc 1 -3    ; decrement local variable 1 by 3
+
+    bipush 10    ; push the integer 10 onto the stack
+
+    pop          ; remove the top item from the stack.
+
+</pre>
+
+<p>
+See <a href="instructions.html">Jasmin Instructions</a> for more details on the syntax 
+of instructions in Jasmin.
+</p>
+
+<hr><address>Copyright (c) Jonathan Meyer, July 1996</address>
+<hr>
+<a href="http://jasmin.sourceforge.net">Jasmin Home</a> |
+<a href="http://www.cybergrain.com">Jon Meyer's Home</a>
+
+</td></tr></table>
+</body>
+</html>
diff --git a/jasmin/jasmin-2.4/docs/index.html b/jasmin/jasmin-2.4/docs/index.html
new file mode 100644
index 0000000..58ed3ed
--- /dev/null
+++ b/jasmin/jasmin-2.4/docs/index.html
@@ -0,0 +1,65 @@
+<html>
+<head>
+<title>Jasmin Home Page</title>
+<link href="style.css" rel="stylesheet" type="text/css">
+</head>
+<body>
+<table>
+<tr><td width=550>
+<center>
+<p><img src=jasmin_icon.jpg></p>
+<p>
+<div class="h1">JASMIN HOME PAGE</div>
+Jonathan Meyer, Oct 2004
+</p>
+</center>
+
+<h1>Introduction</h1>
+
+<p>
+Jasmin is an assembler for the Java Virtual Machine. It takes 
+ASCII descriptions of Java classes, written in a simple 
+assembler-like syntax using the Java Virtual
+Machine instruction set. It converts them into binary Java class files, 
+suitable for loading by a Java runtime system.<p>
+</p>
+
+<p>
+Jasmin was originally created as a companion to the book "Java Virtual Machine", 
+written by Jon Meyer and Troy Downing and published by O'Reilly Associates. 
+Since then, it has become the de-facto standard assembly format for Java. It is used in dozens of compiler classes throughout the world, and has
+been ported and cloned multiple times. For better or worse, Jasmin remains the oldest and the original Java assembler.
+</p>
+<p>
+The O'Reilly JVM book is now out of print. Jasmin continues to survive as a SourceForge Open Source project.
+</p>
+
+<h1>Documentation</h1>
+<dl>
+<dt>
+<a href = "http://jasmin.sourceforge.net">Jasmin Home Page</a>
+<dd>this file (on SourceForge.net).<p>
+
+<dt>
+<a href = "guide.html">Jasmin User Guide</a>
+<dd>a brief user guide for using Jasmin.<p>
+
+<dt><a href = "instructions.html">Jasmin Instructions</a>
+<dd>the syntax of JVM instructions in Jasmin.<p>
+
+<dt>
+<a href = "about.html">About Jasmin</a>
+<dd>describes the background to Jasmin, who might find it interesting, etc. 
+Includes an example piece of Jasmin assembler to look at.<p>
+
+</dl>
+
+
+<hr><address>Copyright (c) Jonathan Meyer, 2004</address>
+<hr>
+<a href="http://jasmin.sourceforge.net">Jasmin Home</a> |
+<a href="http://www.cybergrain.com">Jon Meyer's Home</a>
+
+</td></tr></table>
+</body>
+</html>
diff --git a/jasmin/jasmin-2.4/docs/instructions.html b/jasmin/jasmin-2.4/docs/instructions.html
new file mode 100644
index 0000000..725af99
--- /dev/null
+++ b/jasmin/jasmin-2.4/docs/instructions.html
@@ -0,0 +1,505 @@
+<html>
+<head>
+<title>Jasmin Instructions</title>
+<link href="style.css" rel="stylesheet" type="text/css">
+</head>
+<body>
+<table ID="Table1">
+<tr><td width=550>
+<center>
+<p><img src=jasmin_icon.jpg></p>
+<p>
+<div class="h1">JASMIN INSTRUCTIONS</div>
+Jonathan Meyer, July 1996
+</p>
+</center>
+
+<h1>Introduction</h1>
+
+This document shows the syntax and the types of parameters required by
+each Java VM instruction in Jasmin. It also shows brief illustrative
+examples.<p>
+
+See <a href="guide.html">The Jasmin User Guide</a> for a description
+of other aspects of the Jasmin syntax.<p>
+
+<h1>Local variable instructions</h1>
+
+The following instructions use local variables:<p>
+
+<pre>
+    ret &lt;var-num&gt;
+    aload &lt;var-num&gt;
+    astore &lt;var-num&gt;
+    dload &lt;var-num&gt;
+    dstore &lt;var-num&gt;
+    fload &lt;var-num&gt;
+    fstore &lt;var-num&gt;
+    iload &lt;var-num&gt;
+    istore &lt;var-num&gt;
+    lload &lt;var-num&gt;
+    lstore &lt;var-num&gt;
+</pre>
+
+for example:<p>
+
+<pre>
+    aload 1    ; push local variable 1 onto the stack
+    ret 2      ; return to the address held in local variable 2
+</pre>
+
+<h1>The bipush, sipush and iinc instructions</h1>
+
+The bipush and sipush instructions take an integer as a
+parameter:<p>
+
+<pre>
+    bipush &lt;int&gt;
+    sipush &lt;int&gt;
+</pre>
+
+for example:<p>
+
+<pre>
+    bipush 100    ; push 100 onto the stack
+</pre>
+
+The iinc instruction takes two integer parameters:<p>
+
+<pre>
+    iinc  &lt;var-num&gt; &lt;amount&gt;
+</pre>
+
+for example:<p>
+
+<pre>
+    iinc 3 -10    ; subtract 10 from local variable 3
+</pre>
+
+<h1>Branch instructions</h1>
+
+The following instructions take a label as a parameter:
+
+<pre>
+    goto  &lt;label&gt;
+    goto_w  &lt;label&gt;
+    if_acmpeq  &lt;label&gt;
+    if_acmpne  &lt;label&gt;
+    if_icmpeq  &lt;label&gt;
+    if_icmpge  &lt;label&gt;
+    if_icmpgt  &lt;label&gt;
+    if_icmple  &lt;label&gt;
+    if_icmplt  &lt;label&gt;
+    if_icmpne  &lt;label&gt;
+    ifeq  &lt;label&gt;
+    ifge  &lt;label&gt;
+    ifgt  &lt;label&gt;
+    ifle  &lt;label&gt;
+    iflt  &lt;label&gt;
+    ifne  &lt;label&gt;
+    ifnonnull  &lt;label&gt;
+    ifnull  &lt;label&gt;
+    jsr  &lt;label&gt;
+    jsr_w  &lt;label&gt;
+</pre>
+
+For example:<p>
+
+<pre>
+
+    Label1:
+       goto Label1    ; jump to the code at Label1
+                      ; (an infinite loop!)
+
+</pre>
+
+<h1>Class and object operations</h1>
+
+The following instructions take a class name
+as a parameter:
+
+<pre>
+    anewarray  &lt;class&gt;
+    checkcast  &lt;class&gt;
+    instanceof &lt;class&gt;
+    new        &lt;class&gt;
+</pre>
+
+For example:<p>
+
+<pre>
+    new java/lang/String   ; create a new String object
+</pre>
+
+<h1>Method invokation</h1>
+
+The following instructions are used to invoke methods:<p>
+
+<pre>
+    invokenonvirtual  &lt;method-spec&gt;
+    invokestatic      &lt;method-spec&gt;
+    invokevirtual     &lt;method-spec&gt;
+</pre>
+
+for example:<p>
+
+<pre>
+
+    ; invokes java.io.PrintStream.println(String);
+
+    invokevirtual java/io/PrintStream/println(Ljava/lang/String;)V
+
+</pre>
+
+A method specification is formed of three parts: the characters before the
+last '/' form the class name. The characters between the last '/' and '(' are
+the method name. The rest of the string is the descriptor.<p>
+
+<pre>
+     foo/baz/Myclass/myMethod(Ljava/lang/String;)V
+     ---------------         ---------------------
+           |         --------         |
+           |            |             |
+         class        method       descriptor
+</pre>
+
+
+A special case is invokeinterface, which takes a &lt;method-spec&gt; and
+an integer indicating how many arguments the method takes:<p>
+
+<pre>
+     invokeinterface &lt;method-spec&gt; &lt;num-args&gt;
+</pre>
+
+for example:<p>
+
+<pre>
+     invokeinterface foo/Baz/myMethod(I)V 1
+</pre>
+
+<h1>Field manipulation instructions</h1>
+
+The four instructions getfield, getstatic, putfield and
+putstatic have the form:<p>
+
+<pre>
+    getfield  &lt;field-spec&gt; &lt;descriptor&gt;
+    getstatic  &lt;field-spec&gt; &lt;descriptor&gt;
+    putfield  &lt;field-spec&gt; &lt;descriptor&gt;
+    putstatic  &lt;field-spec&gt; &lt;descriptor&gt;
+</pre>
+
+for example:
+
+<pre>
+    ; get java.lang.System.out, which is a PrintStream
+    getstatic java/lang/System/out Ljava/io/PrintStream;
+</pre>
+
+&lt;field-spec&gt; is composed of two parts, a classname and a fieldname. The
+classname is all of the characters in the &lt;field-spec&gt; up to the last
+'/' character, and the fieldname is the rest of the characters after the last
+'/'. For example: <p>
+
+<pre>
+      foo/baz/AnotherClass/anotherFunField
+      -- class name ------ --field name --
+</pre>
+
+&lt;descriptor&gt; is the Java type descriptor of the field.
+For example:<p>
+
+<pre>
+    Ljava/io/PrintStream;
+</pre>
+
+
+<h1>The newarray instruction</h1>
+
+The newarray instruction is followed by the type of the array,<p>
+
+<pre>
+    newarray  &lt;array-type&gt;
+</pre>
+
+for example:<p>
+
+<pre>
+    newarray int
+    newarray short
+    newarray float
+    etc.
+</pre>
+
+<h1>The multianewarray instruction</h1>
+
+The multianewarray instruction takes two parameters,
+the type descriptor for the array and the number of
+dimensions to allocate:<p>
+
+<pre>
+     multianewarray  &lt;array-descriptor&gt; &lt;num-dimensions&gt;
+</pre>
+
+for example:<p>
+
+<pre>
+     multianewarray [[[I 2
+</pre>
+
+<h1>The ldc and ldc_w instructions</h1>
+
+The ldc and ldc_w instructions are followed by a constant:<p>
+
+<pre>
+     ldc  &lt;constant&gt;
+     ldc_w  &lt;constant&gt;
+</pre>
+
+&lt;constant&gt; is either an integer, a floating point number, or a
+quoted string. For example:<p>
+
+<pre>
+     ldc 1.2              ; push a float
+     ldc 10               ; push an int
+     ldc "Hello World"    ; push a String
+     ldc_w 3.141592654    ; push PI as a double
+</pre>
+
+<h1>The lookupswitch instruction</h1>
+
+The lookupswitch instruction has the syntax:<p>
+
+<pre>
+    &lt;lookupswitch&gt; ::=
+        lookupswitch
+            &lt;int1&gt; : &lt;label1&gt;
+            &lt;int2&gt; : &lt;label2&gt;
+            ...
+            default : &lt;default-label&gt;
+</pre>
+
+For example:<p>
+
+<pre>
+    ; If the int on the stack is 3, jump to Label1.
+    ; If it is 5, jump to Label2.
+    ; Otherwise jump to DefaultLabel.
+
+    lookupswitch
+            3 : Label1
+            5 : Label2
+      default : DefaultLabel
+
+    Label1:
+       ... got 3
+
+    Label2:
+       ... got 5
+
+    DefaultLabel:
+       ... got something else
+</pre>
+
+<h1>The tableswitch instruction</h1>
+
+The tableswitch instruction has the syntax:<p>
+
+<pre>
+    &lt;tableswitch&gt; ::=
+        tableswitch &lt;low&gt;
+            &lt;label1&gt;
+            &lt;label2&gt;
+            ...
+            default : &lt;default-label&gt;
+</pre>
+
+For example:<p>
+
+<pre>
+  ; If the int on the stack is 0, jump to Label1.
+  ; If it is 1, jump to Label2.
+  ; Otherwise jump to DefaultLabel.
+
+  tableswitch 0
+        Label1
+        Label2
+     default : DefaultLabel
+
+  Label1:
+     ... got 0
+
+  Label2:
+     ... got 1
+
+  DefaultLabel:
+     ... got something else
+</pre>
+
+<h1>No parameter</h1>
+
+The following instructions (the majority) take no parameters:<p>
+
+<dl><dd>
+    aaload
+    aastore
+    aconst_null
+    aload_0
+    aload_1
+    aload_2
+    aload_3
+    areturn
+    arraylength
+    astore_0
+    astore_1
+    astore_2
+    astore_3
+    athrow
+    baload
+    bastore
+    breakpoint
+    caload
+    castore
+    d2f
+    d2i
+    d2l
+    dadd
+    daload
+    dastore
+    dcmpg
+    dcmpl
+    dconst_0
+    dconst_1
+    ddiv
+    dload_0
+    dload_1
+    dload_2
+    dload_3
+    dmul
+    dneg
+    drem
+    dreturn
+    dstore_0
+    dstore_1
+    dstore_2
+    dstore_3
+    dsub
+    dup
+    dup2
+    dup2_x1
+    dup2_x2
+    dup_x1
+    dup_x2
+    f2d
+    f2i
+    f2l
+    fadd
+    faload
+    fastore
+    fcmpg
+    fcmpl
+    fconst_0
+    fconst_1
+    fconst_2
+    fdiv
+    fload_0
+    fload_1
+    fload_2
+    fload_3
+    fmul
+    fneg
+    frem
+    freturn
+    fstore_0
+    fstore_1
+    fstore_2
+    fstore_3
+    fsub
+    i2d
+    i2f
+    i2l
+    iadd
+    iaload
+    iand
+    iastore
+    iconst_0
+    iconst_1
+    iconst_2
+    iconst_3
+    iconst_4
+    iconst_5
+    iconst_m1
+    idiv
+    iload_0
+    iload_1
+    iload_2
+    iload_3
+    imul
+    ineg
+    int2byte
+    int2char
+    int2short
+    ior
+    irem
+    ireturn
+    ishl
+    ishr
+    istore_0
+    istore_1
+    istore_2
+    istore_3
+    isub
+    iushr
+    ixor
+    l2d
+    l2f
+    l2i
+    ladd
+    laload
+    land
+    lastore
+    lcmp
+    lconst_0
+    lconst_1
+    ldiv
+    lload_0
+    lload_1
+    lload_2
+    lload_3
+    lmul
+    lneg
+    lor
+    lrem
+    lreturn
+    lshl
+    lshr
+    lstore_0
+    lstore_1
+    lstore_2
+    lstore_3
+    lsub
+    lushr
+    lxor
+    monitorenter
+    monitorexit
+    nop
+    pop
+    pop2
+    return
+    saload
+    sastore
+    swap
+</dl>
+
+for example:
+
+<pre>
+    pop         ; remove the top item from the stack
+    iconst_1    ; push 1 onto the stack
+    swap        ; swap the top two items on the stack
+</pre>
+
+<hr><address>Copyright (c) Jonathan Meyer, July 1996</address>
+<hr>
+<a href="http://mrl.nyu.edu/meyer/jvm/jasmin.html">Jasmin Home</a> |
+<a href="http://mrl.nyu.edu/meyer/">Jon Meyer's Home</a>
diff --git a/jasmin/jasmin-2.4/docs/jasmin_icon.jpg b/jasmin/jasmin-2.4/docs/jasmin_icon.jpg
new file mode 100644
index 0000000..ef8e772
Binary files /dev/null and b/jasmin/jasmin-2.4/docs/jasmin_icon.jpg differ
diff --git a/jasmin/jasmin-2.4/docs/javavm.gif b/jasmin/jasmin-2.4/docs/javavm.gif
new file mode 100644
index 0000000..fecebf0
Binary files /dev/null and b/jasmin/jasmin-2.4/docs/javavm.gif differ
diff --git a/jasmin/jasmin-2.4/docs/style.css b/jasmin/jasmin-2.4/docs/style.css
new file mode 100644
index 0000000..7f87f1e
--- /dev/null
+++ b/jasmin/jasmin-2.4/docs/style.css
@@ -0,0 +1,16 @@
+
+td { font-family: Verdana,Arial,Helvetica,sans-serif; color: #000000; font-size: 12px; line-height: 16px; }
+td h1 { font-family: Tahoma; padding: 1px; padding-left: 4px; color: white; background-color: #303030; font-size: 20px; line-height: 24px; font-weight: bold; }
+td h2{ font-family: Tahoma; color: #000000; font-size: 14px; line-height: 16px; font-weight: bold; }
+td h3 { font-family: Tahoma; color: #000000; font-size: 12px; line-height: 16px; font-weight: bold; }
+
+.h1 { font-family: Times; color: #000000; font-size: 18px; line-height: 20px; font-weight: bold; }
+
+/* main text hyperlinks */
+a { color: #b11; TEXT-DECORATION: underline; }
+a:visited {color: #b11}
+a:hover {color: #f88}
+
+pre.code{ font-family: courier new; color: #202060; font-size: 12px; line-height: 14px;}
+font.code{ font-family: courier new; color: #202060; font-size: 12px; line-height: 14px;}
+
diff --git a/jasmin/jasmin-2.4/docs/syntax.bnf b/jasmin/jasmin-2.4/docs/syntax.bnf
new file mode 100644
index 0000000..d5cb2a4
--- /dev/null
+++ b/jasmin/jasmin-2.4/docs/syntax.bnf
@@ -0,0 +1,88 @@
+Jasmin Syntax                               Jonathan Meyer, April 1996
+
+This file contains a simplified BNF version of the Jasmin syntax.
+
+    jasmin_file ::=
+        '.class' [ <access> ] <name> <break>
+        '.super' <name> <break>
+        [ <fields> ]
+        [ <methods> ]
+
+
+    <fields> ::= <field> [ <field> ... ] 
+
+    <field> ::=
+        '.field' <access> <name> <signature> [ = <default> ] <break>
+
+    <default> ::=  <int> | <quoted_string> | <float> 
+
+
+    <methods> ::= <method> [ <method> ... ] 
+
+    <method> ::=
+        '.method' <access> <name> <break>
+            [ <statements> ]
+        '.end' 'method' <break>
+
+    <statements> ::= <statement> [ <statement> ... ] 
+
+    <statement> ::=
+        <directive> <break>
+        |
+        <instruction> <break>
+        |
+        <label> ':' <break>
+
+    <directive> ::=
+        '.limit' 'stack' <val>
+        |
+        '.limit' 'locals' <val>
+        |
+        '.throws' <classname>
+        |
+        '.catch' <classname> 'from' <label1> 'to' <label2> 'using' <label3>
+
+    <instruction> ::= <simple_instruction> | <complex_instruction> 
+
+    <simple_instruction> ::=
+        <insn>
+        |
+        <insn> <int> <int>
+        |
+        <insn> <int>
+        |
+        <insn> <num>
+        |
+        <insn> <word>
+        |
+        <insn> <word> <int>
+        |
+        <insn> <word> <word>
+        |
+        <insn> <quoted_string>
+
+    <complex_instruction> ::=
+        <lookupswitch>
+        |
+        <tableswitch>
+
+    <lookupswitch> ::=
+        lookupswitch <nl>
+            <int> : <label> <nl>
+            <int> : <label> <nl>
+            ...
+            default : <label>
+
+    <tableswitch> ::=
+        tableswitch <low>  <nl>
+            <label> <nl>
+            <label> <nl>
+            ...
+            default : <label>
+
+    <access> ::= <access_item> [ <access_item> ... ] 
+
+    <access_item> ::=
+        'public' | 'private' | 'protected' | 'static' | 'final' |
+        'synchronized' | 'volatile' | 'transient' | 'native' |
+        'interface' | 'abstract' 
diff --git a/jasmin/jasmin-2.4/examples/ANewArray.j b/jasmin/jasmin-2.4/examples/ANewArray.j
new file mode 100644
index 0000000..d0dde42
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/ANewArray.j
@@ -0,0 +1,52 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/ANewArray.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Shows how to use anewarray instruction
+; -------------------------------------------------------------------------
+;
+; This class demonstrates how to allocate a multidimensional
+; array using anewarray.
+;
+
+.class public examples/ANewArray
+.super java/lang/Object
+
+.method public <init>()V
+   aload_0
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+   .limit stack 4
+   .limit locals 2
+
+    ;
+    ; Allocates an array like:
+    ;      String x[][] = new String[2][5]
+    ;
+
+    ; Allocate spine for array and store it in local var 1
+    ; (i.e. String[2][])
+
+    iconst_2
+    anewarray [Ljava/lang/String;
+    astore_1
+
+    ; allocate first array of String[5] and store it in index 0
+    aload_1
+    iconst_0
+    bipush 5
+    anewarray java/lang/String
+    aastore
+
+    ; allocate second array of String[5] and store it in index 1
+    aload_1
+    iconst_1
+    bipush 5
+    anewarray java/lang/String
+    aastore
+
+    ; done ...
+    return
+.end method
diff --git a/jasmin/jasmin-2.4/examples/AnInterface.j b/jasmin/jasmin-2.4/examples/AnInterface.j
new file mode 100644
index 0000000..5f83e89
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/AnInterface.j
@@ -0,0 +1,31 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/AnInterface.j
+; Author:    Jonathan Meyer, 1 Oct 1996
+; Purpose:   A Java interface written in Jasmin
+; -------------------------------------------------------------------------
+
+;
+; This file shows how to use Jasmin to define an interface. It
+; is like the Java code:
+; 
+; interface public examples.AnInterface {
+;     void foo();
+; }
+;
+; See examples.Implementor for an example of a class that implements
+; this interface.
+;
+
+.interface public examples/AnInterface
+.super java/lang/Object     
+
+; (Interfaces should either inherit from Object, or from 
+;  another interface.)
+
+;
+; declare abstract method foo() - note that the method body is empty.
+;
+.method abstract foo()V
+.end method
+
+
diff --git a/jasmin/jasmin-2.4/examples/Arrays.j b/jasmin/jasmin-2.4/examples/Arrays.j
new file mode 100644
index 0000000..43a2b5c
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/Arrays.j
@@ -0,0 +1,53 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/Arrays.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Example using JVM's anewarray and aaload/aastore
+; -------------------------------------------------------------------------
+
+;
+; This illustrates how to use the various JVM array instructions - though
+; it doesn't actually do anything very interesting with the arrays.
+;
+
+.class public examples/Arrays
+.super java/lang/Object
+
+; standard initializer
+.method public <init>()V
+   aload_0
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+   .limit locals 2
+   .limit stack 4
+
+   ; creates a new array of strings,
+   ; like:
+   ;      String[] myarray = new String[2];
+   iconst_2
+   anewarray java/lang/String
+   astore_1  ; stores this in local variable 1
+
+   ; this is like the code:
+   ;      myarray[0] = args[0];
+
+   aload_1     ; push my array on the stack
+   iconst_0
+   aload_0     ; push the array argument to main() on the stack
+   iconst_0
+   aaload      ; get its zero'th entry
+   aastore     ; and store it in my zero'th entry
+
+   ; now print out myarray[0]
+
+   getstatic java/lang/System/out Ljava/io/PrintStream;
+   aload_1
+   iconst_0
+   aaload
+   invokevirtual java/io/PrintStream/println(Ljava/lang/String;)V
+
+   ; done
+   return
+.end method
diff --git a/jasmin/jasmin-2.4/examples/Catch.j b/jasmin/jasmin-2.4/examples/Catch.j
new file mode 100644
index 0000000..d3ace71
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/Catch.j
@@ -0,0 +1,79 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/Catch.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Catching and throwing exceptions
+; -------------------------------------------------------------------------
+
+;
+; This hows how to throw and catch Exceptions in Jasmin
+;
+
+.class public examples/Catch
+.super java/lang/Object
+
+; standard initializer
+.method public <init>()V
+    aload_0
+    invokenonvirtual java/lang/Object.<init>()V
+    return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+
+    .limit locals 3
+    .limit stack 5
+
+    ; set up a handler to catch subclasses of java.lang.Exception
+    .catch java/lang/Exception from Label1 to Label2 using Handler
+
+    ; store System.out in local variable 1
+    getstatic java/lang/System/out Ljava/io/PrintStream;
+    astore_1
+
+    ; print out a message
+    aload_1
+    ldc " -- Before exception"
+    invokevirtual java/io/PrintStream/println(Ljava/lang/String;)V
+
+    ; construct an instance of Exception, initialize it with a string,
+    ; throw it. This is like the Java statement :
+    ;
+    ;     throw new Exception("My exception");
+    ;
+
+Label1:
+    new java/lang/Exception
+    dup
+    ldc "<my exception>"
+    invokenonvirtual java/lang/Exception/<init>(Ljava/lang/String;)V
+    athrow
+
+Label2:
+    aload_1
+    ldc " -- After exception"
+    invokevirtual java/io/PrintStream/println(Ljava/lang/String;)V
+
+    return
+
+    ; This is the handler for the exception
+
+Handler:
+    ; store the exception in local variable 2
+    astore_2
+
+    ; print out a message
+    aload_1
+    ldc " -- Caught exception: "
+    invokevirtual java/io/PrintStream/print(Ljava/lang/String;)V
+
+    ; call getMessage() to retrieve the message from the Exception...
+    aload_1
+    aload_2
+    invokevirtual java/lang/Throwable/getMessage()Ljava/lang/String;
+    ; ... now print it
+    invokevirtual java/io/PrintStream/println(Ljava/lang/String;)V
+
+    ; return to the code
+    goto Label2
+
+.end method
diff --git a/jasmin/jasmin-2.4/examples/Checkcast.j b/jasmin/jasmin-2.4/examples/Checkcast.j
new file mode 100644
index 0000000..e7ee1a0
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/Checkcast.j
@@ -0,0 +1,35 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/Checkcast.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Catching and throwing exceptions
+; -------------------------------------------------------------------------
+
+
+
+;
+; Simple test for checkcast instruction
+;
+
+.class examples/Checkcast
+.super java/lang/Object
+
+;
+; standard initializer
+.method public <init>()V
+   aload_0
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+   .limit stack 2
+
+   ; push System.out onto the stack
+   getstatic java/lang/System/out Ljava/io/PrintStream;
+
+   ; check that it is a PrintStream
+   checkcast java/io/PrintStream
+
+   ; done
+   return
+.end method
diff --git a/jasmin/jasmin-2.4/examples/Count.j b/jasmin/jasmin-2.4/examples/Count.j
new file mode 100644
index 0000000..2cbc7f0
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/Count.j
@@ -0,0 +1,56 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/Count.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Counts from 0 to 9, printing out the value
+; -------------------------------------------------------------------------
+
+.class public examples/Count
+.super java/lang/Object
+
+;
+; standard initializer
+.method public <init>()V
+   aload_0
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+       ; set limits used by this method
+       .limit locals 4
+       .limit stack 3
+
+       ; setup local variables:
+
+       ;    1 - the PrintStream object held in java.lang.System.out
+       getstatic java/lang/System/out Ljava/io/PrintStream;
+       astore_1
+
+       ;    2 - the integer 10 - the counter used in the loop
+       bipush 10
+       istore_2
+
+       ; now loop 10 times printing out a number
+
+     Loop:
+
+       ; compute 10 - <local variable 2> ...
+       bipush 10
+       iload_2
+       isub
+       invokestatic java/lang/String/valueOf(I)Ljava/lang/String;
+       astore_3
+       ; ... and print it
+       aload_1    ; push the PrintStream object
+       aload_3    ; push the string we just created - then ...
+       invokevirtual java/io/PrintStream/println(Ljava/lang/String;)V
+
+       ; decrement the counter and loop
+       iinc 2 -1
+       iload_2
+       ifne Loop
+
+       ; done
+       return
+
+.end method
diff --git a/jasmin/jasmin-2.4/examples/HelloWeb.html b/jasmin/jasmin-2.4/examples/HelloWeb.html
new file mode 100644
index 0000000..d68ae61
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/HelloWeb.html
@@ -0,0 +1,5 @@
+
+This shows how to run HelloApplet:<p>
+
+<applet code="HelloWeb.class" width=350 height=75>
+</applet>
diff --git a/jasmin/jasmin-2.4/examples/HelloWeb.j b/jasmin/jasmin-2.4/examples/HelloWeb.j
new file mode 100644
index 0000000..45167a7
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/HelloWeb.j
@@ -0,0 +1,91 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/HelloWeb.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Demonstration of a Jasmin-created applet
+; -------------------------------------------------------------------------
+; HelloWeb.j
+
+; This demonstrates how you can use Jasmin to create an applet.
+
+; The code below is like the Java code:
+;
+;     import java.applet.*;
+;     import java.awt.*;
+;
+;     public class HelloWeb extends Applet {
+;        private Font font;
+;
+;        public void init() {
+;            font = new Font("Helvetica", Font.BOLD, 48);
+;        }
+;
+;        public void paint(Graphics g) {
+;            g.setFont(font);
+;            g.drawString("Hello World!", 25, 50);
+;        }
+;     }
+
+
+.class public HelloWeb
+.super java/applet/Applet
+
+.field private font Ljava/awt/Font;
+
+
+; my init() method - allocate a font and assign it to this.font.
+
+.method public init()V
+    .limit stack 5
+
+    ; Create a new Font and call its constructor with
+    ; "Helvetica", 1 (i.e. Font.BOLD), and 48.
+
+    new java/awt/Font
+    dup
+    ldc "Helvetica"
+    iconst_1
+    bipush 48
+    invokenonvirtual java/awt/Font/<init>(Ljava/lang/String;II)V
+
+    ; now store the Font on the stack in this.font
+    aload_0
+    swap
+    putfield HelloWeb/font Ljava/awt/Font;
+
+    ; done
+    return
+.end method
+
+; my paint() method - draws the string "Hello World!" using this.font.
+
+.method public paint(Ljava/awt/Graphics;)V
+    .limit stack 4
+    .limit locals 2
+
+    ; local variable 0 holds <this>
+    ; local variable 1 holds the java.awt.Graphics instance ('g').
+
+    ; g.setFont(this.font);
+    aload_1
+    aload_0
+    getfield HelloWeb/font Ljava/awt/Font;
+    invokevirtual java/awt/Graphics/setFont(Ljava/awt/Font;)V
+
+    ; g.drawString("Hello Web!", 25, 50);
+    aload_1
+    ldc "Hello Web!"
+    bipush 25
+    bipush 50
+    invokevirtual java/awt/Graphics/drawString(Ljava/lang/String;II)V
+
+    ; done
+    return
+.end method
+
+
+; standard constructor
+.method public <init>()V
+    aload_0
+    invokenonvirtual java/applet/Applet/<init>()V
+    return
+.end method
diff --git a/jasmin/jasmin-2.4/examples/HelloWorld.class b/jasmin/jasmin-2.4/examples/HelloWorld.class
new file mode 100644
index 0000000..1351fa2
Binary files /dev/null and b/jasmin/jasmin-2.4/examples/HelloWorld.class differ
diff --git a/jasmin/jasmin-2.4/examples/HelloWorld.j b/jasmin/jasmin-2.4/examples/HelloWorld.j
new file mode 100644
index 0000000..032ae27
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/HelloWorld.j
@@ -0,0 +1,35 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/HelloWorld.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Prints out "Hello World!"
+; -------------------------------------------------------------------------
+
+
+.class public NoJad.j
+.super java/lang/Object
+
+;
+; standard initializer
+.method public <init>()V
+   aload_0
+ 
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+   .limit stack 2
+   .limit locals 2
+   
+   bipush 2
+   astore 0
+   bipush 3
+   astore 1
+
+   aload 0
+   aload 1
+   astore 0
+   astore 1
+
+   return
+.end method
diff --git a/jasmin/jasmin-2.4/examples/Implementor.j b/jasmin/jasmin-2.4/examples/Implementor.j
new file mode 100644
index 0000000..cc3c8be
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/Implementor.j
@@ -0,0 +1,53 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/HelloWorld.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Shows how to define a class that implements an interface
+; -------------------------------------------------------------------------
+
+;
+; This class implements the examples.AnInterface interface - see
+; AnInterface.j
+;
+.class public examples/Implementor
+.super java/lang/Object
+.implements examples/AnInterface
+
+;
+; standard initializer
+;
+.method public <init>()V
+   aload_0
+
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+;
+; implement the foo()V method - this is an interface method
+;
+.method public foo()V
+   .limit stack 2
+
+   ; print a simple message
+   getstatic java/lang/System/out Ljava/io/PrintStream;
+   ldc "Hello Interface"
+   invokevirtual java/io/PrintStream/println(Ljava/lang/String;)V
+
+   ; done
+   return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+    .limit stack 2
+
+    ; create a new one of me
+    new examples/Implementor
+    dup
+    invokenonvirtual examples/Implementor/<init>()V
+   
+    ; now call my interface method foo()
+    invokeinterface examples/AnInterface/foo()V 1
+
+    return
+.end method
+
diff --git a/jasmin/jasmin-2.4/examples/InvokeInterface.j b/jasmin/jasmin-2.4/examples/InvokeInterface.j
new file mode 100644
index 0000000..f9de120
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/InvokeInterface.j
@@ -0,0 +1,45 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/InvokeInterface.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Example of using invokeinterface
+; -------------------------------------------------------------------------
+;
+; Demonstrates invoking an interface method
+;
+
+.class public examples/InvokeInterface
+.super java/lang/Object
+
+; standard initializer
+.method public <init>()V
+   aload_0
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+;
+; This is a rather silly example - since the result of calling the
+; interface method isn't actually used. But it does illustrate how to
+; use invokeinterface.
+;
+
+.method public example(Ljava/util/Enumeration;)V
+    .limit stack 1
+    .limit locals 3
+
+    ; push local variable 1 (the Enumeration object)
+    aload_1
+
+    ; now call the hasMoreElements() interface method.
+    invokeinterface java/util/Enumeration/hasMoreElements()Z 1
+
+    ; store the integer result in local variable 2
+    istore_2
+
+    ; done
+    return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+    return
+.end method
diff --git a/jasmin/jasmin-2.4/examples/MultiANewArray.j b/jasmin/jasmin-2.4/examples/MultiANewArray.j
new file mode 100644
index 0000000..48a7f98
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/MultiANewArray.j
@@ -0,0 +1,37 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/MultiANewArray.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Example of multanewarray instruction
+; -------------------------------------------------------------------------
+;
+; This illustrates how to use multianewarray to allocate
+; an array.
+;
+
+.class public examples/MultiANewArray
+.super java/lang/Object
+
+; standard initializer
+.method public <init>()V
+   aload_0
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+
+   .limit locals 4
+   .limit stack 2
+
+   ;
+   ; This allocates an array like:
+   ;
+   ;      String s[][] = new String[2][5];
+   ;
+   iconst_2
+   iconst_5
+   multianewarray [[Ljava/lang/String; 2
+   astore_1
+
+   return
+.end method
diff --git a/jasmin/jasmin-2.4/examples/MultiArrays.j b/jasmin/jasmin-2.4/examples/MultiArrays.j
new file mode 100644
index 0000000..1bc6c88
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/MultiArrays.j
@@ -0,0 +1,55 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/MultiArrays.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Examples involving multi-dimensional arrays
+; -------------------------------------------------------------------------
+;
+; This illustrates how to use multi-dimensional arrays in the Java VM
+; (though it doesn't actually do anything very interesting with the arrays.)
+;
+
+.class public examples/MultiArrays
+.super java/lang/Object
+
+; standard initializer
+.method public <init>()V
+   aload_0
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+
+   .limit locals 4
+   .limit stack 5
+
+   ; this is like:
+   ;    new int[2][5][]
+   iconst_2
+   iconst_5
+   multianewarray [[[I 2
+
+   ; store the result in local variable 1
+   astore_1
+
+   aload_1
+   iconst_1
+   aaload     ; stack now contains x[0]
+   astore_2   ; store the array in local variable 2
+
+   ; create a new array of 50 ints and store it in x[1][1]
+   aload_2
+   iconst_1
+   bipush 50
+   newarray int
+   aastore
+
+   ; create a new array of 60 ints and store it in x[1][2]
+   aload_2
+   iconst_2
+   bipush 60
+   newarray int
+   aastore
+
+   return
+.end method
diff --git a/jasmin/jasmin-2.4/examples/NewArray.j b/jasmin/jasmin-2.4/examples/NewArray.j
new file mode 100644
index 0000000..51b1c5b
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/NewArray.j
@@ -0,0 +1,41 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/NewArray.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Example of newarray
+; -------------------------------------------------------------------------
+;
+; Example showing how to allocate an array using
+; newarray.
+;
+
+.class public examples/NewArray
+.super java/lang/Object
+
+.method public <init>()V
+   aload_0
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+   .limit stack 4
+   .limit locals 2
+
+   ; create an array like:
+   ;
+   ;     boolean b[] = new boolean[2]
+   ;
+   ; (stores it in local var 1)
+
+   iconst_2
+   newarray boolean
+   astore_1
+
+   ; b[0] = true;
+   aload_1
+   iconst_0
+   iconst_1
+   bastore
+
+   return
+.end method
diff --git a/jasmin/jasmin-2.4/examples/Switch.j b/jasmin/jasmin-2.4/examples/Switch.j
new file mode 100644
index 0000000..6991eec
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/Switch.j
@@ -0,0 +1,41 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/Switch.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Shows usage of lookupswitch and tableswitch
+; -------------------------------------------------------------------------
+
+;
+; Illustrates lookupswitch and tableswitch syntax for Jasmin
+;
+
+.class public examples/Switch
+.super java/lang/Object
+
+.method public <init>()V
+   aload_0
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+   .limit stack 3
+
+   iconst_1
+   lookupswitch
+	1 : Hello
+	2 : Goodbye
+     default : Foo
+
+   iconst_1
+   tableswitch 0
+	Hello
+	Goodbye
+     default : Foo
+
+Hello:
+Goodbye:
+Foo:
+
+   return
+
+.end method
diff --git a/jasmin/jasmin-2.4/examples/Uncaught.j b/jasmin/jasmin-2.4/examples/Uncaught.j
new file mode 100644
index 0000000..3a4121a
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/Uncaught.j
@@ -0,0 +1,36 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/Uncaught.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Throws an exception - doesn't catch it
+; -------------------------------------------------------------------------
+
+;
+; This example class contains a main() method that throws
+; an exception but doesn't catch it -
+;
+.source Uncaught.j
+.class public examples/Uncaught
+.super java/lang/Object
+
+; specify the initializer method (as for HelloWorld)
+
+.method public <init>()V
+    ; just call Object's initializer
+    aload_0
+    invokenonvirtual java/lang/Object/<init>()V
+    return
+.end method
+
+; specify the "main" method - this throws an uncaught exception
+
+.method public static main([Ljava/lang/String;)V
+    .limit stack 2
+
+    new java/lang/Exception
+    dup
+    invokenonvirtual java/lang/Exception/<init>()V
+    athrow
+
+    ; without this the verifier might complain ...
+    return
+.end method
diff --git a/jasmin/jasmin-2.4/examples/VerifyTest.j b/jasmin/jasmin-2.4/examples/VerifyTest.j
new file mode 100644
index 0000000..cbd5713
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/VerifyTest.j
@@ -0,0 +1,41 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/VerifyTest.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Treats an int as an object - should alert the Verifier
+; -------------------------------------------------------------------------
+
+;
+; This code demonstrates the verifier at work. See also VerifyTest1.j.
+;
+; The main() method below tries to clone the integer 100 - this
+; is clearly an error since clone() expects an Object, not an integer.
+;
+; If you run this with no verification on, it is likely to crash the
+; interpreter. Running this with the -verify option produces a
+; Verifier error.
+;
+
+; This is similar to the Java code:
+;
+;    class VerifyTest {
+;        public static void main(String args[]) {
+;            int x = 100;
+;            x.clone();
+;        }
+;     }
+
+
+.class public examples/VerifyTest
+.super java/lang/Object
+
+.method public <init>()V
+   aload_0
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+    bipush 100
+    invokevirtual java/lang/Object/clone()Ljava/lang/Object;
+    return
+.end method
diff --git a/jasmin/jasmin-2.4/examples/VerifyTest1.j b/jasmin/jasmin-2.4/examples/VerifyTest1.j
new file mode 100644
index 0000000..4fa854f
--- /dev/null
+++ b/jasmin/jasmin-2.4/examples/VerifyTest1.j
@@ -0,0 +1,62 @@
+; --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+; File:      jasmin/examples/VerifyTest1.j
+; Author:    Jonathan Meyer, 10 July 1996
+; Purpose:   Trys to pull one on the verifier
+; -------------------------------------------------------------------------
+
+; This file illustrates the bytecode verifier at work - the
+; code in the example() method below seems reasonable, but
+; Java's bytecode verifier will fail the code because the two points leading
+; to the Loop label (from the top of the method and from the ifne
+; statement) have different stack states.  Instead, a different approach
+; must be adopted  - e.g. by allocating an array, or simply writing:
+;
+;    aconst_null
+;    aconst_null
+;    aconst_null
+;    aconst_null
+
+; Note that many interpreters will run this code OK if you don't use
+; a verifier. The code itself is well behaved (it doesn't trash the
+; interpreter), but the approach it uses is disallowed by the verifier.
+;
+
+; Compile the example, then run it using:
+;
+;     % java -verify VerifyTest1
+;     VERIFIER ERROR VerifyTest1.example()V:
+;     Inconsistent stack height 1 != 0
+;
+
+.class public examples/VerifyTest1
+.super java/lang/Object
+
+.method public <init>()V
+   aload_0
+   invokenonvirtual java/lang/Object/<init>()V
+   return
+.end method
+
+.method public example()V
+    .limit locals 2
+    .limit stack  10
+
+    ; this tries to push four nulls onto the stack
+    ; using a loop - Java's verifier will fail this program
+
+    iconst_4     ; store 4 in local variable 1 (used as a counter)
+    istore_1
+
+  Loop:
+    aconst_null  ; push null onto the stack
+    iinc 1 -1    ; decrement local variable 4 (the counter variable)
+    iload_1
+    ifne Loop    ; jump back to Loop unless the variable has reached 0
+
+    return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+    ; - do nothing : this is only to illustrate the bytecode verifier at work.
+    return
+.end method
diff --git a/jasmin/jasmin-2.4/html2x/jasmin_icon.jpg b/jasmin/jasmin-2.4/html2x/jasmin_icon.jpg
new file mode 100644
index 0000000..ef8e772
Binary files /dev/null and b/jasmin/jasmin-2.4/html2x/jasmin_icon.jpg differ
diff --git a/jasmin/jasmin-2.4/html2x/style.css b/jasmin/jasmin-2.4/html2x/style.css
new file mode 100644
index 0000000..7f87f1e
--- /dev/null
+++ b/jasmin/jasmin-2.4/html2x/style.css
@@ -0,0 +1,16 @@
+
+td { font-family: Verdana,Arial,Helvetica,sans-serif; color: #000000; font-size: 12px; line-height: 16px; }
+td h1 { font-family: Tahoma; padding: 1px; padding-left: 4px; color: white; background-color: #303030; font-size: 20px; line-height: 24px; font-weight: bold; }
+td h2{ font-family: Tahoma; color: #000000; font-size: 14px; line-height: 16px; font-weight: bold; }
+td h3 { font-family: Tahoma; color: #000000; font-size: 12px; line-height: 16px; font-weight: bold; }
+
+.h1 { font-family: Times; color: #000000; font-size: 18px; line-height: 20px; font-weight: bold; }
+
+/* main text hyperlinks */
+a { color: #b11; TEXT-DECORATION: underline; }
+a:visited {color: #b11}
+a:hover {color: #f88}
+
+pre.code{ font-family: courier new; color: #202060; font-size: 12px; line-height: 14px;}
+font.code{ font-family: courier new; color: #202060; font-size: 12px; line-height: 14px;}
+
diff --git a/jasmin/jasmin-2.4/html2x/xt.html b/jasmin/jasmin-2.4/html2x/xt.html
new file mode 100644
index 0000000..be44dbf
--- /dev/null
+++ b/jasmin/jasmin-2.4/html2x/xt.html
@@ -0,0 +1,414 @@
+<html>
+<head>
+<title>Jasmin User Guide</title>
+<link href="style.css" rel="stylesheet" type="text/css">
+</head>
+<body>
+<table>
+<tr><td width=550>
+<center>
+<p><img src=jasmin_icon.jpg></p>
+<p>
+<div class="h1">JasminXT Syntax</div>
+Daniel Reynaud, Mart 2006
+</p>
+</center>
+
+<h1>About This Document</h1>
+
+This guide describes the rules and syntax used in JasminXT, the extension of
+the Jasmin language in version 2.0. If you are new to Jasmin, you should
+refer to the Jasmin user guide. Note that this document doesn't
+explain the Java Virtual Machine itself, or give syntax notes for
+every instruction known to Jasmin. See the Java Virtual Machine specification
+for more information on the JVM.<p>
+
+
+<h1>Why a new Jasmin language ?</h1>
+
+<p>
+Jasmin is the de-facto standard Java assembly language. It is useful to explore
+the possibilities of bytecode, but it does not offer a real low level control
+over the produced output. Therefore it is not suitable to generate test cases
+for virtual machines or bytecode verifier. This new version of the Jasmin
+language, called JasminXT, provides optional directives and other syntax
+updates to have more control over the output and to stick with the latest
+changes of the Java language.</p>
+
+<p>JasminXT has been defined for the tinapoc project. The purpose of the tinapoc
+project is to create a reliable Java reverse engineering toolkit. See the tinapoc
+homepage for more information : <a href="http://tinapoc.sourceforge.net/">http://tinapoc.sourceforge.net/</a></p>
+
+<h1>Summary of the new features</h1>
+<p>
+<b>Since 2.4 :</b><br>
+<li> accept 'd'-suffix in float constant (no attempt cast to float)
+<li> redesign to dynamic compiler class creation
+<li> some cosmetic bugfixes
+<br><br>
+<b>Since 2.3 :</b><br>
+<li> added 'wide'-aliases to two-face instructions
+<br><br>
+<b>Since 2.2 :</b><br>
+<li> some bug fixes in the diagnostic
+<li> added support for attribute StackMapTable (directive .stack) described in JDK1.6
+<li> added keyword 'use' to directive .stack
+<li> added support for \uXXXX escape sequence in the names (just as in the Java)
+<li> instruction ldc_w always generates wide index
+<li> changed syntaxes of the non-standard identifiers (or overloaded keywords), now it hasto be signgle quoted  and can't be empty
+<br><br>
+<b>Since 2.1 :</b><br>
+<li> some bug fixes with string and number parsing
+<li> added support for \uXXXX escape sequences
+<li> added support for access flags ACC_STRICT (fpstrict) and ACC_SYNTHETIC (synthetic)
+<li> added signatures for local variables support
+<li> several .debug directives are permitted
+<li> added the invokedynamic instruction
+<li> improved the syntax of the StackMap attribute (.stack directive)
+<li> new command-line option -e to support different encodings
+<li> added support for non-standard identifiers in double-quotes
+<li> fields can now be defined on multiple lines
+<li> new directives have been included : .inner, .attribute, .deprecated, .annotation
+<br><br>
+<b>Since 2.0 :</b><br><br>
+<li>use of offsets for branch targets, local variable visibility and exception handlers. The offsets can either be absolute or relative :<br>
+<pre>
+goto  12  ; absolute offset : go to bytecode at offset 12
+goto +5   ; relative offset : go 12 bytes forward
+goto -8   ; relative offset : go 8 bytes backwards
+</pre>
+
+<li>the following access flags are now supported : ACC_ENUM, ACC_ANNOTATION, ACC_BRIDGE and ACC_VARARGS<br>
+
+<li>the .bytecode directive has been added, to set the bytecode version in the class file.<br>
+Example : <pre>.bytecode 49.0</pre><br>
+
+<li>it is now possible to add a SourceDebugExtension attribute to the class with the following directive :<br>
+<pre>.debug "some string here"</pre><br>
+
+<li>same thing for the EnclosingMethod attribute :<br>
+<pre>.enclosing method "some/package/Foo/someMethod(I)V"</pre><br>
+
+<li>support for the Signature attribute (in the classes, methods and fields) :<br>
+<pre>.signature "<my::own>Signature()"
+.field myField Ljava/lang/String; signature "<my::own>Signature()"</pre><br>
+
+<li>support for the StackMap attribute, using the .stack directive in a method definition<br>
+
+<li>it is now possible to give the offset of an instruction before the instruction itself, like in the following code snippet :<br>
+  <pre>
+       0: aload_0
+       1: invokespecial java/lang/Object/<init>()V
+       4: aload_0
+       5: ldc2_w 3.14159
+  </pre>
+</p>
+
+
+
+
+<h1>JasminXT File Format</h1>
+<p>
+This new version is an extension of the existing Jasmin language, therefore old
+Jasmin files should still compile correctly with newer versions of Jasmin.
+JasminXT is supported by Jasmin 2.0 or higher. <b>Changes in Jasmin 2.4 are in bold.</b></p>
+
+<p>
+In the rest of this document, words between '[' and ']' are optional. The
+syntax of a JasminXT file is the following :</p>
+
+<pre>
+&lt;jas_file&gt; {
+    &lt;jasmin_header&gt;
+    [&lt;field&gt;]*
+    [&lt;method&gt;]*
+}
+</pre>
+
+<h1>JasminXT Header</h1>
+<pre>
+&lt;jasmin_header&gt; {
+    [.bytecode &lt;x.y&gt;]
+    [.source &lt;sourcefile&gt;]
+    &lt;class_spec&gt;
+    &lt;super_spec&gt;
+    &lt;implements&gt;
+    [.signature "&lt;signature&gt;"]
+    [.enclosing method &lt;method_name&gt;]
+    [.debug "&lt;debug_source_extension&gt;"]*
+    [.inner class [&lt;access&gt;] [&lt;name&gt;] [inner &lt;classname&gt;] [outer &lt;name&gt;]]*
+    [.inner interface [&lt;access&gt;] [&lt;name&gt;] [inner &lt;classname&gt;] [outer &lt;name&gt;]]*
+}
+
+example :
+.bytecode 49.0
+.source hello.j
+.class hello
+.super java/lang/Object
+.signature "&lt;my::own&gt;Signature()"
+.enclosing method foo/bar/Whatever/someMethod()</pre>
+.debug "this string will be included in the SourceDebugExtension attribute"
+.debug "this string too"
+
+<p>The .bytecode directive sets the version of the bytecode in the class file.</p>
+
+<p>The .signature directive, when used in the header of the Jasmin file, sets the
+Signature attribute for the class (the argument is a string between double
+quotes)</p>
+
+<p>The .enclosing directive sets the EnclosingMethod attribute for the class. The
+argument is a supposed to be a method name, but it can be any string between
+double quotes.</p>
+
+<p>The .debug directive sets the SourceDebugExtension attribute for the class (the
+argument is also a string between double quotes)</p>
+
+
+
+<h1>JasminXT Class, Super Class and Interfaces Definition</h1>
+<pre>
+&lt;class_spec&gt; {
+    .class &lt;access_spec&gt; &lt;class_name&gt;
+}
+</pre>
+
+<p>where &lt;access_spec&gt; is any number of words taken from this list : public,
+private, protected, static, final, synchronized, native, final, super,
+interface, abstract, annotation, enum, bridge/volatile, transient/varargs</p>
+
+<p>and &lt;class_name&gt; is the fully qualified internal form of the class, such as
+my/package/MyClass</p><br>
+
+
+<pre>
+&lt;super_spec&gt; {
+    .super &lt;class_name&gt;
+}
+</pre>
+
+<pre>
+&lt;implements&gt; {
+    .implements &lt;class_name&gt;*
+}
+</pre>
+<p>
+The .super and .implements directives have not been modified in JasminXT<br>
+The .implements directive can be repeated in order to implement multiple interfaces</p><br>
+
+
+
+<h1>JasminXT Field Definition</h1>
+<pre>
+&lt;field&gt; {
+    .field &lt;access_spec&gt; &lt;field_name&gt; &lt;descriptor&gt; [signature &lt;signature&gt;]
+           [ = &lt;value&gt; ]
+    |
+    .field &lt;access_spec&gt; &lt;field_name&gt; &lt;descriptor&gt; [signature &lt;signature&gt;]
+           [ = &lt;value&gt; ]
+        [&lt;field_attribute&gt;]*
+    .end field
+   (...)
+}
+</pre>
+<p>
+If present, the Signature attribute will be set in the class file for this field with the given
+quoted string as an argument.</p>
+
+
+<pre>
+&lt;field_attribute&gt; {
+    .deprecated
+  | .attribute &lt;name&gt; &lt;file_name&gt;
+  | .signature &lt;signature&gt;
+  | .annotation (...)
+}
+</pre>
+
+(see below for the definition of the annotation and the attribute directives)
+
+
+
+<p>examples :
+<pre>.field enum myField Ljava/lang/String; signature "&lt;my::own&gt;Signature()" = "val"</pre>
+<pre>.field static hello_string Ljava/lang/String;
+    .signature "mySignature"
+    .deprecated
+.end field</pre>
+</p>
+
+
+<h1>JasminXT Method Definition</h1>
+The general format of a method definition has not changed in JasminXT.
+
+<pre>
+&lt;method&gt; {
+    .method &lt;access_spec&gt; &lt;method_name&gt; &lt;descriptor&gt;
+        &lt;statement&gt;*
+    .end method
+}
+</pre>
+
+
+<h1>JasminXT Method Statements</h1>
+<pre>
+&lt;statement&gt; {
+   .limit stack &lt;integer&gt;
+   | .limit locals &lt;integer&gt;
+   | .line &lt;integer&gt;
+   | .var &lt;var_number&gt; is &lt;var_name&gt; &lt;descriptor&gt; [signature &lt;sign&gt;] from &lt;label1&gt; to &lt;label2&gt;
+   | .var &lt;var_number&gt; is &lt;var_name&gt; &lt;descriptor&gt; [signature &lt;sign&gt;] from &lt;offset1&gt; to &lt;offset2&gt;
+   | .throws &lt;classname&gt;
+   | .catch &lt;classname&gt; from &lt;label1&gt; to &lt;label2&gt; using &lt;label3&gt;
+   | .catch &lt;classname&gt; from &lt;offset1&gt; to &lt;offset2&gt; using &lt;offset3&gt;
+   | .signature "&lt;signature&gt;"
+   | .stack
+         [offset {&lt;pc&gt; | &lt;label&gt;}]
+         [locals &lt;verification_type&gt; [&lt;verification_arg&gt;]]
+         (...)
+         [stack  &lt;verification_type&gt; [&lt;verification_arg&gt;]]
+         (...)
+     .end stack
+   | .stack use [n] locals
+         (...)
+     .end stack
+   | &lt;instruction&gt; [&lt;instruction_args&gt;]
+   | &lt;Label&gt;:
+   | .deprecated
+   | &lt;generic&gt; ; see below for the use of generic attributes
+}
+</pre>
+<p>
+In Jasmin XT you can now use offsets instead of labels for the local variable
+definitions and for the exception handlers definitions.</p>
+
+<p>The .signature sets the Signature attribute for this method with the given
+quoted string.<p>
+
+<p>You can now also define StackMap (or StackMapTable) attributes using
+the .stack directive. &lt;pc&gt; is an offset in the local bytecode array.
+&lt;verification_type&gt; is one of the following keywords : Top, Integer,
+Float, Long, Double, Null, UninitializedThis, Object or Uninitialized. Object
+takes a &lt;classname&gt; as a parameter. Uninitialized takes an integer or a
+label as a parameter. Also, jasmin  allows to use "short" notation. The
+'.stack use [n] locals' directive results in copy first &lt;n&gt; values from
+previous .stack directive. If &lt;n&gt; is omitted, all values are copied.</p>
+
+<p>NOTE: If bytecode version is 50 or above jasmin generates StackMapTable
+attribute in accordance with specification of the new 'ClassFile  Format'
+edition. If bytecode version is 49 or below jasmin generate StakMap attribute
+in accordance with CLDC specification.<p>
+
+examples :
+<pre>
+.stack
+    offset 16
+    locals Null
+    locals Top
+    locals Object allo
+    stack Uninitialized 12
+.end stack
+
+.stack
+    ; offset is not specified, the offset of the current opcode will be used
+    locals Null
+    locals Top
+    locals Object allo
+    stack Uninitialized Label0
+.end stack
+</pre>
+<p>
+This statement defines a single stack map frame. All the stack map frames
+defined in a method are then aggregated and form the StackMap attribute for the
+method. The last example my be wrote at the short notation as:</p>
+
+<pre>
+.stack use locals
+    stack Uninitialized Label0
+.end stack
+</pre>
+<p>
+
+
+
+<h1>JasminXT Instructions</h1>
+<pre>
+&lt;instruction&gt; {
+    [&lt;pc&gt;:] &lt;opcode&gt; [&lt;instruction_args&gt;]
+}
+</pre>
+
+<p>
+The main change in JasminXT is that it is now possible to put the offset of the
+instruction before the opcode (the &lt;pc&gt;: statement). The pc is processed as a
+label, therefore you can virtually put any number as the pc but it won't change
+the actual pc of the bytecode.</p>
+
+<p>
+Another update is that it is now possible to use offsets (both relative and
+absolute) as branch targets instead of labels. The offset is considered to be
+relative if it begins with '$+' or '$-'.</p>
+
+example :
+<pre>
+goto  n  ; absolute offset : go to the bytecode labelled n
+goto $+n  ; relative offset : go n bytes forward (from the offset of this goto)
+goto $-n  ; relative offset : go n bytes backwards
+</pre>
+
+<p>
+If something hasn't been documented here, it means that it hasn't changed, so
+you can still refer to the Jasmin <a href="guide.html">user guide</a></p>
+
+<p>
+<b>Added '_w' aliase to [adfli]-load/store, iinc and ret instructions (e.g. aload - aload_w).
+Using '_w' postfix guarantees wide-form of byte-code generation</b></p>
+
+<h1>Generic Attributes</h1>
+Generic attributes are supported in class/field/method definitions as follows :
+<pre>&lt;generic&gt; = {
+    .attribute &lt;name&gt; &lt;file_name&gt;
+}</pre>
+
+&lt;name&gt; is the name of the attribute and &lt;file_name&gt; is the name of the file containing the data of the attribute (between double quotes). If the generic attribute is in the body of the method, the following logic is used : if it is the first statement in the method, the attribute will be added as a method attribute, otherwise it will be added as a Code attribute.
+
+<h1>Annotations</h1>
+Thanks to Iouri Kharon for implementing this. Here are his explanations :<br>
+
+<p>Added a new directive .annotation to create the AnnotationDefault,
+   RuntimeVisibleAnnotation, RuntimeInvisibleAnnotation,
+   RuntimeVisibeParameterAnnotation, RuntimeInvisibleParameterAnnotation
+   attributes. The directive arguments are verified to have valid values
+   and correct signatures.<br>
+   Complex (nested) annotations are supported as well as arrays of them.<br>
+   The generic format is:
+<pre>
+&lt;annotation&gt; = {
+    .annotation visible &lt;classname&gt;
+  | .annotation invisible &lt;classname>&gt;
+  | .annotation visibleparam &lt;paramnum&gt; &lt;classname&gt;
+  | .annotation invisibleparam &lt;paramnum&gt; &lt;classname&gt;
+  | .annotation default
+         ........
+    .end annotation
+
+Field format (except AnnotationDefault):
+
+    &lt;name&gt; &lt;signchar&gt; = &lt;value&gt;*
+  | &lt;name&gt; @ = .annotation
+            ........
+    .end annotation
+}
+</pre>
+
+   AnnotationDefault supports only one field and the <name> tag is not used.
+   Nested annotations must be with the <name> tag and can have any number
+   of fields. Besides, 'empty annotation' is forbidden for AnnotationDefault.
+   Lastly, AnnotationDefault can be used only once for each method.
+   Other annotation types can be used many times and will accumulate information.</p>
+
+<hr><address>Copyright (c) Daniel Reynaud, Mart 2006</address>
+<hr>
+<a href="http://jasmin.sourceforge.net">Jasmin Home</a>
+</td></tr></table>
+</body>
+</html>
diff --git a/jasmin/jasmin-2.4/jasmin.jar b/jasmin/jasmin-2.4/jasmin.jar
new file mode 100644
index 0000000..7897e7f
Binary files /dev/null and b/jasmin/jasmin-2.4/jasmin.jar differ
diff --git a/jasmin/jasmin-2.4/lib/ant-launcher.jar b/jasmin/jasmin-2.4/lib/ant-launcher.jar
new file mode 100644
index 0000000..1e35f68
Binary files /dev/null and b/jasmin/jasmin-2.4/lib/ant-launcher.jar differ
diff --git a/jasmin/jasmin-2.4/lib/ant.jar b/jasmin/jasmin-2.4/lib/ant.jar
new file mode 100644
index 0000000..3a67607
Binary files /dev/null and b/jasmin/jasmin-2.4/lib/ant.jar differ
diff --git a/jasmin/jasmin-2.4/lib/jas/JASMIN_NOTES.txt b/jasmin/jasmin-2.4/lib/jas/JASMIN_NOTES.txt
new file mode 100644
index 0000000..0c1c392
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/JASMIN_NOTES.txt
@@ -0,0 +1,13 @@
+10 October 2004, Jon Meyer
+
+* Moved the jas src code into ../src/jas.
+
+
+1 March 1997, Jon Meyer
+
+* Modified JAS to use self-contained RuntimeConstants interface.
+
+* Moved JAS classes into the Jasmin classes directory.
+
+* Fixed bug in CatchEntry.
+           
diff --git a/jasmin/jasmin-2.4/lib/jas/README.txt b/jasmin/jasmin-2.4/lib/jas/README.txt
new file mode 100644
index 0000000..56567e0
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/README.txt
@@ -0,0 +1,109 @@
+This is v0.3 of a simple Java bytecode assembler.
+
+
+Quick Info:
+-----------
+  If you want to just quickly check out things, do the following.
+
+% java scm.driver examples/hworld.jas
+
+  This compiles an assembler script to bytecode.
+
+% java out
+
+  This runs the resultant bytecode, which should print the
+  string "Hello World" 5 times.
+
+
+  Then read the online documentation at
+
+http://www.blackdown.org/~kbs/jas.html
+
+More Details:
+-------------
+
+ * What is available:
+
+  A simple java bytecode assembler that can be used either as a
+  standalone scripting program or directly from java (through the jas
+  package)
+
+ * What is not available in this version:
+
+  - Error recovery in the scripting interface
+  - defining a tableswitch or lookupswitch instruction from the scripting
+    interface
+
+ * Documentation
+
+  You can leaf through the jas API in reference/jas You can look at
+  the list of available scripting functions from reference/scm. The
+  bulk of what documentation exists is online from
+
+  http://www.blackdown.org/~kbs/jas.html
+
+  UTSL, ofcourse ;-) And documentation is mostly demand-driven,
+  if there is interest I'll continue to expand it.
+
+  * Examples
+
+  The examples directory contains a few examples of using the
+  assembler with the script and directly from java. Look at the
+  README in this directory to see how to run them. Online
+  documentation contains more details.
+
+  simple.java
+  simple.jas
+         These are simple programs that create classes which
+         don't do anything but get initialized.
+
+  hworld.java
+  hworld.jas
+         These create bytecode that can be run standalone,
+         which print a string a few times.
+
+  exprcomp.java
+         This is a primitive compiler that does runtime
+         codegeneration and execution of arithmetic expressions.
+  exprcomp.jas
+         This is a primitive compiler written in jas to translate
+         jas arithmetic expressions to bytecode.
+
+  * Recompiling
+
+  You can recompile all classes if you wish. First remove the
+  jas/ and the scm/ directories under this directory. Then run the
+  script compile.sh in this directory.
+
+  You will probably want to then run the tests in the test directory
+  to make sure the basic api is functional. Look at the README in this
+  directory for details.
+
+
+Running the scripting driver:
+-----------------------------
+
+  If you are going to use the scripting language, the driver for it is
+located in the class scm.driver. The magic incantation is
+
+% java scm.driver [path to file]
+
+If you don't give it a file name, it will try to read from stdin.
+
+
+Using code from this distribution:
+----------------------------------
+
+There is exactly one class that I *use* from the sun/* package, which
+is sun.tools.java.RuntimeConstants. I know of no other reasonable way
+to keep in sync with the VM.
+
+Outside of this class, (which is not present in this distribution) you
+can freely use/modify/sell/dance on with hobnailed boots any or all of
+this code. If you do end up using derived code and feel disinclined to
+buy me a snowboard :) all I ask is that you add me to the list of
+credits.
+
+-KB-
+kbs@sbktech.org
+Version created: Tue Aug 21 09:50:23 PDT 1996
diff --git a/jasmin/jasmin-2.4/lib/jas/examples/README b/jasmin/jasmin-2.4/lib/jas/examples/README
new file mode 100644
index 0000000..20e406e
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/examples/README
@@ -0,0 +1,52 @@
+This contains three examples of using the assembler
+from java and from the script
+
+Look up http://www.blackdown.org/~kbs/jas.html for more
+documentation. This only tells you how to run the examples.  The
+documentation is very Unix centric, I apologize.... I have not had
+time to set this up on the PC's yet.
+
+
+simple.java:
+simple.jas:
+
+  Unexciting program that generates a do nothing class.
+
+  Go up a directory and compile simple.java. Run the program,
+  which generates the bytecode. Disassemble the bytecode
+
+  % (cd ..; javac -d . examples/simple.java; java simple; javap -p -c out)
+
+  Same thing, but using the script instead of java directly.
+
+  % (cd ..;  java scm.driver examples/simple.jas; javap -p -c out)
+
+
+hworld.java:
+hworld.jas:
+
+  Print a string in a loop.
+
+  % (cd ..; javac -d . examples/hworld.java; java hworld; java out)
+
+  As before, but use script instead.
+
+  % (cd ..; java scm.driver examples/hworld.jas; java out)
+
+exprcomp.java:
+
+  Primitive runtime expression compiler. It translates arithmetic
+  expressions into bytecode and loads it on the fly as a class, which
+  is run to get the answer. test.inp is an example of the sort of
+  arithmetic expressions it translates.
+
+  % (cd ..; javac -d . examples/exprcomp.java; java exprcomp examples/test.inp)
+
+exprcomp.jas:
+
+   Primitive compiler for jas arithmetic expressions (in jas).
+   jas is fairly expressive, thats about the only point of this
+   exercise ;-) Unlike the java version, this gets written out
+   into a file which you'll have to run to get the results.
+
+  % (cd ..; java scm.driver examples/exprcomp.jas; java results)
diff --git a/jasmin/jasmin-2.4/lib/jas/examples/exprcomp.jas b/jasmin/jasmin-2.4/lib/jas/examples/exprcomp.jas
new file mode 100644
index 0000000..7d7a48e
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/examples/exprcomp.jas
@@ -0,0 +1,116 @@
+;;; Simple arithmetic expression compiler for jas in jas.
+;;;
+;;; The compiler is defined in the function
+;;; compile-expression
+;;;
+;;; use as (for instance)
+;;; (compile-expression (quote (+ (* 2 (+ 1 3)) 1)))
+;;;
+;;; This will generate a standalone program called results.class
+;;; Run the bytecode interpreter on it as:
+;;;
+;;; % java results
+;;;
+;;; which will print the result of the expression
+
+(define compile-expression
+  (lambda (expr)
+    (real-compile-expression expr)
+    (dump-code)))
+
+;; The fun part...
+
+(define real-compile-expression
+  (lambda (expr)
+    (cond
+
+     ((num? expr)
+      (compile-number expr))
+
+     (1 (progn
+         (real-compile-expression (get-op1 expr))
+         (real-compile-expression (get-op2 expr))
+         (compile-op (get-op expr))
+         (set! cur-stack-height (- cur-stack-height 1)))))))
+
+;; Ah well. Back to boring bookkeeping.
+
+
+(define compile-number
+  (lambda (num)
+    (append-insn (bipush num))
+    (set! cur-stack-height (+ 1 cur-stack-height))
+    (cond
+     ((< max-stack-height cur-stack-height)
+      (set! max-stack-height cur-stack-height)))))
+
+(define compile-op
+  (lambda (op)
+    (cond
+     ((eq? op (quote +)) (append-insn (iadd)))
+     ((eq? op (quote -)) (append-insn (isub)))
+     ((eq? op (quote *)) (append-insn (imul)))
+     ((eq? op (quote /)) (append-insn (idiv))))))
+
+(define get-op1
+  (lambda (expr) (car (cdr expr))))
+(define get-op2
+  (lambda (expr) (car (cdr (cdr expr)))))
+(define get-op
+  (lambda (expr) (car expr)))
+
+(define append-insn
+  (lambda (insn)
+    (jas-code-addinsn my-code insn)))
+
+(define cur-stack-height 1)
+(define max-stack-height 1)
+
+(define my-code (make-code))
+(define my-init-code (make-code))
+
+                                        ; define the main() portion,
+                                        ; and the call to print out the
+                                        ; results.
+(define append-sequence
+  (lambda (code-part insn-list)
+    (mapcar (lambda (insn) (jas-code-addinsn code-part insn))
+            insn-list)))
+
+(append-sequence
+ my-init-code
+ (quote
+  ((aload_0)
+   (invokenonvirtual (make-method-cpe "java/lang/Object" "<init>" "()V"))
+   (return))))
+
+(define dump-code
+  (lambda ()
+    (define my-env (make-class-env))
+    (jas-class-setclass my-env (make-class-cpe "results"))
+    (jas-class-setsuperclass my-env (make-class-cpe "java/lang/Object"))
+    (jas-class-addmethod my-env acc-public "<init>" "()V" my-init-code ())
+    (append-sequence
+     my-code
+     (quote
+      ((getstatic
+        (make-field-cpe "java/lang/System" "out" "Ljava/io/PrintStream;"))
+       (swap)
+       (invokevirtual (make-method-cpe
+                       "java/io/PrintStream" "println" "(I)V"))
+       (return))))
+    (jas-code-stack-size my-code max-stack-height)
+    (jas-class-addmethod my-env
+                         (| acc-public acc-static)
+                         "main" "([Ljava/lang/String;)V" my-code ())
+    (jas-class-write my-env
+                     (make-outputstream "results.class"))))
+
+;;;
+;;; example usage of compiler.
+;;;
+;;; run the compiled class with
+;;; % java results
+;;; to get the answer.
+
+(compile-expression (quote (+ (* 2 (+ 1 3)) 1)))
diff --git a/jasmin/jasmin-2.4/lib/jas/examples/exprcomp.java b/jasmin/jasmin-2.4/lib/jas/examples/exprcomp.java
new file mode 100644
index 0000000..1cdd5d4
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/examples/exprcomp.java
@@ -0,0 +1,242 @@
+// Primitive runtime code generation of expressions. This is a jas
+// implementation of the example in Aho Sethi Ullman.
+// 
+// You pass to it statements of the form
+// a = 1*2 + 3*5;
+// Only integer operations are allowed, and variables
+// are magically created by using them in the LHS of a statement.
+//
+// You can print out the value of expressions with the println keyword:
+// println(a + 10);
+//
+// It compiles this into a bytearray, and then loads it as 
+// a new class.
+//
+// Unfortunately, this trick cannot be used in an applet --- security
+// restrictions prevent ClassLoaders from being placed on the
+// stack. So much for writing regexp compilers that can do codegen instead of
+// state tables.
+//
+// The grammar is simple, so code generation is part of the parsing
+// step. Operator precedence is directly handled by the grammar.
+//
+// Grammar + production rules:
+//
+// start -> list EOF
+// list -> id = expr ;  { emit(istore, id.index); } list
+//        | println expr ;  { emit(<println sequence>); } list
+//        | lambda
+// expr -> term moreterms
+// moreterms -> + term { emit(iadd) } moreterms
+//           |  - term { emit(isub) } moreterms
+//           |  lambda
+// term -> factor morefactors
+// morefactors -> * factor { emit(imul) } morefactors
+//              | / factor { emit(idiv) } morefactors
+//              | lambda
+// factor -> ( expr )
+//          | number { emit(iconst, number.value) }
+//          | id { emit(iload, id.index); }
+
+import java.util.*;
+import java.io.*;
+import jas.*;
+import sun.tools.java.RuntimeConstants;
+
+public class exprcomp implements RuntimeConstants
+{
+  StreamTokenizer inp;
+  CodeAttr myCode;
+  short cur_stack_height;
+  short max_stack_height;
+  short max_vars;
+  Hashtable vars;
+
+  public exprcomp(StreamTokenizer inp)
+    throws jasError
+  {
+    inp.eolIsSignificant(false);
+    this.inp = inp;
+    myCode = new CodeAttr();
+                                // Add initializations
+    myCode.addInsn(new Insn(opc_aload_0));
+    myCode.addInsn(new Insn(opc_invokenonvirtual,
+                            new MethodCP("java/lang/Object",
+                                         "<init>", "()V")));
+    cur_stack_height = max_stack_height = 1;
+    vars = new Hashtable();
+    max_vars = 1;
+  }
+  public void write(DataOutputStream out)
+    throws IOException, jasError
+  {
+    ClassEnv clazz = new ClassEnv();
+    myCode.setStackSize(max_stack_height);
+    myCode.setVarSize(max_vars);
+                                // add initializer to class
+    clazz.addMethod
+      ((short) ACC_PUBLIC, "<init>", "()V", myCode, null);
+    clazz.setClassAccess((short) ACC_PUBLIC);
+    clazz.setClass(new ClassCP("results"));
+    clazz.setSuperClass(new ClassCP("java/lang/Object"));
+    clazz.write(out);
+  }
+
+  public void parse()
+    throws IOException, parseError, jasError
+  {
+    inp.nextToken();
+    while(inp.ttype != inp.TT_EOF)
+      {
+        if (inp.ttype != inp.TT_WORD)
+          {
+            throw new parseError("Expected an id at line " + inp.lineno());
+          }
+        if (inp.sval.equals("println"))
+          {
+            match(inp.TT_WORD);
+            expr();
+            match(';');
+            emit(new Insn(opc_getstatic,
+                          new FieldCP("java/lang/System",
+                                      "out", "Ljava/io/PrintStream;")));
+            emit(new Insn(opc_swap));
+            emit(new Insn(opc_invokevirtual,
+                          new MethodCP("java/io/PrintStream",
+                                       "println", "(I)V")));
+          }
+        else
+          {                     // search, maybe add into var list
+            Integer idx;
+            if ((idx = (Integer) vars.get(inp.sval)) == null)
+              {
+                idx = new Integer(max_vars++);
+                vars.put(inp.sval.intern(), idx);
+              }
+            match(inp.TT_WORD); match('='); expr(); match(';');
+            emit(new Insn(opc_istore, idx.intValue()));
+          }
+      }
+    emit(new Insn(opc_return));
+  }
+
+  void expr()
+    throws IOException, parseError, jasError
+  {
+    term();
+    while (true)
+      {
+        switch(inp.ttype)
+          {
+          case '+':
+            match('+'); term(); emit(new Insn(opc_iadd)); break;
+          case '-':
+            match('-'); term(); emit(new Insn(opc_isub)); break;
+          default: return;
+          }
+        cur_stack_height--;
+      }
+  }
+
+  void term()
+    throws IOException, parseError, jasError
+  {
+    factor();
+    while (true)
+      {
+        switch(inp.ttype)
+          {
+          case '*': match('*'); factor(); emit(new Insn(opc_imul)); break;
+          case '/': match('/'); factor(); emit(new Insn(opc_idiv)); break;
+          default: return;
+          }
+        cur_stack_height --;
+      }
+  }
+  void factor()
+    throws IOException, parseError, jasError
+  {
+    switch(inp.ttype)
+      {
+      case '(': match('('); expr(); match(')'); break;
+      case inp.TT_NUMBER:
+        int val = (int)(inp.nval);
+        emit(new Insn(opc_bipush, (short)val));
+        match(inp.TT_NUMBER);
+        break;
+      case inp.TT_WORD:
+        Integer idx;
+        if ((idx = (Integer) vars.get(inp.sval)) == null)
+          {
+            throw new parseError
+              ("Unknown variable " + inp.sval + " at line " + inp.lineno());
+          }
+        emit(new Insn(opc_iload, idx.intValue()));
+        match(inp.TT_WORD);
+        break;
+      default:
+        throw new parseError("Syntax error at line " + inp.lineno());
+      }
+    cur_stack_height++;
+    if (max_stack_height < cur_stack_height)
+      max_stack_height = cur_stack_height;
+  }
+  void match(int val)
+    throws IOException, parseError
+  {
+    if (inp.ttype != val)
+      { throw new parseError
+          ("line " + inp.lineno() + ": expected " + val + " but got " + inp); }
+    inp.nextToken();
+  }
+
+  void emit(Insn insn)
+  {
+    myCode.addInsn(insn);
+  }
+
+  public static void main(String argv[])
+    throws Exception
+  {
+    exprcomp compiler =
+      new exprcomp(new StreamTokenizer(new FileInputStream(argv[0])));
+    compiler.parse();
+    ByteArrayOutputStream data = new ByteArrayOutputStream();
+    compiler.write(new DataOutputStream(data));
+    dynaloader dl = new dynaloader(data.toByteArray());
+    dl.exec();
+  }
+}
+
+class dynaloader extends ClassLoader
+{
+  Hashtable cache;
+  Class ex;
+
+  dynaloader(byte[] data)
+    throws ClassFormatError
+  {
+    cache = new Hashtable();
+    ex = defineClass(data, 0, data.length);
+    cache.put("results", ex);
+    resolveClass(ex);
+  }
+
+  void exec() throws Exception { ex.newInstance(); }
+  public synchronized Class loadClass(String name, boolean resolve)
+    throws ClassNotFoundException
+  {
+    Class c = (Class) cache.get(name);
+    if (c == null)
+      {
+        c = findSystemClass(name);
+        cache.put(name, c);
+      }
+    if (resolve) resolveClass(c);
+    return c;
+  }
+}
+
+
+class parseError extends Exception
+{ parseError(String s) { super(s); } }
diff --git a/jasmin/jasmin-2.4/lib/jas/examples/hworld.jas b/jasmin/jasmin-2.4/lib/jas/examples/hworld.jas
new file mode 100644
index 0000000..9dc5904
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/examples/hworld.jas
@@ -0,0 +1,87 @@
+;; create a container
+
+(define my-class (make-class-env))
+
+
+;; specify class hierarchy
+
+(jas-class-setaccess my-class acc-public)
+(jas-class-setclass my-class (make-class-cpe "out"))
+(jas-class-setsuperclass my-class (make-class-cpe "java/lang/Object"))
+
+
+;; write a convenience function to append insns as a list.
+(define append-code
+  (lambda (code-part insn-list)
+    (mapcar (lambda (insn) (jas-code-addinsn code-part insn))
+            insn-list)))
+
+;; Define code for initializer
+;;
+(define init-it (make-code))
+(append-code
+ init-it
+ (quote
+  ((aload_0)
+   (invokenonvirtual (make-method-cpe "java/lang/Object" "<init>" "()V"))
+   (return))))
+
+;; this is the code that comprises
+;; the actual task, ie the code for
+;; main(String argv[]).
+;; print a string 5 times
+
+(define doit (make-code))
+(append-code
+ doit
+ (quote
+  (
+
+                                        ; store references in local
+                                        ; variables to avoid field/cp
+                                        ; lookup
+   (getstatic
+    (make-field-cpe "java/lang/System" "out" "Ljava/io/PrintStream;"))
+   (astore_1)
+   (ldc (make-string-cpe "Hello World"))
+   (astore_2)
+   (bipush 5)
+   (istore_3)                           ; store loop index in var reg 3
+
+                                        ; loop 5 times, printing out
+                                        ; the string.
+
+   (make-label "loop")
+                                        ; push arguments to function
+                                        ; on stack and call it
+
+   (aload_1) (aload_2)
+   (invokevirtual
+    (make-method-cpe "java/io/PrintStream" "println" "(Ljava/lang/String;)V"))
+
+                                        ; decrement loop index
+
+   (iinc 3 -1)
+   (iload_3)
+   (ifne (make-label "loop"))
+   (return))))
+
+;; set stack/var size
+
+(jas-code-stack-size doit 3)
+(jas-code-var-size doit 4)
+
+;; fill up the class with the methods
+
+;; first the initializer.
+(jas-class-addmethod my-class acc-public "<init>" "()V" init-it ())
+
+;; define the printing code as a static main(String argv[]) method
+
+(jas-class-addmethod my-class
+                     (| acc-static acc-public)
+                     "main" "([Ljava/lang/String;)V" doit ())
+
+;; write it out.
+
+(jas-class-write my-class (make-outputstream "out.class"))
diff --git a/jasmin/jasmin-2.4/lib/jas/examples/hworld.java b/jasmin/jasmin-2.4/lib/jas/examples/hworld.java
new file mode 100644
index 0000000..72b741f
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/examples/hworld.java
@@ -0,0 +1,78 @@
+import jas.*;
+import java.io.*;
+import sun.tools.java.RuntimeConstants;
+
+//
+// This is program that makes calls into the jas package
+// to generate a class that prints a string afew times.
+//
+
+class hworld implements RuntimeConstants
+{
+  public static void main(String argv[])
+    throws jasError, IOException
+  {
+
+                                // class hierarchy
+    ClassEnv nclass = new ClassEnv();
+    nclass.setClass(new ClassCP("out"));
+    nclass.setSuperClass(new ClassCP("java/lang/Object"));
+    nclass.setClassAccess((short)ACC_PUBLIC);
+
+                                // Initialization code
+
+    CodeAttr init = new CodeAttr();
+    init.addInsn(new Insn(opc_aload_0));
+    init.addInsn(new Insn(opc_invokenonvirtual,
+                          new MethodCP("java/lang/Object", "<init>", "()V")));
+    init.addInsn(new Insn(opc_return));
+
+
+                                // Actual code to print string
+    CodeAttr doit = new CodeAttr();
+
+                                // store refs in local variables
+    doit.addInsn(new Insn(opc_getstatic,
+                          new FieldCP("java/lang/System",
+                                      "out",
+                                      "Ljava/io/PrintStream;")));
+    doit.addInsn(new Insn(opc_astore_1));
+    doit.addInsn(new Insn(opc_ldc,
+                          new StringCP("Hello World")));
+    doit.addInsn(new Insn(opc_astore_2));
+
+                                // Loop index in var reg 3
+    doit.addInsn(new Insn(opc_bipush, 5));
+    doit.addInsn(new Insn(opc_istore_3));
+
+                                // Start the loop
+    Label loop = new Label("loop");
+    doit.addInsn(loop);
+    doit.addInsn(new Insn(opc_aload_1));
+    doit.addInsn(new Insn(opc_aload_2));
+    doit.addInsn(new Insn(opc_invokevirtual,
+                          new MethodCP("java/io/PrintStream",
+                                       "println",
+                                       "(Ljava/lang/String;)V")));
+    doit.addInsn(new IincInsn(3, -1));
+    doit.addInsn(new Insn(opc_iload_3));
+    doit.addInsn(new Insn(opc_ifne, loop));
+    doit.addInsn(new Insn(opc_return));
+
+                                // set the right sizes for code
+    doit.setStackSize((short)3); doit.setVarSize((short)4);
+
+                                // Add the init code to the class.
+    nclass.addMethod((short)ACC_PUBLIC, "<init>", "()V", init, null);
+
+                                // Add the printing code
+    nclass.addMethod((short)(ACC_PUBLIC|ACC_STATIC), "main",
+                     "([Ljava/lang/String;)V", doit, null);
+
+                                // write it all out
+    nclass.write(new DataOutputStream
+                 (new FileOutputStream("out.class")));
+  }
+}
+
+    
diff --git a/jasmin/jasmin-2.4/lib/jas/examples/simple.jas b/jasmin/jasmin-2.4/lib/jas/examples/simple.jas
new file mode 100644
index 0000000..a12de1a
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/examples/simple.jas
@@ -0,0 +1,30 @@
+;; script to create a class that does nothing.
+
+
+                                        ; make-class-env creates
+                                        ; a ClassEnv object which is
+                                        ; used to store information about
+                                        ; an object.
+(define my-class (make-class-env))
+
+                                        ; make-code creates a code object
+                                        ; which contains the body of a
+                                        ; method.
+
+(define init-code (make-code))
+(jas-code-addinsn init-code
+                  (aload_0))
+(jas-code-addinsn init-code
+                  (invokenonvirtual
+                   (make-method-cpe "java/lang/Object" "<init>" "()V")))
+(jas-code-addinsn init-code
+                  (return))
+
+                                        ; fill up the class with goodies
+(jas-class-setsuperclass my-class (make-class-cpe "java/lang/Object"))
+(jas-class-setclass my-class (make-class-cpe "out"))
+(jas-class-setaccess my-class acc-public)
+(jas-class-addmethod my-class acc-public "<init>" "()V" init-code ())
+
+                                        ; and write it all out
+(jas-class-write my-class (make-outputstream "out.class"))
diff --git a/jasmin/jasmin-2.4/lib/jas/examples/simple.java b/jasmin/jasmin-2.4/lib/jas/examples/simple.java
new file mode 100644
index 0000000..4f8c82b
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/examples/simple.java
@@ -0,0 +1,45 @@
+import jas.*;
+import java.io.*;
+import sun.tools.java.RuntimeConstants;
+
+//
+// This is program that makes calls into the jas package
+// to generate a class that does nothing at all.
+//
+
+class simple implements RuntimeConstants
+{
+  public static void main(String argv[])
+    throws jasError, IOException
+  {
+
+                                // CodeAttr's contain the body of
+                                // a method.
+
+    CodeAttr init = new CodeAttr();
+    init.addInsn(new Insn(opc_aload_0));
+    init.addInsn(new Insn(opc_invokenonvirtual,
+                          new MethodCP("java/lang/Object", "<init>", "()V")));
+    init.addInsn(new Insn(opc_return));
+
+
+                                // ClassEnv's are used as a container
+                                // to hold all information about a class.
+
+    ClassEnv nclass = new ClassEnv();
+    nclass.setClass(new ClassCP("out"));
+    nclass.setSuperClass(new ClassCP("java/lang/Object"));
+
+
+
+                                // Add the init code to the class.
+    nclass.addMethod((short)ACC_PUBLIC, "<init>", "()V", init, null);
+
+
+                                // write it all out
+    nclass.write(new DataOutputStream
+                 (new FileOutputStream("out.class")));
+  }
+}
+
+    
diff --git a/jasmin/jasmin-2.4/lib/jas/examples/test.inp b/jasmin/jasmin-2.4/lib/jas/examples/test.inp
new file mode 100644
index 0000000..bbab5c2
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/examples/test.inp
@@ -0,0 +1,8 @@
+a = 10;
+println a;
+
+b = a + 5;
+
+println (b);
+println(a*b +2);
+
diff --git a/jasmin/jasmin-2.4/lib/jas/tests/README b/jasmin/jasmin-2.4/lib/jas/tests/README
new file mode 100644
index 0000000..18f742f
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/tests/README
@@ -0,0 +1,16 @@
+This is a start of a basic set of tests intended to exercise the API
+functions available in the jas and scm packages. It is not complete by
+any means.
+
+all.java tries to touch as much of the jas API as it can, generating a
+non functional class called regress.class. all.jas does
+something similar, but for the scm package.
+
+  Once the jas and scm packages are compiled, do this:
+
+  % (cd ..; javac -d . tests/all.java; java all; cmp regress.class tests/regress.class)
+  % (cd ..; java scm.driver tests/all.jas; cmp scmregress.class tests/scmregress.class)
+
+
+If both these complete silently, you are in good shape. Otherwise,
+mail me a bug report and enough details for me to replicate it :)
diff --git a/jasmin/jasmin-2.4/lib/jas/tests/all.jas b/jasmin/jasmin-2.4/lib/jas/tests/all.jas
new file mode 100644
index 0000000..3206ba7
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/tests/all.jas
@@ -0,0 +1,72 @@
+(define my-env (make-class-env))
+
+(jas-class-addcpe my-env (make-ascii-cpe "fubar"))
+(jas-class-addcpe my-env (make-class-cpe "java/lang/Number"))
+(jas-class-addcpe my-env (make-double-cpe 2.0))
+(jas-class-addcpe my-env
+ (make-field-cpe "java/lang/System" "out" "Ljava/io/PrintStream;"))
+(jas-class-addcpe my-env (make-float-cpe 2.0))
+(jas-class-addcpe my-env (make-integer-cpe 2))
+(jas-class-addcpe my-env
+ (make-interface-cpe "java/lang/Runnable" "run" "()V"))
+(jas-class-addcpe my-env (make-long-cpe 2))
+(jas-class-addcpe my-env
+ (make-method-cpe "java/lang/Thread" "run" "()V"))
+(jas-class-addcpe my-env
+ (make-name-type-cpe "sdfsdf" "Ljava/lang/Object;"))
+(jas-class-addcpe my-env (make-string-cpe "sdf"))
+(jas-class-addfield my-env
+ (make-field
+  acc-public (make-ascii-cpe "someIntVar") (make-ascii-cpe "I") ()))
+(jas-class-addfield my-env
+ (make-field
+  (| acc-public acc-static) (make-ascii-cpe "finalInt")
+  (make-ascii-cpe "I") (make-const (make-integer-cpe 10.2))))
+(jas-class-addinterface my-env (make-class-cpe "java/lang/Runnable"))
+(jas-class-setclass my-env (make-class-cpe "scmregress"))
+(jas-class-setsuperclass my-env (make-class-cpe "java/lang/Object"))
+(jas-class-setaccess my-env acc-public)
+
+        
+(define my-code (make-code))
+(jas-code-addinsn my-code (return))
+(jas-code-addinsn my-code (astore 5))
+(jas-code-addinsn my-code (make-label "First label"))
+(jas-code-addinsn my-code (jsr (make-label "First label")))
+(define saved-label (make-label "second_label"))
+(jas-code-addinsn my-code saved-label)
+(jas-code-addinsn my-code (ldc_w (make-string-cpe "sdfsdf")))
+(jas-code-addinsn my-code (iinc 2 -2))
+(jas-code-addinsn my-code
+                  (invokeinterface
+                   (make-class-cpe "java/lang/Number") 1))
+
+(jas-code-addinsn my-code (multianewarray (make-class-cpe "java/lang/Double")
+                                         3))
+(define ctb (make-catchtable))
+(jas-add-catch-entry ctb (make-catch-entry
+                          (make-label "First label")
+                          saved-label
+                          saved-label
+                          (make-class-cpe "java/lang/Exception")))
+(jas-add-catch-entry ctb (make-catch-entry
+                          (make-label "First label")
+                          saved-label
+                          saved-label
+                          (make-class-cpe "java/lang/Error")))
+(jas-set-catchtable my-code ctb)
+(jas-code-stack-size my-code 100)
+(jas-code-var-size my-code 100)
+(define my-except (make-exception))
+(jas-exception-add my-except (make-class-cpe "java/io/IOException"))
+(jas-exception-add my-except (make-class-cpe "java/lang/Error"))
+
+(jas-class-addmethod my-env
+                     acc-public
+                     "somemethod"
+                     "(I)V"
+                     my-code
+                     my-except)
+(jas-class-write my-env (make-outputstream "scmregress.class"))
+
+                     
\ No newline at end of file
diff --git a/jasmin/jasmin-2.4/lib/jas/tests/all.java b/jasmin/jasmin-2.4/lib/jas/tests/all.java
new file mode 100644
index 0000000..ed185b2
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/jas/tests/all.java
@@ -0,0 +1,155 @@
+                                // Simply try
+                                // to access as much of
+                                // the API as possible.
+
+import jas.*;
+
+import java.io.*;
+import sun.tools.java.RuntimeConstants;
+
+public class all implements RuntimeConstants
+{
+  public static void main(String argv[])
+    throws Exception
+  {
+    ClassEnv c = new ClassEnv();
+
+                                // Adding CP Items directly
+
+    c.addCPItem(new AsciiCP("fubar"));
+    c.addCPItem(new ClassCP("java/lang/Number"));
+    c.addCPItem(new DoubleCP(2.0));
+    c.addCPItem(new FieldCP("java/lang/System",
+                            "out",
+                            "Ljava/io/PrintStream;"));
+    c.addCPItem(new FloatCP((float)(2.0)));
+    c.addCPItem(new IntegerCP(2));
+    c.addCPItem(new InterfaceCP("java/lang/Runnable",
+                                "run",
+                                "()V"));
+    c.addCPItem(new LongCP(2));
+    c.addCPItem(new MethodCP("java/lang/Thread",
+                             "run",
+                             "()V"));
+
+    c.addCPItem(new NameTypeCP("sdfsdf", "Ljava/lang/Object;"));
+    c.addCPItem(new StringCP("sdf"));
+
+
+                                // Add fields, creating variables
+    c.addField(new Var((short) ACC_PUBLIC,
+                       new AsciiCP("someIntvar"),
+                       new AsciiCP("I"),
+                       null));
+    c.addField(new Var((short)(ACC_PUBLIC|ACC_STATIC|ACC_FINAL),
+                       new AsciiCP("finalInt"),
+                       new AsciiCP("I"),
+                       new ConstAttr(new IntegerCP(10))));
+
+                                // Check if I can add interfaces
+    c.addInterface(new ClassCP("java/lang/Runnable"));
+
+    c.setClass(new ClassCP("regress"));
+    c.setSuperClass(new ClassCP("java/lang/Object"));
+    c.setClassAccess((short) ACC_PUBLIC);
+
+                                // Creating code.
+    
+    CodeAttr code = new CodeAttr();
+                                // add instructions of various
+                                // operand types.
+
+                                // No operands
+    code.addInsn(new Insn(opc_return));
+                                // one arg operands
+    code.addInsn(new Insn(opc_astore, 5));
+                                // one arg arguments with wide operand
+    code.addInsn(new Insn(opc_dstore, 256));
+    code.addInsn(new Insn(opc_istore, 2576));
+
+                                // Add a label
+    code.addInsn(new Label("First label"));
+                                // refer back to it
+    code.addInsn(new Insn(opc_jsr,
+                          new Label("First label")));
+                                // add another label
+    code.addInsn(new Label("second_label"));
+                                // insn with CP argument
+    code.addInsn(new Insn(opc_ldc_w, new StringCP("sdfsdf")));
+
+                                // the "special" instructions
+    code.addInsn(new IincInsn(2, -2));
+                                // wider version check
+    code.addInsn(new IincInsn(1234, 2));
+    code.addInsn(new IincInsn(3, -200));
+    code.addInsn(new InvokeinterfaceInsn(new ClassCP("java/lang/Number"), 1));
+    code.addInsn(new MultiarrayInsn(new ClassCP("java/lang/Double"), 3));
+    Label woo[] = new Label[3];
+    woo[0] = new Label("First label");
+    woo[1] = new Label("second_label");
+    woo[2] = new Label("second_label");
+    code.addInsn(new TableswitchInsn(0, 2, woo[0], woo));
+
+    int m[] = new int[3];
+    m[0] = 11;
+    m[1] = 15;
+    m[2] = -1;
+    code.addInsn(new LookupswitchInsn(woo[0], m, woo));
+
+
+                                // make a catchtable
+    Catchtable ctb = new Catchtable();
+                                // add a couple of entries
+    ctb.addEntry(new Label("First label"),
+                 new Label("second_label"),
+                 new Label("second_label"),
+                 new ClassCP("java/lang/Exception"));
+    ctb.addEntry(new Label("First label"),
+                 new Label("second_label"),
+                 new Label("second_label"),
+                 new ClassCP("java/lang/Error"));
+    code.setCatchtable(ctb);
+    code.setStackSize((short)100);
+    code.setVarSize((short)500);
+				// Add some line table info
+    LineTableAttr ln = new LineTableAttr();
+    ln.addEntry(woo[0], 234);
+    ln.addEntry(woo[1], 245);
+    ln.addEntry(woo[2], 22);
+    code.setLineTable(ln);
+				// Add a generic attr to a method
+    String foo = "sldkfj sdlfkj";
+    byte dat[] = new byte[foo.length()];
+    foo.getBytes(0, dat.length, dat, 0);
+    code.addGenericAttr(new GenericAttr("strangeAttr", dat));
+
+				// Also adding local varinfo
+    LocalVarTableAttr lv = new LocalVarTableAttr();
+    lv.addEntry(new LocalVarEntry(woo[0], woo[2], "fakevar", "I", 22));
+    lv.addEntry(new LocalVarEntry(woo[1], woo[1], "morefa", "()V", 10));
+    code.setLocalVarTable(lv);
+
+                                // check out add method, also
+                                // adding a throws exception for
+                                // good measure
+    ExceptAttr ex = new ExceptAttr();
+    ex.addException(new ClassCP("java/io/IOException"));
+    ex.addException(new ClassCP("java/lang/Error"));
+    c.addMethod((short) ACC_PUBLIC,
+                "fubarmethod",
+                "()V",
+                code,
+                ex);
+
+
+
+
+				// Add a source file attribute
+    c.setSource(new SourceAttr("all.java"));
+				// Add some more generic attribute
+    c.addGenericAttr(new GenericAttr("blahAttr", dat));
+    c.write(new DataOutputStream(new FileOutputStream("regress.class")));
+  }
+}
+
+    
diff --git a/jasmin/jasmin-2.4/lib/jas/tests/regress.class b/jasmin/jasmin-2.4/lib/jas/tests/regress.class
new file mode 100644
index 0000000..ada259f
Binary files /dev/null and b/jasmin/jasmin-2.4/lib/jas/tests/regress.class differ
diff --git a/jasmin/jasmin-2.4/lib/jas/tests/scmregress.class b/jasmin/jasmin-2.4/lib/jas/tests/scmregress.class
new file mode 100644
index 0000000..47421a4
Binary files /dev/null and b/jasmin/jasmin-2.4/lib/jas/tests/scmregress.class differ
diff --git a/jasmin/jasmin-2.4/lib/java_cup.jar b/jasmin/jasmin-2.4/lib/java_cup.jar
new file mode 100644
index 0000000..eb1a3ae
Binary files /dev/null and b/jasmin/jasmin-2.4/lib/java_cup.jar differ
diff --git a/jasmin/jasmin-2.4/lib/java_cup/INSTALL b/jasmin/jasmin-2.4/lib/java_cup/INSTALL
new file mode 100644
index 0000000..1e73f85
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/java_cup/INSTALL
@@ -0,0 +1,100 @@
+#!/bin/csh
+#
+# JavaCup install and test script
+# Scott Hudson 8/31/95
+#  
+# Last revision 1/7/96 (for v0.9d)
+#
+echo 
+echo "===================================="
+echo "Installing and testing JavaCup v0.9d"
+echo "===================================="
+echo
+
+# check for this directory in CLASSPATH 
+#
+set cwd = `pwd`
+if ($CLASSPATH !~ "*$cwd*") then
+  echo " "
+  echo "WARNING:"
+  echo "WARNING: The current directory does not appear in your CLASSPATH"
+  echo "WARNING: it will be added for this install/test only"
+  echo "WARNING:"
+  echo " "
+  set CLASSPATH = $CLASSPATH':'$cwd
+  echo "CLASSPATH now set to " 
+  echo $CLASSPATH
+endif
+  
+# change to the demo directory
+#
+echo " "
+echo "changing to simple_calc subdirectory..."
+echo "cd simple_calc"
+cd simple_calc 
+
+# remove old copies of parser.java and sym.java
+#
+echo " "
+echo "removing any old copies of parser.java and sym.java..."
+echo "rm -f parser.java sym.java"
+rm -f parser.java sym.java
+
+# compile java_cup and run it against the demo program
+#   the -cs (for "checksource") option here will force the 
+#   java_cup and java_cup.runtime source to be compiled prior 
+#   to running it.
+#
+echo " "
+echo "compiling java_cup then generating demo program..."
+echo "java -cs java_cup.Main < parser.cup"
+java -cs java_cup.Main < parser.cup 
+
+# make sure parser.java and sym.java now exist
+#
+if ( ! -e parser.java) then
+  echo " "
+  echo "ERROR: for some reason parser.java was not created"
+  echo "ERROR: install was not successful"
+  exit 1
+endif
+if ( ! -e sym.java) then
+  echo " "
+  echo "ERROR: for some reason sym.java was not created"
+  echo "ERROR: install was not successful"
+  exit 1
+endif
+
+# run the demo
+#  again, the -cs option will cause compilation of all the parts 
+#  of the demo program (including parser.java and sym.java that 
+#  should have been generated in the previous step).
+#
+echo "removing old test results..."
+echo "rm -f test_results"
+rm -f test_results
+echo " "
+echo "executing the demo program..."
+echo "echo '2+2;' | java -cs Main >& test_results"
+echo '2+2;' | java -cs Main >& test_results
+
+# compare with standard results 
+#
+set res = `tail -1 test_results`
+if ("$res" !~ "= 4") then
+  echo "ERROR: test program produced the wrong results"
+  echo "ERROR: output was:"
+  cat test_results
+  echo "ERROR: install was not successful"
+  rm -f test_results
+  exit 2
+endif
+  
+# all is well
+#
+rm -f test_results
+echo " "
+echo "=============================="
+echo "Install and test was successful"
+echo "=============================="
+exit 0
diff --git a/jasmin/jasmin-2.4/lib/java_cup/JASMIN_NOTES.txt b/jasmin/jasmin-2.4/lib/java_cup/JASMIN_NOTES.txt
new file mode 100644
index 0000000..3feba3a
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/java_cup/JASMIN_NOTES.txt
@@ -0,0 +1,5 @@
+Jasmin use of Java Cup
+
+The source code for JavaCup, as it is used in the Jasmin distribution, has been moved to ../src/java_cup.
+
+
diff --git a/jasmin/jasmin-2.4/lib/java_cup/README.txt b/jasmin/jasmin-2.4/lib/java_cup/README.txt
new file mode 100644
index 0000000..6a86c1b
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/java_cup/README.txt
@@ -0,0 +1,44 @@
+
+This directory contains the Java CUP v0.9d release in source form.  You should
+find the following files and subdirectories in this release:
+
+  README            This file.
+  java_cup          A subdirectory containing Java CUP and runtime sources.
+  javacup.logo.gif  A logo image used by the manual.
+  manual.html       A user's manual in HTML format.
+  simple_calc       A subdirectory containing a small demo and test application.
+  INSTALL           A shell script to install and test the system
+
+To install the release, copy the contents of this directory (if you haven't
+done so already) into a "classes" directory accessible to the java interpreter
+(i.e., a directory that is listed in the colon separated list of directories
+in your CLASSPATH environment variable).
+
+Once files have been copied to an appropriate location, you should be able to
+both compile and test the system by executing the INSTALL shell script
+(sorry, but non Unix users are still on their own for this release
+-- zip archive and directions for Win95 users coming soon).  
+Again, be sure that you have placed these sources in a directory listed in 
+your CLASSPATH environment variable (or changed your CLASSPATH to include 
+this directory).  The INSTALL script will warn you if this is not the case. 
+
+A manual page that explains the operation and use of the system can be found
+in manual.html and from the Java CUP home page mentioned below.
+
+This is an alpha-test release of the Java CUP system and is designed to run 
+under the JDK-beta2 Java compiler.  Bug reports regarding the installation 
+process or the system as a whole can be sent to java-cup@cc.gatech.edu.
+
+The Java CUP home page where the latest information regarding Java CUP can be 
+found (e.g., new releases) is:
+
+  http://www.cc.gatech.edu/gvu/people/Faculty/hudson/java_cup/home.html
+
+Enjoy,
+
+Scott Hudson
+Graphics, Visualization, and Usability Center 
+Georgia Institute of Technology
+	 
+Last updated: 1/7/96 [SEH]
+
diff --git a/jasmin/jasmin-2.4/lib/java_cup/Thumbs.db b/jasmin/jasmin-2.4/lib/java_cup/Thumbs.db
new file mode 100644
index 0000000..55ecf3d
Binary files /dev/null and b/jasmin/jasmin-2.4/lib/java_cup/Thumbs.db differ
diff --git a/jasmin/jasmin-2.4/lib/java_cup/java_cup.logo.new.gif b/jasmin/jasmin-2.4/lib/java_cup/java_cup.logo.new.gif
new file mode 100644
index 0000000..6e95ca8
Binary files /dev/null and b/jasmin/jasmin-2.4/lib/java_cup/java_cup.logo.new.gif differ
diff --git a/jasmin/jasmin-2.4/lib/java_cup/manual.html b/jasmin/jasmin-2.4/lib/java_cup/manual.html
new file mode 100644
index 0000000..1192440
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/java_cup/manual.html
@@ -0,0 +1,883 @@
+<html><head>
+<title>Java(tm) CUP User's Manual</title>
+</head><body>
+
+<hr>
+<img src="java_cup.logo.new.gif" alt="Java CUP Logo Image">
+<hr>
+<h1>Java(tm) CUP User's Manual</h1>
+<h3><a href="http://www.cc.gatech.edu/gvu/people/Faculty/Scott.E.Hudson.html">
+Scott E. Hudson</a><br> 
+<a href="http://www.cc.gatech.edu/gvu/gvutop.html">
+Graphics Visualization and Usability Center</a><br> 
+<a href="http://www.gatech.edu/TechHome.html">
+Georgia Institute of Technology</a><br>
+<i>January 1996</i> (v0.9d release)</h3>
+<hr>
+
+<h3>Table of Contents</h3>
+<dl compact>
+  <dt> 1.  <dd> <a href="#intro">Introduction and Example</a>
+  <dt> 2.  <dd> <a href="#spec">Specification Syntax</a>
+  <dt> 3.  <dd> <a href="#running">Running Java CUP</a>
+  <dt> 4.  <dd> <a href="#parser">Customizing the Parser</a>
+  <dt> 5.  <dd> <a href="#errors">Error Recovery</a>
+  <dt> 6.  <dd> <a href="#conclusion">Conclusion</a>
+  <dt>     <dd> <a href="#refs">References</a>
+  <dt> A.  <dd> <a href="#appendixa">Grammar for Java CUP Specification Files</a>
+  <dt> B.  <dd> <a href="#appendixb">A Very Simple Example Scanner</a>
+</dl>
+
+<a name=intro>
+<h3>1. Introduction and Example</h3></a>
+
+This manual describes the basic operation and use of the 
+Java<a href="#trademark">(tm)</a>
+Based Constructor of Useful Parsers (Java CUP for short).
+Java CUP is a system for generating LALR parsers from simple specifications.
+It serves the same role as the widely used program YACC 
+<a href="#YACCref">[1]</a> and in fact offers most of the features of YACC.  
+However, Java CUP is written in Java, uses specifications including embedded 
+Java code, and produces parsers which are implemented in Java.<p>
+
+Although covering all aspect of the Java CUP system, this manual is relatively
+brief, assumes you have at least a little bit of knowledge of LR parsing,
+and preferably have a bit of experience with a program such as YACC.  
+A number of compiler construction textbooks (such as 
+<a href="#dragonbook">[2</a>,<a href="#crafting">3]</a>) cover this material, 
+and discuss the YACC system (which is quite similar to this one) as a 
+specific example. <p> 
+
+Using Java CUP involves creating a simple specifications based on the
+grammar for which a parser is needed, along with construction of a
+scanner capable of breaking characters up into meaningful tokens (such
+as keywords, numbers, and special symbols).<p> 
+
+As a simple example, consider a 
+system for evaluating simple arithmetic expressions over integers.  
+This system would read expressions from standard input (each terminated 
+with a semicolon), evaluate them, and print the result on standard output.  
+A grammar for the input to such a system might look like: <pre>
+  expr_list ::= expr_list expr_part | expr_part
+  expr_part ::= expr ';'
+  expr      ::= expr '+' term | expr '-' term | term
+  term      ::= term '*' factor | term '/' factor | term '%' factor | factor
+  factor    ::= number | '-' expr | '(' expr ')'
+</pre>
+To specify a parser based on this grammar, our first step is to identify and
+name the set of terminal symbols that will appear on input, and the set of 
+non terminal symbols.  In this case, the non terminals are: 
+
+<pre><tt>  expr_list, expr_part, expr, term,</tt> and <tt>factor</tt>.</pre>
+
+For terminal names we might choose:
+
+<pre><tt>  SEMI, PLUS, MINUS, TIMES, DIVIDE, MOD, NUMBER, LPAREN,</tt> and <tt>RPAREN</tt></pre>
+
+Based on these namings we can construct a small Java CUP specification 
+as follows:<br>
+<hr>
+<pre><tt>// Java CUP specification for a simple expression evaluator (no actions)
+
+import java_cup.runtime.*;
+
+/* Preliminaries to set up and use the scanner.  */
+init with {: scanner.init();              :};
+scan with {: return scanner.next_token(); :};
+
+/* Terminals (tokens returned by the scanner). */
+terminal token     SEMI, PLUS, MINUS, TIMES, DIVIDE, MOD,  LPAREN, RPAREN;
+terminal int_token NUMBER;
+
+/* Non terminals */
+non terminal symbol     expr_list, expr_part;
+non terminal int_token  expr, term, factor;
+
+/* The grammar */
+expr_list ::= expr_list expr_part | 
+              expr_part;
+expr_part ::= expr SEMI;
+expr      ::= expr PLUS term | 
+              expr MINUS term | 
+              term;
+term      ::= term TIMES factor | 
+              term DIVIDE factor | 
+              term MOD factor | 
+              factor;
+factor    ::= NUMBER | 
+              MINUS factor | 
+              LPAREN expr LPAREN;
+</tt></pre>
+<hr><br>
+We will consider each part of the specification syntax in detail later.  
+However, here we can quickly see that the specification contains three 
+main parts.  The first part provides preliminary and miscellaneous declarations
+to specify how the parser is to be generated, and supply parts of the 
+runtime code.  In this case we indicate that the <tt>java_cup.runtime</tt>
+classes should be imported, then supply a small bit of initialization code,
+and some code for invoking the scanner to retrieve the next input token.
+The second part of the specification declares terminals and non terminals,
+and associates object classes with each.  In this case, we declare our terminals
+as being represented at runtime by two object types: <tt>token</tt> and 
+<tt>int_token</tt> (which are supplied as part of the Java CUP runtime system), 
+while various non terminals are represented by objects of types <tt>symbol</tt>
+and <tt>int_token</tt> (again supplied from the runtime system).  The final 
+part of the specification contains the grammar.<p>
+
+To produce a parser from this specification we use the Java CUP generator.
+If this specification were stored in a file <tt>parser.cup</tt>, then 
+(on a Unix system at least) we might invoke Java CUP using a command like:
+<pre><tt> java java_cup.Main &lt; parser.cup</tt> </pre>
+In this case, the system will produce two Java source files containing 
+parts of the generated parser: <tt>sym.java</tt> and <tt>parser.java</tt>.  
+As you might expect, these two files contain declarations for the classes 
+<tt>sym</tt> and <tt>parser</tt>. The <tt>sym</tt> class contains a series of 
+constant declarations, one for each terminal symbol.  This is typically used 
+by the scanner to refer to symbols (e.g. with code such as 
+"<tt>return new token(sym.SEMI);</tt>" ).  The <tt>parser</tt> class 
+implements the parser itself.<p>
+
+The specification above, while constructing a full parser, does not perform 
+any semantic actions -- it will only indicate success or failure of a parse.
+To calculate and print values of each expression, we must embed Java
+code within the parser to carry out actions at various points.  In Java CUP,
+actions are contained in <i>code strings</i> which are surrounded by delimiters 
+of the form <tt>{:</tt> and <tt>:}</tt> (we can see examples of this in the 
+<tt>init with</tt> and <tt>scan with</tt> clauses above).  In general, the 
+system records all characters within the delimiters, but does not try to check 
+that it contains valid Java code.<p>
+
+A more complete Java CUP specification for our example system (with actions 
+embedded at various points in the grammar) is shown below:<br>
+<hr>
+<pre><tt>// Java CUP specification for a simple expression evaluator (w/ actions)
+
+import java_cup.runtime.*;
+
+/* Preliminaries to set up and use the scanner.  */
+init with {: scanner.init();              :};
+scan with {: return scanner.next_token(); :};
+
+/* Terminals (tokens returned by the scanner). */
+terminal token     SEMI, PLUS, MINUS, TIMES, DIVIDE, MOD,  LPAREN, RPAREN;
+terminal int_token NUMBER;
+
+/* Non terminals */
+non terminal symbol     expr_list, expr_part;
+non terminal int_token  expr, term, factor;
+
+/* The grammar */
+expr_list ::= expr_list expr_part 
+	      | 
+              expr_part;
+
+expr_part ::= expr:e 
+	      {: System.out.println("= " + e.int_val); :} 
+              SEMI              
+	      ;
+
+expr      ::= expr:e1 PLUS term:e2    
+	      {: RESULT.int_val = e1.int_val + e2.int_val; :} 
+	      | 
+              expr:e1 MINUS term:e2    
+              {: RESULT.int_val = e1.int_val - e2.int_val; :} 
+	      | 
+              term:e1                  
+	      {: RESULT.int_val = e1.int_val; :} 
+	      ;
+
+term      ::= term:e1 TIMES factor:e2 
+	      {: RESULT.int_val = e1.int_val * e2.int_val; :} 
+	      | 
+              term:e1 DIVIDE factor:e2 
+	      {: RESULT.int_val = e1.int_val / e2.int_val; :} 
+	      | 
+              term:e1 MOD factor:e2 
+	      {: RESULT.int_val = e1.int_val % e2.int_val; :} 
+	      | 
+              factor:e                 
+	      {: RESULT.int_val = e.int_val; :} 
+	      ;
+
+factor    ::= NUMBER:n                 
+	      {: RESULT.int_val = n.int_val;  :} 
+	      | 
+              MINUS factor:e             
+	      {: RESULT.int_val = -e.int_val; :} 
+	      | 
+              LPAREN expr:e RPAREN     
+	      {: RESULT.int_val = e.int_val;  :} 
+	      ;
+</tt></pre>
+<hr><br>
+Here we can see several changes.  Most importantly, code to be executed at 
+various points in the parse is included inside code strings delimited by 
+<tt>{:</tt> and <tt>:}</tt>.  In addition, labels have been placed on various 
+symbols in the right hand side of productions.  For example in:<br>
+<pre>  expr ::= expr:e1 PLUS term:e2   
+           {: RESULT.int_val = e1.int_val + e2.int_val; :}
+</pre>
+the non terminal <tt>expr</tt> has been labeled with <tt>e1</tt>, while 
+<tt>term</tt> has been labeled with <tt>e2</tt>.  The left hand side
+symbol of each production is always implicitly labeled as <tt>RESULT</tt>.<p>
+
+Each symbol appearing in a production is represented at runtime by an 
+object (on the parse stack).  These labels allow code embedded in a
+production to refer to these objects.  Since <tt>expr</tt> and <tt>term</tt>
+were both declared as <tt>int_token</tt>, they are both represented by
+an object of class <tt>int_token</tt>.  These objects are created 
+as the result of matching some other production.  The code in that production
+fills in various fields of its result object, which are in turn used here to 
+fill in a new result object, and so on.  Overall this is a very common
+form of syntax directed translation related to attribute grammars and 
+discussed at length in compiler construction textbooks such as 
+<a href="#dragonbook">[2</a>,<a href="#crafting">3]</a>.
+<p>
+
+In our specific example, the <tt>int_token</tt> class includes an 
+<tt>int_val</tt> field which stores an <tt>int</tt> value.  We use this 
+field to compute the value of the expression from its component parts.  
+In the production above, we compute the <tt>int_val</tt> field of the 
+left hand side symbol (i.e. <tt>RESULT</tt>) as the sum of the values 
+computed by the <tt>expr</tt> and <tt>term</tt> parts making up this 
+expression.  That value in turn may be combined with other to compute a 
+final result.<p>
+
+The final step in creating a working parser is to create a <i>scanner</i> (also
+known as a <i>lexical analyzer</i> or simply a <i>lexer</i>).  This routine is 
+responsible for reading individual characters, removing things things like
+white space and comments, recognizing which terminal symbols from the 
+grammar each group of characters represents, then returning token objects
+representing these symbols to the parser. Example code for a workable (if 
+not elegant or efficient) scanner for our example system can be found in 
+<a href="#appendixb">Appendix B</a>.<p>
+
+Like the very simple one given in Appendix B, all scanners need to return 
+objects which are instances of <tt>java_cup.runtime.token</tt> (or one of 
+its subclasses).  The runtime system predefines three such classes: 
+<tt>token</tt> which contains no specific information beyond the token 
+type (and some internal information used by the parser), <tt>int_token</tt> 
+which also records a single <tt>int</tt> value, and <tt>str_token</tt> which 
+records a single string value. <p>
+
+The code contained in the <tt>init with</tt> clause of the specification 
+will be executed before any tokens are requested.  Each token will be 
+requested using whatever code is found in the <tt>scan with</tt> clause.
+Beyond this, the exact form the scanner takes is up to you. <p>
+
+In the <a href="#spec">next section</a> a more detailed and formal 
+explanation of all parts of a Java CUP specification will be given.  
+<a href="#running">Section 3</a> describes options for running the 
+Java CUP system.  <a href="#parser">Section 4</a> discusses the details 
+of how to customize a Java CUP parser, while <a href="#errors">Section 5</a>
+considers error recovery.  Finally, <a href="#conclusion">Section 6</a> 
+provides a conclusion.
+
+<a name="spec">
+<h3>2. Specification Syntax</h3></a>
+Now that we have seen a small example, we present a complete description of all 
+parts of a Java CUP specification.  A specification has four sections with 
+a total of eight specific parts (however, most of these are optional).  
+A specification consists of:
+<ul>
+<li> <a href="#package_spec">package and import specifications</a>,
+<li> <a href="#code_part">user code components</a>,
+<li> <a href="#symbol_list">symbol (terminal and non-terminal) lists</a>, and
+<li> <a href="#production_list">the grammar</a>.
+</ul>
+Each of these parts must appear in the order presented here.  (A complete 
+grammar for the specification language is given in 
+<a href="#appendixa">Appendix A</a>.)  The particulars of each part of
+the specification are described in the subsections below.<p>
+
+<h5><a name="package_spec">Package and Import Specifications</a></h5>
+
+A specification begins with optional <tt>package</tt> and <tt>import</tt> 
+declarations.  These have the same syntax, and play the same 
+role, as the package and import declarations found in a normal Java program.
+A package declaration is of the form:
+
+<pre><tt>    package <i>name</i>;</tt></pre>
+
+where name <tt><i>name</i></tt> is a Java package identifier, possibly in
+several parts separated by ".".  In general, Java CUP employs Java lexical
+conventions.  So for example, both styles of Java comments are supported,
+and identifiers are constructed beginning with a letter, dollar
+sign ($), or underscore (_), which can then be followed by zero or more
+letters, numbers, dollar signs, and underscores.<p>
+
+After an optional <tt>package</tt> declaration, there can be zero or more 
+<tt>import</tt> declarations. As in a Java program these have the form:
+
+<pre><tt>    import <i>package_name.class_name</i>;</tt>
+</pre>
+or
+<pre><tt>    import <i>package_name</i>.*;</tt>
+</pre>
+
+The package declaration indicates what package the <tt>sym</tt> and 
+<tt>parser</tt> classes that are generated by the system will be in.  
+Any import declarations that appear in the specification will also appear
+in the source file for the <tt>parser</tt> class allowing various names from
+that package to be used directly in user supplied action code.
+
+<h5><a name="code_part">User Code Components</a></h5>
+
+Following the optional <tt>package</tt> and <tt>import</tt> declarations
+are a series of optional declarations that allow user code to be included
+as part of the generated parser (see <a href="#parser">Section 4</a> for a 
+full description of how the parser uses this code).  As a part of the parser 
+file, a separate non-public class to contain all embedded user actions is 
+produced.  The first <tt>action code</tt> declaration section allows code to 
+be included in this class.  Routines and variables for use by the code 
+embedded in the grammar would normally be placed in this section (a typical 
+example might be symbol table manipulation routines).  This declaration takes 
+the form:
+
+<pre><tt>    action code {: ... :};</tt>
+</pre>
+
+where <tt>{: ... :}</tt> is a code string whose contents will be placed
+directly within the <tt>action class</tt> class declaration.<p>
+
+After the <tt>action code</tt> declaration is an optional 
+<tt>parser code</tt> declaration.  This declaration allows methods and
+variable to be placed directly within the generated parser class.
+Although this is less common, it can be helpful when customizing the 
+parser -- it is possible for example, to include scanning methods inside
+the parser and/or override the default error reporting routines.  This 
+declaration is very similar to the <tt>action code</tt> declaration and 
+takes the form:
+
+<pre><tt>    parser code {: ... :};</tt>
+</pre>
+
+Again, code from the code string is placed directly into the generated parser
+class definition.<p>
+
+Next in the specification is the optional <tt>init</tt> declaration 
+which has the form:
+
+<pre><tt>    init with {: ... :};</tt></pre>
+
+This declaration provides code that will be executed by the parser
+before it asks for the first token.  Typically, this is used to initialize
+the scanner as well as various tables and other data structures that might
+be needed by semantic actions.  In this case, the code given in the code
+string forms the body of a <tt>void</tt> method inside the <tt>parser</tt> 
+class.<p>
+
+The final (optional) user code section of the specification indicates how 
+the parser should ask for the next token from the scanner.  This has the
+form:
+
+<pre><tt>    scan with {: ... :};</tt></pre>
+
+As with the <tt>init</tt> clause, the contents of the code string forms
+the body of a method in the generated parser.  However, in this case
+the method returns an object of type <tt>java_cup.runtime.token</tt>.
+Consequently the code found in the <tt>scan with</tt> clause should 
+return such a value.<p>
+
+<h5><a name="symbol_list">Symbol Lists</a></h5>
+
+Following user supplied code comes the first required part of the 
+specification: the symbol lists.  These declarations are responsible 
+for naming and supplying a type for each terminal and non-terminal
+symbol that appears in the grammar.  As indicated above, each terminal
+and non-terminal symbol is represented at runtime with an object.  In
+the case of terminals, these are returned by the scanner and placed on
+the parse stack.  In the case of non terminals these replace a series
+of symbol objects on the parse stack whenever the right hand side of
+some production is recognized.  In order to tell the parser which object
+types should be used for which symbol, <tt>terminal</tt> and 
+<tt>non terminal</tt> declarations are used.  These take the forms:
+
+<pre><tt>    terminal <i>classname</i> <i>name1, name2,</i> ...;</tt>
+</pre>
+
+and
+
+<pre><tt>    non terminal <i>classname</i> <i>name1, name2,</i> ...;</tt>
+</pre>
+
+where <tt><i>classname</i></tt> can be a multiple part name separated with
+"."s.  Since the parser uses these objects for internal bookkeeping, the 
+classes used for non terminal symbols must be a subclass of 
+<tt>java_cup.runtime.symbol</tt>.  Similarly, the classes used for terminal 
+symbols must be a subclass of <tt>java_cup.runtime.token</tt> (note that
+<tt>java_cup.runtime.token</tt> is itself a subclass of 
+<tt>java_cup.runtime.symbol</tt>). 
+
+<h5><a name="production_list">The Grammar</a></h5>
+
+The final section of a Java CUP declaration provides the grammar.  This 
+section optionally starts with a declaration of the form:
+
+<pre><tt>    start with <i>nonterminal</i>;</tt>
+</pre>
+
+This indicates which non terminal is the <i>start</i> or <i>goal</i> 
+non terminal for parsing.  If a start non terminal is not explicitly
+declared, then the non terminal on the left hand side of the first 
+production will be used.<p>
+
+The grammar itself follows the optional <tt>start</tt> declaration.  Each
+production in the grammar has a left hand side non terminal followed by 
+the symbol "<tt>::=</tt>", which is then followed by a series of zero or more
+actions, terminal, or non terminal symbols, and terminated with a semicolon (;).
+Each symbol on the right hand side can optionally be labeled with a name.
+Label names appear after the symbol name separated by a colon (:).  Label
+names must be unique within the production, and can be used within action
+code to refer to the runtime object that represents the symbol.
+If there are several productions for the same non terminal they may be 
+declared together.  In this case the productions start with the non terminal 
+and "<tt>::=</tt>".  This is followed by multiple right hand sides each 
+separated by a bar (|).  The full set of productions is then terminated by a 
+semicolon.<p>
+
+Actions appear in the right hand side as code strings (e.g., Java code inside
+<tt>{:</tt> ... <tt>:}</tt> delimiters).  These are executed by the parser
+at the point when the portion of the production to the left of the 
+action has been recognized.  (Note that the scanner will have returned the 
+token one past the point of the action since the parser needs this extra
+<i>lookahead</i> token for recognition.)
+
+<a name="running">
+<h3>3. Running Java CUP</h3></a>
+
+As mentioned above, Java CUP is written in Java.  To invoke it, one needs
+to use the Java interpreter to invoke the static method 
+<tt>java_cup.Main()</tt>, passing an array of strings containing options.  
+Assuming a Unix machine, the simplest way to do this is typically to invoke it 
+directly from the command line with a command such as: 
+
+<pre><tt>    java java_cup.Main <i>options</i> &lt; <i>inputfile</i></tt></pre>
+
+Once running, Java CUP expects to find a specification file on standard input
+and produces two Java source files as output. <p>
+
+In addition to the specification file, Java CUP's behavior can also be changed
+by passing various options to it.  Legal options include:
+<dl>
+  <dt><tt>-package</tt> <i>name</i>  
+  <dd>Specify that the <tt>parser</tt> and <tt>sym</tt> classes are to be 
+       placed in the named package.  By default, no package specification 
+       is put in the generated code (hence the classes default to the special 
+       "unnamed" package).
+
+  <dt><tt>-parser</tt> <i>name</i>   
+  <dd>Output parser and action code into a file (and class) with the given
+      name instead of the default of "<tt>parser</tt>".
+
+  <dt><tt>-symbols</tt> <i>name</i>  
+  <dd>Output the symbol constant code into a class with the given
+      name instead of the default of "<tt>sym</tt>".
+
+  <dt><tt>-nonterms</tt>      
+  <dd>Place constants for non terminals into the  symbol constant class.
+      The parser does not need these symbol constants, so they are not normally
+      output.  However, it can be very helpful to refer to these constants
+      when debugging a generated parser.
+
+  <dt><tt>-expect</tt> <i>number</i>      
+  <dd>During parser construction the system may detect that an ambiguous 
+      situation would occur at runtime.  This is called a <i>conflict</i>.  
+      In general, the parser may be unable to decide whether to <i>shift</i> 
+      (read another symbol) or <i>reduce</i> (replace the recognized right 
+      hand side of a production with its left hand side).  This is called a 
+      <i>shift/reduce conflict</i>.  Similarly, the parser may not be able 
+      to decide between reduction with two different productions.  This is 
+      called a <i>reduce/reduce conflict</i>.  Normally, if one or more of 
+      these conflicts occur, parser generation is aborted.  However, in 
+      certain carefully considered cases it may be advantageous to 
+      arbitrarily break such a conflict.  In this case Java CUP uses YACC 
+      convention and resolves shift/reduce conflicts by shifting, and 
+      reduce/reduce conflicts using the "highest priority" production (the 
+      one declared first in the specification).  In order to enable automatic 
+      breaking of conflicts the <tt>-expect</tt> option must be given 
+      indicating exactly how many conflicts are expected.
+
+  <dt><tt>-compact_red</tt>   
+  <dd>Including this option enables a table compaction optimization involving
+      reductions.  In particular, it allows the most common reduce entry in 
+      each row of the parse action table to be used as the default for that 
+      row.  This typically saves considerable room in the tables, which can 
+      grow to be very large.  This optimization has the effect of replacing 
+      all error entries in a row with the default reduce entry.  While this 
+      may sound dangerous, if not down right incorrect, it turns out that this 
+      does not affect the correctness of the parser.  In particular, some
+      changes of this type are inherent in LALR parsers (when compared to 
+      canonical LR parsers), and the resulting parsers will still never 
+      read past the first token at which the error could be detected.
+      The parser can, however, make extra erroneous reduces before detecting
+      the error, so this can degrade the parser's ability to do 
+      <a href="#errors">error recovery</a>.
+      (Refer to reference [2] pp. 244-247 or reference [3] pp. 190-194 for a 
+      complete explanation of this compaction technique.) <br><br>
+
+      <i>Special note</i>: at the time of this writing the standard 
+      javac compiler had a bug which caused it to produce corrupted 
+      class files when very large statically initialized arrays (i.e., large 
+      parse tables) are used.  Consequently, if you have a large grammar, you 
+      may be <i>forced</i> to use this option in order to create tables
+      that are small enough to compile correctly.
+
+  <dt><tt>-nowarn</tt>        
+  <dd>This options causes all warning messages (as opposed to error messages)
+      produced by the system to be suppressed.
+
+  <dt><tt>-nosummary</tt>     
+  <dd>Normally, the system prints a summary listing such things as the 
+      number of terminals, non terminals, parse states, etc. at the end of
+      its run.  This option suppresses that summary.
+
+  <dt><tt>-progress</tt>      
+  <dd>This option causes the system to print short messages indicating its
+      progress through various parts of the parser generation process.
+
+  <dt><tt>-dump_grammar</tt>  
+  <dt><tt>-dump_states</tt>   
+  <dt><tt>-dump_tables</tt>   
+  <dt><tt>-dump</tt>          
+  <dd> These options cause the system to produce a human readable dump of
+       the grammar, the constructed parse states (often needed to resolve
+       parse conflicts), and the parse tables (rarely needed), respectively.
+       The <tt>-dump</tt> option can be used to produce all of these dumps.
+
+  <dt><tt>-time</tt>          
+  <dd>This option adds detailed timing statistics to the normal summary of
+      results.  This is normally of great interest only to maintainers of 
+      the system itself.
+
+  <dt><tt>-debug</tt>          
+  <dd>This option produces voluminous internal debugging information about
+      the system as it runs.  This is normally of interest only to maintainers 
+      of the system itself.
+
+</dl>
+
+<a name="parser">
+<h3>4. Customizing the Parser</h3></a>
+
+Each generated parser consists of three generated classes.  The 
+<tt>sym</tt> class (which can be renamed using the <tt>-symbols</tt>
+option) simply contains a series of <tt>int</tt> constants,
+one for each terminal.  Non terminals are also include if the <tt>-nonterms</tt>
+option is given.  The source file for the <tt>parser</tt> class (which can
+be renamed using the <tt>-parser</tt> option) actually contains two 
+class definitions, the public <tt>parser</tt> class that implements the 
+actual parser, and another non-public class (called <tt>CUP$action</tt>) which 
+encapsulates all user actions contained in the grammar, as well as code from 
+the <tt>action code</tt> declaration.  In addition to user supplied code, this
+class contains one method: <tt>CUP$do_action</tt> which consists of a large 
+switch statement for selecting and executing various fragments of user 
+supplied action code.  In general, all names beginning with the prefix of 
+<tt>CUP$</tt> are reserved for internal uses by Java CUP generated code. <p> 
+
+The <tt>parser</tt> class contains the actual generated parser.  It is 
+a subclass of <tt>java_cup.runtime.lr_parser</tt> which implements a 
+general table driven framework for an LR parser.  The generated <tt>parser</tt>
+class provides a series of tables for use by the general framework.  
+Three tables are provided:
+<dl compact>
+<dt>the production table 
+<dd>provides the symbol number of the left hand side non terminal, along with
+    the length of the right hand side, for each production in the grammar,
+<dt>the action table
+<dd>indicates what action (shift, reduce, or error) is to be taken on each 
+    lookahead symbol when encountered in each state, and
+<dt>the reduce-goto table
+<dd>indicates which state to shift to after reduces (under each non-terminal
+from each state). 
+</dl>
+(Note that the action and reduce-goto tables are not stored as simple arrays,
+but use a compacted "list" structure to save a significant amount of space.
+See comments the runtime system source code for details.)<p>
+
+Beyond the parse tables, generated (or inherited) code provides a series 
+of methods that can be used to customize the generated parser.  Some of these
+methods are supplied by code found in part of the specification and can 
+be customized directly in that fashion.  The others are provided by the
+<tt>lr_parser</tt> base class and can be overridden with new versions (via
+the <tt>parser code</tt> declaration) to customize the system.  Methods
+available for customization include:
+<dl compact>
+<dt><tt>public void user_init()</tt>
+<dd>This method is called by the parser prior to asking for the first token 
+    from the scanner.  The body of this method contains the code from the 
+    <tt>init with</tt> clause of the the specification.  
+<dt><tt>public java_cup.runtime.token scan()</tt>
+<dd>This method encapsulates the scanner and is called each time a new token is
+    needed by the parser.  The body of this method is supplied by the
+    <tt>scan with</tt> clause of the specification.
+<dt><tt> public void report_error(String message, Object info)</tt>
+<dd>This method should be called whenever an error message is to be issued.  In
+    the default implementation of this method, the first parameter provides 
+    the text of a message which is printed on <tt>System.err</tt> 
+    and the second parameter is simply ignored.  It is very typical to
+    override this method in order to provide a more sophisticated error
+    reporting mechanism.
+<dt><tt>public void report_fatal_error(String message, Object info)</tt>
+<dd>This method should be called whenever a non-recoverable error occurs.  It 
+    responds by calling <tt>report_error()</tt>, then aborts parsing
+    by calling the parser method <tt>done_parsing()</tt>, and finally
+    throws an exception.  (In general <tt>done_parsing()</tt> should be called 
+    at any point that parsing needs to be terminated early).
+<dt><tt>public void syntax_error(token cur_token)</tt>
+<dd>This method is called by the parser as soon as a syntax error is detected
+    (but before error recovery is attempted).  In the default implementation it
+    calls: <tt>report_error("Syntax error", null);</tt>.
+<dt><tt>public void unrecovered_syntax_error(token cur_token)</tt>
+<dd>This method is called by the parser if it is unable to recover from a 
+    syntax error.  In the default implementation it calls:
+    <tt>report_fatal_error("Couldn't repair and continue parse", null);</tt>.
+<dt><tt> protected int error_sync_size()</tt>
+<dd>This method is called by the parser to determine how many tokens it must
+    successfully parse in order to consider an error recovery successful.
+    The default implementation returns 3.  Values below 2 are not recommended.
+    See the section on <a href="#errors">error recovery</a> for details.
+</dl>
+
+Parsing itself is performed by the method <tt>public void parse()</tt>.  
+This method starts by getting references to each of the parse tables, 
+then initializes a <tt>CUP$action</tt> object (by calling 
+<tt>protected void init_actions()</tt>). Next it calls <tt>user_init()</tt>,
+then fetches the first lookahead token with a call to <tt>scan()</tt>.
+Finally, it begins parsing.  Parsing continues until <tt>done_parsing()</tt>
+is called (this is done automatically, for example, when the parser accepts).<p>
+
+In addition to the normal parser, the runtime system also provides a debugging
+version of the parser.  This operates in exactly the same way as the normal
+parser, but prints debugging messages (by calling 
+<tt>public void debug_message(String mess)</tt> whose default implementation
+prints a message to <tt>System.err</tt>).<p>
+
+Based on these routines, invocation of a Java CUP parser is typically done
+with code such as:
+<pre>
+      /* create a parsing object */
+      parser parse_obj = new parser();
+
+      /* open input files, etc. here */
+
+      try {
+        if (do_debug_parse)
+          parser_obj.debug_parse();
+        else
+          parser_obj.parse();
+      } catch (Exception e) {
+        /* do cleanup here -- possibly rethrow e */
+      } finally {
+	/* do close out here */
+      }
+</pre>
+
+<a name="errors">
+<h3>5. Error Recovery</h3></a>
+
+A final important aspect of building parsers with Java CUP is 
+support for syntactic error recovery.  Java CUP uses the same 
+error recovery mechanisms as YACC.  In particular, it supports
+a special error symbol (denoted simply as <tt>error</tt>).
+This symbol plays the role of a special non terminal which, instead of
+being defined by productions, instead matches an erroneous input 
+sequence.<p>
+
+The error symbol only comes into play if a syntax error is
+detected.  If a syntax error is detected then the parser tries to replace
+some portion of the input token stream with <tt>error</tt> and then
+continue parsing.  For example, we might have productions such as:
+
+<pre><tt>    stmt ::= expr SEMI | while_stmt SEMI | if_stmt SEMI | ... |
+	     error SEMI
+	     ;</tt></pre>
+
+This indicates that if none of the normal productions for <tt>stmt</tt> can
+be matched by the input, then a syntax error should be declared, and recovery
+should be made by skipping erroneous tokens (equivalent to matching and 
+replacing them with <tt>error</tt>) up to a point at which the parse can 
+be continued with a semicolon (and additional context that legally follows a 
+statement).  An error is considered to be recovered from if and only if a 
+sufficient number of tokens past the <tt>error</tt> symbol can be successfully 
+parsed.  (The number of tokens required is determined by the 
+<tt>error_sync_size()</tt> method of the parser and defaults to 3). <p>
+
+Specifically, the parser first looks for the closest state to the top
+of the parse stack that has an outgoing transition under
+<tt>error</tt>.  This generally corresponds to working from
+productions that represent more detailed constructs (such as a specific
+kind of statement) up to productions that represent more general or
+enclosing constructs (such as the general production for all
+statements or a production representing a whole section of declarations) 
+until we get to a place where an error recovery production
+has been provided for.  Once the parser is placed into a configuration
+that has an immediate error recovery (by popping the stack to the first
+such state), the parser begins skipping tokens to find a point at
+which the parse can be continued.  After discarding each token, the
+parser attempts to parse ahead in the input (without executing any
+embedded semantic actions).  If the parser can successfully parse past
+the required number of tokens, then the input is backed up to the point
+of recovery and the parse is resumed normally (executing all actions).
+If the parse cannot be continued far enough, then another token is
+discarded and the parser again tries to parse ahead.  If the end of
+input is reached without making a successful recovery (or there was no
+suitable error recovery state found on the parse stack to begin with)
+then error recovery fails.
+
+<a name="conclusion">
+<h3>6. Conclusion</h3></a>
+
+This manual has briefly described the Java CUP LALR parser generation system.
+Java CUP is designed to fill the same role as the well known YACC parser
+generator system, but is written in and operates entirely with Java code 
+rather than C or C++.  Additional details on the operation of the system can 
+be found in the parser generator and runtime source code.  See the Java CUP
+home page below for access to the API documentation for the system and its
+runtime.<p>
+
+This document covers the system as it stands at the time of its fourth alpha 
+release (v0.9d).  Check the Java CUP home page: 
+<a href="http://www.cc.gatech.edu/gvu/people/Faculty/hudson/java_cup/home.html">
+http://www.cc.gatech.edu/gvu/people/Faculty/hudson/java_cup/home.html</a>
+for the latest release information, instructions for downloading the
+system, and additional news about the system.  Bug reports and other 
+comments for the developers can be sent to 
+<a href="mailto:java-cup@cc.gatech.edu"> java-cup@cc.gatech.edu</a><p>
+
+Java CUP was originally written by 
+<a href="http://www.cc.gatech.edu/gvu/people/Faculty/Scott.E.Hudson.html">
+Scott Hudson</a>, in August of 1995.<p>
+
+<a name="refs">
+<h3>References</h3></a>
+<dl compact>
+
+<dt><a name = "YACCref">[1]</a> 
+<dd>S. C. Johnson, 
+"YACC -- Yet Another Compiler Compiler",
+CS Technical Report #32, 
+Bell Telephone Laboratories,  
+Murray Hill, NJ, 
+1975.
+
+<dt><a name = "dragonbook">[2]</a> 
+<dd>A. Aho, R. Sethi, and J. Ullman, 
+<i>Compilers: Principles, Techniques, and Tools</i>, 
+Addison-Wesley Publishing,
+Reading, MA, 
+1986.
+
+<dt><a name = "crafting">[3]</a> 
+<dd>C. Fischer, and R. LeBlanc,
+<i>Crafting a Compiler with C</i>,
+Benjamin/Cummings Publishing,
+Redwood City, CA,
+1991.
+
+</dl>
+
+<h3><a name="appendixa">
+Appendix A. Grammar for Java CUP Specification Files</a></h3>
+<hr><br>
+<pre><tt>java_cup_spec      ::= package_spec import_list code_part init_code 
+		       scan_code symbol_list start_spec production_list
+package_spec       ::= PACKAGE multipart_id SEMI | empty
+import_list        ::= import_list import_spec | empty
+import_spec        ::= IMPORT import_id SEMI
+code_part          ::= action_code_part parser_code_part 
+action_code_part   ::= ACTION CODE CODE_STRING SEMI | empty
+parser_code_part   ::= PARSER CODE CODE_STRING SEMI | empty
+init_code          ::= INIT WITH CODE_STRING SEMI | empty
+scan_code          ::= SCAN WITH CODE_STRING SEMI | empty
+symbol_list        ::= symbol_list symbol | symbol
+symbol             ::= TERMINAL type_id term_name_list SEMI | 
+                       NON TERMINAL type_id non_term_name_list SEMI
+term_name_list     ::= term_name_list COMMA new_term_id | new_term_id
+non_term_name_list ::= non_term_name_list COMMA new_non_term_id |
+	               new_non_term_id
+start_spec         ::= START WITH nt_id SEMI | empty
+production_list    ::= production_list production | production
+production         ::= nt_id COLON_COLON_EQUALS rhs_list SEMI
+rhs_list           ::= rhs_list BAR rhs | rhs
+rhs                ::= prod_part_list
+prod_part_list     ::= prod_part_list prod_part | empty
+prod_part          ::= symbol_id opt_label | CODE_STRING
+opt_label          ::= COLON label_id | empty
+multipart_id       ::= multipart_id DOT ID | ID
+import_id          ::= multipart_id DOT STAR | multipart_id
+type_id            ::= multipart_id
+new_term_id        ::= ID
+new_non_term_id    ::= ID
+nt_id              ::= ID
+symbol_id          ::= ID
+label_id           ::= ID
+</tt></pre>
+<hr><p><p>
+
+<h3><a name = "appendixb">Appendix B. A Very Simple Example Scanner<a></h3>
+<hr><br>
+<pre>
+<tt>// Simple Example Scanner Class
+
+import java_cup.runtime.*;
+
+public class scanner {
+  /* single lookahead character */
+  protected static int next_char;
+
+  /* advance input by one character */
+  protected static void advance()  { next_char = System.in.read(); }
+
+  /* initialize the scanner */
+  public static void init() { advance(); }
+
+  /* recognize and return the next complete token */
+  public static token next_token()
+    {
+      for (;;)
+        switch (next_char)
+	  {
+	    case '0': case '1': case '2': case '3': case '4': 
+	    case '5': case '6': case '7': case '8': case '9': 
+	      /* parse a decimal integer */
+	      int i_val = 0;
+	      do {
+	        i_val = i_val * 10 + (next_char - '0');
+	        advance();
+	      } while (next_char >= '0' && next_char <= '9');
+	    return new int_token(sym.NUMBER, i_val);
+
+	    case ';': advance(); return new token(sym.SEMI);
+	    case '+': advance(); return new token(sym.PLUS);
+	    case '-': advance(); return new token(sym.MINUS);
+	    case '*': advance(); return new token(sym.TIMES);
+	    case '/': advance(); return new token(sym.DIVIDE);
+	    case '%': advance(); return new token(sym.MOD);
+	    case '(': advance(); return new token(sym.LPAREN);
+	    case ')': advance(); return new token(sym.RPAREN);
+
+	    case -1: return new token(sym.EOF);
+
+	    default: 
+	      /* in this simple scanner we just ignore everything else */
+	      advance();
+	    break;
+	  }
+    }
+};
+</tt></pre>
+
+<hr>
+<a name="trademark">
+Java and HotJava are
+trademarks of <a href="http://www.sun.com/">Sun Microsystems, Inc.</a>,
+and refer to Sun's Java programming language and HotJava browser
+technologies.
+Java CUP is not sponsored by or affiliated with Sun Microsystems, Inc.
+</a>
+ 
+<hr><p><p>
+
+
+</body></html>
diff --git a/jasmin/jasmin-2.4/lib/java_cup/simple_calc/Main.java b/jasmin/jasmin-2.4/lib/java_cup/simple_calc/Main.java
new file mode 100644
index 0000000..2a77631
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/java_cup/simple_calc/Main.java
@@ -0,0 +1,27 @@
+
+public class Main {
+  public static void main(String argv[])
+    {
+      try {
+        /* allocate a parser object */
+        parser parse_obj = new parser();
+
+        /* prompt the user */
+        System.out.println("Reading expressions from standard input...");
+
+        /* deterimine if we doing debug or normal parse, and do it */
+        if (argv.length >= 1 && argv[0].equals("-debug"))
+	  {
+	      parse_obj.debug_parse();
+	  }
+        else
+	  {
+	    parse_obj.parse();
+	  }
+      } catch (java.lang.Exception ex) {
+	 System.err.println("Exception: " + ex.getMessage());
+         ex.printStackTrace();
+	 System.exit(-1);
+      }
+    }
+};
diff --git a/jasmin/jasmin-2.4/lib/java_cup/simple_calc/parser.cup b/jasmin/jasmin-2.4/lib/java_cup/simple_calc/parser.cup
new file mode 100644
index 0000000..8b4ebbd
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/java_cup/simple_calc/parser.cup
@@ -0,0 +1,58 @@
+// JavaCup specification for a simple expression evaluator (w/ actions)
+
+import java_cup.runtime.*;
+
+/* Preliminaries to set up and use the scanner.  */
+init with {: scanner.init();              :};
+scan with {: return scanner.next_token(); :};
+
+/* Terminals (tokens returned by the scanner). */
+terminal token     SEMI, PLUS, MINUS, TIMES, DIVIDE, MOD,  LPAREN, RPAREN;
+terminal int_token NUMBER;
+
+/* Non terminals */
+non terminal symbol     expr_list, expr_part;
+non terminal int_token  expr, term, factor;
+
+/* The grammar */
+expr_list ::= expr_list expr_part 
+	      | 
+              expr_part;
+
+expr_part ::= expr:e 
+	      {: System.out.println("= " + e.int_val); :} 
+              SEMI              
+	      ;
+
+expr      ::= expr:e1 PLUS term:e2    
+	      {: RESULT.int_val = e1.int_val + e2.int_val; :} 
+	      | 
+              expr:e1 MINUS term:e2    
+              {: RESULT.int_val = e1.int_val - e2.int_val; :} 
+	      | 
+              term:e1                  
+	      {: RESULT.int_val = e1.int_val; :} 
+	      ;
+
+term      ::= term:e1 TIMES factor:e2 
+	      {: RESULT.int_val = e1.int_val * e2.int_val; :} 
+	      | 
+              term:e1 DIVIDE factor:e2 
+	      {: RESULT.int_val = e1.int_val / e2.int_val; :} 
+	      | 
+              term:e1 MOD factor:e2 
+	      {: RESULT.int_val = e1.int_val % e2.int_val; :} 
+	      | 
+              factor:e                 
+	      {: RESULT.int_val = e.int_val; :} 
+	      ;
+
+factor    ::= NUMBER:n                 
+	      {: RESULT.int_val = n.int_val;  :} 
+	      | 
+              MINUS factor:e             
+	      {: RESULT.int_val = -e.int_val; :} 
+	      | 
+              LPAREN expr:e RPAREN     
+	      {: RESULT.int_val = e.int_val;  :} 
+	      ;
diff --git a/jasmin/jasmin-2.4/lib/java_cup/simple_calc/parser.java b/jasmin/jasmin-2.4/lib/java_cup/simple_calc/parser.java
new file mode 100644
index 0000000..f9778bf
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/java_cup/simple_calc/parser.java
@@ -0,0 +1,287 @@
+
+//----------------------------------------------------
+// The following code was generated by Java(tm) CUP v0.9d
+// Sun Jan 07 17:10:11 EST 1996
+//----------------------------------------------------
+
+import java_cup.runtime.*;
+
+public class parser extends java_cup.runtime.lr_parser {
+
+  /** constructor */
+  public parser() {super();}
+
+  /** production table */
+  protected static final short _production_table[][] = {
+        {1, 2},     {0, 2},     {1, 1},     {6, 0},     {2, 3}, 
+        {3, 3},     {3, 3},     {3, 1},     {4, 3},     {4, 3}, 
+        {4, 3},     {4, 1},     {5, 1},     {5, 2},     {5, 3}
+      };
+
+  /** access to production table */
+  public short[][] production_table() {return _production_table;}
+
+  /** parse action table */
+  protected static final short[][] _action_table = {
+    /*0*/{4,2,8,9,10,4,-1,0},
+    /*1*/{4,2,8,9,10,4,-1,0},
+    /*2*/{2,-12,3,-12,4,-12,5,-12,6,-12,7,-12,9,-12,-1,0},
+    /*3*/{2,-13,3,-13,4,-13,5,-13,6,-13,7,-13,9,-13,-1,0},
+    /*4*/{0,-3,4,-3,8,-3,10,-3,-1,0},
+    /*5*/{2,-4,3,13,4,11,-1,0},
+    /*6*/{0,23,4,2,8,9,10,4,-1,0},
+    /*7*/{2,-8,3,-8,4,-8,5,16,6,17,7,15,9,-8,-1,0},
+    /*8*/{4,2,8,9,10,4,-1,0},
+    /*9*/{3,13,4,11,9,12,-1,0},
+    /*10*/{4,2,8,9,10,4,-1,0},
+    /*11*/{2,-15,3,-15,4,-15,5,-15,6,-15,7,-15,9,-15,-1,0},
+    /*12*/{4,2,8,9,10,4,-1,0},
+    /*13*/{2,-6,3,-6,4,-6,5,16,6,17,7,15,9,-6,-1,0},
+    /*14*/{4,2,8,9,10,4,-1,0},
+    /*15*/{4,2,8,9,10,4,-1,0},
+    /*16*/{4,2,8,9,10,4,-1,0},
+    /*17*/{2,-10,3,-10,4,-10,5,-10,6,-10,7,-10,9,-10,-1,0},
+    /*18*/{2,-9,3,-9,4,-9,5,-9,6,-9,7,-9,9,-9,-1,0},
+    /*19*/{2,-11,3,-11,4,-11,5,-11,6,-11,7,-11,9,-11,-1,0},
+    /*20*/{2,-7,3,-7,4,-7,5,16,6,17,7,15,9,-7,-1,0},
+    /*21*/{0,-1,4,-1,8,-1,10,-1,-1,0},
+    /*22*/{0,-2,-1,0},
+    /*23*/{2,25,-1,0},
+    /*24*/{0,-5,4,-5,8,-5,10,-5,-1,0},
+    /*25*/{2,-14,3,-14,4,-14,5,-14,6,-14,7,-14,9,-14,-1,0},
+  };
+
+  /** access to parse action table */
+  public short[][] action_table() {return _action_table;}
+
+  /** reduce_goto table */
+  protected static final short[][] _reduce_table = {
+    /*0*/{1,6,2,4,3,5,4,7,5,2,-1,-1},
+    /*1*/{5,25,-1,-1},
+    /*2*/{-1,-1},
+    /*3*/{-1,-1},
+    /*4*/{-1,-1},
+    /*5*/{6,23,-1,-1},
+    /*6*/{2,21,3,5,4,7,5,2,-1,-1},
+    /*7*/{-1,-1},
+    /*8*/{3,9,4,7,5,2,-1,-1},
+    /*9*/{-1,-1},
+    /*10*/{4,20,5,2,-1,-1},
+    /*11*/{-1,-1},
+    /*12*/{4,13,5,2,-1,-1},
+    /*13*/{-1,-1},
+    /*14*/{5,19,-1,-1},
+    /*15*/{5,18,-1,-1},
+    /*16*/{5,17,-1,-1},
+    /*17*/{-1,-1},
+    /*18*/{-1,-1},
+    /*19*/{-1,-1},
+    /*20*/{-1,-1},
+    /*21*/{-1,-1},
+    /*22*/{-1,-1},
+    /*23*/{-1,-1},
+    /*24*/{-1,-1},
+    /*25*/{-1,-1},
+  };
+
+  /** access to reduce_goto table */
+  public short[][] reduce_table() {return _reduce_table;}
+
+  /** instance of action encapsulation class */
+  protected CUP$actions action_obj;
+
+  /** action encapsulation object initializer */
+  protected void init_actions()
+    {
+      action_obj = new CUP$actions();
+    }
+
+  /** invoke a user supplied parse action */
+  public java_cup.runtime.symbol do_action(
+    int                        act_num,
+    java_cup.runtime.lr_parser parser,
+    java.util.Stack            stack,
+    int                        top)
+    throws java.lang.Exception
+  {
+    /* call code in generated class */
+    return action_obj.CUP$do_action(act_num, parser, stack, top);
+  }
+
+  /** start state */
+  public int start_state() {return 0;}
+  /** start production */
+  public int start_production() {return 1;}
+
+  /** EOF symbol index */
+  public int EOF_sym() {return 0;}
+
+  /** error symbol index */
+  public int error_sym() {return 1;}
+
+
+  /** user initialization */
+  public void user_init() throws java.lang.Exception
+    {
+ scanner.init();              
+    }
+
+  /** scan to get the next token */
+  public java_cup.runtime.token scan()
+    throws java.lang.Exception
+    {
+ return scanner.next_token(); 
+    }
+};
+
+/** JavaCup generated class to encapsulate user supplied action code.*/
+class CUP$actions {
+
+  /** Constructor */
+  CUP$actions() { }
+
+  /** Method with the actual generated action code. */
+  public final java_cup.runtime.symbol CUP$do_action(
+    int                        CUP$act_num,
+    java_cup.runtime.lr_parser CUP$parser,
+    java.util.Stack            CUP$stack,
+    int                        CUP$top)
+    throws java.lang.Exception
+    {
+      /* object for return from actions */
+      java_cup.runtime.symbol CUP$result;
+
+      /* select the action based on the action number */
+      switch (CUP$act_num)
+        {
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 14: // factor ::= LPAREN expr RPAREN 
+            {
+              CUP$result = new int_token(/*factor*/5);
+               ((int_token)CUP$result).int_val = (/*e*/(int_token)CUP$stack.elementAt(CUP$top-1)).int_val;  
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 13: // factor ::= MINUS factor 
+            {
+              CUP$result = new int_token(/*factor*/5);
+               ((int_token)CUP$result).int_val = -(/*e*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 12: // factor ::= NUMBER 
+            {
+              CUP$result = new int_token(/*factor*/5);
+               ((int_token)CUP$result).int_val = (/*n*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val;  
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 11: // term ::= factor 
+            {
+              CUP$result = new int_token(/*term*/4);
+               ((int_token)CUP$result).int_val = (/*e*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 10: // term ::= term MOD factor 
+            {
+              CUP$result = new int_token(/*term*/4);
+               ((int_token)CUP$result).int_val = (/*e1*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val % (/*e2*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 9: // term ::= term DIVIDE factor 
+            {
+              CUP$result = new int_token(/*term*/4);
+               ((int_token)CUP$result).int_val = (/*e1*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val / (/*e2*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 8: // term ::= term TIMES factor 
+            {
+              CUP$result = new int_token(/*term*/4);
+               ((int_token)CUP$result).int_val = (/*e1*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val * (/*e2*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 7: // expr ::= term 
+            {
+              CUP$result = new int_token(/*expr*/3);
+               ((int_token)CUP$result).int_val = (/*e1*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 6: // expr ::= expr MINUS term 
+            {
+              CUP$result = new int_token(/*expr*/3);
+               ((int_token)CUP$result).int_val = (/*e1*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val - (/*e2*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 5: // expr ::= expr PLUS term 
+            {
+              CUP$result = new int_token(/*expr*/3);
+               ((int_token)CUP$result).int_val = (/*e1*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val + (/*e2*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 4: // expr_part ::= expr NT$0 SEMI 
+            {
+              CUP$result = new symbol(/*expr_part*/2);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 3: // NT$0 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$0*/6);
+               System.out.println("= " + (/*e*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 2: // expr_list ::= expr_part 
+            {
+              CUP$result = new symbol(/*expr_list*/1);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 1: // $START ::= expr_list EOF 
+            {
+              CUP$result = new java_cup.runtime.token(/*$START*/0);
+              
+            }
+          /* ACCEPT */
+          CUP$parser.done_parsing();
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 0: // expr_list ::= expr_list expr_part 
+            {
+              CUP$result = new symbol(/*expr_list*/1);
+              
+            }
+          return CUP$result;
+
+          /* . . . . . .*/
+          default:
+            throw new Exception(
+               "Invalid action number found in internal parse table");
+
+        }
+    }
+};
+
diff --git a/jasmin/jasmin-2.4/lib/java_cup/simple_calc/scanner.java b/jasmin/jasmin-2.4/lib/java_cup/simple_calc/scanner.java
new file mode 100644
index 0000000..c56d615
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/java_cup/simple_calc/scanner.java
@@ -0,0 +1,51 @@
+// Simple Example Scanner Class
+
+import java_cup.runtime.*;
+
+public class scanner {
+  /* single lookahead character */
+  protected static int next_char;
+
+  /* advance input by one character */
+  protected static void advance() throws java.io.IOException 
+    { 
+      next_char = System.in.read(); 
+    }
+
+  /* initialize the scanner */
+  public static void init() throws java.io.IOException { advance(); }
+
+  /* recognize and return the next complete token */
+  public static token next_token() throws java.io.IOException
+    {
+      for (;;)
+        switch (next_char)
+	  {
+	    case '0': case '1': case '2': case '3': case '4': 
+	    case '5': case '6': case '7': case '8': case '9': 
+	      /* parse a decimal integer */
+	      int i_val = 0;
+	      do {
+	        i_val = i_val * 10 + (next_char - '0');
+	        advance();
+	      } while (next_char >= '0' && next_char <= '9');
+	    return new int_token(sym.NUMBER, i_val);
+
+	    case ';': advance(); return new token(sym.SEMI);
+	    case '+': advance(); return new token(sym.PLUS);
+	    case '-': advance(); return new token(sym.MINUS);
+	    case '*': advance(); return new token(sym.TIMES);
+	    case '/': advance(); return new token(sym.DIVIDE);
+	    case '%': advance(); return new token(sym.MOD);
+	    case '(': advance(); return new token(sym.LPAREN);
+	    case ')': advance(); return new token(sym.RPAREN);
+
+	    case -1: return new token(sym.EOF);
+
+	    default: 
+	      /* in this simple scanner we just ignore everything else */
+	      advance();
+	    break;
+	  }
+    }
+};
diff --git a/jasmin/jasmin-2.4/lib/java_cup/simple_calc/sym.java b/jasmin/jasmin-2.4/lib/java_cup/simple_calc/sym.java
new file mode 100644
index 0000000..9e57980
--- /dev/null
+++ b/jasmin/jasmin-2.4/lib/java_cup/simple_calc/sym.java
@@ -0,0 +1,22 @@
+
+//----------------------------------------------------
+// The following code was generated by Java(tm) CUP v0.9d
+// Sun Jan 07 17:10:10 EST 1996
+//----------------------------------------------------
+
+/** JavaCup generated class containing symbol constants. */
+public class sym {
+  /* terminals */
+  static final int SEMI = 2;
+  static final int EOF = 0;
+  static final int DIVIDE = 6;
+  static final int NUMBER = 10;
+  static final int error = 1;
+  static final int MINUS = 4;
+  static final int TIMES = 5;
+  static final int LPAREN = 8;
+  static final int RPAREN = 9;
+  static final int MOD = 7;
+  static final int PLUS = 3;
+};
+
diff --git a/jasmin/jasmin-2.4/license-ant.txt b/jasmin/jasmin-2.4/license-ant.txt
new file mode 100644
index 0000000..85c3b51
--- /dev/null
+++ b/jasmin/jasmin-2.4/license-ant.txt
@@ -0,0 +1,212 @@
+This is the license for Ant, the open source build system that Jasmin uses.
+This license applies only to ./lib/ant.jar
+You can learn more about Ant and download the files from http://jakarta.apache.org/ant/
+
+- Jon Meyer
+
+-------------------------------------------------------------------------------
+
+/*
+ *                                 Apache License
+ *                           Version 2.0, January 2004
+ *                        http://www.apache.org/licenses/
+ *
+ *   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+ *
+ *   1. Definitions.
+ *
+ *      "License" shall mean the terms and conditions for use, reproduction,
+ *      and distribution as defined by Sections 1 through 9 of this document.
+ *
+ *      "Licensor" shall mean the copyright owner or entity authorized by
+ *      the copyright owner that is granting the License.
+ *
+ *      "Legal Entity" shall mean the union of the acting entity and all
+ *      other entities that control, are controlled by, or are under common
+ *      control with that entity. For the purposes of this definition,
+ *      "control" means (i) the power, direct or indirect, to cause the
+ *      direction or management of such entity, whether by contract or
+ *      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+ *      outstanding shares, or (iii) beneficial ownership of such entity.
+ *
+ *      "You" (or "Your") shall mean an individual or Legal Entity
+ *      exercising permissions granted by this License.
+ *
+ *      "Source" form shall mean the preferred form for making modifications,
+ *      including but not limited to software source code, documentation
+ *      source, and configuration files.
+ *
+ *      "Object" form shall mean any form resulting from mechanical
+ *      transformation or translation of a Source form, including but
+ *      not limited to compiled object code, generated documentation,
+ *      and conversions to other media types.
+ *
+ *      "Work" shall mean the work of authorship, whether in Source or
+ *      Object form, made available under the License, as indicated by a
+ *      copyright notice that is included in or attached to the work
+ *      (an example is provided in the Appendix below).
+ *
+ *      "Derivative Works" shall mean any work, whether in Source or Object
+ *      form, that is based on (or derived from) the Work and for which the
+ *      editorial revisions, annotations, elaborations, or other modifications
+ *      represent, as a whole, an original work of authorship. For the purposes
+ *      of this License, Derivative Works shall not include works that remain
+ *      separable from, or merely link (or bind by name) to the interfaces of,
+ *      the Work and Derivative Works thereof.
+ *
+ *      "Contribution" shall mean any work of authorship, including
+ *      the original version of the Work and any modifications or additions
+ *      to that Work or Derivative Works thereof, that is intentionally
+ *      submitted to Licensor for inclusion in the Work by the copyright owner
+ *      or by an individual or Legal Entity authorized to submit on behalf of
+ *      the copyright owner. For the purposes of this definition, "submitted"
+ *      means any form of electronic, verbal, or written communication sent
+ *      to the Licensor or its representatives, including but not limited to
+ *      communication on electronic mailing lists, source code control systems,
+ *      and issue tracking systems that are managed by, or on behalf of, the
+ *      Licensor for the purpose of discussing and improving the Work, but
+ *      excluding communication that is conspicuously marked or otherwise
+ *      designated in writing by the copyright owner as "Not a Contribution."
+ *
+ *      "Contributor" shall mean Licensor and any individual or Legal Entity
+ *      on behalf of whom a Contribution has been received by Licensor and
+ *      subsequently incorporated within the Work.
+ *
+ *   2. Grant of Copyright License. Subject to the terms and conditions of
+ *      this License, each Contributor hereby grants to You a perpetual,
+ *      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+ *      copyright license to reproduce, prepare Derivative Works of,
+ *      publicly display, publicly perform, sublicense, and distribute the
+ *      Work and such Derivative Works in Source or Object form.
+ *
+ *   3. Grant of Patent License. Subject to the terms and conditions of
+ *      this License, each Contributor hereby grants to You a perpetual,
+ *      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+ *      (except as stated in this section) patent license to make, have made,
+ *      use, offer to sell, sell, import, and otherwise transfer the Work,
+ *      where such license applies only to those patent claims licensable
+ *      by such Contributor that are necessarily infringed by their
+ *      Contribution(s) alone or by combination of their Contribution(s)
+ *      with the Work to which such Contribution(s) was submitted. If You
+ *      institute patent litigation against any entity (including a
+ *      cross-claim or counterclaim in a lawsuit) alleging that the Work
+ *      or a Contribution incorporated within the Work constitutes direct
+ *      or contributory patent infringement, then any patent licenses
+ *      granted to You under this License for that Work shall terminate
+ *      as of the date such litigation is filed.
+ *
+ *   4. Redistribution. You may reproduce and distribute copies of the
+ *      Work or Derivative Works thereof in any medium, with or without
+ *      modifications, and in Source or Object form, provided that You
+ *      meet the following conditions:
+ *
+ *      (a) You must give any other recipients of the Work or
+ *          Derivative Works a copy of this License; and
+ *
+ *      (b) You must cause any modified files to carry prominent notices
+ *          stating that You changed the files; and
+ *
+ *      (c) You must retain, in the Source form of any Derivative Works
+ *          that You distribute, all copyright, patent, trademark, and
+ *          attribution notices from the Source form of the Work,
+ *          excluding those notices that do not pertain to any part of
+ *          the Derivative Works; and
+ *
+ *      (d) If the Work includes a "NOTICE" text file as part of its
+ *          distribution, then any Derivative Works that You distribute must
+ *          include a readable copy of the attribution notices contained
+ *          within such NOTICE file, excluding those notices that do not
+ *          pertain to any part of the Derivative Works, in at least one
+ *          of the following places: within a NOTICE text file distributed
+ *          as part of the Derivative Works; within the Source form or
+ *          documentation, if provided along with the Derivative Works; or,
+ *          within a display generated by the Derivative Works, if and
+ *          wherever such third-party notices normally appear. The contents
+ *          of the NOTICE file are for informational purposes only and
+ *          do not modify the License. You may add Your own attribution
+ *          notices within Derivative Works that You distribute, alongside
+ *          or as an addendum to the NOTICE text from the Work, provided
+ *          that such additional attribution notices cannot be construed
+ *          as modifying the License.
+ *
+ *      You may add Your own copyright statement to Your modifications and
+ *      may provide additional or different license terms and conditions
+ *      for use, reproduction, or distribution of Your modifications, or
+ *      for any such Derivative Works as a whole, provided Your use,
+ *      reproduction, and distribution of the Work otherwise complies with
+ *      the conditions stated in this License.
+ *
+ *   5. Submission of Contributions. Unless You explicitly state otherwise,
+ *      any Contribution intentionally submitted for inclusion in the Work
+ *      by You to the Licensor shall be under the terms and conditions of
+ *      this License, without any additional terms or conditions.
+ *      Notwithstanding the above, nothing herein shall supersede or modify
+ *      the terms of any separate license agreement you may have executed
+ *      with Licensor regarding such Contributions.
+ *
+ *   6. Trademarks. This License does not grant permission to use the trade
+ *      names, trademarks, service marks, or product names of the Licensor,
+ *      except as required for reasonable and customary use in describing the
+ *      origin of the Work and reproducing the content of the NOTICE file.
+ *
+ *   7. Disclaimer of Warranty. Unless required by applicable law or
+ *      agreed to in writing, Licensor provides the Work (and each
+ *      Contributor provides its Contributions) on an "AS IS" BASIS,
+ *      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+ *      implied, including, without limitation, any warranties or conditions
+ *      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+ *      PARTICULAR PURPOSE. You are solely responsible for determining the
+ *      appropriateness of using or redistributing the Work and assume any
+ *      risks associated with Your exercise of permissions under this License.
+ *
+ *   8. Limitation of Liability. In no event and under no legal theory,
+ *      whether in tort (including negligence), contract, or otherwise,
+ *      unless required by applicable law (such as deliberate and grossly
+ *      negligent acts) or agreed to in writing, shall any Contributor be
+ *      liable to You for damages, including any direct, indirect, special,
+ *      incidental, or consequential damages of any character arising as a
+ *      result of this License or out of the use or inability to use the
+ *      Work (including but not limited to damages for loss of goodwill,
+ *      work stoppage, computer failure or malfunction, or any and all
+ *      other commercial damages or losses), even if such Contributor
+ *      has been advised of the possibility of such damages.
+ *
+ *   9. Accepting Warranty or Additional Liability. While redistributing
+ *      the Work or Derivative Works thereof, You may choose to offer,
+ *      and charge a fee for, acceptance of support, warranty, indemnity,
+ *      or other liability obligations and/or rights consistent with this
+ *      License. However, in accepting such obligations, You may act only
+ *      on Your own behalf and on Your sole responsibility, not on behalf
+ *      of any other Contributor, and only if You agree to indemnify,
+ *      defend, and hold each Contributor harmless for any liability
+ *      incurred by, or claims asserted against, such Contributor by reason
+ *      of your accepting any such warranty or additional liability.
+ *
+ *   END OF TERMS AND CONDITIONS
+ *
+ *   APPENDIX: How to apply the Apache License to your work.
+ *
+ *      To apply the Apache License to your work, attach the following
+ *      boilerplate notice, with the fields enclosed by brackets "[]"
+ *      replaced with your own identifying information. (Don't include
+ *      the brackets!)  The text should be enclosed in the appropriate
+ *      comment syntax for the file format. We also recommend that a
+ *      file or class name and description of purpose be included on the
+ *      same "printed page" as the copyright notice for easier
+ *      identification within third-party archives.
+ *
+ *   Copyright [yyyy] [name of copyright owner]
+ *
+ *   Licensed under the Apache License, Version 2.0 (the "License");
+ *   you may not use this file except in compliance with the License.
+ *   You may obtain a copy of the License at
+ *
+ *       http://www.apache.org/licenses/LICENSE-2.0
+ *
+ *   Unless required by applicable law or agreed to in writing, software
+ *   distributed under the License is distributed on an "AS IS" BASIS,
+ *   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ *   See the License for the specific language governing permissions and
+ *   limitations under the License.
+ */
+
diff --git a/jasmin/jasmin-2.4/license-jasmin.txt b/jasmin/jasmin-2.4/license-jasmin.txt
new file mode 100644
index 0000000..348b7cb
--- /dev/null
+++ b/jasmin/jasmin-2.4/license-jasmin.txt
@@ -0,0 +1,30 @@
+/*
+ * Copyright (c) 1996-2004, Jon Meyer
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without modification, are permitted provided
+ * that the following conditions are met:
+ *
+ * Redistributions of source code must retain the above copyright notice, this list of conditions
+ * and the following disclaimer.
+ *
+ * Redistributions in binary form must reproduce the above copyright notice, this list of conditions
+ * and the following disclaimer in the documentation and/or other materials provided with the
+ * distribution.
+ *
+ * Neither the name of the Jon Meyer nor the names of its contributors may be used to
+ * endorse or promote products derived from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED
+ * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
+ * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+ * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+ * TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ * Jasmin was written by Jon Meyer, www.cybergrain.com
+ * The Jasmin website is jasmin.sourceforge.net.
+ */
+ 
\ No newline at end of file
diff --git a/jasmin/jasmin-2.4/makefile b/jasmin/jasmin-2.4/makefile
new file mode 100644
index 0000000..2d49d3f
--- /dev/null
+++ b/jasmin/jasmin-2.4/makefile
@@ -0,0 +1,138 @@
+JDK = E:/JDK/BIN/
+
+SRC = src/Jasmin.java \
+      src/jasmin/ClassFile.java \
+      src/jasmin/InsnInfo.java \
+      src/jasmin/Main.java \
+      src/jasmin/num_token.java \
+      src/jasmin/parser.java \
+      src/jasmin/relative_num_token.java \
+      src/jasmin/ReservedWords.java \
+      src/jasmin/Scanner.java \
+      src/jasmin/ScannerUtils.java \
+      src/jasmin/sym.java \
+      src/jasmin/var_token.java \
+      src/jas/Annotation.java \
+      src/jas/AnnotationAttr.java \
+      src/jas/AnnotationElement.java \
+      src/jas/AnnotDefAttr.java \
+      src/jas/AnnotParamAttr.java \
+      src/jas/AsciiCP.java \
+      src/jas/CatchEntry.java \
+      src/jas/Catchtable.java \
+      src/jas/ClassCP.java \
+      src/jas/ClassEnv.java \
+      src/jas/CodeAttr.java \
+      src/jas/ConstAttr.java \
+      src/jas/CP.java \
+      src/jas/DeprecatedAttr.java \
+      src/jas/DoubleCP.java \
+      src/jas/EnclosingMethodAttr.java \
+      src/jas/ExceptAttr.java \
+      src/jas/FieldCP.java \
+      src/jas/FloatCP.java \
+      src/jas/GenericAttr.java \
+      src/jas/IincInsn.java \
+      src/jas/InnerClass.java \
+      src/jas/InnerClassesAttr.java \
+      src/jas/Insn.java \
+      src/jas/InsnOperand.java \
+      src/jas/IntegerCP.java \
+      src/jas/InterfaceCP.java \
+      src/jas/InvokeinterfaceInsn.java \
+      src/jas/jasError.java \
+      src/jas/Label.java \
+      src/jas/LabelOrOffset.java \
+      src/jas/LineTableAttr.java \
+      src/jas/LocalVarEntry.java \
+      src/jas/LocalVarTableAttr.java \
+      src/jas/LocalVarTypeTableAttr.java \
+      src/jas/LongCP.java \
+      src/jas/LookupswitchInsn.java \
+      src/jas/Method.java \
+      src/jas/MethodCP.java \
+      src/jas/MultiarrayInsn.java \
+      src/jas/NameTypeCP.java \
+      src/jas/RuntimeConstants.java \
+      src/jas/SignatureAttr.java \
+      src/jas/SourceAttr.java \
+      src/jas/SourceDebugExtensionAttr.java \
+      src/jas/StackMap.java \
+      src/jas/StringCP.java \
+      src/jas/TableswitchInsn.java \
+      src/jas/Var.java \
+      src/jas/VerificationTypeInfo.java \
+      src/jas/VerifyFrame.java \
+      src/java_cup/runtime/char_token.java \
+      src/java_cup/runtime/double_token.java \
+      src/java_cup/runtime/float_token.java \
+      src/java_cup/runtime/int_token.java \
+      src/java_cup/runtime/long_token.java \
+      src/java_cup/runtime/lr_parser.java \
+      src/java_cup/runtime/str_token.java \
+      src/java_cup/runtime/symbol.java \
+      src/java_cup/runtime/token.java \
+      src/java_cup/runtime/virtual_parse_stack.java \
+      src/jasmin.mf
+
+CUP = src/java_cup/Main.java \
+      src/java_cup/action_part.java \
+      src/java_cup/action_production.java \
+      src/java_cup/emit.java \
+      src/java_cup/internal_error.java \
+      src/java_cup/lalr_item.java \
+      src/java_cup/lalr_item_set.java \
+      src/java_cup/lalr_state.java \
+      src/java_cup/lalr_transition.java \
+      src/java_cup/lexer.java \
+      src/java_cup/lr_item_core.java \
+      src/java_cup/non_terminal.java \
+      src/java_cup/parse_action.java \
+      src/java_cup/parse_action_row.java \
+      src/java_cup/parse_action_table.java \
+      src/java_cup/parse_reduce_row.java \
+      src/java_cup/parse_reduce_table.java \
+      src/java_cup/parser.cup \
+      src/java_cup/parser.java \
+      src/java_cup/production.java \
+      src/java_cup/production_part.java \
+      src/java_cup/reduce_action.java \
+      src/java_cup/shift_action.java \
+      src/java_cup/sym.java \
+      src/java_cup/symbol.java \
+      src/java_cup/symbol_part.java \
+      src/java_cup/symbol_set.java \
+      src/java_cup/terminal.java \
+      src/java_cup/terminal_set.java \
+      src/java_cup/version.java \
+      src/java_cup/runtime/lr_parser.java \
+      src/java_cup/runtime/str_token.java \
+      src/java_cup/runtime/symbol.java \
+      src/java_cup/runtime/token.java \
+      src/java_cup/runtime/virtual_parse_stack.java \
+      src/java_cup.mf
+
+##########################################################################
+
+jasmin.jar : $(SRC)
+    @if not exist out\nul mkdir out
+    @$(JDK)javac -extdirs "" -source 1.2 -target 1.1 -d out -cp src src/Jasmin.java
+    @$(JDK)jar cfm jasmin.jar src/jasmin.mf -C out .
+
+src/jasmin/parser.java:
+src/jasmin/sym.java: src/jasmin/parser.cup java_cup.jar
+    @$(JDK)java -jar java_cup.jar -out src/jasmin -nosummary <src/jasmin/parser.cup
+
+
+######################
+java_cup.jar : $(CUP)
+    @if not exist out_cup\nul mkdir out_cup
+    @if exist java_cup.jar copy java_cup.jar out_cup >nul
+    @$(JDK)javac -extdirs "" -source 1.2 -target 1.1 -d out_cup -cp src src/java_cup/Main.java
+    @$(JDK)jar cfm java_cup.jar src/java_cup.mf -C out_cup .
+
+src/java_cup/parser.java:
+src/java_cup/sym.java: src/java_cup/parser.cup
+    @$(JDK)java -jar java_cup.jar -out src/java_cup -nosummary <src/java_cup/parser.cup
+
+#########EOF######
diff --git a/jasmin/jasmin-2.4/src/Jasmin.java b/jasmin/jasmin-2.4/src/Jasmin.java
new file mode 100644
index 0000000..66be7d4
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/Jasmin.java
@@ -0,0 +1,6 @@
+import jasmin.Main;
+
+public class Jasmin {
+    public static void main(String args[])
+    { Main.main(args); }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/AnnotDefAttr.java b/jasmin/jasmin-2.4/src/jas/AnnotDefAttr.java
new file mode 100644
index 0000000..e14ac24
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/AnnotDefAttr.java
@@ -0,0 +1,38 @@
+/**
+ * This attribute can associated with a method, field or class.
+ *
+ * @author $Author: Iouri Kharon $
+ * @version $Revision: 1.0 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.Vector;
+import java.util.Enumeration;
+
+public class AnnotDefAttr
+{
+  static final CP attr = new AsciiCP("AnnotationDefault");
+  Annotation ann;
+
+  public AnnotDefAttr()
+  { ann = new Annotation(); }
+
+  public Annotation get()
+  { return(ann); }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(attr);
+    ann.resolve(e);
+  }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    out.writeInt(ann.size());
+    ann.write(e, out);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/AnnotParamAttr.java b/jasmin/jasmin-2.4/src/jas/AnnotParamAttr.java
new file mode 100644
index 0000000..86ebd8f
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/AnnotParamAttr.java
@@ -0,0 +1,72 @@
+/**
+ * This attribute can associated with a method, field or class.
+ *
+ * @author $Author: Iouri Kharon $
+ * @version $Revision: 1.0 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.Vector;
+import java.util.Enumeration;
+
+public class AnnotParamAttr
+{
+  CP attr;
+  Vector anns;  // Vector<Vector<Annotation>>
+
+  public AnnotParamAttr(boolean visible)
+  {
+    attr = new AsciiCP(visible ? "RuntimeVisibleParameterAnnotations" :
+                                 "RuntimeInvisibleParameterAnnotations");
+    anns = new Vector();
+  }
+
+  public void add(Annotation annotation, int paramnum)
+  {
+    Vector ap = null;
+    int top = anns.size();
+    if(paramnum < top) ap = (Vector)anns.elementAt(paramnum);
+    if(ap == null) {
+      if(paramnum >= top) anns.setSize(paramnum+1);
+      anns.set(paramnum, ap = new Vector());
+    }
+    ap.add(annotation);
+  }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(attr);
+    for(int i = 0, top = anns.size(); i < top; i++) {
+      Vector ap = (Vector)anns.elementAt(i);
+      if(ap == null) continue;
+      for(Enumeration en = ap.elements(); en.hasMoreElements(); )
+        ((Annotation)en.nextElement()).resolve(e);
+    }
+  }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    int top = anns.size(), len = 1 + 2*top;
+    for(int i = 0; i < top; i++) {
+      Vector ap = (Vector)anns.elementAt(i);
+      if(ap != null)
+        for(Enumeration en = ap.elements(); en.hasMoreElements(); )
+          len += ((Annotation)en.nextElement()).size();
+    }
+    out.writeInt(len);
+    out.writeByte((byte)top);
+    for(int i = 0; i < top; i++) {
+      Vector ap = (Vector)anns.elementAt(i);
+      if(ap == null) out.writeShort(0);
+      else {
+        out.writeShort((short)ap.size());
+        for(Enumeration en = ap.elements(); en.hasMoreElements(); )
+          ((Annotation)en.nextElement()).write(e, out);
+      }
+    }
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/Annotation.java b/jasmin/jasmin-2.4/src/jas/Annotation.java
new file mode 100644
index 0000000..f8fedbb
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/Annotation.java
@@ -0,0 +1,113 @@
+/**
+ * @author $Author: Iouri Kharon $
+ * @version $Revision: 1.0 $
+ */
+
+
+package jas;
+                                // one class to ring them all...
+
+import java.io.*;
+import java.util.Vector;
+import java.util.Enumeration;
+
+/*
+void addAnnotation() // default
+void addAnnotation(boolean visible, String clname)
+void addAnnotation(boolean visible, String clname, int paramnum)
+*/
+
+public class Annotation extends CP
+{
+  private Vector fields;
+  private AsciiCP type;
+  private Annotation parent;
+  private AnnotationElement field;
+  private boolean is_default;
+
+  public static final void ParserError() throws jasError
+  { throw new jasError("internal logic error in annotation parsing"); }
+
+  private Annotation(Annotation parent, AsciiCP type)
+  {
+    this.type = type;
+    this.parent = parent;
+    field = null;
+    fields = new Vector();
+  }
+
+  public Annotation(String type)
+  { this(null, new AsciiCP(type)); }
+
+  public Annotation() // fictive for AnnotationDefault
+  { this(null, null); }
+
+  public Annotation nestAnnotation() throws jasError
+  {
+    if(field == null) ParserError();
+    Annotation tmp = new Annotation(this, field.nestType());
+    field.addValue(tmp);
+    return(tmp);
+  }
+
+  public Annotation endAnnotation() throws jasError
+  {
+    if(field != null) {
+      field.done();
+      field = null;
+    }
+    return(parent);
+  }
+
+  public void addField(String name, String type, String add)
+    throws jasError
+  {
+    if(this.type == null && fields.size() != 0) ParserError();
+    if(field != null) {
+      field.done();
+      field = null;
+    }
+    if((name == null) != (this.type == null)) ParserError();
+    field = new AnnotationElement(name, type, add);
+    fields.add(field);
+  }
+
+  public void addValue(Object value) throws jasError
+  {
+    if(field == null) ParserError();
+    field.addValue(value);
+  }
+
+  void resolve(ClassEnv e)
+  {
+    if(type != null) e.addCPItem(type);
+    for(Enumeration en = fields.elements(); en.hasMoreElements(); )
+      ((AnnotationElement)en.nextElement()).resolve(e);
+  }
+
+  int size() throws jasError
+  {
+    if(field != null) ParserError();
+
+    int len = 2 + 2;
+    if(type == null) {
+      if(fields.size() != 1) ParserError();
+      len = 0;
+    }
+    for(Enumeration en = fields.elements(); en.hasMoreElements(); )
+      len += ((AnnotationElement)en.nextElement()).size();
+    return(len);
+  }
+
+  void write(ClassEnv e, DataOutputStream out) throws IOException, jasError
+  {
+    if(field != null) ParserError();
+
+    if(type != null) {
+      out.writeShort(e.getCPIndex(type));
+      out.writeShort((short)fields.size());
+    } else if(fields.size() != 1) ParserError();
+    for(Enumeration en = fields.elements(); en.hasMoreElements(); )
+      ((AnnotationElement)en.nextElement()).write(e, out);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/AnnotationAttr.java b/jasmin/jasmin-2.4/src/jas/AnnotationAttr.java
new file mode 100644
index 0000000..af5d458
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/AnnotationAttr.java
@@ -0,0 +1,48 @@
+/**
+ * This attribute can associated with a method, field or class.
+ *
+ * @author $Author: Iouri Kharon $
+ * @version $Revision: 1.0 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.Vector;
+import java.util.Enumeration;
+
+public class AnnotationAttr
+{
+  CP attr;
+  Vector anns;
+
+  public AnnotationAttr(boolean visible)
+  {
+    attr = new AsciiCP(visible ? "RuntimeVisibleAnnotations" :
+                                 "RuntimeInvisibleAnnotations");
+    anns = new Vector();
+  }
+
+  public void add(Annotation annotation)
+  { anns.add(annotation); }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(attr);
+    for(Enumeration en = anns.elements(); en.hasMoreElements(); )
+      ((Annotation)en.nextElement()).resolve(e);
+  }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    int len = 2;
+    for(Enumeration en = anns.elements(); en.hasMoreElements(); )
+      len += ((Annotation)en.nextElement()).size();
+    out.writeInt(len);
+    out.writeShort((short)anns.size());
+    for(Enumeration en = anns.elements(); en.hasMoreElements(); )
+      ((Annotation)en.nextElement()).write(e, out);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/AnnotationElement.java b/jasmin/jasmin-2.4/src/jas/AnnotationElement.java
new file mode 100644
index 0000000..f67b84a
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/AnnotationElement.java
@@ -0,0 +1,234 @@
+/**
+ * AnnotationElement are used by Annotation attributes
+ * @author $Author: Iouri Kharon $
+ * @version $Revision: 1.0 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.Vector;
+import java.util.Enumeration;
+
+public class AnnotationElement
+{
+  private boolean array;
+  private char sign;
+  private CP name, exttype;
+  private Vector values;
+
+  private static final char type_int    = 'I';    // integer
+  private static final char type_byte   = 'B';    // signed byte
+  private static final char type_char   = 'C';    // unicode character
+  private static final char type_short  = 'S';    // signed short
+  private static final char type_bool   = 'Z';    // boolean true or false
+  // end of int types
+  private static final char type_float  = 'F';    // single precision IEEE foat
+  private static final char type_double = 'D';    // double precision IEEE float
+  private static final char type_long   = 'J';    // long integer
+  //prefix
+  private static final char type_array  = '[';
+  //annotation special
+  private static final char type_string = 's';    // constant string
+  private static final char type_class  = 'c';    // return type descriptor
+  //complex types
+  private static final char type_enum   = 'e';    // enum constant (type + name)
+  private static final char type_annot  = '@';    // nested annotation
+
+  private static void badsignature() throws jasError
+  { throw new jasError("invalid type signature for annotation field"); }
+
+  public AnnotationElement(String name, String type, String exttype)
+    throws jasError
+  {
+    this.name = null;
+    if(name != null) this.name = new AsciiCP(name);
+    values = new Vector();
+
+    array = false;
+    sign = type.charAt(0);
+    if(sign != type_array) {
+      if(type.length() != 1) badsignature();
+    } else {
+      array = true;
+      if(type.length() != 2) badsignature();
+      sign = type.charAt(1);
+    }
+
+    switch(sign) {
+      default:
+        badsignature();
+
+      case type_enum:
+      case type_annot:
+        if(exttype == null) badsignature();
+        this.exttype = new AsciiCP(exttype);
+        break;
+
+      case type_int:
+      case type_byte:
+      case type_char:
+      case type_short:
+      case type_bool:
+      case type_float:
+      case type_double:
+      case type_long:
+      case type_string:
+      case type_class:
+        if(exttype != null) badsignature();
+        this.exttype = null;
+        break;
+    }
+  }
+
+  void addValue(Object value) throws jasError
+  {
+    if(value == null) Annotation.ParserError();
+
+    if(!array && values.size() != 0)
+      throw new jasError("too many values for nonarray annotation field type");
+
+    CP cp = null;
+    switch(sign) {
+      case type_char:
+      case type_bool:
+      case type_byte:
+      case type_short:
+      case type_int:
+        if(value instanceof Integer) {
+          int val = ((Integer)value).intValue();
+          boolean badval = false;
+          switch(sign) {
+            case type_bool:
+              if(val < 0 || val > 1) badval = true;
+              break;
+            case type_char:
+              if(val < 0 || val > 0xFFFF) badval = true;
+              break;
+            case type_byte:
+              if(val < -128 || val > 127) badval = true;
+            case type_short:
+              if(val < -32768 || val > 32767) badval = true;
+            default:    // type_int
+              break;
+          }
+          if(badval)
+            throw new jasError("annotation field value exceed range of type", true);
+          cp = new IntegerCP(val);
+        }
+        break;
+      case type_float:
+        if(value instanceof Float)
+          cp = new FloatCP(((Float)value).floatValue());
+        break;
+      case type_double:
+        if(value instanceof Double) {
+          cp = new DoubleCP(((Double)value).doubleValue());
+        } else if(value instanceof Float) {
+          cp = new DoubleCP(((Float)value).floatValue());
+        }
+        break;
+      case type_long:
+        if(value instanceof Long) {
+          cp = new LongCP(((Long)value).longValue());
+        } else if(value instanceof Integer) {
+          cp = new LongCP(((Integer)value).intValue());
+        }
+        break;
+      case type_string:
+      case type_class:
+      case type_enum:
+        if(value instanceof String)
+          cp = new AsciiCP((String)value);
+        break;
+      case type_annot:
+        if(value instanceof Annotation)
+          cp = (Annotation)value;
+      default:
+        break;
+    }
+    if(cp == null)
+      throw new jasError("incompatible value for annotation field type");
+
+    values.add(cp);
+  }
+
+  public AsciiCP nestType() throws jasError
+  {
+    if(sign != type_annot) Annotation.ParserError();
+    return((AsciiCP)exttype);
+  }
+
+  public void done() throws jasError
+  {
+    switch(values.size()) {
+      case 1:
+        return;
+      default:
+        if(array) return;
+        //pass thru
+      case 0:
+       Annotation.ParserError();
+    }
+  }
+
+  void resolve(ClassEnv e)
+  {
+    if(name != null) e.addCPItem(name);
+    if(sign == type_enum) e.addCPItem(exttype);
+    for(Enumeration en = values.elements(); en.hasMoreElements(); ) {
+      CP cp = ((CP)en.nextElement());
+      if(sign != type_annot) e.addCPItem(cp);
+      else cp.resolve(e);
+    }
+  }
+
+  int size() throws jasError
+  {
+    done();
+
+    int len;
+    if(sign == type_annot) {
+      len = values.size();  // tags
+      for(Enumeration en = values.elements(); en.hasMoreElements(); )
+        len += ((Annotation)en.nextElement()).size();
+    } else {
+      len = 1+2;
+      if(sign == type_enum) len += 2;
+      len *= values.size();
+    }
+    if(array) len += 1+2;
+    if(name != null) len += 2;
+    return(len);
+  }
+
+  void write(ClassEnv e,  DataOutputStream out) throws IOException, jasError
+  {
+    done();
+
+    if(name != null) out.writeShort(e.getCPIndex(name));
+    if(array) {
+      out.writeByte(type_array);
+      out.writeShort((short)values.size());
+    }
+    short id = 0;
+    if(sign == type_enum) id = e.getCPIndex(exttype);
+    for(Enumeration en = values.elements(); en.hasMoreElements(); ) {
+      out.writeByte(sign);
+      CP cp = ((CP)en.nextElement());
+      switch(sign) {
+        case type_annot:
+           ((Annotation)cp).write(e, out);
+           break;
+        case type_enum:
+          out.writeShort(id);
+          //pass thru
+        default:
+          out.writeShort(e.getCPIndex(cp));
+          break;
+      }
+    }
+  }
+
+}
+
diff --git a/jasmin/jasmin-2.4/src/jas/AsciiCP.java b/jasmin/jasmin-2.4/src/jas/AsciiCP.java
new file mode 100644
index 0000000..c0ffc0d
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/AsciiCP.java
@@ -0,0 +1,30 @@
+/**
+ * This is a class to create Ascii CP entries.
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+
+public class AsciiCP extends CP implements RuntimeConstants
+{
+  /**
+   * @param s Name of the ascii constant pool entry
+   */
+  public AsciiCP(String s)
+  { uniq = s.intern(); }
+  void resolve(ClassEnv e)
+  { return; }
+
+  public String toString() { return "AsciiCP: " + uniq; }
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException
+  {
+    out.writeByte(CONSTANT_UTF8);
+    out.writeUTF(uniq);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/CP.java b/jasmin/jasmin-2.4/src/jas/CP.java
new file mode 100644
index 0000000..b514b6a
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/CP.java
@@ -0,0 +1,37 @@
+/**
+ * this is an abstraction to contain all the CPE items
+ * that can be created.
+ *
+ * @see AsciiCP
+ * @see ClassCP
+ * @see NameTypeCP
+ * @see FieldCP
+ * @see InterfaceCP
+ * @see MethodCP
+ * @see IntegerCP
+ * @see LongCP
+ * @see FloatCP
+ * @see DoubleCP
+ * @see StringCP
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+
+package jas;
+                                // one class to ring them all...
+
+import java.io.*;
+
+public abstract class CP
+{
+  String uniq;
+
+  String getUniq() { return uniq; }
+
+  abstract void resolve(ClassEnv e);
+
+  abstract void write(ClassEnv e, DataOutputStream out)
+   throws IOException, jasError;
+}
diff --git a/jasmin/jasmin-2.4/src/jas/CatchEntry.java b/jasmin/jasmin-2.4/src/jas/CatchEntry.java
new file mode 100644
index 0000000..d2dd77d
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/CatchEntry.java
@@ -0,0 +1,80 @@
+/**
+ * This class
+ * is used to build up entries in a catch table.
+ * @see Catchtable
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+public class CatchEntry
+{
+  Label start_pc, end_pc, handler_pc;
+  int start_off, end_off, handler_off;
+  CP catch_cpe;
+  /**
+   * Catch entries are created and then added to the Catchtable.
+   * @param start Label marking the beginning of the area
+   *       where the catch table is active.
+   * @param end Label marking the end of the area where the
+   *       table is active.
+   * @param handler Label marking the entrypoint into the
+   *  exception handling routine.
+   * @param cat (usually a classCP) informing the VM to direct
+   * any exceptions of this (or its subclasses) to the handler.
+   * @see Catchtable
+   */
+  public
+  CatchEntry(Label start, Label end, Label handler, CP cat)
+  {
+    start_pc = start;
+    end_pc = end;
+    handler_pc = handler;
+    catch_cpe = cat;
+  }
+
+  /**
+   * Catch entries are created and then added to the Catchtable.
+   * @param start offset marking the beginning of the area
+   *       where the catch table is active.
+   * @param end offset marking the end of the area where the
+   *       table is active.
+   * @param handler offset marking the entrypoint into the
+   *  exception handling routine.
+   * @param cat (usually a classCP) informing the VM to direct
+   * any exceptions of this (or its subclasses) to the handler.
+   * @see Catchtable
+   */
+  public
+  CatchEntry(int start, int end, int handler, CP cat)
+  {
+    start_off = start;
+    end_off = end;
+    handler_off = handler;
+    catch_cpe = cat;
+  }
+
+  void resolve(ClassEnv e)
+  { if (catch_cpe != null) e.addCPItem(catch_cpe); }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    if(start_pc!=null && end_pc != null && handler_pc != null) {
+      start_pc.writeOffset(ce, null, out);
+      end_pc.writeOffset(ce, null, out);
+      handler_pc.writeOffset(ce, null, out);
+    } else {
+      out.writeShort(start_off);
+      out.writeShort(end_off);
+      out.writeShort(handler_off);
+    }
+    if (catch_cpe != null)
+      { out.writeShort(e.getCPIndex(catch_cpe)); }
+    else
+      { out.writeShort(0); }
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/Catchtable.java b/jasmin/jasmin-2.4/src/jas/Catchtable.java
new file mode 100644
index 0000000..3da943d
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/Catchtable.java
@@ -0,0 +1,65 @@
+/**
+ * This is used to make a table of catch handlers for a method.
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+package jas;
+
+import java.io.*;
+import java.util.*;
+
+public class Catchtable
+{
+  Vector entries;
+
+  public Catchtable() { entries = new Vector(); }
+
+  /**
+   * add an entry to the catch table
+   */
+
+  public void addEntry(CatchEntry entry) { entries.addElement(entry); }
+
+  /**
+   * add an entry to the catch table
+   * @param start Label marking the beginning of the area
+   *       where the catch table is active.
+   * @param end Label marking the end of the area where the
+   *       table is active.
+   * @param handler Label marking the entrypoint into the
+   *  exception handling routine.
+   * @param cat (usually a classCP) informing the VM to direct
+   * any exceptions of this (or its subclasses) to the handler.
+   */
+
+  public void
+  addEntry(Label start, Label end, Label handler, CP cat)
+  { addEntry(new CatchEntry(start, end, handler, cat)); }
+
+  public void
+  addEntry(int start, int end, int handler, CP cat)
+  { addEntry(new CatchEntry(start, end, handler, cat)); }
+
+  void resolve(ClassEnv e)
+  {
+    for (Enumeration en=entries.elements(); en.hasMoreElements(); )
+      {
+        CatchEntry ce = (CatchEntry)(en.nextElement());
+        ce.resolve(e);
+      }
+  }
+
+  int size()
+  { return (8*entries.size()); } // each entry is 8 bytes
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(entries.size());
+    for (Enumeration en = entries.elements(); en.hasMoreElements();)
+      {
+        CatchEntry entry = (CatchEntry)(en.nextElement());
+        entry.write(e, ce, out);
+      }
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/ClassCP.java b/jasmin/jasmin-2.4/src/jas/ClassCP.java
new file mode 100644
index 0000000..b6dee8b
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/ClassCP.java
@@ -0,0 +1,35 @@
+/**
+ * This is used to create a Class constant pool item
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+
+public class ClassCP extends CP implements RuntimeConstants
+{
+  AsciiCP name;
+
+  /**
+   * @param name Name of the class
+   */
+  public ClassCP(String name)
+  {
+    uniq = ("CLASS: #$%^#$" + name).intern();
+    this.name = new AsciiCP(name);
+  }
+
+  void resolve(ClassEnv e)
+  { e.addCPItem(name); }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeByte(CONSTANT_CLASS);
+    out.writeShort(e.getCPIndex(name));
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/ClassEnv.java b/jasmin/jasmin-2.4/src/jas/ClassEnv.java
new file mode 100644
index 0000000..3f948e7
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/ClassEnv.java
@@ -0,0 +1,371 @@
+
+package jas;
+
+import java.io.*;
+import java.util.Hashtable;
+import java.util.Enumeration;
+import java.util.Vector;
+
+
+
+/**
+ * This is the place where all information about the class to
+ * be created resides.
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+public class ClassEnv implements RuntimeConstants
+{
+  int magic;
+  short version_lo, version_hi;
+  CP this_class, super_class;
+  short class_access;
+  Hashtable cpe, cpe_index;
+  Vector interfaces;
+  Vector vars;
+  Vector methods;
+  SourceAttr source;
+  SignatureAttr signature;
+  SourceDebugExtensionAttr debug;
+  EnclosingMethodAttr enclosing;
+  DeprecatedAttr depr;
+  InnerClassesAttr innerclasses;
+  AnnotationAttr annVis, annInvis;
+  Vector generic;
+
+  public ClassEnv()
+  {
+                                // Fill in reasonable defaults
+    magic = JAVA_MAGIC;
+    version_lo = (short) JAVA_MINOR_VERSION;
+    version_hi = (short) JAVA_VERSION;
+                                // Initialize bags
+    cpe = new Hashtable();
+    cpe_index = null;
+    interfaces = new Vector();
+    vars = new Vector();
+    methods = new Vector();
+    annVis = annInvis = null;
+    generic = new Vector();
+  }
+
+  /**
+   * Define this class to have this name.
+   * @param name CPE representing name for class. (This is usually
+   * a ClassCP)
+   */
+  public void setClass(CP name)
+  {  this_class = name; addCPItem(name); }
+  /**
+   * Define this class to have this superclass
+   * @param name CPE representing name for class. (This is usually
+   * a ClassCP)
+   */
+  public void setSuperClass(CP name)
+  {  super_class = name; addCPItem(name); }
+
+  /**
+   * Set the class access for this class. Constants understood
+   * by this are present along with the java Beta distribution.
+   * @param access number representing access permissions for
+   *        the entire class.
+   * @see RuntimeConstants
+   */
+  public void setClassAccess(short access)
+  { class_access  = access; }
+
+  /**
+   * Add this CP to the list of interfaces supposedly implemented by
+   * this class. Note that the CP ought to be a ClassCP to make
+   * sense to the VM.
+   */
+
+  public void addInterface(CP ifc)
+  {
+    addCPItem(ifc);
+    interfaces.addElement(ifc);
+  }
+
+  /**
+   * Add this to the list of interfaces supposedly implemented
+   * by this class. Note that each CP is usually a ClassCP.
+   * @param ilist An array of CP items representing the
+   *          interfaces implemented by this class.
+   */
+  public void addInterface(CP ilist[])
+  {
+    for (int i=0; i<ilist.length; i++)
+      {
+        interfaces.addElement(ilist[i]);
+        addCPItem(ilist[i]);
+      }
+  }
+
+  public void addField(Var v)
+  {
+    vars.addElement(v);
+    v.resolve(this);
+  }
+  /**
+   * Write the contents of the class.
+   *
+   * @param out DataOutputStream on which the contents are written.
+   */
+  public void write(DataOutputStream out)
+    throws IOException, jasError
+  {
+				// Headers
+    out.writeInt(magic);
+    out.writeShort(version_lo);
+    out.writeShort(version_hi);
+
+				// cpe items
+    int curidx = 1;
+				// make up indices for entries
+    cpe_index = new Hashtable();
+    for (Enumeration e = cpe.elements(); e.hasMoreElements();)
+      {
+        CP tmp = (CP)(e.nextElement());
+        cpe_index.put(tmp.getUniq(), new Integer(curidx));
+        curidx++;
+        if ((tmp instanceof LongCP) ||
+            (tmp instanceof DoubleCP))
+          curidx++;
+      }
+    out.writeShort((short)curidx);
+
+				// Now write out all the entries
+    for (Enumeration e = cpe.elements(); e.hasMoreElements();)
+      {
+        CP now = (CP) (e.nextElement());
+        now.write(this, out);
+      }
+
+				// Class hierarchy/access
+    out.writeShort(class_access);
+    out.writeShort(getCPIndex(this_class));
+    out.writeShort(getCPIndex(super_class));
+                                // interfaces
+    out.writeShort(interfaces.size());
+    for (Enumeration e = interfaces.elements(); e.hasMoreElements();)
+      {
+        CP c = (CP)(e.nextElement());
+        out.writeShort(getCPIndex(c));
+      }
+                                // variables
+    out.writeShort(vars.size());
+    for (Enumeration e = vars.elements(); e.hasMoreElements();)
+      {
+        Var v = (Var)(e.nextElement());
+        v.write(this, out);
+      }
+
+                                // methods
+    out.writeShort(methods.size());
+    for (Enumeration e = methods.elements(); e.hasMoreElements();)
+      {
+        Method m = (Method)(e.nextElement());
+        m.write(this, out);
+      }
+                                // additional attributes
+    short numExtra = 0;
+    if (source != null)
+      { numExtra++; }
+    if (debug != null)
+      { numExtra++; }
+    if (enclosing != null)
+      { numExtra++; }
+    if (signature != null)
+      { numExtra++; }
+    if (innerclasses != null)
+      { numExtra++; }
+    if (depr != null)
+      { numExtra++; }
+    if (annVis != null)
+      { numExtra++; }
+    if (annInvis != null)
+      { numExtra++; }
+    numExtra += generic.size();
+
+    out.writeShort(numExtra);
+    if (source != null)
+      { source.write(this, out); }
+    if (debug != null)
+      { debug.write(this, out); }
+    if (enclosing != null)
+      { enclosing.write(this, out); }
+    if (signature != null)
+      { signature.write(this, out); }
+    if (innerclasses != null)
+      { innerclasses.write(this, out); }
+    if (depr != null)
+      { depr.write(this, out); }
+    if (annVis != null)
+      { annVis.write(this, out); }
+    if (annInvis != null)
+      { annInvis.write(this, out); }
+    for (Enumeration gen=generic.elements(); gen.hasMoreElements(); )
+      {
+        GenericAttr gattr = (GenericAttr)gen.nextElement();
+        gattr.write(this, out);
+      }
+    out.flush();
+  }
+
+  /**
+   * This is the method to add CPE items to a class. CPE items for
+   * a class are "uniquefied". Ie, if you add a CPE items whose
+   * contents already exist in the class, only one entry is finally
+   * written out when the class is written.
+   *
+   * @param cp Item to be added to the class
+   */
+
+  public void addCPItem(CP cp)
+  {
+    String uniq = cp.getUniq();
+    CP intern;
+
+    if ((intern = (CP)(cpe.get(uniq))) == null)
+      {
+				// add it
+        cpe.put(uniq, cp);
+				// resolve it so it adds anything
+				// which it depends on
+        cp.resolve(this);
+      }
+  }
+
+  /**
+   * Add an attribute specifying the name of the source file
+   * for the class
+   * @param source SourceAttribute specifying the source for the file
+   */
+
+  public void setSource(SourceAttr source)
+  { this.source = source; source.resolve(this); }
+
+  /**
+   * Add an attribute specifying the name of the source file
+   * for the clas.
+   * @param source String with the name of the class
+   */
+  public void setSource(String source)
+  { this.source = new SourceAttr(source); this.source.resolve(this); }
+
+  /**
+   * Add an attribute specifying extended debug information
+   * @param debug String the extended debug information
+   */
+  public void setSourceDebugExtension(String debug)
+  {
+    if ( this.debug != null )
+        this.debug.append(debug);
+    else {
+        this.debug = new SourceDebugExtensionAttr(debug);
+        this.debug.resolve(this);
+    }
+  }
+
+
+  /**
+   * Add an attribute specifying the enclosing method of this class
+   * @param cls String the enclosing class
+   * @param mtd String the enclosing method
+   * @param dsc String the enclosing method descriptor
+   */
+  public void setEnclosingMethod(String cls, String mtd, String dsc)
+  { this.enclosing = new EnclosingMethodAttr(cls, mtd, dsc);
+    this.enclosing.resolve(this); }
+
+
+  /**
+   * Add an attribute specifying the signature of this class
+   * @param sig String the signature
+   */
+  public void setSignature(String sig)
+  { this.signature = new SignatureAttr(sig);
+    this.signature.resolve(this); }
+
+
+  public void setDeprecated(DeprecatedAttr depr)
+  { this.depr = depr; depr.resolve(this); }
+
+  /**
+   * Add a generic attribute to the class file. A generic attribute
+   * contains a stream of uninterpreted bytes which is ignored by
+   * the VM (as long as its name doesn't conflict with other names
+   * for attributes that are understood by the VM)
+   */
+  public void addGenericAttr(GenericAttr g)
+  { generic.addElement(g); g.resolve(this); }
+
+  public void addInnerClass(short iacc, String name, String inner, String outer)
+  {
+    if(innerclasses == null) {
+      innerclasses = new InnerClassesAttr();
+      innerclasses.resolve(this);
+    }
+    InnerClass ic = new InnerClass(iacc, name, inner, outer);
+    ic.resolve(this);
+    innerclasses.addInnerClass(ic);
+  }
+
+  /*
+   * procedure group for annotation description
+  */
+  public Annotation addAnnotation(boolean visible, String clsname)
+  {
+    Annotation ann = new Annotation(clsname);
+    AnnotationAttr aa = visible ? annVis : annInvis;
+    if(aa == null) {
+      aa = new AnnotationAttr(visible);
+      if(visible) annVis = aa;
+      else annInvis = aa;
+    }
+    aa.add(ann);
+    return(ann);
+  }
+
+  public void endHeader()
+  {
+    if(annVis != null) annVis.resolve(this);
+    if(annInvis != null) annInvis.resolve(this);
+  }
+
+  /**
+   * This allows more control over generating CP's for methods
+   * if you feel so inclined.
+   */
+  public void addMethod(Method m)
+  {
+    m.resolve(this);
+    methods.addElement(m);
+  }
+
+  short getCPIndex(CP cp)
+    throws jasError
+  {
+    if (cpe_index == null)
+      throw new jasError("Internal error: CPE index has not been generated");
+
+    Integer idx = (Integer)(cpe_index.get(cp.getUniq()));
+    if (idx == null)
+      throw new jasError("Item " + cp + " not in the class");
+    return ((short)(idx.intValue()));
+  }
+
+  /**
+   * Change the bytecode version of this class
+   * The version will be version_high.version_low
+   * @param version_high short
+   * @param version_low short
+   */
+  public void setVersion(short version_high, short version_low)
+  {
+    version_hi = version_high;
+    version_lo = version_low;
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/CodeAttr.java b/jasmin/jasmin-2.4/src/jas/CodeAttr.java
new file mode 100644
index 0000000..001fdce
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/CodeAttr.java
@@ -0,0 +1,218 @@
+/**
+ * CodeAttr's are used as a bag to hold lists of instructions
+ * until it is time to put them into a Class.
+ * @see ClassEnv#addMethod
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.*;
+
+
+public class CodeAttr
+{
+  static final CP attr = new AsciiCP("Code");
+  short stack_size, num_locals;
+  int code_size;
+  Vector insns;
+  Hashtable insn_pc;
+  Catchtable ctb;
+  LineTableAttr ltab;
+  LocalVarTableAttr lvar;
+  LocalVarTypeTableAttr lvtyp;
+  StackMap stackmap;
+  Vector generic;
+
+  /**
+   * Create a new bag. Add instructions with the addInsn() method,
+   * set the catch table with the setCatchTable() method.
+   * @see Insn
+   * @see Catchtable
+   * @see ClassEnv#addMethod
+   */
+
+  public CodeAttr()
+  {
+    this.stack_size = 1;
+    this.num_locals = 1;
+    this.ctb = null;
+    this.insns = new Vector();
+    generic = new Vector();
+  }
+  /**
+   * Set the catchtable for this code
+   */
+  public void setCatchtable(Catchtable ctb)
+  { this.ctb = ctb; }
+
+  /**
+   * Set the line number table for this method
+   */
+
+  public void setLineTable(LineTableAttr ltab)
+  { this.ltab = ltab; }
+
+  /**
+   * Set the local variable information for this method
+   */
+
+  public void setLocalVarTable(LocalVarTableAttr lvar)
+  { this.lvar = lvar; }
+
+
+  /**
+   * Set the local variable type information for this method
+   */
+
+  public void setLocalVarTypeTable(LocalVarTypeTableAttr lvtyp)
+  { this.lvtyp = lvtyp; }
+
+
+  /**
+   * Set the StackMap attribute for this method
+   */
+  public void setStackMap(StackMap s)
+  { stackmap = s; }
+
+  /**
+   * Add a generic attribute to the method. A generic attribute
+   * contains a stream of uninterpreted bytes which is ignored by
+   * the VM (as long as its name doesn't conflict with other names
+   * for attributes that are understood by the VM)
+   */
+  public void addGenericAttr(GenericAttr g)
+  { generic.addElement(g); }
+
+
+  /**
+   * Append a new Insn to this code. Insn's are sequentially
+   * stored, in the order in which this method is called. You
+   * can't reorder code fragments after you've added it here.
+   */
+  public void addInsn(Insn insn)
+  { insns.addElement(insn); }
+
+  public void setStackSize(short stack_size)
+  { this.stack_size = stack_size; }
+
+  public void setVarSize(short num_vars)
+  { num_locals = num_vars; }
+
+  void resolve(ClassEnv e)
+  {
+                                // propagate this resolution to
+                                // the insns and catch table, so
+                                // that any CP's referenced by them
+                                // also get added.
+    e.addCPItem(attr);
+    for (Enumeration en = insns.elements(); en.hasMoreElements();)
+      {
+        Insn i = (Insn)(en.nextElement());
+        i.resolve(e);
+      }
+    if (ctb != null)  ctb.resolve(e);
+    if (ltab != null) ltab.resolve(e);
+    if (lvar != null) lvar.resolve(e);
+    if (lvtyp != null) lvtyp.resolve(e);
+    if (stackmap != null) stackmap.resolve(e);
+    for (Enumeration gen = generic.elements(); gen.hasMoreElements();)
+      {
+        GenericAttr gattr = (GenericAttr)gen.nextElement();
+        gattr.resolve(e);
+      }
+  }
+
+  int getPc(Insn i) throws jasError
+  {
+    if (insn_pc == null)
+      throw new jasError("Internal error, insn_pc has not been initialized");
+    Integer tmp;
+    if (i instanceof Label)
+      {
+        tmp = (Integer)(insn_pc.get(((Label)i).id));
+      }
+    else
+      {
+        tmp = (Integer)(insn_pc.get(i));
+      }
+    if (tmp == null)
+      throw new jasError(i + " has not been added to the code");
+    return tmp.intValue();
+  }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+                                // First, resolve all labels and
+                                // compute total size
+    int code_size = 0;
+    insn_pc = new Hashtable();
+    for (Enumeration en = insns.elements(); en.hasMoreElements();)
+      {
+        Insn now = (Insn)(en.nextElement());
+        if (now instanceof Label)
+          {
+            insn_pc.put(((Label)now).id, new Integer(code_size));
+          }
+        else
+          { insn_pc.put(now, new Integer(code_size)); }
+        code_size += now.size(e, this);
+      }
+    int total_size = code_size;
+    if (ctb != null) total_size += ctb.size();
+    if (ltab != null) total_size += ltab.size();
+    if (lvar != null) total_size += lvar.size();
+    if (lvtyp != null) total_size += lvtyp.size();
+    if (stackmap != null) total_size += stackmap.size(e, this);
+    for (Enumeration gen = generic.elements(); gen.hasMoreElements();)
+      {
+        GenericAttr gattr = (GenericAttr)(gen.nextElement());
+        total_size += gattr.size();
+      }
+
+                                // extra headers
+    total_size += 12;
+
+
+    out.writeShort(e.getCPIndex(attr));
+    out.writeInt(total_size);
+    out.writeShort(stack_size);
+    out.writeShort(num_locals);
+    out.writeInt(code_size);
+    for (Enumeration en = insns.elements(); en.hasMoreElements();)
+      {
+        Insn now = (Insn)(en.nextElement());
+        now.write(e, this, out);
+      }
+    if (ctb != null)
+      { ctb.write(e, this, out); }
+    else
+      { out.writeShort(0); }
+    short extra = 0;
+    if (ltab != null) extra++;
+    if (lvar != null) extra++;
+    if (lvtyp != null) extra++;
+    if (stackmap != null) extra++;
+    extra += generic.size();
+    out.writeShort(extra);
+    if (ltab != null)
+      { ltab.write(e, this, out); }
+    if (lvar != null)
+      { lvar.write(e, this, out); }
+    if (lvtyp != null)
+      { lvtyp.write(e, this, out); }
+    if (stackmap != null)
+      { stackmap.write(e, this, out); }
+    for (Enumeration gen = generic.elements(); gen.hasMoreElements();)
+      {
+        GenericAttr gattr = (GenericAttr)gen.nextElement();
+        gattr.write(e, out);
+      }
+  }
+
+  public String toString()
+  { return ("<#code-attr>"); }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/ConstAttr.java b/jasmin/jasmin-2.4/src/jas/ConstAttr.java
new file mode 100644
index 0000000..267e7fc
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/ConstAttr.java
@@ -0,0 +1,43 @@
+/**
+ * This is typically used to represent a constant value for
+ * a field entry (as in static final int foo = 20).
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+public class ConstAttr
+{
+  static final CP attr = new AsciiCP("ConstantValue");
+  CP val;
+
+  /**
+   * Create a new constant attribute whose constant value
+   * is picked up from constant pool with the given entry.
+   * @param val Constant pool item whose value is associated
+   * with the constant value attribute
+   */
+
+  public ConstAttr(CP val)
+  { this.val = val; }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(val);
+    e.addCPItem(attr);
+  }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    out.writeInt(2);
+    out.writeShort(e.getCPIndex(val));
+  }
+}
+
+  
diff --git a/jasmin/jasmin-2.4/src/jas/DeprecatedAttr.java b/jasmin/jasmin-2.4/src/jas/DeprecatedAttr.java
new file mode 100644
index 0000000..f1ab42a
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/DeprecatedAttr.java
@@ -0,0 +1,32 @@
+/**
+ * This attribute is used to mark class/method/field as deprecated.
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+public class DeprecatedAttr
+{
+  static final CP attr = new AsciiCP("Deprecated");
+
+  /**
+   * Create a deprecated attribute.
+   * @see ClassEnv#setDeprecated
+   */
+
+  public DeprecatedAttr() { }
+
+  void resolve(ClassEnv e) 
+     { e.addCPItem(attr); }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    out.writeInt(0);
+  }
+}
+
diff --git a/jasmin/jasmin-2.4/src/jas/DoubleCP.java b/jasmin/jasmin-2.4/src/jas/DoubleCP.java
new file mode 100644
index 0000000..33ca425
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/DoubleCP.java
@@ -0,0 +1,32 @@
+package jas;
+
+import java.io.*;
+
+
+/**
+ * Wrap an Double constant reference with this CPE.
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+public class DoubleCP extends CP implements RuntimeConstants
+{
+  double val;
+
+  /**
+   * @param n Value for Double constant
+   */
+  public DoubleCP(double n)
+  {
+    uniq = ("Double: @#$" + n).intern();
+    val = n;
+  }
+  void resolve(ClassEnv e) { return; }
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException
+  {
+    out.writeByte(CONSTANT_DOUBLE);
+    out.writeDouble(val);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/EnclosingMethodAttr.java b/jasmin/jasmin-2.4/src/jas/EnclosingMethodAttr.java
new file mode 100644
index 0000000..5963852
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/EnclosingMethodAttr.java
@@ -0,0 +1,55 @@
+/**
+ * This attribute is used to define the enclosing method of this class
+ * @author $Author: Daniel Reynaud $
+ * @version $Revision: 1.0 $
+ */
+
+package jas;
+
+import java.io.*;
+
+public class EnclosingMethodAttr
+{
+  static final CP attr = new AsciiCP("EnclosingMethod");
+  CP clscp,
+     ntcp;
+
+  String cls, mtd, dsc;
+
+  /**
+   * Create an EnclosingMethod attribute
+   * @param cls Name of the enclosing class
+   * @param mtd Name of the enclosing method (can be null)
+   * @param dsc Name of the enclosing method descriptor (can be null)
+   * @see ClassEnv#setEnclosingMethod
+   */
+
+  public EnclosingMethodAttr(String cls, String mtd, String dsc)
+  { this.cls = cls;
+    this.mtd = mtd;
+    this.dsc = dsc;
+    clscp = new ClassCP(cls);
+    if(mtd!=null && dsc!=null)
+      ntcp = new NameTypeCP(mtd, dsc);
+  }
+
+  void resolve(ClassEnv e)
+  { e.addCPItem(attr);
+    e.addCPItem(clscp);  // add the CONSTANT_Class
+    clscp.resolve(e);    // add the CONSTANT_Utf8 for the class name
+    if(ntcp!=null) {
+      e.addCPItem(ntcp); // add the CONSTANT_NameAndType
+      ntcp.resolve(e);   // add the two CONSTANT_Utf8
+    }
+ }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    out.writeInt(4);
+    out.writeShort(e.getCPIndex(clscp));
+    out.writeShort(ntcp==null ? 0 : e.getCPIndex(ntcp));
+  }
+}
+
diff --git a/jasmin/jasmin-2.4/src/jas/ExceptAttr.java b/jasmin/jasmin-2.4/src/jas/ExceptAttr.java
new file mode 100644
index 0000000..7acda38
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/ExceptAttr.java
@@ -0,0 +1,45 @@
+/**
+ * This attribute is associated with a method, and indicates
+ * the set of exceptions (as classCP items) that can be thrown
+ * by the method.
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.*;
+
+public class ExceptAttr
+{
+  static final CP attr = new AsciiCP("Exceptions");
+
+  Vector cps;
+
+  public ExceptAttr() { cps = new Vector(); }
+  /**
+   * @param cp Exception class to be added to attribute. This is
+   * typically a ClassCP
+   */
+  public void addException(CP cp)
+  { cps.addElement(cp); }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(attr);
+    for (Enumeration en = cps.elements(); en.hasMoreElements();)
+      { e.addCPItem((CP)(en.nextElement())); }
+  }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    out.writeInt(cps.size()*2 + 2);
+    out.writeShort(cps.size());
+    for (Enumeration en = cps.elements(); en.hasMoreElements();)
+      { out.writeShort(e.getCPIndex((CP)(en.nextElement()))); }
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/FieldCP.java b/jasmin/jasmin-2.4/src/jas/FieldCP.java
new file mode 100644
index 0000000..e2de3c4
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/FieldCP.java
@@ -0,0 +1,51 @@
+/**
+ * FieldCP's are used to refer to a field in a particular
+ * class.
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+
+public class FieldCP extends CP implements RuntimeConstants
+{
+  ClassCP clazz;
+  NameTypeCP nt;
+
+  /**
+   * FieldCP's are created by specifying the class to which the 
+   * field belongs, the name of the symbol, and its signature.
+   * For instance, to refer to the field <tt>out</tt> in 
+   * <tt>System.out</tt> use
+   * <tt> new FieldCP("java/lang/System", "out", "Ljava/io/PrintStream;")</tt>
+   *
+   * @param clazz Name of class
+   * @param name Name of symbol
+   * @param sig Signature for symbol
+   */
+
+  public FieldCP(String clazz, String name, String sig)
+  {
+    uniq = (clazz + "&%$#&" + name + "*()#$" + sig).intern();
+    this.clazz = new ClassCP(clazz);
+    this.nt = new NameTypeCP(name, sig);
+  }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(clazz);
+    e.addCPItem(nt);
+  }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeByte(CONSTANT_FIELD);
+    out.writeShort(e.getCPIndex(clazz));
+    out.writeShort(e.getCPIndex(nt));
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/FloatCP.java b/jasmin/jasmin-2.4/src/jas/FloatCP.java
new file mode 100644
index 0000000..339c391
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/FloatCP.java
@@ -0,0 +1,32 @@
+package jas;
+
+import java.io.*;
+
+
+/**
+ * Wrap an Float constant reference with this CPE.
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+public class FloatCP extends CP implements RuntimeConstants
+{
+  float val;
+
+  /**
+   * @param n Value for Float constant
+   */
+  public FloatCP(float n)
+  {
+    uniq = ("Float: @#$" + n).intern();
+    val = n;
+  }
+  void resolve(ClassEnv e) { return; }
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException
+  {
+    out.writeByte(CONSTANT_FLOAT);
+    out.writeFloat(val);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/GenericAttr.java b/jasmin/jasmin-2.4/src/jas/GenericAttr.java
new file mode 100644
index 0000000..c0ea360
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/GenericAttr.java
@@ -0,0 +1,75 @@
+/**
+ * This is an opaque attribute that lets you add an uninterpreted
+ * stream of bytes into an attribute in a class file. This can be
+ * used (for instance) to embed versioning or signatures into the
+ * class file or method.
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+package jas;
+
+import java.io.*;
+
+public class GenericAttr
+{
+  CP attr_name;
+  byte data[];
+
+  /**
+   * Make up a new attribute
+   * @param data stream of bytes to be placed with the attribute
+   * @see ClassEnv#addGenericAttr
+   * @see CodeAttr#addGenericAttr
+   */
+  public GenericAttr(String name, byte data[])
+  {
+    attr_name = new AsciiCP(name);
+    this.data = data;
+  }
+  /**
+   * Make up a new attribute
+   * @param name CP to be defined as the name of the attribute
+   * @param data stream of bytes to be placed with the attribute
+   * @see ClassEnv#addGenericAttr
+   * @see CodeAttr#addGenericAttr
+   */
+  public GenericAttr(CP name, byte data[])
+  {
+    attr_name = name;
+    this.data = data;
+  }
+  /**
+   * Make up a new attribute
+   * @param name Name to be associated with the attribute
+   * @param file name of file with attribute contens
+   */
+  public GenericAttr(String name, String file) throws IOException, jasError
+  {
+    FileInputStream inp;
+    try {
+      inp = new FileInputStream(file);
+    } catch(FileNotFoundException e) {
+      throw new jasError("Generic atribute file " +file+ " not found");
+    }
+    data = new byte[inp.available()];
+    inp.read(data);
+    inp.close();
+    attr_name = new AsciiCP(name);
+  }
+
+  void resolve(ClassEnv e)
+  { e.addCPItem(attr_name); }
+
+  int size()
+  { return (2 + 4 + data.length); }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr_name));
+    out.writeInt(data.length);
+    out.write(data);
+  }
+}
+
diff --git a/jasmin/jasmin-2.4/src/jas/IincInsn.java b/jasmin/jasmin-2.4/src/jas/IincInsn.java
new file mode 100644
index 0000000..85276bf
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/IincInsn.java
@@ -0,0 +1,38 @@
+/**
+ * Some instructions are perniticky enough that its simpler
+ * to write them separately instead of smushing them with
+ * all the rest. the iinc instruction is one of them.
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+
+public class IincInsn extends Insn implements RuntimeConstants
+{
+  /**
+   * @param vindex Index of variable to be incremented.
+   * @param increment value to be added to the variable.
+   *
+   * A wide prefix is automatically added if either the
+   * vindex exceeds 256, or the increment value lies
+   * outside the range [-128, 127]
+   *
+   * The VM spec is unclear on how the wide instruction is implemented,
+   * but the implementation makes <em>both</em> the constant and the
+   * variable index 16 bit values for the wide version of this instruction.
+   */
+  public IincInsn(int vindex, int increment, boolean Wide)
+  {
+    opc = opc_iinc;
+    operand = new IincOperand(vindex, increment, Wide);
+  }
+}
+
+/* --- Revision History ---------------------------------------------------
+--- Iouri Kharon, Aug 10 2006
+    Added 'Wide' prefix support
+*/
diff --git a/jasmin/jasmin-2.4/src/jas/InnerClass.java b/jasmin/jasmin-2.4/src/jas/InnerClass.java
new file mode 100644
index 0000000..5c572d7
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/InnerClass.java
@@ -0,0 +1,60 @@
+/**
+ * @author $Author: Iouri Kharon $
+ * @version $Revision: 1.0 $
+ */
+package jas;
+
+import java.io.*;
+
+public class InnerClass
+{
+  ClassCP inner, outer;
+  CP name;
+  short access;
+
+  public static int size()
+  { return (4 * 2); }
+
+  /**
+   * Make up a new attribute
+   * @see ClassEnv#addInnerClass
+   */
+  public InnerClass(short access, String name, String inner, String outer)
+  {
+    this.access = access;
+    this.name = null;
+    if(name != null) this.name = new AsciiCP(name);
+    this.inner = null;
+    if(inner != null) this.inner = new ClassCP(inner);
+    this.outer = null;
+    if(outer != null) this.outer = new ClassCP(outer);
+  }
+
+  void resolve(ClassEnv e)
+  {
+    if(name  != null) e.addCPItem(name);
+    if(inner != null) {
+      e.addCPItem(inner);
+      inner.resolve(e);
+    }
+    if(outer != null) {
+      e.addCPItem(outer);
+      outer.resolve(e);
+    }
+  }
+
+  void write(ClassEnv e, DataOutputStream out) throws IOException, jasError
+  {
+    short id = 0;
+    if(inner != null) id = e.getCPIndex(inner);
+    out.writeShort(id);
+    id = 0;
+    if(outer != null) id = e.getCPIndex(outer);
+    out.writeShort(id);
+    id = 0;
+    if(name != null) id = e.getCPIndex(name);
+    out.writeShort(id);
+    out.writeShort(access);
+  }
+}
+
diff --git a/jasmin/jasmin-2.4/src/jas/InnerClassesAttr.java b/jasmin/jasmin-2.4/src/jas/InnerClassesAttr.java
new file mode 100644
index 0000000..e491aa9
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/InnerClassesAttr.java
@@ -0,0 +1,39 @@
+/**
+ * @author $Author: Iouri Kharon $
+ * @version $Revision: 1.0 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.Vector;
+import java.util.Enumeration;
+
+public class InnerClassesAttr
+{
+  static final CP attr = new AsciiCP("InnerClasses");
+  private Vector list;
+
+  public InnerClassesAttr()
+  { list = new Vector(); }
+
+  public void addInnerClass(InnerClass item)
+  { list.add(item); }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(attr);
+    for(Enumeration en = list.elements(); en.hasMoreElements(); )
+      ((InnerClass)en.nextElement()).resolve(e);
+  }
+
+  void write(ClassEnv e, DataOutputStream out) throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    out.writeInt((list.size() * InnerClass.size()) + 2);
+    out.writeShort((short)list.size());
+    for(Enumeration en = list.elements(); en.hasMoreElements(); )
+      ((InnerClass)en.nextElement()).write(e, out);
+  }
+}
+
diff --git a/jasmin/jasmin-2.4/src/jas/Insn.java b/jasmin/jasmin-2.4/src/jas/Insn.java
new file mode 100644
index 0000000..6d90f0f
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/Insn.java
@@ -0,0 +1,333 @@
+/**
+ * An Insn is a generic instruction that is added to a
+ * CodeAttr to build up the code for a method.
+ * @see CodeAttr
+ * @see RuntimeConstants
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+
+package jas;
+
+import java.io.*;
+import java.util.*;
+
+
+public class Insn implements RuntimeConstants
+{
+  int opc;
+  InsnOperand operand;
+
+                                // private constructor, for the
+                                // "strange" opcodes
+  Insn() { return; }
+  /**
+   * Instructions with no arguments are built with
+   * this constructor.
+   */
+  public Insn(int opc)
+    throws jasError
+  {
+    if (opcLengths[opc] == 1)
+      { operand = null; this.opc = opc; return; }
+    throw new jasError
+      (opcNames[opc] + " cannot be used without more parameters");
+  }
+
+  private void check_short(int val, int opc) throws jasError
+  {
+    if (val > 32767 || val < -32768)
+      throw new jasError
+        (opcNames[opc] + " numeric value exceed size for short");
+  }
+
+  /**
+   * Instructions that take a single numeric argument. These are
+   * opc_bipush,
+   * opc_sipush,
+   * opc_ret,
+   * opc_iload,
+   * opc_lload,
+   * opc_fload,
+   * opc_dload,
+   * opc_aload,
+   * opc_istore,
+   * opc_lstore,
+   * opc_fstore,
+   * opc_dstore,
+   * opc_astore,
+   * opc_newarray
+   *
+   * Note that an extra wide prefix is automatically added
+   * for the following instructions if the numeric argument
+   * is larger than 256. Also note that while the spec makes
+   * no mention of opc_ret as being a "wideable" opcode, thats
+   * how the VM is implemented.
+   *
+   * opc_ret:
+   * opc_iload:
+   * opc_lload:
+   * opc_fload:
+   * opc_dload:
+   * opc_aload:
+   * opc_istore:
+   * opc_lstore:
+   * opc_fstore:
+   * opc_dstore:
+   * opc_astore:
+   *
+   */
+
+  /**
+   * Added branch instructions
+   */
+
+  public Insn(int opc, int val, boolean Wide)
+    throws jasError
+  {
+    this.opc = opc;
+    switch (opc)
+      {
+      case opc_bipush:
+          if(val > 127 || val < -128)
+            throw new jasError("bipush value exceed size of byte", true);
+          operand = new ByteOperand(val);
+          break;
+
+      case opc_sipush:
+      case opc_goto:
+      case opc_if_acmpeq:
+      case opc_if_acmpne:
+      case opc_if_icmpeq:
+      case opc_if_icmpge:
+      case opc_if_icmpgt:
+      case opc_if_icmple:
+      case opc_if_icmplt:
+      case opc_if_icmpne:
+      case opc_ifeq:
+      case opc_ifge:
+      case opc_ifgt:
+      case opc_ifle:
+      case opc_iflt:
+      case opc_ifne:
+      case opc_ifnonnull:
+      case opc_ifnull:
+      case opc_jsr:
+        check_short(val, opc);
+        operand = new OffsetOperand(this, val); break;
+
+      case opc_goto_w:
+      case opc_jsr_w:
+        operand = new OffsetOperand(this, val, true); break;
+
+      case opc_newarray:
+        if(val < 0 || val > 255)
+            throw new jasError("newarray counter is illegal", true);
+        operand = new UnsignedByteOperand(val);
+        break;
+
+      case opc_ret:
+      case opc_iload:
+      case opc_lload:
+      case opc_fload:
+      case opc_dload:
+      case opc_aload:
+      case opc_istore:
+      case opc_lstore:
+      case opc_fstore:
+      case opc_dstore:
+      case opc_astore:
+        operand = new UnsignedByteWideOperand(val, Wide);
+        break;
+
+      default:
+        throw new jasError
+          (opcNames[opc] + " does not take a numeric argument");
+      }
+  }
+
+
+// used for relative offsets (ex : goto $+5)
+
+  public Insn(int opc, int val, char relative)
+    throws jasError
+  {
+    this.opc = opc;
+    switch (opc)
+      {
+      case opc_goto:
+      case opc_if_acmpeq:
+      case opc_if_acmpne:
+      case opc_if_icmpeq:
+      case opc_if_icmpge:
+      case opc_if_icmpgt:
+      case opc_if_icmple:
+      case opc_if_icmplt:
+      case opc_if_icmpne:
+      case opc_ifeq:
+      case opc_ifge:
+      case opc_ifgt:
+      case opc_ifle:
+      case opc_iflt:
+      case opc_ifne:
+      case opc_ifnonnull:
+      case opc_ifnull:
+      case opc_jsr:
+        check_short(val, opc);
+        operand = new RelativeOffsetOperand(this, val); break;
+
+      case opc_goto_w:
+      case opc_jsr_w:
+        operand = new RelativeOffsetOperand(this, val, true); break;
+
+      default:
+        throw new jasError
+          (opcNames[opc] + " does not take a relative numeric argument");
+      }
+  }
+
+  /**
+   * Instructions that take a Label as an argument. These are
+   * opc_jsr,
+   * opc_goto,
+   * opc_if_acmpne,
+   * opc_if_acmpeq,
+   * opc_if_icmpge,
+   * opc_if_icmple,
+   * opc_if_icmpgt,
+   * opc_if_icmplt,
+   * opc_if_icmpne,
+   * opc_if_icmpeq,
+   * opc_ifge,
+   * opc_ifgt,
+   * opc_ifne,
+   * opc_ifle,
+   * opc_iflt,
+   * opc_ifeq,
+   * opc_ifnull,
+   * opc_ifnonnull,
+   * opc_goto_w,
+   * opc_jsr_w
+   */
+  public Insn(int opc, Label target, int line)
+    throws jasError
+  {
+    this.opc = opc;
+    switch(opc)
+      {
+      case opc_jsr:
+      case opc_goto:
+      case opc_if_acmpne:
+      case opc_if_acmpeq:
+      case opc_if_icmpge:
+      case opc_if_icmple:
+      case opc_if_icmpgt:
+      case opc_if_icmplt:
+      case opc_if_icmpne:
+      case opc_if_icmpeq:
+      case opc_ifge:
+      case opc_ifgt:
+      case opc_ifne:
+      case opc_ifle:
+      case opc_iflt:
+      case opc_ifeq:
+      case opc_ifnull:
+      case opc_ifnonnull:
+        operand = new LabelOperand(target, this, line);
+        break;
+      case opc_goto_w:
+      case opc_jsr_w:
+        operand = new LabelOperand(target, this, true, line);
+        break;
+      default:
+        throw new jasError
+          (opcNames[opc] + " does not take a label as its argument");
+      }
+  }
+  /**
+   * This constructor is used for instructions that take a CP item
+   * as their argument. These are
+   * opc_anewarray,
+   * opc_ldc_w,
+   * opc_ldc2_w,
+   * opc_invokedynamic,
+   * opc_invokenonvirtual,
+   * opc_invokestatic,
+   * opc_invokevirtual,
+   * opc_new,
+   * opc_checkcast,
+   * opc_instanceof,
+   * opc_getstatic,
+   * opc_putstatic,
+   * opc_getfield,
+   * opc_putfield,
+   * opc_ldc
+   */
+  public Insn(int opc, CP arg)
+    throws jasError
+  {
+    this.opc = opc;
+    switch(opc)
+      {
+      case opc_anewarray:
+      case opc_invokedynamic:
+      case opc_invokenonvirtual:
+      case opc_invokestatic:
+      case opc_invokevirtual:
+      case opc_new:
+      case opc_checkcast:
+      case opc_instanceof:
+      case opc_getstatic:
+      case opc_putstatic:
+      case opc_getfield:
+      case opc_putfield:
+        operand = new CPOperand(arg);
+        break;
+      case opc_ldc2_w:
+      case opc_ldc_w:
+        operand = new LdcOperand(this, arg);
+        break;
+      case opc_ldc:
+        operand = new LdcOperand(this, arg, false);
+        break;
+      default:
+        throw new jasError
+          (opcNames[opc] + " does not take a CP item as an argument");
+      }
+  }
+
+                                // This allows the Insn a chance to
+                                // add things to the global env if
+                                // necessary. The CPInsnOperands
+                                // use  this to add the CP to the
+                                // classEnv
+  void resolve(ClassEnv e)
+  { if (operand != null) { operand.resolve(e); } }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    if (operand != null)
+      operand.writePrefix(e, ce, out);
+    out.writeByte((byte) opc);
+    if (operand != null)
+      operand.write(e, ce, out);
+  }
+
+  int size(ClassEnv e, CodeAttr ce)
+    throws jasError
+  {
+    if (operand == null) return 1;
+    return (1 + operand.size(e, ce));
+  }
+
+  public String toString() {
+    return "instruction "+opc+" "+((operand!=null)?operand.toString():"");
+  }
+}
+
+/* --- Revision History ---------------------------------------------------
+--- Iouri Kharon, Aug 10 2006
+    Added 'wide' prefix to some instructions
+*/
diff --git a/jasmin/jasmin-2.4/src/jas/InsnOperand.java b/jasmin/jasmin-2.4/src/jas/InsnOperand.java
new file mode 100644
index 0000000..db42d14
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/InsnOperand.java
@@ -0,0 +1,465 @@
+                                // This is not visible outside the
+                                // package. It is used to
+                                // handle the various types
+                                // of operands used by Insns.
+package jas;
+
+import java.io.*;
+
+abstract class InsnOperand
+{
+  abstract void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError;
+  abstract int size(ClassEnv e, CodeAttr code) throws jasError;
+  abstract void resolve(ClassEnv e);
+  void writePrefix(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  { return; }
+}
+
+                                // Used to implement targets of Insns
+class LabelOperand extends InsnOperand
+{
+  Label target;
+  Insn source;
+  boolean wide;
+  int ref;
+
+  LabelOperand(Label l, Insn source, int line)
+  { target = l; this.source = source; this.wide = false; this.ref = line; }
+  LabelOperand(Label l, Insn source, boolean wide, int line)
+  { target = l; this.source = source; this.wide = wide; this.ref = line; }
+  int size(ClassEnv ce, CodeAttr code) { if (wide) return 4; else return 2; }
+  void resolve(ClassEnv e) { return; }
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    if (wide) { target.writeWideOffset(ce, source, out); }
+    else {
+      int offset = ce.getPc(target);
+      if (source != null)
+        offset -= ce.getPc(source);
+      if (offset > 32767 || offset < -32768)
+        throw new jasError
+          ("reference from line " +ref+ " exceed size for short");
+      target.writeOffset(ce, source, out); }
+    }
+  }
+
+class UnsignedByteOperand extends InsnOperand
+{
+  int val;
+
+  UnsignedByteOperand(int n) { val = n; }
+  int size(ClassEnv ce, CodeAttr code)  { return 1; }
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    if (val >= 256)
+      throw
+        new jasError("Operand is too large (" +val+ ") for this instruction");
+    out.writeByte((byte)(0xff & val));
+  }
+  void resolve(ClassEnv e) { return; }
+}
+
+                                // This (conditionally) adds a wide
+                                // prefix if the value is larger than
+                                // 256
+class UnsignedByteWideOperand extends InsnOperand
+  implements RuntimeConstants
+{
+  int val;
+  boolean Wide;
+
+  UnsignedByteWideOperand(int n, boolean Wide)
+  {
+    val = n;
+    this.Wide = (Wide || val > 255);
+  }
+
+  int size(ClassEnv ce, CodeAttr code)
+  { return Wide ? 3: 1; }
+
+  void writePrefix(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException
+  {
+    if (Wide)
+      out.writeByte((byte)(opc_wide));
+  }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException
+  {
+    if (Wide)
+      out.writeShort((short)(0xffff & val));
+    else
+      out.writeByte((byte)(val & 0xff));
+  }
+  void resolve(ClassEnv e) { return; }
+}
+
+class ByteOperand extends InsnOperand
+{
+  int val;
+
+  ByteOperand(int n) { val = n; }
+  int size(ClassEnv ce, CodeAttr code) { return 1; }
+  void resolve(ClassEnv e) { return; }
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException
+  { out.writeByte((byte)val); }
+}
+
+class IntegerOperand extends InsnOperand
+{
+  int val;
+
+  IntegerOperand(int n) { val = n; }
+  int size(ClassEnv ce, CodeAttr code) { return 4; }
+  void resolve(ClassEnv e) { return; }
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException
+  { out.writeInt(val); }
+}
+
+class ShortOperand extends InsnOperand
+{
+  int offset;
+  ShortOperand(int n) { offset = n; }
+  void resolve(ClassEnv e) { return; }
+  int size(ClassEnv ce, CodeAttr code) { return 2; }
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException
+  { out.writeShort((short)offset); }
+}
+
+class CPOperand extends InsnOperand
+{
+  CP cpe;
+  boolean wide;
+  int size(ClassEnv ce, CodeAttr code) { if (wide) return 2; else return 1; }
+  CPOperand(CP cpe) { this.cpe = cpe; wide = true; }
+  CPOperand(CP cpe, boolean wide)
+  { this.cpe = cpe; this.wide = wide; }
+  void resolve(ClassEnv e)
+  { e.addCPItem(cpe); }
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    int idx = e.getCPIndex(cpe);
+    if (wide)
+      { out.writeShort((short) idx); }
+    else
+      {
+        if (idx > 255)
+          { throw new jasError("exceeded size for small cpidx" + cpe); }
+        out.writeByte((byte) (0xff & (idx)));
+      }
+  }
+}
+
+                                // these are unique enough that
+                                // they need a separate handler for their
+                                // args
+class LdcOperand extends InsnOperand implements RuntimeConstants
+{
+  CP cpe;
+  Insn source;
+  boolean wide;
+
+  int size(ClassEnv ce, CodeAttr code) throws jasError
+  {
+    if (wide)
+      { return 2; }
+    else
+      {
+                                // Should we promote it?
+        int idx = ce.getCPIndex(cpe);
+        if (idx > 255)
+          {
+            wide = true;
+            source.opc = opc_ldc_w;
+            return 2;
+          }
+        return 1;
+      }
+  }
+  LdcOperand(Insn s, CP cpe) { source = s; this.cpe = cpe; wide = true; }
+  LdcOperand(Insn s, CP cpe, boolean wide)
+  { source = s; this.cpe = cpe; this.wide = wide; }
+  void resolve(ClassEnv e)
+  { e.addCPItem(cpe); }
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    int idx = e.getCPIndex(cpe);
+    if (wide)
+      { out.writeShort((short) idx); }
+    else
+      {
+        if (idx > 255)
+          { throw new jasError("exceeded size for small cpidx" + cpe); }
+        out.writeByte((byte) (0xff & (idx)));
+      }
+  }
+}
+
+
+class InvokeinterfaceOperand extends InsnOperand
+{
+  CP cpe;
+  int nargs;
+
+  InvokeinterfaceOperand(CP cpe, int nargs)
+  { this.cpe = cpe; this.nargs = nargs; }
+
+  int size(ClassEnv ce, CodeAttr code) { return 4; }
+
+  void resolve(ClassEnv e)
+  { e.addCPItem(cpe); }
+
+  void write (ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(cpe));
+    out.writeByte((byte) (0xff & nargs));
+    out.writeByte(0);
+  }
+}
+
+class IincOperand extends InsnOperand
+  implements RuntimeConstants
+{
+  int vindex, constt;
+  boolean Wide;
+
+  IincOperand(int vindex, int constt, boolean Wide)
+  {
+    this.vindex = vindex;
+    this.constt = constt;
+    this.Wide = (Wide ||
+                 vindex > 255 ||
+                 constt > 127 ||
+                 constt < 127);
+  }
+
+  int size(ClassEnv ce, CodeAttr code)
+  {
+    return Wide ? 5 : 2;
+  }
+
+  void resolve(ClassEnv e) { return; }
+
+  void writePrefix(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException
+  {
+    if (Wide)
+      out.writeByte((byte)opc_wide);
+  }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException
+  {
+    if (Wide)
+      {
+        out.writeShort((short)(0xffff & vindex));
+        out.writeShort((short)(0xffff & constt));
+      }
+    else
+      {
+        out.writeByte((byte) (0xff & vindex));
+        out.writeByte((byte) (0xff & constt));
+      }
+  }
+}
+
+class MultiarrayOperand extends InsnOperand
+{
+  CP cpe;
+  int sz;
+
+  MultiarrayOperand(CP cpe, int sz)
+  { this.cpe = cpe; this.sz = sz; }
+  void resolve(ClassEnv e) { e.addCPItem(cpe); }
+  int size(ClassEnv ce, CodeAttr code) { return 3; }
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(cpe));
+    out.writeByte((byte)(0xff & sz));
+  }
+}
+
+class LookupswitchOperand extends InsnOperand
+{
+  LabelOrOffset dflt;
+  Insn source;
+  int match[];
+  LabelOrOffset jmp[];
+
+  LookupswitchOperand(Insn s, LabelOrOffset def, int m[], LabelOrOffset j[])
+  { dflt = def; jmp = j;  match = m;  source = s; }
+
+  void resolve (ClassEnv e) { return; }
+  int size(ClassEnv ce, CodeAttr code) throws jasError
+  {
+    int sz = 8;			// 4 + 4 + padding + jumptable
+    int source_pc = code.getPc(source);
+    if (((source_pc+1) % 4) != 0)
+      {
+				// need padding
+	sz += (4 - ((source_pc+1) % 4));
+      }
+
+    if (jmp != null)
+      { sz += 8*(jmp.length); }
+    return sz;
+  }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    int pad;
+    int source_pc = ce.getPc(source);
+
+    if (((source_pc+1) % 4) != 0)
+      {				// need padding
+	pad = (4 - ((source_pc+1) % 4));
+	for (int x=0; x<pad; x++) out.writeByte(0);
+      }
+
+				// write offset to default
+				// as a 4 byte signed value
+    dflt.writeWideOffset(ce, source, out);
+    if (jmp == null)
+      { out.writeInt(0); }
+    else
+      {
+	out.writeInt(jmp.length);
+	for (int x=0; x<jmp.length; x++)
+	  {
+	    out.writeInt(match[x]);
+	    jmp[x].writeWideOffset(ce, source, out);
+	  }
+      }
+  }
+}
+
+
+class TableswitchOperand extends InsnOperand
+{
+  int min, max;
+  LabelOrOffset dflt;
+  LabelOrOffset jmp[];
+  Insn source;
+
+  TableswitchOperand(Insn s,int min, int max, LabelOrOffset def,
+                     LabelOrOffset j[])
+  {
+    this.min = min; this.max = max;
+    dflt = def; jmp = j; source = s;
+  }
+
+  void resolve(ClassEnv e) { return; }
+
+  int size(ClassEnv ce, CodeAttr code)
+    throws jasError
+                                // the *real* reason for making it a
+                                // method..
+  {
+    int sz = 12;                // 4+4+4+jmptable+padding...
+    int source_pc = code.getPc(source);
+    if (((source_pc+1) % 4) != 0)
+      {                         // need padding
+        sz += (4 - ((source_pc+1) % 4));
+      }
+    if (jmp != null)
+      { sz += 4*(jmp.length); }
+    return sz;
+  }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    int pad;
+    int source_pc = ce.getPc(source);
+
+    if (((source_pc+1) % 4) != 0)
+      {                         // need padding
+        pad = (4 - ((source_pc+1) % 4));
+        for (int x=0; x<pad; x++) out.writeByte(0);
+      }
+    dflt.writeWideOffset(ce, source, out);
+    out.writeInt(min);
+    out.writeInt(max);
+    int cnt = jmp.length;
+    for (int x=0; x<cnt; x++)
+      { jmp[x].writeWideOffset(ce, source, out); }
+  }
+}
+
+class OffsetOperand extends InsnOperand {
+  int val;
+  boolean wide;
+  Insn parent;
+
+  OffsetOperand(Insn parent, int val) {
+    this(parent, val, false);
+  }
+
+  OffsetOperand(Insn parent, int val, boolean wide) {
+    this.parent = parent;
+    this.val = val;
+    this.wide = wide;
+  }
+
+  void resolve(ClassEnv e) { return; }
+
+  int size(ClassEnv e, CodeAttr ce) {
+    return wide ? 4 : 2;
+  }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+                              throws IOException, jasError {
+    if(wide)
+      out.writeInt(val);
+    else
+      out.writeShort(val);
+  }
+}
+
+class RelativeOffsetOperand extends InsnOperand {
+  int val;
+  boolean wide;
+  Insn parent;
+
+  RelativeOffsetOperand(Insn parent, int val) {
+    this(parent, val, false);
+  }
+
+  RelativeOffsetOperand(Insn parent, int val, boolean wide) {
+    this.parent = parent;
+    this.val = val;
+    this.wide = wide;
+  }
+
+  void resolve(ClassEnv e) { return; }
+
+  int size(ClassEnv e, CodeAttr ce) {
+    return wide ? 4 : 2;
+  }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+                              throws IOException, jasError {
+    if(wide)
+      out.writeInt(val);
+    else
+      out.writeShort(val);
+  }
+}
+
+/* --- Revision History ---------------------------------------------------
+--- Iouri Kharon, Aug 10 2006
+    Added 'Wide' prefix support to IincOperand and UnsideWideOperand
+*/
diff --git a/jasmin/jasmin-2.4/src/jas/IntegerCP.java b/jasmin/jasmin-2.4/src/jas/IntegerCP.java
new file mode 100644
index 0000000..e064f64
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/IntegerCP.java
@@ -0,0 +1,32 @@
+package jas;
+
+import java.io.*;
+
+
+/**
+ * Wrap an integer constant reference with this CPE.
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+public class IntegerCP extends CP implements RuntimeConstants
+{
+  int val;
+
+  /**
+   * @param n Value for integer constant
+   */
+  public IntegerCP(int n)
+  {
+    uniq = ("Integer: @#$" + n).intern();
+    val = n;
+  }
+  void resolve(ClassEnv e) { return; }
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException
+  {
+    out.writeByte(CONSTANT_INTEGER);
+    out.writeInt(val);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/InterfaceCP.java b/jasmin/jasmin-2.4/src/jas/InterfaceCP.java
new file mode 100644
index 0000000..2566bf9
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/InterfaceCP.java
@@ -0,0 +1,43 @@
+/**
+ * An InterfaceCP is used to refer to an interface specification
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+
+public class InterfaceCP extends CP implements RuntimeConstants
+{
+  ClassCP clazz;
+  NameTypeCP nt;
+
+  /**
+   * @param cname Name of class defining the interface
+   * @param varname symbol for the interface method
+   * @param sig Signature for method
+   */
+  public InterfaceCP(String cname, String varname, String sig)
+  {
+    uniq = (cname + "&%$#&" + varname + "*()#$" + sig).intern();
+    clazz = new ClassCP(cname);
+    nt = new NameTypeCP(varname, sig);
+  }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(clazz);
+    e.addCPItem(nt);
+  }
+    
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeByte(CONSTANT_INTERFACEMETHOD);
+    out.writeShort(e.getCPIndex(clazz));
+    out.writeShort(e.getCPIndex(nt));
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/InvokeinterfaceInsn.java b/jasmin/jasmin-2.4/src/jas/InvokeinterfaceInsn.java
new file mode 100644
index 0000000..4733a34
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/InvokeinterfaceInsn.java
@@ -0,0 +1,21 @@
+/**
+ * Some instructions are perniticky enough that its simpler
+ * to write them separately instead of smushing them with
+ * all the rest. the invokeinterface instruction is one of them.
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+
+public class InvokeinterfaceInsn extends Insn implements RuntimeConstants
+{
+  public InvokeinterfaceInsn(CP cpe, int nargs)
+  {
+    opc = opc_invokeinterface;
+    operand = new InvokeinterfaceOperand(cpe, nargs);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/Label.java b/jasmin/jasmin-2.4/src/jas/Label.java
new file mode 100644
index 0000000..13d6087
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/Label.java
@@ -0,0 +1,73 @@
+/**
+ * Labels are implemented as Insn's, but are special (read
+ * unseemly blobs of hacked up code). First, they don't
+ * actually cause any code to be written, and second, are
+ * identified globally through a String label that is associated
+ * with them when they are created.
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.2 $
+ */
+
+package jas;
+
+import java.io.*;
+
+
+public class Label extends Insn implements RuntimeConstants
+{
+  String id;
+
+  /**
+   * Create a new Label with this tag. Any label with this tag
+   * will be treated as being identical to this one. You can
+   * reuse labels if you like
+   */
+  public Label(String tag)
+  {
+    id = tag.intern();
+    opc = opc_label;
+    operand = null;
+  }
+                                // override the write method to do nothing.
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+  { return; }
+                                // and the size method appropriately
+  int size(ClassEnv e, CodeAttr ce)
+  { return 0; }
+                                // This is called from the LabelOperand
+  void writeOffset(CodeAttr ce, Insn source, DataOutputStream out)
+    throws jasError, IOException
+  {                             // write the offset (as a short)
+                                // of source
+    int pc, tpc;
+    pc = ce.getPc(this);
+    if (source == null)
+      tpc = 0;
+    else
+      tpc = ce.getPc(source);
+    short offset = (short) (pc - tpc);
+    out.writeShort(offset);
+  }
+
+  void writeWideOffset(CodeAttr ce, Insn source, DataOutputStream out)
+     throws IOException, jasError
+  {
+    int pc, tpc;
+    pc = ce.getPc(this);
+    if (source == null)
+      tpc = 0;
+    else
+      tpc = ce.getPc(source);
+    out.writeInt(pc - tpc);
+  }
+
+  public String toString()
+  {
+    return ("Label: " + id);
+  }
+
+// method for StackMapFrame attribute (jdk1.6)
+  int getOffset(CodeAttr ce) throws jasError
+    { return (short)ce.getPc(this); }
+}
+
diff --git a/jasmin/jasmin-2.4/src/jas/LabelOrOffset.java b/jasmin/jasmin-2.4/src/jas/LabelOrOffset.java
new file mode 100644
index 0000000..95f5e31
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/LabelOrOffset.java
@@ -0,0 +1,39 @@
+/*
+ * The purpose of this class is to have a generic type
+ * for labels and offsets, used by tableswitch and lookupswitch
+ *
+ */
+
+package jas;
+
+import java.io.DataOutputStream;
+import java.io.IOException;
+
+public class LabelOrOffset {
+    private Label label;
+    private int offset;
+
+    public LabelOrOffset(Label l) {
+        label = l;
+    }
+
+    public LabelOrOffset(int o) {
+        offset = o;
+    }
+
+    Label getLabel() {
+        return label;
+    }
+
+    int getOffset() {
+        return offset;
+    }
+
+    void writeWideOffset(CodeAttr ce, Insn source, DataOutputStream out)
+                                            throws jasError, IOException {
+        if(label!=null)
+            label.writeWideOffset(ce, source, out);
+        else
+            out.writeInt(offset);
+    }
+}
\ No newline at end of file
diff --git a/jasmin/jasmin-2.4/src/jas/LineTableAttr.java b/jasmin/jasmin-2.4/src/jas/LineTableAttr.java
new file mode 100644
index 0000000..5857ca4
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/LineTableAttr.java
@@ -0,0 +1,67 @@
+/**
+ * Line number table attributes are embedded into Code attributes
+ * and used for further debugging information.
+ * @see CodeAttr#setLineTable
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.*;
+
+public class LineTableAttr
+{
+  static final CP attr = new AsciiCP("LineNumberTable");
+
+  Vector line, pc;
+
+  /**
+   * Note: A line table is associated with a <em>method</em>, so you
+   * need to create a new LineTableAttr for each method for which you add
+   * debugging information.
+   * @see CodeAttr#setLineTable
+   */
+  public LineTableAttr()
+  { line = new Vector(); pc = new Vector(); }
+
+  /**
+   * Add a pc to line number entry to the line table.
+   * @param l to the location in the class file
+   * @param line Corresponding line number in the source file
+   */
+
+  public void addEntry(Label l, int line)
+  {
+    pc.addElement(l);
+    this.line.addElement(new Integer(line));
+  }
+
+  void resolve(ClassEnv e)
+  { e.addCPItem(attr); }
+
+  int size()
+  { return	
+      (2 +			// name_idx
+       4 +			// attr_len
+       2 +			// line table len spec
+       4*(pc.size()));		// table
+  }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    out.writeInt(2 + 4*(pc.size()));
+    out.writeShort(pc.size());
+    for (Enumeration en = pc.elements(), ien = line.elements();
+	 en.hasMoreElements();)
+      {
+	Label l = (Label)(en.nextElement());
+	Integer i = (Integer)(ien.nextElement());
+	l.writeOffset(ce, null, out);
+	out.writeShort((int) i.intValue());
+      }
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/LocalVarEntry.java b/jasmin/jasmin-2.4/src/jas/LocalVarEntry.java
new file mode 100644
index 0000000..666b9dc
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/LocalVarEntry.java
@@ -0,0 +1,96 @@
+/**
+ * This is an entry to be used as part of a LocalVarTableAttr and LocalVarTypeTable.
+ * It defines the scope and location of a local variable for a method
+ * and is used while debugging.
+ */
+
+package jas;
+
+import java.io.*;
+
+public class LocalVarEntry
+{
+  Label start, end;
+  CP name, sig;
+  int slot, starto, endo;
+
+  /**
+   * Create local variable scope information that can be used
+   * while debugging.
+   * @param startLabel beginning of scope for variable
+   * @param endLabel   end of scope for variable
+   * @param name       name of variable
+   * @param sig        signature for variable
+   * @param slot       index of the local variable in the local variables
+   *                   registers of the VM where its value can be found
+   */
+  public LocalVarEntry
+  (Label startLabel, Label endLabel, String name, String sig, int slot)
+  {
+    start = startLabel;
+    end = endLabel;
+    this.name = new AsciiCP(name);
+    this.sig = new AsciiCP(sig);
+    this.slot = slot;
+  }
+
+  /**
+   * Create local variable scope information that can be used
+   * while debugging.
+   * @param startOffset beginning of scope for variable
+   * @param endOffset   end of scope for variable
+   * @param name        name of variable
+   * @param sig         signature for variable
+   * @param slot        index of the local variable in the local variables
+   *                    registers of the VM where its value can be found
+   */
+  public LocalVarEntry
+  (int startOffset, int endOffset, String name, String sig, int slot)
+  {
+    starto = startOffset;
+    endo = endOffset;
+    this.name = new AsciiCP(name);
+    this.sig = new AsciiCP(sig);
+    this.slot = slot;
+  }
+
+  /**
+   * Create local variable scope information that can be used
+   * while debugging.
+   * @param startLabel beginning of scope for variable
+   * @param endLabel   end of scope for variable
+   * @param name       CP to be associated as name of variable
+   * @param sig        CP to be associated as signature for variable
+   * @param slot       The index of the local variable in the local
+   *                   variables part of the VM where its value can be found
+   */
+  public LocalVarEntry
+  (Label startLabel, Label endLabel, CP name, CP sig, int slot)
+  {
+    start = startLabel;
+    end = endLabel;
+    this.name = name;
+    this.sig = sig;
+    this.slot = slot;
+  }
+
+  void resolve(ClassEnv e)
+  { e.addCPItem(name); e.addCPItem(sig); }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    if(start!=null && end!=null) {
+        start.writeOffset(ce, null, out);
+        end.writeOffset(ce, start, out); // This is the *length*,
+				// not another offset
+    } else {
+        out.writeShort(starto);
+        out.writeShort(endo - starto);
+    }
+
+    out.writeShort(e.getCPIndex(name));
+    out.writeShort(e.getCPIndex(sig));
+    out.writeShort((short)slot);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/LocalVarTableAttr.java b/jasmin/jasmin-2.4/src/jas/LocalVarTableAttr.java
new file mode 100644
index 0000000..dae0acb
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/LocalVarTableAttr.java
@@ -0,0 +1,69 @@
+/**
+ * Local variable table attributes are embedded into Code attributes
+ * and used for further debugging information.
+ * @see CodeAttr#setLocalVar
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.*;
+
+public class LocalVarTableAttr
+{
+  static final CP attr = new AsciiCP("LocalVariableTable");
+
+  Vector vars;
+
+
+  /**
+   * Note: A local var is associated with a <em>method</em>, so you
+   * need to create a new LocalVarTableAttr for each method for which you add
+   * debugging information.
+   * @see CodeAttr#setLocalVarTable
+   */
+  public LocalVarTableAttr()
+  { vars = new Vector(); }
+
+  /**
+   * Add a LocalVar Entry to the attribute
+   * @param e Local variable Entry to be added to the table
+   */
+
+  public void addEntry(LocalVarEntry e)
+  { vars.addElement(e); }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(attr);
+
+    for (Enumeration en = vars.elements(); en.hasMoreElements();)
+      {
+        LocalVarEntry lv = (LocalVarEntry)(en.nextElement());
+        lv.resolve(e);
+      }
+  }
+
+  int size()
+  { return      
+      (2 +                      // name_idx
+       4 +                      // attr_len
+       2 +                      // line table len spec
+       10*(vars.size()));       // table
+  }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    out.writeInt(2 + 10*(vars.size()));
+    out.writeShort(vars.size());
+    for (Enumeration en = vars.elements(); en.hasMoreElements();)
+      {
+	LocalVarEntry lv = (LocalVarEntry)(en.nextElement());
+	lv.write(e, ce, out);
+      }
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/LocalVarTypeTableAttr.java b/jasmin/jasmin-2.4/src/jas/LocalVarTypeTableAttr.java
new file mode 100644
index 0000000..df5f0cb
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/LocalVarTypeTableAttr.java
@@ -0,0 +1,69 @@
+/**
+ * Local variable type table attributes are embedded into Code attributes
+ * and used for further debugging information.
+ * @see CodeAttr#setLocalVar
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.*;
+
+public class LocalVarTypeTableAttr
+{
+  static final CP attr = new AsciiCP("LocalVariableTypeTable");
+
+  Vector vars;
+
+
+  /**
+   * Note: A local var type is associated with a <em>method</em>, so you
+   * need to create a new LocalVarTypeTableAttr for each method for which you add
+   * debugging information.
+   * @see CodeAttr#setLocalVarTypeTable
+   */
+  public LocalVarTypeTableAttr()
+  { vars = new Vector(); }
+
+  /**
+   * Add a LocalVar Entry to the attribute
+   * @param e Local variable Entry to be added to the table
+   */
+
+  public void addEntry(LocalVarEntry e)
+  { vars.addElement(e); }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(attr);
+
+    for (Enumeration en = vars.elements(); en.hasMoreElements();)
+      {
+        LocalVarEntry lv = (LocalVarEntry)(en.nextElement());
+        lv.resolve(e);
+      }
+  }
+
+  int size()
+  { return      
+      (2 +                      // name_idx
+       4 +                      // attr_len
+       2 +                      // line table len spec
+       10*(vars.size()));       // table
+  }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    out.writeInt(2 + 10*(vars.size()));
+    out.writeShort(vars.size());
+    for (Enumeration en = vars.elements(); en.hasMoreElements();)
+      {
+	LocalVarEntry lv = (LocalVarEntry)(en.nextElement());
+	lv.write(e, ce, out);
+      }
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/LongCP.java b/jasmin/jasmin-2.4/src/jas/LongCP.java
new file mode 100644
index 0000000..ffeee29
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/LongCP.java
@@ -0,0 +1,32 @@
+package jas;
+
+import java.io.*;
+
+
+/**
+ * Wrap an Long constant reference with this CPE.
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+public class LongCP extends CP implements RuntimeConstants
+{
+  long val;
+
+  /**
+   * @param n Value for Long constant
+   */
+  public LongCP(long n)
+  {
+    uniq = ("Long: @#$" + n).intern();
+    val = n;
+  }
+  void resolve(ClassEnv e) { return; }
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException
+  {
+    out.writeByte(CONSTANT_LONG);
+    out.writeLong(val);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/LookupswitchInsn.java b/jasmin/jasmin-2.4/src/jas/LookupswitchInsn.java
new file mode 100644
index 0000000..70dc88f
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/LookupswitchInsn.java
@@ -0,0 +1,27 @@
+/**
+ * Some instructions are perniticky enough that its simpler
+ * to write them separately instead of smushing them with
+ * all the rest. The lookupswitch instruction is one of them.
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+
+public class LookupswitchInsn extends Insn implements RuntimeConstants
+{
+  /**
+   * @param def default Label for switch
+   * @param match array of match values for switch
+   * @param target Label array of corresponding targets for each match
+   */
+
+  public LookupswitchInsn(LabelOrOffset def, int match[],
+                                    LabelOrOffset target[]) {
+    opc = opc_lookupswitch;
+    operand = new LookupswitchOperand(this, def, match, target);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/Method.java b/jasmin/jasmin-2.4/src/jas/Method.java
new file mode 100644
index 0000000..a98b407
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/Method.java
@@ -0,0 +1,157 @@
+/**
+ * This is used to encapsulate a CodeAttr so it can be added
+ * into a class.
+ * @see ClassEnv#addMethod
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+package jas;
+
+import java.io.*;
+import java.util.Vector;
+import java.util.Enumeration;
+
+public class Method
+{
+  short acc;
+  CP name, desc;
+  CodeAttr code;
+  ExceptAttr excepts;
+  SignatureAttr sig;
+  DeprecatedAttr depr;
+  AnnotationAttr annVis, annInvis;
+  AnnotParamAttr annParamVis, annParamInvis;
+  AnnotDefAttr annDef;
+  Vector generic;
+  /**
+   * @param macc method access permissions. It is a combination
+   * of the constants provided from RuntimeConstants
+   * @param name CP item representing name of method.
+   * @param desc CP item representing descnature for object
+   */
+  public Method (short macc, AsciiCP name, AsciiCP desc)
+  {
+    acc = macc;
+    this.name = name;
+    this.desc = desc;
+    sig = null;
+    code = null;
+    excepts = null;
+    depr = null;
+    annVis = annInvis = null;
+    annParamVis = annParamInvis = null;
+    annDef = null;
+    generic = new Vector();
+  }
+
+  public void setCode(CodeAttr cd, ExceptAttr ex)
+  { code = cd; excepts = ex; }
+
+  public void setSignature(SignatureAttr sig)
+  { this.sig = sig; }
+
+  public void setDeprecated(DeprecatedAttr depr)
+  { this.depr = depr; }
+
+  /**
+   * Add a generic attribute to the method. A generic attribute
+   * contains a stream of uninterpreted bytes which is ignored by
+   * the VM (as long as its name doesn't conflict with other names
+   * for attributes that are understood by the VM)
+   */
+  public void addGenericAttr(GenericAttr g)
+  { generic.addElement(g); }
+
+  /*
+   * procedure group for annotation description
+  */
+  public Annotation addAnnotation(boolean visible, String clsname)
+  {
+    Annotation ann = new Annotation(clsname);
+    AnnotationAttr aa = visible ? annVis : annInvis;
+    if(aa == null) {
+      aa = new AnnotationAttr(visible);
+      if(visible) annVis = aa;
+      else annInvis = aa;
+    }
+    aa.add(ann);
+    return(ann);
+  }
+
+  public Annotation addAnnotation(boolean visible, String clsname, int paramnum)
+    throws jasError
+  {
+    if(paramnum <= 0 || paramnum >= 256)
+      throw new jasError("annotation parameter number can be in range 1-256", true);
+    Annotation ann = new Annotation(clsname);
+    AnnotParamAttr aa = visible ? annParamVis : annParamInvis;
+    if(aa == null) {
+      aa = new AnnotParamAttr(visible);
+      if(visible) annParamVis = aa;
+      else annParamInvis = aa;
+    }
+    aa.add(ann, paramnum-1);
+    return(ann);
+  }
+
+  public Annotation addAnnotation() throws jasError
+  {
+    if(annDef != null) Annotation.ParserError();
+    annDef = new AnnotDefAttr();
+    return(annDef.get());
+  }
+
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(name);
+    e.addCPItem(desc);
+    if (code != null)  code.resolve(e);
+    if (excepts != null)  excepts.resolve(e);
+    if (sig != null)  sig.resolve(e);
+    if (depr != null) depr.resolve(e);
+    if (annVis != null) annVis.resolve(e);
+    if (annInvis != null) annInvis.resolve(e);
+    if (annParamVis != null) annParamVis.resolve(e);
+    if (annParamInvis != null) annParamInvis.resolve(e);
+    if (annDef != null) annDef.resolve(e);
+    for (Enumeration gen = generic.elements(); gen.hasMoreElements();)
+    {
+      GenericAttr gattr = (GenericAttr)gen.nextElement();
+      gattr.resolve(e);
+    }
+  }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    short cnt = (short)generic.size();
+    out.writeShort(acc);
+    out.writeShort(e.getCPIndex(name));
+    out.writeShort(e.getCPIndex(desc));
+    if (code != null) cnt++;
+    if (excepts != null) cnt++;
+    if (sig != null) cnt++;
+    if (depr != null) cnt++;
+    if (annVis != null) cnt++;
+    if (annInvis != null) cnt++;
+    if (annParamVis != null) cnt++;
+    if (annParamInvis != null) cnt++;
+    if (annDef != null) cnt++;
+    out.writeShort(cnt);
+    if (code != null) code.write(e, out);
+    if (excepts != null) excepts.write(e, out);
+    if (sig != null) sig.write(e, out);
+    if (depr != null) depr.write(e, out);
+    if (annVis != null) annVis.write(e, out);
+    if (annInvis != null) annInvis.write(e, out);
+    if (annParamVis != null) annParamVis.write(e, out);
+    if (annParamInvis != null) annParamInvis.write(e, out);
+    if (annDef != null) annDef.write(e, out);
+    for (Enumeration gen = generic.elements(); gen.hasMoreElements();)
+    {
+      GenericAttr gattr = (GenericAttr)gen.nextElement();
+      gattr.write(e, out);
+    }
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/MethodCP.java b/jasmin/jasmin-2.4/src/jas/MethodCP.java
new file mode 100644
index 0000000..b712e74
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/MethodCP.java
@@ -0,0 +1,42 @@
+/**
+ * MethodCP's are used to make references to methods in classes
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+import java.io.*;
+
+
+public class MethodCP extends CP implements RuntimeConstants
+{
+  ClassCP clazz;
+  NameTypeCP nt;
+
+  /**
+   * @param cname Class in which method exists
+   * @param varname name of method
+   * @param sig Signature of method
+   */
+  public MethodCP(String cname, String varname, String sig)
+  {
+    uniq = cname + "&%$91&" + varname + "*(012$" + sig;
+    clazz = new ClassCP(cname);
+    nt = new NameTypeCP(varname, sig);
+  }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(clazz);
+    e.addCPItem(nt);
+  }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeByte(CONSTANT_METHOD);
+    out.writeShort(e.getCPIndex(clazz));
+    out.writeShort(e.getCPIndex(nt));
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/MultiarrayInsn.java b/jasmin/jasmin-2.4/src/jas/MultiarrayInsn.java
new file mode 100644
index 0000000..7e0fcc6
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/MultiarrayInsn.java
@@ -0,0 +1,25 @@
+/**
+ * Some instructions are perniticky enough that its simpler
+ * to write them separately instead of smushing them with
+ * all the rest. the multiarray instruction is one of them.
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+
+public class MultiarrayInsn extends Insn implements RuntimeConstants
+{
+  /**
+   * @param cpe CP item for the array type
+   * @param sz number of dimensions for the array
+   */
+  public MultiarrayInsn(CP cpe, int sz)
+  {
+    opc = opc_multianewarray;
+    operand = new MultiarrayOperand(cpe, sz);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/NameTypeCP.java b/jasmin/jasmin-2.4/src/jas/NameTypeCP.java
new file mode 100644
index 0000000..34ac4bc
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/NameTypeCP.java
@@ -0,0 +1,44 @@
+/**
+ * Create a name/type entry constant pool entry
+ * 
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+
+public class NameTypeCP extends CP implements RuntimeConstants
+{
+  AsciiCP name, sig;
+
+  /**
+   * Name/type entries are used to specify the type associated
+   * with a symbol name.
+   *
+   * @param name Name of symbol
+   * @param sig Signature of symbol
+   */
+  public NameTypeCP(String name, String sig)
+  {
+    uniq = ("NT : @#$%" + name + "SD#$"+ sig).intern();
+    this.name = new AsciiCP(name);
+    this.sig = new AsciiCP(sig);
+  }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(name);
+    e.addCPItem(sig);
+  }
+    
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeByte(CONSTANT_NAMEANDTYPE);
+    out.writeShort(e.getCPIndex(name));
+    out.writeShort(e.getCPIndex(sig));
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/RuntimeConstants.java b/jasmin/jasmin-2.4/src/jas/RuntimeConstants.java
new file mode 100644
index 0000000..5d11f7e
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/RuntimeConstants.java
@@ -0,0 +1,333 @@
+
+/* Constants used in JVM class files */
+
+package jas;
+
+public interface RuntimeConstants {
+
+    // top-level constants
+    public static final int JAVA_MAGIC = -889275714;
+    public static final int JAVA_VERSION = 45;
+    public static final int JAVA_MINOR_VERSION = 3;
+
+    // constant pool entry types
+    public static final int CONSTANT_UTF8 = 1;
+    public static final int CONSTANT_UNICODE = 2;
+    public static final int CONSTANT_INTEGER = 3;
+    public static final int CONSTANT_FLOAT = 4;
+    public static final int CONSTANT_LONG = 5;
+    public static final int CONSTANT_DOUBLE = 6;
+    public static final int CONSTANT_CLASS = 7;
+    public static final int CONSTANT_STRING = 8;
+    public static final int CONSTANT_FIELD = 9;
+    public static final int CONSTANT_METHOD = 10;
+    public static final int CONSTANT_INTERFACEMETHOD = 11;
+    public static final int CONSTANT_NAMEANDTYPE = 12;
+
+    // access flags
+    public static final int ACC_PUBLIC       = 0x0001;
+    public static final int ACC_PRIVATE      = 0x0002;
+    public static final int ACC_PROTECTED    = 0x0004;
+    public static final int ACC_STATIC       = 0x0008;
+    public static final int ACC_FINAL        = 0x0010;
+    public static final int ACC_SYNCHRONIZED = 0x0020; // method
+    public static final int ACC_SUPER        = 0x0020; // class(auto)
+    public static final int ACC_VOLATILE     = 0x0040; // field
+    public static final int ACC_BRIDGE       = 0x0040; // method
+    public static final int ACC_TRANSIENT    = 0x0080; // field
+    public static final int ACC_VARARGS      = 0x0080; // method
+    public static final int ACC_NATIVE       = 0x0100;
+    public static final int ACC_INTERFACE    = 0x0200;
+    public static final int ACC_ABSTRACT     = 0x0400;
+    public static final int ACC_STRICT       = 0x0800;
+    public static final int ACC_SYNTHETIC    = 0x1000;
+    public static final int ACC_ANNOTATION   = 0x2000;
+    public static final int ACC_ENUM         = 0x4000;
+
+    // types for newarray
+    public static final int T_CLASS = 2;
+    public static final int T_BOOLEAN = 4;
+    public static final int T_CHAR = 5;
+    public static final int T_FLOAT = 6;
+    public static final int T_DOUBLE = 7;
+    public static final int T_BYTE = 8;
+    public static final int T_SHORT = 9;
+    public static final int T_INT = 10;
+    public static final int T_LONG = 11;
+
+    // opcodes
+    public static final int opc_try = -3;
+    public static final int opc_dead = -2;
+    public static final int opc_label = -1;
+    public static final int opc_nop = 0;
+    public static final int opc_aconst_null = 1;
+    public static final int opc_iconst_m1 = 2;
+    public static final int opc_iconst_0 = 3;
+    public static final int opc_iconst_1 = 4;
+    public static final int opc_iconst_2 = 5;
+    public static final int opc_iconst_3 = 6;
+    public static final int opc_iconst_4 = 7;
+    public static final int opc_iconst_5 = 8;
+    public static final int opc_lconst_0 = 9;
+    public static final int opc_lconst_1 = 10;
+    public static final int opc_fconst_0 = 11;
+    public static final int opc_fconst_1 = 12;
+    public static final int opc_fconst_2 = 13;
+    public static final int opc_dconst_0 = 14;
+    public static final int opc_dconst_1 = 15;
+    public static final int opc_bipush = 16;
+    public static final int opc_sipush = 17;
+    public static final int opc_ldc = 18;
+    public static final int opc_ldc_w = 19;
+    public static final int opc_ldc2_w = 20;
+    public static final int opc_iload = 21;
+    public static final int opc_lload = 22;
+    public static final int opc_fload = 23;
+    public static final int opc_dload = 24;
+    public static final int opc_aload = 25;
+    public static final int opc_iload_0 = 26;
+    public static final int opc_iload_1 = 27;
+    public static final int opc_iload_2 = 28;
+    public static final int opc_iload_3 = 29;
+    public static final int opc_lload_0 = 30;
+    public static final int opc_lload_1 = 31;
+    public static final int opc_lload_2 = 32;
+    public static final int opc_lload_3 = 33;
+    public static final int opc_fload_0 = 34;
+    public static final int opc_fload_1 = 35;
+    public static final int opc_fload_2 = 36;
+    public static final int opc_fload_3 = 37;
+    public static final int opc_dload_0 = 38;
+    public static final int opc_dload_1 = 39;
+    public static final int opc_dload_2 = 40;
+    public static final int opc_dload_3 = 41;
+    public static final int opc_aload_0 = 42;
+    public static final int opc_aload_1 = 43;
+    public static final int opc_aload_2 = 44;
+    public static final int opc_aload_3 = 45;
+    public static final int opc_iaload = 46;
+    public static final int opc_laload = 47;
+    public static final int opc_faload = 48;
+    public static final int opc_daload = 49;
+    public static final int opc_aaload = 50;
+    public static final int opc_baload = 51;
+    public static final int opc_caload = 52;
+    public static final int opc_saload = 53;
+    public static final int opc_istore = 54;
+    public static final int opc_lstore = 55;
+    public static final int opc_fstore = 56;
+    public static final int opc_dstore = 57;
+    public static final int opc_astore = 58;
+    public static final int opc_istore_0 = 59;
+    public static final int opc_istore_1 = 60;
+    public static final int opc_istore_2 = 61;
+    public static final int opc_istore_3 = 62;
+    public static final int opc_lstore_0 = 63;
+    public static final int opc_lstore_1 = 64;
+    public static final int opc_lstore_2 = 65;
+    public static final int opc_lstore_3 = 66;
+    public static final int opc_fstore_0 = 67;
+    public static final int opc_fstore_1 = 68;
+    public static final int opc_fstore_2 = 69;
+    public static final int opc_fstore_3 = 70;
+    public static final int opc_dstore_0 = 71;
+    public static final int opc_dstore_1 = 72;
+    public static final int opc_dstore_2 = 73;
+    public static final int opc_dstore_3 = 74;
+    public static final int opc_astore_0 = 75;
+    public static final int opc_astore_1 = 76;
+    public static final int opc_astore_2 = 77;
+    public static final int opc_astore_3 = 78;
+    public static final int opc_iastore = 79;
+    public static final int opc_lastore = 80;
+    public static final int opc_fastore = 81;
+    public static final int opc_dastore = 82;
+    public static final int opc_aastore = 83;
+    public static final int opc_bastore = 84;
+    public static final int opc_castore = 85;
+    public static final int opc_sastore = 86;
+    public static final int opc_pop = 87;
+    public static final int opc_pop2 = 88;
+    public static final int opc_dup = 89;
+    public static final int opc_dup_x1 = 90;
+    public static final int opc_dup_x2 = 91;
+    public static final int opc_dup2 = 92;
+    public static final int opc_dup2_x1 = 93;
+    public static final int opc_dup2_x2 = 94;
+    public static final int opc_swap = 95;
+    public static final int opc_iadd = 96;
+    public static final int opc_ladd = 97;
+    public static final int opc_fadd = 98;
+    public static final int opc_dadd = 99;
+    public static final int opc_isub = 100;
+    public static final int opc_lsub = 101;
+    public static final int opc_fsub = 102;
+    public static final int opc_dsub = 103;
+    public static final int opc_imul = 104;
+    public static final int opc_lmul = 105;
+    public static final int opc_fmul = 106;
+    public static final int opc_dmul = 107;
+    public static final int opc_idiv = 108;
+    public static final int opc_ldiv = 109;
+    public static final int opc_fdiv = 110;
+    public static final int opc_ddiv = 111;
+    public static final int opc_irem = 112;
+    public static final int opc_lrem = 113;
+    public static final int opc_frem = 114;
+    public static final int opc_drem = 115;
+    public static final int opc_ineg = 116;
+    public static final int opc_lneg = 117;
+    public static final int opc_fneg = 118;
+    public static final int opc_dneg = 119;
+    public static final int opc_ishl = 120;
+    public static final int opc_lshl = 121;
+    public static final int opc_ishr = 122;
+    public static final int opc_lshr = 123;
+    public static final int opc_iushr = 124;
+    public static final int opc_lushr = 125;
+    public static final int opc_iand = 126;
+    public static final int opc_land = 127;
+    public static final int opc_ior = 128;
+    public static final int opc_lor = 129;
+    public static final int opc_ixor = 130;
+    public static final int opc_lxor = 131;
+    public static final int opc_iinc = 132;
+    public static final int opc_i2l = 133;
+    public static final int opc_i2f = 134;
+    public static final int opc_i2d = 135;
+    public static final int opc_l2i = 136;
+    public static final int opc_l2f = 137;
+    public static final int opc_l2d = 138;
+    public static final int opc_f2i = 139;
+    public static final int opc_f2l = 140;
+    public static final int opc_f2d = 141;
+    public static final int opc_d2i = 142;
+    public static final int opc_d2l = 143;
+    public static final int opc_d2f = 144;
+    public static final int opc_i2b = 145;
+    public static final int opc_i2c = 146;
+    public static final int opc_i2s = 147;
+    public static final int opc_lcmp = 148;
+    public static final int opc_fcmpl = 149;
+    public static final int opc_fcmpg = 150;
+    public static final int opc_dcmpl = 151;
+    public static final int opc_dcmpg = 152;
+    public static final int opc_ifeq = 153;
+    public static final int opc_ifne = 154;
+    public static final int opc_iflt = 155;
+    public static final int opc_ifge = 156;
+    public static final int opc_ifgt = 157;
+    public static final int opc_ifle = 158;
+    public static final int opc_if_icmpeq = 159;
+    public static final int opc_if_icmpne = 160;
+    public static final int opc_if_icmplt = 161;
+    public static final int opc_if_icmpge = 162;
+    public static final int opc_if_icmpgt = 163;
+    public static final int opc_if_icmple = 164;
+    public static final int opc_if_acmpeq = 165;
+    public static final int opc_if_acmpne = 166;
+    public static final int opc_goto = 167;
+    public static final int opc_jsr = 168;
+    public static final int opc_ret = 169;
+    public static final int opc_tableswitch = 170;
+    public static final int opc_lookupswitch = 171;
+    public static final int opc_ireturn = 172;
+    public static final int opc_lreturn = 173;
+    public static final int opc_freturn = 174;
+    public static final int opc_dreturn = 175;
+    public static final int opc_areturn = 176;
+    public static final int opc_return = 177;
+    public static final int opc_getstatic = 178;
+    public static final int opc_putstatic = 179;
+    public static final int opc_getfield = 180;
+    public static final int opc_putfield = 181;
+    public static final int opc_invokevirtual = 182;
+    public static final int opc_invokespecial = 183;
+    public static final int opc_invokestatic = 184;
+    public static final int opc_invokeinterface = 185;
+    public static final int opc_invokedynamic = 186;
+    public static final int opc_new = 187;
+    public static final int opc_newarray = 188;
+    public static final int opc_anewarray = 189;
+    public static final int opc_arraylength = 190;
+    public static final int opc_athrow = 191;
+    public static final int opc_checkcast = 192;
+    public static final int opc_instanceof = 193;
+    public static final int opc_monitorenter = 194;
+    public static final int opc_monitorexit = 195;
+    public static final int opc_wide = 196;
+    public static final int opc_multianewarray = 197;
+    public static final int opc_ifnull = 198;
+    public static final int opc_ifnonnull = 199;
+    public static final int opc_goto_w = 200;
+    public static final int opc_jsr_w = 201;
+    public static final int opc_breakpoint = 202;
+    // for backwards compatibility with 1.0
+    public static final int opc_int2byte = opc_i2b;
+    public static final int opc_int2char = opc_i2c;
+    public static final int opc_int2short = opc_i2s;
+    public static final int opc_invokenonvirtual = opc_invokespecial;
+
+    // names of opcodes
+    public static final String opcNames[] = {
+        "opc_nop", "opc_aconst_null", "opc_iconst_m1", "opc_iconst_0",
+        "opc_iconst_1", "opc_iconst_2", "opc_iconst_3", "opc_iconst_4",
+        "opc_iconst_5", "opc_lconst_0", "opc_lconst_1", "opc_fconst_0",
+        "opc_fconst_1", "opc_fconst_2", "opc_dconst_0", "opc_dconst_1",
+        "opc_bipush", "opc_sipush", "opc_ldc", "opc_ldc_w", "opc_ldc2_w",
+        "opc_iload", "opc_lload", "opc_fload", "opc_dload", "opc_aload",
+        "opc_iload_0", "opc_iload_1", "opc_iload_2", "opc_iload_3",
+        "opc_lload_0", "opc_lload_1", "opc_lload_2", "opc_lload_3",
+        "opc_fload_0", "opc_fload_1", "opc_fload_2", "opc_fload_3",
+        "opc_dload_0", "opc_dload_1", "opc_dload_2", "opc_dload_3",
+        "opc_aload_0", "opc_aload_1", "opc_aload_2", "opc_aload_3",
+        "opc_iaload", "opc_laload", "opc_faload", "opc_daload", "opc_aaload",
+        "opc_baload", "opc_caload", "opc_saload", "opc_istore", "opc_lstore",
+        "opc_fstore", "opc_dstore", "opc_astore", "opc_istore_0",
+        "opc_istore_1", "opc_istore_2", "opc_istore_3", "opc_lstore_0",
+        "opc_lstore_1", "opc_lstore_2", "opc_lstore_3", "opc_fstore_0",
+        "opc_fstore_1", "opc_fstore_2", "opc_fstore_3", "opc_dstore_0",
+        "opc_dstore_1", "opc_dstore_2", "opc_dstore_3", "opc_astore_0",
+        "opc_astore_1", "opc_astore_2", "opc_astore_3", "opc_iastore",
+        "opc_lastore", "opc_fastore", "opc_dastore", "opc_aastore",
+        "opc_bastore", "opc_castore", "opc_sastore", "opc_pop", "opc_pop2",
+        "opc_dup", "opc_dup_x1", "opc_dup_x2", "opc_dup2", "opc_dup2_x1",
+        "opc_dup2_x2", "opc_swap", "opc_iadd", "opc_ladd", "opc_fadd",
+        "opc_dadd", "opc_isub", "opc_lsub", "opc_fsub", "opc_dsub",
+        "opc_imul", "opc_lmul", "opc_fmul", "opc_dmul", "opc_idiv",
+        "opc_ldiv", "opc_fdiv", "opc_ddiv", "opc_irem", "opc_lrem",
+        "opc_frem", "opc_drem", "opc_ineg", "opc_lneg", "opc_fneg",
+        "opc_dneg", "opc_ishl", "opc_lshl", "opc_ishr", "opc_lshr",
+        "opc_iushr", "opc_lushr", "opc_iand", "opc_land", "opc_ior",
+        "opc_lor", "opc_ixor", "opc_lxor", "opc_iinc", "opc_i2l", "opc_i2f",
+        "opc_i2d", "opc_l2i", "opc_l2f", "opc_l2d", "opc_f2i", "opc_f2l",
+        "opc_f2d", "opc_d2i", "opc_d2l", "opc_d2f", "opc_i2b", "opc_i2c",
+        "opc_i2s", "opc_lcmp", "opc_fcmpl", "opc_fcmpg", "opc_dcmpl",
+        "opc_dcmpg", "opc_ifeq", "opc_ifne", "opc_iflt", "opc_ifge",
+        "opc_ifgt", "opc_ifle", "opc_if_icmpeq", "opc_if_icmpne",
+        "opc_if_icmplt", "opc_if_icmpge", "opc_if_icmpgt", "opc_if_icmple",
+        "opc_if_acmpeq", "opc_if_acmpne", "opc_goto", "opc_jsr", "opc_ret",
+        "opc_tableswitch", "opc_lookupswitch", "opc_ireturn", "opc_lreturn",
+        "opc_freturn", "opc_dreturn", "opc_areturn", "opc_return",
+        "opc_getstatic", "opc_putstatic", "opc_getfield", "opc_putfield",
+        "opc_invokevirtual", "opc_invokespecial", "opc_invokestatic",
+        "opc_invokeinterface", "opc_invokedynamic", "opc_new", "opc_newarray",
+        "opc_anewarray", "opc_arraylength", "opc_athrow", "opc_checkcast",
+        "opc_instanceof", "opc_monitorenter", "opc_monitorexit", "opc_wide",
+        "opc_multianewarray", "opc_ifnull", "opc_ifnonnull", "opc_goto_w",
+        "opc_jsr_w", "opc_breakpoint"
+    };
+
+    // and their lengths
+    static final int opcLengths[] = {
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 3, 3, 2, 2,
+        2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1,
+        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 3, 3, 3, 3, 3, 3, 3,
+        3, 3, 3, 3, 3, 3, 3, 3, 2, 99, 99, 1, 1, 1, 1, 1, 1, 3, 3, 3, 3, 3, 3,
+        3, 5, 3, 3, 2, 3, 1, 1, 3, 3, 1, 1, 0, 4, 3, 3, 5, 5, 1
+    };
+}
diff --git a/jasmin/jasmin-2.4/src/jas/SignatureAttr.java b/jasmin/jasmin-2.4/src/jas/SignatureAttr.java
new file mode 100644
index 0000000..cf114a8
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/SignatureAttr.java
@@ -0,0 +1,46 @@
+/**
+ * This attribute is used to represent the signature of a class, 
+ * field or method
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+public class SignatureAttr
+{
+  static final CP attr = new AsciiCP("Signature");
+
+  CP signature;
+
+  /**
+   * Create a Signature attribute.
+   * @param signature The signature of the class, field or method
+   * @see ClassEnv#setSignature
+   */
+
+  public SignatureAttr(String signature)
+  { this.signature = new AsciiCP(signature); }
+
+  /**
+   * Create a signature attribute, with more control over attribute name
+   * @param signature CP to be associated as the signature or the attribute
+   * @see ClassEnv#setSignature
+   */
+  public SignatureAttr(CP signature)
+  { this.signature = signature; }
+
+  void resolve(ClassEnv e)
+  { e.addCPItem(attr); e.addCPItem(signature); }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    out.writeInt(2);
+    out.writeShort(e.getCPIndex(signature));
+  }
+}
+
diff --git a/jasmin/jasmin-2.4/src/jas/SourceAttr.java b/jasmin/jasmin-2.4/src/jas/SourceAttr.java
new file mode 100644
index 0000000..7704dd4
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/SourceAttr.java
@@ -0,0 +1,46 @@
+/**
+ * This attribute is used to embed Source file information into
+ * a class file.
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+public class SourceAttr
+{
+  static final CP attr = new AsciiCP("SourceFile");
+
+  CP name;
+
+  /**
+   * Create a source file attribute.
+   * @param name Name of the source file
+   * @see ClassEnv#setSource
+   */
+
+  public SourceAttr(String name)
+  { this.name = new AsciiCP(name); }
+
+  /**
+   * Create a source file attribute, with more control over attribute name
+   * @param name CP to be associated as the name of the source file
+   * @see ClassEnv#setSource
+   */
+  public SourceAttr(CP name)
+  { this.name = name; }
+
+  void resolve(ClassEnv e)
+  { e.addCPItem(attr); e.addCPItem(name); }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+    out.writeInt(2);
+    out.writeShort(e.getCPIndex(name));
+  }
+}
+
diff --git a/jasmin/jasmin-2.4/src/jas/SourceDebugExtensionAttr.java b/jasmin/jasmin-2.4/src/jas/SourceDebugExtensionAttr.java
new file mode 100644
index 0000000..ca68a15
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/SourceDebugExtensionAttr.java
@@ -0,0 +1,48 @@
+/**
+ * This attribute is used to embed extended debug information
+ * @author $Author: Daniel Reynaud $
+ * @version $Revision: 1.0 $
+ */
+
+package jas;
+
+import java.io.*;
+
+public class SourceDebugExtensionAttr
+{
+  static final CP attr = new AsciiCP("SourceDebugExtension");
+
+  String debug;
+
+  /**
+   * Create a source file attribute.
+   * @param debug Name of the source file
+   * @see ClassEnv#setSource
+   */
+
+  public SourceDebugExtensionAttr(String debug)
+  { this.debug = debug; }
+
+  public void append(String debug)
+  { this.debug += debug; }
+
+  void resolve(ClassEnv e)
+  { e.addCPItem(attr); }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(e.getCPIndex(attr));
+
+    ByteArrayOutputStream buf = new ByteArrayOutputStream();
+    DataOutputStream dat = new DataOutputStream(buf);
+    dat.writeUTF(debug);
+
+// need to write the length of the attribute first as int
+// (writeUTF store it in stream as short)
+    out.writeShort(0);
+// and then write the actual utf8 string
+    buf.writeTo(out);
+  }
+}
+
diff --git a/jasmin/jasmin-2.4/src/jas/StackMap.java b/jasmin/jasmin-2.4/src/jas/StackMap.java
new file mode 100644
index 0000000..98fb800
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/StackMap.java
@@ -0,0 +1,132 @@
+/**
+ * @see StackMapAttr
+ * @see StackMapFrameAttr
+ * @author $Author: Daniel Reynaud $
+ * @author $Author: Iouri Kharon $
+ * @version $Revision: 1.3 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.Vector;
+import java.util.Enumeration;
+
+public class StackMap
+{
+  static private final int JDK_SMF_MIN = 50;
+
+  static CP attr = null;
+  static boolean java6 = false;
+
+  protected Vector frames;
+
+  public static void reinit()
+  { attr = null;
+    java6 = false; }
+
+  protected StackMap(CP attr)
+  { this.attr = attr;
+    frames = new Vector(); }
+
+  public StackMap(ClassEnv e)
+  {
+    if(attr == null)
+    {
+        if(e.version_hi >= JDK_SMF_MIN) java6 = true;
+        attr = new AsciiCP(java6 ? "StackMapTable" : "StackMap");
+    }
+    frames = new Vector();
+  }
+
+  public void addFrame(VerifyFrame f)
+  { frames.add(f); }
+
+  // get copy of previous locals frame (possible with choping)
+  public Vector getLastFrame(int count) throws jasError
+  {
+      if(frames.isEmpty())
+          return null;
+      return ((VerifyFrame)frames.lastElement()).getFrame(count);
+  }
+
+  // this method call BEFORE write method
+  public int size(ClassEnv e, CodeAttr ce)
+  {
+    try {
+      if(java6) shellSort(ce);
+      return write(e, ce, null);
+    } catch(IOException ex) {
+      System.err.println("UNEXPECTED IO EXCEPTION");
+      ex.printStackTrace();
+    } catch(jasError ex) {
+      System.err.println("UNEXPECTED JAS ERROR");
+      ex.printStackTrace();
+    }
+    return 0;
+  }
+
+  void resolve(ClassEnv e)
+  { e.addCPItem(attr);
+
+    Enumeration en = frames.elements();
+    while(en.hasMoreElements())
+      ((VerifyFrame)en.nextElement()).resolve(e);
+  }
+
+  int write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    // writing to a buffer first, so that we can print the length
+    ByteArrayOutputStream buf = new ByteArrayOutputStream();
+    DataOutputStream bufout = new DataOutputStream(buf);
+
+    // not fully compliant to the CLDC spec !
+    bufout.writeShort(frames.size());
+    VerifyFrame prev = null;  // prepare for StackMapFrameAttr
+    Enumeration en = frames.elements();
+    while(en.hasMoreElements())
+    {
+      VerifyFrame cur = (VerifyFrame)en.nextElement();
+      if(!java6) prev = cur;  // as flag
+      cur.write(e, ce, bufout, prev);
+      prev = cur;
+    }
+    int len = buf.toByteArray().length;
+    if(out != null) // else, call for size calculation
+    {
+      out.writeShort(e.getCPIndex(attr));
+      out.writeInt(len);
+      buf.writeTo(out);
+    }
+    return (2 + 4) + len;
+  }
+
+  // sort (method of Shell) frames by offset (before writing)
+  // used for StackMapFrameAttr mode.
+  private void shellSort(CodeAttr ce) throws jasError
+  {
+    int n = frames.size();
+    if(--n <= 0) return;
+    int g = 3;
+    if(g > n) g = 1;
+    do {
+      int i = g;
+      do {
+        VerifyFrame tmp = (VerifyFrame)frames.elementAt(i);
+        int jn, j, ts = tmp.getOffset(ce);
+        for(j = i; j >= g; j = jn) {
+          jn = j - g;
+          VerifyFrame t1 = (VerifyFrame)frames.elementAt(jn);
+          if(t1.getOffset(ce) <= ts) break;
+          frames.setElementAt(t1, j);
+        }
+        frames.setElementAt(tmp, j);
+      }while(++i <= n);
+    }while((g /= 2) > 0);
+  }
+}
+
+/* --- Revision History ---------------------------------------------------
+--- Iouri Kharon, May 07 2010, reset java6-mode for new compiled file
+*/
diff --git a/jasmin/jasmin-2.4/src/jas/StringCP.java b/jasmin/jasmin-2.4/src/jas/StringCP.java
new file mode 100644
index 0000000..7335814
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/StringCP.java
@@ -0,0 +1,32 @@
+package jas;
+
+import java.io.*;
+
+
+/**
+ * Wrap an String constant reference with this CPE.
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+public class StringCP extends CP implements RuntimeConstants
+{
+  AsciiCP val;
+
+  /**
+   * @param s Value for String constant
+   */
+  public StringCP(String s)
+  {
+    uniq = ("String: @#$" + s).intern();
+    val = new AsciiCP(s);
+  }
+  void resolve(ClassEnv e)  { e.addCPItem(val); }
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeByte(CONSTANT_STRING);
+    out.writeShort(e.getCPIndex(val));
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/TableswitchInsn.java b/jasmin/jasmin-2.4/src/jas/TableswitchInsn.java
new file mode 100644
index 0000000..1c5473e
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/TableswitchInsn.java
@@ -0,0 +1,28 @@
+/**
+ * Some instructions are perniticky enough that its simpler
+ * to write them separately instead of smushing them with
+ * all the rest. The tableswitch instruction is one of them.
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+
+
+public class TableswitchInsn extends Insn implements RuntimeConstants
+{
+  /**
+   * @param min minimum index value
+   * @param max maximum index value
+   * @param def default Label for switch
+   * @param j array of Labels, one for each possible index.
+   */
+
+  public TableswitchInsn(int min, int max, LabelOrOffset def, LabelOrOffset j[])
+  {
+    opc = opc_tableswitch;
+    operand = new TableswitchOperand(this, min, max, def, j);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/Var.java b/jasmin/jasmin-2.4/src/jas/Var.java
new file mode 100644
index 0000000..9170009
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/Var.java
@@ -0,0 +1,135 @@
+/**
+ * Used to make up new field entries. Fields for a class can have
+ * an additional "ConstantValue" attribute associated them,
+ * which the java compiler uses to represent things like
+ * static final int blah = foo;
+ *
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.Vector;
+import java.util.Enumeration;
+
+public class Var
+{
+  short var_acc;
+  CP name, desc;
+  SignatureAttr sig;
+  ConstAttr const_attr;
+  DeprecatedAttr depr;
+  AnnotationAttr annVis, annInvis;
+  Vector generic;
+
+  /**
+   * @param vacc access permissions for the field
+   * @param name name of the field
+   * @param desc type of the field
+   * @param cattr Extra constant value information. Passing this as
+   * null will not include this information for the record.
+   * @see RuntimeConstants
+   */
+  public Var(short vacc, CP name, CP desc, ConstAttr cattr)
+  {
+    var_acc = vacc;
+    this.name = name;
+    this.desc = desc;
+    const_attr = cattr;
+    sig = null;
+    depr = null;
+    annVis = annInvis = null;
+    generic = new Vector();
+  }
+
+  public void setSignature(SignatureAttr sig)
+  { this.sig = sig; }
+
+  public void setDeprecated(DeprecatedAttr depr)
+  { this.depr = depr; }
+
+  /**
+   * Add a generic attribute to the field. A generic attribute
+   * contains a stream of uninterpreted bytes which is ignored by
+   * the VM (as long as its name doesn't conflict with other names
+   * for attributes that are understood by the VM)
+   */
+  public void addGenericAttr(GenericAttr g)
+  { generic.addElement(g); }
+
+  /*
+   * procedure group for annotation description
+  */
+  public Annotation addAnnotation(boolean visible, String clsname)
+  {
+    Annotation ann = new Annotation(clsname);
+    AnnotationAttr aa = visible ? annVis : annInvis;
+    if(aa == null) {
+      aa = new AnnotationAttr(visible);
+      if(visible) annVis = aa;
+      else annInvis = aa;
+    }
+    aa.add(ann);
+    return(ann);
+  }
+
+  void resolve(ClassEnv e)
+  {
+    e.addCPItem(name);
+    e.addCPItem(desc);
+    if (const_attr != null)
+      { const_attr.resolve(e); }
+    if(sig != null)
+      sig.resolve(e);
+    if(depr != null)
+      depr.resolve(e);
+    if(annVis != null)
+      annVis.resolve(e);
+    if(annInvis != null)
+      annInvis.resolve(e);
+    for(Enumeration gen = generic.elements(); gen.hasMoreElements(); )
+    {
+      GenericAttr gattr = (GenericAttr)gen.nextElement();
+      gattr.resolve(e);
+    }
+  }
+
+  void write(ClassEnv e, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeShort(var_acc);
+    out.writeShort(e.getCPIndex(name));
+    out.writeShort(e.getCPIndex(desc));
+
+    short nb = (short)generic.size();
+
+    if (const_attr != null)
+      nb++;
+    if(sig != null)
+      nb++;
+    if(depr != null)
+      nb++;
+    if(annVis != null)
+      nb++;
+    if(annInvis != null)
+      nb++;
+    out.writeShort(nb);
+    if (const_attr != null)
+      const_attr.write(e, out);
+    if(sig != null)
+      sig.write(e, out);
+    if(depr != null)
+      depr.write(e, out);
+    if(annVis != null)
+      annVis.write(e, out);
+    if(annInvis != null)
+      annInvis.write(e, out);
+    for (Enumeration gen = generic.elements(); gen.hasMoreElements();)
+    {
+      GenericAttr gattr = (GenericAttr)gen.nextElement();
+      gattr.write(e, out);
+    }
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/VerificationTypeInfo.java b/jasmin/jasmin-2.4/src/jas/VerificationTypeInfo.java
new file mode 100644
index 0000000..bdacc6e
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/VerificationTypeInfo.java
@@ -0,0 +1,102 @@
+/**
+ * VerificationTypeInfo are used by StackMap attributes
+ * @author $Author: Daniel Reynaud $
+ * @version $Revision: 1.0 $
+ */
+
+package jas;
+
+import java.io.*;
+
+public class VerificationTypeInfo
+{
+  private int tag;
+  private ClassCP cls;
+  private int index;
+  private Label un_label;
+
+  public VerificationTypeInfo(String item) throws jasError
+  { this(item, null); }
+
+  public VerificationTypeInfo(String item, String val)
+    throws jasError {
+    if(item.equals("Top"))
+        tag = 0;
+    else if(item.equals("Integer"))
+        tag = 1;
+    else if(item.equals("Float"))
+        tag = 2;
+    else if(item.equals("Long"))
+        tag = 4;
+    else if(item.equals("Double"))
+        tag = 3;
+    else if(item.equals("Null"))
+        tag = 5;
+    else if(item.equals("UninitializedThis"))
+        tag = 6;
+    else if(item.equals("Object")) {
+        if(val==null) throw new jasError("Object requires a class name");
+        cls = new ClassCP(val);
+        tag = 7;
+    }
+    else if(item.equals("Uninitialized")) {
+        if(val==null)
+            throw new jasError("Uninitialized requires an integer or label");
+        try {
+            index = Integer.parseInt(val);
+        } catch(Exception e) {
+            un_label = new Label(val);
+        }
+        tag = 8;
+    }
+    else throw new jasError("Unknown item verification type : "+item);
+  }
+
+  void resolve(ClassEnv e)
+  {
+    if(tag == 7) {
+      cls.resolve(e);
+      e.addCPItem(cls);
+    }
+  }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out)
+    throws IOException, jasError
+  {
+    out.writeByte(tag);
+    if(tag == 7)
+      out.writeShort(e.getCPIndex(cls));
+    else if(tag == 8) { // Uninitialized
+// the following is not fully compliant to the CLDC spec !
+      if(un_label != null)
+        un_label.writeOffset(ce, null, out);
+      else {
+        if((index&0xFFFF) == index) // fits as a short
+          out.writeShort(index);
+        else
+          out.writeInt(index);
+      }
+    }
+  }
+
+// next methods used for StackMapFrame attribute (jdk1.6)
+  private int getOffset(CodeAttr ce) throws jasError
+  {
+    if(un_label != null)
+        return un_label.getOffset(ce);
+    return index;
+  }
+
+  boolean isEqual(ClassEnv e, CodeAttr ce, VerificationTypeInfo cmp)
+  throws jasError
+  {
+    if(tag != cmp.tag)
+        return false;
+
+    if(tag == 7)
+        return e.getCPIndex(cls) == e.getCPIndex(cmp.cls);
+    if(tag == 8)
+        return getOffset(ce) == cmp.getOffset(ce);
+    return true;
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/VerifyFrame.java b/jasmin/jasmin-2.4/src/jas/VerifyFrame.java
new file mode 100644
index 0000000..8f5caf2
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/VerifyFrame.java
@@ -0,0 +1,184 @@
+/**
+ * VerifyFrame are part of StackMap/StackMapFrame attributes
+ * @author $Author: Daniel Reynaud $
+ * @author $Author: Iouri Kharon $
+ * @version $Revision: 1.1 $
+ */
+
+package jas;
+
+import java.io.*;
+import java.util.Vector;
+import java.util.Enumeration;
+
+public class VerifyFrame
+{
+  private static final int SAME_FRAME_S0_min    = 0;
+  private static final int SAME_FRAME_S0_max    = 63;
+  private static final int SAME_FRAME_S1_min    = 64;   // + vi
+  private static final int SAME_FRAME_S1_max    = 127;
+  private static final int SAME_FRAME_S1        = 247;  // + off, vi
+  private static final int CHOP_FRAME_S0_min    = 248;  // + off
+//  private static final int CHOP_FRAME_S0_max    = 250;
+  private static final int SAME_FRAME_S0        = 251;  // +off
+//  private static final int APPEND_FRAME_S0_min  = 252;  // +off, vi[n]
+  private static final int APPEND_FRAME_S0_max  = 254;
+  private static final int FULL_FRAME           = 255;
+
+  private Vector stack, locals;
+  private int offset;
+  private Label off_label;
+  private boolean offset_defined;
+
+  public VerifyFrame(Vector InitialFrame)
+  { stack = new Vector();
+    locals = InitialFrame;
+    if(locals == null)
+        locals = new Vector();
+    offset_defined = false; }
+
+  private void defineOffset() throws jasError
+  { if(offset_defined) throw new jasError("offset already defined");
+    offset_defined = true; }
+
+  public void setOffset(int offset) throws jasError
+  { defineOffset();
+    this.offset = offset; }
+
+  public void setOffset(Label label) throws jasError
+  { defineOffset();
+    off_label = label; }
+
+  public void addStackItem(String item, String val) throws jasError
+  { stack.add(new VerificationTypeInfo(item, val)); }
+
+  public void addLocalsItem(String item, String val) throws jasError
+  { locals.add(new VerificationTypeInfo(item, val)); }
+
+  public boolean haveOffset()
+  { return offset_defined; }
+
+
+// make copy of locals frame (with type-independed counter)
+  public Vector getFrame(int count) throws jasError
+  {
+    if(count > locals.size())
+        throw new jasError("Counter exceed range", true);
+    Vector result = new Vector(locals);
+    if(count != 0)  // else -- full copy
+        result.setSize(count);
+    return result;
+  }
+
+  public int getOffset(CodeAttr ce) throws jasError
+  {
+    if(off_label != null) {
+        offset = ce.getPc(off_label);
+        off_label = null; // for speed in next's request
+    }
+    return offset;
+  }
+
+  void resolve(ClassEnv e)
+  {
+    Enumeration en = stack.elements();
+    while(en.hasMoreElements())
+      ((VerificationTypeInfo)en.nextElement()).resolve(e);
+
+    en = locals.elements();
+    while(en.hasMoreElements())
+      ((VerificationTypeInfo)en.nextElement()).resolve(e);
+  }
+
+  void write(ClassEnv e, CodeAttr ce, DataOutputStream out,
+             VerifyFrame prev)
+  throws IOException, jasError
+  {
+    int off = getOffset(ce);
+    int stack_size  = stack.size();
+    int locals_size = locals.size();
+
+    if(prev != this) { // JDK >= 6
+      if(prev != null) { // not first element
+        int prev_off = prev.getOffset(ce);
+        if(prev_off >= off)
+          throw new jasError("Write unsorted StackMapFrame");
+        off -= prev_off + 1;
+      }
+
+      if(stack_size <= 1) { // else can't compact
+        boolean can_compact = true;
+        int prev_size = 0;
+        if(prev == null) { // first record
+          if(stack_size == 0) {
+            if(locals_size > (APPEND_FRAME_S0_max - SAME_FRAME_S0))
+              can_compact = false;
+          } else if(locals_size != 0)
+              can_compact = false;
+        } else { // not first record
+          int cmpcn = locals_size;
+          prev_size = prev.locals.size();
+          int delta = locals_size - prev_size;
+          if(stack_size == 0) {
+            if(delta >= 0) {
+              if(delta > (APPEND_FRAME_S0_max - SAME_FRAME_S0))
+                can_compact = false;
+              cmpcn -= delta;
+            } else if(delta < (CHOP_FRAME_S0_min - SAME_FRAME_S0))
+              can_compact = false;
+          } else if(delta != 0) can_compact = false;
+          if(can_compact)
+            while(--cmpcn >= 0)
+              if(!((VerificationTypeInfo)
+                    locals.elementAt(cmpcn)).isEqual(e, ce,
+                        ((VerificationTypeInfo)
+                                      prev.locals.elementAt(cmpcn))))
+              {
+                can_compact = false;
+                break;
+              }
+        }
+        if(can_compact) {
+          if(stack_size != 0) { // only if SAME_FRAME_S1...
+            if(off <= (SAME_FRAME_S1_max - SAME_FRAME_S1_min))
+              out.writeByte((byte)(off + SAME_FRAME_S1_min));
+            else {
+              out.writeByte((byte)SAME_FRAME_S1);
+              out.writeShort((short)off);
+            }
+            ((VerificationTypeInfo)stack.elementAt(0)).write(e, ce, out);
+            return;
+          }
+          // stack is empty
+          int wrdt = locals_size - prev_size;
+          if(   wrdt == 0
+             && off <= (SAME_FRAME_S0_max - SAME_FRAME_S0_min)) {
+            out.writeByte((byte)(off + SAME_FRAME_S0_min));
+            return;
+          }
+          out.writeByte((byte)(SAME_FRAME_S0 + wrdt));
+          out.writeShort((short)off);
+          while(--wrdt >= 0)
+            ((VerificationTypeInfo)
+              locals.elementAt(prev_size++)).write(e, ce, out);
+          return;
+        }
+      }
+      // can't compact -- write full frame
+      out.writeByte((byte)FULL_FRAME);
+    } // end of StackMapFrame(JDK>=1.6) mode
+
+    out.writeShort((short)off);
+    out.writeShort((short)locals_size);  // number_of_locals
+  //  System.out.println("number of local items "+locals_size);
+    Enumeration en = locals.elements();
+    while(--locals_size >= 0)
+      ((VerificationTypeInfo)en.nextElement()).write(e, ce, out);
+
+    out.writeShort((short)stack_size);  // number_of_stack_items
+  //  System.out.println("number of stack items "+stack_size);
+    en = stack.elements();
+    while(--stack_size >= 0)
+      ((VerificationTypeInfo)en.nextElement()).write(e, ce, out);
+  }
+}
diff --git a/jasmin/jasmin-2.4/src/jas/jasError.java b/jasmin/jasmin-2.4/src/jas/jasError.java
new file mode 100644
index 0000000..b340ac9
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jas/jasError.java
@@ -0,0 +1,16 @@
+package jas;
+
+/**
+ * Error thrown on problems encountered while running the
+ * basic jas assembler itself.
+ * @author $Author: jonmeyerny $
+ * @version $Revision: 1.1 $
+ */
+
+public class jasError extends Exception
+{
+  public boolean numTag;
+  public jasError() { super(); numTag = false; }
+  public jasError(String s) { super(s);  numTag = false; }
+  public jasError(String s, boolean isNum) { super(s); numTag = true; }
+}
diff --git a/jasmin/jasmin-2.4/src/jasmin.mf b/jasmin/jasmin-2.4/src/jasmin.mf
new file mode 100644
index 0000000..9a2e90e
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin.mf
@@ -0,0 +1,4 @@
+Manifest-Version: 1.0
+Implementation-Title: Java Runtime Environment
+Implementation-Version: 2.4
+Main-Class: jasmin.Main
diff --git a/jasmin/jasmin-2.4/src/jasmin/ClassFile.java b/jasmin/jasmin-2.4/src/jasmin/ClassFile.java
new file mode 100644
index 0000000..289cf28
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin/ClassFile.java
@@ -0,0 +1,1232 @@
+/* --- Copyright Jonathan Meyer 1997. All rights reserved. -----------------
+ > File:        jasmin/src/jasmin/ClassFile.java
+ > Purpose:     Uses a parser and the JAS package to create Java class files
+ > Author:      Jonathan Meyer, 10 July 1996
+ */
+
+package jasmin;
+
+
+/*
+ * This class is a bit monolithic, and should probably be converted into
+ * several smaller classes. However, for this specific application,
+ * its acceptable.
+ *
+ */
+
+import jas.*;
+import java.io.*;
+import java.util.*;
+
+/**
+ * A ClassFile object is used to represent the binary data that makes up a
+ * Java class file - it also serves as the public
+ * API to the Jasmin assembler, though users should beware: the API
+ * is likely to change in future versions (though its such a small API
+ * at the moment that changes are likely to have only a small impact).<p>
+ *
+ * To assemble a file, you first construct a jasmin.ClassFile object, then
+ * call readJasmin() to read in the contents of a Jasmin assembly file, then
+ * call write() to write out the binary representation of the class file.<p>
+ *
+ * There are a few other utility methods as well. See Main.java for an example
+ * which uses all of the public methods provided in ClassFile.
+ *
+ * @author Jonathan Meyer
+ * @version 1.05, 8 Feb 1997
+ */
+public class ClassFile {
+
+    private static final boolean PARSER_DEBUG = false;
+
+    // state info for the class being built
+    String filename;
+    ClassEnv class_env;
+    String class_name;
+    String source_name;
+    Scanner scanner;
+
+    // state info for the current method being defined
+    ExceptAttr except_attr;
+    Catchtable catch_table;
+    LocalVarTableAttr var_table;
+    LocalVarTypeTableAttr vtype_table;
+    LineTableAttr line_table;
+    CodeAttr  code;
+    Method cur_method;
+    Var    cur_field;
+    Hashtable labels;
+    StackMap stackmap;
+    VerifyFrame verifyframe;
+    Annotation cur_annotation;
+
+    int line_label_count, line_num, stack_map_label_count;
+    boolean auto_number, class_header;
+    Insn buffered_insn;
+
+    // state info for lookupswitch and tableswitch instructions
+    Vector switch_vec;
+    int low_value;
+    int high_value;
+
+
+    static final String BGN_METHOD = "jasmin_reserved_bgnmethod:";
+    static final String END_METHOD = "jasmin_reserved_endmethod:";
+
+    // number of errors reported in a file.
+    int errors;
+
+    //
+    // Error reporting method
+    //
+    void report_error(String msg) { report_error(msg, false); }
+
+    void report_error(String msg, boolean BadIntVal) {
+        if(Main.DEBUG)
+            throw new RuntimeException();
+
+        errors++;
+
+        // Print out filename/linenumber/message
+        System.err.print(filename + ":");
+        if (scanner == null)
+            System.err.println(" " + msg + ".");
+        else {
+            String dia_line;
+            int    dia_linnum, dia_charpos;
+
+            if (BadIntVal && scanner.char_num >= 0) {
+              dia_line    = scanner.int_line;
+              dia_linnum  = scanner.int_line_num;
+              dia_charpos = scanner.int_char_num;
+            } else {
+              dia_line    = scanner.line.toString();
+              dia_linnum  = scanner.line_num;
+              dia_charpos = scanner.char_num;
+            }
+            System.err.println(dia_linnum + ": " + msg + ".");
+            if (scanner.char_num >= 0) {
+                System.err.println(dia_line);
+
+                // Print out where on the line the scanner got to
+                int i;
+                for (i = 0; i < dia_charpos; i++) {
+                    if (dia_line.charAt(i) == '\t') {
+                        System.err.print("\t");
+                    } else {
+                        System.err.print(" ");
+                    }
+                }
+                System.err.println("^");
+            }
+        }
+    }
+
+    //
+    // called by the .source directive
+    //
+    void setSource(String name) {
+        source_name = name;
+    }
+
+    //
+    // called by the .bytecode directive
+    //
+    void setVersion(Number version) {
+        String str = version.toString();
+        int idx = str.indexOf(".");
+        if(!(version instanceof Float) || (idx == -1))
+            report_error("invalid bytecode version number : " + str);
+        class_env.setVersion(Short.parseShort(str.substring(0,idx)),
+                             Short.parseShort(str.substring(idx+1,str.length())));
+    }
+
+    //
+    // called by the .class directive
+    //
+    void setClass(String name, short acc) {
+        class_name = name;
+        class_env.setClass(new ClassCP(name));
+        class_env.setClassAccess(acc);
+        class_header = true;
+    }
+
+    //
+    // called by the .super directive
+    //
+    void setSuperClass(String name) {
+        class_env.setSuperClass(new ClassCP(name));
+    }
+
+    //
+    // called by the .implements directive
+    //
+    void addInterface(String name) {
+        class_env.addInterface(new ClassCP(name));
+    }
+
+
+    //
+    // called by the .debug directive
+    //
+    void setSourceDebugExtension(String str) {
+        class_env.setSourceDebugExtension(str);
+    }
+
+
+    //
+    // called by the .enclosing directive
+    //
+    void setEnclosingMethod(String str) {
+        try {
+            if(str.indexOf("(") != -1) { // full method description
+                String[] split = ScannerUtils.splitClassMethodSignature(str);
+                class_env.setEnclosingMethod(split[0], split[1], split[2]);
+            }
+            else                         // just a class name
+                class_env.setEnclosingMethod(str, null, null);
+        } catch(IllegalArgumentException e) {
+            report_error(e.toString());
+        }
+    }
+
+    // parser diagnostics
+    private static void opened_annotation(String fld) throws jasError
+    { throw new jasError("Skipped .end annotation in " + fld); }
+
+    private static void outside(String dir) throws jasError
+    { throw new jasError("illegal use of " +dir+
+                 " outside of method/field definition or class header"); }
+
+    //
+    // called at end of jasmin-header (resolve class variables)
+    //
+    public void endHeader() throws jasError
+      {
+        if(cur_annotation != null)
+          opened_annotation("class header");
+
+        class_env.endHeader();  // resolve annotations
+        class_header = false;
+      }
+
+    //
+    // called by the .signature directive
+    //
+    void setSignature(String str) throws jasError
+    {
+      SignatureAttr sig = new SignatureAttr(str);
+      if (cur_method != null) {
+        cur_method.setSignature(sig);
+      } else if(cur_field != null) {
+        cur_field.setSignature(sig);
+      } else if(class_header) {
+        class_env.setSignature(str);
+      } else {
+        outside(".signature");
+      }
+    }
+
+    //
+    // called by the .deprecated directive
+    //
+    //
+    void setDeprecated() throws jasError
+    {
+      DeprecatedAttr depr = new DeprecatedAttr();
+      if ( cur_method != null ) {
+        cur_method.setDeprecated(depr);
+      } else if(cur_field != null) {
+        cur_field.setDeprecated(depr);
+      } else if(class_header) {
+        class_env.setDeprecated(depr);
+      } else {
+        outside(".deprecated");
+      }
+    }
+
+    //
+    // called by the .attribute directive
+    //
+    void addGenericAttr(String name, String file)
+        throws IOException, jasError
+    {
+      GenericAttr gattr = new GenericAttr(name, file);
+      if (cur_method != null) {
+        flushInsnBuffer();
+        if(code != null)  code.addGenericAttr(gattr);
+        else cur_method.addGenericAttr(gattr);
+      } else if(cur_field != null) {
+        cur_field.addGenericAttr(gattr);
+      } else if (class_header) {
+        class_env.addGenericAttr(gattr);
+      } else {
+        outside(".attribute");
+      }
+    }
+
+    //
+    // called by the .inner directive
+    //
+    //
+    public void addInner(short iacc, String name, String inner, String outer)
+    { class_env.addInnerClass(iacc, name, inner, outer); }
+
+    //
+    // procedure group for annotation description
+    //
+    private static void annotation_internal() throws jasError
+    { throw new jasError("logic error in .annotation parsing"); }
+
+    void addAnnotation() throws jasError
+    {
+      if(cur_method == null) Annotation.ParserError();
+      cur_annotation = cur_method.addAnnotation();
+    }
+
+    void addAnnotation(boolean visible, String clname, int paramnum)
+        throws jasError
+    {
+      if(cur_method == null) Annotation.ParserError();
+      cur_annotation = cur_method.addAnnotation(visible, clname, paramnum);
+    }
+
+    void addAnnotation(boolean visible, String clname) throws jasError
+    {
+      if (cur_method != null) {
+        cur_annotation = cur_method.addAnnotation(visible, clname);
+      } else if(cur_field != null) {
+        cur_annotation = cur_field.addAnnotation(visible, clname);
+      } else if (class_header) {
+        cur_annotation = class_env.addAnnotation(visible, clname);
+      } else {
+        outside(".annotation");
+      }
+    }
+
+    void addAnnotationField(String name, String type, String add)
+        throws jasError
+    {
+      if(cur_annotation == null) annotation_internal();
+      cur_annotation.addField(name, type, add);
+    }
+
+    void addAnnotationValue(Object value) throws jasError
+    {
+      if(cur_annotation == null) annotation_internal();
+      cur_annotation.addValue(value);
+    }
+
+    void nestAnnotation() throws jasError
+    {
+      if(cur_annotation == null) annotation_internal();
+      cur_annotation = cur_annotation.nestAnnotation();
+    }
+
+    void endAnnotation() throws jasError
+    {
+      if(cur_annotation == null)
+        throw new jasError(".end annotation without .annotation");
+      cur_annotation = cur_annotation.endAnnotation();
+    }
+
+    // called by the .field directive to begin 'prompted' field
+    //
+    void beginField(short access, String name, String desc, Object value)
+        throws jasError
+    {
+      ConstAttr ca = null;
+
+      if (value != null) {
+        CP cp;
+        // create a constant pool entry for the initial value
+        if (value instanceof Integer) {
+          cp = new IntegerCP(((Integer)value).intValue());
+        } else if (value instanceof Float) {
+          cp = new FloatCP(((Float)value).floatValue());
+        } else if (value instanceof Double) {
+          cp = new DoubleCP(((Double)value).doubleValue());
+        } else if (value instanceof Long) {
+          cp = new LongCP(((Long)value).longValue());
+        } else if (value instanceof String) {
+          cp = new StringCP((String)value);
+        } else {
+          throw new jasError("usupported value type");
+        }
+        ca = new ConstAttr(cp);
+      }
+      cur_field = new Var(access, new AsciiCP(name), new AsciiCP(desc), ca);
+    }
+
+    //
+    // called by the .end field directive to end 'prompted' field
+    //
+    void endField() throws jasError {
+      if (cur_field == null)
+        throw new jasError(".end field without .field");
+
+      if (cur_annotation != null)
+          opened_annotation("field");
+
+      class_env.addField(cur_field);
+      cur_field = null;
+    }
+    //
+    // called by the .field directive
+    //
+    void addField(short access, String name, String desc,
+                                String sig, Object value) throws jasError {
+        beginField(access, name, desc, value);
+        if (sig != null) cur_field.setSignature(new SignatureAttr(sig));
+        endField();
+    }
+
+    //
+    // called by the .method directive to start the definition for a method
+    //
+    void newMethod(String name, String descriptor, int access) {
+        // set method state variables
+        labels      = new Hashtable();
+        code        = null;
+        except_attr = null;
+        catch_table = null;
+        var_table   = null;
+        vtype_table = null;
+        line_table  = null;
+        line_label_count  = 0;
+        stack_map_label_count = 0;
+        stackmap = null;
+        verifyframe = null;
+        cur_method = new Method((short)access, new AsciiCP(name),
+                                new AsciiCP(descriptor));
+    }
+
+
+    //
+    // called by the .end method directive to end the definition for a method
+    //
+    void endMethod() throws jasError {
+        if (cur_method == null)
+            throw new jasError(".end method without .method");
+
+        if (cur_annotation != null)
+            opened_annotation("method");
+
+        if (code != null) {
+
+            plantLabel(END_METHOD);
+            flushInsnBuffer();
+
+            if (catch_table != null) {
+                code.setCatchtable(catch_table);
+            }
+
+            if (var_table != null) {
+                code.setLocalVarTable(var_table);
+            }
+            if (vtype_table != null) {
+                code.setLocalVarTypeTable(vtype_table);
+            }
+            if (line_table != null) {
+                code.setLineTable(line_table);
+            }
+            if (stackmap != null) {
+                code.setStackMap(stackmap);
+            }
+        }
+        cur_method.setCode(code, except_attr);
+        class_env.addMethod(cur_method);
+
+        // clear method state variables
+        cur_method  = null;
+        code        = null;
+        labels      = null;
+        catch_table = null;
+        line_table  = null;
+        var_table   = null;
+        vtype_table = null;
+        stackmap    = null;
+        verifyframe = null;
+    }
+
+// get last stackmap locals vector
+    private Vector prevStack(int count) throws jasError {
+        Vector prev = null;
+        if(stackmap != null)
+            prev = stackmap.getLastFrame(count);
+        return prev;
+    }
+
+// define a new stack map frame (possible with copy previous)
+    void beginStack(boolean copy) throws jasError {
+        Vector prev = null;
+        if(copy)
+            prev = prevStack(0);
+        verifyframe = new VerifyFrame(prev);
+    }
+
+// define a new stack map frame and copy 'n' previous
+// (type-independet) elements
+    void beginStack(int n) throws jasError {
+        if(n <= 0)
+            throw new jasError("Invalid counter", true);
+        verifyframe = new VerifyFrame(prevStack(n));
+    }
+
+// define the offset of the current stack map frame
+    void plantStackOffset(int n) {
+        try {
+            verifyframe.setOffset(n);
+        } catch(jasError e) {
+            report_error(e.toString());
+        }
+    }
+
+    void plantStackOffset(String label) throws jasError {
+        Label l = getLabel(label);
+        try {
+            verifyframe.setOffset(l);
+        } catch(jasError e) {
+            report_error(e.toString());
+        }
+    }
+
+// add a local variable item to the current stack map frame
+    void plantStackLocals(String item, String val) {
+        try {
+            verifyframe.addLocalsItem(item, val);
+        } catch(jasError e) {
+            report_error(e.toString());
+        }
+    }
+
+// add a stack item element to the current stack map frame
+    void plantStackStack(String item, String val) {
+        try {
+            verifyframe.addStackItem(item, val);
+        } catch(jasError e) {
+            report_error(e.toString());
+        }
+    }
+
+// add the current stack map frame to the current stack map attribute
+    void endStack() {
+        if(!verifyframe.haveOffset()) {
+            String l = "jasmin_reserved_SM:" + (stack_map_label_count++);
+            try {
+                plantLabel(l);
+                verifyframe.setOffset(getLabel(l));
+            } catch(jasError e) {
+                report_error(e.toString());
+            }
+        }
+        if(stackmap==null)
+            stackmap = new StackMap(class_env);
+
+        stackmap.addFrame(verifyframe);
+        verifyframe = null; // PARANOYA
+    }
+
+
+    //
+    // plant routines - these use addInsn to add instructions to the
+    //                  code for the current method.
+    //
+
+    //
+    // used for instructions that take no arguments
+    //
+    void plant(String name) throws jasError {
+        InsnInfo insn = InsnInfo.get(name);
+        autoNumber();
+        flushInsnBuffer();
+
+        if (insn.args.equals("")) {
+            bufferInsn(new Insn(insn.opcode));
+        } else {
+            throw new jasError("Missing arguments for instruction " + name);
+        }
+    }
+
+    //
+    // used for relative branch targets (ie $+5, $-12, ...)
+    //
+    void plantRelativeGoto(String name, int val) throws jasError {
+        InsnInfo insn = InsnInfo.get(name);
+        if (insn.args.equals("label")) {
+            bufferInsn(new Insn(insn.opcode, val, true));
+        } else {  // forward the request for "normal" instructions
+            plant(name, val);
+        }
+    }
+
+
+    //
+    // used for iinc
+    //
+    void plant(String name, int v1, int v2)
+        throws jasError
+    {
+        InsnInfo insn = InsnInfo.get(name);
+        autoNumber();
+        flushInsnBuffer();
+
+        if (insn.args.equalsIgnoreCase("ii")) {
+            bufferInsn(new IincInsn(v1, v2, insn.args.charAt(0) == 'I'));
+        } else {
+            throw new jasError("Bad arguments for instruction " + name);
+        }
+    }
+
+    //
+    // used for instructions that take an integer parameter
+    // (branches are part of this, the int is converted to a label)
+    //
+    void plant(String name, int val) throws jasError {
+        InsnInfo insn = InsnInfo.get(name);
+        CodeAttr code = _getCode();
+        autoNumber();
+        flushInsnBuffer();
+
+        if (insn.args.equalsIgnoreCase("i")) {
+            bufferInsn(new Insn(insn.opcode, val, insn.args.charAt(0) == 'I'));
+        } else if (insn.args.equals("constant")) {
+            bufferInsn(new Insn(insn.opcode, new IntegerCP(val)));
+        } else if (insn.args.equals("bigconstant")) {
+            bufferInsn(new Insn(insn.opcode, new LongCP(val)));
+        } else if (insn.args.equals("label")) {
+            plant(name, String.valueOf(val));        // the target is not signed
+                                                     // assume it is a label
+        } else {
+            throw new jasError("Bad arguments for instruction " + name);
+        }
+    }
+
+    //
+    // used for ldc and other instructions that take a numeric argument
+    //
+    void plant(String name, Number val) throws jasError {
+        InsnInfo insn = InsnInfo.get(name);
+        CodeAttr code = _getCode();
+        autoNumber();
+        flushInsnBuffer();
+
+        if (insn.args.equalsIgnoreCase("i") && (val instanceof Integer)) {
+            bufferInsn(new Insn(insn.opcode, val.intValue(), insn.args.charAt(0) == 'I'));
+        } else if (insn.args.equals("constant")) {
+            if (val instanceof Integer || val instanceof Long) {
+                bufferInsn(new Insn(insn.opcode,
+                             new IntegerCP(val.intValue())));
+            } else if (val instanceof Float || val instanceof Double) {
+                bufferInsn(new Insn(insn.opcode,
+                             new FloatCP(val.floatValue())));
+            }
+        } else if (insn.args.equals("bigconstant")) {
+            if (val instanceof Integer || val instanceof Long) {
+                bufferInsn(new Insn(insn.opcode,
+                             new LongCP(val.longValue())));
+            } else if (val instanceof Float || val instanceof Double) {
+                bufferInsn(new Insn(insn.opcode,
+                             new DoubleCP(val.doubleValue())));
+            }
+        } else {
+            throw new jasError("Bad arguments for instruction " + name);
+        }
+    }
+
+    //
+    // used for ldc <quoted-string>
+    //
+    void plantString(String name, String val) throws jasError {
+        InsnInfo insn = InsnInfo.get(name);
+        autoNumber();
+        flushInsnBuffer();
+
+        if (insn.args.equals("constant")) {
+            bufferInsn(new Insn(insn.opcode, new StringCP(val)));
+        } else {
+            throw new jasError("Bad arguments for instruction " + name);
+        }
+    }
+
+    //
+    // used for invokeinterface and multianewarray
+    //
+    void plant(String name, String val, int nargs)
+            throws jasError
+    {
+        InsnInfo insn = InsnInfo.get(name);
+        CodeAttr code = _getCode();
+        autoNumber();
+        flushInsnBuffer();
+
+        if (insn.args.equals("interface")) {
+            String split[] = ScannerUtils.splitClassMethodSignature(val);
+            bufferInsn(new InvokeinterfaceInsn(
+                         new InterfaceCP(split[0], split[1],
+                         split[2]), nargs));
+
+        } else if (insn.args.equals("marray")) {
+            bufferInsn(new MultiarrayInsn(new ClassCP(val), nargs));
+        } else {
+            throw new jasError("Bad arguments for instruction " + name);
+        }
+    }
+
+    //
+    // used for instructions that take a word as a parameter
+    // (e.g. branches, newarray, invokemethod)
+    //
+    void plant(String name, String val) throws jasError {
+        InsnInfo insn = InsnInfo.get(name);
+        CodeAttr code = _getCode();
+        autoNumber();
+        flushInsnBuffer();
+
+        if (insn.args.equals("method")) {
+            String split[] = ScannerUtils.splitClassMethodSignature(val);
+            bufferInsn(new Insn(insn.opcode,
+                         new MethodCP(split[0], split[1], split[2])));
+        } else if (insn.args.equals("constant")) {
+            bufferInsn(new Insn(insn.opcode, new ClassCP(val)));
+        } else if (insn.args.equals("atype")) {
+            int atype = 0;
+            if (val.equals("boolean")) {
+                atype = 4;
+            } else if (val.equals("char")) {
+                atype = 5;
+            } else if (val.equals("float")) {
+                atype = 6;
+            } else if (val.equals("double")) {
+                atype = 7;
+            } else if (val.equals("byte")) {
+                atype = 8;
+            } else if (val.equals("short")) {
+                atype = 9;
+            } else if (val.equals("int")) {
+                atype = 10;
+            } else if (val.equals("long")) {
+                atype = 11;
+            } else {
+                throw new jasError("Bad array type: " + name);
+            }
+            bufferInsn(new Insn(insn.opcode, atype, false));
+        } else if (insn.args.indexOf("label")>=0) {
+            bufferInsn(new Insn(insn.opcode, getLabel(val), scanner.line_num));
+        } else if (insn.args.equals("class")) {
+            bufferInsn(new Insn(insn.opcode, new ClassCP(val)));
+        } else {
+            throw new jasError("(gloups)Bad arguments for instruction " + name);
+        }
+    }
+
+    //
+    // used for instructions that take a field and a signature as parameters
+    // (e.g. getstatic, putstatic)
+    //
+    void plant(String name, String v1, String v2)
+            throws jasError
+    {
+        InsnInfo info = InsnInfo.get(name);
+        CodeAttr code = _getCode();
+        autoNumber();
+        flushInsnBuffer();
+
+        if (info.args.equals("field")) {
+            String split[] = ScannerUtils.splitClassField(v1);
+            if(split[1] == null)
+                throw new jasError("can't extract field from "+v1);
+            bufferInsn(new Insn(info.opcode,
+                         new FieldCP(split[0], split[1], v2)));
+        } else {
+            throw new jasError("Bad arguments for instruction " + name);
+        }
+    }
+
+    //
+    // Lookupswitch instruction
+    //
+    void newLookupswitch() throws jasError {
+        switch_vec = new Vector();
+        autoNumber();
+    };
+
+    void addLookupswitch(int val, String label)
+            throws jasError {
+        switch_vec.addElement(new Integer(val));
+        switch_vec.addElement(new LabelOrOffset(getLabel(label)));
+    };
+
+    void addLookupswitch(int val, int offset)
+            throws jasError {
+        switch_vec.addElement(new Integer(val));
+        switch_vec.addElement(new LabelOrOffset(offset));
+    };
+
+    void endLookupswitch(String deflabel) throws jasError {
+        flushInsnBuffer();
+        Object[] offlabs = checkLookupswitch();
+        int[] offsets = (int[])offlabs[0];
+        LabelOrOffset[] labels = (LabelOrOffset[])offlabs[1];
+        LabelOrOffset defl = new LabelOrOffset(getLabel(deflabel));
+        bufferInsn(new LookupswitchInsn(defl, offsets, labels));
+    }
+
+    void endLookupswitch(int defoffset) throws jasError {
+        flushInsnBuffer();
+        Object[] offlabs = checkLookupswitch();
+        int[] offsets = (int[])offlabs[0];
+        LabelOrOffset[] labels = (LabelOrOffset[])offlabs[1];
+        bufferInsn(new LookupswitchInsn(new LabelOrOffset(defoffset),
+                          offsets, labels));
+    }
+
+
+    //
+    // called by both endLookupswitch() methods
+    //
+    private Object[] checkLookupswitch() {
+        int n = switch_vec.size() >> 1;
+        int offsets[] = new int[n];
+        LabelOrOffset labels[] = new LabelOrOffset[n];
+        Enumeration e = switch_vec.elements();
+        int i = 0;
+        while (e.hasMoreElements()) {
+            offsets[i] = ((Integer)e.nextElement()).intValue();
+            labels[i] = (LabelOrOffset)e.nextElement();
+            i++;
+        }
+        Object result[] = { offsets, labels };
+        return result;
+    }
+
+
+    //
+    // Tableswitch instruction
+    //
+    void newTableswitch(int lowval) throws jasError {
+        newTableswitch(lowval, -1);
+    };
+
+    void newTableswitch(int lowval, int hival) throws jasError {
+        switch_vec = new Vector();
+        low_value = lowval;
+        high_value = hival;
+        autoNumber();
+    };
+
+    void addTableswitch(String label) throws jasError {
+        switch_vec.addElement(new LabelOrOffset(getLabel(label)));
+    };
+
+    void addTableswitch(int offset) throws jasError {
+        switch_vec.addElement(new LabelOrOffset(offset));
+    };
+
+    void endTableswitch(String deflabel) throws jasError {
+        flushInsnBuffer();
+        LabelOrOffset labels[] = checkTableswitch();
+        bufferInsn(new TableswitchInsn(low_value,
+                           low_value+labels.length-1,
+                           new LabelOrOffset(getLabel(deflabel)),
+                           labels));
+    }
+
+    void endTableswitch(int defoffset) throws jasError {
+        flushInsnBuffer();
+        LabelOrOffset labels[] = checkTableswitch();
+        bufferInsn(new TableswitchInsn(low_value,
+             low_value+labels.length-1, new LabelOrOffset(defoffset), labels));
+    }
+
+
+    //
+    // called by both endTableswitch() methods
+    //
+    private LabelOrOffset[] checkTableswitch() {
+        int n = switch_vec.size();
+        LabelOrOffset labels[] = new LabelOrOffset[n];
+        Enumeration e = switch_vec.elements();
+        int i = 0;
+        while (e.hasMoreElements()) {
+            labels[i] = (LabelOrOffset)e.nextElement();
+            i++;
+        }
+        if (high_value != -1 && (high_value != low_value + n - 1)) {
+            report_error("tableswitch - given incorrect value for <high>");
+        }
+        return labels;
+    }
+
+
+    // Used by the parser to tell ClassFile what the line number
+    // for the next statement is. ClassFile's autoNumber mechanism
+    // uses this info.
+    void setLine(int l) { line_num = l; }
+
+    //
+    // If auto_number is true, output debugging line number table
+    // for Jasmin assembly instructions.
+
+    //
+    void autoNumber() throws jasError {
+        if (auto_number) {
+            // use the line number of the last token
+            addLineInfo(line_num);
+        }
+    }
+
+    //
+    // Label management
+    //
+
+    //
+    // gets the Label object for a label, creating it if it doesn't exist
+    //
+    Label getLabel(String name) throws jasError {
+
+        // check that we are inside of a method definition
+        if (cur_method == null) {
+            throw new jasError( "illegal use of label outside of method definition");
+        }
+
+        Label lab = (Label)labels.get(name);
+        if (lab == null) {
+            lab = new Label(name);
+            labels.put(name, lab);
+        }
+        return lab;
+    }
+
+    //
+    // defines a label
+    //
+    void plantLabel(String name) throws jasError {
+    //    System.out.println("planting label "+name);
+        try {
+            Integer.parseInt(name);
+          // the label is a number, we must add it *before* the buffered insn
+          // this is the reason to use a buffer instructions
+            _getCode().addInsn(getLabel(name));
+            flushInsnBuffer();
+        } catch(NumberFormatException e) {
+          // traditional label (word), add it *after* the buffered insn
+            flushInsnBuffer();
+            bufferInsn(getLabel(name));
+        }
+    }
+
+// if there is an instruction in the buffer, add it to the code
+// and put the new instruction in the buffer
+    void bufferInsn(Insn i) throws jasError{
+        if(i == null)
+            throw new jasError("trying to buffer a null instruction");
+        if(buffered_insn != null)
+            flushInsnBuffer();
+        buffered_insn = i;
+    }
+
+// if the buffer is not empty, add the instruction to the code array
+    void flushInsnBuffer() throws jasError {
+        if(buffered_insn != null) {
+            _getCode().addInsn(buffered_insn);
+            buffered_insn = null;
+        }
+    }
+
+    //
+    // used by the .var directive
+    //
+    void addVar(String startLab, String endLab,
+                String name, String desc, String sign, int var_num)
+               throws jasError {
+        if (startLab == null) {
+            startLab = BGN_METHOD;
+        }
+
+        if (endLab == null) {
+            endLab = END_METHOD;
+        }
+        Label slab, elab;
+        slab = getLabel(startLab);
+        elab = getLabel(endLab);
+
+        if (var_table == null) {
+            var_table = new LocalVarTableAttr();
+        }
+
+        var_table.addEntry(new LocalVarEntry(slab, elab, name, desc, var_num));
+
+        if (sign != null) {
+            if (vtype_table == null) {
+              vtype_table = new LocalVarTypeTableAttr();
+            }
+
+            vtype_table.addEntry(new LocalVarEntry(slab, elab, name, sign, var_num));
+        }
+    }
+
+    void addVar(int startOffset, int endOffset, String name,
+                  String desc, String sign, int var_num) throws jasError {
+        if (var_table == null) {
+            var_table = new LocalVarTableAttr();
+        }
+        var_table.addEntry(new LocalVarEntry(startOffset, endOffset,
+                           name, desc, var_num));
+
+        if (sign != null) {
+            if (vtype_table == null) {
+              vtype_table = new LocalVarTypeTableAttr();
+            }
+
+            vtype_table.addEntry(new LocalVarEntry(startOffset, endOffset,
+                                 name, sign, var_num));
+        }
+    }
+
+    //
+    // used by .line directive
+    //
+    void addLineInfo(int line_num) throws jasError {
+        String l = "jasmin_reserved_L:" + (line_label_count++);
+        if (line_table == null) {
+            line_table = new LineTableAttr();
+        }
+        plantLabel(l);
+        line_table.addEntry(getLabel(l), line_num);
+    }
+
+    void addLine(int line_num) throws jasError {
+        if (!auto_number) {
+            addLineInfo(line_num);
+        }
+    }
+
+    //
+    // used by the .throws directive
+    //
+    void addThrow(String name) throws jasError {
+
+        // check that we are inside of a method definition
+        if (cur_method == null) {
+            throw new jasError( "illegal use of .throw outside of method definition");
+        }
+
+        if (except_attr == null) {
+            except_attr = new ExceptAttr();
+        }
+        except_attr.addException(new ClassCP(name));
+    }
+
+    //
+    // used by the .catch directive
+    //
+    void addCatch(String name, String start_lab, String end_lab,
+                                String branch_lab) throws jasError {
+        ClassCP class_cp = checkCatch(name);
+
+        catch_table.addEntry(getLabel(start_lab), getLabel(end_lab),
+                             getLabel(branch_lab), class_cp);
+    }
+
+
+    void addCatch(String name, int start_off, int end_off,
+                                int branch_off) throws jasError {
+        ClassCP class_cp = checkCatch(name);
+
+        catch_table.addEntry(start_off, end_off, branch_off, class_cp);
+    }
+
+    short checkLimit(int v) throws jasError {
+        if(v < 0 || v > 65535)
+            throw new jasError("Illegal limit value", true);
+        return (short)v;
+    }
+
+    //
+    // used by the .limit stack directive
+    //
+    void setStackSize(int v) throws jasError {
+        _getCode().setStackSize(checkLimit(v));
+    }
+
+    //
+    // used by the .limit vars directive
+    //
+    void setVarSize(int v) throws jasError {
+        _getCode().setVarSize(checkLimit(v));
+    }
+
+    // --- Private stuff ---
+
+
+    //
+    // verifications made by both addCatch() methods
+    //
+    private ClassCP checkCatch(String name) throws jasError {
+        ClassCP class_cp;
+        // check that we are inside of a method definition
+        if (cur_method == null) {
+            throw new jasError( "illegal use of .catch outside of method definition");
+        }
+
+        if (catch_table == null) {
+            catch_table = new Catchtable();
+        }
+
+        if (name.equals("all")) {
+            class_cp = null;
+        } else {
+            class_cp = new ClassCP(name);
+        }
+        return class_cp;
+    }
+
+
+    //
+    // returns the code block, creating it if it doesn't exist
+    //
+    CodeAttr _getCode() throws jasError {
+
+        // check that we are inside of a method definition
+        if (cur_method == null) {
+            throw new jasError("illegal use of instruction outside of method definition");
+        }
+
+        if (code == null) {
+            code = new CodeAttr();
+            plantLabel(BGN_METHOD);
+        }
+
+        return (code);
+    }
+
+
+    // PUBLIC API TO JASMIN:
+
+    /** Makes a new ClassFile object, used to represent a Java class file.
+      * You can then use readJasmin to read in a class file stored in
+      * Jasmin assembly format.
+      */
+
+    public ClassFile() {}
+
+    /**
+      * Parses a Jasmin file, converting it internally into a binary
+      * representation.
+      * If something goes wrong, this throws one of
+      * an IOException, or a jasError, or one of a few other exceptions.
+      * I'll tie this down more formally in the next version.
+      *
+      * @param input is the stream containing the Jasmin assembly code for the
+      *        class.
+      *
+      * @param name is the name of the stream. This name will be
+      *        concatenated to error messages printed to System.err.
+      *
+      * @param numberLines true if you want Jasmin to generate line
+      *        numbers automatically, based on the assembly source, or
+      *        false if you are using the ".line" directive and don't
+      *        want Jasmin to help out.
+      */
+    public void readJasmin(Reader input, String name,
+                           boolean numberLines)
+                   throws IOException, Exception {
+        // initialize variables for error reporting
+        errors = 0;
+        filename = name;
+        source_name = name;
+
+        //initialize local-frame variables
+        cur_method = null;
+        cur_field = null;
+        cur_annotation = null;
+        class_header = false;
+
+        // if numberLines is true, we output LineTableAttr's that indicate what line
+        // numbers the Jasmin code falls on.
+        auto_number = numberLines;
+
+        // Parse the input file
+        class_env = new ClassEnv();
+
+        scanner = new Scanner(input);
+        parser parse_obj = new parser(this, scanner);
+
+        if (PARSER_DEBUG) {
+            // for debugging
+            parse_obj.debug_parse();
+        } else {
+            parse_obj.parse();
+        }
+    }
+
+    /**
+     * Returns the number of warnings/errors encountered while parsing a file.
+     * 0 if everything went OK.
+     */
+    public int errorCount() {
+        return errors;
+    }
+
+    /**
+     * Returns the name of the class in the file (i.e. the string given to
+     * the .class parameter in Jasmin)
+     *
+     */
+    public String getClassName() {
+        return class_name;
+    }
+
+    /**
+     * Writes the binary data for the class represented by this ClassFile
+     * object to the specified
+     * output stream, using the Java Class File format. Throws either an
+     * IOException or a jasError if something goes wrong.
+     */
+    public void write(OutputStream outp) throws IOException, jasError {
+        class_env.setSource(source_name);
+        class_env.write(new DataOutputStream(outp));
+    }
+};
+
+/* --- Revision History ---------------------------------------------------
+--- Iouri Kharon, Aug 10 2006
+    Added 'Wide' prefix support to some instructions
+
+--- Iouri Kharon, Feb 17 2006
+    Added extended syntax for .stack
+
+--- Iouri Kharon, Dec 30 2005
+    Added multiline .field, directive .inner and .anotation
+
+--- Iouri Kharon, Dec 20 2005
+    Added LocalVariableTypeTable support in addVar methods (called by .var)
+
+--- Daniel Reynaud, Oct 22 2005
+    Added setSourceDebugExtension() method (called by .debug)
+    Added setEnclosingMethod() method (called by .enclosing)
+
+--- Daniel Reynaud, Oct 19 2005
+    Added setVersion() method (called by .bytecode)
+    Changed BGN_METHOD, END_METHOD and line number label to avoid collision
+
+--- Jonathan Meyer, April 11 1997
+    Fixed bug where source_name was not being set in class_env.
+
+--- Jonathan Meyer, Mar 1 1997
+    Renamed "Jasmin" class "ClassFile".
+
+--- Jonathan Meyer, Feb 8 1997
+    Converted to non-static. Made a public API. Split off InsnInfo to a
+    separate file.
+
+--- Jonathan Meyer, Oct 1 1996
+    Added addInterface method, used by the .implements directive.
+
+--- Jonathan Meyer, July 25 1996
+    Added setLine and line_num, to fix problem with autoNumber.
+    Added report_error method.
+
+--- Jonathan Meyer, July 24 1996 added version constant.
+*/
diff --git a/jasmin/jasmin-2.4/src/jasmin/InsnInfo.java b/jasmin/jasmin-2.4/src/jasmin/InsnInfo.java
new file mode 100644
index 0000000..f79a6bb
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin/InsnInfo.java
@@ -0,0 +1,289 @@
+/* --- Copyright Jonathan Meyer 1997. All rights reserved. -----------------
+ > File:        jasmin/src/jasmin/InsnInfo.java
+ > Purpose:     Information about instructions (opcode, type of args, etc)
+ > Author:      Jonathan Meyer, 8 Feb 1996
+ */
+
+//
+// InsnInfo is used to hold info about the opcode and parameters needed
+// by an instruction. Instances of InsnInfo are created by a static
+// initializer and stored in a table.
+//
+
+package jasmin;
+
+import jas.RuntimeConstants;
+import java.util.Hashtable;
+
+class InsnInfo {
+    // maps instruction name -> InsnInfo object
+    private static Hashtable infoTable;
+
+    // information maintained about each instruction:
+    public String name;     // instruction name
+    public int opcode;      // its opcode
+    public String args;     // the argument code
+
+    public static InsnInfo get(String name) {
+	return (InsnInfo)infoTable.get(name);
+    }
+
+    public static boolean contains(String name) {
+	return infoTable.get(name) != null;
+    }
+
+    //
+    // used to initialize the infoTable table (see below)
+    //
+    static private void addInfo(String name, int opcode, String args) {
+	InsnInfo info = new InsnInfo();
+	info.name = name;
+	info.opcode = opcode;
+	info.args = args;
+        infoTable.put(name, info);
+    }
+
+    //
+    // initializes the infoTable table
+    //
+    static {
+        infoTable = new Hashtable();
+
+        addInfo("aaload", RuntimeConstants.opc_aaload, "");
+        addInfo("aastore", RuntimeConstants.opc_aastore, "");
+        addInfo("aconst_null", RuntimeConstants.opc_aconst_null, "");
+        addInfo("aload", RuntimeConstants.opc_aload, "i");
+        addInfo("aload_w", RuntimeConstants.opc_aload, "I");
+        addInfo("aload_0", RuntimeConstants.opc_aload_0, "");
+        addInfo("aload_1", RuntimeConstants.opc_aload_1, "");
+        addInfo("aload_2", RuntimeConstants.opc_aload_2, "");
+        addInfo("aload_3", RuntimeConstants.opc_aload_3, "");
+        addInfo("anewarray", RuntimeConstants.opc_anewarray, "class");
+        addInfo("areturn", RuntimeConstants.opc_areturn, "");
+        addInfo("arraylength", RuntimeConstants.opc_arraylength, "");
+        addInfo("astore", RuntimeConstants.opc_astore, "i");
+        addInfo("astore_w", RuntimeConstants.opc_astore, "I");
+        addInfo("astore_0", RuntimeConstants.opc_astore_0, "");
+        addInfo("astore_1", RuntimeConstants.opc_astore_1, "");
+        addInfo("astore_2", RuntimeConstants.opc_astore_2, "");
+        addInfo("astore_3", RuntimeConstants.opc_astore_3, "");
+        addInfo("athrow", RuntimeConstants.opc_athrow, "");
+        addInfo("baload", RuntimeConstants.opc_baload, "");
+        addInfo("bastore", RuntimeConstants.opc_bastore, "");
+        addInfo("bipush", RuntimeConstants.opc_bipush, "i");
+        addInfo("breakpoint", RuntimeConstants.opc_breakpoint, "");
+        addInfo("caload", RuntimeConstants.opc_caload, "");
+        addInfo("castore", RuntimeConstants.opc_castore, "");
+        addInfo("checkcast", RuntimeConstants.opc_checkcast, "class");
+        addInfo("d2f", RuntimeConstants.opc_d2f, "");
+        addInfo("d2i", RuntimeConstants.opc_d2i, "");
+        addInfo("d2l", RuntimeConstants.opc_d2l, "");
+        addInfo("dadd", RuntimeConstants.opc_dadd, "");
+        addInfo("daload", RuntimeConstants.opc_daload, "");
+        addInfo("dastore", RuntimeConstants.opc_dastore, "");
+        addInfo("dcmpg", RuntimeConstants.opc_dcmpg, "");
+        addInfo("dcmpl", RuntimeConstants.opc_dcmpl, "");
+        addInfo("dconst_0", RuntimeConstants.opc_dconst_0, "");
+        addInfo("dconst_1", RuntimeConstants.opc_dconst_1, "");
+        addInfo("ddiv", RuntimeConstants.opc_ddiv, "");
+        addInfo("dload", RuntimeConstants.opc_dload, "i");
+        addInfo("dload_w", RuntimeConstants.opc_dload, "I");
+        addInfo("dload_0", RuntimeConstants.opc_dload_0, "");
+        addInfo("dload_1", RuntimeConstants.opc_dload_1, "");
+        addInfo("dload_2", RuntimeConstants.opc_dload_2, "");
+        addInfo("dload_3", RuntimeConstants.opc_dload_3, "");
+        addInfo("dmul", RuntimeConstants.opc_dmul, "");
+        addInfo("dneg", RuntimeConstants.opc_dneg, "");
+        addInfo("drem", RuntimeConstants.opc_drem, "");
+        addInfo("dreturn", RuntimeConstants.opc_dreturn, "");
+        addInfo("dstore", RuntimeConstants.opc_dstore, "i");
+        addInfo("dstore_w", RuntimeConstants.opc_dstore, "I");
+        addInfo("dstore_0", RuntimeConstants.opc_dstore_0, "");
+        addInfo("dstore_1", RuntimeConstants.opc_dstore_1, "");
+        addInfo("dstore_2", RuntimeConstants.opc_dstore_2, "");
+        addInfo("dstore_3", RuntimeConstants.opc_dstore_3, "");
+        addInfo("dsub", RuntimeConstants.opc_dsub, "");
+        addInfo("dup", RuntimeConstants.opc_dup, "");
+        addInfo("dup2", RuntimeConstants.opc_dup2, "");
+        addInfo("dup2_x1", RuntimeConstants.opc_dup2_x1, "");
+        addInfo("dup2_x2", RuntimeConstants.opc_dup2_x2, "");
+        addInfo("dup_x1", RuntimeConstants.opc_dup_x1, "");
+        addInfo("dup_x2", RuntimeConstants.opc_dup_x2, "");
+        addInfo("f2d", RuntimeConstants.opc_f2d, "");
+        addInfo("f2i", RuntimeConstants.opc_f2i, "");
+        addInfo("f2l", RuntimeConstants.opc_f2l, "");
+        addInfo("fadd", RuntimeConstants.opc_fadd, "");
+        addInfo("faload", RuntimeConstants.opc_faload, "");
+        addInfo("fastore", RuntimeConstants.opc_fastore, "");
+        addInfo("fcmpg", RuntimeConstants.opc_fcmpg, "");
+        addInfo("fcmpl", RuntimeConstants.opc_fcmpl, "");
+        addInfo("fconst_0", RuntimeConstants.opc_fconst_0, "");
+        addInfo("fconst_1", RuntimeConstants.opc_fconst_1, "");
+        addInfo("fconst_2", RuntimeConstants.opc_fconst_2, "");
+        addInfo("fdiv", RuntimeConstants.opc_fdiv, "");
+        addInfo("fload", RuntimeConstants.opc_fload, "i");
+        addInfo("fload_w", RuntimeConstants.opc_fload, "I");
+        addInfo("fload_0", RuntimeConstants.opc_fload_0, "");
+        addInfo("fload_1", RuntimeConstants.opc_fload_1, "");
+        addInfo("fload_2", RuntimeConstants.opc_fload_2, "");
+        addInfo("fload_3", RuntimeConstants.opc_fload_3, "");
+        addInfo("fmul", RuntimeConstants.opc_fmul, "");
+        addInfo("fneg", RuntimeConstants.opc_fneg, "");
+        addInfo("frem", RuntimeConstants.opc_frem, "");
+        addInfo("freturn", RuntimeConstants.opc_freturn, "");
+        addInfo("fstore", RuntimeConstants.opc_fstore, "i");
+        addInfo("fstore_w", RuntimeConstants.opc_fstore, "I");
+        addInfo("fstore_0", RuntimeConstants.opc_fstore_0, "");
+        addInfo("fstore_1", RuntimeConstants.opc_fstore_1, "");
+        addInfo("fstore_2", RuntimeConstants.opc_fstore_2, "");
+        addInfo("fstore_3", RuntimeConstants.opc_fstore_3, "");
+        addInfo("fsub", RuntimeConstants.opc_fsub, "");
+        addInfo("getfield", RuntimeConstants.opc_getfield, "field");
+        addInfo("getstatic", RuntimeConstants.opc_getstatic, "field");
+        addInfo("goto", RuntimeConstants.opc_goto, "label");
+        addInfo("goto_w", RuntimeConstants.opc_goto_w, "label");
+        addInfo("i2d", RuntimeConstants.opc_i2d, "");
+        addInfo("i2f", RuntimeConstants.opc_i2f, "");
+        addInfo("i2l", RuntimeConstants.opc_i2l, "");
+        addInfo("iadd", RuntimeConstants.opc_iadd, "");
+        addInfo("iaload", RuntimeConstants.opc_iaload, "");
+        addInfo("iand", RuntimeConstants.opc_iand, "");
+        addInfo("iastore", RuntimeConstants.opc_iastore, "");
+        addInfo("iconst_0", RuntimeConstants.opc_iconst_0, "");
+        addInfo("iconst_1", RuntimeConstants.opc_iconst_1, "");
+        addInfo("iconst_2", RuntimeConstants.opc_iconst_2, "");
+        addInfo("iconst_3", RuntimeConstants.opc_iconst_3, "");
+        addInfo("iconst_4", RuntimeConstants.opc_iconst_4, "");
+        addInfo("iconst_5", RuntimeConstants.opc_iconst_5, "");
+        addInfo("iconst_m1", RuntimeConstants.opc_iconst_m1, "");
+        addInfo("idiv", RuntimeConstants.opc_idiv, "");
+        addInfo("if_acmpeq", RuntimeConstants.opc_if_acmpeq, "label");
+        addInfo("if_acmpne", RuntimeConstants.opc_if_acmpne, "label");
+        addInfo("if_icmpeq", RuntimeConstants.opc_if_icmpeq, "label");
+        addInfo("if_icmpge", RuntimeConstants.opc_if_icmpge, "label");
+        addInfo("if_icmpgt", RuntimeConstants.opc_if_icmpgt, "label");
+        addInfo("if_icmple", RuntimeConstants.opc_if_icmple, "label");
+        addInfo("if_icmplt", RuntimeConstants.opc_if_icmplt, "label");
+        addInfo("if_icmpne", RuntimeConstants.opc_if_icmpne, "label");
+        addInfo("ifeq", RuntimeConstants.opc_ifeq, "label");
+        addInfo("ifge", RuntimeConstants.opc_ifge, "label");
+        addInfo("ifgt", RuntimeConstants.opc_ifgt, "label");
+        addInfo("ifle", RuntimeConstants.opc_ifle, "label");
+        addInfo("iflt", RuntimeConstants.opc_iflt, "label");
+        addInfo("ifne", RuntimeConstants.opc_ifne, "label");
+        addInfo("ifnonnull", RuntimeConstants.opc_ifnonnull, "label");
+        addInfo("ifnull", RuntimeConstants.opc_ifnull, "label");
+        addInfo("iinc", RuntimeConstants.opc_iinc, "ii");
+        addInfo("iinc_w", RuntimeConstants.opc_iinc, "Ii");
+        addInfo("iload", RuntimeConstants.opc_iload, "i");
+        addInfo("iload_w", RuntimeConstants.opc_iload, "I");
+        addInfo("iload_0", RuntimeConstants.opc_iload_0, "");
+        addInfo("iload_1", RuntimeConstants.opc_iload_1, "");
+        addInfo("iload_2", RuntimeConstants.opc_iload_2, "");
+        addInfo("iload_3", RuntimeConstants.opc_iload_3, "");
+        addInfo("imul", RuntimeConstants.opc_imul, "");
+        addInfo("ineg", RuntimeConstants.opc_ineg, "");
+        addInfo("instanceof", RuntimeConstants.opc_instanceof, "class");
+        addInfo("int2byte", RuntimeConstants.opc_int2byte, "");
+        addInfo("int2char", RuntimeConstants.opc_int2char, "");
+        addInfo("int2short", RuntimeConstants.opc_int2short, "");
+        // added this synonym
+        addInfo("i2b", RuntimeConstants.opc_int2byte, "");
+        // added this synonym
+        addInfo("i2c", RuntimeConstants.opc_int2char, "");
+        // added this synonym
+        addInfo("i2s", RuntimeConstants.opc_int2short, "");
+        addInfo("invokedynamic", RuntimeConstants.opc_invokedynamic, "method");
+        addInfo("invokeinterface", RuntimeConstants.opc_invokeinterface, "interface");
+        addInfo("invokenonvirtual", RuntimeConstants.opc_invokenonvirtual, "method");
+        // added this synonym
+        addInfo("invokespecial", RuntimeConstants.opc_invokenonvirtual, "method");
+        addInfo("invokestatic", RuntimeConstants.opc_invokestatic, "method");
+        addInfo("invokevirtual", RuntimeConstants.opc_invokevirtual, "method");
+        addInfo("ior", RuntimeConstants.opc_ior, "");
+        addInfo("irem", RuntimeConstants.opc_irem, "");
+        addInfo("ireturn", RuntimeConstants.opc_ireturn, "");
+        addInfo("ishl", RuntimeConstants.opc_ishl, "");
+        addInfo("ishr", RuntimeConstants.opc_ishr, "");
+        addInfo("istore", RuntimeConstants.opc_istore, "i");
+        addInfo("istore_w", RuntimeConstants.opc_istore, "I");
+        addInfo("istore_0", RuntimeConstants.opc_istore_0, "");
+        addInfo("istore_1", RuntimeConstants.opc_istore_1, "");
+        addInfo("istore_2", RuntimeConstants.opc_istore_2, "");
+        addInfo("istore_3", RuntimeConstants.opc_istore_3, "");
+        addInfo("isub", RuntimeConstants.opc_isub, "");
+        addInfo("iushr", RuntimeConstants.opc_iushr, "");
+        addInfo("ixor", RuntimeConstants.opc_ixor, "");
+        addInfo("jsr", RuntimeConstants.opc_jsr, "label");
+        addInfo("jsr_w", RuntimeConstants.opc_jsr_w, "label");
+        addInfo("l2d", RuntimeConstants.opc_l2d, "");
+        addInfo("l2f", RuntimeConstants.opc_l2f, "");
+        addInfo("l2i", RuntimeConstants.opc_l2i, "");
+        addInfo("ladd", RuntimeConstants.opc_ladd, "");
+        addInfo("laload", RuntimeConstants.opc_laload, "");
+        addInfo("land", RuntimeConstants.opc_land, "");
+        addInfo("lastore", RuntimeConstants.opc_lastore, "");
+        addInfo("lcmp", RuntimeConstants.opc_lcmp, "");
+        addInfo("lconst_0", RuntimeConstants.opc_lconst_0, "");
+        addInfo("lconst_1", RuntimeConstants.opc_lconst_1, "");
+        addInfo("ldc", RuntimeConstants.opc_ldc, "constant");
+        addInfo("ldc_w", RuntimeConstants.opc_ldc_w, "constant");
+        addInfo("ldc2_w", RuntimeConstants.opc_ldc2_w, "bigconstant");
+        addInfo("ldiv", RuntimeConstants.opc_ldiv, "");
+        addInfo("lload", RuntimeConstants.opc_lload, "i");
+        addInfo("lload_w", RuntimeConstants.opc_lload, "I");
+        addInfo("lload_0", RuntimeConstants.opc_lload_0, "");
+        addInfo("lload_1", RuntimeConstants.opc_lload_1, "");
+        addInfo("lload_2", RuntimeConstants.opc_lload_2, "");
+        addInfo("lload_3", RuntimeConstants.opc_lload_3, "");
+        addInfo("lmul", RuntimeConstants.opc_lmul, "");
+        addInfo("lneg", RuntimeConstants.opc_lneg, "");
+        addInfo("lookupswitch", RuntimeConstants.opc_lookupswitch, "switch");
+        addInfo("lor", RuntimeConstants.opc_lor, "");
+        addInfo("lrem", RuntimeConstants.opc_lrem, "");
+        addInfo("lreturn", RuntimeConstants.opc_lreturn, "");
+        addInfo("lshl", RuntimeConstants.opc_lshl, "");
+        addInfo("lshr", RuntimeConstants.opc_lshr, "");
+        addInfo("lstore", RuntimeConstants.opc_lstore, "i");
+        addInfo("lstore_w", RuntimeConstants.opc_lstore, "I");
+        addInfo("lstore_0", RuntimeConstants.opc_lstore_0, "");
+        addInfo("lstore_1", RuntimeConstants.opc_lstore_1, "");
+        addInfo("lstore_2", RuntimeConstants.opc_lstore_2, "");
+        addInfo("lstore_3", RuntimeConstants.opc_lstore_3, "");
+        addInfo("lsub", RuntimeConstants.opc_lsub, "");
+        addInfo("lushr", RuntimeConstants.opc_lushr, "");
+        addInfo("lxor", RuntimeConstants.opc_lxor, "");
+        addInfo("monitorenter", RuntimeConstants.opc_monitorenter, "");
+        addInfo("monitorexit", RuntimeConstants.opc_monitorexit, "");
+        addInfo("multianewarray", RuntimeConstants.opc_multianewarray, "marray");
+        addInfo("new", RuntimeConstants.opc_new, "class");
+        addInfo("newarray", RuntimeConstants.opc_newarray, "atype");
+        addInfo("nop", RuntimeConstants.opc_nop, "");
+        addInfo("pop", RuntimeConstants.opc_pop, "");
+        addInfo("pop2", RuntimeConstants.opc_pop2, "");
+        addInfo("putfield", RuntimeConstants.opc_putfield, "field");
+        addInfo("putstatic", RuntimeConstants.opc_putstatic, "field");
+        addInfo("ret", RuntimeConstants.opc_ret, "i");
+        addInfo("ret_w", RuntimeConstants.opc_ret, "I");
+        addInfo("return", RuntimeConstants.opc_return, "");
+        addInfo("saload", RuntimeConstants.opc_saload, "");
+        addInfo("sastore", RuntimeConstants.opc_sastore, "");
+        addInfo("sipush", RuntimeConstants.opc_sipush, "i");
+        addInfo("swap", RuntimeConstants.opc_swap, "");
+        addInfo("tableswitch", RuntimeConstants.opc_tableswitch, "switch");
+    }
+
+};
+
+/* --- Revision History ---------------------------------------------------
+--- Iouri Kharon, Aug 10 2006
+    Removed 'wide' as 'ignored' instruction
+    Added definition for '_w' aliases for some instructions
+--- Iouri Kharon, Mar 14 2006
+    Change: 'ldc_w' is NOT synonym for 'ldc'
+--- Iouri Kharon, Dec 23 2005
+    Added invokedynamic
+    Change: 'jsr_w' is NOT synonym for 'jsr'
+--- Jonathan Meyer, Feb 8 1997
+    Added invokespecial as a synonym for invokenonvirtual
+*/
diff --git a/jasmin/jasmin-2.4/src/jasmin/Main.java b/jasmin/jasmin-2.4/src/jasmin/Main.java
new file mode 100644
index 0000000..ab6a9d6
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin/Main.java
@@ -0,0 +1,211 @@
+/* --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+ > File:        jasmin/src/jasmin/Main.java
+ > Purpose:     Runs Jasmin, parsing any command line arguments
+ > Author:      Jonathan Meyer, 10 July 1996
+ */
+
+
+package jasmin;
+
+import java.io.*;
+import jas.jasError;
+import jas.StackMap;
+
+/**
+ * Main is the main entry point for Jasmin - it supplies the main()
+ * method, as well as a few other useful odds and ends.
+ */
+public class Main {
+
+    /**
+     * The Jasmin version
+     */
+    public static final String version = "v2.4";
+    public static final boolean DEBUG = false;
+
+    /* Path for place generated files */
+    private String dest_path = null;
+
+    /* Codepage for input files */
+    private String encoding = null;
+
+    /* Autogenerate linenumbers */
+    private boolean generate_linenum = false;
+
+    /* Commandline syntax (help) */
+    private static final String help1 =
+"usage: jasmin [-d <outpath>] [-g] [-e <encoding>] <file> [<file> ...]\n";
+    private static final String help2 =
+"           where   -g - autogenerate linenumbers\n" +
+"                   -e - codepage for inputfile encoding\n" +
+"                   -d - path for generated classfiles\n" +
+"                file  - sourcefile (wildcards are allowed)\n";
+    private static final String help3 =
+"   or: jasmin -version\n" +
+"   or: jasmin -help";
+
+    private static void unarg_option(String opt)
+    {
+        System.err.println("Invaid command line: option " +opt+ " required argument");
+        System.exit(-1);
+    }
+
+    private static void duplicate_option(String opt)
+    {
+        System.err.println("Duplicate option " +opt+ " ignored");
+    }
+
+    /**
+     * Called to assemble a single file.
+     * @param fname is the name of the file containing the Jasmin source code.
+     */
+    public final void assemble(String fname)
+    {
+        File out_file = null;
+        FileOutputStream outp = null;
+        File file = new File(fname);
+        ClassFile classFile = new ClassFile();
+        String iocause = fname + ": file not found";
+
+        try {
+            BufferedReader inp;
+            {
+              FileInputStream fs = new FileInputStream(fname);
+              InputStreamReader ir;
+              if(encoding == null)
+                ir = new InputStreamReader(fs);
+              else
+                ir = new InputStreamReader(fs, encoding);
+              inp = new BufferedReader(ir);
+            }
+            classFile.readJasmin(inp, file.getName(), generate_linenum);
+            inp.close();
+
+            // if we got some errors, don't output a file - just return.
+            if (classFile.errorCount() > 0) {
+                System.err.println(fname + ": Found "
+                                    + classFile.errorCount() + " errors");
+                return;
+            }
+
+            String class_path[] = (ScannerUtils.splitClassField(
+                                                classFile.getClassName()));
+            String class_name = class_path[1];
+
+            // determine where to place this class file
+            String dest_dir = dest_path;
+            if (class_path[0] != null) {
+                String class_dir = ScannerUtils.convertChars(
+                                           class_path[0], "./",
+                                           File.separatorChar);
+                if (dest_dir != null) {
+                    dest_dir = dest_dir + File.separator + class_dir;
+                } else {
+                    dest_dir = class_dir;
+                }
+            }
+            iocause = class_name + ".class: file can't be created";
+            if (dest_dir == null) {
+                out_file = new File(class_name + ".class");
+            } else {
+                out_file = new File(dest_dir, class_name + ".class");
+
+                // check that dest_dir exists
+
+                File dest = new File(dest_dir);
+                if (!dest.exists()) {
+                    dest.mkdirs();
+                }
+
+                if (!dest.isDirectory()) {
+                    throw new IOException("Cannot create directory");
+                }
+            }
+
+            outp = new FileOutputStream(out_file);
+            classFile.write(outp);
+            outp.close();
+            outp = null; // as marker
+            System.out.println("Generated: " + out_file.getPath());
+
+        } catch (java.io.FileNotFoundException e) {
+            System.err.println(iocause);
+            System.exit(-1);
+        } catch (jasError e) {
+            classFile.report_error("JAS Error: " + e.getMessage(), e.numTag);
+        } catch (Exception e) {
+            if(DEBUG)
+                e.printStackTrace();
+            classFile.report_error(fname + ": exception - <" +
+                              e.getClass().getName() + "> " + e.getMessage() +
+                              ".");
+        }
+        if (classFile.errorCount() > 0) {
+            System.err.println(fname + ": Found "
+                               + classFile.errorCount() + " errors");
+            if (outp != null) {
+                try {
+                  outp.close();
+                  out_file.delete();
+                } catch(Exception e) {}
+            }
+        }
+    }
+
+    public static void main(String args[])
+    {
+        new Main().run(args);
+    }
+
+    public final void run(String args[])
+    {
+        int i;
+
+        String files[] = new String[args.length];
+        int num_files = 0;
+
+        if (args.length == 0) {
+          System.err.println(help1 + help3);
+          System.exit(-1);
+        }
+
+        for (i = 0; i < args.length; i++) {
+            if (args[i].equals("-help") || args[i].equals("-?")) {
+              System.err.println(help1 + help2 + help3);
+              System.exit(0);
+            }
+            if (args[i].equals("-version")) {
+                System.out.println("Jasmin version: " + version);
+                if(DEBUG)
+                    System.out.println("(compiled with DEBUG flag on)");
+                System.exit(0);
+            }
+            if (args[i].equals("-g")) {
+                generate_linenum = true;
+            } else if (args[i].equals("-d")) {
+                if (++i >= args.length) unarg_option("-d");
+                if (dest_path != null) duplicate_option("-d");
+                else dest_path = args[i];
+            } else if (args[i].equals("-e")) {
+                if (++i >= args.length) unarg_option("-e");
+                if (encoding != null) duplicate_option("-e");
+                else encoding = args[i];
+            } else {
+                files[num_files++] = args[i];
+            }
+        }
+
+        for (i = 0; i < num_files; i++) {
+            StackMap.reinit();
+            assemble(files[i]);
+        }
+    }
+};
+
+/* --- Revision History ---------------------------------------------------
+--- Iouri Kharon, May 07 2010, redesing for dynamic class creation
+--- Iouri Kharon, Feb 17 2006, correct some IO diagnostics
+--- Jonathan Meyer, Mar 1 1997 tidied error reporting, renamed Jasmin->ClassFile
+--- Jonathan Meyer, Feb 8 1997 added the assemble() method
+--- Jonathan Meyer, July 24 1996 added -version flag.
+*/
diff --git a/jasmin/jasmin-2.4/src/jasmin/ReservedWords.java b/jasmin/jasmin-2.4/src/jasmin/ReservedWords.java
new file mode 100644
index 0000000..b77c275
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin/ReservedWords.java
@@ -0,0 +1,104 @@
+/* --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+ > File:        jasmin/src/jasmin/ReservedWords.java
+ > Purpose:     Reserved words for Jasmin
+ > Author:      Jonathan Meyer, 10 July 1996
+ */
+
+package jasmin;
+
+import java.util.Hashtable;
+import java_cup.runtime.*;
+
+abstract class ReservedWords {
+    private static Hashtable reserved_words;
+
+    public static token get(String name) {
+    	return (token)reserved_words.get(name);
+    }
+
+    public static boolean contains(String name) {
+    	return reserved_words.get(name) != null;
+    }
+
+    //
+    // scanner initializer - sets up reserved_words table
+    //
+    static {
+        reserved_words = new Hashtable();
+
+        // Jasmin directives
+        reserved_words.put(".annotation", new token(sym.DANNOTATION));
+        reserved_words.put(".attribute", new token(sym.DATTRIBUTE));
+        reserved_words.put(".bytecode", new token(sym.DBYTECODE));
+        reserved_words.put(".catch", new token(sym.DCATCH));
+        reserved_words.put(".class", new token(sym.DCLASS));
+        reserved_words.put(".deprecated", new token(sym.DDEPRECATED));
+        reserved_words.put(".end", new token(sym.DEND));
+        reserved_words.put(".field", new token(sym.DFIELD));
+        reserved_words.put(".implements", new token(sym.DIMPLEMENTS));
+        reserved_words.put(".inner", new token(sym.DINNER));
+        reserved_words.put(".interface", new token(sym.DINTERFACE));
+        reserved_words.put(".limit", new token(sym.DLIMIT));
+        reserved_words.put(".line", new token(sym.DLINE));
+        reserved_words.put(".method", new token(sym.DMETHOD));
+        reserved_words.put(".set", new token(sym.DSET));
+        reserved_words.put(".source", new token(sym.DSOURCE));
+        reserved_words.put(".super", new token(sym.DSUPER));
+        reserved_words.put(".throws", new token(sym.DTHROWS));
+        reserved_words.put(".var", new token(sym.DVAR));
+        reserved_words.put(".debug", new token(sym.DDEBUG));
+        reserved_words.put(".enclosing", new token(sym.DENCLOSING));
+        reserved_words.put(".signature", new token(sym.DSIGNATURE));
+        reserved_words.put(".stack", new token(sym.DSTACK));
+
+        // reserved_words used in Jasmin directives
+        reserved_words.put("field", new token(sym.FIELD));
+        reserved_words.put("from", new token(sym.FROM));
+        reserved_words.put("method", new token(sym.METHOD));
+        reserved_words.put("to", new token(sym.TO));
+        reserved_words.put("is", new token(sym.IS));
+        reserved_words.put("using", new token(sym.USING));
+        reserved_words.put("signature", new token(sym.SIGNATURE));
+        reserved_words.put("stack", new token(sym.STACK));
+        reserved_words.put("offset", new token(sym.OFFSET));
+        reserved_words.put("locals", new token(sym.LOCALS));
+        reserved_words.put("use", new token(sym.USE));
+        reserved_words.put("inner", new token(sym.INNER));
+        reserved_words.put("outer", new token(sym.OUTER));
+        reserved_words.put("class", new token(sym.CLASS));
+        reserved_words.put("visible", new token(sym.VISIBLE));
+        reserved_words.put("invisible", new token(sym.INVISIBLE));
+        reserved_words.put("visibleparam", new token(sym.VISIBLEPARAM));
+        reserved_words.put("invisibleparam", new token(sym.INVISIBLEPARAM));
+
+        // Special-case instructions
+        reserved_words.put("tableswitch", new token(sym.TABLESWITCH));
+        reserved_words.put("lookupswitch", new token(sym.LOOKUPSWITCH));
+        reserved_words.put("default", new token(sym.DEFAULT));
+
+        // Access flags
+        reserved_words.put("public", new token(sym.PUBLIC));
+        reserved_words.put("private", new token(sym.PRIVATE));
+        reserved_words.put("protected", new token(sym.PROTECTED));
+        reserved_words.put("static", new token(sym.STATIC));
+        reserved_words.put("final", new token(sym.FINAL));
+        reserved_words.put("synchronized", new token(sym.SYNCHRONIZED));
+        reserved_words.put("volatile", new token(sym.VOLATILE));
+        reserved_words.put("transient", new token(sym.TRANSIENT));
+        reserved_words.put("native", new token(sym.NATIVE));
+        reserved_words.put("interface", new token(sym.INTERFACE));
+        reserved_words.put("abstract", new token(sym.ABSTRACT));
+
+        reserved_words.put("annotation", new token(sym.ANNOTATION));
+        reserved_words.put("enum", new token(sym.ENUM));
+        reserved_words.put("bridge", new token(sym.BRIDGE));
+        reserved_words.put("varargs", new token(sym.VARARGS));
+        reserved_words.put("fpstrict", new token(sym.STRICT));
+        reserved_words.put("synthetic", new token(sym.SYNTHETIC));
+    }
+}
+
+/* --- Revision History ---------------------------------------------------
+--- Iouri Kharon, Aug 10 2006
+    Added 'Wide' prefix support to IincOperand
+*/
diff --git a/jasmin/jasmin-2.4/src/jasmin/Scanner.java b/jasmin/jasmin-2.4/src/jasmin/Scanner.java
new file mode 100644
index 0000000..1678dd2
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin/Scanner.java
@@ -0,0 +1,423 @@
+/* --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+ > File:        jasmin/src/jasmin/Scanner.java
+ > Purpose:     Tokenizer for Jasmin
+ > Author:      Jonathan Meyer, 10 July 1996
+ */
+
+/* Scanner.java - class for tokenizing Jasmin files. This is rather
+ * cheap and cheerful.
+*/
+
+package jasmin;
+
+import jas.*;
+import java_cup.runtime.*;
+import java.util.*;
+import java.io.Reader;
+
+class Scanner {
+  Reader inp;
+
+    // single lookahead character
+    int next_char;
+
+    // temporary buffer
+    char chars[];
+    static private int chars_size = 512;
+
+    // Whitespace characters
+    static final String WHITESPACE = " \n\t\r";
+
+    // Separator characters
+    static final String SEPARATORS = WHITESPACE + ":=";
+
+    /*
+    // Character can be present in signature
+    static final String SIGCHARS = ";:()[/.^*+-<>@";
+    */
+
+    // used for error reporting to print out where an error is on the line
+    public int line_num, token_line_num, char_num, int_char_num, int_line_num;
+    public StringBuffer line;
+    public String int_line;
+
+    // used by the .set directive to define new variables.
+    public Hashtable dict = new Hashtable();
+
+    //
+    // returns true if a character code is a whitespace character
+    //
+    protected static boolean whitespace(int c) {
+        return (WHITESPACE.indexOf(c) != -1);
+    }
+
+    //
+    // returns true if a character code is a separator character
+    //
+    protected static boolean separator(int c) {
+        return (c == -1 || SEPARATORS.indexOf(c) != -1);
+    }
+
+
+    //
+    // Advanced the input by one character
+    //
+    protected void advance() throws java.io.IOException
+    {
+        next_char = inp.read();
+        switch (next_char) {
+        case -1:  // EOF
+            if (char_num == 0) {
+                char_num = -1;
+                break;
+            }
+            next_char = '\n';
+            // pass thru
+        case '\n': // a new line
+            line_num++;
+            char_num = 0;
+            break;
+        default:
+            line.append((char)next_char);
+            char_num++;
+            return;
+        }
+        line.setLength(0);
+    }
+
+    //
+    // initialize the scanner
+    //
+    public Scanner(Reader i) throws java.io.IOException, jasError
+    {
+        inp = i;
+        line_num = 1;
+        char_num = 0;
+        line = new StringBuffer();
+        chars = new char[chars_size];
+        next_char = 0;  // no start comment
+        skip_empty_lines();
+        if ( next_char == -1 )
+            throw new jasError("empty source file");
+    }
+
+    private void chars_expand()
+    {
+        char temp[] = new char[chars_size * 2];
+        System.arraycopy(chars, 0, temp, 0, chars_size);
+        chars_size *= 2;
+        chars = temp;
+    }
+
+    private void skip_empty_lines() throws java.io.IOException
+    {
+        for (;;) {
+            if (next_char != ';') {
+                do { advance(); } while (whitespace(next_char));
+                if (next_char != ';')
+                    return;
+            }
+            do {
+                advance();
+                if (next_char == -1)
+                   return;
+            } while (next_char != '\n');
+        }
+    }
+
+    private char uniEscape()
+                throws java.io.IOException, jasError
+    {
+        int res = 0;
+        for(int i = 0; i < 4; i++) {
+            advance();
+            if(next_char == -1)
+                return 0;
+
+            int tmp = Character.digit((char)next_char, 16);
+            if (tmp == -1)
+                throw new jasError("Bad '\\u' escape sequence");
+            res = (res << 4) | tmp;
+        }
+        return (char)res;
+    }
+
+    private char nameEscape()
+                throws java.io.IOException, jasError
+    {
+        advance();
+        if (next_char != 'u')
+            throw new jasError("Only '\\u' escape sequence allowed in names");
+        char chval = uniEscape();
+        if (next_char == -1)
+            throw new jasError("Left over '\\u' escape sequence");
+        /*
+        if (   SIGCHARS.indexOf(chval) == -1
+            && (   !Character.isJavaIdentifierPart(chval)
+                || Character.isIdentifierIgnorable(chval)))
+        {
+            throw new jasError("Invalid unicode char from name/signature");
+        }
+        */
+        return chval;
+    }
+
+    //
+    // recognize and return the next complete token
+    //
+    public token next_token()
+                throws java.io.IOException, jasError
+    {
+        token_line_num = line_num;
+
+        for (;;) switch (next_char) {
+            case ';':  // a comment
+            case '\n':
+                // return single SEP token (skip multiple newlines
+                // interspersed with whitespace or comments)
+                skip_empty_lines();
+                token_line_num = line_num;
+                return new token(sym.SEP);
+
+            case -1:                // EOF token
+                char_num = -1;
+                return new token(sym.EOF);
+
+            case '-': case '+':
+            case '0': case '1': case '2': case '3': case '4':
+            case '5': case '6': case '7': case '8': case '9':
+            case '.':                       // a number
+            {
+                int pos = 0;
+                do {
+                    chars[pos] = (char)next_char;
+                    pos++;
+                    if(pos == chars_size) chars_expand();
+                    advance();
+                }while(!separator(next_char));
+
+                String str = new String(chars, 0, pos);
+                token tok;
+
+                // This catches directives like ".method"
+                if ((tok = ReservedWords.get(str)) != null)
+                    return tok;
+
+                Number num;
+                try {
+                    num = ScannerUtils.convertNumber(str);
+                } catch (NumberFormatException e) {
+                    if (chars[0] != '.')
+                        throw new jasError("Badly formatted number");
+                    throw new jasError("Unknown directive or badly formed number.");
+                }
+
+                if (num instanceof Integer) {
+                    int_line     = line.toString();
+                    int_line_num = token_line_num;
+                    int_char_num = char_num;
+                    return new int_token(sym.Int, num.intValue());
+                }
+                return new num_token(sym.Num, num);
+            }
+
+            case '"':   // quoted string
+            {
+                boolean already = false;
+                for (int pos = 0; ; ) {
+                    if (already) already = false;
+                    else advance();
+
+                    if (next_char == '"') {
+                        advance(); // skip close quote
+                        return new str_token(sym.Str, new String(chars, 0, pos));
+                    }
+
+                    if(next_char == -1)
+                        throw new jasError("Unterminated string");
+
+                    char chval = (char)next_char;
+
+                    if (chval == '\\') {
+                        advance();
+                        switch (next_char) {
+                        case -1: already = true; continue;
+                        case 'n':   chval = '\n'; break;
+                        case 'r':   chval = '\r'; break;
+                        case 't':   chval = '\t'; break;
+                        case 'f':   chval = '\f'; break;
+                        case 'b':   chval = '\b'; break;
+                        case '"' :  chval = '"';  break;
+                        case '\'' : chval = '\''; break;
+                        case '\\' : chval = '\\'; break;
+
+                        case 'u':
+                            chval = uniEscape();
+                            if(next_char == -1) {
+                                already = true;
+                                continue;
+                            }
+                            break;
+
+                        case '0': case '1': case '2': case '3':
+                        case '4': case '5': case '6': case '7':
+                        {
+                            int res = next_char&7;
+                            advance();
+                            if (next_char < '0' || next_char > '7')
+                                already = true;
+                            else {
+                                res = res*8 + (next_char&7);
+                                advance();
+                                if (next_char < '0' || next_char > '7')
+                                    already = true;
+                                else {
+                                    int val = res*8 + (next_char&7);
+                                    if (val >= 0x100)
+                                        already = true;
+                                    else
+                                        res = val;
+                                }
+                            }
+                            chval = (char)res;
+                        }
+                        break;
+
+                        default:
+                            throw new jasError("Bad backslash escape sequence");
+                        }
+                    }
+                    chars[pos] = chval;
+                    pos++;
+                    if(pos == chars_size) chars_expand();
+                }
+            }
+
+            case '\'':  // quotation for overloading reserved words
+                for (int pos = 0; ; ) {
+                    advance();
+                    if (separator(next_char))
+                        throw new jasError("Unterminated ''-enclosed name");
+                    if (next_char == '\'') {
+                        if (pos == 0)
+                            throw new jasError("Empty ''-enclosed name");
+                        advance(); // skip close quote
+                        if (!separator(next_char))
+                            throw new jasError("Not separator after ''-enclosed name");
+                        return new str_token(sym.Word, new String(chars, 0, pos));
+                    }
+                    char chval = (char)next_char;
+                    if (next_char == '\\')
+                        chval = nameEscape();
+                    chars[pos] = chval;
+                    pos++;
+                    if(pos == chars_size) chars_expand();
+                }
+
+            case ' ':
+            case '\t':
+            case '\r':              // whitespace
+                advance();
+                break;
+
+            case '=':               // EQUALS token
+                advance();
+                return new token(sym.EQ);
+
+            case ':':               // COLON token
+                advance();
+                return new token(sym.COLON);
+
+            default:
+            {
+                // read up until a separatorcharacter
+               int pos = 0;
+               boolean only_name = false;
+
+               do {
+                  char chval = (char)next_char;
+                  if (next_char == '\\') {
+                      chval = nameEscape();
+                      only_name = true;
+                  }
+                  chars[pos] = chval;
+                  pos++;
+                  if(pos == chars_size) chars_expand();
+                  advance();
+                }while(!separator(next_char));
+                // convert the byte array into a String
+                String str = new String(chars, 0, pos);
+
+                if (!only_name) {
+                    token tok;
+
+                    // Jasmin keyword or directive ?
+                    if ((tok = ReservedWords.get(str)) != null)
+                        return tok;
+
+                    // its a JVM instruction ?
+                    if (InsnInfo.contains(str))
+                        return new str_token(sym.Insn, str);
+
+                    if (str.charAt(0) == '$') {
+                        String s = str.substring(1);
+                        Object v;
+                        int n = 10;
+                        boolean neg = false;
+                        boolean sign = false;
+                        switch(s.charAt(0)) {
+                        default:
+                            break;
+
+                        case '-':
+                            neg = true;;
+                        case '+':
+                            s = s.substring(1);
+                            if (s.startsWith("0x")) {
+                                n = 16;
+                                s = s.substring(2);
+                            }
+                            try {
+                                n = Integer.parseInt(s, n);
+                            } catch (NumberFormatException e) {
+                                throw new jasError("Badly relative offset number");
+                            }
+                            if(neg) n = -n;
+                                return new relative_num_token(sym.Relative, n);
+                        }
+                        // Perform variable substitution
+                        if ((v = dict.get(s)) != null)
+                            return (token)v;
+                    } // not begin from '$'
+                } // !only_name
+                // Unrecognized string token (e.g. a classname)
+                return new str_token(sym.Word, str);
+            } /* default */
+        } /* switch and for */
+    }
+
+};
+
+/* --- Revision History ---------------------------------------------------
+--- Iouri Kharon, Mar 13 2006
+    Added support for '\\u' escape sequnce in name/signature
+    Added '' enclosed names (overload of reserved words)
+--- Iouri Kharon, Feb 17 2006
+    Remove infinite loop when last line in source file do not have EOL
+--- Iouri Kharon, Dec 19 2005
+    Added '\\u' escape sequence
+    Change '\octal' escape sequence
+    Added very long string support
+--- Daniel Reynaud, Oct 19 2005
+    Added '\\' escape sequence
+--- Jonathan Meyer, Feb 8 1997
+    Converted to be non-static
+--- Jonathan Meyer, Oct 30 1996
+    Added support for more \ escapes in quoted strings (including octals).
+--- Jonathan Meyer, Oct 1 1996
+    Added .interface and .implements
+--- Jonathan Meyer, July 25 1996
+    changed IN to IS. Added token_line_num, which is the line number of the
+    last token returned by next_token().
+--- Jonathan Meyer, July 24 1996 added mods to recognize '\r' as whitespace.
+*/
diff --git a/jasmin/jasmin-2.4/src/jasmin/ScannerUtils.java b/jasmin/jasmin-2.4/src/jasmin/ScannerUtils.java
new file mode 100644
index 0000000..a99ed2e
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin/ScannerUtils.java
@@ -0,0 +1,156 @@
+/* --- Copyright Jonathan Meyer 1997. All rights reserved. -----------------
+ > File:        jasmin/src/jasmin/ScannerUtils.java
+ > Purpose:     Various static methods utilized to breakdown strings
+ > Author:      Jonathan Meyer, 8 Feb 1997
+ */
+
+package jasmin;
+
+abstract class ScannerUtils {
+
+    //
+    // Converts a string of a given radix to an int or a long
+    // (uses smallest format that will hold the number)
+    //
+    public static Number convertInt(String str, int radix)
+                throws NumberFormatException
+    {
+        long x = Long.parseLong(str, radix);
+        if (x <= (long)Integer.MAX_VALUE && x >= (long)Integer.MIN_VALUE) {
+            return new Integer((int)x);
+        }
+        return new Long(x);
+    }
+
+    //
+    // Converts a string to a number (int, float, long, or double).
+    // (uses smallest format that will hold the number)
+    //
+    public static Number convertNumber(String str)
+                throws NumberFormatException
+    {
+        if(str.startsWith("+")) {
+            return new Integer(str.substring(1,str.length()));
+        }
+        if (str.startsWith("0x")) {
+            // base 16 integer
+            return (convertInt(str.substring(2), 16));
+        } else if (str.indexOf('.') != -1) {
+            // make a double
+            Double dc = new Double(str);
+            // if number have suffix 'd' force double value
+            // thanks to JD Brennan
+            if(!str.endsWith("d")) {
+                double x = dc.doubleValue();
+
+                // see if it will fit into a float...
+                if (x <= (double)Float.MAX_VALUE && x >= (float)Float.MIN_VALUE) {
+                    // bug fix here thanks to Peter Chubb (replaced int->float)
+                    return new Float((float)x);
+                }
+                // if not, return a double
+            }
+            return dc;
+        } else {
+            // assume long or int in base 10
+            return (convertInt(str, 10));
+        }
+    }
+
+    //
+    // Maps '.' characters to '/' characters in a string
+    //
+    public static String convertDots(String orig_name)
+    {
+        return convertChars(orig_name, ".", '/');
+    }
+
+    //
+    // Maps chars to toChar in a given String
+    //
+    public static String convertChars(String orig_name,
+                                      String chars, char toChar)
+    {
+        StringBuffer tmp = new StringBuffer(orig_name);
+        int i;
+        for (i = 0; i < tmp.length(); i++) {
+            if (chars.indexOf(tmp.charAt(i)) != -1) {
+                tmp.setCharAt(i, toChar);
+            }
+        }
+        return new String(tmp);
+    }
+
+    //
+    // Splits a string like:
+    //     "a/b/c/d(xyz)v"
+    // into three strings:
+    //     "a/b/c", "d", "(xyz)v"
+    //
+    public static String[] splitClassMethodSignature(String name) {
+        String result[] = new String[3];
+        int i, pos = 0, sigpos = 0;
+        for (i = 0; i < name.length(); i++) {
+            char c = name.charAt(i);
+            if (c == '.' || c == '/') pos = i;
+            else if (c == '(') {sigpos = i; break; }
+        }
+        try {
+            result[0] = convertDots(name.substring(0, pos));
+            result[1] = name.substring(pos + 1, sigpos);
+            result[2] = convertDots(name.substring(sigpos));
+        } catch(StringIndexOutOfBoundsException e) {
+            throw new IllegalArgumentException("malformed signature : "+name);
+        }
+        return result;
+    }
+
+    //
+    // Splits a string like:
+    //    "java/lang/System/out"
+    // into two strings:
+    //    "java/lang/System" and "out"
+    //
+    public static String[] splitClassField(String name)
+    {
+        String result[] = new String[2];
+        int i, pos = -1, sigpos = 0;
+        for (i = 0; i < name.length(); i++) {
+            char c = name.charAt(i);
+            if (c == '.' || c == '/') pos = i;
+        }
+        if (pos == -1) {    // no '/' in string
+            result[0] = null;
+            result[1] = name;
+        } else {
+            result[0] = convertDots(name.substring(0, pos));
+            result[1] = name.substring(pos + 1);
+        }
+
+        return result;
+    }
+
+    // Splits a string like:
+    //      "main(Ljava/lang/String;)V
+    // into two strings:
+    //      "main" and "(Ljava/lang/String;)V"
+    //
+    public static String[] splitMethodSignature(String name)
+    {
+        String result[] = new String[2];
+        int i, sigpos = 0;
+        for (i = 0; i < name.length(); i++) {
+            char c = name.charAt(i);
+            if (c == '(') {sigpos = i; break; }
+        }
+        result[0] = name.substring(0, sigpos);
+        result[1] = convertDots(name.substring(sigpos));
+
+        return result;
+    }
+}
+
+/* --- Revision History ---------------------------------------------------
+--- Iouri Kharon, May 07 2010
+    'd' in real constant, force double mode.
+*/
diff --git a/jasmin/jasmin-2.4/src/jasmin/num_token.java b/jasmin/jasmin-2.4/src/jasmin/num_token.java
new file mode 100644
index 0000000..6a08e66
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin/num_token.java
@@ -0,0 +1,33 @@
+
+package jasmin;
+import java_cup.*;
+
+/** This subclass of token represents symbols that need to maintain one
+ *  number value as an attribute.  It maintains that value in the public
+ *  field num_val.
+ *
+ * @see java_cup.runtime.str_token
+ * @version last updated: 1/7/96
+ * @author  Jon Meyer
+ */
+
+class num_token extends java_cup.runtime.token {
+
+  /** Full constructor. */
+  public num_token(int term_num, Number v)
+    {
+      /* super class does most of the work */
+      super(term_num);
+
+      num_val = v;
+    }
+
+  /** Constructor with default value of 0 */
+  public num_token(int term_num)
+    {
+      this(term_num, new Integer(0));
+    }
+
+  /** The stored number reference. */
+  public Number num_val;
+};
diff --git a/jasmin/jasmin-2.4/src/jasmin/parser.cup b/jasmin/jasmin-2.4/src/jasmin/parser.cup
new file mode 100644
index 0000000..158a8c5
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin/parser.cup
@@ -0,0 +1,898 @@
+/* --- Copyright Jonathan Meyer 1996. All rights reserved. -----------------
+ > File:        jasmin/src/jasmin/parser.cup
+ > Purpose:     Parser for Jasmin
+ > Author:      Jonathan Meyer, 10 July 1996
+ */
+
+/*
+ * parser.cup - Java CUP file containing LALR(1) grammar for Jasmin,
+ * along with calls to ClassFile methods to output bytecode.
+ */
+
+
+package jasmin;
+
+import java_cup.runtime.*;
+import jas.*;
+import java.io.*;
+import java.util.Hashtable;
+
+/* Preliminaries to set up and use the scanner.  */
+
+action code {:
+    short access_val;
+	public ClassFile classFile;
+    public Scanner scanner;
+:};
+
+parser code {:
+
+	// parser code
+
+	public Scanner scanner;
+	public ClassFile classFile;
+
+	public void report_error(String message, Object info) {
+    	    classFile.report_error("Warning - " + message);
+	}
+
+	public void report_fatal_error(String message, Object info)  {
+    	    classFile.report_error("Error - " + message);
+    	    // System.exit(-1);
+	}
+
+	parser(ClassFile classFile, Scanner scanner) {
+		super();
+
+	    this.scanner = scanner;
+	    this.classFile = classFile;
+	}
+:};
+
+//debug with System.err.println;
+
+init with {:
+	action_obj.scanner = scanner;
+	action_obj.classFile = classFile;
+:};
+
+scan with {:
+    return scanner.next_token();
+:};
+
+
+
+/* Terminals (tokens returned by the scanner). */
+terminal token
+    // Directives (words beginning with a '.')
+    DCATCH, DCLASS, DEND, DFIELD, DLIMIT, DLINE, DMETHOD, DSET, DSUPER,
+    DSOURCE, DTHROWS, DVAR, DIMPLEMENTS, DINTERFACE, DBYTECODE, DDEBUG,
+    DENCLOSING, DSIGNATURE, DSTACK, DATTRIBUTE, DDEPRECATED, DINNER,
+    DANNOTATION,
+
+    // keywords for directives
+    USING, IS, FROM, METHOD, SIGNATURE, STACK, OFFSET, LOCALS, FIELD, CLASS,
+    TO, INNER, OUTER, VISIBLE, INVISIBLE, VISIBLEPARAM, INVISIBLEPARAM, USE,
+
+    // access types
+    ABSTRACT, FINAL, INTERFACE, NATIVE, PRIVATE, PROTECTED, PUBLIC, STATIC,
+    SYNCHRONIZED, TRANSIENT, VOLATILE,
+    // added these for java 1.5 compliance :
+    ANNOTATION, ENUM, BRIDGE, VARARGS, STRICT, SYNTHETIC,
+
+    // complex instructions
+    LOOKUPSWITCH, TABLESWITCH, DEFAULT,
+
+    // special symbols
+    EQ, SEP, COLON
+ ;
+
+terminal str_token Str, Word, Insn;
+terminal int_token Int;
+terminal num_token Num;
+terminal relative_num_token Relative;
+
+non terminal str_token classname, inner_name, inner_inner, inner_outer, optional_signature;
+non terminal var_token optional_default, item, any_item;
+
+/* Non terminals */
+non terminal symbol
+       access_item, access_items, access_list, catch_expr, class_spec,
+       complex_instruction, defmethod, directive, endmethod, field_list,
+       field_spec, fields, instruction, implements, implements_list, implements_spec,
+       jas_file, label, limit_expr, lookup,
+       lookup_args, lookup_default, lookup_entry, lookup_list, method_list,
+       method_spec, methods, set_expr, simple_instruction, source_spec,
+       statement, statements, stmnt, super_spec, table, table_args, line_expr,
+       table_default, table_entry, table_list, throws_expr, var_expr, bytecode_spec,
+       debug_extension, enclosing_spec, signature_spec, signature_expr, jasmin_header,
+       debug_list, debug_spec, deprecated_spec, deprecated_expr,
+       generic_attributes, generic_list, generic_spec, generic_expr,
+       field_start, endfield, field_exts, field_ext_list, field_ext_expr,
+       inners, inner_list, inner_spec,
+
+   // used for Annotation attributes :
+       annotations, ann_cls_list, ann_cls_spec, endannotation, ann_cls_expr,
+       ann_clf_expr, ann_met_expr, ann_arglist, ann_arg_list, ann_arg_spec,
+       ann_def_spec, ann_def_val, ann_value_items, ann_value, ann_def_expr,
+       ann_arg_expr, ann_nest, endannotationsep, ann_ann_value, ann_ann_list,
+       ann_value_list,
+
+   // used for StackMap attributes :
+       defstack, stack_map_frame_desc, endstack, stack_offset_def, stack_items,
+       stack_item, stack_item_expr, stackmap, defstack_same, defstack_same_expr
+
+;
+
+non terminal int_token access;
+
+/* The grammar */
+
+jas_file ::=
+        jasmin_header
+        inners
+        fields
+        methods
+;
+
+jasmin_header ::=
+    bytecode_spec
+    source_spec
+    class_spec
+    super_spec
+    implements
+    signature_spec
+    enclosing_spec
+    deprecated_spec
+    annotations
+    generic_attributes
+    debug_extension
+  {: classFile.endHeader(); :}
+;
+
+// ---- Signature specification
+
+signature_spec ::=
+    DSIGNATURE signature_expr SEP
+    |
+    /* nothing */
+;
+
+signature_expr ::= Str:sig
+        {: classFile.setSignature(sig.str_val); :}
+;
+
+
+// ---- Deprecated attribute
+
+deprecated_spec ::=
+    DDEPRECATED deprecated_expr SEP
+    |
+    /* nothing */
+;
+
+deprecated_expr ::=
+    {: classFile.setDeprecated(); :}
+;
+
+// ---- Bytecode version specification
+
+bytecode_spec ::=
+    DBYTECODE Num:n SEP
+        {: classFile.setVersion(n.num_val); :}
+    |
+    /* nothing */
+;
+
+
+// ---- Source specification
+
+source_spec ::=
+    DSOURCE Str:s SEP
+        {: classFile.setSource(s.str_val); :}
+    |
+    DSOURCE Word:w SEP
+        {: classFile.setSource(w.str_val); :}
+    |
+    /* nothing */
+;
+
+// ---- Class specification
+
+class_spec ::=
+    DCLASS access:a classname:name SEP
+        {: classFile.setClass(name.str_val,
+                (short)(a.int_val | RuntimeConstants.ACC_SUPER)); :}
+    |
+    DINTERFACE access:a classname:name SEP
+        {: classFile.setClass(name.str_val,
+                (short)(a.int_val |
+                        RuntimeConstants.ACC_SUPER |
+                        RuntimeConstants.ACC_INTERFACE)); :}
+;
+
+classname ::= Word:w
+        {: RESULT.str_val = ScannerUtils.convertDots(w.str_val); :}
+;
+
+access ::=
+    {: access_val = 0; :}
+        access_list
+    {: RESULT.int_val = access_val; :}
+;
+
+
+access_list ::= access_items | ;
+access_items ::= access_items access_item | access_item ;
+
+access_item ::=
+    PUBLIC       {: access_val |= RuntimeConstants.ACC_PUBLIC; :}
+    |
+    PRIVATE      {: access_val |= RuntimeConstants.ACC_PRIVATE; :}
+    |
+    PROTECTED    {: access_val |= RuntimeConstants.ACC_PROTECTED; :}
+    |
+    STATIC       {: access_val |= RuntimeConstants.ACC_STATIC; :}
+    |
+    FINAL        {: access_val |= RuntimeConstants.ACC_FINAL; :}
+    |
+    SYNCHRONIZED {: access_val |= RuntimeConstants.ACC_SYNCHRONIZED; :}
+    |
+    VOLATILE     {: access_val |= RuntimeConstants.ACC_VOLATILE; :}
+    |
+    TRANSIENT    {: access_val |= RuntimeConstants.ACC_TRANSIENT; :}
+    |
+    NATIVE       {: access_val |= RuntimeConstants.ACC_NATIVE; :}
+    |
+    INTERFACE    {: access_val |= RuntimeConstants.ACC_INTERFACE; :}
+    |
+    ABSTRACT     {: access_val |= RuntimeConstants.ACC_ABSTRACT; :}
+    |
+    ANNOTATION   {: access_val |= RuntimeConstants.ACC_ANNOTATION; :}
+    |
+    ENUM         {: access_val |= RuntimeConstants.ACC_ENUM; :}
+    |
+    BRIDGE       {: access_val |= RuntimeConstants.ACC_BRIDGE; :}
+    |
+    VARARGS      {: access_val |= RuntimeConstants.ACC_VARARGS; :}
+    |
+    STRICT       {: access_val |= RuntimeConstants.ACC_STRICT; :}
+    |
+    SYNTHETIC    {: access_val |= RuntimeConstants.ACC_SYNTHETIC; :}
+;
+
+// ---- Superclass specification
+
+super_spec ::=
+    DSUPER classname:name SEP
+        {: classFile.setSuperClass(name.str_val); :}
+;
+
+// ---- Implements specification
+
+implements ::= implements_list | /* empty */ ;
+
+implements_list ::= implements_list implements_spec | implements_spec ;
+
+implements_spec ::= DIMPLEMENTS classname:name SEP
+	{: classFile.addInterface(name.str_val); :}
+;
+
+// ---- Annotation specification
+
+annotations ::= ann_cls_list | /* empty */ ;
+
+ann_cls_list ::= ann_cls_list ann_cls_spec | ann_cls_spec ;
+
+ann_cls_spec ::= ann_cls_expr ann_arglist endannotationsep ;
+
+endannotationsep ::= endannotation SEP ;
+
+endannotation ::= DEND ANNOTATION
+	{: classFile.endAnnotation(); :}
+;
+
+ann_cls_expr ::= DANNOTATION ann_clf_expr ;
+
+ann_clf_expr ::=
+    VISIBLE classname:name SEP
+        {: classFile.addAnnotation(true, name.str_val); :}
+    |
+    INVISIBLE classname:name SEP
+        {: classFile.addAnnotation(false, name.str_val); :}
+;
+ann_met_expr ::=
+    VISIBLE classname:name SEP
+        {: classFile.addAnnotation(true, name.str_val); :}
+    |
+    INVISIBLE classname:name SEP
+        {: classFile.addAnnotation(false, name.str_val); :}
+    |
+    VISIBLEPARAM Int:n classname:name SEP
+        {: classFile.addAnnotation(true, name.str_val, n.int_val); :}
+    |
+    INVISIBLEPARAM Int:n classname:name SEP
+        {: classFile.addAnnotation(false, name.str_val, n.int_val); :}
+;
+
+ann_arglist ::= ann_arg_list | /* empty */ ;
+
+ann_arg_list ::= ann_arg_list ann_arg_spec | ann_arg_spec ;
+
+ann_arg_spec ::= ann_arg_expr EQ ann_value_list ;
+
+ann_arg_expr ::=
+    Word:n Word:dsc
+	{: classFile.addAnnotationField(n.str_val, dsc.str_val, null); :}
+    |
+    Word:n Word:dsc Word:sub
+	{: classFile.addAnnotationField(n.str_val, dsc.str_val, sub.str_val); :}
+;
+
+ann_def_spec ::= DEFAULT SEP
+	{: classFile.addAnnotation(); :}
+;
+
+ann_value_list ::= ann_value_items SEP | ann_ann_list ;
+
+ann_value_items ::= ann_value_items ann_value | ann_value ;
+
+ann_value ::= any_item:v
+	{: classFile.addAnnotationValue(v.var_val); :}
+;
+ann_ann_list ::= ann_ann_list ann_ann_value | ann_ann_value ;
+
+ann_ann_value ::= DANNOTATION ann_nest ann_arglist endannotationsep ;
+
+ann_nest ::= SEP
+	{: classFile.nestAnnotation(); :}
+;
+
+ann_def_val ::= ann_def_expr EQ ann_value_list ;
+
+ann_def_expr ::=
+    Word:dsc
+	{: classFile.addAnnotationField(null, dsc.str_val, null); :}
+    |
+    Word:dsc Word:sub
+	{: classFile.addAnnotationField(null, dsc.str_val, sub.str_val); :}
+;
+
+// ---- SourceDebugExtension attribute specification
+
+debug_extension ::= debug_list | /* empty */ ;
+
+debug_list ::= debug_list debug_spec | debug_spec ;
+
+debug_spec ::= DDEBUG Str:s SEP
+        {: classFile.setSourceDebugExtension(s.str_val); :}
+;
+
+
+// ---- EnclosingMethod attribute specification
+
+enclosing_spec ::=
+    DENCLOSING METHOD Word:w SEP
+        {: classFile.setEnclosingMethod(w.str_val); :}
+    |
+    /* nothing */
+;
+
+
+// ---- Generic attributes specification
+
+generic_attributes ::= generic_list | /* empty */ ;
+
+generic_list ::= generic_list generic_spec | generic_spec ;
+
+generic_spec ::= DATTRIBUTE generic_expr SEP ;
+
+generic_expr ::= Word:name Str:file
+        {: classFile.addGenericAttr(name.str_val, file.str_val); :}
+;
+
+
+// ---- Fields
+
+fields ::= field_list | /* empty */ ;
+
+field_list ::= field_list field_spec | field_spec ;
+
+field_spec ::=
+    DFIELD access:a Word:name Word:desc SIGNATURE Str:sig optional_default:v SEP
+        {: classFile.addField((short)a.int_val, name.str_val, desc.str_val,
+                              sig.str_val, v.var_val); :}
+    |
+    DFIELD access:a Word:name Word:desc optional_default:v SEP
+        {: classFile.addField((short)a.int_val, name.str_val, desc.str_val,
+                               null, v.var_val); :}
+    |
+    DFIELD field_start field_exts endfield
+;
+
+// default value for a field
+optional_default ::=
+     EQ item:v
+        {: RESULT.var_val = v.var_val; :}
+     |
+     /* empty */
+        {: RESULT.var_val = null; :}
+;
+
+// multiline form of field description
+field_start ::= access:a Word:name Word:desc optional_default:v SEP
+      {: classFile.beginField((short)a.int_val, name.str_val,
+                              desc.str_val, v.var_val); :}
+;
+
+endfield ::= DEND FIELD SEP
+      {: classFile.endField(); :}
+;
+
+field_exts ::= field_ext_list | /* empty */ ;
+
+field_ext_list ::= field_ext_list field_ext_expr | field_ext_expr ;
+
+field_ext_expr ::=
+   DSIGNATURE signature_expr SEP
+   |
+   DATTRIBUTE generic_expr SEP
+   |
+   DDEPRECATED deprecated_expr SEP
+   |
+   DANNOTATION ann_clf_expr ann_arglist endannotationsep
+;
+
+
+// an item is an integer, a float/double/long, or a quoted string
+item ::=
+    Int:i       {: RESULT.var_val = new Integer(i.int_val); :}
+    |
+    Num:n       {: RESULT.var_val = n.num_val; :}
+    |
+    Str:s       {: RESULT.var_val = s.str_val; :}
+;
+// an item is any possible type
+any_item ::=
+    Word:w      {: RESULT.var_val = w.str_val; :}       // for enum
+    |
+    item:v      {: RESULT.var_val = v.var_val; :}
+;
+
+// ---- Inner classes
+
+inners ::= inner_list | /* empty */ ;
+
+inner_list ::= inner_list inner_spec | inner_spec ;
+
+inner_spec ::=
+    DINNER CLASS access:a inner_name:n inner_inner:i inner_outer:o SEP
+        {: classFile.addInner((short)a.int_val,
+                              n.str_val, i.str_val, o.str_val); :}
+    |
+    DINNER INTERFACE access:a inner_name:n inner_inner:i inner_outer:o SEP
+        {: classFile.addInner((short)(a.int_val |
+                              RuntimeConstants.ACC_INTERFACE),
+                                n.str_val, i.str_val, o.str_val); :}
+;
+
+inner_name ::=
+    Word:w
+        {: RESULT.str_val = w.str_val; :}
+    |
+    /* empty */
+        {: RESULT.str_val = null; :}
+;
+
+inner_inner ::=
+    INNER classname:w
+        {: RESULT.str_val = w.str_val; :}
+    |
+    /* empty */
+        {: RESULT.str_val = null; :}
+;
+
+inner_outer ::=
+    OUTER classname:w
+        {: RESULT.str_val = w.str_val; :}
+    |
+    /* empty */
+        {: RESULT.str_val = null; :}
+;
+
+
+// ---- Methods
+
+methods ::= method_list | /* empty */;
+
+method_list ::= method_list method_spec | method_spec ;
+
+method_spec ::=
+    defmethod
+    statements
+    endmethod
+    |
+    defmethod endmethod
+ ;
+
+defmethod ::=
+    DMETHOD access:i Word:name SEP
+        {: String split[] = ScannerUtils.splitMethodSignature(name.str_val);
+           classFile.newMethod(split[0], split[1], i.int_val); :}
+;
+
+endmethod ::=
+    DEND METHOD SEP
+        {: classFile.endMethod(); :}
+;
+
+
+// ---- Statements in a method
+
+statements ::= statements statement | statement ;
+
+statement ::=
+        {: classFile.setLine(scanner.token_line_num); :}
+    stmnt SEP
+;
+
+stmnt ::=
+    instruction
+    |
+    directive
+    |
+    error
+    |
+    label
+    |
+    /* empty */
+;
+
+
+// label:
+label ::=
+    Word:label COLON
+        {: classFile.plantLabel(label.str_val); :}
+    |
+    Int:label COLON instruction
+        {: classFile.plantLabel(String.valueOf(label.int_val)); :}
+;
+
+// Directives (.catch, .set, .limit, etc.)
+
+directive ::=
+    DVAR var_expr
+    |
+    DLIMIT limit_expr
+    |
+    DLINE line_expr
+    |
+    DTHROWS throws_expr
+    |
+    DCATCH catch_expr
+    |
+    DSET set_expr
+    |
+    DSIGNATURE signature_expr
+    |
+    DATTRIBUTE generic_expr
+    |
+    DDEPRECATED deprecated_expr
+    |
+    DANNOTATION ann_met_expr ann_arglist endannotation
+    |
+    DANNOTATION ann_def_spec ann_def_val endannotation
+    |
+    DSTACK stackmap
+;
+
+//
+// .stack
+//
+stackmap ::=
+   defstack stack_map_frame_desc endstack
+   |
+   USE defstack_same stack_map_frame_desc endstack
+;
+
+defstack_same ::= defstack_same_expr LOCALS SEP ;
+
+defstack_same_expr ::=
+   Int:n
+        {: classFile.beginStack(n.int_val); :}
+   |
+   /* empty */
+        {: classFile.beginStack(true); :}
+;
+
+defstack ::= SEP
+        {: classFile.beginStack(false); :}
+;
+
+stack_map_frame_desc ::=
+    stack_offset_def
+    stack_items
+;
+
+stack_offset_def ::=
+    OFFSET Int:n SEP
+        {: classFile.plantStackOffset(n.int_val); :}
+    |
+    OFFSET Word:w SEP
+        {: classFile.plantStackOffset(w.str_val); :}
+    |
+    /* nothing */
+;
+
+stack_items ::= stack_items stack_item | /* nothing */ ;
+
+stack_item ::= stack_item_expr SEP ;
+
+stack_item_expr ::=
+    LOCALS Word:w
+        {: classFile.plantStackLocals(w.str_val, null); :}
+    |
+    LOCALS Word:w Word:val
+        {: classFile.plantStackLocals(w.str_val, val.str_val); :}
+    |
+    LOCALS Word:w Int:n
+        {: classFile.plantStackLocals(w.str_val, String.valueOf(n.int_val)); :}
+    |
+    STACK Word:w
+        {: classFile.plantStackStack(w.str_val, null); :}
+    |
+    STACK Word:w Word:val
+        {: classFile.plantStackStack(w.str_val, val.str_val); :}
+    |
+    STACK Word:w Int:n
+        {: classFile.plantStackStack(w.str_val, String.valueOf(n.int_val)); :}
+;
+
+endstack ::= DEND STACK
+    {: classFile.endStack(); :}
+;
+
+//
+// .var <num> is <name> <desc> from StartLab to EndLab
+// .var <num> is <name> <desc> signature <sign> from StartLab to EndLab
+//
+var_expr ::=
+    Int:reg IS Word:name Word:desc optional_signature:sign FROM Word:slab TO Word:elab
+        {: classFile.addVar(slab.str_val, elab.str_val, name.str_val,
+                            desc.str_val, sign.str_val, reg.int_val); :}
+    |
+    Int:reg IS Word:name Word:desc optional_signature:sign
+        {: classFile.addVar(null, null, name.str_val, desc.str_val,
+                            sign.str_val,  reg.int_val); :}
+    |
+    Int:reg IS Word:name Word:desc optional_signature:sign FROM Int:soff TO Int:eoff
+        {: classFile.addVar(soff.int_val, eoff.int_val, name.str_val,
+                            desc.str_val, sign.str_val, reg.int_val); :}
+;
+
+// optional signature specification for a .var
+optional_signature ::=
+     SIGNATURE Str:s
+        {: RESULT.str_val = s.str_val; :}
+     |
+     /* empty */
+        {: RESULT.str_val = null; :}
+;
+
+
+// .limit stack <val>
+// .limit locals <val>
+
+limit_expr ::=
+    LOCALS Int:v        // .limit locals
+      {: classFile.setVarSize(v.int_val); :}
+   |
+   STACK Int:v          // .limit stack
+      {: classFile.setStackSize(v.int_val); :}
+   |
+   Word:w Int:v
+      {: classFile.report_error(".limit expected \"stack\" or \"locals\", but got "
+                                + w.str_val); :}
+;
+
+// .line <num>
+line_expr ::= Int:v
+      {: classFile.addLine(v.int_val); :}
+;
+
+// .throws <class>
+throws_expr ::= classname:s
+      {: classFile.addThrow(s.str_val); :}
+;
+
+// .catch <class> from <label1> to <label2> using <branchlab>
+catch_expr ::=
+    classname:aclass FROM Word:fromlab TO Word:tolab USING Word:branchlab
+        {: classFile.addCatch(aclass.str_val,
+                              fromlab.str_val,
+                              tolab.str_val,
+                              branchlab.str_val); :}
+    |
+    classname:aclass FROM Int:fromoff TO Int:tooff USING Int:branchoff
+        {: classFile.addCatch(aclass.str_val,
+                              fromoff.int_val,
+                              tooff.int_val,
+                              branchoff.int_val); :}
+;
+
+// .set <var> = <val>
+set_expr ::=
+    Word:name any_item:v
+        {: scanner.dict.put(name.str_val, v); :}
+;
+
+instruction ::=
+    simple_instruction
+    |
+    complex_instruction
+;
+
+// Various patterns of instruction:
+//      instruction [<pattern>]
+simple_instruction ::=
+    Insn:i
+        {: classFile.plant(i.str_val); :}
+    |
+    Insn:i Int:n1 Int:n2
+        {: classFile.plant(i.str_val, n1.int_val, n2.int_val); :}
+    |
+    Insn:i Int:n
+       {: classFile.plant(i.str_val, n.int_val); :}
+    |
+    Insn:i Num:n
+        {: classFile.plant(i.str_val, n.num_val); :}
+    |
+    Insn:i Word:n
+        {: classFile.plant(i.str_val, n.str_val); :}
+    |
+    Insn:i Word:n Int:n2
+        {: classFile.plant(i.str_val, n.str_val, n2.int_val); :}
+    |
+    Insn:i Word:n1 Word:n2
+        {: classFile.plant(i.str_val, n1.str_val, n2.str_val); :}
+    |
+    Insn:i Str:n
+        {: classFile.plantString(i.str_val, n.str_val); :}
+    |
+    Insn:i Relative:n
+        {: classFile.plantRelativeGoto(i.str_val, n.int_val); :}
+  ;
+
+// complex (i.e. multiline) instructions
+//      lookupswitch <lookup>
+//      tableswitch  <table>
+
+complex_instruction ::=
+    LOOKUPSWITCH lookup
+    |
+    TABLESWITCH table
+;
+
+// lookupswitch
+//     <value> : <label>
+//     <value> : <label>
+//     ...
+//     default : <label>
+
+lookup ::=
+    lookup_args
+    lookup_list
+    lookup_default
+;
+
+lookup_args ::= SEP     // no arguments to lookupswitch
+        {: classFile.newLookupswitch(); :}
+;
+
+lookup_list ::= lookup_list lookup_entry | lookup_entry ;
+
+lookup_entry ::=
+    Int:i COLON Word:w SEP
+        {: classFile.addLookupswitch(i.int_val, w.str_val); :}
+    |
+    Int:i COLON Int:off SEP
+        {: classFile.addLookupswitch(i.int_val, off.int_val); :}
+;
+
+lookup_default ::=
+    DEFAULT COLON Word:w
+        {: classFile.endLookupswitch(w.str_val); :}
+    |
+    DEFAULT COLON Int:off
+        {: classFile.endLookupswitch(off.int_val); :}
+;
+
+
+// tableswitch <low> [<high>]
+//     <label>
+//     <label>
+//     ...
+//     default : <label>
+
+table ::=
+    table_args
+    table_list
+    table_default
+;
+
+table_args ::=
+    Int:low SEP     /* one argument : the <low> parameter */
+        {: classFile.newTableswitch(low.int_val); :}
+    |
+    Int:low Int:high SEP     /* two arguments : <low> and <high> parameters */
+        {: classFile.newTableswitch(low.int_val, high.int_val); :}
+;
+
+table_list ::= table_list table_entry | table_entry ;
+
+table_entry ::=
+    Word:w SEP
+        {: classFile.addTableswitch(w.str_val); :}
+    |
+    Int:off SEP
+        {: classFile.addTableswitch(off.int_val); :}
+;
+
+table_default ::=
+    DEFAULT COLON Word:w
+        {: classFile.endTableswitch(w.str_val); :}
+    |
+    DEFAULT COLON Int:off
+        {: classFile.endTableswitch(off.int_val); :}
+;
+
+
+/* --- Revision History ---------------------------------------------------
+--- Iouri Kharon, Mar 13 2006
+    Remove 'uname' token (see Scanner.java)
+
+--- Iouri Kharon, Feb 17 2006
+    Added extended syntax for .stack (use ... locals)
+
+--- Iouri Kharon, Dec 29 2005
+    Added .deprecated, .atribute, .inner and .annotation directives
+
+    Added .field <> .end field block
+
+--- Iouri Kharon, Dec 20 2005
+    Added multiple instance of .debug
+
+    Added the signature option in .var declaration
+
+    Added STRICT and SYNTHETIC access flags
+
+    Added 'uname' token - all names/descriptor can be enclosed in quotes
+    for use keywords/instruction as variable names
+
+--- Daniel Reynaud, Oct 22 2005
+    Added .enclosing, .debug and .signature directives and the signature
+    option in fields declaration
+
+--- Daniel Reynaud, Oct 21 2005
+    Added ANNOTATION, ENUM, BRIDGE and VARARGS access flags
+
+--- Daniel Reynaud, Oct 20 2005
+    Added support for offsets instead of labels
+
+--- Daniel Reynaud, Oct 19 2005
+    Added .bytecode directive
+
+--- Jonathan Meyer, Mar 1 1997
+    Added ACC_SUPER flag - needed by 1.1.
+
+--- Jonathan Meyer, Oct 1 1996
+    Added support for .interface and .implements.
+
+--- Jonathan Meyer, July 25 1996
+    Slightly modified syntax of .var directive.
+
+    Added call to setLine to fix problem with line numbering.
+
+    Added definitions for report_error and report_fatal_error, and
+    also added 'error' token to statements list.
+*/
diff --git a/jasmin/jasmin-2.4/src/jasmin/parser.java b/jasmin/jasmin-2.4/src/jasmin/parser.java
new file mode 100644
index 0000000..b7b15cc
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin/parser.java
@@ -0,0 +1,2773 @@
+
+//----------------------------------------------------
+// The following code was generated by Java(tm) CUP v0.9d
+// Fri May 07 07:55:04 MSD 2010
+//----------------------------------------------------
+
+package jasmin;
+
+import java_cup.runtime.*;
+import jas.*;
+import java.io.*;
+import java.util.Hashtable;
+
+public class parser extends java_cup.runtime.lr_parser {
+
+  /** constructor */
+  public parser() {super();}
+
+  /** production table */
+  protected static final short _production_table[][] = {
+        {25, 4},     {0, 2},     {56, 11},     {54, 3},     {54, 0}, 
+        {55, 1},     {59, 3},     {59, 0},     {60, 0},     {51, 3}, 
+        {51, 0},     {38, 3},     {38, 3},     {38, 0},     {13, 4}, 
+        {13, 4},     {1, 1},     {105, 0},     {104, 2},     {11, 1}, 
+        {11, 0},     {10, 2},     {10, 1},     {9, 1},     {9, 1}, 
+        {9, 1},     {9, 1},     {9, 1},     {9, 1},     {9, 1}, 
+        {9, 1},     {9, 1},     {9, 1},     {9, 1},     {9, 1}, 
+        {9, 1},     {9, 1},     {9, 1},     {9, 1},     {9, 1}, 
+        {42, 3},     {22, 1},     {22, 0},     {23, 2},     {23, 1}, 
+        {24, 3},     {73, 1},     {73, 0},     {74, 2},     {74, 1}, 
+        {75, 3},     {90, 2},     {76, 2},     {77, 2},     {78, 3}, 
+        {78, 3},     {79, 3},     {79, 3},     {79, 4},     {79, 4}, 
+        {80, 1},     {80, 0},     {81, 2},     {81, 1},     {82, 3}, 
+        {88, 2},     {88, 3},     {83, 2},     {93, 2},     {93, 1}, 
+        {85, 2},     {85, 1},     {86, 1},     {92, 2},     {92, 1}, 
+        {91, 4},     {89, 1},     {84, 3},     {87, 1},     {87, 2}, 
+        {52, 1},     {52, 0},     {57, 2},     {57, 1},     {58, 3}, 
+        {53, 4},     {53, 0},     {61, 1},     {61, 0},     {62, 2}, 
+        {62, 1},     {63, 3},     {64, 2},     {20, 1},     {20, 0}, 
+        {18, 2},     {18, 1},     {19, 8},     {19, 6},     {19, 4}, 
+        {6, 2},     {6, 0},     {65, 5},     {66, 3},     {67, 1}, 
+        {67, 0},     {68, 2},     {68, 1},     {69, 3},     {69, 3}, 
+        {69, 3},     {69, 4},     {7, 1},     {7, 1},     {7, 1}, 
+        {8, 1},     {8, 1},     {70, 1},     {70, 0},     {71, 2}, 
+        {71, 1},     {72, 7},     {72, 7},     {2, 1},     {2, 0}, 
+        {3, 2},     {3, 0},     {4, 2},     {4, 0},     {35, 1}, 
+        {35, 0},     {33, 2},     {33, 1},     {34, 3},     {34, 2}, 
+        {15, 4},     {17, 3},     {40, 2},     {40, 1},     {106, 0}, 
+        {39, 3},     {41, 1},     {41, 1},     {41, 1},     {41, 1}, 
+        {41, 0},     {26, 2},     {26, 3},     {16, 2},     {16, 2}, 
+        {16, 2},     {16, 2},     {16, 2},     {16, 2},     {16, 2}, 
+        {16, 2},     {16, 2},     {16, 4},     {16, 4},     {16, 2}, 
+        {101, 3},     {101, 4},     {102, 3},     {103, 1},     {103, 0}, 
+        {94, 1},     {95, 2},     {97, 3},     {97, 3},     {97, 0}, 
+        {98, 2},     {98, 0},     {99, 2},     {100, 2},     {100, 3}, 
+        {100, 3},     {100, 2},     {100, 3},     {100, 3},     {96, 2}, 
+        {50, 9},     {50, 5},     {50, 9},     {5, 2},     {5, 0}, 
+        {27, 2},     {27, 2},     {27, 2},     {45, 1},     {49, 1}, 
+        {12, 7},     {12, 7},     {36, 2},     {21, 1},     {21, 1}, 
+        {37, 1},     {37, 3},     {37, 2},     {37, 2},     {37, 2}, 
+        {37, 3},     {37, 3},     {37, 2},     {37, 2},     {14, 2}, 
+        {14, 2},     {28, 3},     {29, 1},     {32, 2},     {32, 1}, 
+        {31, 4},     {31, 4},     {30, 3},     {30, 3},     {43, 3}, 
+        {44, 2},     {44, 3},     {48, 2},     {48, 1},     {47, 2}, 
+        {47, 2},     {46, 3},     {46, 3}  };
+
+  /** access to production table */
+  public short[][] production_table() {return _production_table;}
+
+  /** parse action table */
+  protected static final short[][] _action_table = {
+    /*0*/{3,-11,11,-11,15,-11,16,4,-1,0},
+    /*1*/{0,-119,5,-119,8,-119,23,134,-1,0},
+    /*2*/{0,133,-1,0},
+    /*3*/{70,131,-1,0},
+    /*4*/{3,-14,11,6,15,-14,-1,0},
+    /*5*/{66,127,67,128,-1,0},
+    /*6*/{3,9,15,8,-1,0},
+    /*7*/{43,-18,44,-18,45,-18,46,-18,47,-18,48,-18,49,-18,50,-18,51,-18,52,-18,53,-18,54,-18,55,-18,56,-18,57,-18,58,-18,59,-18,67,-18,-1,0},
+    /*8*/{43,-18,44,-18,45,-18,46,-18,47,-18,48,-18,49,-18,50,-18,51,-18,52,-18,53,-18,54,-18,55,-18,56,-18,57,-18,58,-18,59,-18,67,-18,-1,0},
+    /*9*/{10,12,-1,0},
+    /*10*/{0,-43,5,-43,8,-43,14,17,17,-43,18,-43,19,-43,21,-43,22,-43,23,-43,24,-43,-1,0},
+    /*11*/{67,13,-1,0},
+    /*12*/{27,-17,37,-17,64,-17,-1,0},
+    /*13*/{64,15,-1,0},
+    /*14*/{0,-41,5,-41,8,-41,14,-41,17,-41,18,-41,19,-41,21,-41,22,-41,23,-41,24,-41,-1,0},
+    /*15*/{0,-45,5,-45,8,-45,14,-45,17,-45,18,-45,19,-45,21,-45,22,-45,23,-45,24,-45,-1,0},
+    /*16*/{67,13,-1,0},
+    /*17*/{0,-5,5,-5,8,-5,17,-5,18,-5,19,22,21,-5,22,-5,23,-5,24,-5,-1,0},
+    /*18*/{0,-42,5,-42,8,-42,14,17,17,-42,18,-42,19,-42,21,-42,22,-42,23,-42,24,-42,-1,0},
+    /*19*/{0,-44,5,-44,8,-44,14,-44,17,-44,18,-44,19,-44,21,-44,22,-44,23,-44,24,-44,-1,0},
+    /*20*/{0,-87,5,-87,8,-87,17,-87,18,26,21,-87,22,-87,23,-87,24,-87,-1,0},
+    /*21*/{66,23,-1,0},
+    /*22*/{64,-6,-1,0},
+    /*23*/{64,25,-1,0},
+    /*24*/{0,-4,5,-4,8,-4,17,-4,18,-4,21,-4,22,-4,23,-4,24,-4,-1,0},
+    /*25*/{28,94,-1,0},
+    /*26*/{0,-8,5,-8,8,-8,17,-8,21,-8,22,28,23,-8,24,-8,-1,0},
+    /*27*/{64,-9,-1,0},
+    /*28*/{0,-48,5,-48,8,-48,17,-48,21,-48,23,-48,24,34,-1,0},
+    /*29*/{0,-50,5,-50,8,-50,17,-50,21,-50,23,-50,24,-50,-1,0},
+    /*30*/{0,-47,5,-47,8,-47,17,-47,21,-47,23,-47,24,34,-1,0},
+    /*31*/{4,-62,67,60,-1,0},
+    /*32*/{0,-89,5,-89,8,-89,17,-89,21,43,23,-89,-1,0},
+    /*33*/{38,36,39,35,-1,0},
+    /*34*/{67,13,-1,0},
+    /*35*/{67,13,-1,0},
+    /*36*/{4,-54,67,-54,-1,0},
+    /*37*/{64,39,-1,0},
+    /*38*/{4,-55,67,-55,-1,0},
+    /*39*/{64,41,-1,0},
+    /*40*/{4,-56,67,-56,-1,0},
+    /*41*/{0,-91,5,-91,8,-91,17,-91,21,-91,23,-91,-1,0},
+    /*42*/{67,54,-1,0},
+    /*43*/{0,-82,5,-82,8,-82,17,47,23,-82,-1,0},
+    /*44*/{0,-88,5,-88,8,-88,17,-88,21,43,23,-88,-1,0},
+    /*45*/{0,-90,5,-90,8,-90,17,-90,21,-90,23,-90,-1,0},
+    /*46*/{66,52,-1,0},
+    /*47*/{0,-81,5,-81,8,-81,17,47,23,-81,-1,0},
+    /*48*/{0,-84,5,-84,8,-84,17,-84,23,-84,-1,0},
+    /*49*/{0,-3,5,-3,8,-3,23,-3,-1,0},
+    /*50*/{0,-83,5,-83,8,-83,17,-83,23,-83,-1,0},
+    /*51*/{64,53,-1,0},
+    /*52*/{0,-85,5,-85,8,-85,17,-85,23,-85,-1,0},
+    /*53*/{66,57,-1,0},
+    /*54*/{64,56,-1,0},
+    /*55*/{0,-92,5,-92,8,-92,17,-92,21,-92,23,-92,-1,0},
+    /*56*/{64,-93,-1,0},
+    /*57*/{4,-61,67,60,-1,0},
+    /*58*/{63,70,-1,0},
+    /*59*/{67,68,-1,0},
+    /*60*/{4,-64,67,-64,-1,0},
+    /*61*/{4,65,-1,0},
+    /*62*/{0,-51,5,-51,8,-51,17,-51,21,-51,23,-51,24,-51,-1,0},
+    /*63*/{64,67,-1,0},
+    /*64*/{54,66,-1,0},
+    /*65*/{64,-53,-1,0},
+    /*66*/{0,-52,4,-52,5,-52,8,-52,17,-52,19,-52,21,-52,22,-52,23,-52,24,-52,67,-52,-1,0},
+    /*67*/{63,-66,67,69,-1,0},
+    /*68*/{63,-67,-1,0},
+    /*69*/{24,77,66,78,67,73,69,76,70,74,-1,0},
+    /*70*/{64,88,66,78,67,73,69,76,70,74,-1,0},
+    /*71*/{4,-65,67,-65,-1,0},
+    /*72*/{64,-116,66,-116,67,-116,69,-116,70,-116,-1,0},
+    /*73*/{64,-114,66,-114,67,-114,69,-114,70,-114,-1,0},
+    /*74*/{4,-75,24,-75,67,-75,-1,0},
+    /*75*/{64,-113,66,-113,67,-113,69,-113,70,-113,-1,0},
+    /*76*/{64,84,-1,0},
+    /*77*/{64,-115,66,-115,67,-115,69,-115,70,-115,-1,0},
+    /*78*/{4,-70,24,77,67,-70,-1,0},
+    /*79*/{64,-72,66,-72,67,-72,69,-72,70,-72,-1,0},
+    /*80*/{64,-117,66,-117,67,-117,69,-117,70,-117,-1,0},
+    /*81*/{64,-73,66,-73,67,-73,69,-73,70,-73,-1,0},
+    /*82*/{4,-74,24,-74,67,-74,-1,0},
+    /*83*/{4,-77,67,-77,-1,0},
+    /*84*/{4,-62,67,60,-1,0},
+    /*85*/{4,65,-1,0},
+    /*86*/{4,-76,24,-76,67,-76,-1,0},
+    /*87*/{4,-69,67,-69,-1,0},
+    /*88*/{64,-71,66,-71,67,-71,69,-71,70,-71,-1,0},
+    /*89*/{4,-63,67,-63,-1,0},
+    /*90*/{0,-49,5,-49,8,-49,17,-49,21,-49,23,-49,24,-49,-1,0},
+    /*91*/{64,93,-1,0},
+    /*92*/{0,-7,5,-7,8,-7,17,-7,21,-7,23,-7,24,-7,-1,0},
+    /*93*/{67,95,-1,0},
+    /*94*/{64,96,-1,0},
+    /*95*/{0,-86,5,-86,8,-86,17,-86,21,-86,22,-86,23,-86,24,-86,-1,0},
+    /*96*/{64,98,-1,0},
+    /*97*/{0,-46,5,-46,8,-46,14,-46,17,-46,18,-46,19,-46,21,-46,22,-46,23,-46,24,-46,-1,0},
+    /*98*/{67,13,-1,0},
+    /*99*/{36,-21,37,-21,43,117,44,113,45,115,46,105,47,103,48,111,49,107,50,109,51,118,52,112,53,108,54,106,55,114,56,104,57,116,58,110,59,102,64,-21,67,-21,-1,0},
+    /*100*/{36,-20,37,-20,43,117,44,113,45,115,46,105,47,103,48,111,49,107,50,109,51,118,52,112,53,108,54,106,55,114,56,104,57,116,58,110,59,102,64,-20,67,-20,-1,0},
+    /*101*/{36,-40,37,-40,43,-40,44,-40,45,-40,46,-40,47,-40,48,-40,49,-40,50,-40,51,-40,52,-40,53,-40,54,-40,55,-40,56,-40,57,-40,58,-40,59,-40,64,-40,67,-40,-1,0},
+    /*102*/{36,-25,37,-25,43,-25,44,-25,45,-25,46,-25,47,-25,48,-25,49,-25,50,-25,51,-25,52,-25,53,-25,54,-25,55,-25,56,-25,57,-25,58,-25,59,-25,64,-25,67,-25,-1,0},
+    /*103*/{36,-37,37,-37,43,-37,44,-37,45,-37,46,-37,47,-37,48,-37,49,-37,50,-37,51,-37,52,-37,53,-37,54,-37,55,-37,56,-37,57,-37,58,-37,59,-37,64,-37,67,-37,-1,0},
+    /*104*/{36,-32,37,-32,43,-32,44,-32,45,-32,46,-32,47,-32,48,-32,49,-32,50,-32,51,-32,52,-32,53,-32,54,-32,55,-32,56,-32,57,-32,58,-32,59,-32,64,-32,67,-32,-1,0},
+    /*105*/{36,-35,37,-35,43,-35,44,-35,45,-35,46,-35,47,-35,48,-35,49,-35,50,-35,51,-35,52,-35,53,-35,54,-35,55,-35,56,-35,57,-35,58,-35,59,-35,64,-35,67,-35,-1,0},
+    /*106*/{36,-24,37,-24,43,-24,44,-24,45,-24,46,-24,47,-24,48,-24,49,-24,50,-24,51,-24,52,-24,53,-24,54,-24,55,-24,56,-24,57,-24,58,-24,59,-24,64,-24,67,-24,-1,0},
+    /*107*/{36,-30,37,-30,43,-30,44,-30,45,-30,46,-30,47,-30,48,-30,49,-30,50,-30,51,-30,52,-30,53,-30,54,-30,55,-30,56,-30,57,-30,58,-30,59,-30,64,-30,67,-30,-1,0},
+    /*108*/{36,-27,37,-27,43,-27,44,-27,45,-27,46,-27,47,-27,48,-27,49,-27,50,-27,51,-27,52,-27,53,-27,54,-27,55,-27,56,-27,57,-27,58,-27,59,-27,64,-27,67,-27,-1,0},
+    /*109*/{36,-39,37,-39,43,-39,44,-39,45,-39,46,-39,47,-39,48,-39,49,-39,50,-39,51,-39,52,-39,53,-39,54,-39,55,-39,56,-39,57,-39,58,-39,59,-39,64,-39,67,-39,-1,0},
+    /*110*/{36,-26,37,-26,43,-26,44,-26,45,-26,46,-26,47,-26,48,-26,49,-26,50,-26,51,-26,52,-26,53,-26,54,-26,55,-26,56,-26,57,-26,58,-26,59,-26,64,-26,67,-26,-1,0},
+    /*111*/{36,-31,37,-31,43,-31,44,-31,45,-31,46,-31,47,-31,48,-31,49,-31,50,-31,51,-31,52,-31,53,-31,54,-31,55,-31,56,-31,57,-31,58,-31,59,-31,64,-31,67,-31,-1,0},
+    /*112*/{36,-28,37,-28,43,-28,44,-28,45,-28,46,-28,47,-28,48,-28,49,-28,50,-28,51,-28,52,-28,53,-28,54,-28,55,-28,56,-28,57,-28,58,-28,59,-28,64,-28,67,-28,-1,0},
+    /*113*/{36,-36,37,-36,43,-36,44,-36,45,-36,46,-36,47,-36,48,-36,49,-36,50,-36,51,-36,52,-36,53,-36,54,-36,55,-36,56,-36,57,-36,58,-36,59,-36,64,-36,67,-36,-1,0},
+    /*114*/{36,-33,37,-33,43,-33,44,-33,45,-33,46,-33,47,-33,48,-33,49,-33,50,-33,51,-33,52,-33,53,-33,54,-33,55,-33,56,-33,57,-33,58,-33,59,-33,64,-33,67,-33,-1,0},
+    /*115*/{36,-38,37,-38,43,-38,44,-38,45,-38,46,-38,47,-38,48,-38,49,-38,50,-38,51,-38,52,-38,53,-38,54,-38,55,-38,56,-38,57,-38,58,-38,59,-38,64,-38,67,-38,-1,0},
+    /*116*/{36,-34,37,-34,43,-34,44,-34,45,-34,46,-34,47,-34,48,-34,49,-34,50,-34,51,-34,52,-34,53,-34,54,-34,55,-34,56,-34,57,-34,58,-34,59,-34,64,-34,67,-34,-1,0},
+    /*117*/{36,-29,37,-29,43,-29,44,-29,45,-29,46,-29,47,-29,48,-29,49,-29,50,-29,51,-29,52,-29,53,-29,54,-29,55,-29,56,-29,57,-29,58,-29,59,-29,64,-29,67,-29,-1,0},
+    /*118*/{36,-19,37,-19,64,-19,67,-19,-1,0},
+    /*119*/{36,-23,37,-23,43,-23,44,-23,45,-23,46,-23,47,-23,48,-23,49,-23,50,-23,51,-23,52,-23,53,-23,54,-23,55,-23,56,-23,57,-23,58,-23,59,-23,64,-23,67,-23,-1,0},
+    /*120*/{36,-22,37,-22,43,-22,44,-22,45,-22,46,-22,47,-22,48,-22,49,-22,50,-22,51,-22,52,-22,53,-22,54,-22,55,-22,56,-22,57,-22,58,-22,59,-22,64,-22,67,-22,-1,0},
+    /*121*/{64,123,-1,0},
+    /*122*/{10,-15,-1,0},
+    /*123*/{67,13,-1,0},
+    /*124*/{64,126,-1,0},
+    /*125*/{10,-16,-1,0},
+    /*126*/{64,130,-1,0},
+    /*127*/{64,129,-1,0},
+    /*128*/{3,-13,15,-13,-1,0},
+    /*129*/{3,-12,15,-12,-1,0},
+    /*130*/{64,132,-1,0},
+    /*131*/{3,-10,11,-10,15,-10,-1,0},
+    /*132*/{0,-2,-1,0},
+    /*133*/{34,371,45,370,-1,0},
+    /*134*/{0,-121,5,-121,8,-121,23,-121,-1,0},
+    /*135*/{0,-95,5,141,8,-95,-1,0},
+    /*136*/{0,-118,5,-118,8,-118,23,134,-1,0},
+    /*137*/{0,-120,5,-120,8,-120,23,-120,-1,0},
+    /*138*/{0,-131,8,179,-1,0},
+    /*139*/{0,-97,5,-97,8,-97,-1,0},
+    /*140*/{43,-18,44,-18,45,-18,46,-18,47,-18,48,-18,49,-18,50,-18,51,-18,52,-18,53,-18,54,-18,55,-18,56,-18,57,-18,58,-18,59,-18,67,-18,-1,0},
+    /*141*/{0,-94,5,141,8,-94,-1,0},
+    /*142*/{0,-96,5,-96,8,-96,-1,0},
+    /*143*/{67,167,-1,0},
+    /*144*/{4,-106,19,151,21,147,22,146,24,152,-1,0},
+    /*145*/{64,-9,-1,0},
+    /*146*/{67,54,-1,0},
+    /*147*/{4,-105,19,151,21,147,22,146,24,152,-1,0},
+    /*148*/{4,-108,19,-108,21,-108,22,-108,24,-108,-1,0},
+    /*149*/{4,158,-1,0},
+    /*150*/{66,23,-1,0},
+    /*151*/{38,36,39,35,-1,0},
+    /*152*/{4,-62,67,60,-1,0},
+    /*153*/{4,65,-1,0},
+    /*154*/{4,-112,19,-112,21,-112,22,-112,24,-112,-1,0},
+    /*155*/{64,157,-1,0},
+    /*156*/{4,-109,19,-109,21,-109,22,-109,24,-109,-1,0},
+    /*157*/{33,160,-1,0},
+    /*158*/{0,-100,5,-100,8,-100,-1,0},
+    /*159*/{64,161,-1,0},
+    /*160*/{0,-104,5,-104,8,-104,-1,0},
+    /*161*/{4,-107,19,-107,21,-107,22,-107,24,-107,-1,0},
+    /*162*/{64,164,-1,0},
+    /*163*/{4,-110,19,-110,21,-110,22,-110,24,-110,-1,0},
+    /*164*/{64,166,-1,0},
+    /*165*/{4,-111,19,-111,21,-111,22,-111,24,-111,-1,0},
+    /*166*/{67,168,-1,0},
+    /*167*/{29,171,63,169,64,-102,-1,0},
+    /*168*/{66,78,69,76,70,74,-1,0},
+    /*169*/{64,175,-1,0},
+    /*170*/{66,172,-1,0},
+    /*171*/{63,169,64,-102,-1,0},
+    /*172*/{64,174,-1,0},
+    /*173*/{0,-98,5,-98,8,-98,-1,0},
+    /*174*/{0,-99,4,-103,5,-99,8,-99,19,-103,21,-103,22,-103,24,-103,-1,0},
+    /*175*/{64,-101,-1,0},
+    /*176*/{0,-1,-1,0},
+    /*177*/{0,-133,8,-133,-1,0},
+    /*178*/{43,-18,44,-18,45,-18,46,-18,47,-18,48,-18,49,-18,50,-18,51,-18,52,-18,53,-18,54,-18,55,-18,56,-18,57,-18,58,-18,59,-18,67,-18,-1,0},
+    /*179*/{1,-140,2,-140,4,185,6,-140,7,-140,9,-140,12,-140,13,-140,19,-140,20,-140,21,-140,22,-140,24,-140,60,-140,61,-140,64,-140,67,-140,68,-140,69,-140,-1,0},
+    /*180*/{0,-130,8,179,-1,0},
+    /*181*/{0,-132,8,-132,-1,0},
+    /*182*/{1,-140,2,-140,4,185,6,-140,7,-140,9,-140,12,-140,13,-140,19,-140,20,-140,21,-140,22,-140,24,-140,60,-140,61,-140,64,-140,67,-140,68,-140,69,-140,-1,0},
+    /*183*/{1,205,2,198,6,193,7,207,9,206,12,212,13,192,19,194,20,203,21,190,22,210,24,195,60,204,61,202,64,-146,67,191,68,201,69,196,-1,0},
+    /*184*/{28,188,-1,0},
+    /*185*/{1,-139,2,-139,4,-139,6,-139,7,-139,9,-139,12,-139,13,-139,19,-139,20,-139,21,-139,22,-139,24,-139,60,-139,61,-139,64,-139,67,-139,68,-139,69,-139,-1,0},
+    /*186*/{0,-135,8,-135,-1,0},
+    /*187*/{64,189,-1,0},
+    /*188*/{0,-137,8,-137,-1,0},
+    /*189*/{67,54,-1,0},
+    /*190*/{65,363,-1,0},
+    /*191*/{69,349,-1,0},
+    /*192*/{30,342,32,344,67,343,-1,0},
+    /*193*/{66,23,-1,0},
+    /*194*/{38,316,39,314,40,319,41,318,62,313,-1,0},
+    /*195*/{65,311,-1,0},
+    /*196*/{64,-145,-1,0},
+    /*197*/{67,13,-1,0},
+    /*198*/{64,-143,-1,0},
+    /*199*/{64,297,-1,0},
+    /*200*/{64,-196,66,289,67,290,69,292,70,293,71,291,-1,0},
+    /*201*/{69,273,-1,0},
+    /*202*/{42,241,64,238,-1,0},
+    /*203*/{64,221,-1,0},
+    /*204*/{64,-144,-1,0},
+    /*205*/{67,219,-1,0},
+    /*206*/{69,217,-1,0},
+    /*207*/{64,-142,-1,0},
+    /*208*/{64,-194,-1,0},
+    /*209*/{64,-9,-1,0},
+    /*210*/{64,-195,-1,0},
+    /*211*/{67,13,-1,0},
+    /*212*/{64,-190,-1,0},
+    /*213*/{64,-152,-1,0},
+    /*214*/{64,-157,-1,0},
+    /*215*/{64,-151,-1,0},
+    /*216*/{64,-189,-1,0},
+    /*217*/{64,-154,-1,0},
+    /*218*/{66,78,67,73,69,76,70,74,-1,0},
+    /*219*/{64,-193,-1,0},
+    /*220*/{69,-208,-1,0},
+    /*221*/{69,226,-1,0},
+    /*222*/{64,-205,-1,0},
+    /*223*/{62,-210,69,-210,-1,0},
+    /*224*/{62,233,69,226,-1,0},
+    /*225*/{65,227,-1,0},
+    /*226*/{67,228,69,229,-1,0},
+    /*227*/{64,231,-1,0},
+    /*228*/{64,230,-1,0},
+    /*229*/{62,-212,69,-212,-1,0},
+    /*230*/{62,-211,69,-211,-1,0},
+    /*231*/{64,-207,-1,0},
+    /*232*/{65,235,-1,0},
+    /*233*/{62,-209,69,-209,-1,0},
+    /*234*/{67,236,69,237,-1,0},
+    /*235*/{64,-213,-1,0},
+    /*236*/{64,-214,-1,0},
+    /*237*/{4,-166,30,-166,31,-166,32,-166,-1,0},
+    /*238*/{4,-170,30,-170,31,246,32,-170,-1,0},
+    /*239*/{64,-160,-1,0},
+    /*240*/{32,-165,69,244,-1,0},
+    /*241*/{32,267,-1,0},
+    /*242*/{4,-170,30,-170,31,246,32,-170,-1,0},
+    /*243*/{32,-164,-1,0},
+    /*244*/{4,264,-1,0},
+    /*245*/{67,260,69,261,-1,0},
+    /*246*/{4,-172,30,-172,32,-172,-1,0},
+    /*247*/{4,-167,30,249,32,252,-1,0},
+    /*248*/{67,257,-1,0},
+    /*249*/{4,-171,30,-171,32,-171,-1,0},
+    /*250*/{64,256,-1,0},
+    /*251*/{67,253,-1,0},
+    /*252*/{64,-174,67,254,69,255,-1,0},
+    /*253*/{64,-175,-1,0},
+    /*254*/{64,-176,-1,0},
+    /*255*/{4,-173,30,-173,32,-173,-1,0},
+    /*256*/{64,-177,67,258,69,259,-1,0},
+    /*257*/{64,-178,-1,0},
+    /*258*/{64,-179,-1,0},
+    /*259*/{64,263,-1,0},
+    /*260*/{64,262,-1,0},
+    /*261*/{4,-168,30,-168,32,-168,-1,0},
+    /*262*/{4,-169,30,-169,32,-169,-1,0},
+    /*263*/{30,266,-1,0},
+    /*264*/{64,-162,-1,0},
+    /*265*/{64,-180,-1,0},
+    /*266*/{64,268,-1,0},
+    /*267*/{4,-163,30,-163,31,-163,32,-163,-1,0},
+    /*268*/{4,264,-1,0},
+    /*269*/{64,-161,-1,0},
+    /*270*/{67,277,69,280,-1,0},
+    /*271*/{64,-206,-1,0},
+    /*272*/{64,274,69,275,-1,0},
+    /*273*/{67,-216,69,-216,-1,0},
+    /*274*/{64,276,-1,0},
+    /*275*/{67,-217,69,-217,-1,0},
+    /*276*/{64,288,-1,0},
+    /*277*/{62,282,67,277,69,280,-1,0},
+    /*278*/{62,-219,67,-219,69,-219,-1,0},
+    /*279*/{64,281,-1,0},
+    /*280*/{62,-221,67,-221,69,-221,-1,0},
+    /*281*/{65,285,-1,0},
+    /*282*/{62,-218,67,-218,69,-218,-1,0},
+    /*283*/{64,-215,-1,0},
+    /*284*/{67,286,69,287,-1,0},
+    /*285*/{64,-222,-1,0},
+    /*286*/{64,-223,-1,0},
+    /*287*/{62,-220,67,-220,69,-220,-1,0},
+    /*288*/{64,-203,-1,0},
+    /*289*/{64,-200,67,295,69,296,-1,0},
+    /*290*/{64,-204,-1,0},
+    /*291*/{64,-198,69,294,-1,0},
+    /*292*/{64,-199,-1,0},
+    /*293*/{64,-197,-1,0},
+    /*294*/{64,-202,-1,0},
+    /*295*/{64,-201,-1,0},
+    /*296*/{1,-141,2,-141,4,-141,6,-141,7,-141,9,-141,12,-141,13,-141,19,-141,20,-141,21,-141,22,-141,24,-141,60,-141,61,-141,64,-141,67,-141,68,-141,69,-141,-1,0},
+    /*297*/{64,-153,-1,0},
+    /*298*/{27,300,-1,0},
+    /*299*/{67,301,69,302,-1,0},
+    /*300*/{35,307,-1,0},
+    /*301*/{35,303,-1,0},
+    /*302*/{69,304,-1,0},
+    /*303*/{25,305,-1,0},
+    /*304*/{69,306,-1,0},
+    /*305*/{64,-192,-1,0},
+    /*306*/{67,308,-1,0},
+    /*307*/{25,309,-1,0},
+    /*308*/{67,310,-1,0},
+    /*309*/{64,-191,-1,0},
+    /*310*/{60,204,61,202,68,201,-1,0},
+    /*311*/{64,-148,-1,0},
+    /*312*/{64,339,-1,0},
+    /*313*/{67,13,-1,0},
+    /*314*/{4,-62,67,60,-1,0},
+    /*315*/{67,13,-1,0},
+    /*316*/{67,326,-1,0},
+    /*317*/{69,323,-1,0},
+    /*318*/{69,320,-1,0},
+    /*319*/{67,13,-1,0},
+    /*320*/{64,322,-1,0},
+    /*321*/{4,-59,67,-59,-1,0},
+    /*322*/{67,13,-1,0},
+    /*323*/{64,325,-1,0},
+    /*324*/{4,-60,67,-60,-1,0},
+    /*325*/{63,-79,67,332,-1,0},
+    /*326*/{4,65,-1,0},
+    /*327*/{63,329,-1,0},
+    /*328*/{24,77,66,78,67,73,69,76,70,74,-1,0},
+    /*329*/{4,-78,-1,0},
+    /*330*/{64,-159,-1,0},
+    /*331*/{63,-80,-1,0},
+    /*332*/{64,334,-1,0},
+    /*333*/{4,-57,67,-57,-1,0},
+    /*334*/{4,65,-1,0},
+    /*335*/{64,-158,-1,0},
+    /*336*/{64,338,-1,0},
+    /*337*/{4,-58,67,-58,-1,0},
+    /*338*/{67,-68,-1,0},
+    /*339*/{64,-155,-1,0},
+    /*340*/{64,-150,-1,0},
+    /*341*/{69,347,-1,0},
+    /*342*/{69,346,-1,0},
+    /*343*/{69,345,-1,0},
+    /*344*/{64,-186,-1,0},
+    /*345*/{64,-188,-1,0},
+    /*346*/{64,-187,-1,0},
+    /*347*/{64,-149,-1,0},
+    /*348*/{26,350,-1,0},
+    /*349*/{67,351,-1,0},
+    /*350*/{67,352,-1,0},
+    /*351*/{27,-185,29,353,64,-185,-1,0},
+    /*352*/{66,362,-1,0},
+    /*353*/{27,355,64,-182,-1,0},
+    /*354*/{67,356,69,357,-1,0},
+    /*355*/{35,360,-1,0},
+    /*356*/{35,358,-1,0},
+    /*357*/{69,359,-1,0},
+    /*358*/{64,-183,-1,0},
+    /*359*/{67,361,-1,0},
+    /*360*/{64,-181,-1,0},
+    /*361*/{27,-184,64,-184,-1,0},
+    /*362*/{64,-147,-1,0},
+    /*363*/{64,-156,-1,0},
+    /*364*/{1,-138,2,-138,4,-138,6,-138,7,-138,9,-138,12,-138,13,-138,19,-138,20,-138,21,-138,22,-138,24,-138,60,-138,61,-138,64,-138,67,-138,68,-138,69,-138,-1,0},
+    /*365*/{0,-134,8,-134,-1,0},
+    /*366*/{67,368,-1,0},
+    /*367*/{64,369,-1,0},
+    /*368*/{1,-136,2,-136,4,-136,6,-136,7,-136,9,-136,12,-136,13,-136,19,-136,20,-136,21,-136,22,-136,24,-136,60,-136,61,-136,64,-136,67,-136,68,-136,69,-136,-1,0},
+    /*369*/{36,-18,37,-18,43,-18,44,-18,45,-18,46,-18,47,-18,48,-18,49,-18,50,-18,51,-18,52,-18,53,-18,54,-18,55,-18,56,-18,57,-18,58,-18,59,-18,64,-18,67,-18,-1,0},
+    /*370*/{36,-18,37,-18,43,-18,44,-18,45,-18,46,-18,47,-18,48,-18,49,-18,50,-18,51,-18,52,-18,53,-18,54,-18,55,-18,56,-18,57,-18,58,-18,59,-18,64,-18,67,-18,-1,0},
+    /*371*/{36,-125,37,-125,64,-125,67,374,-1,0},
+    /*372*/{36,375,37,-127,64,-127,-1,0},
+    /*373*/{36,-124,37,-124,64,-124,-1,0},
+    /*374*/{67,13,-1,0},
+    /*375*/{37,377,64,-129,-1,0},
+    /*376*/{67,13,-1,0},
+    /*377*/{64,379,-1,0},
+    /*378*/{0,-122,5,-122,8,-122,23,-122,-1,0},
+    /*379*/{64,-128,-1,0},
+    /*380*/{37,-126,64,-126,-1,0},
+    /*381*/{36,-125,37,-125,64,-125,67,374,-1,0},
+    /*382*/{36,375,37,-127,64,-127,-1,0},
+    /*383*/{37,377,64,-129,-1,0},
+    /*384*/{64,386,-1,0},
+    /*385*/{0,-123,5,-123,8,-123,23,-123,-1,0},
+  };
+
+  /** access to parse action table */
+  public short[][] action_table() {return _action_table;}
+
+  /** reduce_goto table */
+  protected static final short[][] _reduce_table = {
+    /*0*/{25,2,51,4,56,1,-1,-1},
+    /*1*/{70,135,71,136,72,134,-1,-1},
+    /*2*/{-1,-1},
+    /*3*/{-1,-1},
+    /*4*/{38,6,-1,-1},
+    /*5*/{-1,-1},
+    /*6*/{13,9,-1,-1},
+    /*7*/{104,123,105,99,-1,-1},
+    /*8*/{104,98,105,99,-1,-1},
+    /*9*/{42,10,-1,-1},
+    /*10*/{22,17,23,18,24,15,-1,-1},
+    /*11*/{1,13,-1,-1},
+    /*12*/{-1,-1},
+    /*13*/{-1,-1},
+    /*14*/{-1,-1},
+    /*15*/{-1,-1},
+    /*16*/{1,96,-1,-1},
+    /*17*/{54,20,-1,-1},
+    /*18*/{24,19,-1,-1},
+    /*19*/{-1,-1},
+    /*20*/{53,26,-1,-1},
+    /*21*/{55,23,-1,-1},
+    /*22*/{-1,-1},
+    /*23*/{-1,-1},
+    /*24*/{-1,-1},
+    /*25*/{-1,-1},
+    /*26*/{59,28,-1,-1},
+    /*27*/{60,91,-1,-1},
+    /*28*/{73,32,74,30,75,29,77,31,-1,-1},
+    /*29*/{-1,-1},
+    /*30*/{75,90,77,31,-1,-1},
+    /*31*/{80,61,81,57,82,60,88,58,-1,-1},
+    /*32*/{61,43,62,44,63,41,-1,-1},
+    /*33*/{78,36,-1,-1},
+    /*34*/{1,39,-1,-1},
+    /*35*/{1,37,-1,-1},
+    /*36*/{-1,-1},
+    /*37*/{-1,-1},
+    /*38*/{-1,-1},
+    /*39*/{-1,-1},
+    /*40*/{-1,-1},
+    /*41*/{-1,-1},
+    /*42*/{64,54,-1,-1},
+    /*43*/{52,49,57,47,58,48,-1,-1},
+    /*44*/{63,45,-1,-1},
+    /*45*/{-1,-1},
+    /*46*/{-1,-1},
+    /*47*/{58,50,-1,-1},
+    /*48*/{-1,-1},
+    /*49*/{-1,-1},
+    /*50*/{-1,-1},
+    /*51*/{-1,-1},
+    /*52*/{-1,-1},
+    /*53*/{-1,-1},
+    /*54*/{-1,-1},
+    /*55*/{-1,-1},
+    /*56*/{-1,-1},
+    /*57*/{82,89,88,58,-1,-1},
+    /*58*/{-1,-1},
+    /*59*/{-1,-1},
+    /*60*/{-1,-1},
+    /*61*/{76,63,90,62,-1,-1},
+    /*62*/{-1,-1},
+    /*63*/{-1,-1},
+    /*64*/{-1,-1},
+    /*65*/{-1,-1},
+    /*66*/{-1,-1},
+    /*67*/{-1,-1},
+    /*68*/{-1,-1},
+    /*69*/{7,80,8,81,85,70,86,79,91,74,92,78,93,71,-1,-1},
+    /*70*/{7,80,8,81,86,88,-1,-1},
+    /*71*/{-1,-1},
+    /*72*/{-1,-1},
+    /*73*/{-1,-1},
+    /*74*/{-1,-1},
+    /*75*/{-1,-1},
+    /*76*/{89,84,-1,-1},
+    /*77*/{-1,-1},
+    /*78*/{91,82,-1,-1},
+    /*79*/{-1,-1},
+    /*80*/{-1,-1},
+    /*81*/{-1,-1},
+    /*82*/{-1,-1},
+    /*83*/{-1,-1},
+    /*84*/{80,85,81,57,82,60,88,58,-1,-1},
+    /*85*/{76,63,90,86,-1,-1},
+    /*86*/{-1,-1},
+    /*87*/{-1,-1},
+    /*88*/{-1,-1},
+    /*89*/{-1,-1},
+    /*90*/{-1,-1},
+    /*91*/{-1,-1},
+    /*92*/{-1,-1},
+    /*93*/{-1,-1},
+    /*94*/{-1,-1},
+    /*95*/{-1,-1},
+    /*96*/{-1,-1},
+    /*97*/{-1,-1},
+    /*98*/{1,121,-1,-1},
+    /*99*/{9,119,10,100,11,118,-1,-1},
+    /*100*/{9,120,-1,-1},
+    /*101*/{-1,-1},
+    /*102*/{-1,-1},
+    /*103*/{-1,-1},
+    /*104*/{-1,-1},
+    /*105*/{-1,-1},
+    /*106*/{-1,-1},
+    /*107*/{-1,-1},
+    /*108*/{-1,-1},
+    /*109*/{-1,-1},
+    /*110*/{-1,-1},
+    /*111*/{-1,-1},
+    /*112*/{-1,-1},
+    /*113*/{-1,-1},
+    /*114*/{-1,-1},
+    /*115*/{-1,-1},
+    /*116*/{-1,-1},
+    /*117*/{-1,-1},
+    /*118*/{-1,-1},
+    /*119*/{-1,-1},
+    /*120*/{-1,-1},
+    /*121*/{-1,-1},
+    /*122*/{-1,-1},
+    /*123*/{1,124,-1,-1},
+    /*124*/{-1,-1},
+    /*125*/{-1,-1},
+    /*126*/{-1,-1},
+    /*127*/{-1,-1},
+    /*128*/{-1,-1},
+    /*129*/{-1,-1},
+    /*130*/{-1,-1},
+    /*131*/{-1,-1},
+    /*132*/{-1,-1},
+    /*133*/{-1,-1},
+    /*134*/{-1,-1},
+    /*135*/{18,141,19,139,20,138,-1,-1},
+    /*136*/{72,137,-1,-1},
+    /*137*/{-1,-1},
+    /*138*/{15,179,33,180,34,177,35,176,-1,-1},
+    /*139*/{-1,-1},
+    /*140*/{65,144,104,143,105,99,-1,-1},
+    /*141*/{19,142,-1,-1},
+    /*142*/{-1,-1},
+    /*143*/{-1,-1},
+    /*144*/{67,149,68,147,69,148,-1,-1},
+    /*145*/{60,164,-1,-1},
+    /*146*/{64,162,-1,-1},
+    /*147*/{69,161,-1,-1},
+    /*148*/{-1,-1},
+    /*149*/{66,158,-1,-1},
+    /*150*/{55,155,-1,-1},
+    /*151*/{78,152,-1,-1},
+    /*152*/{80,153,81,57,82,60,88,58,-1,-1},
+    /*153*/{76,63,90,154,-1,-1},
+    /*154*/{-1,-1},
+    /*155*/{-1,-1},
+    /*156*/{-1,-1},
+    /*157*/{-1,-1},
+    /*158*/{-1,-1},
+    /*159*/{-1,-1},
+    /*160*/{-1,-1},
+    /*161*/{-1,-1},
+    /*162*/{-1,-1},
+    /*163*/{-1,-1},
+    /*164*/{-1,-1},
+    /*165*/{-1,-1},
+    /*166*/{-1,-1},
+    /*167*/{6,169,-1,-1},
+    /*168*/{7,175,-1,-1},
+    /*169*/{-1,-1},
+    /*170*/{-1,-1},
+    /*171*/{6,172,-1,-1},
+    /*172*/{-1,-1},
+    /*173*/{-1,-1},
+    /*174*/{-1,-1},
+    /*175*/{-1,-1},
+    /*176*/{-1,-1},
+    /*177*/{-1,-1},
+    /*178*/{104,366,105,99,-1,-1},
+    /*179*/{17,186,39,185,40,182,106,183,-1,-1},
+    /*180*/{15,179,34,181,-1,-1},
+    /*181*/{-1,-1},
+    /*182*/{17,365,39,364,106,183,-1,-1},
+    /*183*/{14,210,16,198,21,207,26,196,37,208,41,199,-1,-1},
+    /*184*/{-1,-1},
+    /*185*/{-1,-1},
+    /*186*/{-1,-1},
+    /*187*/{-1,-1},
+    /*188*/{-1,-1},
+    /*189*/{64,363,-1,-1},
+    /*190*/{-1,-1},
+    /*191*/{50,347,-1,-1},
+    /*192*/{27,340,-1,-1},
+    /*193*/{55,339,-1,-1},
+    /*194*/{79,314,83,316,-1,-1},
+    /*195*/{-1,-1},
+    /*196*/{-1,-1},
+    /*197*/{1,298,12,297,-1,-1},
+    /*198*/{-1,-1},
+    /*199*/{-1,-1},
+    /*200*/{-1,-1},
+    /*201*/{43,271,44,270,-1,-1},
+    /*202*/{94,238,101,239,-1,-1},
+    /*203*/{28,222,29,221,-1,-1},
+    /*204*/{-1,-1},
+    /*205*/{36,217,-1,-1},
+    /*206*/{45,215,-1,-1},
+    /*207*/{-1,-1},
+    /*208*/{-1,-1},
+    /*209*/{60,214,-1,-1},
+    /*210*/{-1,-1},
+    /*211*/{1,212,49,213,-1,-1},
+    /*212*/{-1,-1},
+    /*213*/{-1,-1},
+    /*214*/{-1,-1},
+    /*215*/{-1,-1},
+    /*216*/{-1,-1},
+    /*217*/{-1,-1},
+    /*218*/{7,80,8,219,-1,-1},
+    /*219*/{-1,-1},
+    /*220*/{-1,-1},
+    /*221*/{31,223,32,224,-1,-1},
+    /*222*/{-1,-1},
+    /*223*/{-1,-1},
+    /*224*/{30,231,31,233,-1,-1},
+    /*225*/{-1,-1},
+    /*226*/{-1,-1},
+    /*227*/{-1,-1},
+    /*228*/{-1,-1},
+    /*229*/{-1,-1},
+    /*230*/{-1,-1},
+    /*231*/{-1,-1},
+    /*232*/{-1,-1},
+    /*233*/{-1,-1},
+    /*234*/{-1,-1},
+    /*235*/{-1,-1},
+    /*236*/{-1,-1},
+    /*237*/{-1,-1},
+    /*238*/{95,268,97,246,-1,-1},
+    /*239*/{-1,-1},
+    /*240*/{102,242,103,241,-1,-1},
+    /*241*/{-1,-1},
+    /*242*/{95,244,97,246,-1,-1},
+    /*243*/{-1,-1},
+    /*244*/{96,264,-1,-1},
+    /*245*/{-1,-1},
+    /*246*/{98,247,-1,-1},
+    /*247*/{99,249,100,250,-1,-1},
+    /*248*/{-1,-1},
+    /*249*/{-1,-1},
+    /*250*/{-1,-1},
+    /*251*/{-1,-1},
+    /*252*/{-1,-1},
+    /*253*/{-1,-1},
+    /*254*/{-1,-1},
+    /*255*/{-1,-1},
+    /*256*/{-1,-1},
+    /*257*/{-1,-1},
+    /*258*/{-1,-1},
+    /*259*/{-1,-1},
+    /*260*/{-1,-1},
+    /*261*/{-1,-1},
+    /*262*/{-1,-1},
+    /*263*/{-1,-1},
+    /*264*/{-1,-1},
+    /*265*/{-1,-1},
+    /*266*/{-1,-1},
+    /*267*/{-1,-1},
+    /*268*/{96,269,-1,-1},
+    /*269*/{-1,-1},
+    /*270*/{47,278,48,277,-1,-1},
+    /*271*/{-1,-1},
+    /*272*/{-1,-1},
+    /*273*/{-1,-1},
+    /*274*/{-1,-1},
+    /*275*/{-1,-1},
+    /*276*/{-1,-1},
+    /*277*/{46,283,47,282,-1,-1},
+    /*278*/{-1,-1},
+    /*279*/{-1,-1},
+    /*280*/{-1,-1},
+    /*281*/{-1,-1},
+    /*282*/{-1,-1},
+    /*283*/{-1,-1},
+    /*284*/{-1,-1},
+    /*285*/{-1,-1},
+    /*286*/{-1,-1},
+    /*287*/{-1,-1},
+    /*288*/{-1,-1},
+    /*289*/{-1,-1},
+    /*290*/{-1,-1},
+    /*291*/{-1,-1},
+    /*292*/{-1,-1},
+    /*293*/{-1,-1},
+    /*294*/{-1,-1},
+    /*295*/{-1,-1},
+    /*296*/{-1,-1},
+    /*297*/{-1,-1},
+    /*298*/{-1,-1},
+    /*299*/{-1,-1},
+    /*300*/{-1,-1},
+    /*301*/{-1,-1},
+    /*302*/{-1,-1},
+    /*303*/{-1,-1},
+    /*304*/{-1,-1},
+    /*305*/{-1,-1},
+    /*306*/{-1,-1},
+    /*307*/{-1,-1},
+    /*308*/{-1,-1},
+    /*309*/{-1,-1},
+    /*310*/{14,210,21,311,37,208,-1,-1},
+    /*311*/{-1,-1},
+    /*312*/{-1,-1},
+    /*313*/{1,336,-1,-1},
+    /*314*/{80,334,81,57,82,60,88,58,-1,-1},
+    /*315*/{1,332,-1,-1},
+    /*316*/{84,326,87,327,-1,-1},
+    /*317*/{-1,-1},
+    /*318*/{-1,-1},
+    /*319*/{1,320,-1,-1},
+    /*320*/{-1,-1},
+    /*321*/{-1,-1},
+    /*322*/{1,323,-1,-1},
+    /*323*/{-1,-1},
+    /*324*/{-1,-1},
+    /*325*/{-1,-1},
+    /*326*/{76,330,-1,-1},
+    /*327*/{-1,-1},
+    /*328*/{7,80,8,81,85,70,86,79,91,74,92,78,93,329,-1,-1},
+    /*329*/{-1,-1},
+    /*330*/{-1,-1},
+    /*331*/{-1,-1},
+    /*332*/{-1,-1},
+    /*333*/{-1,-1},
+    /*334*/{76,335,-1,-1},
+    /*335*/{-1,-1},
+    /*336*/{-1,-1},
+    /*337*/{-1,-1},
+    /*338*/{-1,-1},
+    /*339*/{-1,-1},
+    /*340*/{-1,-1},
+    /*341*/{-1,-1},
+    /*342*/{-1,-1},
+    /*343*/{-1,-1},
+    /*344*/{-1,-1},
+    /*345*/{-1,-1},
+    /*346*/{-1,-1},
+    /*347*/{-1,-1},
+    /*348*/{-1,-1},
+    /*349*/{-1,-1},
+    /*350*/{-1,-1},
+    /*351*/{5,353,-1,-1},
+    /*352*/{-1,-1},
+    /*353*/{-1,-1},
+    /*354*/{-1,-1},
+    /*355*/{-1,-1},
+    /*356*/{-1,-1},
+    /*357*/{-1,-1},
+    /*358*/{-1,-1},
+    /*359*/{-1,-1},
+    /*360*/{-1,-1},
+    /*361*/{-1,-1},
+    /*362*/{-1,-1},
+    /*363*/{-1,-1},
+    /*364*/{-1,-1},
+    /*365*/{-1,-1},
+    /*366*/{-1,-1},
+    /*367*/{-1,-1},
+    /*368*/{-1,-1},
+    /*369*/{104,381,105,99,-1,-1},
+    /*370*/{104,371,105,99,-1,-1},
+    /*371*/{2,372,-1,-1},
+    /*372*/{3,375,-1,-1},
+    /*373*/{-1,-1},
+    /*374*/{1,380,-1,-1},
+    /*375*/{4,377,-1,-1},
+    /*376*/{1,379,-1,-1},
+    /*377*/{-1,-1},
+    /*378*/{-1,-1},
+    /*379*/{-1,-1},
+    /*380*/{-1,-1},
+    /*381*/{2,382,-1,-1},
+    /*382*/{3,383,-1,-1},
+    /*383*/{4,384,-1,-1},
+    /*384*/{-1,-1},
+    /*385*/{-1,-1},
+  };
+
+  /** access to reduce_goto table */
+  public short[][] reduce_table() {return _reduce_table;}
+
+  /** instance of action encapsulation class */
+  protected CUP$actions action_obj;
+
+  /** action encapsulation object initializer */
+  protected void init_actions()
+    {
+      action_obj = new CUP$actions();
+    }
+
+  /** invoke a user supplied parse action */
+  public java_cup.runtime.symbol do_action(
+    int                        act_num,
+    java_cup.runtime.lr_parser parser,
+    java.util.Stack            stack,
+    int                        top)
+    throws java.lang.Exception
+  {
+    /* call code in generated class */
+    return action_obj.CUP$do_action(act_num, parser, stack, top);
+  }
+
+  /** start state */
+  public int start_state() {return 0;}
+  /** start production */
+  public int start_production() {return 1;}
+
+  /** EOF symbol index */
+  public int EOF_sym() {return 0;}
+
+  /** error symbol index */
+  public int error_sym() {return 1;}
+
+
+  /** user initialization */
+  public void user_init() throws java.lang.Exception
+    {
+
+	action_obj.scanner = scanner;
+	action_obj.classFile = classFile;
+
+    }
+
+  /** scan to get the next token */
+  public java_cup.runtime.token scan()
+    throws java.lang.Exception
+    {
+
+    return scanner.next_token();
+
+    }
+
+
+
+	// parser code
+
+	public Scanner scanner;
+	public ClassFile classFile;
+
+	public void report_error(String message, Object info) {
+    	    classFile.report_error("Warning - " + message);
+	}
+
+	public void report_fatal_error(String message, Object info)  {
+    	    classFile.report_error("Error - " + message);
+    	    // System.exit(-1);
+	}
+
+	parser(ClassFile classFile, Scanner scanner) {
+		super();
+
+	    this.scanner = scanner;
+	    this.classFile = classFile;
+	}
+
+};
+
+/** JavaCup generated class to encapsulate user supplied action code.*/
+class CUP$actions {
+
+
+    short access_val;
+	public ClassFile classFile;
+    public Scanner scanner;
+
+
+  /** Constructor */
+  CUP$actions() { }
+
+  /** Method with the actual generated action code. */
+  public final java_cup.runtime.symbol CUP$do_action(
+    int                        CUP$act_num,
+    java_cup.runtime.lr_parser CUP$parser,
+    java.util.Stack            CUP$stack,
+    int                        CUP$top)
+    throws java.lang.Exception
+    {
+      /* object for return from actions */
+      java_cup.runtime.symbol CUP$result;
+
+      /* select the action based on the action number */
+      switch (CUP$act_num)
+        {
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 222: // table_default ::= DEFAULT COLON Int 
+            {
+              CUP$result = new symbol(/*table_default*/46);
+               classFile.endTableswitch((/*off*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 221: // table_default ::= DEFAULT COLON Word 
+            {
+              CUP$result = new symbol(/*table_default*/46);
+               classFile.endTableswitch((/*w*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 220: // table_entry ::= Int SEP 
+            {
+              CUP$result = new symbol(/*table_entry*/47);
+               classFile.addTableswitch((/*off*/(int_token)CUP$stack.elementAt(CUP$top-1)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 219: // table_entry ::= Word SEP 
+            {
+              CUP$result = new symbol(/*table_entry*/47);
+               classFile.addTableswitch((/*w*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 218: // table_list ::= table_entry 
+            {
+              CUP$result = new symbol(/*table_list*/48);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 217: // table_list ::= table_list table_entry 
+            {
+              CUP$result = new symbol(/*table_list*/48);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 216: // table_args ::= Int Int SEP 
+            {
+              CUP$result = new symbol(/*table_args*/44);
+               classFile.newTableswitch((/*low*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val, (/*high*/(int_token)CUP$stack.elementAt(CUP$top-1)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 215: // table_args ::= Int SEP 
+            {
+              CUP$result = new symbol(/*table_args*/44);
+               classFile.newTableswitch((/*low*/(int_token)CUP$stack.elementAt(CUP$top-1)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 214: // table ::= table_args table_list table_default 
+            {
+              CUP$result = new symbol(/*table*/43);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 213: // lookup_default ::= DEFAULT COLON Int 
+            {
+              CUP$result = new symbol(/*lookup_default*/30);
+               classFile.endLookupswitch((/*off*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 212: // lookup_default ::= DEFAULT COLON Word 
+            {
+              CUP$result = new symbol(/*lookup_default*/30);
+               classFile.endLookupswitch((/*w*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 211: // lookup_entry ::= Int COLON Int SEP 
+            {
+              CUP$result = new symbol(/*lookup_entry*/31);
+               classFile.addLookupswitch((/*i*/(int_token)CUP$stack.elementAt(CUP$top-3)).int_val, (/*off*/(int_token)CUP$stack.elementAt(CUP$top-1)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 210: // lookup_entry ::= Int COLON Word SEP 
+            {
+              CUP$result = new symbol(/*lookup_entry*/31);
+               classFile.addLookupswitch((/*i*/(int_token)CUP$stack.elementAt(CUP$top-3)).int_val, (/*w*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 209: // lookup_list ::= lookup_entry 
+            {
+              CUP$result = new symbol(/*lookup_list*/32);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 208: // lookup_list ::= lookup_list lookup_entry 
+            {
+              CUP$result = new symbol(/*lookup_list*/32);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 207: // lookup_args ::= SEP 
+            {
+              CUP$result = new symbol(/*lookup_args*/29);
+               classFile.newLookupswitch(); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 206: // lookup ::= lookup_args lookup_list lookup_default 
+            {
+              CUP$result = new symbol(/*lookup*/28);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 205: // complex_instruction ::= TABLESWITCH table 
+            {
+              CUP$result = new symbol(/*complex_instruction*/14);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 204: // complex_instruction ::= LOOKUPSWITCH lookup 
+            {
+              CUP$result = new symbol(/*complex_instruction*/14);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 203: // simple_instruction ::= Insn Relative 
+            {
+              CUP$result = new symbol(/*simple_instruction*/37);
+               classFile.plantRelativeGoto((/*i*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*n*/(relative_num_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 202: // simple_instruction ::= Insn Str 
+            {
+              CUP$result = new symbol(/*simple_instruction*/37);
+               classFile.plantString((/*i*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*n*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 201: // simple_instruction ::= Insn Word Word 
+            {
+              CUP$result = new symbol(/*simple_instruction*/37);
+               classFile.plant((/*i*/(str_token)CUP$stack.elementAt(CUP$top-2)).str_val, (/*n1*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*n2*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 200: // simple_instruction ::= Insn Word Int 
+            {
+              CUP$result = new symbol(/*simple_instruction*/37);
+               classFile.plant((/*i*/(str_token)CUP$stack.elementAt(CUP$top-2)).str_val, (/*n*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*n2*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 199: // simple_instruction ::= Insn Word 
+            {
+              CUP$result = new symbol(/*simple_instruction*/37);
+               classFile.plant((/*i*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*n*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 198: // simple_instruction ::= Insn Num 
+            {
+              CUP$result = new symbol(/*simple_instruction*/37);
+               classFile.plant((/*i*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*n*/(num_token)CUP$stack.elementAt(CUP$top-0)).num_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 197: // simple_instruction ::= Insn Int 
+            {
+              CUP$result = new symbol(/*simple_instruction*/37);
+               classFile.plant((/*i*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*n*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 196: // simple_instruction ::= Insn Int Int 
+            {
+              CUP$result = new symbol(/*simple_instruction*/37);
+               classFile.plant((/*i*/(str_token)CUP$stack.elementAt(CUP$top-2)).str_val, (/*n1*/(int_token)CUP$stack.elementAt(CUP$top-1)).int_val, (/*n2*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 195: // simple_instruction ::= Insn 
+            {
+              CUP$result = new symbol(/*simple_instruction*/37);
+               classFile.plant((/*i*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 194: // instruction ::= complex_instruction 
+            {
+              CUP$result = new symbol(/*instruction*/21);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 193: // instruction ::= simple_instruction 
+            {
+              CUP$result = new symbol(/*instruction*/21);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 192: // set_expr ::= Word any_item 
+            {
+              CUP$result = new symbol(/*set_expr*/36);
+               scanner.dict.put((/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*v*/(var_token)CUP$stack.elementAt(CUP$top-0))); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 191: // catch_expr ::= classname FROM Int TO Int USING Int 
+            {
+              CUP$result = new symbol(/*catch_expr*/12);
+               classFile.addCatch((/*aclass*/(str_token)CUP$stack.elementAt(CUP$top-6)).str_val,
+                              (/*fromoff*/(int_token)CUP$stack.elementAt(CUP$top-4)).int_val,
+                              (/*tooff*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val,
+                              (/*branchoff*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 190: // catch_expr ::= classname FROM Word TO Word USING Word 
+            {
+              CUP$result = new symbol(/*catch_expr*/12);
+               classFile.addCatch((/*aclass*/(str_token)CUP$stack.elementAt(CUP$top-6)).str_val,
+                              (/*fromlab*/(str_token)CUP$stack.elementAt(CUP$top-4)).str_val,
+                              (/*tolab*/(str_token)CUP$stack.elementAt(CUP$top-2)).str_val,
+                              (/*branchlab*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 189: // throws_expr ::= classname 
+            {
+              CUP$result = new symbol(/*throws_expr*/49);
+               classFile.addThrow((/*s*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 188: // line_expr ::= Int 
+            {
+              CUP$result = new symbol(/*line_expr*/45);
+               classFile.addLine((/*v*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 187: // limit_expr ::= Word Int 
+            {
+              CUP$result = new symbol(/*limit_expr*/27);
+               classFile.report_error(".limit expected \"stack\" or \"locals\", but got "
+                                + (/*w*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 186: // limit_expr ::= STACK Int 
+            {
+              CUP$result = new symbol(/*limit_expr*/27);
+               classFile.setStackSize((/*v*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 185: // limit_expr ::= LOCALS Int 
+            {
+              CUP$result = new symbol(/*limit_expr*/27);
+               classFile.setVarSize((/*v*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 184: // optional_signature ::= 
+            {
+              CUP$result = new str_token(/*optional_signature*/5);
+               ((str_token)CUP$result).str_val = null; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 183: // optional_signature ::= SIGNATURE Str 
+            {
+              CUP$result = new str_token(/*optional_signature*/5);
+               ((str_token)CUP$result).str_val = (/*s*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 182: // var_expr ::= Int IS Word Word optional_signature FROM Int TO Int 
+            {
+              CUP$result = new symbol(/*var_expr*/50);
+               classFile.addVar((/*soff*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val, (/*eoff*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val, (/*name*/(str_token)CUP$stack.elementAt(CUP$top-6)).str_val,
+                            (/*desc*/(str_token)CUP$stack.elementAt(CUP$top-5)).str_val, (/*sign*/(str_token)CUP$stack.elementAt(CUP$top-4)).str_val, (/*reg*/(int_token)CUP$stack.elementAt(CUP$top-8)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 181: // var_expr ::= Int IS Word Word optional_signature 
+            {
+              CUP$result = new symbol(/*var_expr*/50);
+               classFile.addVar(null, null, (/*name*/(str_token)CUP$stack.elementAt(CUP$top-2)).str_val, (/*desc*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val,
+                            (/*sign*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val,  (/*reg*/(int_token)CUP$stack.elementAt(CUP$top-4)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 180: // var_expr ::= Int IS Word Word optional_signature FROM Word TO Word 
+            {
+              CUP$result = new symbol(/*var_expr*/50);
+               classFile.addVar((/*slab*/(str_token)CUP$stack.elementAt(CUP$top-2)).str_val, (/*elab*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val, (/*name*/(str_token)CUP$stack.elementAt(CUP$top-6)).str_val,
+                            (/*desc*/(str_token)CUP$stack.elementAt(CUP$top-5)).str_val, (/*sign*/(str_token)CUP$stack.elementAt(CUP$top-4)).str_val, (/*reg*/(int_token)CUP$stack.elementAt(CUP$top-8)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 179: // endstack ::= DEND STACK 
+            {
+              CUP$result = new symbol(/*endstack*/96);
+               classFile.endStack(); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 178: // stack_item_expr ::= STACK Word Int 
+            {
+              CUP$result = new symbol(/*stack_item_expr*/100);
+               classFile.plantStackStack((/*w*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, String.valueOf((/*n*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val)); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 177: // stack_item_expr ::= STACK Word Word 
+            {
+              CUP$result = new symbol(/*stack_item_expr*/100);
+               classFile.plantStackStack((/*w*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*val*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 176: // stack_item_expr ::= STACK Word 
+            {
+              CUP$result = new symbol(/*stack_item_expr*/100);
+               classFile.plantStackStack((/*w*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val, null); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 175: // stack_item_expr ::= LOCALS Word Int 
+            {
+              CUP$result = new symbol(/*stack_item_expr*/100);
+               classFile.plantStackLocals((/*w*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, String.valueOf((/*n*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val)); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 174: // stack_item_expr ::= LOCALS Word Word 
+            {
+              CUP$result = new symbol(/*stack_item_expr*/100);
+               classFile.plantStackLocals((/*w*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*val*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 173: // stack_item_expr ::= LOCALS Word 
+            {
+              CUP$result = new symbol(/*stack_item_expr*/100);
+               classFile.plantStackLocals((/*w*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val, null); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 172: // stack_item ::= stack_item_expr SEP 
+            {
+              CUP$result = new symbol(/*stack_item*/99);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 171: // stack_items ::= 
+            {
+              CUP$result = new symbol(/*stack_items*/98);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 170: // stack_items ::= stack_items stack_item 
+            {
+              CUP$result = new symbol(/*stack_items*/98);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 169: // stack_offset_def ::= 
+            {
+              CUP$result = new symbol(/*stack_offset_def*/97);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 168: // stack_offset_def ::= OFFSET Word SEP 
+            {
+              CUP$result = new symbol(/*stack_offset_def*/97);
+               classFile.plantStackOffset((/*w*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 167: // stack_offset_def ::= OFFSET Int SEP 
+            {
+              CUP$result = new symbol(/*stack_offset_def*/97);
+               classFile.plantStackOffset((/*n*/(int_token)CUP$stack.elementAt(CUP$top-1)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 166: // stack_map_frame_desc ::= stack_offset_def stack_items 
+            {
+              CUP$result = new symbol(/*stack_map_frame_desc*/95);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 165: // defstack ::= SEP 
+            {
+              CUP$result = new symbol(/*defstack*/94);
+               classFile.beginStack(false); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 164: // defstack_same_expr ::= 
+            {
+              CUP$result = new symbol(/*defstack_same_expr*/103);
+               classFile.beginStack(true); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 163: // defstack_same_expr ::= Int 
+            {
+              CUP$result = new symbol(/*defstack_same_expr*/103);
+               classFile.beginStack((/*n*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 162: // defstack_same ::= defstack_same_expr LOCALS SEP 
+            {
+              CUP$result = new symbol(/*defstack_same*/102);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 161: // stackmap ::= USE defstack_same stack_map_frame_desc endstack 
+            {
+              CUP$result = new symbol(/*stackmap*/101);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 160: // stackmap ::= defstack stack_map_frame_desc endstack 
+            {
+              CUP$result = new symbol(/*stackmap*/101);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 159: // directive ::= DSTACK stackmap 
+            {
+              CUP$result = new symbol(/*directive*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 158: // directive ::= DANNOTATION ann_def_spec ann_def_val endannotation 
+            {
+              CUP$result = new symbol(/*directive*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 157: // directive ::= DANNOTATION ann_met_expr ann_arglist endannotation 
+            {
+              CUP$result = new symbol(/*directive*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 156: // directive ::= DDEPRECATED deprecated_expr 
+            {
+              CUP$result = new symbol(/*directive*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 155: // directive ::= DATTRIBUTE generic_expr 
+            {
+              CUP$result = new symbol(/*directive*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 154: // directive ::= DSIGNATURE signature_expr 
+            {
+              CUP$result = new symbol(/*directive*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 153: // directive ::= DSET set_expr 
+            {
+              CUP$result = new symbol(/*directive*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 152: // directive ::= DCATCH catch_expr 
+            {
+              CUP$result = new symbol(/*directive*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 151: // directive ::= DTHROWS throws_expr 
+            {
+              CUP$result = new symbol(/*directive*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 150: // directive ::= DLINE line_expr 
+            {
+              CUP$result = new symbol(/*directive*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 149: // directive ::= DLIMIT limit_expr 
+            {
+              CUP$result = new symbol(/*directive*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 148: // directive ::= DVAR var_expr 
+            {
+              CUP$result = new symbol(/*directive*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 147: // label ::= Int COLON instruction 
+            {
+              CUP$result = new symbol(/*label*/26);
+               classFile.plantLabel(String.valueOf((/*label*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val)); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 146: // label ::= Word COLON 
+            {
+              CUP$result = new symbol(/*label*/26);
+               classFile.plantLabel((/*label*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 145: // stmnt ::= 
+            {
+              CUP$result = new symbol(/*stmnt*/41);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 144: // stmnt ::= label 
+            {
+              CUP$result = new symbol(/*stmnt*/41);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 143: // stmnt ::= error 
+            {
+              CUP$result = new symbol(/*stmnt*/41);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 142: // stmnt ::= directive 
+            {
+              CUP$result = new symbol(/*stmnt*/41);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 141: // stmnt ::= instruction 
+            {
+              CUP$result = new symbol(/*stmnt*/41);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 140: // statement ::= NT$1 stmnt SEP 
+            {
+              CUP$result = new symbol(/*statement*/39);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 139: // NT$1 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$1*/106);
+               classFile.setLine(scanner.token_line_num); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 138: // statements ::= statement 
+            {
+              CUP$result = new symbol(/*statements*/40);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 137: // statements ::= statements statement 
+            {
+              CUP$result = new symbol(/*statements*/40);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 136: // endmethod ::= DEND METHOD SEP 
+            {
+              CUP$result = new symbol(/*endmethod*/17);
+               classFile.endMethod(); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 135: // defmethod ::= DMETHOD access Word SEP 
+            {
+              CUP$result = new symbol(/*defmethod*/15);
+               String split[] = ScannerUtils.splitMethodSignature((/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val);
+           classFile.newMethod(split[0], split[1], (/*i*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 134: // method_spec ::= defmethod endmethod 
+            {
+              CUP$result = new symbol(/*method_spec*/34);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 133: // method_spec ::= defmethod statements endmethod 
+            {
+              CUP$result = new symbol(/*method_spec*/34);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 132: // method_list ::= method_spec 
+            {
+              CUP$result = new symbol(/*method_list*/33);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 131: // method_list ::= method_list method_spec 
+            {
+              CUP$result = new symbol(/*method_list*/33);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 130: // methods ::= 
+            {
+              CUP$result = new symbol(/*methods*/35);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 129: // methods ::= method_list 
+            {
+              CUP$result = new symbol(/*methods*/35);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 128: // inner_outer ::= 
+            {
+              CUP$result = new str_token(/*inner_outer*/4);
+               ((str_token)CUP$result).str_val = null; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 127: // inner_outer ::= OUTER classname 
+            {
+              CUP$result = new str_token(/*inner_outer*/4);
+               ((str_token)CUP$result).str_val = (/*w*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 126: // inner_inner ::= 
+            {
+              CUP$result = new str_token(/*inner_inner*/3);
+               ((str_token)CUP$result).str_val = null; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 125: // inner_inner ::= INNER classname 
+            {
+              CUP$result = new str_token(/*inner_inner*/3);
+               ((str_token)CUP$result).str_val = (/*w*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 124: // inner_name ::= 
+            {
+              CUP$result = new str_token(/*inner_name*/2);
+               ((str_token)CUP$result).str_val = null; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 123: // inner_name ::= Word 
+            {
+              CUP$result = new str_token(/*inner_name*/2);
+               ((str_token)CUP$result).str_val = (/*w*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 122: // inner_spec ::= DINNER INTERFACE access inner_name inner_inner inner_outer SEP 
+            {
+              CUP$result = new symbol(/*inner_spec*/72);
+               classFile.addInner((short)((/*a*/(int_token)CUP$stack.elementAt(CUP$top-4)).int_val |
+                              RuntimeConstants.ACC_INTERFACE),
+                                (/*n*/(str_token)CUP$stack.elementAt(CUP$top-3)).str_val, (/*i*/(str_token)CUP$stack.elementAt(CUP$top-2)).str_val, (/*o*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 121: // inner_spec ::= DINNER CLASS access inner_name inner_inner inner_outer SEP 
+            {
+              CUP$result = new symbol(/*inner_spec*/72);
+               classFile.addInner((short)(/*a*/(int_token)CUP$stack.elementAt(CUP$top-4)).int_val,
+                              (/*n*/(str_token)CUP$stack.elementAt(CUP$top-3)).str_val, (/*i*/(str_token)CUP$stack.elementAt(CUP$top-2)).str_val, (/*o*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 120: // inner_list ::= inner_spec 
+            {
+              CUP$result = new symbol(/*inner_list*/71);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 119: // inner_list ::= inner_list inner_spec 
+            {
+              CUP$result = new symbol(/*inner_list*/71);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 118: // inners ::= 
+            {
+              CUP$result = new symbol(/*inners*/70);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 117: // inners ::= inner_list 
+            {
+              CUP$result = new symbol(/*inners*/70);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 116: // any_item ::= item 
+            {
+              CUP$result = new var_token(/*any_item*/8);
+               ((var_token)CUP$result).var_val = (/*v*/(var_token)CUP$stack.elementAt(CUP$top-0)).var_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 115: // any_item ::= Word 
+            {
+              CUP$result = new var_token(/*any_item*/8);
+               ((var_token)CUP$result).var_val = (/*w*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 114: // item ::= Str 
+            {
+              CUP$result = new var_token(/*item*/7);
+               ((var_token)CUP$result).var_val = (/*s*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 113: // item ::= Num 
+            {
+              CUP$result = new var_token(/*item*/7);
+               ((var_token)CUP$result).var_val = (/*n*/(num_token)CUP$stack.elementAt(CUP$top-0)).num_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 112: // item ::= Int 
+            {
+              CUP$result = new var_token(/*item*/7);
+               ((var_token)CUP$result).var_val = new Integer((/*i*/(int_token)CUP$stack.elementAt(CUP$top-0)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 111: // field_ext_expr ::= DANNOTATION ann_clf_expr ann_arglist endannotationsep 
+            {
+              CUP$result = new symbol(/*field_ext_expr*/69);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 110: // field_ext_expr ::= DDEPRECATED deprecated_expr SEP 
+            {
+              CUP$result = new symbol(/*field_ext_expr*/69);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 109: // field_ext_expr ::= DATTRIBUTE generic_expr SEP 
+            {
+              CUP$result = new symbol(/*field_ext_expr*/69);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 108: // field_ext_expr ::= DSIGNATURE signature_expr SEP 
+            {
+              CUP$result = new symbol(/*field_ext_expr*/69);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 107: // field_ext_list ::= field_ext_expr 
+            {
+              CUP$result = new symbol(/*field_ext_list*/68);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 106: // field_ext_list ::= field_ext_list field_ext_expr 
+            {
+              CUP$result = new symbol(/*field_ext_list*/68);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 105: // field_exts ::= 
+            {
+              CUP$result = new symbol(/*field_exts*/67);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 104: // field_exts ::= field_ext_list 
+            {
+              CUP$result = new symbol(/*field_exts*/67);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 103: // endfield ::= DEND FIELD SEP 
+            {
+              CUP$result = new symbol(/*endfield*/66);
+               classFile.endField(); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 102: // field_start ::= access Word Word optional_default SEP 
+            {
+              CUP$result = new symbol(/*field_start*/65);
+               classFile.beginField((short)(/*a*/(int_token)CUP$stack.elementAt(CUP$top-4)).int_val, (/*name*/(str_token)CUP$stack.elementAt(CUP$top-3)).str_val,
+                              (/*desc*/(str_token)CUP$stack.elementAt(CUP$top-2)).str_val, (/*v*/(var_token)CUP$stack.elementAt(CUP$top-1)).var_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 101: // optional_default ::= 
+            {
+              CUP$result = new var_token(/*optional_default*/6);
+               ((var_token)CUP$result).var_val = null; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 100: // optional_default ::= EQ item 
+            {
+              CUP$result = new var_token(/*optional_default*/6);
+               ((var_token)CUP$result).var_val = (/*v*/(var_token)CUP$stack.elementAt(CUP$top-0)).var_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 99: // field_spec ::= DFIELD field_start field_exts endfield 
+            {
+              CUP$result = new symbol(/*field_spec*/19);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 98: // field_spec ::= DFIELD access Word Word optional_default SEP 
+            {
+              CUP$result = new symbol(/*field_spec*/19);
+               classFile.addField((short)(/*a*/(int_token)CUP$stack.elementAt(CUP$top-4)).int_val, (/*name*/(str_token)CUP$stack.elementAt(CUP$top-3)).str_val, (/*desc*/(str_token)CUP$stack.elementAt(CUP$top-2)).str_val,
+                               null, (/*v*/(var_token)CUP$stack.elementAt(CUP$top-1)).var_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 97: // field_spec ::= DFIELD access Word Word SIGNATURE Str optional_default SEP 
+            {
+              CUP$result = new symbol(/*field_spec*/19);
+               classFile.addField((short)(/*a*/(int_token)CUP$stack.elementAt(CUP$top-6)).int_val, (/*name*/(str_token)CUP$stack.elementAt(CUP$top-5)).str_val, (/*desc*/(str_token)CUP$stack.elementAt(CUP$top-4)).str_val,
+                              (/*sig*/(str_token)CUP$stack.elementAt(CUP$top-2)).str_val, (/*v*/(var_token)CUP$stack.elementAt(CUP$top-1)).var_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 96: // field_list ::= field_spec 
+            {
+              CUP$result = new symbol(/*field_list*/18);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 95: // field_list ::= field_list field_spec 
+            {
+              CUP$result = new symbol(/*field_list*/18);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 94: // fields ::= 
+            {
+              CUP$result = new symbol(/*fields*/20);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 93: // fields ::= field_list 
+            {
+              CUP$result = new symbol(/*fields*/20);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 92: // generic_expr ::= Word Str 
+            {
+              CUP$result = new symbol(/*generic_expr*/64);
+               classFile.addGenericAttr((/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*file*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 91: // generic_spec ::= DATTRIBUTE generic_expr SEP 
+            {
+              CUP$result = new symbol(/*generic_spec*/63);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 90: // generic_list ::= generic_spec 
+            {
+              CUP$result = new symbol(/*generic_list*/62);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 89: // generic_list ::= generic_list generic_spec 
+            {
+              CUP$result = new symbol(/*generic_list*/62);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 88: // generic_attributes ::= 
+            {
+              CUP$result = new symbol(/*generic_attributes*/61);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 87: // generic_attributes ::= generic_list 
+            {
+              CUP$result = new symbol(/*generic_attributes*/61);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 86: // enclosing_spec ::= 
+            {
+              CUP$result = new symbol(/*enclosing_spec*/53);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 85: // enclosing_spec ::= DENCLOSING METHOD Word SEP 
+            {
+              CUP$result = new symbol(/*enclosing_spec*/53);
+               classFile.setEnclosingMethod((/*w*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 84: // debug_spec ::= DDEBUG Str SEP 
+            {
+              CUP$result = new symbol(/*debug_spec*/58);
+               classFile.setSourceDebugExtension((/*s*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 83: // debug_list ::= debug_spec 
+            {
+              CUP$result = new symbol(/*debug_list*/57);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 82: // debug_list ::= debug_list debug_spec 
+            {
+              CUP$result = new symbol(/*debug_list*/57);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 81: // debug_extension ::= 
+            {
+              CUP$result = new symbol(/*debug_extension*/52);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 80: // debug_extension ::= debug_list 
+            {
+              CUP$result = new symbol(/*debug_extension*/52);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 79: // ann_def_expr ::= Word Word 
+            {
+              CUP$result = new symbol(/*ann_def_expr*/87);
+               classFile.addAnnotationField(null, (/*dsc*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*sub*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 78: // ann_def_expr ::= Word 
+            {
+              CUP$result = new symbol(/*ann_def_expr*/87);
+               classFile.addAnnotationField(null, (/*dsc*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val, null); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 77: // ann_def_val ::= ann_def_expr EQ ann_value_list 
+            {
+              CUP$result = new symbol(/*ann_def_val*/84);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 76: // ann_nest ::= SEP 
+            {
+              CUP$result = new symbol(/*ann_nest*/89);
+               classFile.nestAnnotation(); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 75: // ann_ann_value ::= DANNOTATION ann_nest ann_arglist endannotationsep 
+            {
+              CUP$result = new symbol(/*ann_ann_value*/91);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 74: // ann_ann_list ::= ann_ann_value 
+            {
+              CUP$result = new symbol(/*ann_ann_list*/92);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 73: // ann_ann_list ::= ann_ann_list ann_ann_value 
+            {
+              CUP$result = new symbol(/*ann_ann_list*/92);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 72: // ann_value ::= any_item 
+            {
+              CUP$result = new symbol(/*ann_value*/86);
+               classFile.addAnnotationValue((/*v*/(var_token)CUP$stack.elementAt(CUP$top-0)).var_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 71: // ann_value_items ::= ann_value 
+            {
+              CUP$result = new symbol(/*ann_value_items*/85);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 70: // ann_value_items ::= ann_value_items ann_value 
+            {
+              CUP$result = new symbol(/*ann_value_items*/85);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 69: // ann_value_list ::= ann_ann_list 
+            {
+              CUP$result = new symbol(/*ann_value_list*/93);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 68: // ann_value_list ::= ann_value_items SEP 
+            {
+              CUP$result = new symbol(/*ann_value_list*/93);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 67: // ann_def_spec ::= DEFAULT SEP 
+            {
+              CUP$result = new symbol(/*ann_def_spec*/83);
+               classFile.addAnnotation(); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 66: // ann_arg_expr ::= Word Word Word 
+            {
+              CUP$result = new symbol(/*ann_arg_expr*/88);
+               classFile.addAnnotationField((/*n*/(str_token)CUP$stack.elementAt(CUP$top-2)).str_val, (/*dsc*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*sub*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 65: // ann_arg_expr ::= Word Word 
+            {
+              CUP$result = new symbol(/*ann_arg_expr*/88);
+               classFile.addAnnotationField((/*n*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*dsc*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val, null); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 64: // ann_arg_spec ::= ann_arg_expr EQ ann_value_list 
+            {
+              CUP$result = new symbol(/*ann_arg_spec*/82);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 63: // ann_arg_list ::= ann_arg_spec 
+            {
+              CUP$result = new symbol(/*ann_arg_list*/81);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 62: // ann_arg_list ::= ann_arg_list ann_arg_spec 
+            {
+              CUP$result = new symbol(/*ann_arg_list*/81);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 61: // ann_arglist ::= 
+            {
+              CUP$result = new symbol(/*ann_arglist*/80);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 60: // ann_arglist ::= ann_arg_list 
+            {
+              CUP$result = new symbol(/*ann_arglist*/80);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 59: // ann_met_expr ::= INVISIBLEPARAM Int classname SEP 
+            {
+              CUP$result = new symbol(/*ann_met_expr*/79);
+               classFile.addAnnotation(false, (/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*n*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 58: // ann_met_expr ::= VISIBLEPARAM Int classname SEP 
+            {
+              CUP$result = new symbol(/*ann_met_expr*/79);
+               classFile.addAnnotation(true, (/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val, (/*n*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 57: // ann_met_expr ::= INVISIBLE classname SEP 
+            {
+              CUP$result = new symbol(/*ann_met_expr*/79);
+               classFile.addAnnotation(false, (/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 56: // ann_met_expr ::= VISIBLE classname SEP 
+            {
+              CUP$result = new symbol(/*ann_met_expr*/79);
+               classFile.addAnnotation(true, (/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 55: // ann_clf_expr ::= INVISIBLE classname SEP 
+            {
+              CUP$result = new symbol(/*ann_clf_expr*/78);
+               classFile.addAnnotation(false, (/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 54: // ann_clf_expr ::= VISIBLE classname SEP 
+            {
+              CUP$result = new symbol(/*ann_clf_expr*/78);
+               classFile.addAnnotation(true, (/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 53: // ann_cls_expr ::= DANNOTATION ann_clf_expr 
+            {
+              CUP$result = new symbol(/*ann_cls_expr*/77);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 52: // endannotation ::= DEND ANNOTATION 
+            {
+              CUP$result = new symbol(/*endannotation*/76);
+               classFile.endAnnotation(); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 51: // endannotationsep ::= endannotation SEP 
+            {
+              CUP$result = new symbol(/*endannotationsep*/90);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 50: // ann_cls_spec ::= ann_cls_expr ann_arglist endannotationsep 
+            {
+              CUP$result = new symbol(/*ann_cls_spec*/75);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 49: // ann_cls_list ::= ann_cls_spec 
+            {
+              CUP$result = new symbol(/*ann_cls_list*/74);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 48: // ann_cls_list ::= ann_cls_list ann_cls_spec 
+            {
+              CUP$result = new symbol(/*ann_cls_list*/74);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 47: // annotations ::= 
+            {
+              CUP$result = new symbol(/*annotations*/73);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 46: // annotations ::= ann_cls_list 
+            {
+              CUP$result = new symbol(/*annotations*/73);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 45: // implements_spec ::= DIMPLEMENTS classname SEP 
+            {
+              CUP$result = new symbol(/*implements_spec*/24);
+               classFile.addInterface((/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 44: // implements_list ::= implements_spec 
+            {
+              CUP$result = new symbol(/*implements_list*/23);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 43: // implements_list ::= implements_list implements_spec 
+            {
+              CUP$result = new symbol(/*implements_list*/23);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 42: // implements ::= 
+            {
+              CUP$result = new symbol(/*implements*/22);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 41: // implements ::= implements_list 
+            {
+              CUP$result = new symbol(/*implements*/22);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 40: // super_spec ::= DSUPER classname SEP 
+            {
+              CUP$result = new symbol(/*super_spec*/42);
+               classFile.setSuperClass((/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 39: // access_item ::= SYNTHETIC 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_SYNTHETIC; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 38: // access_item ::= STRICT 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_STRICT; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 37: // access_item ::= VARARGS 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_VARARGS; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 36: // access_item ::= BRIDGE 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_BRIDGE; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 35: // access_item ::= ENUM 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_ENUM; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 34: // access_item ::= ANNOTATION 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_ANNOTATION; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 33: // access_item ::= ABSTRACT 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_ABSTRACT; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 32: // access_item ::= INTERFACE 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_INTERFACE; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 31: // access_item ::= NATIVE 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_NATIVE; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 30: // access_item ::= TRANSIENT 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_TRANSIENT; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 29: // access_item ::= VOLATILE 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_VOLATILE; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 28: // access_item ::= SYNCHRONIZED 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_SYNCHRONIZED; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 27: // access_item ::= FINAL 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_FINAL; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 26: // access_item ::= STATIC 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_STATIC; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 25: // access_item ::= PROTECTED 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_PROTECTED; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 24: // access_item ::= PRIVATE 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_PRIVATE; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 23: // access_item ::= PUBLIC 
+            {
+              CUP$result = new symbol(/*access_item*/9);
+               access_val |= RuntimeConstants.ACC_PUBLIC; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 22: // access_items ::= access_item 
+            {
+              CUP$result = new symbol(/*access_items*/10);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 21: // access_items ::= access_items access_item 
+            {
+              CUP$result = new symbol(/*access_items*/10);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 20: // access_list ::= 
+            {
+              CUP$result = new symbol(/*access_list*/11);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 19: // access_list ::= access_items 
+            {
+              CUP$result = new symbol(/*access_list*/11);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 18: // access ::= NT$0 access_list 
+            {
+              CUP$result = new int_token(/*access*/104);
+               ((int_token)CUP$result).int_val = access_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 17: // NT$0 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$0*/105);
+               access_val = 0; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 16: // classname ::= Word 
+            {
+              CUP$result = new str_token(/*classname*/1);
+               ((str_token)CUP$result).str_val = ScannerUtils.convertDots((/*w*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 15: // class_spec ::= DINTERFACE access classname SEP 
+            {
+              CUP$result = new symbol(/*class_spec*/13);
+               classFile.setClass((/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val,
+                (short)((/*a*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val |
+                        RuntimeConstants.ACC_SUPER |
+                        RuntimeConstants.ACC_INTERFACE)); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 14: // class_spec ::= DCLASS access classname SEP 
+            {
+              CUP$result = new symbol(/*class_spec*/13);
+               classFile.setClass((/*name*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val,
+                (short)((/*a*/(int_token)CUP$stack.elementAt(CUP$top-2)).int_val | RuntimeConstants.ACC_SUPER)); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 13: // source_spec ::= 
+            {
+              CUP$result = new symbol(/*source_spec*/38);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 12: // source_spec ::= DSOURCE Word SEP 
+            {
+              CUP$result = new symbol(/*source_spec*/38);
+               classFile.setSource((/*w*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 11: // source_spec ::= DSOURCE Str SEP 
+            {
+              CUP$result = new symbol(/*source_spec*/38);
+               classFile.setSource((/*s*/(str_token)CUP$stack.elementAt(CUP$top-1)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 10: // bytecode_spec ::= 
+            {
+              CUP$result = new symbol(/*bytecode_spec*/51);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 9: // bytecode_spec ::= DBYTECODE Num SEP 
+            {
+              CUP$result = new symbol(/*bytecode_spec*/51);
+               classFile.setVersion((/*n*/(num_token)CUP$stack.elementAt(CUP$top-1)).num_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 8: // deprecated_expr ::= 
+            {
+              CUP$result = new symbol(/*deprecated_expr*/60);
+               classFile.setDeprecated(); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 7: // deprecated_spec ::= 
+            {
+              CUP$result = new symbol(/*deprecated_spec*/59);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 6: // deprecated_spec ::= DDEPRECATED deprecated_expr SEP 
+            {
+              CUP$result = new symbol(/*deprecated_spec*/59);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 5: // signature_expr ::= Str 
+            {
+              CUP$result = new symbol(/*signature_expr*/55);
+               classFile.setSignature((/*sig*/(str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 4: // signature_spec ::= 
+            {
+              CUP$result = new symbol(/*signature_spec*/54);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 3: // signature_spec ::= DSIGNATURE signature_expr SEP 
+            {
+              CUP$result = new symbol(/*signature_spec*/54);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 2: // jasmin_header ::= bytecode_spec source_spec class_spec super_spec implements signature_spec enclosing_spec deprecated_spec annotations generic_attributes debug_extension 
+            {
+              CUP$result = new symbol(/*jasmin_header*/56);
+               classFile.endHeader(); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 1: // $START ::= jas_file EOF 
+            {
+              CUP$result = new java_cup.runtime.token(/*$START*/0);
+              
+            }
+          /* ACCEPT */
+          CUP$parser.done_parsing();
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 0: // jas_file ::= jasmin_header inners fields methods 
+            {
+              CUP$result = new symbol(/*jas_file*/25);
+              
+            }
+          return CUP$result;
+
+          /* . . . . . .*/
+          default:
+            throw new Exception(
+               "Invalid action number found in internal parse table");
+
+        }
+    }
+};
+
diff --git a/jasmin/jasmin-2.4/src/jasmin/relative_num_token.java b/jasmin/jasmin-2.4/src/jasmin/relative_num_token.java
new file mode 100644
index 0000000..73836d3
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin/relative_num_token.java
@@ -0,0 +1,16 @@
+
+package jasmin;
+import java_cup.*;
+
+/** This subclass of token represents numbers beginning with '+' or '-'
+ *
+ * @see java_cup.runtime.str_token
+ * @version last updated: 26/10/05
+ * @author  Jon Meyer
+ */
+
+class relative_num_token extends java_cup.runtime.int_token {
+    public relative_num_token(int term_num, int v) {
+        super(term_num, v);
+    }
+}
diff --git a/jasmin/jasmin-2.4/src/jasmin/sym.java b/jasmin/jasmin-2.4/src/jasmin/sym.java
new file mode 100644
index 0000000..263b4a2
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin/sym.java
@@ -0,0 +1,85 @@
+
+//----------------------------------------------------
+// The following code was generated by Java(tm) CUP v0.9d
+// Fri May 07 07:55:04 MSD 2010
+//----------------------------------------------------
+
+package jasmin;
+
+/** JavaCup generated class containing symbol constants. */
+public class sym {
+  /* terminals */
+  static final int FROM = 27;
+  static final int DSIGNATURE = 19;
+  static final int SYNTHETIC = 59;
+  static final int OUTER = 37;
+  static final int DCLASS = 3;
+  static final int DVAR = 13;
+  static final int DSUPER = 10;
+  static final int SIGNATURE = 29;
+  static final int ENUM = 55;
+  static final int INVISIBLE = 39;
+  static final int INNER = 36;
+  static final int Insn = 68;
+  static final int TABLESWITCH = 61;
+  static final int STACK = 30;
+  static final int Int = 69;
+  static final int LOOKUPSWITCH = 60;
+  static final int TRANSIENT = 52;
+  static final int PROTECTED = 48;
+  static final int FINAL = 44;
+  static final int DSOURCE = 11;
+  static final int EQ = 63;
+  static final int CLASS = 34;
+  static final int DDEBUG = 17;
+  static final int ABSTRACT = 43;
+  static final int DINTERFACE = 15;
+  static final int NATIVE = 46;
+  static final int DTHROWS = 12;
+  static final int USE = 42;
+  static final int INTERFACE = 45;
+  static final int VARARGS = 57;
+  static final int DDEPRECATED = 22;
+  static final int DSET = 9;
+  static final int DFIELD = 5;
+  static final int VISIBLE = 38;
+  static final int DLIMIT = 6;
+  static final int PUBLIC = 49;
+  static final int DEND = 4;
+  static final int DENCLOSING = 18;
+  static final int DMETHOD = 8;
+  static final int STRICT = 58;
+  static final int DANNOTATION = 24;
+  static final int EOF = 0;
+  static final int DEFAULT = 62;
+  static final int VISIBLEPARAM = 40;
+  static final int OFFSET = 31;
+  static final int DATTRIBUTE = 21;
+  static final int IS = 26;
+  static final int METHOD = 28;
+  static final int DBYTECODE = 16;
+  static final int error = 1;
+  static final int SYNCHRONIZED = 51;
+  static final int Word = 67;
+  static final int SEP = 64;
+  static final int ANNOTATION = 54;
+  static final int BRIDGE = 56;
+  static final int COLON = 65;
+  static final int USING = 25;
+  static final int DLINE = 7;
+  static final int FIELD = 33;
+  static final int DCATCH = 2;
+  static final int VOLATILE = 53;
+  static final int LOCALS = 32;
+  static final int DINNER = 23;
+  static final int Relative = 71;
+  static final int INVISIBLEPARAM = 41;
+  static final int DIMPLEMENTS = 14;
+  static final int DSTACK = 20;
+  static final int PRIVATE = 47;
+  static final int TO = 35;
+  static final int STATIC = 50;
+  static final int Str = 66;
+  static final int Num = 70;
+};
+
diff --git a/jasmin/jasmin-2.4/src/jasmin/var_token.java b/jasmin/jasmin-2.4/src/jasmin/var_token.java
new file mode 100644
index 0000000..8296b3c
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/jasmin/var_token.java
@@ -0,0 +1,41 @@
+
+package jasmin;
+import java_cup.*;
+
+/** This subclass of token represents symbols that need to maintain one
+ *  number value as an attribute.  It maintains that value in the public
+ *  field var_val.
+ *
+ * @see java_cup.runtime.str_token
+ * @version last updated: 1/7/96
+ * @author  Jon Meyer
+ */
+
+class var_token extends java_cup.runtime.token {
+
+  /** Full constructor. */
+  public var_token(int term_num, Number v)
+    {
+      /* super class does most of the work */
+      super(term_num);
+
+      var_val = v;
+    }
+
+  public var_token(int term_num, String v)
+    {
+      /* super class does most of the work */
+      super(term_num);
+
+      var_val = v;
+    }
+
+  /** Constructor with default value of 0 */
+  public var_token(int term_num)
+    {
+      this(term_num, new Integer(0));
+    }
+
+  /** The stored number reference. */
+  public Object var_val;
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup.mf b/jasmin/jasmin-2.4/src/java_cup.mf
new file mode 100644
index 0000000..31c9589
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup.mf
@@ -0,0 +1 @@
+Main-Class: java_cup.Main
diff --git a/jasmin/jasmin-2.4/src/java_cup/Main.java b/jasmin/jasmin-2.4/src/java_cup/Main.java
new file mode 100644
index 0000000..0b37468
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/Main.java
@@ -0,0 +1,851 @@
+
+package java_cup;
+
+import java.util.Enumeration;
+import java.io.*;
+
+/** This class serves as the main driver for the JavaCup system.
+ *  It accepts user options and coordinates overall control flow.
+ *  The main flow of control includes the following activities:
+ *  <ul>
+ *    <li> Parse user supplied arguments and options.
+ *    <li> Open output files.
+ *    <li> Parse the specification from standard input.
+ *    <li> Check for unused terminals, non-terminals, and productions.
+ *    <li> Build the state machine, tables, etc.
+ *    <li> Output the generated code.
+ *    <li> Close output files.
+ *    <li> Print a summary if requested.
+ *  </ul>
+ *
+ *  Options to the main program include: <dl>
+ *   <dt> -package name
+ *   <dd> specify package generated classes go in [default none]
+ *   <dt> -parser name
+ *   <dd> specify parser class name [default "parser"]
+ *   <dt> -symbols name
+ *   <dd> specify name for symbol constant class [default "sym"]
+ *   <dt> -nonterms
+ *   <dd> put non terminals in symbol constant class
+ *   <dt> -expect #
+ *   <dd> number of conflicts expected/allowed [default 0]
+ *   <dt> -compact_red
+ *   <dd> compact tables by defaulting to most frequent reduce
+ *   <dt> -nowarn
+ *   <dd> don't warn about useless productions, etc.
+ *   <dt> -nosummary
+ *   <dd> don't print the usual summary of parse states, etc.
+ *   <dt> -progress
+ *   <dd> print messages to indicate progress of the system
+ *   <dt> -time
+ *   <dd> print time usage summary
+ *   <dt> -dump_grammar
+ *   <dd> produce a dump of the symbols and grammar
+ *   <dt> -dump_states
+ *   <dd> produce a dump of parse state machine
+ *   <dt> -dump_tables
+ *   <dd> produce a dump of the parse tables
+ *   <dt> -dump
+ *   <dd> produce a dump of all of the above
+ *   <dt> -debug
+ *   <dd> turn on debugging messages within JavaCup
+ *   </dl>
+ *
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+
+public class Main {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+  /** Only constructor is private, so we do not allocate any instances of this
+      class. */
+  private Main() { }
+
+  /*-------------------------*/
+  /* Options set by the user */
+  /*-------------------------*/
+  /** User option -- do we print progress messages. */
+  protected static boolean print_progress   = false;
+  /** User option -- do we produce a dump of the state machine */
+  protected static boolean opt_dump_states  = false;
+  /** User option -- do we produce a dump of the parse tables */
+  protected static boolean opt_dump_tables  = false;
+  /** User option -- do we produce a dump of the grammar */
+  protected static boolean opt_dump_grammar = false;
+  /** User option -- do we show timing information as a part of the summary */
+  protected static boolean opt_show_timing  = false;
+  /** User option -- do we run produce extra debugging messages */
+  protected static boolean opt_do_debug     = false;
+  /** User option -- do we compact tables by making most common reduce the
+      default action */
+  protected static boolean opt_compact_red  = false;
+  /** User option -- should we include non terminal symbol numbers in the
+      symbol constant class. */
+  protected static boolean include_non_terms = false;
+  /** User option -- do not print a summary. */
+  protected static boolean no_summary = false;
+  /** User option -- number of conflicts to expect */
+  protected static int expect_conflicts = 0;
+
+  /*----------------------------------------------------------------------*/
+  /* Timing data (not all of these time intervals are mutually exclusive) */
+  /*----------------------------------------------------------------------*/
+  /** Timing data -- when did we start */
+  protected static long start_time       = 0;
+  /** Timing data -- when did we end preliminaries */
+  protected static long prelim_end       = 0;
+  /** Timing data -- when did we end parsing */
+  protected static long parse_end        = 0;
+  /** Timing data -- when did we end checking */
+  protected static long check_end        = 0;
+  /** Timing data -- when did we end dumping */
+  protected static long dump_end         = 0;
+  /** Timing data -- when did we end state and table building */
+  protected static long build_end        = 0;
+  /** Timing data -- when did we end nullability calculation */
+  protected static long nullability_end  = 0;
+  /** Timing data -- when did we end first set calculation */
+  protected static long first_end        = 0;
+  /** Timing data -- when did we end state machine construction */
+  protected static long machine_end      = 0;
+  /** Timing data -- when did we end table construction */
+  protected static long table_end        = 0;
+  /** Timing data -- when did we end checking for non-reduced productions */
+  protected static long reduce_check_end = 0;
+  /** Timing data -- when did we finish emitting code */
+  protected static long emit_end         = 0;
+  /** Timing data -- when were we completely done */
+  protected static long final_time       = 0;
+
+  /* Additional timing information is also collected in emit */
+
+  /** Path to create output files */
+  private static String out_path = null;
+
+  /*-----------------------------------------------------------*/
+  /*--- Main Program ------------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** The main driver for the system.
+   * @param argv an array of strings containing command line arguments.
+   */
+  public static void main(String argv[])
+    throws internal_error, java.io.IOException, java.lang.Exception
+    {
+      boolean did_output = false;
+
+      start_time = System.currentTimeMillis();
+
+      /* process user options and arguments */
+      parse_args(argv);
+
+      /* open output files */
+      if (print_progress) System.err.println("Opening files...");
+      open_files();
+
+      prelim_end = System.currentTimeMillis();
+
+      /* parse spec into internal data structures */
+      if (print_progress)
+	System.err.println("Parsing specification from standard input...");
+      parse_grammar_spec();
+
+      parse_end = System.currentTimeMillis();
+
+      /* don't proceed unless we are error free */
+      if (lexer.error_count == 0)
+	{
+	  /* check for unused bits */
+          if (print_progress) System.err.println("Checking specification...");
+          check_unused();
+
+          check_end = System.currentTimeMillis();
+
+	  /* build the state machine and parse tables */
+          if (print_progress) System.err.println("Building parse tables...");
+          build_parser();
+
+          build_end = System.currentTimeMillis();
+
+	  /* output the generated code */
+          if (print_progress) System.err.println("Writing parser...");
+          emit_parser();
+	  did_output = true;
+
+          emit_end = System.currentTimeMillis();
+	}
+      else
+	{
+	  /* fix up the times to make the summary easier */
+	  emit_end = parse_end;
+	}
+
+      /* do requested dumps */
+      if (opt_dump_grammar) dump_grammar();
+      if (opt_dump_states)  dump_machine();
+      if (opt_dump_tables)  dump_tables();
+
+      dump_end = System.currentTimeMillis();
+
+      /* close output files */
+      if (print_progress) System.err.println("Closing files...");
+      close_files();
+
+      /* produce a summary if desired */
+      if (!no_summary) emit_summary(did_output);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Print a "usage message" that described possible command line options,
+   *  then exit.
+   * @param message a specific error message to preface the usage message by.
+   */
+  protected static void usage(String message)
+    {
+      System.err.println();
+      System.err.println(message);
+      System.err.println();
+      System.err.println(
+"Usage: " + version.program_name + " [options]\n" +
+"  and expects a specification file on standard input.\n" +
+"  Legal options include:\n" +
+"    -out path      specify the output files path [default current directory]\n" +
+"    -package name  specify package generated classes go in [default none]\n" +
+"    -parser name   specify parser class name [default \"parser\"]\n" +
+"    -symbols name  specify name for symbol constant class [default \"sym\"]\n"+
+"    -nonterms      put non terminals in symbol constant class\n" +
+"    -expect #      number of conflicts expected/allowed [default 0]\n" +
+"    -compact_red   compact tables by defaulting to most frequent reduce\n" +
+"    -nowarn        don't warn about useless productions, etc.\n" +
+"    -nosummary     don't print the usual summary of parse states, etc.\n" +
+"    -progress      print messages to indicate progress of the system\n" +
+"    -time          print time usage summary\n" +
+"    -dump_grammar  produce a human readable dump of the symbols and grammar\n"+
+"    -dump_states   produce a dump of parse state machine\n"+
+"    -dump_tables   produce a dump of the parse tables\n"+
+"    -dump          produce a dump of all of the above\n"
+      );
+      System.exit(1);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Parse command line options and arguments to set various user-option
+   *  flags and variables.
+   * @param argv the command line arguments to be parsed.
+   */
+  protected static void parse_args(String argv[])
+    {
+      int len = argv.length;
+      int i;
+
+      /* parse the options */
+      for (i=0; i<len; i++)
+	{
+	  /* try to get the various options */
+	  if (argv[i].equals("-package"))
+	    {
+	      /* must have an arg */
+	      if (++i >= len || argv[i].startsWith("-") ||
+				argv[i].endsWith(".cup"))
+		usage("-package must have a name argument");
+
+	      /* record the name */
+	      emit.package_name = argv[i];
+	    }
+	  else if (argv[i].equals("-parser"))
+	    {
+	      /* must have an arg */
+	      if (++i >= len || argv[i].startsWith("-") ||
+				argv[i].endsWith(".cup"))
+		usage("-parser must have a name argument");
+
+	      /* record the name */
+	      emit.parser_class_name = argv[i];
+	    }
+	  else if (argv[i].equals("-input")) {
+		  /* must have an arg */
+		  if (++i >= len || argv[i].startsWith("-") ||
+			  argv[i].endsWith(".cup"))
+			  usage("-input must have a name argument");
+
+		  /* record the name */
+		  emit.input_file_name = argv[i];
+	  }
+	  else if (argv[i].equals("-symbols"))
+	    {
+	      /* must have an arg */
+	      if (++i >= len || argv[i].startsWith("-") ||
+				argv[i].endsWith(".cup"))
+		usage("-symbols must have a name argument");
+
+	      /* record the name */
+	      emit.symbol_const_class_name = argv[i];
+	    }
+	  else if (argv[i].equals("-nonterms"))
+	    {
+	      include_non_terms = true;
+	    }
+	  else if (argv[i].equals("-expect"))
+	    {
+	      /* must have an arg */
+	      if (++i >= len || argv[i].startsWith("-") ||
+				argv[i].endsWith(".cup"))
+		usage("-expect must have a name argument");
+
+	      /* record the number */
+	      try {
+	        expect_conflicts = Integer.parseInt(argv[i]);
+	      } catch (NumberFormatException e) {
+		usage("-expect must be followed by a decimal integer");
+	      }
+	    }
+          else if (argv[i].equals("-out"))
+	    {
+	      /* must have an arg */
+              if (++i >= len || argv[i].startsWith("-"))
+                usage("-out must have a path argument");
+
+              /* validate path */
+              if (argv[i].length() != 0) {
+                out_path = argv[i] + File.separator;
+                File f = new File(out_path);
+                if (!f.exists() || !f.isDirectory())
+                  out_path = null;
+	      }
+              if (out_path == null)
+                usage("-out argument must be a valid existing path");
+	    }
+	  else if (argv[i].equals("-compact_red"))  opt_compact_red = true;
+	  else if (argv[i].equals("-nosummary"))    no_summary = true;
+	  else if (argv[i].equals("-nowarn"))       emit.nowarn = true;
+	  else if (argv[i].equals("-dump_states"))  opt_dump_states = true;
+	  else if (argv[i].equals("-dump_tables"))  opt_dump_tables = true;
+	  else if (argv[i].equals("-progress"))     print_progress = true;
+	  else if (argv[i].equals("-dump_grammar")) opt_dump_grammar = true;
+	  else if (argv[i].equals("-dump"))
+	        opt_dump_states = opt_dump_tables = opt_dump_grammar = true;
+	  else if (argv[i].equals("-time"))         opt_show_timing = true;
+	  else if (argv[i].equals("-debug"))        opt_do_debug = true;
+	  else
+	    {
+	      usage("Unrecognized option \"" + argv[i] + "\"");
+	    }
+	}
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /*-------*/
+  /* Files */
+  /*-------*/
+
+  /** Input file.  This is a buffered version of System.in. */
+  protected static BufferedInputStream input_file;
+
+  /** Output file for the parser class. */
+  protected static PrintStream parser_class_file;
+
+  /** Output file for the symbol constant class. */
+  protected static PrintStream symbol_class_file;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Open various files used by the system. */
+  protected static void open_files()
+    {
+      File fil;
+      String out_name;
+
+      /* use a buffered version of standard input */
+		if (emit.input_file_name != null)
+			try {
+				input_file = new BufferedInputStream(new FileInputStream(emit.input_file_name));
+			} catch (Exception ex) {
+				ex.printStackTrace();
+				System.exit(3);
+			}
+		else
+			input_file = new BufferedInputStream(System.in);
+
+      /* open each of the output files */
+      if (out_path == null)
+        out_path = "";
+
+      /* parser class */
+      out_name = out_path + emit.parser_class_name + ".java";
+      fil = new File(out_name);
+      try {
+        parser_class_file = new PrintStream(
+		 new BufferedOutputStream(new FileOutputStream(fil), 4096));
+      } catch(Exception e) {
+	System.err.println("Can't open \"" + out_name + "\" for output");
+	System.exit(3);
+      }
+
+      /* symbol constants class */
+      out_name = out_path + emit.symbol_const_class_name + ".java";
+      fil = new File(out_name);
+      try {
+        symbol_class_file = new PrintStream(
+		 new BufferedOutputStream(new FileOutputStream(fil), 4096));
+      } catch(Exception e) {
+	System.err.println("Can't open \"" + out_name + "\" for output");
+	System.exit(4);
+      }
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Close various files used by the system. */
+  protected static void close_files() throws java.io.IOException
+    {
+      if (input_file != null) input_file.close();
+      if (parser_class_file != null) parser_class_file.close();
+      if (symbol_class_file != null) symbol_class_file.close();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Parse the grammar specification from standard input.  This produces
+   *  sets of terminal, non-terminals, and productions which can be accessed
+   *  via static variables of the respective classes, as well as the setting
+   *  of various variables (mostly in the emit class) for small user supplied
+   *  items such as the code to scan with.
+   */
+  protected static void parse_grammar_spec() throws java.lang.Exception
+    {
+      parser parser_obj;
+
+      /* create a parser and parse with it */
+      parser_obj = new parser();
+      try {
+	if (opt_do_debug)
+          parser_obj.debug_parse();
+	else
+          parser_obj.parse();
+      } catch (Exception e)
+      {
+	/* something threw an exception.  catch it and emit a message so we
+	   have a line number to work with, then re-throw it */
+	lexer.emit_error("Internal error: Unexpected exception");
+	throw e;
+      }
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Check for unused symbols.  Unreduced productions get checked when
+   *  tables are created.
+   */
+  protected static void check_unused()
+    {
+      terminal term;
+      non_terminal nt;
+
+      /* check for unused terminals */
+      for (Enumeration t = terminal.all(); t.hasMoreElements(); )
+	{
+	  term = (terminal)t.nextElement();
+
+	  /* don't issue a message for EOF */
+	  if (term == terminal.EOF) continue;
+
+	  /* or error */
+	  if (term == terminal.error) continue;
+
+	  /* is this one unused */
+	  if (term.use_count() == 0)
+	    {
+	      /* count it and warn if we are doing warnings */
+	      emit.unused_term++;
+	      if (!emit.nowarn)
+		{
+		  System.err.println("Warning: Terminal \"" + term.name() +
+				     "\" was declared but never used");
+		  lexer.warning_count++;
+		}
+	    }
+	}
+
+      /* check for unused non terminals */
+      for (Enumeration n = non_terminal.all(); n.hasMoreElements(); )
+	{
+	  nt = (non_terminal)n.nextElement();
+
+	  /* is this one unused */
+	  if (nt.use_count() == 0)
+	    {
+	      /* count and warn if we are doing warnings */
+	      emit.unused_term++;
+	      if (!emit.nowarn)
+		{
+		  System.err.println("Warning: Non terminal \"" + nt.name() +
+				     "\" was declared but never used");
+		  lexer.warning_count++;
+		}
+	    }
+	}
+
+    }
+
+  /* . . . . . . . . . . . . . . . . . . . . . . . . .*/
+  /* . . Internal Results of Generating the Parser . .*/
+  /* . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Start state in the overall state machine. */
+  protected static lalr_state start_state;
+
+  /** Resulting parse action table. */
+  protected static parse_action_table action_table;
+
+  /** Resulting reduce-goto table. */
+  protected static parse_reduce_table reduce_table;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Build the (internal) parser from the previously parsed specification.
+   *  This includes:<ul>
+   *    <li> Computing nullability of non-terminals.
+   *    <li> Computing first sets of non-terminals and productions.
+   *    <li> Building the viable prefix recognizer machine.
+   *    <li> Filling in the (internal) parse tables.
+   *    <li> Checking for unreduced productions.
+   *  </ul>
+   */
+  protected static void build_parser() throws internal_error
+    {
+      /* compute nullability of all non terminals */
+      if (opt_do_debug || print_progress)
+	System.err.println("  Computing non-terminal nullability...");
+      non_terminal.compute_nullability();
+
+      nullability_end = System.currentTimeMillis();
+
+      /* compute first sets of all non terminals */
+      if (opt_do_debug || print_progress)
+	System.err.println("  Computing first sets...");
+      non_terminal.compute_first_sets();
+
+      first_end = System.currentTimeMillis();
+
+      /* build the LR viable prefix recognition machine */
+      if (opt_do_debug || print_progress)
+	System.err.println("  Building state machine...");
+      start_state = lalr_state.build_machine(emit.start_production);
+
+      machine_end = System.currentTimeMillis();
+
+      /* build the LR parser action and reduce-goto tables */
+      if (opt_do_debug || print_progress)
+	System.err.println("  Filling in tables...");
+      action_table = new parse_action_table();
+      reduce_table = new parse_reduce_table();
+      for (Enumeration st = lalr_state.all(); st.hasMoreElements(); )
+	{
+	  ((lalr_state)st.nextElement()).build_table_entries(
+			                      action_table, reduce_table);
+	}
+
+      table_end = System.currentTimeMillis();
+
+      /* check and warn for non-reduced productions */
+      if (opt_do_debug || print_progress)
+	System.err.println("  Checking for non-reduced productions...");
+      action_table.check_reductions();
+
+      reduce_check_end = System.currentTimeMillis();
+
+      /* if we have more conflicts than we expected issue a message and die */
+      if (emit.num_conflicts > expect_conflicts)
+	{
+	  System.err.println("*** More conflicts encountered than expected " +
+			     "-- parser generation aborted");
+	  lexer.error_count++;
+	  build_end = System.currentTimeMillis();
+
+	  /* do dumps and summary as needed */
+          if (opt_dump_grammar) dump_grammar();
+          if (opt_dump_states)  dump_machine();
+	  if (!no_summary) emit_summary(false);
+
+	  System.exit(100);
+	}
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Call the emit routines necessary to write out the generated parser. */
+  protected static void emit_parser() throws internal_error
+    {
+      emit.symbols(symbol_class_file, include_non_terms);
+      emit.parser(parser_class_file, action_table, reduce_table,
+		  start_state.index(), emit.start_production, opt_compact_red);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Helper routine to optionally return a plural or non-plural ending.
+   * @param val the numerical value determining plurality.
+   */
+  protected static String plural(int val)
+    {
+      if (val == 1)
+	return "";
+      else
+	return "s";
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Emit a long summary message to standard error (System.err) which
+   *  summarizes what was found in the specification, how many states were
+   *  produced, how many conflicts were found, etc.  A detailed timing
+   *  summary is also produced if it was requested by the user.
+   * @param output_produced did the system get far enough to generate code.
+   */
+  protected static void emit_summary(boolean output_produced)
+    {
+      final_time = System.currentTimeMillis();
+
+      if (no_summary) return;
+
+      System.err.println("------- " + version.title_str +
+			 " Parser Generation Summary -------");
+
+      /* error and warning count */
+      System.err.println("  " + lexer.error_count + " error" +
+	 plural(lexer.error_count) + " and " + lexer.warning_count +
+	 " warning" + plural(lexer.warning_count));
+
+      /* basic stats */
+      System.err.print("  " + terminal.number() + " terminal" +
+			 plural(terminal.number()) + ", ");
+      System.err.print(non_terminal.number() + " non terminal" +
+			 plural(non_terminal.number()) + ", and ");
+      System.err.println(production.number() + " production" +
+			 plural(production.number()) + " declared, ");
+      System.err.println("  producing " + lalr_state.number() +
+			 " unique parse states.");
+
+      /* unused symbols */
+      System.err.println("  " + emit.unused_term + " terminal" +
+			 plural(emit.unused_term) + " declared but not used.");
+      System.err.println("  " + emit.unused_non_term + " non terminal" +
+			 plural(emit.unused_term) + " declared but not used.");
+
+      /* productions that didn't reduce */
+      System.err.println("  " + emit.not_reduced + " production" +
+			 plural(emit.not_reduced) + " never reduced.");
+
+      /* conflicts */
+      System.err.println("  " + emit.num_conflicts + " conflict" +
+			 plural(emit.num_conflicts) + " detected" +
+	                 " (" + expect_conflicts + " expected).");
+
+      /* code location */
+      if (output_produced)
+	System.err.println("  Code written to \"" + emit.parser_class_name +
+	        ".java\", and \"" + emit.symbol_const_class_name + ".java\".");
+      else
+	System.err.println("  No code produced.");
+
+      if (opt_show_timing) show_times();
+
+      System.err.println(
+	"---------------------------------------------------- (" +
+	 version.version_str + ")");
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce the optional timing summary as part of an overall summary. */
+  protected static void show_times()
+    {
+      long total_time = final_time - start_time;
+
+      System.err.println(". . . . . . . . . . . . . . . . . . . . . . . . . ");
+      System.err.println("  Timing Summary");
+      System.err.println("    Total time       "
+        + timestr(final_time-start_time, total_time));
+      System.err.println("      Startup        "
+	+ timestr(prelim_end-start_time, total_time));
+      System.err.println("      Parse          "
+	+ timestr(parse_end-prelim_end, total_time) );
+      if (check_end != 0)
+        System.err.println("      Checking       "
+	    + timestr(check_end-parse_end, total_time));
+      if (check_end != 0 && build_end != 0)
+        System.err.println("      Parser Build   "
+	    + timestr(build_end-check_end, total_time));
+      if (nullability_end != 0 && check_end != 0)
+        System.err.println("        Nullability  "
+	    + timestr(nullability_end-check_end, total_time));
+      if (first_end != 0 && nullability_end != 0)
+        System.err.println("        First sets   "
+            + timestr(first_end-nullability_end, total_time));
+      if (machine_end != 0 && first_end != 0)
+        System.err.println("        State build  "
+	    + timestr(machine_end-first_end, total_time));
+      if (table_end != 0 && machine_end != 0)
+        System.err.println("        Table build  "
+	    + timestr(table_end-machine_end, total_time));
+      if (reduce_check_end != 0 && table_end != 0)
+        System.err.println("        Checking     "
+	    + timestr(reduce_check_end-table_end, total_time));
+      if (emit_end != 0 && build_end != 0)
+        System.err.println("      Code Output    "
+	    + timestr(emit_end-build_end, total_time));
+      if (emit.symbols_time != 0)
+	System.err.println("        Symbols      "
+	    + timestr(emit.symbols_time, total_time));
+      if (emit.parser_time != 0)
+	System.err.println("        Parser class "
+	    + timestr(emit.parser_time, total_time));
+      if (emit.action_code_time != 0)
+	System.err.println("          Actions    "
+	    + timestr(emit.action_code_time, total_time));
+      if (emit.production_table_time != 0)
+	System.err.println("          Prod table "
+	    + timestr(emit.production_table_time, total_time));
+      if (emit.action_table_time != 0)
+	System.err.println("          Action tab "
+	    + timestr(emit.action_table_time, total_time));
+      if (emit.goto_table_time != 0)
+	System.err.println("          Reduce tab "
+	    + timestr(emit.goto_table_time, total_time));
+
+      System.err.println("      Dump Output    "
+	+ timestr(dump_end-emit_end, total_time));
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Helper routine to format a decimal based display of seconds and
+   *  percentage of total time given counts of milliseconds.   Note: this
+   *  is broken for use with some instances of negative time (since we don't
+   *  use any negative time here, we let if be for now).
+   * @param time_val   the value being formatted (in ms).
+   * @param total_time total time percentages are calculated against (in ms).
+   */
+  protected static String timestr(long time_val, long total_time)
+    {
+      boolean neg;
+      long    ms = 0;
+      long    sec = 0;
+      long    percent10;
+      String  pad;
+
+      /* work with positives only */
+      neg = time_val < 0;
+      if (neg) time_val = -time_val;
+
+      /* pull out seconds and ms */
+      ms = time_val % 1000;
+      sec = time_val / 1000;
+
+      /* construct a pad to blank fill seconds out to 4 places */
+      if (sec < 10)
+	pad = "   ";
+      else if (sec < 100)
+	pad = "  ";
+      else if (sec < 1000)
+	pad = " ";
+      else
+	pad = "";
+
+      /* calculate 10 times the percentage of total */
+      percent10 = (time_val*1000)/total_time;
+
+      /* build and return the output string */
+      return (neg ? "-" : "") + pad + sec + "." +
+	     ((ms%1000)/100) + ((ms%100)/10) + (ms%10) + "sec" +
+	     " (" + percent10/10 + "." + percent10%10 + "%)";
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce a human readable dump of the grammar. */
+  public static void dump_grammar() throws internal_error
+    {
+      int cnt;
+      Enumeration t, n, p;
+      production prod;
+
+      System.err.println("===== Terminals =====");
+      for (t = terminal.all(), cnt=0; t.hasMoreElements(); cnt++)
+	{
+	  System.err.print(((terminal)t.nextElement()).name() + " ");
+	  if ((cnt+1) % 5 == 0) System.err.println();
+	}
+      System.err.println();
+      System.err.println();
+
+      System.err.println("===== Non terminals =====");
+      for (n=non_terminal.all(), cnt=0; n.hasMoreElements(); cnt++)
+	{
+	  System.err.print(((non_terminal)n.nextElement()).name() + " ");
+	  if ((cnt+1) % 5 == 0) System.err.println();
+	}
+      System.err.println();
+      System.err.println();
+
+
+      System.err.println("===== Productions =====");
+      for (p=production.all(); p.hasMoreElements(); )
+	{
+	  prod = (production)p.nextElement();
+	  System.err.print(prod.lhs().the_symbol().name() + " ::= ");
+	  for (int i=0; i<prod.rhs_length(); i++)
+	    if (prod.rhs(i).is_action())
+	      System.err.print("{action} ");
+	    else
+	      System.err.print(
+			 ((symbol_part)prod.rhs(i)).the_symbol().name() + " ");
+	  System.err.println();
+	}
+      System.err.println();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce a (semi-) human readable dump of the complete viable prefix
+   *  recognition state machine.
+   */
+  public static void dump_machine()
+    {
+      lalr_state ordered[] = new lalr_state[lalr_state.number()];
+
+      /* put the states in sorted order for a nicer display */
+      for (Enumeration s = lalr_state.all(); s.hasMoreElements(); )
+	{
+	  lalr_state st = (lalr_state)s.nextElement();
+	  ordered[st.index()] = st;
+	}
+
+      System.err.println("===== Viable Prefix Recognizer =====");
+      for (int i = 0; i<lalr_state.number(); i++)
+	{
+	  if (ordered[i] == start_state) System.err.print("START ");
+          System.err.println(ordered[i]);
+	  System.err.println("-------------------");
+	}
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce a (semi-) human readable dumps of the parse tables */
+  public static void dump_tables()
+    {
+      System.err.println(action_table);
+      System.err.println(reduce_table);
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
+
diff --git a/jasmin/jasmin-2.4/src/java_cup/action_part.java b/jasmin/jasmin-2.4/src/java_cup/action_part.java
new file mode 100644
index 0000000..ea04392
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/action_part.java
@@ -0,0 +1,93 @@
+
+package java_cup;
+
+/** 
+ * This class represents a part of a production which contains an
+ * action.  These are eventually eliminated from productions and converted
+ * to trailing actions by factoring out with a production that derives the
+ * empty string (and ends with this action).
+ *
+ * @see java_cup.production
+ * @version last update: 11/25/95
+ * @author Scott Hudson
+ */
+
+public class action_part extends production_part {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructors ------------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Simple constructor. 
+   * @param code_str string containing the actual user code.
+   */
+  public action_part(String code_str)
+    {
+      super(/* never have a label on code */null);
+      _code_string = code_str;
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** String containing code for the action in question. */
+  protected String _code_string;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** String containing code for the action in question. */
+  public String code_string() {return _code_string;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Set the code string. */
+  public void set_code_string(String new_str) {_code_string = new_str;}
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Override to report this object as an action. */
+  public boolean is_action() { return true; }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality comparison for properly typed object. */
+  public boolean equals(action_part other)
+    {
+      /* compare the strings */
+      return other != null && super.equals(other) && 
+	     other.code_string().equals(code_string());
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality comparison. */
+  public boolean equals(Object other)
+    {
+      if (!(other instanceof action_part)) 
+	return false;
+      else
+	return equals((action_part)other);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce a hash code. */
+  public int hashCode()
+    {
+      return super.hashCode() ^ 
+	     (code_string()==null ? 0 : code_string().hashCode());
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to a string.  */
+  public String toString()
+    {
+      return super.toString() + "{" + code_string() + "}";
+    }
+
+  /*-----------------------------------------------------------*/
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/action_production.java b/jasmin/jasmin-2.4/src/java_cup/action_production.java
new file mode 100644
index 0000000..a864e65
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/action_production.java
@@ -0,0 +1,39 @@
+
+package java_cup;
+
+/** A specialized version of a production used when we split an existing
+ *  production in order to remove an embedded action.  Here we keep a bit 
+ *  of extra bookkeeping so that we know where we came from.
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+
+public class action_production extends production {
+
+  /** Constructor.
+   * @param base       the production we are being factored out of.
+   * @param lhs_sym    the LHS symbol for this production.
+   * @param rhs_parts  array of production parts for the RHS.
+   * @param rhs_len    how much of the rhs_parts array is valid.
+   * @param action_str the trailing reduce action for this production.
+   */ 
+  public action_production(
+    production      base,
+    non_terminal    lhs_sym, 
+    production_part rhs_parts[],
+    int             rhs_len,
+    String          action_str)
+    throws internal_error
+    {
+      super(lhs_sym, rhs_parts, rhs_len, action_str);
+      _base_production = base;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The production we were taken out of. */
+  protected production _base_production;
+
+  /** The production we were taken out of. */
+  public production base_production() {return _base_production;}
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/emit.java b/jasmin/jasmin-2.4/src/java_cup/emit.java
new file mode 100644
index 0000000..7e036a8
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/emit.java
@@ -0,0 +1,755 @@
+
+package java_cup;
+
+import java.io.PrintStream;
+import java.util.Stack;
+import java.util.Enumeration;
+import java.util.Date;
+
+/**
+ * This class handles emitting generated code for the resulting parser.
+ * The various parse tables must be constructed, etc. before calling any
+ * routines in this class.<p>
+ *
+ * Three classes are produced by this code:
+ *   <dl>
+ *   <dt> symbol constant class
+ *   <dd>   this contains constant declarations for each terminal (and
+ *          optionally each non-terminal).
+ *   <dt> action class
+ *   <dd>   this non-public class contains code to invoke all the user actions
+ *          that were embedded in the parser specification.
+ *   <dt> parser class
+ *   <dd>   the specialized parser class consisting primarily of some user
+ *          supplied general and initialization code, and the parse tables.
+ *   </dl><p>
+ *
+ *  Three parse tables are created as part of the parser class:
+ *    <dl>
+ *    <dt> production table
+ *    <dd>   lists the LHS non terminal number, and the length of the RHS of
+ *           each production.
+ *    <dt> action table
+ *    <dd>   for each state of the parse machine, gives the action to be taken
+ *           (shift, reduce, or error) under each lookahead symbol.<br>
+ *    <dt> reduce-goto table
+ *    <dd>   when a reduce on a given production is taken, the parse stack is
+ *           popped back a number of elements corresponding to the RHS of the
+ *           production.  This reveals a prior state, which we transition out
+ *           of under the LHS non terminal symbol for the production (as if we
+ *           had seen the LHS symbol rather than all the symbols matching the
+ *           RHS).  This table is indexed by non terminal numbers and indicates
+ *           how to make these transitions.
+ *    </dl><p>
+ *
+ * In addition to the method interface, this class maintains a series of
+ * public global variables and flags indicating how misc. parts of the code
+ * and other output is to be produced, and counting things such as number of
+ * conflicts detected (see the source code and public variables below for
+ * more details).<p>
+ *
+ * This class is "static" (contains only static data and methods).<p>
+ *
+ * @see java_cup.main
+ * @version last update: 11/25/95
+ * @author Scott Hudson
+ */
+
+/* Major externally callable routines here include:
+     symbols               - emit the symbol constant class
+     parser                - emit the parser class
+
+   In addition the following major internal routines are provided:
+     emit_package          - emit a package declaration
+     emit_action_code      - emit the class containing the user's actions
+     emit_production_table - emit declaration and init for the production table
+     do_action_table       - emit declaration and init for the action table
+     do_reduce_table       - emit declaration and init for the reduce-goto table
+
+   Finally, this class uses a number of public instance variables to communicate
+   optional parameters and flags used to control how code is generated,
+   as well as to report counts of various things (such as number of conflicts
+   detected).  These include:
+
+   prefix                  - a prefix string used to prefix names that would
+			     otherwise "pollute" someone else's name space.
+   package_name            - name of the package emitted code is placed in
+			     (or null for an unnamed package.
+   symbol_const_class_name - name of the class containing symbol constants.
+   parser_class_name       - name of the class for the resulting parser.
+   action_code             - user supplied declarations and other code to be
+			     placed in action class.
+   parser_code             - user supplied declarations and other code to be
+			     placed in parser class.
+   init_code               - user supplied code to be executed as the parser
+			     is being initialized.
+   scan_code               - user supplied code to get the next token.
+   start_production        - the start production for the grammar.
+   import_list             - list of imports for use with action class.
+   num_conflicts           - number of conflicts detected.
+   nowarn                  - true if we are not to issue warning messages.
+   not_reduced             - count of number of productions that never reduce.
+   unused_term             - count of unused terminal symbols.
+   unused_non_term         - count of unused non terminal symbols.
+   *_time                  - a series of symbols indicating how long various
+			     sub-parts of code generation took (used to produce
+			     optional time reports in main).
+*/
+
+public class emit {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Only constructor is private so no instances can be created. */
+  private emit() { }
+
+  /*-----------------------------------------------------------*/
+  /*--- Static (Class) Variables ------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  public static String input_file_name;
+
+  /** The prefix placed on names that pollute someone else's name space. */
+  public static String prefix = "CUP$";
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Package that the resulting code goes into (null is used for unnamed). */
+  public static String package_name = null;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Name of the generated class for symbol constants. */
+  public static String symbol_const_class_name = "sym";
+
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Name of the generated parser class. */
+  public static String parser_class_name = "parser";
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** User declarations for direct inclusion in user action class. */
+  public static String action_code = null;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** User declarations for direct inclusion in parser class. */
+  public static String parser_code = null;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** User code for user_init() which is called during parser initialization. */
+  public static String init_code = null;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** User code for scan() which is called to get the next token. */
+  public static String scan_code = null;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The start production of the grammar. */
+  public static production start_production = null;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** List of imports (Strings containing class names) to go with actions. */
+  public static Stack import_list = new Stack();
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Number of conflict found while building tables. */
+  public static int num_conflicts = 0;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Do we skip warnings? */
+  public static boolean nowarn = false;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Count of the number on non-reduced productions found. */
+  public static int not_reduced = 0;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Count of unused terminals. */
+  public static int unused_term = 0;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Count of unused non terminals. */
+  public static int unused_non_term = 0;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /* Timing values used to produce timing report in main.*/
+
+  /** Time to produce symbol constant class. */
+  public static long symbols_time          = 0;
+
+  /** Time to produce parser class. */
+  public static long parser_time           = 0;
+
+  /** Time to produce action code class. */
+  public static long action_code_time      = 0;
+
+  /** Time to produce the production table. */
+  public static long production_table_time = 0;
+
+  /** Time to produce the action table. */
+  public static long action_table_time     = 0;
+
+  /** Time to produce the reduce-goto table. */
+  public static long goto_table_time       = 0;
+
+  /** Do we produce calls debug_gammar in generated parser? */
+  public static String debug_grammar = null;
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Build a string with the standard prefix.
+   * @param str string to prefix.
+   */
+  protected static String pre(String str) {return prefix + str;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Emit a package spec if the user wants one.
+   * @param out stream to produce output on.
+   */
+  protected static void emit_package(PrintStream out)
+    {
+      /* generate a package spec if we have a name for one */
+      if (package_name != null)
+	out.println("package " + package_name + ";\n");
+
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Emit code for the symbol constant class, optionally including non terms,
+   *  if they have been requested.
+   * @param out            stream to produce output on.
+   * @param emit_non_terms do we emit constants for non terminals?
+   */
+  public static void symbols(PrintStream out, boolean emit_non_terms)
+    {
+      terminal term;
+      non_terminal nt;
+
+      long start_time = System.currentTimeMillis();
+
+      /* top of file */
+      out.println();
+      out.println("//----------------------------------------------------");
+      out.println("// The following code was generated by " +
+							   version.title_str);
+      out.println("// " + new Date());
+      out.println("//----------------------------------------------------");
+      out.println();
+      emit_package(out);
+
+      /* class header */
+      out.println(
+	    "/** JavaCup generated class containing symbol constants. */");
+      out.println("public class " + symbol_const_class_name + " {");
+
+      out.println("  /* terminals */");
+
+      /* walk over the terminals */              /* later might sort these */
+      for (Enumeration e = terminal.all(); e.hasMoreElements(); )
+	{
+	  term = (terminal)e.nextElement();
+
+	  /* output a constant decl for the terminal */
+	  out.println("  static final int " + term.name() + " = " +
+		      term.index() + ";");
+	}
+
+      /* do the non terminals if they want them (parser doesn't need them) */
+      if (emit_non_terms)
+	{
+          out.println("\n  /* non terminals */");
+
+          /* walk over the non terminals */       /* later might sort these */
+          for (Enumeration e = non_terminal.all(); e.hasMoreElements(); )
+	    {
+	      nt = (non_terminal)e.nextElement();
+
+	      /* output a constant decl for the terminal */
+	      out.println("  static final int " + nt.name() + " = " +
+		          nt.index() + ";");
+	    }
+	}
+
+      /* end of class */
+      out.println("};\n");
+
+      symbols_time = System.currentTimeMillis() - start_time;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Emit code for the non-public class holding the actual action code.
+   * @param out        stream to produce output on.
+   * @param start_prod the start production of the grammar.
+   */
+  protected static void emit_action_code(PrintStream out, production start_prod)
+    throws internal_error
+    {
+      production prod;
+
+      long start_time = System.currentTimeMillis();
+
+      /* class header */
+      out.println();
+      out.println(
+       "/** JavaCup generated class to encapsulate user supplied action code.*/"
+      );
+      out.println("class " +  pre("actions") + " {");
+
+      /* user supplied code */
+      if (action_code != null)
+	{
+	  out.println();
+          out.println(action_code);
+	}
+
+      /* constructor */
+      out.println();
+      out.println("  /** Constructor */");
+      out.println("  " + pre("actions") + "() { }");
+
+      /* action method head */
+      out.println();
+      out.println("  /** Method with the actual generated action code. */");
+      out.println("  public final java_cup.runtime.symbol " +
+		     pre("do_action") + "(");
+      out.println("    int                        " + pre("act_num,"));
+      out.println("    java_cup.runtime.lr_parser " + pre("parser,"));
+      out.println("    java.util.Stack            " + pre("stack,"));
+      out.println("    int                        " + pre("top)"));
+      out.println("    throws java.lang.Exception");
+      out.println("    {");
+
+      /* declaration of result symbol */
+      out.println("      /* object for return from actions */");
+      out.println("      java_cup.runtime.symbol " + pre("result") + ";");
+      out.println();
+
+      /* switch top */
+      out.println("      /* select the action based on the action number */");
+      out.println("      switch (" + pre("act_num") + ")");
+      out.println("        {");
+
+      /* emit action code for each production as a separate case */
+      for (Enumeration p = production.all(); p.hasMoreElements(); )
+	{
+	  prod = (production)p.nextElement();
+
+	  /* case label */
+          out.println("          /*. . . . . . . . . . . . . . . . . . . .*/");
+          out.println("          case " + prod.index() + ": // " +
+					  prod.to_simple_string());
+
+	  /* give them their own block to work in */
+	  out.println("            {");
+
+          /* user supplied code for debug_grammar() */
+          if (debug_grammar != null)
+            out.println("             " +debug_grammar+ "(\"" +
+                        prod.to_simple_string() + "\");");
+
+	  /* create the result symbol */
+	  out.println("              " + pre("result") + " = new " +
+	    prod.lhs().the_symbol().stack_type() + "(/*" +
+	    prod.lhs().the_symbol().name() + "*/" +
+	    prod.lhs().the_symbol().index() + ");");
+
+	  /* if there is an action string, emit it */
+	  if (prod.action() != null && prod.action().code_string() != null &&
+	      !prod.action().equals(""))
+	    out.println("              " + prod.action().code_string());
+
+	  /* end of their block */
+	  out.println("            }");
+
+	  /* if this was the start production, do action for accept */
+	  if (prod == start_prod)
+	    {
+	      out.println("          /* ACCEPT */");
+	      out.println("          " + pre("parser") + ".done_parsing();");
+	    }
+
+	  /* code to return lhs symbol */
+	  out.println("          return " + pre("result") + ";");
+	  out.println();
+	}
+
+      /* end of switch */
+      out.println("          /* . . . . . .*/");
+      out.println("          default:");
+      out.println("            throw new Exception(");
+      out.println("               \"Invalid action number found in " +
+				  "internal parse table\");");
+      out.println();
+      out.println("        }");
+
+      /* end of method */
+      out.println("    }");
+
+      /* end of class */
+      out.println("};\n");
+
+      action_code_time = System.currentTimeMillis() - start_time;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Emit the production table.
+   * @param out stream to produce output on.
+   */
+  protected static void emit_production_table(PrintStream out)
+    {
+      production all_prods[];
+      production prod;
+
+      long start_time = System.currentTimeMillis();
+
+      /* do the top of the table */
+      out.println();
+      out.println("  /** production table */");
+      out.println("  protected static final short _production_table[][] = {");
+
+      /* collect up the productions in order */
+      all_prods = new production[production.number()];
+      for (Enumeration p = production.all(); p.hasMoreElements(); )
+	{
+	  prod = (production)p.nextElement();
+	  all_prods[prod.index()] = prod;
+	}
+
+      /* do one entry per production */
+      out.print("    ");
+      for (int i = 0; i<production.number(); i++)
+	{
+	  prod = all_prods[i];
+
+	  /* make the table entry */
+	  out.print("    {");
+	  out.print(/* lhs symbol # */ prod.lhs().the_symbol().index() + ", ");
+	  out.print(/* rhs size */     prod.rhs_length() + "}");
+
+	  /* put in a comma if we aren't at the end */
+	  if (i < production.number()-1) out.print(", ");
+
+	  /* 5 entries per line */
+	  if ((i+1) % 5 == 0)
+	    {
+	      out.println();
+	      out.print("    ");
+	    }
+	}
+
+      /* finish off the table initializer */
+      out.println("  };");
+
+      /* do the public accessor method */
+      out.println();
+      out.println("  /** access to production table */");
+      out.println("  public short[][] production_table() " +
+						 "{return _production_table;}");
+
+      production_table_time = System.currentTimeMillis() - start_time;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Emit the action table.
+   * @param out             stream to produce output on.
+   * @param act_tab         the internal representation of the action table.
+   * @param compact_reduces do we use the most frequent reduce as default?
+   */
+  protected static void do_action_table(
+    PrintStream        out,
+    parse_action_table act_tab,
+    boolean            compact_reduces)
+    throws internal_error
+    {
+      parse_action_row row;
+      parse_action     act;
+      int              red;
+
+      long start_time = System.currentTimeMillis();
+
+      out.println();
+      out.println("  /** parse action table */");
+      out.println("  protected static final short[][] _action_table = {");
+
+      /* do each state (row) of the action table */
+      for (int i = 0; i < act_tab.num_states(); i++)
+	{
+	  /* get the row */
+	  row = act_tab.under_state[i];
+
+	  /* determine the default for the row */
+	  if (compact_reduces)
+	    row.compute_default();
+	  else
+	    row.default_reduce = -1;
+
+	  out.print("    /*" + i + "*/{");
+
+	  /* do each column */
+	  for (int j = 0; j < row.size(); j++)
+	    {
+	      /* extract the action from the table */
+	      act = row.under_term[j];
+
+	      /* skip error entries these are all defaulted out */
+	      if (act.kind() != parse_action.ERROR)
+		{
+		  /* first put in the symbol index, then the actual entry */
+
+		  /* shifts get positive entries of state number + 1 */
+		  if (act.kind() == parse_action.SHIFT)
+		    {
+		    out.print(j + "," +
+			    (((shift_action)act).shift_to().index() + 1) + ",");
+		    }
+
+		  /* reduce actions get negated entries of production# + 1 */
+		  else if (act.kind() == parse_action.REDUCE)
+		    {
+		      /* if its the default entry let it get defaulted out */
+		      red = ((reduce_action)act).reduce_with().index();
+		      if (red != row.default_reduce)
+		        out.print(j + "," + (-(red+1)) + ",");
+		    }
+
+		  /* shouldn't be anything else */
+		  else
+		    throw new internal_error("Unrecognized action code " +
+		      act.kind() + " found in parse table");
+		}
+	    }
+
+	  /* finish off the row with a default entry */
+	  if (row.default_reduce != -1)
+	    out.println("-1," + (-(row.default_reduce+1)) + "},");
+	  else
+	    out.println("-1,0},");
+	}
+
+      /* finish off the init of the table */
+      out.println("  };");
+
+      /* do the public accessor method */
+      out.println();
+      out.println("  /** access to parse action table */");
+      out.println("  public short[][] action_table() {return _action_table;}");
+
+      action_table_time = System.currentTimeMillis() - start_time;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Emit the reduce-goto table.
+   * @param out     stream to produce output on.
+   * @param red_tab the internal representation of the reduce-goto table.
+   */
+  protected static void do_reduce_table(
+    PrintStream out,
+    parse_reduce_table red_tab)
+    {
+      lalr_state       goto_st;
+      parse_action     act;
+
+      long start_time = System.currentTimeMillis();
+
+      out.println();
+      out.println("  /** reduce_goto table */");
+      out.println("  protected static final short[][] _reduce_table = {");
+
+      /* do each row of the reduce-goto table */
+      for (int i=0; i<red_tab.num_states(); i++)
+	{
+	  out.print("    /*" + i + "*/{");
+
+	  /* do each entry in the row */
+	  for (int j=0; j<red_tab.under_state[i].size(); j++)
+	    {
+	      /* get the entry */
+	      goto_st = red_tab.under_state[i].under_non_term[j];
+
+	      /* if we have none, skip it */
+	      if (goto_st != null)
+		{
+		  /* make entries for the index and the value */
+		  out.print(j + "," + goto_st.index() + ",");
+		}
+	    }
+
+	  /* end row with default value */
+	  out.println("-1,-1},");
+	}
+
+      /* finish off the init of the table */
+      out.println("  };");
+
+      /* do the public accessor method */
+      out.println();
+      out.println("  /** access to reduce_goto table */");
+      out.println("  public short[][] reduce_table() {return _reduce_table;}");
+      out.println();
+
+      goto_table_time = System.currentTimeMillis() - start_time;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Emit the parser subclass with embedded tables.
+   * @param out             stream to produce output on.
+   * @param action_table    internal representation of the action table.
+   * @param reduce_table    internal representation of the reduce-goto table.
+   * @param start_st        start state of the parse machine.
+   * @param start_prod      start production of the grammar.
+   * @param compact_reduces do we use most frequent reduce as default?
+   */
+  public static void parser(
+    PrintStream        out,
+    parse_action_table action_table,
+    parse_reduce_table reduce_table,
+    int                start_st,
+    production         start_prod,
+    boolean            compact_reduces)
+    throws internal_error
+    {
+      long start_time = System.currentTimeMillis();
+
+      /* top of file */
+      out.println();
+      out.println("//----------------------------------------------------");
+      out.println("// The following code was generated by " +
+							version.title_str);
+      out.println("// " + new Date());
+      out.println("//----------------------------------------------------");
+      out.println();
+      emit_package(out);
+
+      /* user supplied imports */
+      for (int i = 0; i < import_list.size(); i++)
+	out.println("import " + import_list.elementAt(i) + ";");
+
+      /* class header */
+      out.println();
+      out.println("public class " + parser_class_name +
+		  " extends java_cup.runtime.lr_parser {");
+
+      /* constructor */
+      out.println();
+      out.println("  /** constructor */");
+      out.println("  public " + parser_class_name + "() {super();}");
+
+      /* emit the various tables */
+      emit_production_table(out);
+      do_action_table(out, action_table, compact_reduces);
+      do_reduce_table(out, reduce_table);
+
+      /* instance of the action encapsulation class */
+      out.println("  /** instance of action encapsulation class */");
+      out.println("  protected " + pre("actions") + " action_obj;");
+      out.println();
+
+      /* action object initializer */
+      out.println("  /** action encapsulation object initializer */");
+      out.println("  protected void init_actions()");
+      out.println("    {");
+      out.println("      action_obj = new " + pre("actions") + "();");
+      out.println("    }");
+      out.println();
+
+      /* access to action code */
+      out.println("  /** invoke a user supplied parse action */");
+      out.println("  public java_cup.runtime.symbol do_action(");
+      out.println("    int                        act_num,");
+      out.println("    java_cup.runtime.lr_parser parser,");
+      out.println("    java.util.Stack            stack,");
+      out.println("    int                        top)");
+      out.println("    throws java.lang.Exception");
+      out.println("  {");
+      out.println("    /* call code in generated class */");
+      out.println("    return action_obj." + pre("do_action(") +
+                  "act_num, parser, stack, top);");
+      out.println("  }");
+      out.println("");
+
+
+      /* method to tell the parser about the start state */
+      out.println("  /** start state */");
+      out.println("  public int start_state() {return " + start_st + ";}");
+
+      /* method to indicate start production */
+      out.println("  /** start production */");
+      out.println("  public int start_production() {return " +
+		     start_production.index() + ";}");
+      out.println();
+
+      /* methods to indicate EOF and error symbol indexes */
+      out.println("  /** EOF symbol index */");
+      out.println("  public int EOF_sym() {return " + terminal.EOF.index() +
+					  ";}");
+      out.println();
+      out.println("  /** error symbol index */");
+      out.println("  public int error_sym() {return " + terminal.error.index() +
+					  ";}");
+      out.println();
+
+      /* user supplied code for user_init() */
+      if (init_code != null)
+	{
+          out.println();
+	  out.println("  /** user initialization */");
+	  out.println("  public void user_init() throws java.lang.Exception");
+	  out.println("    {");
+	  out.println(init_code);
+	  out.println("    }");
+	}
+
+      /* user supplied code for scan */
+      if (scan_code != null)
+	{
+          out.println();
+	  out.println("  /** scan to get the next token */");
+	  out.println("  public java_cup.runtime.token scan()");
+	  out.println("    throws java.lang.Exception");
+	  out.println("    {");
+	  out.println(scan_code);
+	  out.println("    }");
+	}
+
+      /* user supplied code */
+      if (parser_code != null)
+	{
+	  out.println();
+          out.println(parser_code);
+	}
+
+      /* end of class */
+      out.println("};");
+
+      /* put out the action code class */
+      emit_action_code(out, start_prod);
+
+      parser_time = System.currentTimeMillis() - start_time;
+    }
+
+    /*-----------------------------------------------------------*/
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/internal_error.java b/jasmin/jasmin-2.4/src/java_cup/internal_error.java
new file mode 100644
index 0000000..9f59248
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/internal_error.java
@@ -0,0 +1,22 @@
+
+package java_cup;
+
+/** Exception subclass for reporting internal errors in JavaCup. */
+public class internal_error extends Exception
+  {
+    /** Constructor with a message */
+    public internal_error(String msg)
+      {
+	super(msg);
+      }
+
+    /** Method called to do a forced error exit on an internal error
+	for cases when we can't actually throw the exception.  */
+    public void crash()
+      {
+	System.err.println("JavaCUP Fatal Internal Error Detected");
+	System.err.println(getMessage());
+	printStackTrace();
+	System.exit(-1);
+      }
+  };
diff --git a/jasmin/jasmin-2.4/src/java_cup/lalr_item.java b/jasmin/jasmin-2.4/src/java_cup/lalr_item.java
new file mode 100644
index 0000000..c04afca
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/lalr_item.java
@@ -0,0 +1,330 @@
+package java_cup;
+
+import java.util.Stack;
+import java.util.Enumeration;
+
+/** This class represents an LALR item. Each LALR item consists of 
+ *  a production, a "dot" at a position within that production, and
+ *  a set of lookahead symbols (terminal).  (The first two of these parts
+ *  are provide by the super class).  An item is designed to represent a 
+ *  configuration that the parser may be in.  For example, an item of the 
+ *  form: <pre>
+ *    [A ::= B * C d E  , {a,b,c}]
+ *  </pre>
+ *  indicates that the parser is in the middle of parsing the production <pre>
+ *    A ::= B C d E
+ *  </pre>
+ *  that B has already been parsed, and that we will expect to see a lookahead 
+ *  of either a, b, or c once the complete RHS of this production has been 
+ *  found.<p>
+ *
+ *  Items may initially be missing some items from their lookahead sets.  
+ *  Links are maintained from each item to the set of items that would need 
+ *  to be updated if symbols are added to its lookahead set.  During 
+ *  "lookahead propagation", we add symbols to various lookahead sets and 
+ *  propagate these changes across these dependency links as needed. 
+ *  
+ * @see     java_cup.lalr_item_set
+ * @see     java_cup.lalr_state
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public class lalr_item extends lr_item_core {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Full constructor. 
+   * @param prod the production for the item.
+   * @param pos  the position of the "dot" within the production.
+   * @param look the set of lookahead symbols.
+   */
+  public lalr_item(production prod, int pos, terminal_set look) 
+    throws internal_error
+    {
+      super(prod, pos);
+      _lookahead = look;
+      _propagate_items = new Stack();
+      needs_propagation = true;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constructor with default position (dot at start). 
+   * @param prod the production for the item.
+   * @param look the set of lookahead symbols.
+   */
+  public lalr_item(production prod, terminal_set look) throws internal_error
+    {
+      this(prod,0,look);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constructor with default position and empty lookahead set. 
+   * @param prod the production for the item.
+   */
+  public lalr_item(production prod) throws internal_error
+    {
+      this(prod,0,new terminal_set());
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** The lookahead symbols of the item. */
+  protected terminal_set _lookahead;
+
+  /** The lookahead symbols of the item. */
+  public terminal_set lookahead() {return _lookahead;};
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Links to items that the lookahead needs to be propagated to. */
+  protected Stack _propagate_items; 
+
+  /** Links to items that the lookahead needs to be propagated to */
+  public Stack propagate_items() {return _propagate_items;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Flag to indicate that this item needs to propagate its lookahead 
+   *  (whether it has changed or not). 
+   */
+  protected boolean needs_propagation;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Add a new item to the set of items we propagate to. */
+  public void add_propagate(lalr_item prop_to)
+    {
+      _propagate_items.push(prop_to);
+      needs_propagation = true;
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Propagate incoming lookaheads through this item to others need to 
+   *  be changed.
+   * @params incoming symbols to potentially be added to lookahead of this item.
+   */
+  public void propagate_lookaheads(terminal_set incoming) throws internal_error
+    {
+      boolean change = false;
+
+      /* if we don't need to propagate, then bail out now */
+      if (!needs_propagation && (incoming == null || incoming.empty()))
+	return;
+
+      /* if we have null incoming, treat as an empty set */
+      if (incoming != null)
+	{
+	  /* add the incoming to the lookahead of this item */
+	  change = lookahead().add(incoming);
+	}
+
+      /* if we changed or need it anyway, propagate across our links */
+      if (change || needs_propagation)
+	{
+          /* don't need to propagate again */
+          needs_propagation = false;
+
+	  /* propagate our lookahead into each item we are linked to */
+	  for (int i = 0; i < propagate_items().size(); i++)
+	    ((lalr_item)propagate_items().elementAt(i))
+					  .propagate_lookaheads(lookahead());
+	}
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce the new lalr_item that results from shifting the dot one position
+   *  to the right. 
+   */
+  public lalr_item shift() throws internal_error
+    {
+      lalr_item result;
+
+      /* can't shift if we have dot already at the end */
+      if (dot_at_end())
+	throw new internal_error("Attempt to shift past end of an lalr_item");
+
+      /* create the new item w/ the dot shifted by one */
+      result = new lalr_item(the_production(), dot_pos()+1, 
+					    new terminal_set(lookahead()));
+
+      /* change in our lookahead needs to be propagated to this item */
+      add_propagate(result);
+
+      return result;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Calculate lookahead representing symbols that could appear after the
+   *   symbol that the dot is currently in front of.  Note: this routine must
+   *   not be invoked before first sets and nullability has been calculated
+   *   for all non terminals. 
+   */ 
+  public terminal_set calc_lookahead(terminal_set lookahead_after) 
+    throws internal_error
+    {
+      terminal_set    result;
+      int             pos;
+      production_part part;
+      symbol          sym;
+
+      /* sanity check */
+      if (dot_at_end())
+	throw new internal_error(
+	  "Attempt to calculate a lookahead set with a completed item");
+
+      /* start with an empty result */
+      result = new terminal_set();
+
+      /* consider all nullable symbols after the one to the right of the dot */
+      for (pos = dot_pos()+1; pos < the_production().rhs_length(); pos++) 
+	{
+	   part = the_production().rhs(pos);
+
+	   /* consider what kind of production part it is -- skip actions */ 
+	   if (!part.is_action())
+	     {
+	       sym = ((symbol_part)part).the_symbol();
+
+	       /* if its a terminal add it in and we are done */
+	       if (!sym.is_non_term())
+		 {
+		   result.add((terminal)sym);
+		   return result;
+		 }
+	       else
+		 {
+		   /* otherwise add in first set of the non terminal */
+		   result.add(((non_terminal)sym).first_set());
+
+		   /* if its nullable we continue adding, if not, we are done */
+		   if (!((non_terminal)sym).nullable())
+		     return result;
+		 }
+	     }
+	}
+
+      /* if we get here everything past the dot was nullable 
+         we add in the lookahead for after the production and we are done */
+      result.add(lookahead_after);
+      return result;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if everything from the symbol one beyond the dot all the 
+   *  way to the  end of the right hand side is nullable.  This would indicate
+   *  that the lookahead of this item must be included in the lookaheads of
+   *  all items produced as a closure of this item.  Note: this routine should 
+   *  not be invoked until after first sets and nullability have been 
+   *  calculated for all non terminals. 
+   */
+  public boolean lookahead_visible() throws internal_error
+    {
+      production_part part;
+      symbol          sym;
+
+      /* if the dot is at the end, we have a problem, but the cleanest thing
+	 to do is just return true. */
+      if (dot_at_end()) return true;
+
+      /* walk down the rhs and bail if we get a non-nullable symbol */
+      for (int pos = dot_pos() + 1; pos < the_production().rhs_length(); pos++)
+	{
+	  part = the_production().rhs(pos);
+
+	  /* skip actions */
+	  if (!part.is_action())
+	    {
+	      sym = ((symbol_part)part).the_symbol();
+
+	      /* if its a terminal we fail */
+	      if (!sym.is_non_term()) return false;
+
+	      /* if its not nullable we fail */
+	      if (!((non_terminal)sym).nullable()) return false;
+	    }
+	}
+
+      /* if we get here its all nullable */
+      return true;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality comparison -- here we only require the cores to be equal since
+   *   we need to do sets of items based only on core equality (ignoring 
+   *   lookahead sets). 
+   */
+  public boolean equals(lalr_item other)
+    {
+      if (other == null) return false;
+      return super.equals(other);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality comparison. */
+  public boolean equals(Object other)
+    {
+      if (!(other instanceof lalr_item)) 
+	return false;
+      else
+	return equals((lalr_item)other);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Return a hash code -- here we only hash the core since we only test core
+   *  matching in LALR items. 
+   */
+  public int hashCode()
+    {
+      return super.hashCode();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to string. */
+  public String toString()
+    {
+      String result = "";
+
+      // additional output for debugging:
+      // result += "(" + hashCode() + ")"; 
+      result += "[";
+      result += super.toString();
+      result += ", ";
+      if (lookahead() != null)
+	{
+	  result += "{";
+	  for (int t = 0; t < terminal.number(); t++)
+	    if (lookahead().contains(t))
+	      result += terminal.find(t).name() + " ";
+	  result += "}";
+	}
+      else
+	result += "NULL LOOKAHEAD!!";
+      result += "]";
+
+      // additional output for debugging:
+      // result += " -> ";
+      // for (int i = 0; i<propagate_items().size(); i++)
+      //   result += propagate_items().elementAt(i).hashCode() + " ";
+      //
+      // if (needs_propagation) result += " NP";
+
+      return result;
+    }
+    /*-----------------------------------------------------------*/
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/lalr_item_set.java b/jasmin/jasmin-2.4/src/java_cup/lalr_item_set.java
new file mode 100644
index 0000000..ec12735
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/lalr_item_set.java
@@ -0,0 +1,366 @@
+
+package java_cup;
+
+import java.util.Hashtable;
+import java.util.Enumeration;
+
+/** This class represents a set of LALR items.  For purposes of building
+ *  these sets, items are considered unique only if they have unique cores
+ *  (i.e., ignoring differences in their lookahead sets).<p>
+ *
+ *  This class provides fairly conventional set oriented operations (union,
+ *  sub/super-set tests, etc.), as well as an LALR "closure" operation (see 
+ *  compute_closure()).
+ *
+ * @see     java_cup.lalr_item
+ * @see     java_cup.lalr_state
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+
+public class lalr_item_set {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Constructor for an empty set. */
+  public lalr_item_set() { }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constructor for cloning from another set. 
+   * @param other indicates set we should copy from.
+   */
+  public lalr_item_set(lalr_item_set other) 
+    throws internal_error
+    {
+      not_null(other);
+      _all = (Hashtable)other._all.clone();
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** A hash table to implement the set.  We store the items using themselves
+   *  as keys. 
+   */
+  protected Hashtable _all = new Hashtable(11);
+
+  /** Access to all elements of the set. */
+  public Enumeration all() {return _all.elements();}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Cached hashcode for this set. */
+  protected Integer hashcode_cache = null;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Size of the set */
+  public int size() {return _all.size();}
+
+  /*-----------------------------------------------------------*/
+  /*--- Set Operation Methods ---------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Does the set contain a particular item? 
+   * @param itm the item in question.
+   */
+  public boolean contains(lalr_item itm) {return _all.containsKey(itm);}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Return the item in the set matching a particular item (or null if not 
+   *  found) 
+   *  @param itm the item we are looking for.
+   */
+  public lalr_item find(lalr_item itm) {return (lalr_item)_all.get(itm);}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Is this set an (improper) subset of another? 
+   * @param other the other set in question.
+   */
+  public boolean is_subset_of(lalr_item_set other) throws internal_error
+    {
+      not_null(other);
+
+      /* walk down our set and make sure every element is in the other */
+      for (Enumeration e = all(); e.hasMoreElements(); )
+	if (!other.contains((lalr_item)e.nextElement()))
+	  return false;
+
+      /* they were all there */
+      return true;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Is this set an (improper) superset of another? 
+   * @param other the other set in question.
+   */
+  public boolean is_superset_of(lalr_item_set other) throws internal_error
+    {
+      not_null(other);
+      return other.is_subset_of(this);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Add a singleton item, merging lookahead sets if the item is already 
+   *  part of the set.  returns the element of the set that was added or 
+   *  merged into.
+   * @param itm the item being added.
+   */
+  public lalr_item add(lalr_item itm) throws internal_error
+    {
+      lalr_item other;
+
+      not_null(itm); 
+
+      /* see if an item with a matching core is already there */
+      other = (lalr_item)_all.get(itm);
+
+      /* if so, merge this lookahead into the original and leave it */
+      if (other != null)
+	{
+	  other.lookahead().add(itm.lookahead());
+	  return other;
+	}
+      /* otherwise we just go in the set */
+      else
+	{
+          /* invalidate cached hashcode */
+          hashcode_cache = null;
+
+          _all.put(itm,itm);
+	  return itm;
+	}
+    };
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Remove a single item if it is in the set. 
+   * @param itm the item to remove.
+   */
+  public void remove(lalr_item itm) throws internal_error
+    {
+      not_null(itm); 
+
+      /* invalidate cached hashcode */
+      hashcode_cache = null;
+
+      /* remove it from hash table implementing set */
+      _all.remove(itm);
+    };
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Add a complete set, merging lookaheads where items are already in 
+   *  the set 
+   * @param other the set to be added.
+   */
+  public void add(lalr_item_set other) throws internal_error
+    {
+      not_null(other);
+
+      /* walk down the other set and do the adds individually */
+      for (Enumeration e = other.all(); e.hasMoreElements(); )
+	add((lalr_item)e.nextElement());
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Remove (set subtract) a complete set. 
+   * @param other the set to remove.
+   */
+  public void remove(lalr_item_set other) throws internal_error
+    {
+      not_null(other);
+
+      /* walk down the other set and do the removes individually */
+      for (Enumeration e = other.all(); e.hasMoreElements(); )
+	remove((lalr_item)e.nextElement());
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Remove and return one item from the set (done in hash order). */
+  public lalr_item get_one() throws internal_error
+    {
+      Enumeration the_set;
+      lalr_item result;
+
+      the_set = all();
+      if (the_set.hasMoreElements())
+	{
+          result = (lalr_item)the_set.nextElement();
+          remove(result);
+	  return result;
+	}
+      else
+	return null;
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Helper function for null test.  Throws an interal_error exception if its
+   *  parameter is null.
+   *  @param obj the object we are testing.
+   */
+  protected void not_null(Object obj) throws internal_error
+    {
+      if (obj == null) 
+	throw new internal_error("Null object used in set operation");
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Compute the closure of the set using the LALR closure rules.  Basically
+   *  for every item of the form: <pre>
+   *    [L ::= a *N alpha, l] 
+   *  </pre>
+   *  (where N is a a non terminal and alpha is a string of symbols) make 
+   *  sure there are also items of the form:  <pre>
+   *    [N ::= *beta, first(alpha l)] 
+   *  </pre>
+   *  corresponding to each production of N.  Items with identical cores but 
+   *  differing lookahead sets are merged by creating a new item with the same 
+   *  core and the union of the lookahead sets (the LA in LALR stands for 
+   *  "lookahead merged" and this is where the merger is).  This routine 
+   *  assumes that nullability and first sets have been computed for all 
+   *  productions before it is called.
+   */
+  public void compute_closure()
+    throws internal_error
+    {
+      lalr_item_set consider;
+      lalr_item     itm, new_itm, add_itm;
+      non_terminal  nt;
+      terminal_set  new_lookaheads;
+      Enumeration   p;
+      production    prod;
+      boolean       need_prop;
+
+      /* invalidate cached hashcode */
+      hashcode_cache = null;
+
+      /* each current element needs to be considered */
+      consider = new lalr_item_set(this);
+
+      /* repeat this until there is nothing else to consider */
+      while (consider.size() > 0)
+	{
+	  /* get one item to consider */
+	  itm = consider.get_one(); 
+
+	  /* do we have a dot before a non terminal */
+	  nt = itm.dot_before_nt();
+	  if (nt != null)
+	    {
+	      /* create the lookahead set based on first after dot */
+	      new_lookaheads = itm.calc_lookahead(itm.lookahead());
+
+	      /* are we going to need to propagate our lookahead to new item */
+	      need_prop = itm.lookahead_visible();
+
+	      /* create items for each production of that non term */
+	      for (p = nt.productions(); p.hasMoreElements(); )
+		{
+		  prod = (production)p.nextElement();
+
+		  /* create new item with dot at start and that lookahead */
+		  new_itm = new lalr_item(prod,new_lookaheads);
+
+		  /* add/merge item into the set */
+		  add_itm = add(new_itm);
+
+		  /* if propagation is needed link to that item */
+		  if (need_prop)
+		    itm.add_propagate(add_itm);
+
+		  /* was this was a new item*/
+		  if (add_itm == new_itm)
+		    {
+		      /* that may need further closure, consider it also */ 
+		      consider.add(new_itm);
+		    } 
+		} 
+	    } 
+	} 
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality comparison. */
+  public boolean equals(lalr_item_set other)
+    {
+      if (other == null || other.size() != size()) return false;
+
+      /* once we know they are the same size, then improper subset does test */
+      try {
+        return is_subset_of(other);
+      } catch (internal_error e) {
+	/* can't throw error from here (because superclass doesn't) so crash */
+	e.crash();
+	return false;
+      }
+
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality comparison. */
+  public boolean equals(Object other)
+    {
+      if (!(other instanceof lalr_item_set))
+	return false;
+      else
+	return equals((lalr_item_set)other);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Return hash code. */
+  public int hashCode()
+    {
+      int result = 0;
+      Enumeration e;
+      int cnt;
+
+      /* only compute a new one if we don't have it cached */
+      if (hashcode_cache == null)
+	{
+          /* hash together codes from at most first 5 elements */
+          for (e = all(), cnt=0 ; e.hasMoreElements() && cnt<5; cnt++)
+	    result ^= ((lalr_item)e.nextElement()).hashCode();
+
+	  hashcode_cache = new Integer(result);
+	}
+
+      return hashcode_cache.intValue();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to string. */
+  public String toString()
+    {
+      StringBuffer result = new StringBuffer();
+
+      result.append("{\n");
+      for (Enumeration e=all(); e.hasMoreElements(); ) 
+ 	{
+ 	  result.append("  " + (lalr_item)e.nextElement() + "\n");
+ 	}
+       result.append("}");
+
+       return result.toString();
+    }
+    /*-----------------------------------------------------------*/
+};
+
diff --git a/jasmin/jasmin-2.4/src/java_cup/lalr_state.java b/jasmin/jasmin-2.4/src/java_cup/lalr_state.java
new file mode 100644
index 0000000..5870624
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/lalr_state.java
@@ -0,0 +1,749 @@
+
+package java_cup;
+
+import java.util.Hashtable;
+import java.util.Enumeration;
+import java.util.Stack;
+
+/** This class represents a state in the LALR viable prefix recognition machine.
+ *  A state consists of an LALR item set and a set of transitions to other 
+ *  states under terminal and non-terminal symbols.  Each state represents
+ *  a potential configuration of the parser.  If the item set of a state 
+ *  includes an item such as: <pre>
+ *    [A ::= B * C d E , {a,b,c}]
+ *  </pre> 
+ *  this indicates that when the parser is in this state it is currently 
+ *  looking for an A of the given form, has already seen the B, and would
+ *  expect to see an a, b, or c after this sequence is complete.  Note that
+ *  the parser is normally looking for several things at once (represented
+ *  by several items).  In our example above, the state would also include
+ *  items such as: <pre>
+ *    [C ::= * X e Z, {d}]
+ *    [X ::= * f, {e}]
+ *  </pre> 
+ *  to indicate that it was currently looking for a C followed by a d (which
+ *  would be reduced into a C, matching the first symbol in our production 
+ *  above), and the terminal f followed by e.<p>
+ *
+ *  At runtime, the parser uses a viable prefix recognition machine made up
+ *  of these states to parse.  The parser has two operations, shift and reduce.
+ *  In a shift, it consumes one token and makes a transition to a new state.
+ *  This corresponds to "moving the dot past" a terminal in one or more items
+ *  in the state (these new shifted items will then be found in the state at
+ *  the end of the transition).  For a reduce operation, the parser is 
+ *  signifying that it is recognizing the RHS of some production.  To do this
+ *  it first "backs up" by popping a stack of previously saved states.  It 
+ *  pops off the same number of states as are found in the RHS of the 
+ *  production.  This leaves the machine in the same state is was in when the
+ *  parser first attempted to find the RHS.  From this state it makes a 
+ *  transition based on the non-terminal on the LHS of the production.  This
+ *  corresponds to placing the parse in a configuration equivalent to having 
+ *  replaced all the symbols from the the input corresponding to the RHS with 
+ *  the symbol on the LHS.
+ *
+ * @see     java_cup.lalr_item
+ * @see     java_cup.lalr_item_set
+ * @see     java_cup.lalr_transition
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ *  
+ */
+
+public class lalr_state {
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+       
+  /** Constructor for building a state from a set of items.
+   * @param itms the set of items that makes up this state.
+   */
+  public lalr_state(lalr_item_set itms) throws internal_error
+   {
+     /* don't allow null or duplicate item sets */
+     if (itms == null)
+       throw new internal_error(
+	 "Attempt to construct an LALR state from a null item set");
+
+     if (find_state(itms) != null)
+       throw new internal_error(
+	 "Attempt to construct a duplicate LALR state");
+
+     /* assign a unique index */
+     _index = next_index++;
+
+     /* store the items */
+     _items = itms;
+
+     /* add to the global collection, keyed with its item set */
+     _all.put(_items,this);
+   }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Static (Class) Variables ------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Collection of all states. */
+  protected static Hashtable _all = new Hashtable();
+
+  /** Collection of all states. */
+  public static Enumeration all() {return _all.elements();}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Indicate total number of states there are. */
+  public static int number() {return _all.size();}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Hash table to find states by their kernels (i.e, the original, 
+   *  unclosed, set of items -- which uniquely define the state).  This table 
+   *  stores state objects using (a copy of) their kernel item sets as keys. 
+   */
+  protected static Hashtable _all_kernels = new Hashtable();
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Find and return state with a given a kernel item set (or null if not 
+   *  found).  The kernel item set is the subset of items that were used to
+   *  originally create the state.  These items are formed by "shifting the
+   *  dot" within items of other states that have a transition to this one.
+   *  The remaining elements of this state's item set are added during closure.
+   * @param itms the kernel set of the state we are looking for. 
+   */
+  public static lalr_state find_state(lalr_item_set itms)
+    {
+      if (itms == null) 
+  	return null;
+      else
+  	return (lalr_state)_all.get(itms);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Static counter for assigning unique state indexes. */
+  protected static int next_index = 0;
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** The item set for this state. */
+  protected lalr_item_set _items;
+
+  /** The item set for this state. */
+  public lalr_item_set items() {return _items;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** List of transitions out of this state. */
+  protected lalr_transition _transitions = null;
+
+  /** List of transitions out of this state. */
+  public lalr_transition transitions() {return _transitions;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Index of this state in the parse tables */
+  protected int _index;
+
+  /** Index of this state in the parse tables */
+  public int index() {return _index;}
+
+  /*-----------------------------------------------------------*/
+  /*--- Static Methods ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Helper routine for debugging -- produces a dump of the given state
+    * onto System.out.
+    */
+  protected static void dump_state(lalr_state st) throws internal_error
+    {
+      lalr_item_set itms;
+      lalr_item itm;
+      production_part part;
+
+      if (st == null) 
+	{
+	  System.out.println("NULL lalr_state");
+	  return;
+	}
+
+      System.out.println("lalr_state [" + st.index() + "] {");
+      itms = st.items();
+      for (Enumeration e = itms.all(); e.hasMoreElements(); )
+	{
+	  itm = (lalr_item)e.nextElement();
+	  System.out.print("  [");
+	  System.out.print(itm.the_production().lhs().the_symbol().name());
+	  System.out.print(" ::= ");
+	  for (int i = 0; i<itm.the_production().rhs_length(); i++)
+	    {
+	      if (i == itm.dot_pos()) System.out.print("(*) ");
+	      part = itm.the_production().rhs(i);
+	      if (part.is_action()) 
+		System.out.print("{action} ");
+	      else
+		System.out.print(((symbol_part)part).the_symbol().name() + " ");
+	    }
+	  if (itm.dot_at_end()) System.out.print("(*) ");
+	  System.out.println("]");
+	}
+      System.out.println("}");
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Propagate lookahead sets through the constructed viable prefix 
+   *  recognizer.  When the machine is constructed, each item that results
+      in the creation of another such that its lookahead is included in the
+      other's will have a propagate link set up for it.  This allows additions
+      to the lookahead of one item to be included in other items that it 
+      was used to directly or indirectly create.
+   */
+  protected static void propagate_all_lookaheads() throws internal_error
+    {
+      /* iterate across all states */
+      for (Enumeration st = all(); st.hasMoreElements(); )
+	{
+	  /* propagate lookaheads out of that state */
+	  ((lalr_state)st.nextElement()).propagate_lookaheads();
+	}
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Add a transition out of this state to another.
+   * @param on_sym the symbol the transition is under.
+   * @param to_st  the state the transition goes to.
+   */
+  public void add_transition(symbol on_sym, lalr_state to_st) 
+    throws internal_error
+    {
+      lalr_transition trans;
+
+      /* create a new transition object and put it in our list */
+      trans = new lalr_transition(on_sym, to_st, _transitions);
+      _transitions = trans;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Build an LALR viable prefix recognition machine given a start 
+   *  production.  This method operates by first building a start state
+   *  from the start production (based on a single item with the dot at
+   *  the beginning and EOF as expected lookahead).  Then for each state
+   *  it attempts to extend the machine by creating transitions out of
+   *  the state to new or existing states.  When considering extension
+   *  from a state we make a transition on each symbol that appears before
+   *  the dot in some item.  For example, if we have the items: <pre>
+   *    [A ::= a b * X c, {d,e}]
+   *    [B ::= a b * X d, {a,b}]
+   *  </pre>
+   *  in some state, then we would be making a transition under X to a new
+   *  state.  This new state would be formed by a "kernel" of items 
+   *  corresponding to moving the dot past the X.  In this case: <pre>
+   *    [A ::= a b X * c, {d,e}]
+   *    [B ::= a b X * Y, {a,b}]
+   *  </pre>
+   *  The full state would then be formed by "closing" this kernel set of 
+   *  items so that it included items that represented productions of things
+   *  the parser was now looking for.  In this case we would items 
+   *  corresponding to productions of Y, since various forms of Y are expected
+   *  next when in this state (see lalr_item_set.compute_closure() for details 
+   *  on closure). <p>
+   *
+   *  The process of building the viable prefix recognizer terminates when no
+   *  new states can be added.  However, in order to build a smaller number of
+   *  states (i.e., corresponding to LALR rather than canonical LR) the state 
+   *  building process does not maintain full loookaheads in all items.  
+   *  Consequently, after the machine is built, we go back and propagate 
+   *  lookaheads through the constructed machine using a call to 
+   *  propagate_all_lookaheads().  This makes use of propagation links 
+   *  constructed during the closure and transition process.
+   *
+   * @param start_prod the start production of the grammar
+   * @see   java_cup.lalr_item_set#compute_closure
+   * @see   java_cup.lalr_state#propagate_all_lookaheads
+   */
+
+  public static lalr_state build_machine(production start_prod) 
+    throws internal_error
+    {
+      lalr_state    start_state;
+      lalr_item_set start_items;
+      lalr_item_set new_items;
+      lalr_item_set linked_items;
+      lalr_item_set kernel;
+      Stack         work_stack = new Stack();
+      lalr_state    st, new_st;
+      symbol_set    outgoing;
+      lalr_item     itm, new_itm, existing, fix_itm;
+      symbol        sym, sym2;
+      Enumeration   i, s, fix;
+
+      /* sanity check */
+      if (start_prod == null)
+	throw new internal_error(
+ 	  "Attempt to build viable prefix recognizer using a null production");
+
+      /* build item with dot at front of start production and EOF lookahead */
+      start_items = new lalr_item_set();
+      itm = new lalr_item(start_prod);
+      itm.lookahead().add(terminal.EOF);
+      start_items.add(itm);
+
+      /* create copy the item set to form the kernel */
+      kernel = new lalr_item_set(start_items);
+
+      /* create the closure from that item set */
+      start_items.compute_closure();
+
+      /* build a state out of that item set and put it in our work set */
+      start_state = new lalr_state(start_items);
+      work_stack.push(start_state);
+
+      /* enter the state using the kernel as the key */
+      _all_kernels.put(kernel, start_state);
+
+      /* continue looking at new states until we have no more work to do */
+      while (!work_stack.empty())
+	{
+	  /* remove a state from the work set */
+	  st = (lalr_state)work_stack.pop();
+
+	  /* gather up all the symbols that appear before dots */
+	  outgoing = new symbol_set();
+	  for (i = st.items().all(); i.hasMoreElements(); )
+	    {
+	      itm = (lalr_item)i.nextElement();
+
+	      /* add the symbol before the dot (if any) to our collection */
+	      sym = itm.symbol_after_dot();
+	      if (sym != null) outgoing.add(sym);
+	    }
+
+	  /* now create a transition out for each individual symbol */
+	  for (s = outgoing.all(); s.hasMoreElements(); )
+	    {
+	      sym = (symbol)s.nextElement();
+
+	      /* will be keeping the set of items with propagate links */
+	      linked_items = new lalr_item_set();
+
+	      /* gather up shifted versions of all the items that have this
+		 symbol before the dot */
+	      new_items = new lalr_item_set();
+	      for (i = st.items().all(); i.hasMoreElements();)
+		{
+		  itm = (lalr_item)i.nextElement();
+
+		  /* if this is the symbol we are working on now, add to set */
+		  sym2 = itm.symbol_after_dot();
+		  if (sym.equals(sym2))
+		    {
+		      /* add to the kernel of the new state */
+		      new_items.add(itm.shift());
+
+		      /* remember that itm has propagate link to it */
+		      linked_items.add(itm);
+		    }
+		}
+
+	      /* use new items as state kernel */
+	      kernel = new lalr_item_set(new_items);
+
+	      /* have we seen this one already? */
+	      new_st = (lalr_state)_all_kernels.get(kernel);
+
+	      /* if we haven't, build a new state out of the item set */
+	      if (new_st == null)
+		{
+	          /* compute closure of the kernel for the full item set */
+	          new_items.compute_closure();
+
+		  /* build the new state */
+		  new_st = new lalr_state(new_items);
+
+		  /* add the new state to our work set */
+		  work_stack.push(new_st);
+
+		  /* put it in our kernel table */
+		  _all_kernels.put(kernel, new_st);
+		}
+	      /* otherwise relink propagation to items in existing state */
+	      else 
+		{
+		  /* walk through the items that have links to the new state */
+		  for (fix = linked_items.all(); fix.hasMoreElements(); )
+		    {
+		      fix_itm = (lalr_item)fix.nextElement();
+
+		      /* look at each propagate link out of that item */
+		      for (int l =0; l < fix_itm.propagate_items().size(); l++)
+			{
+			  /* pull out item linked to in the new state */
+			  new_itm = 
+			    (lalr_item)fix_itm.propagate_items().elementAt(l);
+
+			  /* find corresponding item in the existing state */
+			  existing = new_st.items().find(new_itm);
+
+			  /* fix up the item so it points to the existing set */
+			  if (existing != null)
+			    fix_itm.propagate_items().setElementAt(existing ,l);
+			}
+		    }
+		}
+
+	      /* add a transition from current state to that state */
+	      st.add_transition(sym, new_st);
+	    }
+	}
+
+      /* all done building states */
+
+      /* propagate complete lookahead sets throughout the states */
+      propagate_all_lookaheads();
+
+      return start_state;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Propagate lookahead sets out of this state. This recursively 
+   *  propagates to all items that have propagation links from some item 
+   *  in this state. 
+   */
+  protected void propagate_lookaheads() throws internal_error
+    {
+      /* recursively propagate out from each item in the state */
+      for (Enumeration itm = items().all(); itm.hasMoreElements(); )
+	((lalr_item)itm.nextElement()).propagate_lookaheads(null);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Fill in the parse table entries for this state.  There are two 
+   *  parse tables that encode the viable prefix recognition machine, an 
+   *  action table and a reduce-goto table.  The rows in each table 
+   *  correspond to states of the machine.  The columns of the action table
+   *  are indexed by terminal symbols and correspond to either transitions 
+   *  out of the state (shift entries) or reductions from the state to some
+   *  previous state saved on the stack (reduce entries).  All entries in the
+   *  action table that are not shifts or reduces, represent errors.    The
+   *  reduce-goto table is indexed by non terminals and represents transitions 
+   *  out of a state on that non-terminal.<p>
+   *  Conflicts occur if more than one action needs to go in one entry of the
+   *  action table (this cannot happen with the reduce-goto table).  Conflicts
+   *  are resolved by always shifting for shift/reduce conflicts and choosing
+   *  the lowest numbered production (hence the one that appeared first in
+   *  the specification) in reduce/reduce conflicts.  All conflicts are 
+   *  reported and if more conflicts are detected than were declared by the
+   *  user, code generation is aborted.
+   *
+   * @param act_table    the action table to put entries in.
+   * @param reduce_table the reduce-goto table to put entries in.
+   */
+  public void build_table_entries(
+    parse_action_table act_table, 
+    parse_reduce_table reduce_table)
+    throws internal_error
+    {
+      parse_action_row our_act_row;
+      parse_reduce_row our_red_row;
+      lalr_item        itm;
+      parse_action     act, other_act;
+      symbol           sym;
+      boolean          conflicted = false;
+
+      /* pull out our rows from the tables */
+      our_act_row = act_table.under_state[index()];
+      our_red_row = reduce_table.under_state[index()];
+
+      /* consider each item in our state */
+      for (Enumeration i = items().all(); i.hasMoreElements(); )
+	{
+	  itm = (lalr_item)i.nextElement();
+
+	  /* if its completed (dot at end) then reduce under the lookahead */
+	  if (itm.dot_at_end())
+	    {
+	      act = new reduce_action(itm.the_production());
+
+	      /* consider each lookahead symbol */
+	      for (int t = 0; t < terminal.number(); t++)
+		{
+		  /* skip over the ones not in the lookahead */
+		  if (!itm.lookahead().contains(t)) continue;
+
+	          /* if we don't already have an action put this one in */
+	          if (our_act_row.under_term[t].kind() == 
+		      parse_action.ERROR)
+		    {
+	              our_act_row.under_term[t] = act;
+		    }
+	          else
+		    {
+		      /* we now have at least one conflict */
+		      conflicted = true;
+
+		      other_act = our_act_row.under_term[t];
+
+		      /* if the other act was not a shift */
+		      if (other_act.kind() != parse_action.SHIFT)
+		        {
+		          /* if we have lower index hence priority, replace it*/
+		          if (itm.the_production().index() < 
+			      ((reduce_action)other_act).reduce_with().index())
+			    {
+			      /* replace the action */
+			      our_act_row.under_term[t] = act;
+			    }
+		        }
+		    }
+		}
+	    }
+	}
+
+      /* consider each outgoing transition */
+      for (lalr_transition trans=transitions(); trans!=null; trans=trans.next())
+	{
+	  /* if its on an terminal add a shift entry */
+	  sym = trans.on_symbol();
+	  if (!sym.is_non_term())
+	    {
+	      act = new shift_action(trans.to_state());
+
+	      /* if we don't already have an action put this one in */
+	      if ( our_act_row.under_term[sym.index()].kind() == 
+		   parse_action.ERROR)
+		{
+	          our_act_row.under_term[sym.index()] = act;
+		}
+	      else
+		{
+		  /* we now have at least one conflict */
+		  conflicted = true;
+
+		  /* shift always wins */
+		  our_act_row.under_term[sym.index()] = act;
+		}
+	    }
+	  else
+	    {
+	      /* for non terminals add an entry to the reduce-goto table */
+	      our_red_row.under_non_term[sym.index()] = trans.to_state();
+	    }
+	}
+
+      /* if we end up with conflict(s), report them */
+      if (conflicted)
+        report_conflicts();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce warning messages for all conflicts found in this state.  */
+  protected void report_conflicts()
+    throws internal_error
+    {
+      lalr_item    itm, compare;
+      symbol       shift_sym;
+      terminal_set conflict_set;
+      boolean      after_itm;
+
+      /* consider each element */
+      for (Enumeration itms = items().all(); itms.hasMoreElements(); )
+	{
+	  itm = (lalr_item)itms.nextElement();
+
+	  /* clear the S/R conflict set for this item */
+	  conflict_set = new terminal_set();
+
+	  /* if it results in a reduce, it could be a conflict */
+	  if (itm.dot_at_end())
+	    {
+	      /* not yet after itm */
+	      after_itm = false;
+
+	      /* compare this item against all others looking for conflicts */
+	      for (Enumeration comps = items().all(); comps.hasMoreElements(); )
+		{
+		  compare = (lalr_item)comps.nextElement();
+
+		  /* if this is the item, next one is after it */
+		  if (itm == compare) after_itm = true;
+
+		  /* only look at it if its not the same item */
+		  if (itm != compare)
+		    {
+		      /* is it a reduce */
+		      if (compare.dot_at_end())
+			{
+			  /* only look at reduces after itm */
+			  if (after_itm)
+                            /* does the comparison item conflict? */
+                            if (compare.lookahead().intersects(itm.lookahead()))
+                              /* report a reduce/reduce conflict */
+                              report_reduce_reduce(itm, compare);
+			}
+		      /* must be a shift on a terminal or non-terminal */
+		      else 
+			{
+		          /* is it a shift on a terminal */
+			  shift_sym = compare.symbol_after_dot();
+			  if (!shift_sym.is_non_term()) 
+			    {
+			      /* does the terminal conflict with our item */
+			      if (itm.lookahead().contains((terminal)shift_sym))
+			        /* remember the terminal symbol in conflict */
+			        conflict_set.add((terminal)shift_sym);
+			    }
+			}
+		    }
+		}
+	      /* report S/R conflicts under all the symbols we conflict under */
+	      for (int t = 0; t < terminal.number(); t++)
+		if (conflict_set.contains(t))
+		  report_shift_reduce(itm,t);
+	    }
+	}
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce a warning message for one reduce/reduce conflict. 
+   *
+   * @param itm1 first item in conflict.
+   * @param itm2 second item in conflict.
+   */
+  protected void report_reduce_reduce(lalr_item itm1, lalr_item itm2)
+    throws internal_error
+    {
+      boolean comma_flag = false;
+
+      System.err.println("*** Reduce/Reduce conflict found in state #"+index());
+      System.err.print  ("  between ");
+      System.err.println(itm1.to_simple_string());
+      System.err.print  ("  and     ");
+      System.err.println(itm2.to_simple_string());
+      System.err.print("  under symbols: {" );
+      for (int t = 0; t < terminal.number(); t++)
+	{
+	  if (itm1.lookahead().contains(t) && itm2.lookahead().contains(t))
+	    {
+	      if (comma_flag) System.err.print(", "); else comma_flag = true;
+	      System.err.print(terminal.find(t).name());
+	    }
+	}
+      System.err.println("}");
+      System.err.print("  Resolved in favor of ");
+      if (itm1.the_production().index() < itm2.the_production().index())
+	System.err.println("the first production.\n");
+      else
+	System.err.println("the second production.\n");
+
+      /* count the conflict */
+      emit.num_conflicts++;
+      lexer.warning_count++;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce a warning message for one shift/reduce conflict.
+   *
+   * @param red_itm      the item with the reduce.
+   * @param conflict_sym the index of the symbol conflict occurs under.
+   */
+  protected void report_shift_reduce(
+    lalr_item red_itm, 
+    int       conflict_sym)
+    throws internal_error
+    {
+      lalr_item    itm;
+      symbol       shift_sym;
+
+      /* emit top part of message including the reduce item */
+      System.err.println("*** Shift/Reduce conflict found in state #"+index());
+      System.err.print  ("  between ");
+      System.err.println(red_itm.to_simple_string());
+
+      /* find and report on all items that shift under our conflict symbol */
+      for (Enumeration itms = items().all(); itms.hasMoreElements(); )
+	{
+	  itm = (lalr_item)itms.nextElement();
+
+	  /* only look if its not the same item and not a reduce */
+	  if (itm != red_itm && !itm.dot_at_end())
+	    {
+	      /* is it a shift on our conflicting terminal */
+	      shift_sym = itm.symbol_after_dot();
+	      if (!shift_sym.is_non_term() && shift_sym.index() == conflict_sym)
+	        {
+		  /* yes, report on it */
+                  System.err.println("  and     " + itm.to_simple_string());
+		}
+	    }
+	}
+      System.err.println("  under symbol "+ terminal.find(conflict_sym).name());
+      System.err.println("  Resolved in favor of shifting.\n");
+
+      /* count the conflict */
+      emit.num_conflicts++;
+      lexer.warning_count++;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality comparison. */
+  public boolean equals(lalr_state other)
+    {
+      /* we are equal if our item sets are equal */
+      return other != null && items().equals(other.items());
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality comparison. */
+  public boolean equals(Object other)
+    {
+      if (!(other instanceof lalr_state))
+	return false;
+      else
+	return equals((lalr_state)other);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce a hash code. */
+  public int hashCode()
+    {
+      /* just use the item set hash code */
+      return items().hashCode();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to a string. */
+  public String toString()
+    {
+      String result;
+      lalr_transition tr;
+
+      /* dump the item set */
+      result = "lalr_state [" + index() + "]: " + _items + "\n";
+
+      /* do the transitions */
+      for (tr = transitions(); tr != null; tr = tr.next())
+	{
+	  result += tr;
+	  result += "\n";
+	}
+
+      return result;
+    }
+
+  /*-----------------------------------------------------------*/
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/lalr_transition.java b/jasmin/jasmin-2.4/src/java_cup/lalr_transition.java
new file mode 100644
index 0000000..94bc9c8
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/lalr_transition.java
@@ -0,0 +1,93 @@
+package java_cup;
+
+/** This class represents a transition in an LALR viable prefix recognition 
+ *  machine.  Transitions can be under terminals for non-terminals.  They are
+ *  internally linked together into singly linked lists containing all the 
+ *  transitions out of a single state via the _next field.
+ *
+ * @see     java_cup.lalr_state
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ *
+ */
+public class lalr_transition {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Full constructor.
+   * @param on_sym  symbol we are transitioning on.
+   * @param to_st   state we transition to.
+   * @param nxt     next transition in linked list.
+   */
+  public lalr_transition(symbol on_sym, lalr_state to_st, lalr_transition nxt)
+    throws internal_error
+    {
+      /* sanity checks */
+      if (on_sym == null)
+	throw new internal_error("Attempt to create transition on null symbol");
+      if (to_st == null)
+	throw new internal_error("Attempt to create transition to null state");
+
+      /* initialize */
+      _on_symbol = on_sym;
+      _to_state  = to_st;
+      _next      = nxt;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constructor with null next. 
+   * @param on_sym  symbol we are transitioning on.
+   * @param to_st   state we transition to.
+   */
+  public lalr_transition(symbol on_sym, lalr_state to_st) throws internal_error
+    {
+      this(on_sym, to_st, null);
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** The symbol we make the transition on. */
+  protected symbol _on_symbol;
+
+  /** The symbol we make the transition on. */
+  public symbol on_symbol() {return _on_symbol;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The state we transition to. */
+  protected lalr_state _to_state;
+
+  /** The state we transition to. */
+  public lalr_state to_state() {return _to_state;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Next transition in linked list of transitions out of a state */
+  protected lalr_transition _next;
+
+  /** Next transition in linked list of transitions out of a state */
+  public lalr_transition next() {return _next;}
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Convert to a string. */
+  public String toString()
+    {
+      String result;
+
+      result = "transition on " + on_symbol().name() + " to state [";
+      result += _to_state.index();
+      result += "]";
+
+      return result;
+    }
+
+  /*-----------------------------------------------------------*/
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/lexer.java b/jasmin/jasmin-2.4/src/java_cup/lexer.java
new file mode 100644
index 0000000..e4eff4d
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/lexer.java
@@ -0,0 +1,474 @@
+package java_cup;
+
+import java_cup.runtime.token;
+import java_cup.runtime.str_token;
+import java.util.Hashtable;
+
+/** This class implements a small scanner (aka lexical analyzer or lexer) for
+ *  the JavaCup specification.  This scanner reads characters from standard 
+ *  input (System.in) and returns integers corresponding to the terminal 
+ *  number of the next token.  Once end of input is reached the EOF token is 
+ *  returned on every subsequent call.<p>
+ *  Tokens currently returned include: <pre>
+ *    Symbol        Constant Returned     Symbol        Constant Returned
+ *    ------        -----------------     ------        -----------------
+ *    "package"     PACKAGE               "import"      IMPORT 
+ *    "code"        CODE                  "action"      ACTION 
+ *    "parser"      PARSER                "terminal"    TERMINAL
+ *    "non"         NON                   "init"        INIT 
+ *    "scan"        SCAN                  "with"        WITH
+ *    "start"       START                   ;           SEMI 
+ *      ,           COMMA                   *           STAR 
+ *      .           DOT                     :           COLON
+ *      ::=         COLON_COLON_EQUALS      |           BAR
+ *    identifier    ID                    {:...:}       CODE_STRING
+ *    "debug"       DEBUG
+ *  </pre>
+ *  All symbol constants are defined in sym.java which is generated by 
+ *  JavaCup from parser.cup.<p>
+ * 
+ *  In addition to the scanner proper (called first via init() then with
+ *  next_token() to get each token) this class provides simple error and 
+ *  warning routines and keeps a count of errors and warnings that is 
+ *  publicly accessible.<p>
+ *  
+ *  This class is "static" (i.e., it has only static members and methods).
+ *
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public class lexer {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** The only constructor is private, so no instances can be created. */
+  private lexer() { }
+
+  /*-----------------------------------------------------------*/
+  /*--- Static (Class) Variables ------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** First character of lookahead. */
+  protected static int next_char; 
+
+  /** Second character of lookahead. */
+  protected static int next_char2;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** EOF constant. */
+  protected static final int EOF_CHAR = -1;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Table of keywords.  Keywords are initially treated as identifiers.
+   *  Just before they are returned we look them up in this table to see if
+   *  they match one of the keywords.  The string of the name is the key here,
+   *  which indexes Integer objects holding the symbol number. 
+   */
+  protected static Hashtable keywords = new Hashtable(23);
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Table of single character symbols.  For ease of implementation, we 
+   *  store all unambiguous single character tokens in this table of Integer
+   *  objects keyed by Integer objects with the numerical value of the 
+   *  appropriate char (currently Character objects have a bug which precludes
+   *  their use in tables).
+   */
+  protected static Hashtable char_symbols = new Hashtable(11);
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Current line number for use in error messages. */
+  protected static int current_line = 1;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Character position in current line. */
+  protected static int current_position = 1;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Count of total errors detected so far. */
+  public static int error_count = 0;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Count of warnings issued so far */
+  public static int warning_count = 0;
+
+  /*-----------------------------------------------------------*/
+  /*--- Static Methods ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Initialize the scanner.  This sets up the keywords and char_symbols
+    * tables and reads the first two characters of lookahead.  
+    */
+  public static void init() throws java.io.IOException
+    {
+      /* set up the keyword table */
+      keywords.put("package",  new Integer(sym.PACKAGE));
+      keywords.put("import",   new Integer(sym.IMPORT));
+      keywords.put("code",     new Integer(sym.CODE));
+      keywords.put("action",   new Integer(sym.ACTION));
+      keywords.put("parser",   new Integer(sym.PARSER));
+      keywords.put("terminal", new Integer(sym.TERMINAL));
+      keywords.put("non",      new Integer(sym.NON));
+      keywords.put("init",     new Integer(sym.INIT));
+      keywords.put("scan",     new Integer(sym.SCAN));
+      keywords.put("with",     new Integer(sym.WITH));
+      keywords.put("start",    new Integer(sym.START));
+      keywords.put("debug",    new Integer(sym.DEBUG));
+
+      /* set up the table of single character symbols */
+      char_symbols.put(new Integer(';'), new Integer(sym.SEMI));
+      char_symbols.put(new Integer(','), new Integer(sym.COMMA));
+      char_symbols.put(new Integer('*'), new Integer(sym.STAR));
+      char_symbols.put(new Integer('.'), new Integer(sym.DOT));
+      char_symbols.put(new Integer('|'), new Integer(sym.BAR));
+
+      /* read two characters of lookahead */
+      next_char = System.in.read();
+      if (next_char == EOF_CHAR) 
+	next_char2 = EOF_CHAR;
+      else
+	next_char2 = System.in.read();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Advance the scanner one character in the input stream.  This moves
+   * next_char2 to next_char and then reads a new next_char2.  
+   */
+  protected static void advance() throws java.io.IOException
+    {
+      int old_char;
+
+      old_char = next_char;
+      next_char = next_char2;
+      if (next_char == EOF_CHAR)
+	next_char2 = EOF_CHAR;
+      else
+	next_char2 = System.in.read();
+
+      /* count this */
+      current_position++;
+      if (old_char == '\n')
+	{
+	  current_line++;
+	  current_position = 1;
+	}
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Emit an error message.  The message will be marked with both the 
+   *  current line number and the position in the line.  Error messages
+   *  are printed on standard error (System.err).
+   * @param message the message to print.
+   */
+  public static void emit_error(String message)
+    {
+      System.err.println("Error at " + current_line + "(" + current_position +
+			 "): " + message);
+      error_count++;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Emit a warning message.  The message will be marked with both the 
+   *  current line number and the position in the line.  Messages are 
+   *  printed on standard error (System.err).
+   * @param message the message to print.
+   */
+  public static void emit_warn(String message)
+    {
+      System.err.println("Warning at " + current_line + "(" + current_position +
+			 "): " + message);
+      warning_count++;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if a character is ok to start an id. 
+   * @param ch the character in question.
+   */
+  protected static boolean id_start_char(int ch)
+    {
+      return (ch >= 'a' &&  ch <= 'z') || (ch >= 'A' && ch <= 'Z') || 
+	     (ch == '_');
+
+      // later need to deal with non-8-bit chars here
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if a character is ok for the middle of an id.
+   * @param ch the character in question. 
+   */
+  protected static boolean id_char(int ch)
+    {
+      return id_start_char(ch) || (ch >= '0' && ch <= '9');
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Try to look up a single character symbol, returns -1 for not found. 
+   * @param ch the character in question.
+   */
+  protected static int find_single_char(int ch)
+    {
+      Integer result;
+
+      result = (Integer)char_symbols.get(new Integer((char)ch));
+      if (result == null) 
+	return -1;
+      else
+	return result.intValue();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Handle swallowing up a comment.  Both old style C and new style C++
+   *  comments are handled.
+   */
+  protected static void swallow_comment() throws java.io.IOException
+    {
+      /* next_char == '/' at this point */
+
+      /* is it a traditional comment */
+      if (next_char2 == '*')
+	{
+	  /* swallow the opener */
+	  advance(); advance();
+
+	  /* swallow the comment until end of comment or EOF */
+	  for (;;)
+	    {
+	      /* if its EOF we have an error */
+	      if (next_char == EOF_CHAR)
+		{
+		  emit_error("Specification file ends inside a comment");
+		  return;
+		}
+
+	      /* if we can see the closer we are done */
+	      if (next_char == '*' && next_char2 == '/')
+		{
+		  advance();
+		  advance();
+		  return;
+		}
+
+	      /* otherwise swallow char and move on */
+	      advance();
+	    }
+	}
+
+      /* is its a new style comment */
+      if (next_char2 == '/')
+	{
+	  /* swallow the opener */
+	  advance(); advance();
+
+	  /* swallow to '\n', '\f', or EOF */ 
+	  while (next_char != '\n' && next_char != '\f' && next_char!=EOF_CHAR)
+	    advance();
+
+	  return;
+
+	}
+
+      /* shouldn't get here, but... if we get here we have an error */
+      emit_error("Malformed comment in specification -- ignored");
+      advance();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Swallow up a code string.  Code strings begin with "{:" and include
+      all characters up to the first occurrence of ":}" (there is no way to 
+      include ":}" inside a code string).  The routine returns an str_token
+      object suitable for return by the scanner.
+   */
+  protected static token do_code_string() throws java.io.IOException
+    {
+      StringBuffer result = new StringBuffer();
+
+      /* at this point we have lookahead of "{:" -- swallow that */
+      advance(); advance();
+
+      /* save chars until we see ":}" */
+      while (!(next_char == ':' && next_char2 == '}'))
+	{
+	  /* if we have run off the end issue a message and break out of loop */
+	  if (next_char == EOF_CHAR)
+	    {
+	      emit_error("Specification file ends inside a code string");
+	      break;
+	    }
+
+	  /* otherwise record the char and move on */
+	  result.append(new Character((char)next_char));
+	  advance();
+	}
+
+      /* advance past the closer and build a return token */
+      advance(); advance();
+      return new str_token(sym.CODE_STRING, result.toString());
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Process an identifier.  Identifiers begin with a letter, underscore,
+   *  or dollar sign, which is followed by zero or more letters, numbers,
+   *  underscores or dollar signs.  This routine returns an str_token suitable
+   *  for return by the scanner.
+   */
+  protected static token do_id() throws java.io.IOException
+    {
+      StringBuffer result = new StringBuffer();
+      String       result_str;
+      Integer      keyword_num;
+      char         buffer[] = new char[1];
+
+      /* next_char holds first character of id */
+      buffer[0] = (char)next_char;
+      result.append(buffer,0,1);
+      advance();
+
+      /* collect up characters while they fit in id */ 
+      while(id_char(next_char))
+	{
+          buffer[0] = (char)next_char;
+	  result.append(buffer,0,1);
+	  advance();
+	}
+
+      /* extract a string and try to look it up as a keyword */
+      result_str = result.toString();
+      keyword_num = (Integer)keywords.get(result_str);
+
+      /* if we found something, return that keyword */
+      if (keyword_num != null)
+	return new token(keyword_num.intValue());
+
+      /* otherwise build and return an id token with an attached string */
+      return new str_token(sym.ID, result_str);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Return one token.  This is the main external interface to the scanner.
+   *  It consumes sufficient characters to determine the next input token
+   *  and returns it.  To help with debugging, this routine actually calls
+   *  real_next_token() which does the work.  If you need to debug the 
+   *  parser, this can be changed to call debug_next_token() which prints
+   *  a debugging message before returning the token.
+   */
+  public static token next_token() throws java.io.IOException
+    {
+      return real_next_token();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Debugging version of next_token().  This routine calls the real scanning
+   *  routine, prints a message on System.out indicating what the token is,
+   *  then returns it.
+   */
+  public static token debug_next_token() throws java.io.IOException
+    {
+      token result = real_next_token();
+      System.out.println("# next_token() => " + result.sym);
+      return result;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The actual routine to return one token.  This is normally called from
+   *  next_token(), but for debugging purposes can be called indirectly from
+   *  debug_next_token(). 
+   */
+  protected static token real_next_token() throws java.io.IOException
+    {
+      int sym_num;
+
+      for (;;)
+	{
+	  /* look for white space */
+	  if (next_char == ' ' || next_char == '\t' || next_char == '\n' ||
+	      next_char == '\f' ||  next_char == '\r')
+	    {
+	      /* advance past it and try the next character */
+	      advance();
+	      continue;
+	    }
+
+	  /* look for a single character symbol */
+	  sym_num = find_single_char(next_char);
+	  if (sym_num != -1)
+	    {
+	      /* found one -- advance past it and return a token for it */
+	      advance();
+	      return new token(sym_num);
+	    }
+
+	  /* look for : or ::= */
+	  if (next_char == ':')
+	    {
+	      /* if we don't have a second ':' return COLON */
+	      if (next_char2 != ':') 
+		{
+		  advance();
+		  return new token(sym.COLON);
+		}
+
+	      /* move forward and look for the '=' */
+	      advance();
+	      if (next_char2 == '=') 
+		{
+		  advance(); advance();
+		  return new token(sym.COLON_COLON_EQUALS);
+		}
+	      else
+		{
+		  /* return just the colon (already consumed) */
+		  return new token(sym.COLON);
+		}
+	    }
+
+	  /* look for a comment */
+	  if (next_char == '/' && (next_char2 == '*' || next_char2 == '/'))
+	    {
+	      /* swallow then continue the scan */
+	      swallow_comment();
+	      continue;
+	    }
+
+	  /* look for start of code string */
+	  if (next_char == '{' && next_char2 == ':')
+	    return do_code_string();
+
+	  /* look for an id or keyword */
+	  if (id_start_char(next_char)) return do_id();
+
+	  /* look for EOF */
+	  if (next_char == EOF_CHAR) return new token(sym.EOF);
+
+	  /* if we get here, we have an unrecognized character */
+	  emit_warn("Unrecognized character '" + 
+	    new Character((char)next_char) + "'(" + next_char + 
+	    ") -- ignored");
+
+	  /* advance past it */
+	  advance();
+	}
+    }
+
+  /*-----------------------------------------------------------*/
+};
+
diff --git a/jasmin/jasmin-2.4/src/java_cup/lr_item_core.java b/jasmin/jasmin-2.4/src/java_cup/lr_item_core.java
new file mode 100644
index 0000000..a1060f4
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/lr_item_core.java
@@ -0,0 +1,270 @@
+
+package java_cup;
+
+/** The "core" of an LR item.  This includes a production and the position
+ *  of a marker (the "dot") within the production.  Typically item cores 
+ *  are written using a production with an embedded "dot" to indicate their 
+ *  position.  For example: <pre>
+ *     A ::= B * C d E
+ *  </pre>
+ *  This represents a point in a parse where the parser is trying to match
+ *  the given production, and has succeeded in matching everything before the 
+ *  "dot" (and hence is expecting to see the symbols after the dot next).  See 
+ *  lalr_item, lalr_item_set, and lalr_start for full details on the meaning 
+ *  and use of items.
+ *
+ * @see     java_cup.lalr_item
+ * @see     java_cup.lalr_item_set
+ * @see     java_cup.lalr_state
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+*/
+
+public class lr_item_core {
+   
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Full constructor.
+   * @param prod production this item uses.
+   * @param pos  position of the "dot" within the item.
+   */
+  public lr_item_core(production prod, int pos) throws internal_error
+    {
+      symbol          after_dot = null;
+      production_part part;
+
+      if (prod == null)
+	throw new internal_error(
+	  "Attempt to create an lr_item_core with a null production");
+
+      _the_production = prod;
+
+      if (pos < 0 || pos > _the_production.rhs_length())
+	throw new internal_error(
+	  "Attempt to create an lr_item_core with a bad dot position");
+
+      _dot_pos = pos;
+
+      /* compute and cache hash code now */
+      _core_hash_cache = 13*_the_production.hashCode() + pos;
+
+      /* cache the symbol after the dot */
+      if (_dot_pos < _the_production.rhs_length())
+	{
+	  part = _the_production.rhs(_dot_pos);
+	  if (!part.is_action())
+	    _symbol_after_dot = ((symbol_part)part).the_symbol();
+	}
+    } 
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constructor for dot at start of right hand side. 
+   * @param prod production this item uses.
+   */
+  public lr_item_core(production prod) throws internal_error
+    {
+      this(prod,0);
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** The production for the item. */
+  protected production _the_production;
+
+  /** The production for the item. */
+  public production the_production() {return _the_production;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The position of the "dot" -- this indicates the part of the production 
+   *  that the marker is before, so 0 indicates a dot at the beginning of 
+   *  the RHS.
+   */
+  protected int _dot_pos;
+
+  /** The position of the "dot" -- this indicates the part of the production 
+   *  that the marker is before, so 0 indicates a dot at the beginning of 
+   *  the RHS.
+   */
+  public int dot_pos() {return _dot_pos;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Cache of the hash code. */
+  protected int _core_hash_cache;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Cache of symbol after the dot. */
+  protected symbol _symbol_after_dot = null;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Is the dot at the end of the production? */
+  public boolean dot_at_end() 
+    {
+       return _dot_pos >= _the_production.rhs_length();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Return the symbol after the dot.  If there is no symbol after the dot
+   *  we return null. */
+  public symbol symbol_after_dot()
+    {
+      /* use the cached symbol */
+      return _symbol_after_dot;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if we have a dot before a non terminal, and if so which one 
+   *  (return null or the non terminal). 
+   */
+  public non_terminal dot_before_nt()
+    {
+      symbol sym;
+
+      /* get the symbol after the dot */
+      sym = symbol_after_dot();
+
+      /* if it exists and is a non terminal, return it */
+      if (sym != null && sym.is_non_term())
+	return (non_terminal)sym;
+      else
+	return null;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce a new lr_item_core that results from shifting the dot one 
+   *  position to the right. 
+   */
+  public lr_item_core shift_core() throws internal_error
+    {
+      if (dot_at_end()) 
+	throw new internal_error(
+	  "Attempt to shift past end of an lr_item_core");
+
+      return new lr_item_core(_the_production, _dot_pos+1);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality comparison for the core only.  This is separate out because we 
+   *  need separate access in a super class. 
+   */
+  public boolean core_equals(lr_item_core other)
+    {
+      return other != null && 
+	     _the_production.equals(other._the_production) && 
+	     _dot_pos == other._dot_pos;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality comparison. */
+  public boolean equals(lr_item_core other) {return core_equals(other);}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality comparison. */
+  public boolean equals(Object other)
+    {
+      if (!(other instanceof lr_item_core))
+	return false;
+      else
+	return equals((lr_item_core)other);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Hash code for the core (separated so we keep non overridden version). */
+  public int core_hashCode()
+    {
+      return _core_hash_cache;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Hash code for the item. */
+  public int hashCode() 
+    {
+      return _core_hash_cache;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to a string (separated out from toString() so we can call it
+   *  from subclass that overrides toString()).
+   */
+  public String to_simple_string() throws internal_error
+    {
+      String result;
+      production_part part;
+
+      if (_the_production.lhs() != null && 
+	  _the_production.lhs().the_symbol() != null &&
+	  _the_production.lhs().the_symbol().name() != null)
+	result = _the_production.lhs().the_symbol().name();
+      else
+	result = "$$NULL$$";
+
+      result += " ::= ";
+
+      for (int i = 0; i<_the_production.rhs_length(); i++)
+	{
+	  /* do we need the dot before this one? */
+	  if (i == _dot_pos)
+	    result += "(*) ";
+	  
+	  /* print the name of the part */
+	  if (_the_production.rhs(i) == null)
+	    {
+	      result += "$$NULL$$ ";
+	    }
+	  else
+	    {
+	      part = _the_production.rhs(i);
+	      if (part == null)
+		result += "$$NULL$$ ";
+	      else if (part.is_action())
+		result += "{ACTION} ";
+	      else if (((symbol_part)part).the_symbol() != null &&
+                       ((symbol_part)part).the_symbol().name() != null)
+		result += ((symbol_part)part).the_symbol().name() + " ";
+	      else
+		result += "$$NULL$$ ";
+	    }
+	}
+
+      /* put the dot after if needed */
+      if (_dot_pos == _the_production.rhs_length())
+	result += "(*) ";
+
+      return result;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to a string */
+  public String toString() 
+    {
+      /* can't throw here since super class doesn't, so we crash instead */
+      try {
+        return to_simple_string();
+      } catch(internal_error e) {
+	e.crash();
+	return null;
+      }
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
+   
diff --git a/jasmin/jasmin-2.4/src/java_cup/non_terminal.java b/jasmin/jasmin-2.4/src/java_cup/non_terminal.java
new file mode 100644
index 0000000..120dbdc
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/non_terminal.java
@@ -0,0 +1,280 @@
+package java_cup;
+
+import java.util.Hashtable;
+import java.util.Enumeration;
+
+/** This class represents a non-terminal symbol in the grammar.  Each
+ *  non terminal has a textual name, an index, and a string which indicates
+ *  the type of object it will be implemented with at runtime (i.e. the class
+ *  of object that will be pushed on the parse stack to represent it). 
+ *
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+
+public class non_terminal extends symbol {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Full constructor.
+   * @param nm  the name of the non terminal.
+   * @param tp  the type string for the non terminal.
+   */
+  public non_terminal(String nm, String tp) 
+    {
+      /* super class does most of the work */
+      super(nm, tp);
+
+      /* add to set of all non terminals and check for duplicates */
+      Object conflict = _all.put(nm,this);
+      if (conflict != null)
+	// can't throw an exception here because these are used in static
+	// initializers, so we crash instead
+	// was: 
+	// throw new internal_error("Duplicate non-terminal ("+nm+") created");
+	(new internal_error("Duplicate non-terminal ("+nm+") created")).crash();
+
+      /* assign a unique index */
+      _index = next_index++;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constructor with default type. 
+   * @param nm  the name of the non terminal.
+   */
+  public non_terminal(String nm) 
+    {
+      this(nm, null);
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Static (Class) Variables ------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Table of all non-terminals -- elements are stored using name strings 
+   *  as the key 
+   */
+  protected static Hashtable _all = new Hashtable();
+
+  /** Access to all non-terminals. */
+  public static Enumeration all() {return _all.elements();};
+
+  /** lookup a non terminal by name string */ 
+  public static non_terminal find(String with_name)
+    {
+      if (with_name == null)
+        return null;
+      else 
+        return (non_terminal)_all.get(with_name);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Total number of non-terminals. */
+  public static int number() {return _all.size();};
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Static counter to assign unique indexes. */
+  protected static int next_index = 0;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Static counter for creating unique non-terminal names */
+  static protected int next_nt = 0;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** special non-terminal for start symbol */
+  public static final non_terminal START_nt = new non_terminal("$START");
+
+  /*-----------------------------------------------------------*/
+  /*--- Static Methods ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+	 
+  /** Method for creating a new uniquely named hidden non-terminal using 
+   *  the given string as a base for the name (or "NT$" if null is passed).
+   * @param prefix base name to construct unique name from. 
+   */
+  static non_terminal create_new(String prefix) throws internal_error
+    {
+      if (prefix == null) prefix = "NT$";
+      return new non_terminal(prefix + next_nt++);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** static routine for creating a new uniquely named hidden non-terminal */
+  static non_terminal create_new() throws internal_error
+    { 
+      return create_new(null); 
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Compute nullability of all non-terminals. */
+  public static void compute_nullability() throws internal_error
+    {
+      boolean      change = true;
+      non_terminal nt;
+      Enumeration  e;
+      production   prod;
+
+      /* repeat this process until there is no change */
+      while (change)
+	{
+	  /* look for a new change */
+	  change = false;
+
+	  /* consider each non-terminal */
+	  for (e=all(); e.hasMoreElements(); )
+	    {
+	      nt = (non_terminal)e.nextElement();
+
+	      /* only look at things that aren't already marked nullable */
+	      if (!nt.nullable())
+		{
+		  if (nt.looks_nullable())
+		    {
+		      nt._nullable = true;
+		      change = true;
+		    }
+		}
+	    }
+	}
+      
+      /* do one last pass over the productions to finalize all of them */
+      for (e=production.all(); e.hasMoreElements(); )
+	{
+	  prod = (production)e.nextElement();
+	  prod.set_nullable(prod.check_nullable());
+	}
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Compute first sets for all non-terminals.  This assumes nullability has
+   *  already computed.
+   */
+  public static void compute_first_sets() throws internal_error
+    {
+      boolean      change = true;
+      Enumeration  n;
+      Enumeration  p;
+      non_terminal nt;
+      production   prod;
+      terminal_set prod_first;
+
+      /* repeat this process until we have no change */
+      while (change)
+	{
+	  /* look for a new change */
+	  change = false;
+
+	  /* consider each non-terminal */
+	  for (n = all(); n.hasMoreElements(); )
+	    {
+	      nt = (non_terminal)n.nextElement();
+
+	      /* consider every production of that non terminal */
+	      for (p = nt.productions(); p.hasMoreElements(); )
+		{
+		  prod = (production)p.nextElement();
+
+		  /* get the updated first of that production */
+		  prod_first = prod.check_first_set();
+
+		  /* if this going to add anything, add it */
+		  if (!prod_first.is_subset_of(nt._first_set))
+		    {
+		      change = true;
+		      nt._first_set.add(prod_first);
+		    }
+		}
+	    }
+	}
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Table of all productions with this non terminal on the LHS. */
+  protected Hashtable _productions = new Hashtable(11);
+
+  /** Access to productions with this non terminal on the LHS. */
+  public Enumeration productions() {return _productions.elements();};
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Total number of productions with this non terminal on the LHS. */
+  public int num_productions() {return _productions.size();};
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Add a production to our set of productions. */
+  public void add_production(production prod) throws internal_error
+    {
+      /* catch improper productions */
+      if (prod == null || prod.lhs() == null || prod.lhs().the_symbol() != this)
+	throw new internal_error(
+	  "Attempt to add invalid production to non terminal production table");
+
+      /* add it to the table, keyed with itself */
+      _productions.put(prod,prod);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Nullability of this non terminal. */
+  protected boolean _nullable;
+
+  /** Nullability of this non terminal. */
+  public boolean nullable() {return _nullable;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** First set for this non-terminal. */
+  protected terminal_set _first_set = new terminal_set();
+
+  /** First set for this non-terminal. */
+  public terminal_set first_set() {return _first_set;}
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Indicate that this symbol is a non-terminal. */
+  public boolean is_non_term() 
+    {
+      return true;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Test to see if this non terminal currently looks nullable. */
+  protected boolean looks_nullable() throws internal_error
+    {
+      /* look and see if any of the productions now look nullable */
+      for (Enumeration e = productions(); e.hasMoreElements(); )
+	/* if the production can go to empty, we are nullable */
+	if (((production)e.nextElement()).check_nullable())
+	  return true;
+
+      /* none of the productions can go to empty, so we are not nullable */
+      return false;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** convert to string */
+  public String toString()
+    {
+      return super.toString() + "[" + index() + "]" + (nullable() ? "*" : "");
+    }
+
+  /*-----------------------------------------------------------*/
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/parse_action.java b/jasmin/jasmin-2.4/src/java_cup/parse_action.java
new file mode 100644
index 0000000..afcbef2
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/parse_action.java
@@ -0,0 +1,87 @@
+
+package java_cup;
+
+/** This class serves as the base class for entries in a parse action table.  
+ *  Full entries will either be SHIFT(state_num), REDUCE(production), or ERROR.
+ *  Objects of this base class will default to ERROR, while the other two 
+ *  types will be  represented by subclasses.
+ * 
+ * @see     java_cup.reduce_action
+ * @see     java_cup.shift_action
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+
+public class parse_action {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Simple constructor. */
+  public parse_action()
+    {
+      /* nothing to do in the base class */
+    }
+
+ 
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Static (Class) Variables ------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Constant for action type -- error action. */
+  public static final int ERROR = 0;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constant for action type -- shift action. */
+  public static final int SHIFT = 1;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constants for action type -- reduce action. */
+  public static final int REDUCE = 2;
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+	 
+  /** Quick access to the type -- base class defaults to error. */
+  public int kind() {return ERROR;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality test. */
+  public boolean equals(parse_action other)
+    {
+      /* we match all error actions */
+      return other != null && other.kind() == ERROR;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality test. */
+  public boolean equals(Object other)
+    {
+      if (other instanceof parse_action)
+	return equals((parse_action)other);
+      else
+	return false;
+    }
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Compute a hash code. */
+  public int hashCode()
+    {
+      /* all objects of this class hash together */
+      return 0xCafe123;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to string. */
+  public String toString() {return "ERROR";}
+
+  /*-----------------------------------------------------------*/
+};
+    
diff --git a/jasmin/jasmin-2.4/src/java_cup/parse_action_row.java b/jasmin/jasmin-2.4/src/java_cup/parse_action_row.java
new file mode 100644
index 0000000..7ac883f
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/parse_action_row.java
@@ -0,0 +1,106 @@
+
+package java_cup;
+
+/** This class represents one row (corresponding to one machine state) of the 
+ *  parse action table.
+ */
+public class parse_action_row {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+	       
+  /** Simple constructor.  Note: this should not be used until the number of
+   *  terminals in the grammar has been established.
+   */
+  public parse_action_row()
+    {
+      /* make sure the size is set */
+      if (_size <= 0 )  _size = terminal.number();
+
+      /* allocate the array */
+      under_term = new parse_action[size()];
+
+      /* set each element to an error action */
+      for (int i=0; i<_size; i++)
+	under_term[i] = new parse_action();
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Static (Class) Variables ------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Number of columns (terminals) in every row. */
+  protected static int _size = 0;
+
+  /** Number of columns (terminals) in every row. */
+  public static int size() {return _size;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Table of reduction counts (reused by compute_default()). */
+  protected static int reduction_count[] = null;
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Actual action entries for the row. */
+  public parse_action under_term[];
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Default (reduce) action for this row.  -1 will represent default 
+   *  of error. 
+   */
+  public int default_reduce;
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+	
+  /** Compute the default (reduce) action for this row and store it in 
+   *  default_reduce.  In the case of non-zero default we will have the 
+   *  effect of replacing all errors by that reduction.  This may cause 
+   *  us to do erroneous reduces, but will never cause us to shift past 
+   *  the point of the error and never cause an incorrect parse.  -1 will 
+   *  be used to encode the fact that no reduction can be used as a 
+   *  default (in which case error will be used).
+   */
+  public void compute_default()
+    {
+      int i, prod, max_prod, max_red;
+
+      /* if we haven't allocated the count table, do so now */
+      if (reduction_count == null) 
+	reduction_count = new int[production.number()];
+
+      /* clear the reduction count table and maximums */
+      for (i = 0; i < production.number(); i++)
+	reduction_count[i] = 0;
+      max_prod = -1;
+      max_red = 0;
+     
+      /* walk down the row and look at the reduces */
+      for (i = 0; i < size(); i++)
+	if (under_term[i].kind() == parse_action.REDUCE)
+	  {
+	    /* count the reduce in the proper production slot and keep the 
+	       max up to date */
+	    prod = ((reduce_action)under_term[i]).reduce_with().index();
+	    reduction_count[prod]++;
+	    if (reduction_count[prod] > max_red)
+	      {
+		max_red = reduction_count[prod];
+		max_prod = prod;
+	      }
+	  }
+
+       /* record the max as the default (or -1 for not found) */
+       default_reduce = max_prod;
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
+
diff --git a/jasmin/jasmin-2.4/src/java_cup/parse_action_table.java b/jasmin/jasmin-2.4/src/java_cup/parse_action_table.java
new file mode 100644
index 0000000..fdfbb9f
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/parse_action_table.java
@@ -0,0 +1,143 @@
+
+package java_cup;
+
+import java.util.Enumeration;
+
+/** This class represents the complete "action" table of the parser. 
+ *  It has one row for each state in the parse machine, and a column for
+ *  each terminal symbol.  Each entry in the table represents a shift,
+ *  reduce, or an error.  
+ *
+ * @see     java_cup.parse_action
+ * @see     java_cup.parse_action_row
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public class parse_action_table {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Simple constructor.  All terminals, non-terminals, and productions must 
+   *  already have been entered, and the viable prefix recognizer should
+   *  have been constructed before this is called.
+   */
+  public parse_action_table()
+    {
+      /* determine how many states we are working with */
+      _num_states = lalr_state.number();
+
+      /* allocate the array and fill it in with empty rows */
+      under_state = new parse_action_row[_num_states];
+      for (int i=0; i<_num_states; i++)
+	under_state[i] = new parse_action_row();
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** How many rows/states are in the machine/table. */
+  protected int _num_states;
+
+  /** How many rows/states are in the machine/table. */
+  public int num_states() {return _num_states;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Actual array of rows, one per state. */
+  public  parse_action_row[] under_state;
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Check the table to ensure that all productions have been reduced. 
+   *  Issue a warning message (to System.err) for each production that
+   *  is never reduced.
+   */
+  public void check_reductions()
+    throws internal_error
+    {
+      parse_action act;
+      production   prod;
+
+      /* tabulate reductions -- look at every table entry */
+      for (int row = 0; row < num_states(); row++)
+	{
+	  for (int col = 0; col < under_state[row].size(); col++)
+	    {
+	      /* look at the action entry to see if its a reduce */
+	      act = under_state[row].under_term[col];
+	      if (act != null && act.kind() == parse_action.REDUCE)
+		{
+		  /* tell production that we used it */
+		  ((reduce_action)act).reduce_with().note_reduction_use();
+		}
+	    }
+	}
+
+      /* now go across every production and make sure we hit it */
+      for (Enumeration p = production.all(); p.hasMoreElements(); )
+	{
+	  prod = (production)p.nextElement();
+
+	  /* if we didn't hit it give a warning */
+	  if (prod.num_reductions() == 0)
+	    {
+	      /* count it *
+	      emit.not_reduced++;
+
+	      /* give a warning if they haven't been turned off */
+	      if (!emit.nowarn)
+		{
+		  System.err.println("*** Production \"" + 
+				  prod.to_simple_string() + "\" never reduced");
+		  lexer.warning_count++;
+		}
+	    }
+	}
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*
+
+  /** Convert to a string. */
+  public String toString()
+    {
+      String result;
+      int cnt;
+
+      result = "-------- ACTION_TABLE --------\n";
+      for (int row = 0; row < num_states(); row++)
+	{
+	  result += "From state #" + row + "\n";
+	  cnt = 0;
+	  for (int col = 0; col < under_state[row].size(); col++)
+	    {
+	      /* if the action is not an error print it */ 
+	      if (under_state[row].under_term[col].kind() != parse_action.ERROR)
+		{
+		  result += col + ":" + under_state[row].under_term[col] + " ";
+
+		  /* end the line after the 3rd one */
+		  cnt++;
+		  if (cnt == 3)
+		    {
+		      result += "\n";
+		      cnt = 0;
+		    }
+		}
+	    }
+          /* finish the line if we haven't just done that */
+	  if (cnt != 0) result += "\n";
+	}
+      result += "------------------------------";
+
+      return result;
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
+
diff --git a/jasmin/jasmin-2.4/src/java_cup/parse_reduce_row.java b/jasmin/jasmin-2.4/src/java_cup/parse_reduce_row.java
new file mode 100644
index 0000000..773b745
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/parse_reduce_row.java
@@ -0,0 +1,41 @@
+
+package java_cup;
+
+/** This class represents one row (corresponding to one machine state) of the 
+ *  reduce-goto parse table. 
+ */
+public class parse_reduce_row {
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Simple constructor. Note: this should not be used until the number
+   *  of terminals in the grammar has been established.
+   */
+  public parse_reduce_row()
+    {
+      /* make sure the size is set */
+      if (_size <= 0 )  _size = non_terminal.number();
+
+      /* allocate the array */
+      under_non_term = new lalr_state[size()];
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Static (Class) Variables ------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Number of columns (non terminals) in every row. */
+  protected static int _size = 0;
+
+  /** Number of columns (non terminals) in every row. */
+  public static int size() {return _size;}
+   
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Actual entries for the row. */
+  public lalr_state under_non_term[];
+};
+
diff --git a/jasmin/jasmin-2.4/src/java_cup/parse_reduce_table.java b/jasmin/jasmin-2.4/src/java_cup/parse_reduce_table.java
new file mode 100644
index 0000000..f519977
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/parse_reduce_table.java
@@ -0,0 +1,99 @@
+
+package java_cup;
+
+import java.util.Enumeration;
+
+/** This class represents the complete "reduce-goto" table of the parser.
+ *  It has one row for each state in the parse machines, and a column for
+ *  each terminal symbol.  Each entry contains a state number to shift to
+ *  as the last step of a reduce. 
+ *
+ * @see     java_cup.parse_reduce_row
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public class parse_reduce_table {
+ 
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Simple constructor.  Note: all terminals, non-terminals, and productions 
+   *  must already have been entered, and the viable prefix recognizer should
+   *  have been constructed before this is called.
+   */
+  public parse_reduce_table()
+    {
+      /* determine how many states we are working with */
+      _num_states = lalr_state.number();
+
+      /* allocate the array and fill it in with empty rows */
+      under_state = new parse_reduce_row[_num_states];
+      for (int i=0; i<_num_states; i++)
+	under_state[i] = new parse_reduce_row();
+    }
+
+   
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** How many rows/states in the machine/table. */
+  protected int _num_states;
+
+  /** How many rows/states in the machine/table. */
+  public int num_states() {return _num_states;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Actual array of rows, one per state */
+  public  parse_reduce_row[] under_state;
+ 
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Convert to a string. */
+  public String toString()
+    {
+      String result;
+      lalr_state goto_st;
+      int cnt;
+
+      result = "-------- REDUCE_TABLE --------\n";
+      for (int row = 0; row < num_states(); row++)
+	{
+	  result += "From state #" + row + "\n";
+	  cnt = 0;
+	  for (int col = 0; col < under_state[row].size(); col++)
+	    {
+	      /* pull out the table entry */
+	      goto_st = under_state[row].under_non_term[col];
+
+	      /* if it has action in it, print it */
+	      if (goto_st != null)
+		{
+		  result += col + ":"; 
+		  result += goto_st.index();
+
+		  /* end the line after the 3rd one */
+		  cnt++;
+		  if (cnt == 3)
+		    {
+		      result += "\n";
+		      cnt = 0;
+		    }
+		}
+	    }
+          /* finish the line if we haven't just done that */
+	  if (cnt != 0) result += "\n";
+	}
+      result += "-----------------------------";
+
+      return result;
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
+
diff --git a/jasmin/jasmin-2.4/src/java_cup/parser.cup b/jasmin/jasmin-2.4/src/java_cup/parser.cup
new file mode 100644
index 0000000..963b543
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/parser.cup
@@ -0,0 +1,620 @@
+
+/*================================================================*/
+/*
+  JavaCup Specification for the JavaCup Specification Language
+  by Scott Hudson, GVU Center, Georgia Tech, August 1995
+
+  This JavaCup specification is used to implement JavaCup itself.
+  It specifies the parser for the JavaCup specification language.
+  (It also serves as a reasonable example of what a typical JavaCup
+  spec looks like).
+
+  The specification has the following parts:
+    Package and import declarations
+      These serve the same purpose as in a normal Java source file
+      (and will appear in the generated code for the parser). In this
+      case we are part of the java_cup package and we import both the
+      java_cup runtime system and Hashtable from the standard Java
+      utilities package.
+
+    Action code
+      This section provides code that is included with the class encapsulating
+      the various pieces of user code embedded in the grammar (i.e., the
+      semantic actions).  This provides a series of helper routines and
+      data structures that the semantic actions use.
+
+    Parser code
+      This section provides code included in the parser class itself.  In
+      this case we override the default error reporting routines.
+
+    Init with and scan with
+      These sections provide small bits of code that initialize, then
+      indicate how to invoke the scanner.
+
+    Symbols and grammar
+      These sections declare all the terminal and non terminal symbols
+      and the types of objects that they will be represented by at runtime,
+      then indicate the start symbol of the grammar (), and finally provide
+      the grammar itself (with embedded actions).
+
+    Operation of the parser
+      The parser acts primarily by accumulating data structures representing
+      various parts of the specification.  Various small parts (e.g., single
+      code strings) are stored as static variables of the emit class and
+      in a few cases as variables declared in the action code section.
+      Terminals, non terminals, and productions, are maintained as collection
+      accessible via static methods of those classes.  In addition, two
+      symbol tables are kept:
+	symbols   maintains the name to object mapping for all symbols
+	non_terms maintains a separate mapping containing only the non terms
+
+      Several intermediate working structures are also declared in the action
+      code section.  These include: rhs_parts, rhs_pos, and lhs_nt which
+      build up parts of the current production while it is being parsed.
+
+  Author(s)
+    Scott Hudson, GVU Center, Georgia Tech.
+
+  Revisions
+    v0.9a   First released version                     [SEH] 8/29/95
+    v0.9b   Updated for beta language (throws clauses) [SEH] 11/25/95
+*/
+/*================================================================*/
+
+package java_cup;
+import java_cup.runtime.*;
+import java.util.Hashtable;
+
+/*----------------------------------------------------------------*/
+
+action code {:
+  /** helper routine to clone a new production part adding a given label */
+  protected production_part add_lab(production_part part, String lab)
+    throws internal_error
+    {
+      /* if there is no label, or this is an action, just return the original */
+      if (lab == null || part.is_action()) return part;
+
+      /* otherwise build a new one with the given label attached */
+      return new symbol_part(((symbol_part)part).the_symbol(),lab);
+    }
+
+  /** max size of right hand side we will support */
+  protected final int MAX_RHS = 200;
+
+  /** array for accumulating right hand side parts */
+  protected production_part[] rhs_parts = new production_part[MAX_RHS];
+
+  /** where we are currently in building a right hand side */
+  protected int rhs_pos = 0;
+
+  /** start a new right hand side */
+  protected void new_rhs() {rhs_pos = 0; }
+
+  /** add a new right hand side part */
+  protected void add_rhs_part(production_part part) throws java.lang.Exception
+    {
+      if (rhs_pos >= MAX_RHS)
+	throw new Exception("Internal Error: Productions limited to " +
+			     MAX_RHS + " symbols and actions");
+
+      rhs_parts[rhs_pos] = part;
+      rhs_pos++;
+    }
+
+  /** string to build up multiple part names */
+  protected String multipart_name = new String();
+
+  /** append a new name segment to the accumulated multipart name */
+  protected void append_multipart(String name)
+    {
+      String dot = "";
+
+      /* if we aren't just starting out, put on a dot */
+      if (multipart_name.length() != 0)  dot = ".";
+
+      multipart_name = multipart_name.concat(dot + name);
+    }
+
+  /** table of declared symbols -- contains production parts indexed by name */
+  protected Hashtable symbols = new Hashtable();
+
+  /** table of just non terminals -- contains non_terminals indexed by name */
+  protected Hashtable non_terms = new Hashtable();
+
+  /** declared start non_terminal */
+  protected non_terminal start_nt = null;
+
+  /** left hand side non terminal of the current production */
+  protected non_terminal lhs_nt;
+
+:};
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+parser code {:
+
+  /* override error routines */
+
+  public void report_fatal_error(
+    String   message,
+    Object   info)
+    {
+      done_parsing();
+      lexer.emit_error(message);
+      System.err.println("Can't recover from previous error(s), giving up.");
+      System.exit(1);
+    }
+
+    public void report_error(String message, Object info)
+    {
+      lexer.emit_error(message);
+    }
+:};
+
+/*----------------------------------------------------------------*/
+
+init with {: lexer.init(); :};
+scan with {: return lexer.next_token(); :};
+
+/*----------------------------------------------------------------*/
+
+terminal java_cup.runtime.token
+  PACKAGE, IMPORT, CODE, ACTION, PARSER, TERMINAL, NON, INIT, SCAN, WITH,
+  START, SEMI, COMMA, STAR, DOT, COLON, COLON_COLON_EQUALS, BAR,
+  DEBUG;
+
+terminal java_cup.runtime.str_token  ID, CODE_STRING;
+
+non terminal java_cup.runtime.symbol
+  spec, package_spec, import_list, code_part, action_code_part,
+  parser_code_part, symbol_list, start_spec, production_list,
+  multipart_id, import_spec, import_id, init_code, scan_code, symbol,
+  debug_grammar,
+  type_id, term_name_list, non_term_name_list, production, prod_part_list,
+  prod_part, new_term_id, new_non_term_id, rhs_list, rhs, empty;
+
+non terminal java_cup.runtime.str_token  nt_id, symbol_id, label_id, opt_label;
+
+/*----------------------------------------------------------------*/
+
+start with spec;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+spec ::=
+	{:
+          /* declare "error" as a terminal */
+          symbols.put("error", new symbol_part(terminal.error));
+
+          /* declare start non terminal */
+          non_terms.put("$START", non_terminal.START_nt);
+	:}
+	package_spec
+	import_list
+	code_part
+        debug_grammar
+        init_code
+	scan_code
+	symbol_list
+	start_spec
+	production_list
+	|
+	/* error recovery assuming something went wrong before symbols
+	   and we have TERMINAL or NON TERMINAL to sync on.  if we get
+	   an error after that, we recover inside symbol_list or
+	   production_list
+	*/
+	error
+	symbol_list
+	start_spec
+	production_list
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+package_spec ::=
+	PACKAGE
+	multipart_id
+	{:
+	  /* save the package name */
+	  emit.package_name = multipart_name;
+
+	  /* reset the accumulated multipart name */
+	  multipart_name = new String();
+	:}
+	SEMI
+	|
+	empty
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+import_list ::=
+	import_list
+	import_spec
+	|
+	empty
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+import_spec ::=
+	IMPORT
+	import_id
+	{:
+	  /* save this import on the imports list */
+	  emit.import_list.push(multipart_name);
+
+	  /* reset the accumulated multipart name */
+	  multipart_name = new String();
+	:}
+	SEMI
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+code_part ::= action_code_part parser_code_part ;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+action_code_part ::=
+	ACTION CODE CODE_STRING:user_code SEMI
+	{:
+	  /* save the user included code string */
+	  emit.action_code = user_code.str_val;
+	:}
+	|
+	empty
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+parser_code_part ::=
+	PARSER CODE CODE_STRING:user_code SEMI
+	{:
+	  /* save the user included code string */
+	  emit.parser_code = user_code.str_val;
+	:}
+	|
+	empty
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+init_code ::=
+	INIT WITH CODE_STRING:user_code SEMI
+	{:
+	  /* save the user code */
+	  emit.init_code = user_code.str_val;
+	:}
+	|
+	empty
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+scan_code ::=
+	SCAN WITH CODE_STRING:user_code SEMI
+	{:
+	  /* save the user code */
+	  emit.scan_code = user_code.str_val;
+	:}
+	|
+	empty
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+debug_grammar ::=
+        DEBUG WITH multipart_id SEMI
+	{:
+	  /* save the procedure name */
+          emit.debug_grammar = multipart_name;
+          /* reset the accumulated multipart name */
+          multipart_name = new String();
+	:}
+	|
+	empty
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+symbol_list ::= symbol_list symbol | symbol;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+symbol ::=
+	TERMINAL
+	type_id
+	term_name_list
+	{:
+	  /* reset the accumulated multipart name */
+	  multipart_name = new String();
+	:}
+	SEMI
+	|
+	NON
+	TERMINAL
+	type_id
+	non_term_name_list
+	{:
+	  /* reset the accumulated multipart name */
+	  multipart_name = new String();
+	:}
+	SEMI
+	|
+
+	/* error recovery productions -- sync on semicolon */
+
+	TERMINAL
+	error
+	{:
+	  /* reset the accumulated multipart name */
+	  multipart_name = new String();
+	:}
+	SEMI
+	|
+	NON
+	TERMINAL
+	error
+	{:
+	  /* reset the accumulated multipart name */
+	  multipart_name = new String();
+	:}
+	SEMI
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+term_name_list ::= term_name_list COMMA new_term_id | new_term_id;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+non_term_name_list ::=
+	non_term_name_list
+	COMMA
+	new_non_term_id
+	|
+	new_non_term_id
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+start_spec ::=
+	START WITH nt_id:start_name
+	{:
+	  /* verify that the name has been declared as a non terminal */
+	  non_terminal nt = (non_terminal)non_terms.get(start_name.str_val);
+	  if (nt == null)
+	    {
+	      lexer.emit_error( "Start non terminal \"" + start_name.str_val +
+	  		         "\" has not been declared");
+	    }
+          else
+	    {
+	      /* remember the non-terminal for later */
+	      start_nt = nt;
+
+	      /* build a special start production */
+	      new_rhs();
+	      add_rhs_part(new symbol_part(start_nt));
+	      add_rhs_part(new symbol_part(terminal.EOF));
+	      emit.start_production =
+		     new production(non_terminal.START_nt, rhs_parts, rhs_pos);
+	      new_rhs();
+	    }
+	:}
+	SEMI
+	|
+	empty
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+production_list ::= production_list production | production;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+production ::=
+	nt_id:lhs_id
+	{:
+	  /* lookup the lhs nt */
+	  lhs_nt = (non_terminal)non_terms.get(lhs_id.str_val);
+
+          /* if it wasn't declared, emit a message */
+	  if (lhs_nt == null)
+	    {
+	      if (lexer.error_count == 0)
+	        lexer.emit_error("LHS non terminal \"" + lhs_id.str_val +
+			       "\" has not been declared");
+	    }
+
+	  /* reset the rhs accumulation */
+	  new_rhs();
+	:}
+	COLON_COLON_EQUALS
+	rhs_list
+	SEMI
+	|
+	error
+	{: lexer.emit_error("Syntax Error"); :}
+	SEMI
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+rhs_list ::= rhs_list BAR rhs | rhs;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+rhs ::=
+	prod_part_list
+	{:
+	  if (lhs_nt != null)
+	    {
+	      /* build the production */
+	      production p = new production(lhs_nt, rhs_parts, rhs_pos);
+
+	      /* if we have no start non-terminal declared and this is
+		 the first production, make its lhs nt the start_nt
+		 and build a special start production for it. */
+              if (start_nt == null)
+		{
+		  start_nt = lhs_nt;
+
+	          /* build a special start production */
+	          new_rhs();
+	          add_rhs_part(new symbol_part(start_nt));
+	          add_rhs_part(new symbol_part(terminal.EOF));
+	          emit.start_production =
+		     new production(non_terminal.START_nt, rhs_parts, rhs_pos);
+	          new_rhs();
+		}
+	    }
+
+	  /* reset the rhs accumulation in any case */
+	  new_rhs();
+	:}
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+prod_part_list ::= prod_part_list prod_part | empty;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+prod_part ::=
+	symbol_id:symid opt_label:labid
+	{:
+	  /* try to look up the id */
+	  production_part symb = (production_part)symbols.get(symid.str_val);
+
+	  /* if that fails, symbol is undeclared */
+	  if (symb == null)
+	    {
+	      if (lexer.error_count == 0)
+	        lexer.emit_error("Symbol \"" + symid.str_val +
+			       "\" has not been declared");
+	    }
+	  else
+	    {
+	      /* add a labeled production part */
+	      add_rhs_part(add_lab(symb, labid.str_val));
+	    }
+	:}
+	|
+	CODE_STRING:code_str
+	{:
+	  /* add a new production part */
+	  add_rhs_part(new action_part(code_str.str_val));
+	:}
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+opt_label ::=
+	COLON label_id:labid
+	{: RESULT.str_val = labid.str_val; :}
+	|
+	empty
+	{: RESULT.str_val = null; :}
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+multipart_id ::=
+	multipart_id DOT ID:another_id
+	{: append_multipart(another_id.str_val); :}
+	|
+	ID:an_id
+	{: append_multipart(an_id.str_val); :}
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+import_id ::=
+	multipart_id DOT STAR
+	{: append_multipart("*"); :}
+	|
+	multipart_id
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+type_id ::= multipart_id;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+new_term_id ::=
+	ID:term_id
+	{:
+	  /* see if this terminal has been declared before */
+	  if (symbols.get(term_id.str_val) != null)
+	    {
+	      /* issue a message */
+	      lexer.emit_error("Symbol \"" + term_id.str_val +
+			   "\" has already been declared");
+	    }
+	  else
+	    {
+	      /* build a production_part and put it in the table */
+	      symbols.put(term_id.str_val,
+	        new symbol_part(new terminal(term_id.str_val, multipart_name)));
+	    }
+	:}
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+new_non_term_id ::=
+	ID:non_term_id
+	{:
+	  /* see if this non terminal has been declared before */
+	  if (symbols.get(non_term_id.str_val) != null)
+	    {
+	      /* issue a message */
+	      lexer.emit_error( "Symbol \"" + non_term_id.str_val +
+			                      "\" has already been declared");
+	    }
+	  else
+	    {
+	      /* build the non terminal object */
+              non_terminal this_nt =
+		new non_terminal(non_term_id.str_val, multipart_name);
+
+	      /* put it in the non_terms table */
+	      non_terms.put(non_term_id.str_val, this_nt);
+
+	      /* build a production_part and put it in the symbols table */
+	      symbols.put(non_term_id.str_val, new symbol_part(this_nt));
+	    }
+	:}
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+nt_id ::=
+	ID:the_id
+	{: RESULT.str_val = the_id.str_val; :}
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+symbol_id ::=
+	ID:the_id
+	{: RESULT.str_val = the_id.str_val; :}
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+label_id ::=
+	ID:the_id
+	{: RESULT.str_val = the_id.str_val; :}
+	;
+
+/*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . */
+
+empty ::= /* nothing */;
+
+/*----------------------------------------------------------------*/
diff --git a/jasmin/jasmin-2.4/src/java_cup/parser.java b/jasmin/jasmin-2.4/src/java_cup/parser.java
new file mode 100644
index 0000000..f3f9869
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/parser.java
@@ -0,0 +1,1131 @@
+
+//----------------------------------------------------
+// The following code was generated by Java(tm) CUP v0.9d
+// Thu Aug 10 03:51:39 MSD 2006
+//----------------------------------------------------
+
+package java_cup;
+
+import java_cup.runtime.*;
+import java.util.Hashtable;
+
+public class parser extends java_cup.runtime.lr_parser {
+
+  /** constructor */
+  public parser() {super();}
+
+  /** production table */
+  protected static final short _production_table[][] = {
+        {0, 2},     {32, 0},     {1, 10},     {1, 4},     {33, 0}, 
+        {2, 4},     {2, 1},     {3, 2},     {3, 1},     {34, 0}, 
+        {11, 4},     {4, 2},     {5, 4},     {5, 1},     {6, 4}, 
+        {6, 1},     {13, 4},     {13, 1},     {14, 4},     {14, 1}, 
+        {16, 4},     {16, 1},     {7, 2},     {7, 1},     {35, 0}, 
+        {15, 5},     {36, 0},     {15, 6},     {37, 0},     {15, 4}, 
+        {38, 0},     {15, 5},     {18, 3},     {18, 1},     {19, 3}, 
+        {19, 1},     {39, 0},     {8, 5},     {8, 1},     {9, 2}, 
+        {9, 1},     {40, 0},     {20, 5},     {41, 0},     {20, 3}, 
+        {25, 3},     {25, 1},     {26, 1},     {21, 2},     {21, 1}, 
+        {22, 2},     {22, 1},     {31, 2},     {31, 1},     {10, 3}, 
+        {10, 1},     {12, 3},     {12, 1},     {17, 1},     {23, 1}, 
+        {24, 1},     {28, 1},     {29, 1},     {30, 1},     {27, 0}
+      };
+
+  /** access to production table */
+  public short[][] production_table() {return _production_table;}
+
+  /** parse action table */
+  protected static final short[][] _action_table = {
+    /*0*/{1,3,2,-2,3,-2,5,-2,6,-2,7,-2,8,-2,9,-2,10,-2,20,-2,-1,0},
+    /*1*/{0,120,-1,0},
+    /*2*/{7,34,8,36,-1,0},
+    /*3*/{2,7,3,-65,5,-65,6,-65,7,-65,8,-65,9,-65,10,-65,20,-65,-1,0},
+    /*4*/{3,-65,5,-65,6,-65,7,-65,8,-65,9,-65,10,-65,20,-65,-1,0},
+    /*5*/{3,-7,5,-7,6,-7,7,-7,8,-7,9,-7,10,-7,20,-7,-1,0},
+    /*6*/{21,8,-1,0},
+    /*7*/{13,-56,16,-56,21,-56,-1,0},
+    /*8*/{13,-5,16,11,-1,0},
+    /*9*/{13,13,-1,0},
+    /*10*/{21,12,-1,0},
+    /*11*/{13,-55,16,-55,21,-55,-1,0},
+    /*12*/{3,-6,5,-6,6,-6,7,-6,8,-6,9,-6,10,-6,20,-6,-1,0},
+    /*13*/{3,17,5,18,6,-65,7,-65,8,-65,9,-65,10,-65,20,-65,-1,0},
+    /*14*/{3,-9,5,-9,6,-9,7,-9,8,-9,9,-9,10,-9,20,-9,-1,0},
+    /*15*/{3,-8,5,-8,6,-8,7,-8,8,-8,9,-8,10,-8,20,-8,-1,0},
+    /*16*/{21,8,-1,0},
+    /*17*/{4,108,-1,0},
+    /*18*/{6,103,7,-65,8,-65,9,-65,10,-65,20,-65,-1,0},
+    /*19*/{6,-14,7,-14,8,-14,9,-14,10,-14,20,-14,-1,0},
+    /*20*/{7,-65,8,-65,9,-65,10,-65,20,22,-1,0},
+    /*21*/{11,99,-1,0},
+    /*22*/{7,-22,8,-22,9,-22,10,-22,-1,0},
+    /*23*/{7,-65,8,-65,9,25,10,-65,-1,0},
+    /*24*/{11,96,-1,0},
+    /*25*/{7,-65,8,-65,10,29,-1,0},
+    /*26*/{7,-18,8,-18,10,-18,-1,0},
+    /*27*/{7,34,8,36,-1,0},
+    /*28*/{11,31,-1,0},
+    /*29*/{7,-20,8,-20,-1,0},
+    /*30*/{22,32,-1,0},
+    /*31*/{13,33,-1,0},
+    /*32*/{7,-19,8,-19,-1,0},
+    /*33*/{1,85,21,8,-1,0},
+    /*34*/{1,-24,7,-24,8,-24,12,-24,21,-24,-1,0},
+    /*35*/{7,72,-1,0},
+    /*36*/{1,-65,7,34,8,36,12,41,21,-65,-1,0},
+    /*37*/{1,47,21,43,-1,0},
+    /*38*/{1,-39,21,-39,-1,0},
+    /*39*/{1,-23,7,-23,8,-23,12,-23,21,-23,-1,0},
+    /*40*/{11,42,-1,0},
+    /*41*/{21,43,-1,0},
+    /*42*/{13,-62,18,-62,-1,0},
+    /*43*/{13,-37,-1,0},
+    /*44*/{13,46,-1,0},
+    /*45*/{1,-38,21,-38,-1,0},
+    /*46*/{13,-44,-1,0},
+    /*47*/{18,-42,-1,0},
+    /*48*/{0,-3,1,47,21,43,-1,0},
+    /*49*/{0,-41,1,-41,21,-41,-1,0},
+    /*50*/{0,-40,1,-40,21,-40,-1,0},
+    /*51*/{18,53,-1,0},
+    /*52*/{13,-65,19,-65,21,-65,22,-65,-1,0},
+    /*53*/{13,68,19,67,-1,0},
+    /*54*/{13,-50,19,-50,21,-50,22,-50,-1,0},
+    /*55*/{13,-48,19,-48,21,59,22,58,-1,0},
+    /*56*/{13,-47,19,-47,-1,0},
+    /*57*/{13,-52,19,-52,21,-52,22,-52,-1,0},
+    /*58*/{13,-63,17,-63,19,-63,21,-63,22,-63,-1,0},
+    /*59*/{13,-65,17,62,19,-65,21,-65,22,-65,-1,0},
+    /*60*/{13,-49,19,-49,21,-49,22,-49,-1,0},
+    /*61*/{21,65,-1,0},
+    /*62*/{13,-54,19,-54,21,-54,22,-54,-1,0},
+    /*63*/{13,-51,19,-51,21,-51,22,-51,-1,0},
+    /*64*/{13,-64,21,-64,22,-64,-1,0},
+    /*65*/{13,-53,21,-53,22,-53,-1,0},
+    /*66*/{13,-65,19,-65,21,-65,22,-65,-1,0},
+    /*67*/{0,-43,1,-43,21,-43,-1,0},
+    /*68*/{13,-46,19,-46,-1,0},
+    /*69*/{13,71,-1,0},
+    /*70*/{0,-45,1,-45,21,-45,-1,0},
+    /*71*/{1,73,21,8,-1,0},
+    /*72*/{13,-31,-1,0},
+    /*73*/{16,11,21,-59,-1,0},
+    /*74*/{21,76,-1,0},
+    /*75*/{13,-61,14,-61,-1,0},
+    /*76*/{13,-27,14,79,-1,0},
+    /*77*/{13,-36,14,-36,-1,0},
+    /*78*/{21,76,-1,0},
+    /*79*/{13,81,-1,0},
+    /*80*/{1,-28,7,-28,8,-28,12,-28,21,-28,-1,0},
+    /*81*/{13,-35,14,-35,-1,0},
+    /*82*/{13,84,-1,0},
+    /*83*/{1,-32,7,-32,8,-32,12,-32,21,-32,-1,0},
+    /*84*/{13,-29,-1,0},
+    /*85*/{21,87,-1,0},
+    /*86*/{13,-60,14,-60,-1,0},
+    /*87*/{13,-34,14,-34,-1,0},
+    /*88*/{13,-25,14,91,-1,0},
+    /*89*/{13,93,-1,0},
+    /*90*/{21,87,-1,0},
+    /*91*/{13,-33,14,-33,-1,0},
+    /*92*/{1,-26,7,-26,8,-26,12,-26,21,-26,-1,0},
+    /*93*/{13,95,-1,0},
+    /*94*/{1,-30,7,-30,8,-30,12,-30,21,-30,-1,0},
+    /*95*/{22,97,-1,0},
+    /*96*/{13,98,-1,0},
+    /*97*/{7,-17,8,-17,10,-17,-1,0},
+    /*98*/{21,8,-1,0},
+    /*99*/{13,101,16,11,-1,0},
+    /*100*/{7,-21,8,-21,9,-21,10,-21,-1,0},
+    /*101*/{7,-16,8,-16,9,-16,10,-16,20,-16,-1,0},
+    /*102*/{4,105,-1,0},
+    /*103*/{7,-12,8,-12,9,-12,10,-12,20,-12,-1,0},
+    /*104*/{22,106,-1,0},
+    /*105*/{13,107,-1,0},
+    /*106*/{7,-15,8,-15,9,-15,10,-15,20,-15,-1,0},
+    /*107*/{22,109,-1,0},
+    /*108*/{13,110,-1,0},
+    /*109*/{6,-13,7,-13,8,-13,9,-13,10,-13,20,-13,-1,0},
+    /*110*/{13,-58,16,115,-1,0},
+    /*111*/{13,-10,-1,0},
+    /*112*/{13,114,-1,0},
+    /*113*/{3,-11,5,-11,6,-11,7,-11,8,-11,9,-11,10,-11,20,-11,-1,0},
+    /*114*/{15,116,21,12,-1,0},
+    /*115*/{13,-57,-1,0},
+    /*116*/{1,-65,7,34,8,36,12,41,21,-65,-1,0},
+    /*117*/{1,47,21,43,-1,0},
+    /*118*/{0,-4,1,47,21,43,-1,0},
+    /*119*/{0,-1,-1,0},
+  };
+
+  /** access to parse action table */
+  public short[][] action_table() {return _action_table;}
+
+  /** reduce_goto table */
+  protected static final short[][] _reduce_table = {
+    /*0*/{1,1,32,3,-1,-1},
+    /*1*/{-1,-1},
+    /*2*/{7,116,15,34,-1,-1},
+    /*3*/{2,4,27,5,-1,-1},
+    /*4*/{3,13,27,14,-1,-1},
+    /*5*/{-1,-1},
+    /*6*/{10,8,-1,-1},
+    /*7*/{-1,-1},
+    /*8*/{33,9,-1,-1},
+    /*9*/{-1,-1},
+    /*10*/{-1,-1},
+    /*11*/{-1,-1},
+    /*12*/{-1,-1},
+    /*13*/{4,20,5,18,11,15,27,19,-1,-1},
+    /*14*/{-1,-1},
+    /*15*/{-1,-1},
+    /*16*/{10,110,12,111,-1,-1},
+    /*17*/{-1,-1},
+    /*18*/{6,103,27,101,-1,-1},
+    /*19*/{-1,-1},
+    /*20*/{16,23,27,22,-1,-1},
+    /*21*/{-1,-1},
+    /*22*/{-1,-1},
+    /*23*/{13,25,27,26,-1,-1},
+    /*24*/{-1,-1},
+    /*25*/{14,27,27,29,-1,-1},
+    /*26*/{-1,-1},
+    /*27*/{7,36,15,34,-1,-1},
+    /*28*/{-1,-1},
+    /*29*/{-1,-1},
+    /*30*/{-1,-1},
+    /*31*/{-1,-1},
+    /*32*/{-1,-1},
+    /*33*/{10,73,17,85,-1,-1},
+    /*34*/{-1,-1},
+    /*35*/{-1,-1},
+    /*36*/{8,37,15,39,27,38,-1,-1},
+    /*37*/{9,48,20,49,28,47,-1,-1},
+    /*38*/{-1,-1},
+    /*39*/{-1,-1},
+    /*40*/{-1,-1},
+    /*41*/{28,43,-1,-1},
+    /*42*/{-1,-1},
+    /*43*/{39,44,-1,-1},
+    /*44*/{-1,-1},
+    /*45*/{-1,-1},
+    /*46*/{41,69,-1,-1},
+    /*47*/{40,51,-1,-1},
+    /*48*/{20,50,28,47,-1,-1},
+    /*49*/{-1,-1},
+    /*50*/{-1,-1},
+    /*51*/{-1,-1},
+    /*52*/{21,55,25,53,26,56,27,54,-1,-1},
+    /*53*/{-1,-1},
+    /*54*/{-1,-1},
+    /*55*/{22,60,29,59,-1,-1},
+    /*56*/{-1,-1},
+    /*57*/{-1,-1},
+    /*58*/{-1,-1},
+    /*59*/{27,62,31,63,-1,-1},
+    /*60*/{-1,-1},
+    /*61*/{30,65,-1,-1},
+    /*62*/{-1,-1},
+    /*63*/{-1,-1},
+    /*64*/{-1,-1},
+    /*65*/{-1,-1},
+    /*66*/{21,55,26,68,27,54,-1,-1},
+    /*67*/{-1,-1},
+    /*68*/{-1,-1},
+    /*69*/{-1,-1},
+    /*70*/{-1,-1},
+    /*71*/{10,73,17,74,-1,-1},
+    /*72*/{38,82,-1,-1},
+    /*73*/{-1,-1},
+    /*74*/{19,76,24,77,-1,-1},
+    /*75*/{-1,-1},
+    /*76*/{36,79,-1,-1},
+    /*77*/{-1,-1},
+    /*78*/{24,81,-1,-1},
+    /*79*/{-1,-1},
+    /*80*/{-1,-1},
+    /*81*/{-1,-1},
+    /*82*/{-1,-1},
+    /*83*/{-1,-1},
+    /*84*/{37,93,-1,-1},
+    /*85*/{18,88,23,87,-1,-1},
+    /*86*/{-1,-1},
+    /*87*/{-1,-1},
+    /*88*/{35,89,-1,-1},
+    /*89*/{-1,-1},
+    /*90*/{23,91,-1,-1},
+    /*91*/{-1,-1},
+    /*92*/{-1,-1},
+    /*93*/{-1,-1},
+    /*94*/{-1,-1},
+    /*95*/{-1,-1},
+    /*96*/{-1,-1},
+    /*97*/{-1,-1},
+    /*98*/{10,99,-1,-1},
+    /*99*/{-1,-1},
+    /*100*/{-1,-1},
+    /*101*/{-1,-1},
+    /*102*/{-1,-1},
+    /*103*/{-1,-1},
+    /*104*/{-1,-1},
+    /*105*/{-1,-1},
+    /*106*/{-1,-1},
+    /*107*/{-1,-1},
+    /*108*/{-1,-1},
+    /*109*/{-1,-1},
+    /*110*/{-1,-1},
+    /*111*/{34,112,-1,-1},
+    /*112*/{-1,-1},
+    /*113*/{-1,-1},
+    /*114*/{-1,-1},
+    /*115*/{-1,-1},
+    /*116*/{8,117,15,39,27,38,-1,-1},
+    /*117*/{9,118,20,49,28,47,-1,-1},
+    /*118*/{20,50,28,47,-1,-1},
+    /*119*/{-1,-1},
+  };
+
+  /** access to reduce_goto table */
+  public short[][] reduce_table() {return _reduce_table;}
+
+  /** instance of action encapsulation class */
+  protected CUP$actions action_obj;
+
+  /** action encapsulation object initializer */
+  protected void init_actions()
+    {
+      action_obj = new CUP$actions();
+    }
+
+  /** invoke a user supplied parse action */
+  public java_cup.runtime.symbol do_action(
+    int                        act_num,
+    java_cup.runtime.lr_parser parser,
+    java.util.Stack            stack,
+    int                        top)
+    throws java.lang.Exception
+  {
+    /* call code in generated class */
+    return action_obj.CUP$do_action(act_num, parser, stack, top);
+  }
+
+  /** start state */
+  public int start_state() {return 0;}
+  /** start production */
+  public int start_production() {return 0;}
+
+  /** EOF symbol index */
+  public int EOF_sym() {return 0;}
+
+  /** error symbol index */
+  public int error_sym() {return 1;}
+
+
+  /** user initialization */
+  public void user_init() throws java.lang.Exception
+    {
+ lexer.init(); 
+    }
+
+  /** scan to get the next token */
+  public java_cup.runtime.token scan()
+    throws java.lang.Exception
+    {
+ return lexer.next_token(); 
+    }
+
+
+
+  /* override error routines */
+
+  public void report_fatal_error(
+    String   message,
+    Object   info)
+    {
+      done_parsing();
+      lexer.emit_error(message);
+      System.err.println("Can't recover from previous error(s), giving up.");
+      System.exit(1);
+    }
+
+    public void report_error(String message, Object info)
+    {
+      lexer.emit_error(message);
+    }
+
+};
+
+/** JavaCup generated class to encapsulate user supplied action code.*/
+class CUP$actions {
+
+
+  /** helper routine to clone a new production part adding a given label */
+  protected production_part add_lab(production_part part, String lab)
+    throws internal_error
+    {
+      /* if there is no label, or this is an action, just return the original */
+      if (lab == null || part.is_action()) return part;
+
+      /* otherwise build a new one with the given label attached */
+      return new symbol_part(((symbol_part)part).the_symbol(),lab);
+    }
+
+  /** max size of right hand side we will support */
+  protected final int MAX_RHS = 200;
+
+  /** array for accumulating right hand side parts */
+  protected production_part[] rhs_parts = new production_part[MAX_RHS];
+
+  /** where we are currently in building a right hand side */
+  protected int rhs_pos = 0;
+
+  /** start a new right hand side */
+  protected void new_rhs() {rhs_pos = 0; }
+
+  /** add a new right hand side part */
+  protected void add_rhs_part(production_part part) throws java.lang.Exception
+    {
+      if (rhs_pos >= MAX_RHS)
+	throw new Exception("Internal Error: Productions limited to " +
+			     MAX_RHS + " symbols and actions");
+
+      rhs_parts[rhs_pos] = part;
+      rhs_pos++;
+    }
+
+  /** string to build up multiple part names */
+  protected String multipart_name = new String();
+
+  /** append a new name segment to the accumulated multipart name */
+  protected void append_multipart(String name)
+    {
+      String dot = "";
+
+      /* if we aren't just starting out, put on a dot */
+      if (multipart_name.length() != 0)  dot = ".";
+
+      multipart_name = multipart_name.concat(dot + name);
+    }
+
+  /** table of declared symbols -- contains production parts indexed by name */
+  protected Hashtable symbols = new Hashtable();
+
+  /** table of just non terminals -- contains non_terminals indexed by name */
+  protected Hashtable non_terms = new Hashtable();
+
+  /** declared start non_terminal */
+  protected non_terminal start_nt = null;
+
+  /** left hand side non terminal of the current production */
+  protected non_terminal lhs_nt;
+
+
+
+  /** Constructor */
+  CUP$actions() { }
+
+  /** Method with the actual generated action code. */
+  public final java_cup.runtime.symbol CUP$do_action(
+    int                        CUP$act_num,
+    java_cup.runtime.lr_parser CUP$parser,
+    java.util.Stack            CUP$stack,
+    int                        CUP$top)
+    throws java.lang.Exception
+    {
+      /* object for return from actions */
+      java_cup.runtime.symbol CUP$result;
+
+      /* select the action based on the action number */
+      switch (CUP$act_num)
+        {
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 64: // empty ::= 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*empty*/27);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 63: // label_id ::= ID 
+            {
+              CUP$result = new java_cup.runtime.str_token(/*label_id*/30);
+               ((java_cup.runtime.str_token)CUP$result).str_val = (/*the_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 62: // symbol_id ::= ID 
+            {
+              CUP$result = new java_cup.runtime.str_token(/*symbol_id*/29);
+               ((java_cup.runtime.str_token)CUP$result).str_val = (/*the_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 61: // nt_id ::= ID 
+            {
+              CUP$result = new java_cup.runtime.str_token(/*nt_id*/28);
+               ((java_cup.runtime.str_token)CUP$result).str_val = (/*the_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 60: // new_non_term_id ::= ID 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*new_non_term_id*/24);
+              
+	  /* see if this non terminal has been declared before */
+	  if (symbols.get((/*non_term_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val) != null)
+	    {
+	      /* issue a message */
+	      lexer.emit_error( "Symbol \"" + (/*non_term_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val +
+			                      "\" has already been declared");
+	    }
+	  else
+	    {
+	      /* build the non terminal object */
+              non_terminal this_nt =
+		new non_terminal((/*non_term_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val, multipart_name);
+
+	      /* put it in the non_terms table */
+	      non_terms.put((/*non_term_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val, this_nt);
+
+	      /* build a production_part and put it in the symbols table */
+	      symbols.put((/*non_term_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val, new symbol_part(this_nt));
+	    }
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 59: // new_term_id ::= ID 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*new_term_id*/23);
+              
+	  /* see if this terminal has been declared before */
+	  if (symbols.get((/*term_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val) != null)
+	    {
+	      /* issue a message */
+	      lexer.emit_error("Symbol \"" + (/*term_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val +
+			   "\" has already been declared");
+	    }
+	  else
+	    {
+	      /* build a production_part and put it in the table */
+	      symbols.put((/*term_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val,
+	        new symbol_part(new terminal((/*term_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val, multipart_name)));
+	    }
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 58: // type_id ::= multipart_id 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*type_id*/17);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 57: // import_id ::= multipart_id 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*import_id*/12);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 56: // import_id ::= multipart_id DOT STAR 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*import_id*/12);
+               append_multipart("*"); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 55: // multipart_id ::= ID 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*multipart_id*/10);
+               append_multipart((/*an_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 54: // multipart_id ::= multipart_id DOT ID 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*multipart_id*/10);
+               append_multipart((/*another_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 53: // opt_label ::= empty 
+            {
+              CUP$result = new java_cup.runtime.str_token(/*opt_label*/31);
+               ((java_cup.runtime.str_token)CUP$result).str_val = null; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 52: // opt_label ::= COLON label_id 
+            {
+              CUP$result = new java_cup.runtime.str_token(/*opt_label*/31);
+               ((java_cup.runtime.str_token)CUP$result).str_val = (/*labid*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val; 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 51: // prod_part ::= CODE_STRING 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*prod_part*/22);
+              
+	  /* add a new production part */
+	  add_rhs_part(new action_part((/*code_str*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val));
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 50: // prod_part ::= symbol_id opt_label 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*prod_part*/22);
+              
+	  /* try to look up the id */
+	  production_part symb = (production_part)symbols.get((/*symid*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-1)).str_val);
+
+	  /* if that fails, symbol is undeclared */
+	  if (symb == null)
+	    {
+	      if (lexer.error_count == 0)
+	        lexer.emit_error("Symbol \"" + (/*symid*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-1)).str_val +
+			       "\" has not been declared");
+	    }
+	  else
+	    {
+	      /* add a labeled production part */
+	      add_rhs_part(add_lab(symb, (/*labid*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val));
+	    }
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 49: // prod_part_list ::= empty 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*prod_part_list*/21);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 48: // prod_part_list ::= prod_part_list prod_part 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*prod_part_list*/21);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 47: // rhs ::= prod_part_list 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*rhs*/26);
+              
+	  if (lhs_nt != null)
+	    {
+	      /* build the production */
+	      production p = new production(lhs_nt, rhs_parts, rhs_pos);
+
+	      /* if we have no start non-terminal declared and this is
+		 the first production, make its lhs nt the start_nt
+		 and build a special start production for it. */
+              if (start_nt == null)
+		{
+		  start_nt = lhs_nt;
+
+	          /* build a special start production */
+	          new_rhs();
+	          add_rhs_part(new symbol_part(start_nt));
+	          add_rhs_part(new symbol_part(terminal.EOF));
+	          emit.start_production =
+		     new production(non_terminal.START_nt, rhs_parts, rhs_pos);
+	          new_rhs();
+		}
+	    }
+
+	  /* reset the rhs accumulation in any case */
+	  new_rhs();
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 46: // rhs_list ::= rhs 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*rhs_list*/25);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 45: // rhs_list ::= rhs_list BAR rhs 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*rhs_list*/25);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 44: // production ::= error NT$9 SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*production*/20);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 43: // NT$9 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$9*/41);
+               lexer.emit_error("Syntax Error"); 
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 42: // production ::= nt_id NT$8 COLON_COLON_EQUALS rhs_list SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*production*/20);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 41: // NT$8 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$8*/40);
+              
+	  /* lookup the lhs nt */
+	  lhs_nt = (non_terminal)non_terms.get((/*lhs_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val);
+
+          /* if it wasn't declared, emit a message */
+	  if (lhs_nt == null)
+	    {
+	      if (lexer.error_count == 0)
+	        lexer.emit_error("LHS non terminal \"" + (/*lhs_id*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val +
+			       "\" has not been declared");
+	    }
+
+	  /* reset the rhs accumulation */
+	  new_rhs();
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 40: // production_list ::= production 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*production_list*/9);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 39: // production_list ::= production_list production 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*production_list*/9);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 38: // start_spec ::= empty 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*start_spec*/8);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 37: // start_spec ::= START WITH nt_id NT$7 SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*start_spec*/8);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 36: // NT$7 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$7*/39);
+              
+	  /* verify that the name has been declared as a non terminal */
+	  non_terminal nt = (non_terminal)non_terms.get((/*start_name*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val);
+	  if (nt == null)
+	    {
+	      lexer.emit_error( "Start non terminal \"" + (/*start_name*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-0)).str_val +
+	  		         "\" has not been declared");
+	    }
+          else
+	    {
+	      /* remember the non-terminal for later */
+	      start_nt = nt;
+
+	      /* build a special start production */
+	      new_rhs();
+	      add_rhs_part(new symbol_part(start_nt));
+	      add_rhs_part(new symbol_part(terminal.EOF));
+	      emit.start_production =
+		     new production(non_terminal.START_nt, rhs_parts, rhs_pos);
+	      new_rhs();
+	    }
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 35: // non_term_name_list ::= new_non_term_id 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*non_term_name_list*/19);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 34: // non_term_name_list ::= non_term_name_list COMMA new_non_term_id 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*non_term_name_list*/19);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 33: // term_name_list ::= new_term_id 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*term_name_list*/18);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 32: // term_name_list ::= term_name_list COMMA new_term_id 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*term_name_list*/18);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 31: // symbol ::= NON TERMINAL error NT$6 SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*symbol*/15);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 30: // NT$6 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$6*/38);
+              
+	  /* reset the accumulated multipart name */
+	  multipart_name = new String();
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 29: // symbol ::= TERMINAL error NT$5 SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*symbol*/15);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 28: // NT$5 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$5*/37);
+              
+	  /* reset the accumulated multipart name */
+	  multipart_name = new String();
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 27: // symbol ::= NON TERMINAL type_id non_term_name_list NT$4 SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*symbol*/15);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 26: // NT$4 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$4*/36);
+              
+	  /* reset the accumulated multipart name */
+	  multipart_name = new String();
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 25: // symbol ::= TERMINAL type_id term_name_list NT$3 SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*symbol*/15);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 24: // NT$3 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$3*/35);
+              
+	  /* reset the accumulated multipart name */
+	  multipart_name = new String();
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 23: // symbol_list ::= symbol 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*symbol_list*/7);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 22: // symbol_list ::= symbol_list symbol 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*symbol_list*/7);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 21: // debug_grammar ::= empty 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*debug_grammar*/16);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 20: // debug_grammar ::= DEBUG WITH multipart_id SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*debug_grammar*/16);
+              
+	  /* save the procedure name */
+          emit.debug_grammar = multipart_name;
+          /* reset the accumulated multipart name */
+          multipart_name = new String();
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 19: // scan_code ::= empty 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*scan_code*/14);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 18: // scan_code ::= SCAN WITH CODE_STRING SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*scan_code*/14);
+              
+	  /* save the user code */
+	  emit.scan_code = (/*user_code*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-1)).str_val;
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 17: // init_code ::= empty 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*init_code*/13);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 16: // init_code ::= INIT WITH CODE_STRING SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*init_code*/13);
+              
+	  /* save the user code */
+	  emit.init_code = (/*user_code*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-1)).str_val;
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 15: // parser_code_part ::= empty 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*parser_code_part*/6);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 14: // parser_code_part ::= PARSER CODE CODE_STRING SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*parser_code_part*/6);
+              
+	  /* save the user included code string */
+	  emit.parser_code = (/*user_code*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-1)).str_val;
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 13: // action_code_part ::= empty 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*action_code_part*/5);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 12: // action_code_part ::= ACTION CODE CODE_STRING SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*action_code_part*/5);
+              
+	  /* save the user included code string */
+	  emit.action_code = (/*user_code*/(java_cup.runtime.str_token)CUP$stack.elementAt(CUP$top-1)).str_val;
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 11: // code_part ::= action_code_part parser_code_part 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*code_part*/4);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 10: // import_spec ::= IMPORT import_id NT$2 SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*import_spec*/11);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 9: // NT$2 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$2*/34);
+              
+	  /* save this import on the imports list */
+	  emit.import_list.push(multipart_name);
+
+	  /* reset the accumulated multipart name */
+	  multipart_name = new String();
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 8: // import_list ::= empty 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*import_list*/3);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 7: // import_list ::= import_list import_spec 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*import_list*/3);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 6: // package_spec ::= empty 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*package_spec*/2);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 5: // package_spec ::= PACKAGE multipart_id NT$1 SEMI 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*package_spec*/2);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 4: // NT$1 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$1*/33);
+              
+	  /* save the package name */
+	  emit.package_name = multipart_name;
+
+	  /* reset the accumulated multipart name */
+	  multipart_name = new String();
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 3: // spec ::= error symbol_list start_spec production_list 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*spec*/1);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 2: // spec ::= NT$0 package_spec import_list code_part debug_grammar init_code scan_code symbol_list start_spec production_list 
+            {
+              CUP$result = new java_cup.runtime.symbol(/*spec*/1);
+              
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 1: // NT$0 ::= 
+            {
+              CUP$result = new java_cup.runtime.token(/*NT$0*/32);
+              
+          /* declare "error" as a terminal */
+          symbols.put("error", new symbol_part(terminal.error));
+
+          /* declare start non terminal */
+          non_terms.put("$START", non_terminal.START_nt);
+	
+            }
+          return CUP$result;
+
+          /*. . . . . . . . . . . . . . . . . . . .*/
+          case 0: // $START ::= spec EOF 
+            {
+              CUP$result = new java_cup.runtime.token(/*$START*/0);
+              
+            }
+          /* ACCEPT */
+          CUP$parser.done_parsing();
+          return CUP$result;
+
+          /* . . . . . .*/
+          default:
+            throw new Exception(
+               "Invalid action number found in internal parse table");
+
+        }
+    }
+};
+
diff --git a/jasmin/jasmin-2.4/src/java_cup/production.java b/jasmin/jasmin-2.4/src/java_cup/production.java
new file mode 100644
index 0000000..10578ac
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/production.java
@@ -0,0 +1,782 @@
+
+package java_cup;
+ 
+import java.util.Hashtable;
+import java.util.Enumeration;
+
+/** This class represents a production in the grammar.  It contains
+ *  a LHS non terminal, and an array of RHS symbols.  As various 
+ *  transformations are done on the RHS of the production, it may shrink.
+ *  As a result a separate length is always maintained to indicate how much
+ *  of the RHS array is still valid.<p>
+ * 
+ *  I addition to construction and manipulation operations, productions provide
+ *  methods for factoring out actions (see  remove_embedded_actions()), for
+ *  computing the nullability of the production (i.e., can it derive the empty
+ *  string, see check_nullable()), and operations for computing its first
+ *  set (i.e., the set of terminals that could appear at the beginning of some
+ *  string derived from the production, see check_first_set()).
+ * 
+ * @see     java_cup.production_part
+ * @see     java_cup.symbol_part
+ * @see     java_cup.action_part
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+
+public class production {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Full constructor.  This constructor accepts a LHS non terminal,
+   *  an array of RHS parts (including terminals, non terminals, and 
+   *  actions), and a string for a final reduce action.   It does several
+   *  manipulations in the process of  creating a production object.
+   *  After some validity checking it translates labels that appear in
+   *  actions into code for accessing objects on the runtime parse stack.
+   *  It them merges adjacent actions if they appear and moves any trailing
+   *  action into the final reduce actions string.  Next it removes any
+   *  embedded actions by factoring them out with new action productions.  
+   *  Finally it assigns a unique index to the production.<p>
+   *
+   *  Factoring out of actions is accomplished by creating new "hidden"
+   *  non terminals.  For example if the production was originally: <pre>
+   *    A ::= B {action} C D
+   *  </pre>
+   *  then it is factored into two productions:<pre>
+   *    A ::= B X C D
+   *    X ::= {action}
+   *  </pre> 
+   *  (where X is a unique new non terminal).  This has the effect of placing
+   *  all actions at the end where they can be handled as part of a reduce by
+   *  the parser.
+   */
+  public production(
+    non_terminal    lhs_sym, 
+    production_part rhs_parts[], 
+    int             rhs_l,
+    String          action_str)
+    throws internal_error
+    {
+      int         i;
+      action_part tail_action;
+
+      /* remember the length */
+      if (rhs_l >= 0)
+	_rhs_length = rhs_l;
+      else if (rhs_parts != null)
+	_rhs_length = rhs_parts.length;
+      else
+	_rhs_length = 0;
+	
+      /* make sure we have a valid left-hand-side */
+      if (lhs_sym == null) 
+	throw new internal_error(
+	  "Attempt to construct a production with a null LHS");
+
+      /* translate labels appearing in action strings */
+      action_str = translate_labels(
+			 rhs_parts, rhs_l, action_str, lhs_sym.stack_type());
+
+      /* count use of lhs */
+      lhs_sym.note_use();
+
+      /* create the part for left-hand-side */
+      _lhs = new symbol_part(lhs_sym);
+
+      /* merge adjacent actions (if any) */
+      _rhs_length = merge_adjacent_actions(rhs_parts, _rhs_length);
+
+      /* strip off any trailing action */
+      tail_action = strip_trailing_action(rhs_parts, _rhs_length);
+      if (tail_action != null) _rhs_length--;
+
+      /* allocate and copy over the right-hand-side */
+      _rhs = new production_part[_rhs_length];
+      for (i=0; i<_rhs_length; i++)
+	_rhs[i] = rhs_parts[i];
+
+      /* count use of each rhs symbol */
+      for (i=0; i<_rhs_length; i++)
+	if (!_rhs[i].is_action())
+	  ((symbol_part)_rhs[i]).the_symbol().note_use();
+
+      /* merge any trailing action with action string parameter */
+      if (action_str == null) action_str = "";
+      if (tail_action != null && tail_action.code_string() != null)
+	action_str = tail_action.code_string() + action_str;
+
+      /* stash the action */
+      _action = new action_part(action_str);
+
+      /* rewrite production to remove any embedded actions */
+      remove_embedded_actions();
+
+      /* assign an index */
+      _index = next_index++;
+
+      /* put us in the global collection of productions */
+      _all.put(new Integer(_index),this);
+
+      /* put us in the production list of the lhs non terminal */
+      lhs_sym.add_production(this);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constructor with no action string. */
+  public production(
+    non_terminal    lhs_sym, 
+    production_part rhs_parts[], 
+    int             rhs_l)
+    throws internal_error
+    {
+      this(lhs_sym,rhs_parts,rhs_l,null);
+    }
+ 
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Static (Class) Variables ------------------*/
+  /*-----------------------------------------------------------*/
+ 
+  /** Table of all productions.  Elements are stored using their index as 
+   *  the key.
+   */
+  protected static Hashtable _all = new Hashtable();
+ 
+  /** Access to all productions. */
+  public static Enumeration all() {return _all.elements();};
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+ 
+  /** Total number of productions. */
+  public static int number() {return _all.size();};
+
+  /** Static counter for assigning unique index numbers. */
+  protected static int next_index;
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** The left hand side non-terminal. */
+  protected symbol_part _lhs;
+
+  /** The left hand side non-terminal. */
+  public symbol_part lhs() {return _lhs;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** A collection of parts for the right hand side. */
+  protected production_part _rhs[];
+
+  /** Access to the collection of parts for the right hand side. */
+  public production_part rhs(int indx) throws internal_error
+    {
+      if (indx >= 0 && indx < _rhs_length)
+	return _rhs[indx];
+      else
+	throw new internal_error(
+	  "Index out of range for right hand side of production");
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** How much of the right hand side array we are presently using. */
+  protected int _rhs_length;
+
+  /** How much of the right hand side array we are presently using. */
+  public int rhs_length() {return _rhs_length;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** An action_part containing code for the action to be performed when we 
+   *  reduce with this production. 
+   */
+  protected action_part _action;
+
+  /** An action_part containing code for the action to be performed when we 
+   *  reduce with this production. 
+   */
+  public action_part action() {return _action;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Index number of the production. */
+  protected int _index;
+
+  /** Index number of the production. */
+  public int index() {return _index;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Count of number of reductions using this production. */
+  protected int _num_reductions = 0;
+
+  /** Count of number of reductions using this production. */
+  public int num_reductions() {return _num_reductions;}
+
+  /** Increment the count of reductions with this non-terminal */
+  public void note_reduction_use() {_num_reductions++;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Is the nullability of the production known or unknown? */
+  protected boolean _nullable_known = false;
+
+  /** Is the nullability of the production known or unknown? */
+  public boolean nullable_known() {return _nullable_known;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Nullability of the production (can it derive the empty string). */
+  protected boolean _nullable = false;
+
+  /** Nullability of the production (can it derive the empty string). */
+  public boolean nullable() {return _nullable;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** First set of the production.  This is the set of terminals that 
+   *  could appear at the front of some string derived from this production.
+   */
+  protected terminal_set _first_set = new terminal_set();
+
+  /** First set of the production.  This is the set of terminals that 
+   *  could appear at the front of some string derived from this production.
+   */
+  public terminal_set first_set() {return _first_set;}
+
+  /*-----------------------------------------------------------*/
+  /*--- Static Methods ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Determine if a given character can be a label id starter. 
+   * @param c the character in question. 
+   */
+  protected static boolean is_id_start(char c)
+    {
+      return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || (c == '_');
+
+      //later need to handle non-8-bit chars here
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if a character can be in a label id. 
+   * @param c the character in question.
+   */
+  protected static boolean is_id_char(char c)
+    {
+      return is_id_start(c) || (c >= '0' && c <= '9');
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Determine the translation for one label id found within a code_string. 
+   *  Symbols appearing in the RHS correspond to objects found on the parse
+   *  stack at runtime.  The code to access them, becomes code to access an
+   *  object at the appropriate offset from the top of the stack, and then
+   *  cast that to the proper type.
+   *
+   * @param id_str    the name of the id to be translated.
+   * @param act_pos   the original position of the action it appears in.
+   * @param label_map a hash table mapping labels to positions in the RHS.
+   * @param type_map  a hash table mapping labels to declared symbol types.
+   */
+  protected String label_translate(
+    String    id_str,     /* the id string we are (possibly) translating */
+    int       act_pos,    /* position of the action                      */
+    Hashtable label_map,  /* map from labels to positions in the RHS     */
+    Hashtable label_types)/* map from labels to stack types              */
+    {
+      Integer label_pos;
+      String  label_type;
+      int     offset;
+
+      /* look up the id */
+      label_pos  = (Integer)label_map.get(id_str);
+
+      /* if we don't find it, just return the id */
+      if (label_pos == null) return id_str;
+
+      /* extract the type of the labeled symbol */
+      label_type = (String)label_types.get(id_str);
+
+      /* is this for the LHS? */
+      if (label_pos.intValue() == -1)
+        {
+	  /* return the result object cast properly */
+	  return "((" + label_type + ")" + emit.pre("result") + ")";
+         }
+
+       /* its a RHS label */
+
+       /* if the label appears after the action, we have an error */
+       if (label_pos.intValue() > act_pos)
+         {
+	   /* emit an error message */
+	   System.err.println("*** Label \"" + id_str + 
+	     "\" appears in action before it appears in production");
+	    lexer.error_count++;
+
+	    // later need to print the production this is in
+    
+	    /* just return the id unchanged */
+	      return id_str;
+	  }
+
+      /* calculate the stack offset as the difference in position from 
+	 label to action minus one */
+      offset = (act_pos - label_pos.intValue())-1;
+
+      /* translation is properly cast element at that offset from TOS */
+      return "(/*"+id_str+"*/("+label_type+")" + 
+       emit.pre("stack") + ".elementAt(" + emit.pre("top") +"-"+ offset + "))";
+   
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Translate all the label names within an action string to appropriate code.
+   * @param act_string  the string to be translated
+   * @param act_pos     the position that the action originally held in the 
+   *                    production.
+   * @param label_map   a hash table mapping labels to positions in the RHS.
+   * @param type_map    a hash table mapping labels to declared symbol types.
+   */
+  protected String action_translate(
+    String    act_string,  /* the action string                     */
+    int       act_pos,     /* the position of the action on the RHS */
+    Hashtable label_map,   /* map from labels to RHS positions      */
+    Hashtable label_types) /* map from labels to symbol stack types */
+    {
+      int          id_start;
+      int          pos;
+      int          len;
+      String       id_str;
+      boolean      in_id;
+      StringBuffer result;
+      char         buffer[];
+
+      /* if we have no string we are done */
+      if (act_string == null || act_string.length()== 0) return act_string;
+
+      len = act_string.length();
+
+      /* set up a place to put the result */
+      result = new StringBuffer(len + 50);
+
+      /* extract string into array */
+      buffer = new char[len + 1];
+      act_string.getChars(0, len, buffer, 0);
+
+      /* put terminator in buffer so we can look one past the end */
+      buffer[len] = '\0';
+
+      /* walk down the input buffer looking for identifiers */
+      in_id = false;
+      for (pos = id_start = 0; pos <= len; pos++)
+	{
+	  /* are we currently working on an id? */
+	  if (in_id)
+	    {
+	      /* does this end the id? */
+	      if (!is_id_char(buffer[pos]))
+		{
+		  /* extract the id string and translate it */
+		  id_str = new String(buffer, id_start, pos - id_start);
+		  result.append(
+		      label_translate(id_str, act_pos, label_map,label_types));
+
+		  /* copy over the ending character */
+		  if (buffer[pos] != '\0')
+	            result.append(buffer, pos, 1);
+
+		  /* and we are done with this id */
+		  in_id = false;
+		}
+	      else
+		{
+		  /* we are still in the id, so just keep going */
+		}
+	    }
+	  else /* we are not inside an id */
+	    {
+	      /* start a new id? */
+	      if (is_id_start(buffer[pos]))
+	        {
+		  /* start keeping these chars as an id */
+	          in_id = true;
+	          id_start = pos;
+	        }
+	     else
+	       {
+	         /* just copy over the char */
+		 if (buffer[pos] != '\0')
+	           result.append(buffer, pos, 1);
+	       }
+	    }
+	}
+
+      /* return the accumulated result */
+      return result.toString();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Translate label names to appropriate code within all action strings. 
+   * @param rhs          array of RHS parts.
+   * @param rhs_len      how much of rhs to consider valid.
+   * @param final_action the final action string of the production. 
+   * @param lhs_type     the object type associated with the LHS symbol.
+   */ 
+  protected String translate_labels(
+    production_part  rhs[], 
+    int              rhs_len, 
+    String           final_action,
+    String           lhs_type)
+    {
+      Hashtable   label_map   = new Hashtable(11);
+      Hashtable   label_types = new Hashtable(11);
+      symbol_part part;
+      action_part act_part;
+      int         pos;
+
+      /* walk down the parts and extract the labels */
+      for (pos = 0; pos < rhs_len; pos++)
+	{
+	  if (!rhs[pos].is_action())
+	    {
+	      part = (symbol_part)rhs[pos];
+
+	      /* if it has a label enter it in the tables */
+	      if (part.label() != null)
+		{
+		  label_map.put(part.label(), new Integer(pos));
+		  label_types.put(part.label(), part.the_symbol().stack_type());
+		}
+	    }
+	}
+
+      /* add a label for the LHS */
+      label_map.put("RESULT", new Integer(-1));
+      label_types.put("RESULT", lhs_type);
+
+      /* now walk across and do each action string */
+      for (pos = 0; pos < rhs_len; pos++)
+	{
+	  if (rhs[pos].is_action())
+	    {
+	       act_part = (action_part)rhs[pos];
+	       act_part.set_code_string(
+		 action_translate(
+		   act_part.code_string(), pos, label_map, label_types));
+	    }
+	}
+
+      /* now do the final action string at the position after the last */
+      return action_translate(final_action, rhs_len, label_map, label_types);
+
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Helper routine to merge adjacent actions in a set of RHS parts 
+   * @param rhs_parts array of RHS parts.
+   * @param len       amount of that array that is valid.
+   * @return          remaining valid length.
+   */
+  protected int merge_adjacent_actions(production_part rhs_parts[], int len)
+    {
+      int from_loc, to_loc, merge_cnt;
+
+      /* bail out early if we have no work to do */
+      if (rhs_parts == null || len == 0) return 0;
+
+      merge_cnt = 0;
+      to_loc = -1;
+      for (from_loc=0; from_loc<len; from_loc++)
+	{
+	  /* do we go in the current position or one further */
+	  if (to_loc < 0 || !rhs_parts[to_loc].is_action() 
+			 || !rhs_parts[from_loc].is_action())
+	    {
+	      /* next one */
+	      to_loc++;
+
+	      /* clear the way for it */
+	      if (to_loc != from_loc) rhs_parts[to_loc] = null;
+	    }
+
+	  /* if this is not trivial? */
+	  if (to_loc != from_loc)
+	    {
+	      /* do we merge or copy? */
+	      if (rhs_parts[to_loc] != null && rhs_parts[to_loc].is_action() && 
+		  rhs_parts[from_loc].is_action())
+	      {
+	        /* merge */
+	        rhs_parts[to_loc] = new action_part(
+		  ((action_part)rhs_parts[to_loc]).code_string() +
+		  ((action_part)rhs_parts[from_loc]).code_string());
+	        merge_cnt++;
+	      }
+	    else
+	      {
+	        /* copy */
+	        rhs_parts[to_loc] = rhs_parts[from_loc];
+	      }
+	    }
+	}
+
+      /* return the used length */
+      return len - merge_cnt;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Helper routine to strip a trailing action off rhs and return it
+   * @param rhs_parts array of RHS parts.
+   * @param len       how many of those are valid.
+   * @return          the removed action part.
+   */
+  protected action_part strip_trailing_action(
+    production_part rhs_parts[],
+    int             len)
+    {
+      action_part result;
+
+      /* bail out early if we have nothing to do */
+      if (rhs_parts == null || len == 0) return null;
+
+      /* see if we have a trailing action */
+      if (rhs_parts[len-1].is_action())
+	{
+	  /* snip it out and return it */
+	  result = (action_part)rhs_parts[len-1];
+	  rhs_parts[len-1] = null;
+	  return result;
+	}
+      else
+	return null;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Remove all embedded actions from a production by factoring them 
+   *  out into individual action production using new non terminals.
+   *  if the original production was:  <pre>
+   *    A ::= B {action1} C {action2} D 
+   *  </pre>
+   *  then it will be factored into: <pre>
+   *    A ::= B NT$1 C NT$2 D
+   *    NT$1 ::= {action1}
+   *    NT$2 ::= {action2}
+   *  </pre>
+   *  where NT$1 and NT$2 are new system created non terminals.
+   */
+  protected void remove_embedded_actions() throws internal_error
+    {
+      non_terminal new_nt;
+      production   new_prod;
+
+      /* walk over the production and process each action */
+      for (int act_loc = 0; act_loc < rhs_length(); act_loc++)
+	if (rhs(act_loc).is_action())
+	  {
+	    /* create a new non terminal for the action production */
+	    new_nt = non_terminal.create_new();
+
+	    /* create a new production with just the action */
+	    new_prod = new action_production(this, new_nt, null, 0, 
+			((action_part)rhs(act_loc)).code_string());
+
+	    /* replace the action with the generated non terminal */
+	    _rhs[act_loc] = new symbol_part(new_nt);
+	  }
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Check to see if the production (now) appears to be nullable.
+   *  A production is nullable if its RHS could derive the empty string.
+   *  This results when the RHS is empty or contains only non terminals
+   *  which themselves are nullable.
+   */
+  public boolean check_nullable() throws internal_error
+    {
+      production_part part;
+      symbol          sym;
+      int             pos;
+
+      /* if we already know bail out early */
+      if (nullable_known()) return nullable();
+
+      /* if we have a zero size RHS we are directly nullable */
+      if (rhs_length() == 0)
+	{
+	  /* stash and return the result */
+	  return set_nullable(true);
+	}
+
+      /* otherwise we need to test all of our parts */
+      for (pos=0; pos<rhs_length(); pos++)
+	{
+	  part = rhs(pos);
+
+	  /* only look at non-actions */
+	  if (!part.is_action())
+	    {
+	      sym = ((symbol_part)part).the_symbol();
+
+	      /* if its a terminal we are definitely not nullable */
+	      if (!sym.is_non_term()) 
+		return set_nullable(false);
+	      /* its a non-term, is it marked nullable */
+	      else if (!((non_terminal)sym).nullable())
+		/* this one not (yet) nullable, so we aren't */
+	        return false;
+	    }
+	}
+
+      /* if we make it here all parts are nullable */
+      return set_nullable(true);
+    }
+
+  /** set (and return) nullability */
+  boolean set_nullable(boolean v)
+    {
+      _nullable_known = true;
+      _nullable = v;
+      return v;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Update (and return) the first set based on current NT firsts. 
+   *  This assumes that nullability has already been computed for all non 
+   *  terminals and productions. 
+   */
+  public terminal_set check_first_set() throws internal_error
+    {
+      int    part;
+      symbol sym;
+
+      /* walk down the right hand side till we get past all nullables */
+      for (part=0; part<rhs_length(); part++)
+	{
+	  /* only look at non-actions */
+	  if (!rhs(part).is_action())
+	    {
+	      sym = ((symbol_part)rhs(part)).the_symbol();
+
+	      /* is it a non-terminal?*/
+	      if (sym.is_non_term())
+		{
+		  /* add in current firsts from that NT */
+		  _first_set.add(((non_terminal)sym).first_set());
+
+		  /* if its not nullable, we are done */
+		  if (!((non_terminal)sym).nullable())
+		    break;
+		}
+	      else
+		{
+	          /* its a terminal -- add that to the set */
+		  _first_set.add((terminal)sym);
+
+		  /* we are done */
+		  break;
+		}
+	    }
+	}
+
+      /* return our updated first set */
+      return first_set();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality comparison. */
+  public boolean equals(production other)
+    {
+      if (other == null) return false;
+      return other._index == _index;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality comparison. */
+  public boolean equals(Object other)
+    {
+      if (!(other instanceof production))
+	return false;
+      else
+	return equals((production)other);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce a hash code. */
+  public int hashCode()
+    {
+      /* just use a simple function of the index */
+      return _index*13;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to a string. */
+  public String toString() 
+    {
+      String result;
+      
+      /* catch any internal errors */
+      try {
+        result = "production [" + index() + "]: "; 
+        result += ((lhs() != null) ? lhs().toString() : "$$NULL-LHS$$");
+        result += " :: = ";
+        for (int i = 0; i<rhs_length(); i++)
+	  result += rhs(i) + " ";
+        result += ";";
+        if (action()  != null && action().code_string() != null) 
+	  result += " {" + action().code_string() + "}";
+
+        if (nullable_known())
+	  if (nullable())
+	    result += "[NULLABLE]";
+	  else
+	    result += "[NOT NULLABLE]";
+      } catch (internal_error e) {
+	/* crash on internal error since we can't throw it from here (because
+	   superclass does not throw anything. */
+	e.crash();
+	result = null;
+      }
+
+      return result;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to a simpler string. */
+  public String to_simple_string() throws internal_error
+    {
+      String result;
+
+      result = ((lhs() != null) ? lhs().the_symbol().name() : "NULL_LHS");
+      result += " ::= ";
+      for (int i = 0; i < rhs_length(); i++)
+	if (!rhs(i).is_action())
+	  result += ((symbol_part)rhs(i)).the_symbol().name() + " ";
+
+      return result;
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/production_part.java b/jasmin/jasmin-2.4/src/java_cup/production_part.java
new file mode 100644
index 0000000..254947e
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/production_part.java
@@ -0,0 +1,94 @@
+package java_cup;
+
+/** This class represents one part (either a symbol or an action) of a 
+ *  production.  In this base class it contains only an optional label 
+ *  string that the user can use to refer to the part within actions.<p>
+ *
+ *  This is an abstract class.
+ *
+ * @see     java_cup.production
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public abstract class production_part {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+       
+  /** Simple constructor. */
+  public production_part(String lab)
+    {
+      _label = lab;
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+       
+  /** Optional label for referring to the part within an action (null for 
+   *  no label). 
+   */
+  protected String _label;
+
+  /** Optional label for referring to the part within an action (null for 
+   *  no label). 
+   */
+  public String label() {return _label;}
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+       
+  /** Indicate if this is an action (rather than a symbol).  Here in the 
+   * base class, we don't this know yet, so its an abstract method.
+   */
+  public abstract boolean is_action();
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality comparison. */
+  public boolean equals(production_part other)
+    {
+      if (other == null) return false;
+
+      /* compare the labels */
+      if (label() != null)
+	return label().equals(other.label());
+      else
+	return other.label() == null;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality comparison. */
+  public boolean equals(Object other)
+    {
+      if (!(other instanceof production_part))
+        return false;
+      else
+	return equals((production_part)other);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce a hash code. */
+  public int hashCode()
+    {
+      return label()==null ? 0 : label().hashCode();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to a string. */
+  public String toString()
+    {
+      if (label() != null)
+	return label() + ":";
+      else
+	return " ";
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/reduce_action.java b/jasmin/jasmin-2.4/src/java_cup/reduce_action.java
new file mode 100644
index 0000000..e259a4d
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/reduce_action.java
@@ -0,0 +1,84 @@
+
+package java_cup;
+
+/** This class represents a reduce action within the parse table. 
+ *  The action simply stores the production that it reduces with and 
+ *  responds to queries about its type.
+ *
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public class reduce_action extends parse_action {
+ 
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Simple constructor. 
+   * @param prod the production this action reduces with.
+   */
+  public reduce_action(production prod ) throws internal_error
+    {
+      /* sanity check */
+      if (prod == null)
+	throw new internal_error(
+	  "Attempt to create a reduce_action with a null production");
+
+      _reduce_with = prod;
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+  
+  /** The production we reduce with. */
+  protected production _reduce_with;
+
+  /** The production we reduce with. */
+  public production reduce_with() {return _reduce_with;}
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Quick access to type of action. */
+  public int kind() {return REDUCE;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality test. */
+  public boolean equals(reduce_action other)
+    {
+      return other != null && other.reduce_with() == reduce_with();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality test. */
+  public boolean equals(Object other)
+    {
+      if (other instanceof reduce_action)
+	return equals((reduce_action)other);
+      else
+       return false;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Compute a hash code. */
+  public int hashCode()
+    {
+      /* use the hash code of the production we are reducing with */
+      return reduce_with().hashCode();
+    }
+
+
+  /** Convert to string. */
+  public String toString() 
+    {
+      return "REDUCE(" + reduce_with().index() + ")";
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/runtime/char_token.java b/jasmin/jasmin-2.4/src/java_cup/runtime/char_token.java
new file mode 100644
index 0000000..2283fa0
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/runtime/char_token.java
@@ -0,0 +1,32 @@
+
+package java_cup.runtime;
+
+/** This subclass of token represents symbols that need to maintain one
+ *  char value as an attribute.  It maintains that value in the public
+ *  field int_val.
+ *
+ * @see java_cup.runtime.str_token
+ * @version last updated: 1/7/96
+ * @author  Scott Hudson
+ */
+
+public class char_token extends token {
+
+  /** Full constructor. */
+  public char_token(int term_num, char v)
+    {
+      /* super class does most of the work */
+      super(term_num);
+
+      char_val = v;
+    }
+
+  /** Constructor with default value of 0 */
+  public char_token(int term_num)
+    {
+      this(term_num, '\0');
+    }
+
+  /** The stored char value. */
+  public char char_val;
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/runtime/double_token.java b/jasmin/jasmin-2.4/src/java_cup/runtime/double_token.java
new file mode 100644
index 0000000..ea55919
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/runtime/double_token.java
@@ -0,0 +1,32 @@
+
+package java_cup.runtime;
+
+/** This subclass of token represents symbols that need to maintain one
+ *  double value as an attribute.  It maintains that value in the public
+ *  field int_val.
+ *
+ * @see java_cup.runtime.str_token
+ * @version last updated: 1/7/96
+ * @author  Scott Hudson
+ */
+
+public class double_token extends token {
+
+  /** Full constructor. */
+  public double_token(int term_num, double v)
+    {
+      /* super class does most of the work */
+      super(term_num);
+
+      double_val = v;
+    }
+
+  /** Constructor with default value of 0.0. */
+  public double_token(int term_num)
+    {
+      this(term_num,0.0f);
+    }
+
+  /** The stored double value. */
+  public double double_val;
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/runtime/float_token.java b/jasmin/jasmin-2.4/src/java_cup/runtime/float_token.java
new file mode 100644
index 0000000..97f7983
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/runtime/float_token.java
@@ -0,0 +1,32 @@
+
+package java_cup.runtime;
+
+/** This subclass of token represents symbols that need to maintain one
+ *  float value as an attribute.  It maintains that value in the public
+ *  field int_val.
+ *
+ * @see java_cup.runtime.str_token
+ * @version last updated: 1/7/96
+ * @author  Scott Hudson
+ */
+
+public class float_token extends token {
+
+  /** Full constructor. */
+  public float_token(int term_num, float v)
+    {
+      /* super class does most of the work */
+      super(term_num);
+
+      float_val = v;
+    }
+
+  /** Constructor with default value of 0.0. */
+  public float_token(int term_num)
+    {
+      this(term_num,0.0f);
+    }
+
+  /** The stored float value. */
+  public float float_val;
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/runtime/int_token.java b/jasmin/jasmin-2.4/src/java_cup/runtime/int_token.java
new file mode 100644
index 0000000..4cbbbd2
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/runtime/int_token.java
@@ -0,0 +1,32 @@
+
+package java_cup.runtime;
+
+/** This subclass of token represents symbols that need to maintain one
+ *  int value as an attribute.  It maintains that value in the public
+ *  field int_val.
+ *
+ * @see java_cup.runtime.str_token
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+
+public class int_token extends token {
+
+  /** Full constructor. */
+  public int_token(int term_num, int iv)
+    {
+      /* super class does most of the work */
+      super(term_num);
+
+      int_val = iv;
+    }
+
+  /** Constructor with default value of 0. */
+  public int_token(int term_num)
+    {
+      this(term_num,0);
+    }
+
+  /** The stored int value. */
+  public int int_val;
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/runtime/long_token.java b/jasmin/jasmin-2.4/src/java_cup/runtime/long_token.java
new file mode 100644
index 0000000..62e09a2
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/runtime/long_token.java
@@ -0,0 +1,32 @@
+
+package java_cup.runtime;
+
+/** This subclass of token represents symbols that need to maintain one
+ *  long value as an attribute.  It maintains that value in the public
+ *  field int_val.
+ *
+ * @see java_cup.runtime.str_token
+ * @version last updated: 1/7/96
+ * @author  Scott Hudson
+ */
+
+public class long_token extends token {
+
+  /** Full constructor. */
+  public long_token(int term_num, long lv)
+    {
+      /* super class does most of the work */
+      super(term_num);
+
+      long_val = lv;
+    }
+
+  /** Constructor with default value of 0. */
+  public long_token(int term_num)
+    {
+      this(term_num,0);
+    }
+
+  /** The stored long value. */
+  public long long_val;
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/runtime/lr_parser.java b/jasmin/jasmin-2.4/src/java_cup/runtime/lr_parser.java
new file mode 100644
index 0000000..04bfd02
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/runtime/lr_parser.java
@@ -0,0 +1,1121 @@
+
+package java_cup.runtime;
+
+import java.util.Stack;
+
+/** This class implements a skeleton table driven LR parser.  In general,
+ *  LR parsers are a form of bottom up shift-reduce parsers.  Shift-reduce
+ *  parsers act by shifting input onto a parse stack until the symbols 
+ *  matching the right hand side of a production appear on the top of the 
+ *  stack.  Once this occurs, a reduce is performed.  This involves removing
+ *  the symbols corresponding to the right hand side of the production
+ *  (the so called "handle") and replacing them with the non-terminal from
+ *  the left hand side of the production.  <p>
+ *
+ *  To control the decision of whether to shift or reduce at any given point, 
+ *  the parser uses a state machine (the "viable prefix recognition machine" 
+ *  built by the parser generator).  The current state of the machine is placed
+ *  on top of the parse stack (stored as part of a symbol object representing
+ *  a terminal or non terminal).  The parse action table is consulted 
+ *  (using the current state and the current lookahead token as indexes) to 
+ *  determine whether to shift or to reduce.  When the parser shifts, it 
+ *  changes to a new state by pushing a new symbol (containing a new state) 
+ *  onto the stack.  When the parser reduces, it pops the handle (right hand 
+ *  side of a production) off the stack.  This leaves the parser in the state 
+ *  it was in before any of those symbols were matched.  Next the reduce-goto 
+ *  table is consulted (using the new state and current lookahead token as 
+ *  indexes) to determine a new state to go to.  The parser then shifts to 
+ *  this goto state by pushing the left hand side symbol of the production 
+ *  (also containing the new state) onto the stack.<p>
+ *
+ *  This class actually provides four LR parsers.  The methods parse() and 
+ *  debug_parse() provide two versions of the main parser (the only difference 
+ *  being that debug_parse() emits debugging trace messages as it parses).  
+ *  In addition to these main parsers, the error recovery mechanism uses two 
+ *  more.  One of these is used to simulate "parsing ahead" in the input 
+ *  without carrying out actions (to verify that a potential error recovery 
+ *  has worked), and the other is used to parse through buffered "parse ahead" 
+ *  input in order to execute all actions and re-synchronize the actual parser 
+ *  configuration.<p>
+ *
+ *  This is an abstract class which is normally filled out by a subclass
+ *  generated by the JavaCup parser generator.  In addition to supplying
+ *  the actual parse tables, generated code also supplies methods which 
+ *  invoke various pieces of user supplied code, provide access to certain
+ *  special symbols (e.g., EOF and error), etc.  Specifically, the following
+ *  abstract methods are normally supplied by generated code:
+ *  <dl compact>
+ *  <dt> short[][] production_table()
+ *  <dd> Provides a reference to the production table (indicating the index of
+ *       the left hand side non terminal and the length of the right hand side
+ *       for each production in the grammar).
+ *  <dt> short[][] action_table()
+ *  <dd> Provides a reference to the parse action table.
+ *  <dt> short[][] reduce_table()
+ *  <dd> Provides a reference to the reduce-goto table.
+ *  <dt> int start_state()      
+ *  <dd> Indicates the index of the start state.
+ *  <dt> int start_production() 
+ *  <dd> Indicates the index of the starting production.
+ *  <dt> int EOF_sym() 
+ *  <dd> Indicates the index of the EOF symbol.
+ *  <dt> int error_sym() 
+ *  <dd> Indicates the index of the error symbol.
+ *  <dt> symbol do_action() 
+ *  <dd> Executes a piece of user supplied action code.  This always comes at 
+ *       the point of a reduce in the parse, so this code also allocates and 
+ *       fills in the left hand side non terminal symbol object that is to be 
+ *       pushed onto the stack for the reduce.
+ *  <dt> void init_actions()
+ *  <dd> Code to initialize a special object that encapsulates user supplied
+ *       actions (this object is used by do_action() to actually carry out the 
+ *       actions).
+ *  <dt> token scan()
+ *  <dd> Used to get the next input token from the scanner.
+ *  </dl>
+ *  
+ *  In addition to these routines that <i>must</i> be supplied by the 
+ *  generated subclass there are also a series of routines that <i>may</i> 
+ *  be supplied.  These include:
+ *  <dl>
+ *  <dt> int error_sync_size()
+ *  <dd> This determines how many tokens past the point of an error 
+ *       must be parsed without error in order to consider a recovery to 
+ *       be valid.  This defaults to 3.  Values less than 2 are not 
+ *       recommended.
+ *  <dt> void report_error(String message, Object info)
+ *  <dd> This method is called to report an error.  The default implementation
+ *       simply prints a message to System.err and ignores its second parameter.
+ *       This method is often replaced in order to provide a more sophisticated
+ *       error reporting mechanism.
+ *  <dt> void report_fatal_error(String message, Object info)
+ *  <dd> This method is called when a fatal error that cannot be recovered from
+ *       is encountered.  In the default implementation, it calls 
+ *       report_error() to emit a message, then throws an exception.
+ *  <dt> void syntax_error(token cur_token)
+ *  <dd> This method is called as soon as syntax error is detected (but
+ *       before recovery is attempted).  In the default implementation it 
+ *       invokes: report_error("Syntax error", null);
+ *  <dt> void unrecovered_syntax_error(token cur_token)
+ *  <dd> This method is called if syntax error recovery fails.  In the default
+ *       implementation it invokes:<br> 
+ *         report_fatal_error("Couldn't repair and continue parse", null);
+ *  </dl>
+ *
+ * @see     java_cup.runtime.symbol
+ * @see     java_cup.runtime.token
+ * @see     java_cup.runtime.virtual_parse_stack
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+
+public abstract class lr_parser {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Simple constructor. */
+  public lr_parser()
+    {
+      /* nothing to do here */
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Static (Class) Variables ------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** The default number of tokens after an error we much match to consider 
+   *  it recovered from. 
+   */
+  protected final static int _error_sync_size = 3;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The number of tokens after an error we much match to consider it 
+   *  recovered from. 
+   */
+  protected int error_sync_size() {return _error_sync_size; }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Table of production information (supplied by generated subclass).
+   *  This table contains one entry per production and is indexed by 
+   *  the negative-encoded values (reduce actions) in the action_table.  
+   *  Each entry has two parts, the index of the non-terminal on the 
+   *  left hand side of the production, and the number of symbols 
+   *  on the right hand side. 
+   */
+  public abstract short[][] production_table();
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The action table (supplied by generated subclass).  This table is
+   *  indexed by state and terminal number indicating what action is to
+   *  be taken when the parser is in the given state (i.e., the given state 
+   *  is on top of the stack) and the given terminal is next on the input.  
+   *  States are indexed using the first dimension, however, the entries for 
+   *  a given state are compacted and stored in adjacent index, value pairs 
+   *  which are searched for rather than accessed directly (see get_action()).  
+   *  The actions stored in the table will be either shifts, reduces, or 
+   *  errors.  Shifts are encoded as positive values (one greater than the 
+   *  state shifted to).  Reduces are encoded as negative values (one less 
+   *  than the production reduced by).  Error entries are denoted by zero. 
+   * 
+   * @see java_cup.runtime.lr_parser#get_action
+   */
+  public abstract short[][] action_table();
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The reduce-goto table (supplied by generated subclass).  This
+   *  table is indexed by state and non-terminal number and contains
+   *  state numbers.  States are indexed using the first dimension, however,
+   *  the entries for a given state are compacted and stored in adjacent
+   *  index, value pairs which are searched for rather than accessed 
+   *  directly (see get_reduce()).  When a reduce occurs, the handle 
+   *  (corresponding to the RHS of the matched production) is popped off 
+   *  the stack.  The new top of stack indicates a state.  This table is 
+   *  then indexed by that state and the LHS of the reducing production to 
+   *  indicate where to "shift" to. 
+   *
+   * @see java_cup.runtime.lr_parser#get_reduce
+   */
+  public abstract short[][] reduce_table();
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The index of the start state (supplied by generated subclass). */
+  public abstract int start_state();
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The index of the start production (supplied by generated subclass). */
+  public abstract int start_production();
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The index of the end of file terminal symbol (supplied by generated 
+   *  subclass). 
+   */
+  public abstract int EOF_sym();
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The index of the special error symbol (supplied by generated subclass). */
+  public abstract int error_sym();
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Internal flag to indicate when parser should quit. */
+  protected boolean _done_parsing = false;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** This method is called to indicate that the parser should quit.  This is 
+   *  normally called by an accept action, but can be used to cancel parsing 
+   *  early in other circumstances if desired. 
+   */
+  public void done_parsing()
+    {
+      _done_parsing = true;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+  /* Global parse state shared by parse(), error recovery, and 
+   * debugging routines */
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Indication of the index for top of stack (for use by actions). */
+  protected int tos;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The current lookahead token. */
+  protected token cur_token;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The parse stack itself. */
+  protected Stack stack = new Stack();
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Direct reference to the production table. */ 
+  protected short[][] production_tab;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Direct reference to the action table. */
+  protected short[][] action_tab;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Direct reference to the reduce-goto table. */
+  protected short[][] reduce_tab;
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Perform a bit of user supplied action code (supplied by generated 
+   *  subclass).  Actions are indexed by an internal action number assigned
+   *  at parser generation time.
+   *
+   * @param act_num   the internal index of the action to be performed.
+   * @param parser    the parser object we are acting for.
+   * @param stack     the parse stack of that object.
+   * @param top       the index of the top element of the parse stack.
+   */
+  public abstract symbol do_action(
+    int       act_num, 
+    lr_parser parser, 
+    Stack     stack, 
+    int       top) 
+    throws java.lang.Exception;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** User code for initialization inside the parser.  Typically this 
+   *  initializes the scanner.  This is called before the parser requests
+   *  the first token.  Here this is just a placeholder for subclasses that 
+   *  might need this and we perform no action.   This method is normally
+   *  overridden by the generated code using this contents of the "init with"
+   *  clause as its body.
+   */
+  public void user_init() throws java.lang.Exception { }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Initialize the action object.  This is called before the parser does
+   *  any parse actions. This is filled in by generated code to create
+   *  an object that encapsulates all action code. 
+   */ 
+  protected abstract void init_actions() throws java.lang.Exception;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Get the next token from the input (supplied by generated subclass).
+   *  Once end of file has been reached, all subsequent calls to scan 
+   *  should return an EOF token (which is symbol number 0).  This method
+   *  is supplied by the generator using using the code declared in the 
+   *  "scan with" clause.
+   */
+  public abstract token scan() throws java.lang.Exception;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Report a fatal error.  This method takes a  message string and an 
+   *  additional object (to be used by specializations implemented in 
+   *  subclasses).  Here in the base class a very simple implementation 
+   *  is provided which reports the error then throws an exception. 
+   *
+   * @param message an error message.
+   * @param info    an extra object reserved for use by specialized subclasses.
+   */
+  public void report_fatal_error(
+    String   message, 
+    Object   info)
+    throws java.lang.Exception
+    {
+      /* stop parsing (not really necessary since we throw an exception, but) */
+      done_parsing();
+
+      /* use the normal error message reporting to put out the message */
+      report_error(message, info);
+
+      /* throw an exception */
+      throw new Exception("Can't recover from previous error(s)");
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Report a non fatal error (or warning).  This method takes a message 
+   *  string and an additional object (to be used by specializations 
+   *  implemented in subclasses).  Here in the base class a very simple 
+   *  implementation is provided which simply prints the message to 
+   *  System.err. 
+   *
+   * @param message an error message.
+   * @param info    an extra object reserved for use by specialized subclasses.
+   */
+  public void report_error(String message, Object info)
+    {
+      System.err.println(message);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** This method is called when a syntax error has been detected and recovery 
+   *  is about to be invoked.  Here in the base class we just emit a 
+   *  "Syntax error" error message.  
+   *
+   * @param cur_token the current lookahead token.
+   */
+  public void syntax_error(token cur_token)
+    {
+      report_error("Syntax error", null);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** This method is called if it is determined that syntax error recovery 
+   *  has been unsuccessful.  Here in the base class we report a fatal error. 
+   *
+   * @param cur_token the current lookahead token.
+   */
+  public void unrecovered_syntax_error(token cur_token)
+    throws java.lang.Exception
+    {
+      report_fatal_error("Couldn't repair and continue parse", null);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Fetch an action from the action table.  The table is broken up into
+   *  rows, one per state (rows are indexed directly by state number).  
+   *  Within each row, a list of index, value pairs are given (as sequential
+   *  entries in the table), and the list is terminated by a default entry 
+   *  (denoted with a symbol index of -1).  To find the proper entry in a row 
+   *  we do a linear or binary search (depending on the size of the row).  
+   *
+   * @param state the state index of the action being accessed.
+   * @param sym   the symbol index of the action being accessed.
+   */
+  protected final short get_action(int state, int sym)
+    {
+      short tag;
+      int first, last, probe;
+      short[] row = action_tab[state];
+
+      /* linear search if we are < 10 entries */
+      if (row.length < 20)
+        for (probe = 0; probe < row.length; probe++)
+	  {
+	    /* is this entry labeled with our symbol or the default? */
+	    tag = row[probe++];
+	    if (tag == sym || tag == -1)
+	      {
+	        /* return the next entry */
+	        return row[probe];
+	      }
+	  }
+      /* otherwise binary search */
+      else
+	{
+	  first = 0; 
+	  last = (row.length-1)/2 - 1;  /* leave out trailing default entry */
+	  while (first <= last)
+	    {
+	      probe = (first+last)/2;
+	      if (sym == row[probe*2])
+		return row[probe*2+1];
+	      else if (sym > row[probe*2])
+		first = probe+1;
+	      else
+	        last = probe-1;
+	    }
+
+	  /* not found, use the default at the end */
+	  return row[row.length-1];
+	}
+
+      /* shouldn't happened, but if we run off the end we return the 
+	 default (error == 0) */
+      return 0;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Fetch a state from the reduce-goto table.  The table is broken up into
+   *  rows, one per state (rows are indexed directly by state number).  
+   *  Within each row, a list of index, value pairs are given (as sequential
+   *  entries in the table), and the list is terminated by a default entry 
+   *  (denoted with a symbol index of -1).  To find the proper entry in a row 
+   *  we do a linear search.  
+   *
+   * @param state the state index of the entry being accessed.
+   * @param sym   the symbol index of the entry being accessed.
+   */
+  protected final short get_reduce(int state, int sym)
+    {
+      short tag;
+      short[] row = reduce_tab[state];
+
+      /* if we have a null row we go with the default */
+      if (row == null)
+        return -1;
+
+      for (int probe = 0; probe < row.length; probe++)
+	{
+	  /* is this entry labeled with our symbol or the default? */
+	  tag = row[probe++];
+	  if (tag == sym || tag == -1)
+	    {
+	      /* return the next entry */
+	      return row[probe];
+	    }
+	}
+      /* if we run off the end we return the default (error == -1) */
+      return -1;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** This method provides the main parsing routine.  It returns only when 
+   *  done_parsing() has been called (typically because the parser has 
+   *  accepted, or a fatal error has been reported).  See the header 
+   *  documentation for the class regarding how shift/reduce parsers operate
+   *  and how the various tables are used.
+   */
+  public void parse() throws java.lang.Exception
+    {
+      /* the current action code */
+      int act;
+
+      /* the symbol/stack element returned by a reduce */
+      symbol lhs_sym;
+
+      /* information about production being reduced with */
+      short handle_size, lhs_sym_num;
+
+      /* set up direct reference to tables to drive the parser */
+
+      production_tab = production_table();
+      action_tab     = action_table();
+      reduce_tab     = reduce_table();
+
+      /* initialize the action encapsulation object */
+      init_actions();
+
+      /* do user initialization */
+      user_init();
+
+      /* get the first token */
+      cur_token = scan(); 
+
+      /* push dummy symbol with start state to get us underway */
+      stack.push(new symbol(0, start_state()));
+      tos = 0;
+
+      /* continue until we are told to stop */
+      for (_done_parsing = false; !_done_parsing; )
+	{
+	  /* current state is always on the top of the stack */
+
+	  /* look up action out of the current state with the current input */
+	  act = get_action(((symbol)stack.peek()).parse_state, cur_token.sym);
+
+	  /* decode the action -- > 0 encodes shift */
+	  if (act > 0)
+	    {
+	      /* shift to the encoded state by pushing it on the stack */
+	      cur_token.parse_state = act-1;
+	      stack.push(cur_token);
+	      tos++;
+
+	      /* advance to the next token */
+	      cur_token = scan();
+	    }
+	  /* if its less than zero, then it encodes a reduce action */
+	  else if (act < 0)
+	    {
+	      /* perform the action for the reduce */
+	      lhs_sym = do_action((-act)-1, this, stack, tos);
+
+	      /* look up information about the production */
+	      lhs_sym_num = production_tab[(-act)-1][0];
+	      handle_size = production_tab[(-act)-1][1];
+
+	      /* pop the handle off the stack */
+	      for (int i = 0; i < handle_size; i++)
+		{
+		  stack.pop();
+		  tos--;
+		}
+	      
+	      /* look up the state to go to from the one popped back to */
+	      act = get_reduce(((symbol)stack.peek()).parse_state, lhs_sym_num);
+
+	      /* shift to that state */
+	      lhs_sym.parse_state = act;
+	      stack.push(lhs_sym);
+	      tos++;
+	    }
+	  /* finally if the entry is zero, we have an error */
+	  else if (act == 0)
+	    {
+	      /* call user syntax error reporting routine */
+	      syntax_error(cur_token);
+
+	      /* try to error recover */
+	      if (!error_recovery(false))
+		{
+		  /* if that fails give up with a fatal syntax error */
+		  unrecovered_syntax_error(cur_token);
+
+		  /* just in case that wasn't fatal enough, end parse */
+		  done_parsing();
+		}
+	    }
+	}
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Write a debugging message to System.err for the debugging version 
+   *  of the parser. 
+   *
+   * @param mess the text of the debugging message.
+   */
+  public void debug_message(String mess)
+    {
+      System.err.println(mess);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Dump the parse stack for debugging purposes. */
+  public void dump_stack()
+    {
+      if (stack == null)
+	{
+	  debug_message("# Stack dump requested, but stack is null");
+	  return;
+	}
+
+      debug_message("============ Parse Stack Dump ============");
+
+      /* dump the stack */
+      for (int i=0; i<stack.size(); i++)
+	{
+	  debug_message("Symbol: " + ((symbol)stack.elementAt(i)).sym +
+			" State: " + ((symbol)stack.elementAt(i)).parse_state);
+	}
+      debug_message("==========================================");
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Do debug output for a reduce. 
+   *
+   * @param prod_num  the production we are reducing with.
+   * @param nt_num    the index of the LHS non terminal.
+   * @param rhs_size  the size of the RHS.
+   */
+  public void debug_reduce(int prod_num, int nt_num, int rhs_size)
+    {
+      debug_message("# Reduce with prod #" + prod_num + " [NT=" + nt_num + 
+	            ", " + "SZ=" + rhs_size + "]");
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Do debug output for shift. 
+   *
+   * @param shift_tkn the token being shifted onto the stack.
+   */
+  public void debug_shift(token shift_tkn)
+    {
+      debug_message("# Shift under term #" + shift_tkn.sym + 
+		    " to state #" + shift_tkn.parse_state);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Perform a parse with debugging output.  This does exactly the
+   *  same things as parse(), except that it calls debug_shift() and
+   *  debug_reduce() when shift and reduce moves are taken by the parser
+   *  and produces various other debugging messages.  
+   */
+  public void debug_parse()
+    throws java.lang.Exception
+    {
+      /* the current action code */
+      int act;
+
+      /* the symbol/stack element returned by a reduce */
+      symbol lhs_sym;
+
+      /* information about production being reduced with */
+      short handle_size, lhs_sym_num;
+
+      /* set up direct reference to tables to drive the parser */
+      production_tab = production_table();
+      action_tab     = action_table();
+      reduce_tab     = reduce_table();
+
+      debug_message("# Initializing parser");
+
+      /* initialize the action encapsulation object */
+      init_actions();
+
+      /* do user initialization */
+      user_init();
+
+      /* the current token */
+      cur_token = scan(); 
+
+      debug_message("# Current token is #" + cur_token.sym);
+
+      /* push dummy symbol with start state to get us underway */
+      stack.push(new symbol(0, start_state()));
+      tos = 0;
+
+      /* continue until we are told to stop */
+      for (_done_parsing = false; !_done_parsing; )
+	{
+	  /* current state is always on the top of the stack */
+
+	  /* look up action out of the current state with the current input */
+	  act = get_action(((symbol)stack.peek()).parse_state, cur_token.sym);
+
+	  /* decode the action -- > 0 encodes shift */
+	  if (act > 0)
+	    {
+	      /* shift to the encoded state by pushing it on the stack */
+	      cur_token.parse_state = act-1;
+	      debug_shift(cur_token);
+	      stack.push(cur_token);
+	      tos++;
+
+	      /* advance to the next token */
+	      cur_token = scan();
+              debug_message("# Current token is #" + cur_token.sym);
+	    }
+	  /* if its less than zero, then it encodes a reduce action */
+	  else if (act < 0)
+	    {
+	      /* perform the action for the reduce */
+	      lhs_sym = do_action((-act)-1, this, stack, tos);
+
+	      /* look up information about the production */
+	      lhs_sym_num = production_tab[(-act)-1][0];
+	      handle_size = production_tab[(-act)-1][1];
+
+	      debug_reduce((-act)-1, lhs_sym_num, handle_size);
+
+	      /* pop the handle off the stack */
+	      for (int i = 0; i < handle_size; i++)
+		{
+		  stack.pop();
+		  tos--;
+		}
+	      
+	      /* look up the state to go to from the one popped back to */
+	      act = get_reduce(((symbol)stack.peek()).parse_state, lhs_sym_num);
+
+	      /* shift to that state */
+	      lhs_sym.parse_state = act;
+	      stack.push(lhs_sym);
+	      tos++;
+
+	      debug_message("# Goto state #" + act);
+	    }
+	  /* finally if the entry is zero, we have an error */
+	  else if (act == 0)
+	    {
+	      /* call user syntax error reporting routine */
+	      syntax_error(cur_token);
+
+	      /* try to error recover */
+	      if (!error_recovery(true))
+		{
+		  /* if that fails give up with a fatal syntax error */
+		  unrecovered_syntax_error(cur_token);
+
+		  /* just in case that wasn't fatal enough, end parse */
+		  done_parsing();
+		}
+	    }
+	}
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+  /* Error recovery code */
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Attempt to recover from a syntax error.  This returns false if recovery 
+   *  fails, true if it succeeds.  Recovery happens in 4 steps.  First we
+   *  pop the parse stack down to a point at which we have a shift out
+   *  of the top-most state on the error symbol.  This represents the
+   *  initial error recovery configuration.  If no such configuration is
+   *  found, then we fail.  Next a small number of "lookahead" or "parse
+   *  ahead" tokens are read into a buffer.  The size of this buffer is 
+   *  determined by error_sync_size() and determines how many tokens beyond
+   *  the error must be matched to consider the recovery a success.  Next, 
+   *  we begin to discard tokens in attempt to get past the point of error
+   *  to a point where we can continue parsing.  After each token, we attempt 
+   *  to "parse ahead" though the buffered lookahead tokens.  The "parse ahead"
+   *  process simulates that actual parse, but does not modify the real 
+   *  parser's configuration, nor execute any actions. If we can  parse all 
+   *  the stored tokens without error, then the recovery is considered a 
+   *  success.  Once a successful recovery point is determined, we do an
+   *  actual parse over the stored input -- modifying the real parse 
+   *  configuration and executing all actions.  Finally, we return the the 
+   *  normal parser to continue with the overall parse.
+   *
+   * @param debug should we produce debugging messages as we parse.
+   */
+  protected boolean error_recovery(boolean debug)
+    throws java.lang.Exception
+    {
+      if (debug) debug_message("# Attempting error recovery");
+
+      /* first pop the stack back into a state that can shift on error and 
+	 do that shift (if that fails, we fail) */
+      if (!find_recovery_config(debug))
+	{
+	  if (debug) debug_message("# Error recovery fails");
+	  return false;
+	}
+
+      /* read ahead to create lookahead we can parse multiple times */
+      read_lookahead();
+
+      /* repeatedly try to parse forward until we make it the required dist */
+      for (;;)
+	{
+	  /* try to parse forward, if it makes it, bail out of loop */
+	  if (debug) debug_message("# Trying to parse ahead");
+	  if (try_parse_ahead(debug))
+	    {
+	      break;
+	    }
+
+	  /* if we are now at EOF, we have failed */
+	  if (lookahead[0].sym == EOF_sym()) 
+	    {
+	      if (debug) debug_message("# Error recovery fails at EOF");
+	      return false;
+	    }
+
+	  /* otherwise, we consume another token and try again */
+	  if (debug) 
+	  debug_message("# Consuming token #" + cur_err_token().sym);
+	  restart_lookahead();
+	}
+
+      /* we have consumed to a point where we can parse forward */
+      if (debug) debug_message("# Parse-ahead ok, going back to normal parse");
+
+      /* do the real parse (including actions) across the lookahead */
+      parse_lookahead(debug);
+
+      /* we have success */
+      return true;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if we can shift under the special error symbol out of the 
+   *  state currently on the top of the (real) parse stack. 
+   */
+  protected boolean shift_under_error()
+    {
+      /* is there a shift under error symbol */
+      return get_action(((symbol)stack.peek()).parse_state, error_sym()) > 0;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Put the (real) parse stack into error recovery configuration by 
+   *  popping the stack down to a state that can shift on the special 
+   *  error symbol, then doing the shift.  If no suitable state exists on 
+   *  the stack we return false 
+   *
+   * @param debug should we produce debugging messages as we parse.
+   */
+  protected boolean find_recovery_config(boolean debug)
+    {
+      token error_token;
+      int act;
+
+      if (debug) debug_message("# Finding recovery state on stack");
+
+      /* pop down until we can shift under error token */
+      while (!shift_under_error())
+	{
+	  /* pop the stack */
+	  if (debug) 
+	    debug_message("# Pop stack by one, state was # " +
+	                  ((symbol)stack.peek()).parse_state);
+          stack.pop();	
+	  tos--;
+
+	  /* if we have hit bottom, we fail */
+	  if (stack.empty()) 
+	    {
+	      if (debug) debug_message("# No recovery state found on stack");
+	      return false;
+	    }
+	}
+
+      /* state on top of the stack can shift under error, find the shift */
+      act = get_action(((symbol)stack.peek()).parse_state, error_sym());
+      if (debug) 
+	{
+	  debug_message("# Recover state found (#" + 
+			((symbol)stack.peek()).parse_state + ")");
+	  debug_message("# Shifting on error to state #" + (act-1));
+	}
+
+      /* build and shift a special error token */
+      error_token = new token(error_sym());
+      error_token.parse_state = act-1;
+      stack.push(error_token);
+      tos++;
+
+      return true;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Lookahead tokens used for attempting error recovery "parse aheads". */
+  protected token lookahead[];
+
+  /** Position in lookahead input buffer used for "parse ahead". */
+  protected int lookahead_pos;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Read from input to establish our buffer of "parse ahead" lookahead 
+   *  symbols. 
+   */
+  protected void read_lookahead() throws java.lang.Exception
+    {
+      /* create the lookahead array */
+      lookahead = new token[error_sync_size()];
+
+      /* fill in the array */
+      for (int i = 0; i < error_sync_size(); i++)
+	{
+	  lookahead[i] = cur_token;
+	  cur_token = scan();
+	}
+
+      /* start at the beginning */
+      lookahead_pos = 0;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Return the current lookahead in our error "parse ahead" buffer. */
+  protected token cur_err_token() { return lookahead[lookahead_pos]; }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Advance to next "parse ahead" input symbol. Return true if we have 
+   *  input to advance to, false otherwise. 
+   */
+  protected boolean advance_lookahead()
+    {
+      /* advance the input location */
+      lookahead_pos++;
+
+      /* return true if we didn't go off the end */
+      return lookahead_pos < error_sync_size();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Reset the parse ahead input to one token past where we started error 
+   *  recovery (this consumes one new token from the real input). 
+   */
+  protected void restart_lookahead() throws java.lang.Exception
+    {
+      /* move all the existing input over */
+      for (int i = 1; i < error_sync_size(); i++)
+	lookahead[i-1] = lookahead[i];
+
+      /* read a new token into the last spot */
+      cur_token = scan();
+      lookahead[error_sync_size()-1] = cur_token;
+
+      /* reset our internal position marker */
+      lookahead_pos = 0;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Do a simulated parse forward (a "parse ahead") from the current 
+   *  stack configuration using stored lookahead input and a virtual parse
+   *  stack.  Return true if we make it all the way through the stored 
+   *  lookahead input without error. This basically simulates the action of 
+   *  parse() using only our saved "parse ahead" input, and not executing any 
+   *  actions.
+   *
+   * @param debug should we produce debugging messages as we parse.
+   */
+  protected boolean try_parse_ahead(boolean debug)
+    throws java.lang.Exception
+    {
+      int act;
+      short lhs, rhs_size;
+
+      /* create a virtual stack from the real parse stack */
+      virtual_parse_stack vstack = new virtual_parse_stack(stack);
+
+      /* parse until we fail or get past the lookahead input */
+      for (;;)
+	{
+	  /* look up the action from the current state (on top of stack) */
+	  act = get_action(vstack.top(), cur_err_token().sym);
+
+	  /* if its an error, we fail */
+	  if (act == 0) return false;
+
+	  /* > 0 encodes a shift */
+	  if (act > 0)
+	    {
+	      /* push the new state on the stack */
+	      vstack.push(act-1);
+
+	      if (debug) debug_message("# Parse-ahead shifts token #" + 
+		       cur_err_token().sym + " into state #" + (act-1));
+
+	      /* advance simulated input, if we run off the end, we are done */
+	      if (!advance_lookahead()) return true;
+	    }
+	  /* < 0 encodes a reduce */
+	  else
+	    {
+	      /* if this is a reduce with the start production we are done */
+	      if ((-act)-1 == start_production()) 
+		{
+		  if (debug) debug_message("# Parse-ahead accepts");
+		  return true;
+		}
+
+	      /* get the lhs symbol and the rhs size */
+	      lhs = production_tab[(-act)-1][0];
+	      rhs_size = production_tab[(-act)-1][1];
+
+	      /* pop handle off the stack */
+	      for (int i = 0; i < rhs_size; i++)
+		vstack.pop();
+
+	      if (debug) 
+		debug_message("# Parse-ahead reduces: handle size = " + 
+	          rhs_size + " lhs = #" + lhs + " from state #" + vstack.top());
+
+	      /* look up goto and push it onto the stack */
+	      vstack.push(get_reduce(vstack.top(), lhs));
+	      if (debug) 
+		debug_message("# Goto state #" + vstack.top());
+	    }
+	}
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Parse forward using stored lookahead symbols.  In this case we have
+   *  already verified that parsing will make it through the stored lookahead
+   *  symbols and we are now getting back to the point at which we can hand
+   *  control back to the normal parser.  Consequently, this version of the
+   *  parser performs all actions and modifies the real parse configuration.  
+   *  This returns once we have consumed all the stored input or we accept.
+   *
+   * @param debug should we produce debugging messages as we parse.
+   */
+  protected void parse_lookahead(boolean debug)
+    throws java.lang.Exception
+    {
+      /* the current action code */
+      int act;
+
+      /* the symbol/stack element returned by a reduce */
+      symbol lhs_sym;
+
+      /* information about production being reduced with */
+      short handle_size, lhs_sym_num;
+
+      /* restart the saved input at the beginning */
+      lookahead_pos = 0;
+
+      if (debug) 
+	{
+	  debug_message("# Reparsing saved input with actions");
+	  debug_message("# Current token is #" + cur_err_token().sym);
+	  debug_message("# Current state is #" + 
+			((symbol)stack.peek()).parse_state);
+	}
+
+      /* continue until we accept or have read all lookahead input */
+      while(!_done_parsing)
+	{
+	  /* current state is always on the top of the stack */
+
+	  /* look up action out of the current state with the current input */
+	  act = 
+	    get_action(((symbol)stack.peek()).parse_state, cur_err_token().sym);
+
+	  /* decode the action -- > 0 encodes shift */
+	  if (act > 0)
+	    {
+	      /* shift to the encoded state by pushing it on the stack */
+	      cur_err_token().parse_state = act-1;
+	      if (debug) debug_shift(cur_err_token());
+	      stack.push(cur_err_token());
+	      tos++;
+
+	      /* advance to the next token, if there is none, we are done */
+	      if (!advance_lookahead()) 
+		{
+		  if (debug) debug_message("# Completed reparse");
+
+		  /* scan next token so we can continue parse */
+		  cur_token = scan();
+
+		  /* go back to normal parser */
+		  return;
+		}
+	      
+	      if (debug) 
+		debug_message("# Current token is #" + cur_err_token().sym);
+	    }
+	  /* if its less than zero, then it encodes a reduce action */
+	  else if (act < 0)
+	    {
+	      /* perform the action for the reduce */
+	      lhs_sym = do_action((-act)-1, this, stack, tos);
+
+	      /* look up information about the production */
+	      lhs_sym_num = production_tab[(-act)-1][0];
+	      handle_size = production_tab[(-act)-1][1];
+
+	      if (debug) debug_reduce((-act)-1, lhs_sym_num, handle_size);
+
+	      /* pop the handle off the stack */
+	      for (int i = 0; i < handle_size; i++)
+		{
+		  stack.pop();
+		  tos--;
+		}
+	      
+	      /* look up the state to go to from the one popped back to */
+	      act = get_reduce(((symbol)stack.peek()).parse_state, lhs_sym_num);
+
+	      /* shift to that state */
+	      lhs_sym.parse_state = act;
+	      stack.push(lhs_sym);
+	      tos++;
+	       
+	      if (debug) debug_message("# Goto state #" + act);
+
+	    }
+	  /* finally if the entry is zero, we have an error 
+	     (shouldn't happen here, but...)*/
+	  else if (act == 0)
+	    {
+	      report_fatal_error("Syntax error", null);
+	      return;
+	    }
+	}
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/runtime/str_token.java b/jasmin/jasmin-2.4/src/java_cup/runtime/str_token.java
new file mode 100644
index 0000000..2b3f3df
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/runtime/str_token.java
@@ -0,0 +1,32 @@
+
+package java_cup.runtime;
+
+/** This subclass of token represents symbols that need to maintain one
+ *  String value as an attribute.  It maintains that value in the public
+ *  field str_val.
+ *
+ * @see java_cup.runtime.int_token
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+
+public class str_token extends token {
+  /** Full constructor. */
+  public str_token(int term_num, String v)
+    {
+      /* super class does most of the work */
+      super(term_num);
+
+      str_val = v;
+    }
+
+  /** Constructor for value defaulting to an empty string. */
+  public str_token(int term_num)
+    {
+      this(term_num, "");
+    }
+
+  /** The stored string value. */
+  public String str_val;
+
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/runtime/symbol.java b/jasmin/jasmin-2.4/src/java_cup/runtime/symbol.java
new file mode 100644
index 0000000..8a75fac
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/runtime/symbol.java
@@ -0,0 +1,50 @@
+
+package java_cup.runtime;
+
+/** This class represents a (terminal or non-terminal) symbol that, among
+ *  other things can be placed on the parse stack.  Symbols are used to 
+ *  keep track of state on the parse stack.  The symbol currently on top
+ *  of the stack contains the current state in the parse_state field.
+ *  In addition to the parse_state field, symbols also maintain a record
+ *  of the symbol number that they represent in the sym field.  Finally, 
+ *  symbols are used contain to any attributes used by semantic action (this
+ *  is done via fields added in subclasses -- see for example, int_token and
+ *  str_token).
+ *
+ * @see java_cup.runtime.token
+ * @see java_cup.runtime.int_token
+ * @see java_cup.runtime.str_token
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+
+public class symbol {
+
+  /** Full constructor. */
+  public symbol(int sym_num, int state)
+    {
+      sym = sym_num;
+      parse_state = state;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constructor without a known state. */
+  public symbol(int sym_num)
+    {
+      this(sym_num, -1);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The symbol number of the terminal or non terminal being represented */
+  public int sym;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The parse state to be recorded on the parse stack with this symbol.
+   *  This field is for the convenience of the parser and shouldn't be 
+   *  modified except by the parser. 
+   */
+  public int parse_state;
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/runtime/token.java b/jasmin/jasmin-2.4/src/java_cup/runtime/token.java
new file mode 100644
index 0000000..636e864
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/runtime/token.java
@@ -0,0 +1,21 @@
+
+package java_cup.runtime;
+
+/** This subclass of symbol represents (at least) terminal symbols returned 
+ *  by the scanner and placed on the parse stack.  At present, this 
+ *  class does nothing more than its super class.
+ *  
+ * @see java_cup.runtime.int_token
+ * @see java_cup.runtime.str_token
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public class token extends symbol {
+
+  /* Simple constructor -- just delegates to the super class. */
+  public token(int term_num)
+    {
+      /* super class does all the work */
+      super(term_num);
+    }
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/runtime/virtual_parse_stack.java b/jasmin/jasmin-2.4/src/java_cup/runtime/virtual_parse_stack.java
new file mode 100644
index 0000000..4a56166
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/runtime/virtual_parse_stack.java
@@ -0,0 +1,145 @@
+
+package java_cup.runtime;
+
+import java.util.Stack;
+
+/** This class implements a temporary or "virtual" parse stack that 
+ *  replaces the top portion of the actual parse stack (the part that 
+ *  has been changed by some set of operations) while maintaining its
+ *  original contents.  This data structure is used when the parse needs 
+ *  to "parse ahead" to determine if a given error recovery attempt will 
+ *  allow the parse to continue far enough to consider it successful.  Once 
+ *  success or failure of parse ahead is determined the system then 
+ *  reverts to the original parse stack (which has not actually been 
+ *  modified).  Since parse ahead does not execute actions, only parse
+ *  state is maintained on the virtual stack, not full symbol objects.
+ *
+ * @see     java_cup.runtime.lr_parser
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+
+public class virtual_parse_stack {
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Constructor to build a virtual stack out of a real stack. */
+  public virtual_parse_stack(Stack shadowing_stack) throws java.lang.Exception
+    {
+      /* sanity check */
+      if (shadowing_stack == null)
+	throw new Exception(
+	  "Internal parser error: attempt to create null virtual stack");
+
+      /* set up our internals */
+      real_stack = shadowing_stack;
+      vstack     = new Stack();
+      real_next  = 0;
+
+      /* get one element onto the virtual portion of the stack */
+      get_from_real();
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+       
+  /** The real stack that we shadow.  This is accessed when we move off
+   *  the bottom of the virtual portion of the stack, but is always left
+   *  unmodified.
+   */
+  protected Stack real_stack;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Top of stack indicator for where we leave off in the real stack.
+   *  This is measured from top of stack, so 0 would indicate that no
+   *  elements have been "moved" from the real to virtual stack. 
+   */
+  protected int real_next;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The virtual top portion of the stack.  This stack contains Integer
+   *  objects with state numbers.  This stack shadows the top portion
+   *  of the real stack within the area that has been modified (via operations
+   *  on the virtual stack).  When this portion of the stack becomes empty we 
+   *  transfer elements from the underlying stack onto this stack. 
+   */
+  protected Stack vstack;
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Transfer an element from the real to the virtual stack.  This assumes 
+   *  that the virtual stack is currently empty.  
+   */
+  protected void get_from_real()
+    {
+      symbol stack_sym;
+
+      /* don't transfer if the real stack is empty */
+      if (real_next >= real_stack.size()) return;
+
+      /* get a copy of the first symbol we have not transfered */
+      stack_sym = (symbol)real_stack.elementAt(real_stack.size()-1-real_next);
+
+      /* record the transfer */
+      real_next++;
+
+      /* put the state number from the symbol onto the virtual stack */
+      vstack.push(new Integer(stack_sym.parse_state));
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Indicate whether the stack is empty. */
+  public boolean empty()
+    {
+      /* if vstack is empty then we were unable to transfer onto it and 
+	 the whole thing is empty. */
+      return vstack.empty();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+      
+  /** Return value on the top of the stack (without popping it). */
+  public int top() throws java.lang.Exception
+    {
+      if (vstack.empty())
+	throw new Exception(
+		  "Internal parser error: top() called on empty virtual stack");
+
+      return ((Integer)vstack.peek()).intValue();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Pop the stack. */
+  public void pop() throws java.lang.Exception
+    {
+      if (vstack.empty())
+	throw new Exception(
+		  "Internal parser error: pop from empty virtual stack");
+
+      /* pop it */
+      vstack.pop();
+
+      /* if we are now empty transfer an element (if there is one) */
+      if (vstack.empty())
+        get_from_real();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Push a state number onto the stack. */
+  public void push(int state_num)
+    {
+      vstack.push(new Integer(state_num));
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/shift_action.java b/jasmin/jasmin-2.4/src/java_cup/shift_action.java
new file mode 100644
index 0000000..4b8dc85
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/shift_action.java
@@ -0,0 +1,82 @@
+
+package java_cup;
+
+/** This class represents a shift action within the parse table. 
+ *  The action simply stores the state that it shifts to and responds 
+ *  to queries about its type.
+ *
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public class shift_action extends parse_action {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Simple constructor. 
+   * @param shft_to the state that this action shifts to.
+   */
+  public shift_action(lalr_state shft_to) throws internal_error
+    {
+      /* sanity check */
+      if (shft_to == null)
+	throw new internal_error(
+	  "Attempt to create a shift_action to a null state");
+
+      _shift_to = shft_to;
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** The state we shift to. */
+  protected lalr_state _shift_to;
+
+  /** The state we shift to. */
+  public lalr_state shift_to() {return _shift_to;}
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Quick access to type of action. */
+  public int kind() {return SHIFT;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality test. */
+  public boolean equals(shift_action other)
+    {
+      return other != null && other.shift_to() == shift_to();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality test. */
+  public boolean equals(Object other)
+    {
+      if (other instanceof shift_action)
+	return equals((shift_action)other);
+      else
+       return false;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Compute a hash code. */
+  public int hashCode()
+    {
+      /* use the hash code of the state we are shifting to */
+      return shift_to().hashCode();
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to a string. */
+  public String toString() {return "SHIFT(" + shift_to().index() + ")";}
+
+  /*-----------------------------------------------------------*/
+
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/sym.java b/jasmin/jasmin-2.4/src/java_cup/sym.java
new file mode 100644
index 0000000..03bb374
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/sym.java
@@ -0,0 +1,36 @@
+
+//----------------------------------------------------
+// The following code was generated by Java(tm) CUP v0.9d
+// Thu Aug 10 03:51:39 MSD 2006
+//----------------------------------------------------
+
+package java_cup;
+
+/** JavaCup generated class containing symbol constants. */
+public class sym {
+  /* terminals */
+  static final int IMPORT = 3;
+  static final int INIT = 9;
+  static final int CODE_STRING = 22;
+  static final int DEBUG = 20;
+  static final int SEMI = 13;
+  static final int STAR = 15;
+  static final int CODE = 4;
+  static final int COLON = 17;
+  static final int NON = 8;
+  static final int ID = 21;
+  static final int WITH = 11;
+  static final int TERMINAL = 7;
+  static final int COLON_COLON_EQUALS = 18;
+  static final int COMMA = 14;
+  static final int EOF = 0;
+  static final int PARSER = 6;
+  static final int error = 1;
+  static final int DOT = 16;
+  static final int ACTION = 5;
+  static final int START = 12;
+  static final int PACKAGE = 2;
+  static final int BAR = 19;
+  static final int SCAN = 10;
+};
+
diff --git a/jasmin/jasmin-2.4/src/java_cup/symbol.java b/jasmin/jasmin-2.4/src/java_cup/symbol.java
new file mode 100644
index 0000000..2f498b2
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/symbol.java
@@ -0,0 +1,107 @@
+package java_cup;
+
+/** This abstract class serves as the base class for grammar symbols (i.e.,
+ * both terminals and non-terminals).  Each symbol has a name string, and
+ * a string giving the type of object that the symbol will be represented by
+ * on the runtime parse stack.  In addition, each symbol maintains a use count
+ * in order to detect symbols that are declared but never used, and an index
+ * number that indicates where it appears in parse tables (index numbers are
+ * unique within terminals or non terminals, but not across both).
+ *
+ * @see     java_cup.terminal
+ * @see     java_cup.non_terminal
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public abstract class symbol {
+   /*-----------------------------------------------------------*/
+   /*--- Constructor(s) ----------------------------------------*/
+   /*-----------------------------------------------------------*/
+
+   /** Full constructor.
+    * @param nm the name of the symbol.
+    * @param tp a string with the type name.
+    */
+   public symbol(String nm, String tp)
+     {
+       /* sanity check */
+       if (nm == null) nm = "";
+
+       /* apply default if no type given */
+       if (tp == null) tp = "java_cup.runtime.token";
+
+       _name = nm;
+       _stack_type = tp;
+     }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+   /** Constructor with default type. 
+    * @param nm the name of the symbol.
+    */
+   public symbol(String nm)
+     {
+       this(nm, null);
+     }
+
+   /*-----------------------------------------------------------*/
+   /*--- (Access to) Instance Variables ------------------------*/
+   /*-----------------------------------------------------------*/
+
+   /** String for the human readable name of the symbol. */
+   protected String _name; 
+ 
+   /** String for the human readable name of the symbol. */
+   public String name() {return _name;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+   /** String for the type of object used for the symbol on the parse stack. */
+   protected String _stack_type;
+
+   /** String for the type of object used for the symbol on the parse stack. */
+   public String stack_type() {return _stack_type;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+   /** Count of how many times the symbol appears in productions. */
+   protected int _use_count = 0;
+
+   /** Count of how many times the symbol appears in productions. */
+   public int use_count() {return _use_count;}
+
+   /** Increment the use count. */ 
+   public void note_use() {_use_count++;}
+ 
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+ 
+  /** Index of this symbol (terminal or non terminal) in the parse tables.
+   *  Note: indexes are unique among terminals and unique among non terminals,
+   *  however, a terminal may have the same index as a non-terminal, etc. 
+   */
+   protected int _index;
+ 
+  /** Index of this symbol (terminal or non terminal) in the parse tables.
+   *  Note: indexes are unique among terminals and unique among non terminals,
+   *  however, a terminal may have the same index as a non-terminal, etc. 
+   */
+   public int index() {return _index;}
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Indicate if this is a non-terminal.  Here in the base class we
+   *  don't know, so this is abstract.  
+   */
+  public abstract boolean is_non_term();
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to a string. */
+  public String toString()
+    {
+      return name();
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/symbol_part.java b/jasmin/jasmin-2.4/src/java_cup/symbol_part.java
new file mode 100644
index 0000000..367eb0c
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/symbol_part.java
@@ -0,0 +1,100 @@
+package java_cup;
+
+/** This class represents a part of a production which is a symbol (terminal
+ *  or non terminal).  This simply maintains a reference to the symbol in 
+ *  question.
+ *
+ * @see     java_cup.production
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public class symbol_part extends production_part {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Full constructor. 
+   * @param sym the symbol that this part is made up of.
+   * @param lab an optional label string for the part.
+   */
+  public symbol_part(symbol sym, String lab) throws internal_error
+    {
+      super(lab);
+
+      if (sym == null)
+	throw new internal_error(
+	  "Attempt to construct a symbol_part with a null symbol");
+      _the_symbol = sym;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constructor with no label. 
+   * @param sym the symbol that this part is made up of.
+   */
+  public symbol_part(symbol sym) throws internal_error
+    {
+      this(sym,null);
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** The symbol that this part is made up of. */
+  protected symbol _the_symbol;
+
+  /** The symbol that this part is made up of. */
+  public symbol the_symbol() {return _the_symbol;}
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Respond that we are not an action part. */
+  public boolean is_action() { return false; }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality comparison. */
+  public boolean equals(symbol_part other)
+    {
+      return other != null && super.equals(other) && 
+	     the_symbol().equals(other.the_symbol());
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality comparison. */
+  public boolean equals(Object other)
+    {
+      if (!(other instanceof symbol_part))
+	return false;
+      else
+	return equals((symbol_part)other);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Produce a hash code. */
+  public int hashCode()
+    {
+      return super.hashCode() ^ 
+	     (the_symbol()==null ? 0 : the_symbol().hashCode());
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to a string. */
+  public String toString()
+    {
+      if (the_symbol() != null)
+	return super.toString() + the_symbol();
+      else
+	return super.toString() + "$$MISSING-SYMBOL$$";
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/symbol_set.java b/jasmin/jasmin-2.4/src/java_cup/symbol_set.java
new file mode 100644
index 0000000..a58a4c0
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/symbol_set.java
@@ -0,0 +1,231 @@
+
+package java_cup;
+
+import java.util.Hashtable;
+import java.util.Enumeration;
+
+/** This class represents a set of symbols and provides a series of 
+ *  set operations to manipulate them.
+ *
+ * @see     java_cup.symbol
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public class symbol_set {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Constructor for an empty set. */
+  public symbol_set() { };
+
+  /** Constructor for cloning from another set. 
+   * @param other the set we are cloning from.
+   */
+  public symbol_set(symbol_set other) throws internal_error
+    {
+      not_null(other);
+      _all = (Hashtable)other._all.clone();
+    };
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** A hash table to hold the set. Symbols are keyed using their name string. 
+   */
+  protected Hashtable _all = new Hashtable(11);
+
+  /** Access to all elements of the set. */
+  public Enumeration all() {return _all.elements();};
+
+  /** size of the set */
+  public int size() {return _all.size();};
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Helper function to test for a null object and throw an exception
+   *  if one is found.
+   * @param obj the object we are testing.
+   */
+  protected void not_null(Object obj) throws internal_error
+    {
+      if (obj == null) 
+	throw new internal_error("Null object used in set operation");
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if the set contains a particular symbol. 
+   * @param sym the symbol we are looking for.
+   */
+  public boolean contains(symbol sym) {return _all.containsKey(sym.name());};
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if this set is an (improper) subset of another. 
+   * @param other the set we are testing against.
+   */
+  public boolean is_subset_of(symbol_set other) throws internal_error
+    {
+      not_null(other);
+
+      /* walk down our set and make sure every element is in the other */
+      for (Enumeration e = all(); e.hasMoreElements(); )
+	if (!other.contains((symbol)e.nextElement()))
+	  return false;
+
+      /* they were all there */
+      return true;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if this set is an (improper) superset of another. 
+   * @param other the set we are are testing against.
+   */
+  public boolean is_superset_of(symbol_set other) throws internal_error
+    {
+      not_null(other);
+      return other.is_subset_of(this);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Add a single symbol to the set.  
+   * @param sym the symbol we are adding.
+   * @return true if this changes the set.
+   */
+  public boolean add(symbol sym) throws internal_error
+    {
+      Object previous;
+
+      not_null(sym); 
+
+      /* put the object in */
+      previous = _all.put(sym.name(),sym);
+
+      /* if we had a previous, this is no change */
+      return previous == null;
+    };
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Remove a single symbol if it is in the set. 
+   * @param sym the symbol we are removing.
+   */
+  public void remove(symbol sym) throws internal_error
+    {
+      not_null(sym); 
+      _all.remove(sym.name());
+    };
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Add (union) in a complete set.  
+   * @param other the set we are adding in.
+   * @return true if this changes the set. 
+   */
+  public boolean add(symbol_set other) throws internal_error
+    {
+      boolean result = false;
+
+      not_null(other);
+
+      /* walk down the other set and do the adds individually */
+      for (Enumeration e = other.all(); e.hasMoreElements(); )
+	result = add((symbol)e.nextElement()) || result;
+
+      return result;
+    };
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Remove (set subtract) a complete set. 
+   * @param other the set we are removing.
+   */
+  public void remove(symbol_set other) throws internal_error
+    {
+      not_null(other);
+
+      /* walk down the other set and do the removes individually */
+      for (Enumeration e = other.all(); e.hasMoreElements(); )
+	remove((symbol)e.nextElement());
+    };
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality comparison. */
+  public boolean equals(symbol_set other) 
+    {
+      if (other == null || other.size() != size()) return false;
+
+      /* once we know they are the same size, then improper subset does test */
+      try {
+        return is_subset_of(other);
+      } catch (internal_error e) {
+	/* can't throw the error (because super class doesn't), so we crash */
+	e.crash();
+	return false;
+      }
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality comparison. */
+  public boolean equals(Object other)
+    {
+      if (!(other instanceof symbol_set))
+	return false;
+      else
+	return equals((symbol_set)other);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Compute a hash code. */
+  public int hashCode()
+    {
+      int result = 0;
+      int cnt;
+      Enumeration e;
+
+      /* hash together codes from at most first 5 elements */
+      for (e = all(), cnt=0 ; e.hasMoreElements() && cnt<5; cnt++)
+	result ^= ((symbol)e.nextElement()).hashCode();
+
+      return result;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to a string. */
+  public String toString()
+    {
+      String result;
+      boolean comma_flag;
+
+      result = "{";
+      comma_flag = false;
+      for (Enumeration e = all(); e.hasMoreElements(); )
+	{
+	  if (comma_flag)
+	    result += ", ";
+	  else
+	    comma_flag = true;
+
+	  result += ((symbol)e.nextElement()).name();
+	}
+      result += "}";
+
+      return result;
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
+
+
diff --git a/jasmin/jasmin-2.4/src/java_cup/terminal.java b/jasmin/jasmin-2.4/src/java_cup/terminal.java
new file mode 100644
index 0000000..743f862
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/terminal.java
@@ -0,0 +1,130 @@
+package java_cup;
+ 
+import java.util.Hashtable;
+import java.util.Enumeration;
+
+/** This class represents a terminal symbol in the grammar.  Each terminal 
+ *  has a textual name, an index, and a string which indicates the type of 
+ *  object it will be implemented with at runtime (i.e. the class of object 
+ *  that will be returned by the scanner and pushed on the parse stack to 
+ *  represent it). 
+ *
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public class terminal extends symbol {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Full constructor.
+   * @param nm the name of the terminal.
+   * @param tp the type of the terminal.
+   */
+  public terminal(String nm, String tp) 
+    {
+      /* superclass does most of the work */
+      super(nm, tp);
+
+      /* add to set of all terminals and check for duplicates */
+      Object conflict = _all.put(nm,this);
+      if (conflict != null)
+	// can't throw an execption here because this is used in static 
+	// initializers, so we do a crash instead
+	// was:
+	// throw new internal_error("Duplicate terminal (" + nm + ") created");
+	(new internal_error("Duplicate terminal (" + nm + ") created")).crash();
+
+      /* assign a unique index */
+      _index = next_index++;
+
+      /* add to by_index set */
+      _all_by_index.put(new Integer(_index), this);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constructor with default type. 
+   * @param nm the name of the terminal.
+   */
+  public terminal(String nm) 
+    {
+      this(nm, null);
+    }
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Static (Class) Variables ------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Table of all terminals.  Elements are stored using name strings as 
+   *  the key 
+   */
+  protected static Hashtable _all = new Hashtable();
+
+  /** Access to all terminals. */
+  public static Enumeration all() {return _all.elements();};
+
+  /** Lookup a terminal by name string. */ 
+  public static terminal find(String with_name)
+    {
+      if (with_name == null)
+	return null;
+      else 
+	return (terminal)_all.get(with_name);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Table of all terminals indexed by their index number. */
+  protected static Hashtable _all_by_index = new Hashtable();
+
+  /** Lookup a terminal by index. */
+  public static terminal find(int indx)
+    {
+      Integer the_indx = new Integer(indx);
+
+      return (terminal)_all_by_index.get(the_indx);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Total number of terminals. */
+  public static int number() {return _all.size();};
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+ 
+  /** Static counter to assign unique index. */
+  protected static int next_index = 0;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Special terminal for end of input. */
+  public static final terminal EOF = new terminal("EOF");
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** special terminal used for error recovery */
+  public static final terminal error = new terminal("error");
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ---------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Report this symbol as not being a non-terminal. */
+  public boolean is_non_term() 
+    {
+      return false;
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to a string. */
+  public String toString()
+    {
+      return super.toString() + "[" + index() + "]";
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
diff --git a/jasmin/jasmin-2.4/src/java_cup/terminal_set.java b/jasmin/jasmin-2.4/src/java_cup/terminal_set.java
new file mode 100644
index 0000000..843d013
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/terminal_set.java
@@ -0,0 +1,253 @@
+
+package java_cup;
+
+import java.util.BitSet;
+
+/** A set of terminals implemented as a bitset. 
+ * @version last updated: 11/25/95
+ * @author  Scott Hudson
+ */
+public class terminal_set {
+
+  /*-----------------------------------------------------------*/
+  /*--- Constructor(s) ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Constructor for an empty set. */
+  public terminal_set() 
+    { 
+      /* allocate the bitset at what is probably the right size */
+      _elements = new BitSet(terminal.number());
+    };
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Constructor for cloning from another set. 
+   * @param other the set we are cloning from.
+   */
+  public terminal_set(terminal_set other) 
+    throws internal_error
+    {
+      not_null(other);
+      _elements = (BitSet)other._elements.clone();
+    };
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Static (Class) Variables ------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Constant for the empty set. */
+  public static final terminal_set EMPTY = new terminal_set();
+
+  /*-----------------------------------------------------------*/
+  /*--- (Access to) Instance Variables ------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Bitset to implement the actual set. */
+  protected BitSet _elements;
+
+  /*-----------------------------------------------------------*/
+  /*--- General Methods ----------------------------------------*/
+  /*-----------------------------------------------------------*/
+
+  /** Helper function to test for a null object and throw an exception if
+   *  one is found. 
+   * @param obj the object we are testing.
+   */
+  protected void not_null(Object obj) throws internal_error
+    {
+      if (obj == null) 
+	throw new internal_error("Null object used in set operation");
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if the set is empty. */
+  public boolean empty()
+    {
+      return equals(EMPTY);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if the set contains a particular terminal. 
+   * @param sym the terminal symbol we are looking for.
+   */
+  public boolean contains(terminal sym) 
+    throws internal_error
+    {
+      not_null(sym); 
+      return _elements.get(sym.index());
+    };
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Given its index determine if the set contains a particular terminal. 
+   * @param indx the index of the terminal in question.
+   */
+  public boolean contains(int indx) 
+    {
+      return _elements.get(indx);
+    };
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if this set is an (improper) subset of another.
+   * @param other the set we are testing against.
+   */
+  public boolean is_subset_of(terminal_set other)
+    throws internal_error
+    {
+      not_null(other);
+
+      /* make a copy of the other set */
+      BitSet copy_other = (BitSet)other._elements.clone();
+
+      /* and or in */
+      copy_other.or(_elements);
+
+      /* if it hasn't changed, we were a subset */
+      return copy_other.equals(other._elements);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if this set is an (improper) superset of another.
+   * @param other the set we are testing against.
+   */
+  public boolean is_superset_of(terminal_set other)
+    throws internal_error
+    {
+      not_null(other);
+      return other.is_subset_of(this);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Add a single terminal to the set.  
+   * @param sym the terminal being added.
+   * @return true if this changes the set.
+   */
+  public boolean add(terminal sym) 
+    throws internal_error
+    {
+      boolean result;
+
+      not_null(sym); 
+
+      /* see if we already have this */ 
+      result = _elements.get(sym.index());
+
+      /* if not we add it */
+      if (!result)
+	_elements.set(sym.index());
+
+      return result;
+    };
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Remove a terminal if it is in the set.
+   * @param sym the terminal being removed.
+   */
+  public void remove(terminal sym) 
+    throws internal_error
+    {
+      not_null(sym); 
+      _elements.clear(sym.index());
+    };
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Add (union) in a complete set.  
+   * @param other the set being added.
+   * @return true if this changes the set.
+   */
+  public boolean add(terminal_set other)
+    throws internal_error
+    {
+      not_null(other);
+
+      /* make a copy */
+      BitSet copy = (BitSet)_elements.clone();
+
+      /* or in the other set */
+      _elements.or(other._elements);
+
+      /* changed if we are not the same as the copy */
+      return !_elements.equals(copy);
+    };
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Determine if this set intersects another.
+   * @param other the other set in question.
+   */
+   public boolean intersects(terminal_set other)
+     throws internal_error
+     {
+       not_null(other);
+
+       /* make a copy of the other set */
+       BitSet copy = (BitSet)other._elements.clone();
+
+       /* xor out our values */
+       copy.xor(this._elements);
+
+       /* see if its different */
+       return !copy.equals(other._elements);
+     }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Equality comparison. */
+  public boolean equals(terminal_set other)
+    {
+      if (other == null) 
+	return false;
+      else
+	return _elements.equals(other._elements);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Generic equality comparison. */
+  public boolean equals(Object other)
+    {
+      if (!(other instanceof terminal_set))
+	return false;
+      else
+	return equals((terminal_set)other);
+    }
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Convert to string. */
+  public String toString()
+    {
+      String result;
+      boolean comma_flag;
+      
+      result = "{";
+      comma_flag = false;
+      for (int t = 0; t < terminal.number(); t++)
+	{
+	  if (_elements.get(t))
+	    {
+	      if (comma_flag)
+	        result += ", ";
+	      else
+	        comma_flag = true;
+
+	      result += terminal.find(t).name();
+	    }
+	}
+      result += "}";
+
+      return result;
+    }
+
+  /*-----------------------------------------------------------*/
+
+};
+
diff --git a/jasmin/jasmin-2.4/src/java_cup/version.java b/jasmin/jasmin-2.4/src/java_cup/version.java
new file mode 100644
index 0000000..f46bcd7
--- /dev/null
+++ b/jasmin/jasmin-2.4/src/java_cup/version.java
@@ -0,0 +1,54 @@
+
+package java_cup;
+
+/** This class contains version and authorship information. 
+ *  It contains only static data elements and basically just a central 
+ *  place to put this kind of information so it can be updated easily
+ *  for each release.  
+ *
+ *  Version numbers used here are broken into 3 parts: major, minor, and 
+ *  update, and are written as v<major>.<minor><update> (e.g. v0.9a).  
+ *  Major numbers will change at the time of major reworking of some 
+ *  part of the system.  Minor numbers for each public release or 
+ *  change big enough to cause incompatibilities.  Finally update
+ *  letter will be incremented for small bug fixes and changes that
+ *  probably wouldn't be noticed by a user.  
+ *
+ * @version last updated: 1/7/96
+ * @author  Scott Hudson
+ */
+
+public class version {
+  /** String for the current version. */
+  public static final String version_str = "v0.9d";
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The major version number. */
+  public static final int major = 0;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The minor version number. */
+  public static final int minor = 9;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The update letter. */
+  public static final char update = 'd';
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Full title of the system */
+  public static final String title_str = "Java(tm) CUP " + version_str;
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** Name of the author */
+  public static final String author_str = "Scott E. Hudson";
+
+  /*. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .*/
+
+  /** The command name normally used to invoke this program */ 
+  public static final String program_name = "java_cup";
+};
diff --git a/jlc b/jlc
new file mode 100755
index 0000000..6f1c568
Binary files /dev/null and b/jlc differ
diff --git a/jlcc b/jlcc
new file mode 100755
index 0000000..c645bf7
--- /dev/null
+++ b/jlcc
@@ -0,0 +1,5 @@
+#!/bin/sh
+
+./jlc $1.js > $1.j
+java -jar jasmin/jasmin-2.4/jasmin.jar $1.j
+java $1
diff --git a/main.hs b/main.hs
new file mode 100644
index 0000000..ae16327
--- /dev/null
+++ b/main.hs
@@ -0,0 +1,27 @@
+import System Environment (getArgs)
+import System.Exit (exitFailure)
+
+import AbsJavalette
+import LexJavalette
+import ParJavalette
+import ErrM
+
+import TypeChecker
+
+check :: String -> IO()
+check s = case pProgram (myLexer s) of
+			Bad err	->	do putStrLn "SYNTAX ERROR"
+						   putStrLn err
+						   exitFailure
+			Ok tree	->	case typecheck tree of
+							Bad err	-> do putStrLn "TYPE ERROR"
+										  putStrLn err
+										  exitFailure
+							Ok _	-> putStrLn "OK"
+
+main :: IO ()
+main = do args <- getArgs
+		  case args of
+			[file] -> readFile file >>= check
+			_	   -> do putStrLn "Usage: main <SourceFile>"
+						exitFauilure
diff --git a/main.hs~ b/main.hs~
new file mode 100644
index 0000000..ae16327
--- /dev/null
+++ b/main.hs~
@@ -0,0 +1,27 @@
+import System Environment (getArgs)
+import System.Exit (exitFailure)
+
+import AbsJavalette
+import LexJavalette
+import ParJavalette
+import ErrM
+
+import TypeChecker
+
+check :: String -> IO()
+check s = case pProgram (myLexer s) of
+			Bad err	->	do putStrLn "SYNTAX ERROR"
+						   putStrLn err
+						   exitFailure
+			Ok tree	->	case typecheck tree of
+							Bad err	-> do putStrLn "TYPE ERROR"
+										  putStrLn err
+										  exitFailure
+							Ok _	-> putStrLn "OK"
+
+main :: IO ()
+main = do args <- getArgs
+		  case args of
+			[file] -> readFile file >>= check
+			_	   -> do putStrLn "Usage: main <SourceFile>"
+						exitFauilure
diff --git a/run b/run
new file mode 100755
index 0000000..7d23407
--- /dev/null
+++ b/run
@@ -0,0 +1,4 @@
+#!/bin/sh
+
+./jlc $1
+
diff --git a/t.class b/t.class
new file mode 100644
index 0000000..1710627
Binary files /dev/null and b/t.class differ
diff --git a/t.j b/t.j
new file mode 100644
index 0000000..91d9c8b
--- /dev/null
+++ b/t.j
@@ -0,0 +1,43 @@
+.class public t
+.super java/lang/Object
+.method public <init>()V
+  aload_0
+  invokespecial java/lang/Object/<init>()V
+  return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+  .limit locals 1
+  invokestatic t/main()I
+  pop
+  return
+.end method
+
+.method public static main()I
+  .limit locals 0
+  .limit stack 2
+  invokestatic t/foo()V
+  iconst_0
+  ireturn
+.end method
+
+.method public static foo()V
+  .limit locals 0
+  .limit stack 8
+  iconst_5
+  iconst_3
+  irem
+  invokestatic Runtime/printInt(I)V
+  ldc "\n"
+  invokestatic Runtime/printString(Ljava/lang/String;)V
+  return
+  ldc2_w 10.0
+  ldc2_w 5.0
+  ddiv
+  invokestatic Runtime/printDouble(D)V
+  ldc "\n"
+  invokestatic Runtime/printString(Ljava/lang/String;)V
+  return
+.end method
+
+
diff --git a/t.j.bak b/t.j.bak
new file mode 100644
index 0000000..c2d0efd
--- /dev/null
+++ b/t.j.bak
@@ -0,0 +1,39 @@
+.class public t
+.super java/lang/Object
+.method public <init>()V
+  aload_0
+  invokespecial java/lang/Object/<init>()V
+  return
+.end method
+
+.method public static main([Ljava/lang/String;)V
+  .limit locals 1
+  invokestatic t/main()I
+  pop
+  return
+.end method
+
+.method public static main()I
+  .limit locals 0
+  .limit stack 1
+
+  iconst_2
+  invokestatic t/foo(I)V
+  
+  iconst_1
+  ireturn
+
+.end method
+
+.method public static foo(I)V
+  .limit locals 1
+  .limit stack 3
+
+  iconst_1
+  iconst_2
+  iadd
+  
+  invokestatic	Runtime/printInt(I)V
+  return
+
+.end method
diff --git a/t.js b/t.js
new file mode 100644
index 0000000..86e14b2
--- /dev/null
+++ b/t.js
@@ -0,0 +1,12 @@
+int main() {
+    foo();
+	return 0;
+}
+
+void foo() {
+	printInt(5%3);
+	printString("\n");
+	return;
+	printDouble(10.0/5.0);
+	printString("\n");
+}
diff --git a/tester/.DS_Store b/tester/.DS_Store
new file mode 100644
index 0000000..7488b9c
Binary files /dev/null and b/tester/.DS_Store differ
diff --git a/tester/Grade b/tester/Grade
new file mode 100755
index 0000000..77dee08
Binary files /dev/null and b/tester/Grade differ
diff --git a/tester/Grade.hi b/tester/Grade.hi
new file mode 100644
index 0000000..5722fb7
Binary files /dev/null and b/tester/Grade.hi differ
diff --git a/tester/Grade.hs b/tester/Grade.hs
new file mode 100644
index 0000000..96c75fc
--- /dev/null
+++ b/tester/Grade.hs
@@ -0,0 +1,125 @@
+module Grade where
+
+import RunCommand
+import KompTest
+
+import Data.List
+import Data.Maybe
+import System.Directory
+import System.Environment
+import System.Exit
+import System.IO
+import System.Process
+import System.FilePath
+import System.Posix.Files
+import Control.Exception
+import Control.Monad
+import System.Console.GetOpt
+
+cmd c = do
+  putStrLn c
+  (out,err,code) <- runCommandStrWait c ""
+  putStrLn out
+  putStrLn err
+
+
+makeAbsolute p = do
+  c <- getCurrentDirectory
+  return (c </> p)
+
+maybeBuild _ [] = return ()
+maybeBuild groupPath0 ((tarOpt,subm) : _) = do
+   cmd $ "tar -C "++groupPath0 ++" -"++ tarOpt++"xvf "++ show (groupPath0 </> subm)
+   cmd $ "make -C " ++ show (groupPath0 </> "src")
+   
+testAll compiler bs exts [testSuitePath00, groupPath0] = do
+  allFiles <- getDirectoryContents groupPath0
+  let submissions = [(opts, s) | 
+                    (opts, suff) <- [("z", ".tar.gz"), ("j", ".tar.bz2"), ("j", ".tar.bzip2"), ("", ".tar")],
+                    s <- filter (suff `isSuffixOf`) allFiles]
+  maybeBuild groupPath0 submissions
+  let testSuitePath0 = groupPath0 </> "graderTestSuite"
+  cmd $ "rm -r " ++ testSuitePath0
+  cmd $ "cp -R " ++ testSuitePath00 </> "testsuite" ++ " " ++ testSuitePath0
+  let exePath0 = groupPath0 </> compiler
+
+  exePath <- makeAbsolute exePath0
+  groupPath <- makeAbsolute groupPath0
+ 
+  testSuitePath <- makeAbsolute testSuitePath0
+  curDir <- getCurrentDirectory
+  let exeDir = takeDirectory exePath
+  putStrLn $ "Running tests for " ++ exePath
+
+  let libpath = groupPath </> "lib"
+  let testProg = if null bs then Nothing
+                 else case bs of
+                   "JVM"  : _ -> Just testJVM
+                   "LLVM" : _ -> Just testLLVM
+                   "x86" : _ -> Just testx86
+                   b : _ -> error ("Unknown backend: " ++ b) 
+  setCurrentDirectory exeDir
+  summary <- forM (testSpecs testProg exts libpath) $ \(points, name, tests) -> do
+    putStrLn $ name ++ "..."
+    results <- forM tests $ \(good, p, testFunction) -> do
+        testFiles <- getTestFilesForPath (testSuitePath </> p)
+        putStrLn $ p ++ "..."
+        rs <- testFunction exePath good testFiles
+        report p rs 
+        return (p, rs)
+    putStrLn $ "Passed suites: " ++ (concat $ intersperse ", " $ [p | (p,rs) <- results, and rs])
+    let tally = concat (map snd results)
+    return (name, if and tally then points else (0 :: Int), tally)
+
+  setCurrentDirectory curDir
+
+  putStrLn $ "Summary:\n" ++ unlines (map summaryLine summary)
+  putStrLn $ "Credits total: " ++ show (sum [x | (_,x,_) <- summary])
+
+padl n s = replicate (n - length s) ' ' ++ s
+
+
+summaryLine (name, points, tests) = 
+  padl 2 (show points) ++ " " ++ name ++ " " ++ "(" ++ show (length (filter id tests)) ++ "/" ++ show (length tests) ++ ")"
+
+testSpecs testProg exts libpath = 
+  (0, "Compiling core programs",     [(True, "good",testCompilation), (False, "bad", testCompilation)]) : 
+  map (\x -> (0,"Compiling extension " ++ x,[(True,"extensions/"++x,testCompilation)])) exts ++ 
+  case testProg of   
+     Nothing -> []
+     Just backEnd ->
+      (0, "Running core programs",        [(True, "good",backEnd libpath)]) : 
+      map (\x -> (6,"Running extension " ++ x,[(True,"extensions/"++x,backEnd libpath)])) exts 
+
+
+
+testBack back cmd good fs = if good then test cmd fs back else return []
+
+testJVM classpath = testBack (jvmBackend classpath)
+testLLVM libpath  = testBack (llvmBackend libpath)
+testx86 libpath   = testBack (x86Backend libpath)
+
+data Flag = SearchScript String
+          | Extension String
+          | Back String
+   deriving (Eq,Ord)
+
+flags =
+    [Option "s" ["search-compiler"] (ReqArg SearchScript "<compiler>") "search for the specified compiler",
+     Option "x" ["extension"] (ReqArg Extension "<extension>") "specify extensions to test",
+     Option "b" ["backend"] (ReqArg Back "<backend>") "specify backend"]
+
+main = do
+  argv <- getArgs
+  case getOpt Permute flags argv of
+    (opts,args,[]) -> do
+         let searchList0 = [s | SearchScript s <- opts]
+             compiler = if null searchList0 then "jlc" else head searchList0
+             exts = [e | Extension e <- opts]
+             bs = [b | Back b <- opts]
+         testAll compiler bs exts args
+    (_,_,errs) -> do
+            hPutStrLn stderr (concat errs ++ usageInfo "" flags)
+            exitWith (ExitFailure 1)
+
+ where defaultSearchList = [] 
diff --git a/tester/Grade.o b/tester/Grade.o
new file mode 100644
index 0000000..d57526a
Binary files /dev/null and b/tester/Grade.o differ
diff --git a/tester/KompTest.hi b/tester/KompTest.hi
new file mode 100644
index 0000000..f3fa05e
Binary files /dev/null and b/tester/KompTest.hi differ
diff --git a/tester/KompTest.hs b/tester/KompTest.hs
new file mode 100644
index 0000000..79b6a7d
--- /dev/null
+++ b/tester/KompTest.hs
@@ -0,0 +1,299 @@
+-- {-# LANGUAGE NamedFieldPuns, ScopedTypeVariables #-}
+-- GHC needs -threaded
+module KompTest where
+
+import Control.Monad
+import Data.List
+import Data.Maybe
+import System
+import System.Directory
+import System.Environment
+import System.Exit
+import System.IO
+import System.FilePath
+import Data.Char
+import RunCommand
+
+data Backend = Backend {
+			name :: String,
+			objFile :: FilePath -> FilePath,
+			run  :: String -> FilePath -> FilePath -> FilePath -> IO Bool
+		       }
+
+--
+-- * Error reporting and output checking
+--
+
+reportErrorColor :: Color 
+                 -> String -- ^ command that failed
+	         -> String -- ^ how it failed
+	         -> FilePath -- ^ source file
+	         -> String -- ^ given input
+	         -> String -- ^ stdout output
+	         -> String -- ^ stderr output
+	         -> IO ()
+reportErrorColor col c m f i o e =
+    do
+    putStrLn $ color col $ c ++ " failed: " ++ m
+    putStrLn $ "For source file " ++ f ++ ":"
+    -- prFile f
+    when (not (null i)) $ do
+			  putStrLn "Given this input:"
+			  putStrLn $ color blue $ i
+    when (not (null o)) $ do
+			  putStrLn "It printed this to standard output:"
+			  putStrLn $ color blue $ o
+    when (not (null e)) $ do
+			  putStrLn "It printed this to standard error:"
+			  putStrLn $ color blue $ e
+
+reportError :: String -- ^ command that failed
+	    -> String -- ^ how it failed
+	    -> FilePath -- ^ source file
+	    -> String -- ^ given input
+	    -> String -- ^ stdout output
+	    -> String -- ^ stderr output
+	    -> IO ()
+reportError = reportErrorColor red
+
+data ErrorReport = ErrorReport {
+   repErr :: String,
+   repSeverity :: Severity,
+   repCmd :: String,
+   repStdIn :: String,
+   repStdOut :: String,
+   repStdErr :: String
+                 }
+
+data Severity = SWarning | SError | SInfo
+
+defRep = ErrorReport {
+   repErr = "OK",
+   repSeverity = SInfo,
+   repCmd = "",
+   repStdIn = "",
+   repStdOut = "",
+   repStdErr = "" 
+ }
+
+rep ?! msg = rep { repErr = msg, repSeverity = SError }
+rep ?? msg = rep { repErr = msg, repSeverity = SWarning }
+
+report0 er = case repSeverity er of
+                SInfo -> return True
+                _ -> do reportError (repCmd er) (repErr er) (repCmd er) (repStdIn er) (repStdOut er) (repStdErr er)
+                        return False
+
+report1 Nothing = return True
+report1 (Just rep) = report0 rep >> return False
+
+
+prFile :: FilePath -> IO ()
+prFile f = do
+	   putStrLn $ "---------------- begin " ++ f ++ " ------------------" 
+	   s <- readFile f
+	   putStrLn $ color green s
+	   putStrLn $ "----------------- end " ++ f ++ " -------------------" 
+
+
+-- | Report how many tests passed.
+report :: String -> [Bool] -> IO ()
+report n rs = 
+  do let (p,t) = (length (filter id rs), length rs)
+     putStrLn $ n ++ ": passed " ++ show p ++ " of " ++ show t ++ " tests"
+--
+-- * Generic running
+--
+
+runProg :: String -- ^ command
+	-> FilePath -- ^ source file (for error reporting)
+	-> FilePath -- ^ known input file
+	-> FilePath -- ^ known output file
+	-> IO Bool
+runProg c f i o =
+    do
+    fe <- doesFileExist i
+    input <- if fe then readFile i else return ""
+    output <- readFile o
+    (out,err,s) <- runCommandStrWait c input
+    case s of
+	   ExitFailure x -> do
+			    reportError c ("with status " ++ show x) f input out err
+			    return False
+	   ExitSuccess -> 
+	       do
+	       if not (null err) then
+		  do
+		  reportError c "Printed something to standard error" f input out err
+		  return False
+	        else if output /= out then
+		     do
+		     putStrLn $ color red $ c ++ " produced the wrong output:"
+		     putStrLn $ "For source file " ++ f ++ ":"
+		     prFile f
+		     when (not (null input)) $ do
+					       putStrLn "Given this input:"
+					       putStrLn $ color blue $ input
+		     putStrLn "It printed this to standard output:"
+		     putStrLn $ color blue $ out
+		     putStrLn "It should have printed this:"
+		     putStrLn $ color blue $ output
+		     return False
+		 else do
+		      putStrLn "output ok"
+		      return True
+
+testProg :: FilePath -- ^ executable
+         -> Backend
+	 -> FilePath -- ^ test file
+	 -> IO Bool
+testProg cmd b f = do
+    putStr $ "Testing " ++ takeFileName f ++ ": "
+    hFlush stdout
+    let n = dropExtension f
+	o = n ++ ".output"
+    let c = objFile b f
+    ofe <- doesFileExist o
+    if ofe then run b c f (n ++ ".input") o
+       else do
+	    putStrLn $ color blue $ "skipping: " ++ o ++ " not found"
+	    return True
+
+test :: FilePath -> [FilePath] -> Backend -> IO [Bool]
+test c fs b =
+    do putStrLn $ color green $ "Backend: " ++ name b 
+       mapM (testProg c b) fs
+
+--
+-- * Compilation
+--
+
+testCompilation :: FilePath -> Bool -> [FilePath] -> IO [Bool]
+testCompilation c good fs = 
+  do x <- doesFileExist c
+     forM fs $ \t -> report0 =<< do
+       if x then testCompilationProg c good t
+            else return $ defRep {repCmd = c} ?! ("compiler " ++ c ++ " not found")
+
+testCompilationProg :: FilePath -> Bool -> FilePath -> IO ErrorReport
+testCompilationProg path good f =
+    do let c = path ++ " " ++ f
+       putStrLn $ takeFileName path ++ " " ++ takeFileName f ++ "..."
+       (out,err,_) <- runCommandStrWait c ""
+       let rep = defRep {repCmd = f, repStdOut = out, repStdErr = err}
+       lns <- return $ lines err
+       return $ case filter (not . null) lns of 
+           msgs | isOk    msgs -> if good then rep                        else rep ?! "passed BAD program" 
+                | isError msgs -> if good then rep ?! "failed OK program" else rep
+           _ -> rep ?! "invalid output"
+    where isOk (s:_) | "OK" `isSuffixOf` tu s || "OK" `isPrefixOf` tu s = True
+          isOk _ = False
+          isError (s:_) | "ERROR" `isSuffixOf` tu s || "ERROR" `isPrefixOf` tu s = True
+          isError ("Syntax Error, trying to recover and continue parse...":"ERROR":_) = True
+          isError _ = False
+          tu = map toUpper
+
+
+--
+-- * JVM back-end
+--
+objFileJVM f = dropExtension f 
+
+runJVM ::  String -- libpath
+         -> String -- ^ Java class file
+	 -> FilePath -- ^ source file (for error reporting)
+	 -> FilePath -- ^ known input file
+	 -> FilePath -- ^ known output file
+	 -> IO Bool
+
+runJVM libPath classFile src inp outp = do
+  let dir  = takeDirectory classFile
+  d0  <- System.Directory.getCurrentDirectory
+  setCurrentDirectory dir
+  result <- runProg ("java -cp .:" ++ libPath ++ " " ++ takeBaseName classFile) src inp outp
+  setCurrentDirectory d0
+  return result
+
+jvmBackend libpath = Backend { name = "JVM", objFile = objFileJVM, 
+			 run = runJVM libpath }
+
+--
+-- * LLVM back-end
+--
+objFileLLVM f = dropExtension f <.> "bc"
+
+runLLVM ::  String -- libpath
+         -> String -- ^ LLVM bitcode file
+	 -> FilePath -- ^ source file (for error reporting)
+	 -> FilePath -- ^ known input file
+	 -> FilePath -- ^ known output file
+	 -> IO Bool
+
+runLLVM libPath bcFile src inp outp = do
+  let dir  = takeDirectory bcFile
+  d0  <- System.Directory.getCurrentDirectory
+  setCurrentDirectory dir
+  system ("rm a.out")
+  system ("llvm-ld " ++ bcFile ++ " " ++ libPath ++"/runtime.bc")
+  result <- runProg "./a.out" src inp outp
+  setCurrentDirectory d0
+  return result
+
+llvmBackend libpath = Backend { name = "LLVM", objFile = objFileLLVM, 
+			 run = runLLVM libpath }
+
+--
+-- * x86 back-end
+--
+
+objFilex86 f = dropExtension f <.> "o"
+
+runx86 libPath oFile src inp outp = do
+  let dir  = takeDirectory oFile
+  d0  <- System.Directory.getCurrentDirectory
+  setCurrentDirectory dir
+  system ("rm a.out")
+  system ("gcc -m32 " ++ oFile ++ " " ++ libPath ++"/runtime.o")
+  result <- runProg "./a.out" src inp outp
+  setCurrentDirectory d0
+  return result
+
+x86Backend libpath = Backend { name = "x86", objFile = objFilex86,
+                               run = runx86 libpath }
+
+getTestFilesForPath :: String -> IO [String]
+getTestFilesForPath f = do
+  d <- doesDirectoryExist f
+  if d then jlFiles f else do
+    d' <- doesFileExist f
+    if d' then return [f]
+          else error $ "Not a file or directory: " ++ f
+        
+                                    
+
+-- | Get all .jl files in the given directory.
+jlFiles :: FilePath -> IO [FilePath]
+jlFiles d = do fs <- getDirectoryContents d
+               return $ map (d </>) $ sort $ filter ((".jl" ==) . takeExtension) fs
+
+
+--
+-- * Terminal output colors
+--
+
+type Color = Int
+
+color :: Color -> String -> String
+color c s = fgcol c ++ s ++ normal
+
+highlight = "\ESC[7m"
+bold      = "\ESC[1m"
+underline = "\ESC[4m"
+normal    = "\ESC[0m"
+fgcol col = "\ESC[0" ++ show (30+col) ++ "m"
+bgcol col = "\ESC[0" ++ show (40+col) ++ "m"
+
+red, green, blue :: Color
+red = 1
+green = 2
+blue = 4
diff --git a/tester/KompTest.o b/tester/KompTest.o
new file mode 100644
index 0000000..308855e
Binary files /dev/null and b/tester/KompTest.o differ
diff --git a/tester/Makefile b/tester/Makefile
new file mode 100644
index 0000000..8a0bb56
--- /dev/null
+++ b/tester/Makefile
@@ -0,0 +1,9 @@
+all: Grade
+
+tests.tgz:
+	tar -czvf $@ `find examples -name "*.jl" -or -name "*.output"`
+
+%: %.hs *.hs
+	ghc -main-is $* -threaded --make $<
+clean:
+	rm *.{hi,o} Grade
diff --git a/tester/README.txt b/tester/README.txt
new file mode 100644
index 0000000..b563760
--- /dev/null
+++ b/tester/README.txt
@@ -0,0 +1,82 @@
+The Javalette test programs are in (subdirectories of) directory examples.
+
+This directory contains a test driver (Grade.hs, RunCommand.hs and KompTest.hs) that
+can be used to run the tests for your project.
+
+Prerequisites
+----------
+
+We expect that you are using a Unix-like system (including Linux and
+Mac OS X) and have the Haskell compiler ghc in your path.
+You will then just have to do 
+
+make
+
+in this directory to compile the test program. This  gives the executable program 
+Grade in this same directory.
+
+Running the tests
+-----------------
+
+Assume that your submission directory is dir and that your
+compiler is called jlc. Assume also that dir/lib 
+contains the runtime support file (Runtime.class for submission A,
+runtime.bc and/or runtime.o for submission B). For submission A, 
+also jasmin.jar should be in dir/lib.
+
+The test driver takes a number of options and two directories as
+command line arguments. The possible options are
+
+-s <name>                   The name of your compiler (in directory dir) is <name> (default is "jlc")
+-b JVM                              Target files are JVM .class files
+-b LLVM                           Target files are LLVM .bc files
+-b x86                              Target files are x86 .o files
+-x <extension>     Implemented extensions (only for submission B).
+
+The first of the two path arguments specifies where to find the
+directory examples which contains the testsuite (it is in this
+directory). The second specifies your submission directory. 
+Thus, from this directory you may run
+./Grade . dir
+
+to compile all the basic javalette programs. The test driver will not 
+attempt to run the good programs, so you may do the above
+already when you have the parser working, and then when you 
+have the typechecker working. 
+
+To also run the good programs, you must specify the backend as
+indicated above, i.e. for submission A
+
+./Grade -b JVM . dir
+
+The test driver will report its activities in compiling the test
+programs and running the good ones. If your compiler is correct, 
+output will end as follows:
+
+Summary:
+ 0 Compiling core programs (48/48)
+ 0 Running core programs (22/22)
+
+Credits total: 0
+
+All 48 test programs were compiled and gave correct indication OK or
+ERROR to stderr. The 22 correct programs were run and gave correct output.
+
+
+Preparing a submission
+-------------------
+
+Your submission must be structured as specified in Appendix A of the
+project description. We suggest that, after having prepared your tar
+ball, you place it in an empty directory dir1 and run
+
+./Grade -b JVM . dir1 
+
+from this directory. The grading program, when it finds a tar ball in
+the submission directory, starts by extracting and building your
+compiler, before running the test suite. This is how we test your
+submission, so you can check whether building and testing succeeds 
+before you submit. Note that if the tester does not succeed on your 
+submission, we will reject it without further checks, and you will
+anyhow have to redo the submission according to specification. 
+
diff --git a/tester/RunCommand.hi b/tester/RunCommand.hi
new file mode 100644
index 0000000..fa46aad
Binary files /dev/null and b/tester/RunCommand.hi differ
diff --git a/tester/RunCommand.hs b/tester/RunCommand.hs
new file mode 100644
index 0000000..4830c0c
--- /dev/null
+++ b/tester/RunCommand.hs
@@ -0,0 +1,70 @@
+module RunCommand (runCommandStrWait) where
+import System.Process
+import System.Exit
+import System.IO
+import Control.Concurrent
+import Control.Concurrent.Chan
+import Data.Either
+
+type Pipe = Chan (Either Char ())
+
+pipeGetContents :: Pipe -> IO String
+pipeGetContents p = 
+    do
+    s <- getChanContents p
+    return $ map fromLeft $ takeWhile isLeft s
+
+pipeWrite :: Pipe -> String -> IO ()
+pipeWrite p s = writeList2Chan p (map Left s)
+
+-- close the pipe for writing
+pipeClose :: Pipe -> IO ()
+pipeClose p = writeChan p (Right ())
+
+
+--
+-- * Either utilities
+--
+
+isLeft :: Either a b -> Bool
+isLeft = either (const True) (const False)
+
+fromLeft :: Either a b -> a
+fromLeft =  either id (error "fromLeft: Right")
+
+--
+-- * Various versions of runCommand
+--
+
+runCommandChan :: String -- ^ command
+	      -> IO (Pipe,Pipe,Pipe,ProcessHandle) -- ^ stdin, stdout, stderr, process
+runCommandChan c = 
+    do
+    inC  <- newChan
+    outC <- newChan
+    errC <- newChan
+    (pin,pout,perr,p) <- runInteractiveCommand c
+    forkIO (pipeGetContents inC >>= hPutStr pin >> hClose pin)
+    forkIO (hGetContents pout >>= pipeWrite outC >> pipeClose outC)
+    forkIO (hGetContents perr >>= pipeWrite errC >> pipeClose errC)
+    return (inC,outC,errC,p)
+
+runCommandStr :: String -- ^ command
+	      -> String -- ^ stdin data
+	      -> IO (String,String,ProcessHandle) -- ^ stdout, stderr, process
+runCommandStr c inStr = 
+    do
+    (inC,outC,errC,p) <- runCommandChan c
+    forkIO (pipeWrite inC inStr >> pipeClose inC) 
+    out <- pipeGetContents outC
+    err <- pipeGetContents errC
+    return (out,err,p)
+
+runCommandStrWait :: String -- ^ command
+		  -> String -- ^ stdin data
+		  -> IO (String,String,ExitCode) -- ^ stdout, stderr, process exit status
+runCommandStrWait c inStr =
+    do
+    (out,err,p) <- runCommandStr c inStr
+    s <- waitForProcess p
+    return (out,err,s)
diff --git a/tester/RunCommand.o b/tester/RunCommand.o
new file mode 100644
index 0000000..dc8a25d
Binary files /dev/null and b/tester/RunCommand.o differ
diff --git a/tester/testsuite/bad/bad001.jl b/tester/testsuite/bad/bad001.jl
new file mode 100644
index 0000000..33662f5
--- /dev/null
+++ b/tester/testsuite/bad/bad001.jl
@@ -0,0 +1 @@
+/*
diff --git a/tester/testsuite/bad/bad002.jl b/tester/testsuite/bad/bad002.jl
new file mode 100644
index 0000000..7898192
--- /dev/null
+++ b/tester/testsuite/bad/bad002.jl
@@ -0,0 +1 @@
+a
diff --git a/tester/testsuite/bad/bad003.jl b/tester/testsuite/bad/bad003.jl
new file mode 100644
index 0000000..22e9f36
--- /dev/null
+++ b/tester/testsuite/bad/bad003.jl
@@ -0,0 +1,3 @@
+int f(int x, int x) {
+   return x;
+}
\ No newline at end of file
diff --git a/tester/testsuite/bad/bad004.jl b/tester/testsuite/bad/bad004.jl
new file mode 100644
index 0000000..8fb68cc
--- /dev/null
+++ b/tester/testsuite/bad/bad004.jl
@@ -0,0 +1,4 @@
+int main)( {
+        return 0;
+        return 1;
+}
diff --git a/tester/testsuite/bad/bad005.jl b/tester/testsuite/bad/bad005.jl
new file mode 100644
index 0000000..55d4ac4
--- /dev/null
+++ b/tester/testsuite/bad/bad005.jl
@@ -0,0 +1 @@
+foo() {}
diff --git a/tester/testsuite/bad/bad006.jl b/tester/testsuite/bad/bad006.jl
new file mode 100644
index 0000000..011c75a
--- /dev/null
+++ b/tester/testsuite/bad/bad006.jl
@@ -0,0 +1,4 @@
+int main() {
+        x = 14;
+	return 0 ;
+}
diff --git a/tester/testsuite/bad/bad007.jl b/tester/testsuite/bad/bad007.jl
new file mode 100644
index 0000000..4430234
--- /dev/null
+++ b/tester/testsuite/bad/bad007.jl
@@ -0,0 +1,5 @@
+int main() {
+        int x;
+        int x;
+	return 0 ;
+}
diff --git a/tester/testsuite/bad/bad008.jl b/tester/testsuite/bad/bad008.jl
new file mode 100644
index 0000000..f88efe8
--- /dev/null
+++ b/tester/testsuite/bad/bad008.jl
@@ -0,0 +1,4 @@
+  int main() { 
+    if (false)
+       return 0; 
+}
diff --git a/tester/testsuite/bad/bad009.jl b/tester/testsuite/bad/bad009.jl
new file mode 100644
index 0000000..07e877e
--- /dev/null
+++ b/tester/testsuite/bad/bad009.jl
@@ -0,0 +1,5 @@
+int main() {
+        int x;
+        x = true;
+        return 1;
+}
diff --git a/tester/testsuite/bad/bad010.jl b/tester/testsuite/bad/bad010.jl
new file mode 100644
index 0000000..29461d7
--- /dev/null
+++ b/tester/testsuite/bad/bad010.jl
@@ -0,0 +1,6 @@
+int main() {
+        if (true)
+                return;
+	;
+        return 1;
+}
diff --git a/tester/testsuite/bad/bad011.jl b/tester/testsuite/bad/bad011.jl
new file mode 100644
index 0000000..060b0fa
--- /dev/null
+++ b/tester/testsuite/bad/bad011.jl
@@ -0,0 +1,3 @@
+int main() {
+     return true;
+}
diff --git a/tester/testsuite/bad/bad012.jl b/tester/testsuite/bad/bad012.jl
new file mode 100644
index 0000000..0454eb5
--- /dev/null
+++ b/tester/testsuite/bad/bad012.jl
@@ -0,0 +1,6 @@
+int main() {
+     int i = foo(true);
+     return 0 ;
+}
+
+int foo(boolean b) { b = true; }
diff --git a/tester/testsuite/bad/bad013.jl b/tester/testsuite/bad/bad013.jl
new file mode 100644
index 0000000..5a4e7c0
--- /dev/null
+++ b/tester/testsuite/bad/bad013.jl
@@ -0,0 +1,5 @@
+int main() {
+      double x ;
+      x = 2 * 3.14 ;
+      return 0 ;
+}
diff --git a/tester/testsuite/bad/bad015.jl b/tester/testsuite/bad/bad015.jl
new file mode 100644
index 0000000..b4655cd
--- /dev/null
+++ b/tester/testsuite/bad/bad015.jl
@@ -0,0 +1,6 @@
+// passing doubles to printInt().
+
+int main() {
+	printInt(1.0);
+	return 0 ;
+}
diff --git a/tester/testsuite/bad/bad016.jl b/tester/testsuite/bad/bad016.jl
new file mode 100644
index 0000000..e81ad8b
--- /dev/null
+++ b/tester/testsuite/bad/bad016.jl
@@ -0,0 +1,6 @@
+// passing integers to printDouble().
+
+int main() {
+	printDouble(1);
+	return 0 ;
+}
diff --git a/tester/testsuite/bad/bad017.jl b/tester/testsuite/bad/bad017.jl
new file mode 100644
index 0000000..78d8ac5
--- /dev/null
+++ b/tester/testsuite/bad/bad017.jl
@@ -0,0 +1,11 @@
+// 0 instead of 1 argument
+
+int main() {
+	int x = foo();
+	return 0 ;
+}
+
+int foo(int y) {
+ return y;
+}
+
diff --git a/tester/testsuite/bad/bad018.jl b/tester/testsuite/bad/bad018.jl
new file mode 100644
index 0000000..dda63a5
--- /dev/null
+++ b/tester/testsuite/bad/bad018.jl
@@ -0,0 +1,11 @@
+// 1 instead of 2 arguments
+
+int main() {
+	int x = foo(1);
+	return 0 ;
+}
+
+int foo(int y,int z) {
+ return y;
+}
+
diff --git a/tester/testsuite/bad/bad019.jl b/tester/testsuite/bad/bad019.jl
new file mode 100644
index 0000000..b5f42f7
--- /dev/null
+++ b/tester/testsuite/bad/bad019.jl
@@ -0,0 +1,11 @@
+// 2 instead of 1 arguments
+
+int main() {
+	int x = foo(1,2);
+	return 0 ;
+}
+
+int foo(int y) {
+ return y;
+}
+
diff --git a/tester/testsuite/bad/bad020.jl b/tester/testsuite/bad/bad020.jl
new file mode 100644
index 0000000..8817e85
--- /dev/null
+++ b/tester/testsuite/bad/bad020.jl
@@ -0,0 +1,8 @@
+// Compare double with boolean.
+
+int main() {
+  if (2.0 == true) {
+   printString("foo");
+  }
+  return 0 ;
+}
\ No newline at end of file
diff --git a/tester/testsuite/bad/bad021.jl b/tester/testsuite/bad/bad021.jl
new file mode 100644
index 0000000..311fba4
--- /dev/null
+++ b/tester/testsuite/bad/bad021.jl
@@ -0,0 +1,6 @@
+/* Testing that main must return. */
+
+/* All functions should return a value of their value type. This is not a valid Javalette program: */
+
+int main() {
+}
diff --git a/tester/testsuite/bad/bad022.jl b/tester/testsuite/bad/bad022.jl
new file mode 100644
index 0000000..48099d6
--- /dev/null
+++ b/tester/testsuite/bad/bad022.jl
@@ -0,0 +1,6 @@
+// Assigning double to int variable.
+
+int main () {
+ int x = 1.0;
+ return 0 ;
+}
\ No newline at end of file
diff --git a/tester/testsuite/bad/bad023.jl b/tester/testsuite/bad/bad023.jl
new file mode 100644
index 0000000..40d4c7b
--- /dev/null
+++ b/tester/testsuite/bad/bad023.jl
@@ -0,0 +1,6 @@
+// Assigning int to double variable.
+
+int main () {
+ double x = 1;
+ return 0 ;
+}
\ No newline at end of file
diff --git a/tester/testsuite/bad/bad024.jl b/tester/testsuite/bad/bad024.jl
new file mode 100644
index 0000000..cfc3de6
--- /dev/null
+++ b/tester/testsuite/bad/bad024.jl
@@ -0,0 +1,4 @@
+int main() {
+    if (false) 
+       return 0;
+}
diff --git a/tester/testsuite/bad/bad025.jl b/tester/testsuite/bad/bad025.jl
new file mode 100644
index 0000000..63ccc7d
--- /dev/null
+++ b/tester/testsuite/bad/bad025.jl
@@ -0,0 +1,8 @@
+int main() {
+   return f(3); 
+}
+
+int f(int x) {
+    if (x<0) 
+       return x;
+}
diff --git a/tester/testsuite/bad/bad026.jl b/tester/testsuite/bad/bad026.jl
new file mode 100644
index 0000000..ba54323
--- /dev/null
+++ b/tester/testsuite/bad/bad026.jl
@@ -0,0 +1,7 @@
+// Assigning double to int variable.
+
+int main () {
+ int x;
+  x = 1.0;
+ return 0 ;
+}
\ No newline at end of file
diff --git a/tester/testsuite/bad/bad027.jl b/tester/testsuite/bad/bad027.jl
new file mode 100644
index 0000000..403eb5e
--- /dev/null
+++ b/tester/testsuite/bad/bad027.jl
@@ -0,0 +1,7 @@
+// Assigning int to double variable.
+
+int main () {
+ double x;
+ x = 1;
+ return 0 ;
+}
\ No newline at end of file
diff --git a/tester/testsuite/extensions/arrays1/array001.jl b/tester/testsuite/extensions/arrays1/array001.jl
new file mode 100644
index 0000000..f5c6642
--- /dev/null
+++ b/tester/testsuite/extensions/arrays1/array001.jl
@@ -0,0 +1,16 @@
+int main() {
+
+  int[] a = new int[10];
+  int j=0;
+  while (j<a.length) {
+     a[j] = j;
+     j++;
+  }
+
+  for (int x : a) 
+     printInt(x);
+
+  int x = 45;
+  printInt(x);
+  return 0;
+}
\ No newline at end of file
diff --git a/tester/testsuite/extensions/arrays1/array001.output b/tester/testsuite/extensions/arrays1/array001.output
new file mode 100644
index 0000000..81dc252
--- /dev/null
+++ b/tester/testsuite/extensions/arrays1/array001.output
@@ -0,0 +1,11 @@
+0
+1
+2
+3
+4
+5
+6
+7
+8
+9
+45
diff --git a/tester/testsuite/extensions/arrays1/array002.j b/tester/testsuite/extensions/arrays1/array002.j
new file mode 100644
index 0000000..e69de29
diff --git a/tester/testsuite/extensions/arrays1/array002.jl b/tester/testsuite/extensions/arrays1/array002.jl
new file mode 100644
index 0000000..f347b18
--- /dev/null
+++ b/tester/testsuite/extensions/arrays1/array002.jl
@@ -0,0 +1,46 @@
+int [] doubleArray (int [] a){
+  int [] res = new int [a . length];
+  int i = 0 ;
+  for (int n : a){
+    res [i] = 2 * n ;
+    i ++ ;
+  }
+  return res ;
+}
+
+void shiftLeft (int [] a){
+  int x = a [0];
+  int i = 0 ;
+  while (i < a.length - 1){
+    a [i] = a [i + 1];
+    i ++ ;
+  }
+  a[a.length - 1]= x ;
+  return;
+ }
+
+int scalProd(int[] a, int[] b) {
+  int res = 0;
+  int i = 0;
+  while (i < a.length) {
+    res = res + a[i] * b[i];
+    i++;
+  }
+  return res;
+}
+
+int main () {
+  int [] a = new int [5];
+  int i = 0 ;
+  while (i < a.length){
+    a [i]= i ;
+    i ++ ;
+    }
+  shiftLeft (a);
+  int [] b = doubleArray (a);
+  for (int x : a)printInt (x);
+  for (int x : b)printInt (x);
+  printInt(scalProd(a,b));
+  return 0 ;
+}
+ 
\ No newline at end of file
diff --git a/tester/testsuite/extensions/arrays1/array002.ll b/tester/testsuite/extensions/arrays1/array002.ll
new file mode 100644
index 0000000..e69de29
diff --git a/tester/testsuite/extensions/arrays1/array002.output b/tester/testsuite/extensions/arrays1/array002.output
new file mode 100644
index 0000000..7f933f4
--- /dev/null
+++ b/tester/testsuite/extensions/arrays1/array002.output
@@ -0,0 +1,11 @@
+1
+2
+3
+4
+0
+2
+4
+6
+8
+0
+60
diff --git a/tester/testsuite/extensions/arrays2/array003.jl b/tester/testsuite/extensions/arrays2/array003.jl
new file mode 100644
index 0000000..289d2ee
--- /dev/null
+++ b/tester/testsuite/extensions/arrays2/array003.jl
@@ -0,0 +1,35 @@
+int main() {
+
+  double[] vector = new double[4];
+  double[][] matrix = new double[3][4];
+
+  int i=0;
+  while (i<matrix.length) {
+    int j=0;
+    while (j<matrix[0].length) {
+       matrix[i][j] = 5.0;
+       j++;
+    }
+    i++;
+  }
+
+  i=0;
+  while (i<vector.length-1) {
+     vector[i] = 3.0;
+     i++;
+  }
+
+  matrix[0] = vector; 
+
+  int j = 0;
+  while (j<vector.length) {
+    matrix[1][j] = vector[j]+1.0;
+    j++;
+  }
+  
+  for (double[] x : matrix)
+    for (double y : x)
+      printDouble(y);
+
+  return 0 ;
+}
diff --git a/tester/testsuite/extensions/arrays2/array003.output b/tester/testsuite/extensions/arrays2/array003.output
new file mode 100644
index 0000000..3d5dfed
--- /dev/null
+++ b/tester/testsuite/extensions/arrays2/array003.output
@@ -0,0 +1,12 @@
+3.0
+3.0
+3.0
+0.0
+4.0
+4.0
+4.0
+1.0
+5.0
+5.0
+5.0
+5.0
diff --git a/tester/testsuite/extensions/objects1/counter.jl b/tester/testsuite/extensions/objects1/counter.jl
new file mode 100644
index 0000000..44e252b
--- /dev/null
+++ b/tester/testsuite/extensions/objects1/counter.jl
@@ -0,0 +1,19 @@
+int main () {
+  Counter c;
+  c = new Counter;
+  c.incr();
+  c.incr();
+  c.incr();
+  int x = c.value();
+  printInt(x);
+  return 0;
+}
+
+class Counter {
+  int val;
+
+  void incr () {val++; return;}
+
+  int value () {return val;}
+
+}
diff --git a/tester/testsuite/extensions/objects1/counter.output b/tester/testsuite/extensions/objects1/counter.output
new file mode 100644
index 0000000..00750ed
--- /dev/null
+++ b/tester/testsuite/extensions/objects1/counter.output
@@ -0,0 +1 @@
+3
diff --git a/tester/testsuite/extensions/objects1/linked.jl b/tester/testsuite/extensions/objects1/linked.jl
new file mode 100644
index 0000000..dc4eeae
--- /dev/null
+++ b/tester/testsuite/extensions/objects1/linked.jl
@@ -0,0 +1,50 @@
+class Node {
+  int elem;
+  Node next;
+
+  void setElem(int c) { elem = c; }
+
+  void setNext(Node n) { next = n; }
+
+  int getElem() { return elem; }
+
+  Node getNext() { return next; }
+}
+
+class Stack {
+  Node head;
+
+  void push(int c) {
+    Node newHead = new Node;
+    newHead.setElem(c);
+    newHead.setNext(head);
+    head = newHead;
+  }
+
+  boolean isEmpty() {
+    return head==(Node)null;
+  }
+
+  int top() {
+    return head.getElem();
+  }
+
+  void pop() {
+    head = head.getNext();
+  }
+}
+
+int main() {
+   Stack s = new Stack;
+   int i= 0;
+   while (i<10) {
+     s.push(i);
+     i++;
+   }
+     
+   while (!s.isEmpty()) {
+     printInt(s.top());
+     s.pop();
+   }
+   return 0;
+}
diff --git a/tester/testsuite/extensions/objects1/linked.output b/tester/testsuite/extensions/objects1/linked.output
new file mode 100644
index 0000000..ba6e481
--- /dev/null
+++ b/tester/testsuite/extensions/objects1/linked.output
@@ -0,0 +1,10 @@
+9
+8
+7
+6
+5
+4
+3
+2
+1
+0
diff --git a/tester/testsuite/extensions/objects1/points.jl b/tester/testsuite/extensions/objects1/points.jl
new file mode 100644
index 0000000..61c0169
--- /dev/null
+++ b/tester/testsuite/extensions/objects1/points.jl
@@ -0,0 +1,62 @@
+class Point2 {
+  int x;
+  int y;
+
+  void move (int dx, int dy) {
+     x = x + dx;
+     y = y + dy;
+  }
+
+  int getX () { return x; }
+
+  int getY () { return y; }
+}
+
+class Point3 extends Point2 {
+  int z;
+
+  void moveZ (int dz) {
+    z = z + dz;
+  }
+
+  int getZ () { return z; }
+
+}
+
+class Point4 extends Point3 {
+  int w;
+
+  void moveW (int dw) {
+    w = w + dw;
+  }
+
+  int getW () { return w; }
+
+}
+
+
+
+int main () {
+  Point2 p = new Point3;
+
+  Point3 q = new Point3;
+
+  Point4 r = new Point4;
+
+  q.move(2,4);
+  q.moveZ(7);
+  p = q;
+
+  p.move(3,5);
+ 
+  r.move(1,3);
+  r.moveZ(6);
+  r.moveW(2);
+
+  printInt(p.getX());  
+  printInt(p.getY());  
+  printInt(q.getZ());  
+  printInt(r.getW());
+  return 0;
+
+}
\ No newline at end of file
diff --git a/tester/testsuite/extensions/objects1/points.output b/tester/testsuite/extensions/objects1/points.output
new file mode 100644
index 0000000..cb21f34
--- /dev/null
+++ b/tester/testsuite/extensions/objects1/points.output
@@ -0,0 +1,4 @@
+5
+9
+7
+2
diff --git a/tester/testsuite/extensions/objects1/queue.jl b/tester/testsuite/extensions/objects1/queue.jl
new file mode 100644
index 0000000..7def5a2
--- /dev/null
+++ b/tester/testsuite/extensions/objects1/queue.jl
@@ -0,0 +1,61 @@
+class Node {
+  int elem;
+  Node next;
+
+  void setElem (int e)  { elem = e; }
+  void setNext (Node n) { next = n; }
+
+  int  getElem () { return elem; }
+  Node getNext () { return next; }
+
+}
+
+class IntQueue {
+  Node front;
+  Node rear;
+
+  boolean isEmpty () { return front == (Node)null; }
+
+  void insert (int x) {
+    Node last = new Node;
+    last.setElem(x);
+    if (self.isEmpty())
+      front = last;
+    else 
+      rear.setNext(last);
+    rear = last;
+  }
+
+  int first () { return front.getElem(); }
+
+  void rmFirst () {
+    front = front.getNext();
+  }
+
+  int size () {
+      Node n = front;
+      int res = 0;
+      while (n != (Node)null) {
+        n = n.getNext();
+        res++;
+      }
+     return res;
+  }
+}
+
+int f (int x) {
+  return x*x + 3;
+}
+
+int main () {
+  IntQueue q = new IntQueue;
+  q.insert(f(3));
+  q.insert(5);
+  q.insert(7);
+  printInt(q.first());
+  q.rmFirst();
+  printInt(q.size());
+  return 0;
+}
+
+     
\ No newline at end of file
diff --git a/tester/testsuite/extensions/objects1/queue.output b/tester/testsuite/extensions/objects1/queue.output
new file mode 100644
index 0000000..5334941
--- /dev/null
+++ b/tester/testsuite/extensions/objects1/queue.output
@@ -0,0 +1,2 @@
+12
+2
diff --git a/tester/testsuite/extensions/objects2/shapes.jl b/tester/testsuite/extensions/objects2/shapes.jl
new file mode 100644
index 0000000..4ff6e2c
--- /dev/null
+++ b/tester/testsuite/extensions/objects2/shapes.jl
@@ -0,0 +1,82 @@
+class Node {
+  Shape elem;
+  Node next;
+
+  void setElem(Shape c) { elem = c; }
+
+  void setNext(Node n) { next = n; }
+
+  Shape getElem() { return elem; }
+
+  Node getNext() { return next; }
+}
+
+class Stack {
+  Node head;
+
+  void push(Shape c) {
+    Node newHead = new Node;
+    newHead.setElem(c);
+    newHead.setNext(head);
+    head = newHead;
+  }
+
+  boolean isEmpty() {
+    return head==(Node)null;
+  }
+
+  Shape top() {
+    return head.getElem();
+  }
+
+  void pop() {
+    head = head.getNext();
+  }
+}
+
+class Shape {
+  void tell () {
+    printString("I'm a shape");
+  }
+
+  void tellAgain() {
+     printString("I'm just a shape");
+  }
+}
+
+class Rectangle extends Shape {
+  void tellAgain() {
+    printString("I'm really a rectangle");
+  }
+}
+
+class Circle extends Shape {
+  void tellAgain() {
+    printString("I'm really a circle");
+  }
+}
+
+class Square extends Rectangle {
+  void tellAgain() {
+    printString("I'm really a square");
+  }
+}
+
+int main() {
+  Stack stk = new Stack;
+  Shape s = new Shape;
+  stk.push(s);
+  s = new Rectangle;
+  stk.push(s);
+  s = new Square;
+  stk.push(s);
+  s = new Circle;
+  stk.push(s);
+  while (!stk.isEmpty()) {
+    s = stk.top();
+    s.tell();
+    s.tellAgain();
+    stk.pop();
+  }
+  return 0;
+}
diff --git a/tester/testsuite/extensions/objects2/shapes.output b/tester/testsuite/extensions/objects2/shapes.output
new file mode 100644
index 0000000..339e697
--- /dev/null
+++ b/tester/testsuite/extensions/objects2/shapes.output
@@ -0,0 +1,8 @@
+I'm a shape
+I'm really a circle
+I'm a shape
+I'm really a square
+I'm a shape
+I'm really a rectangle
+I'm a shape
+I'm just a shape
diff --git a/tester/testsuite/extensions/pointers/list.j b/tester/testsuite/extensions/pointers/list.j
new file mode 100644
index 0000000..e69de29
diff --git a/tester/testsuite/extensions/pointers/list.jl b/tester/testsuite/extensions/pointers/list.jl
new file mode 100644
index 0000000..3e172dd
--- /dev/null
+++ b/tester/testsuite/extensions/pointers/list.jl
@@ -0,0 +1,48 @@
+typedef struct Node *list;
+
+struct Node {
+  int elem;
+  list next;
+};
+
+
+int main() {
+  printInt(length(fromTo(1,50)));
+  printInt(length2(fromTo(1,100)));
+  return 0;
+}
+
+int head (list xs) {
+  return xs -> elem;
+}
+ 
+list cons (int x, list xs) {
+  list n;
+  n = new Node;
+  n->elem = x;
+  n->next = xs;
+  return n;
+}
+
+int length (list xs) {
+  if (xs==(list)null)
+    return 0;
+  else
+    return 1 + length (xs->next);
+}
+
+list fromTo (int m, int n) {
+  if (m>n)
+    return (list)null;
+  else 
+    return cons (m,fromTo (m+1,n));
+}
+
+int length2 (list xs) {
+  int res = 0;
+  while (xs != (list)null) {
+    res++;
+    xs = xs->next;
+  }
+  return res;
+}
diff --git a/tester/testsuite/extensions/pointers/list.output b/tester/testsuite/extensions/pointers/list.output
new file mode 100644
index 0000000..454f8f4
--- /dev/null
+++ b/tester/testsuite/extensions/pointers/list.output
@@ -0,0 +1,2 @@
+50
+100
diff --git a/tester/testsuite/extensions/pointers/tree.j b/tester/testsuite/extensions/pointers/tree.j
new file mode 100644
index 0000000..e69de29
diff --git a/tester/testsuite/extensions/pointers/tree.jl b/tester/testsuite/extensions/pointers/tree.jl
new file mode 100644
index 0000000..fd793e2
--- /dev/null
+++ b/tester/testsuite/extensions/pointers/tree.jl
@@ -0,0 +1,78 @@
+struct Node {
+  tree left;
+  int val;
+  tree right;
+};
+
+typedef struct Node *tree;
+
+struct Header {
+  tree elems;
+};
+
+typedef struct Header *intset;
+
+void insert (int x, intset s) {
+  s->elems = insertTree(x,s->elems);
+  return;
+}
+
+boolean isElem(int x, intset s) {
+  return isElemTree (x,s->elems);
+}
+
+tree insertTree(int x,tree t) {
+  if (t==(tree)null) {
+    tree n1;
+    n1 = new Node;
+    n1->left = (tree)null;
+    n1->val = x;
+    n1->right = (tree)null;
+    return n1;
+  }   
+  else if (x < t->val) 
+          t->left = insertTree (x,t->left);
+  else if (x > t->val)
+          t->right = insertTree (x,t->right);
+  return t;
+}
+
+boolean isElemTree(int x,tree t) {
+  if (t==(tree)null)
+    return false;
+  else if (x==t->val) 
+    return true;
+  else if (x < t->val)
+    return isElemTree (x, t->left);
+  else
+    return isElemTree(x, t->right);
+}
+
+void printElem(int n, intset s) {
+  if (isElem(n,s))
+     printString("Elem!");
+  else
+     printString("Not elem!");
+  return;
+}
+
+int main () {
+  intset s;
+  s = new Header;
+  s->elems = (tree)null;
+
+  int x = 3;
+  int i = 0;
+  while (i<100) {
+    x = (x * 37) % 100;
+    i++;
+    insert(x, s);
+  }
+  printElem(23,s);
+  printElem(24,s);
+  printElem(25,s);
+  return 0;
+}
+    
+
+    
\ No newline at end of file
diff --git a/tester/testsuite/extensions/pointers/tree.output b/tester/testsuite/extensions/pointers/tree.output
new file mode 100644
index 0000000..1759efe
--- /dev/null
+++ b/tester/testsuite/extensions/pointers/tree.output
@@ -0,0 +1,3 @@
+Elem!
+Not elem!
+Not elem!
diff --git a/tester/testsuite/good/core001.jl b/tester/testsuite/good/core001.jl
new file mode 100644
index 0000000..482d2db
--- /dev/null
+++ b/tester/testsuite/good/core001.jl
@@ -0,0 +1,73 @@
+int main() {
+	printInt(fac(10));
+	printInt(rfac(10));
+	printInt(mfac(10));
+        printInt(ifac(10));
+        double r ; // just to test blocks 
+	{
+	  int n = 10;
+	  int r = 1;
+	  while (n>0) {
+	    r = r * n;
+	    n--;
+	  }
+	  printInt(r);
+	}
+	printDouble(dfac(10.0));
+	printString ("hello */");
+        printString ("/* world") ;
+        return 0 ;
+}
+
+int fac(int a) {
+	int r;
+	int n;
+
+	r = 1;
+	n = a;
+	while (n > 0) {
+	  r = r * n;
+	  n = n - 1;
+	}
+	return r;
+}
+
+int rfac(int n) {
+	if (n == 0)
+	  return 1;
+	else
+	  return n * rfac(n-1);
+}
+
+int mfac(int n) {
+	if (n == 0)
+	  return 1;
+	else
+	  return n * nfac(n-1);
+}
+
+int nfac(int n) {
+	if (n != 0)
+	  return mfac(n-1) * n;
+	else
+	  return 1;
+}
+
+double dfac(double n) {
+	if (n == 0.0)
+	  return 1.0;
+	else
+	  return n * dfac(n-1.0);
+}
+
+int ifac(int n) { return ifac2f(1,n); }
+
+int ifac2f(int l, int h) {
+        if (l == h)
+          return l;
+        if (l > h)
+          return 1;
+        int m;
+        m = (l + h) / 2;
+        return ifac2f(l,m) * ifac2f(m+1,h);
+}
diff --git a/tester/testsuite/good/core001.output b/tester/testsuite/good/core001.output
new file mode 100644
index 0000000..0104bc2
--- /dev/null
+++ b/tester/testsuite/good/core001.output
@@ -0,0 +1,8 @@
+3628800
+3628800
+3628800
+3628800
+3628800
+3628800.0
+hello */
+/* world
diff --git a/tester/testsuite/good/core002.jl b/tester/testsuite/good/core002.jl
new file mode 100644
index 0000000..67a9681
--- /dev/null
+++ b/tester/testsuite/good/core002.jl
@@ -0,0 +1,12 @@
+/* void expression as statement */
+
+int main() {
+  foo();
+  return 0 ;
+
+}
+
+void foo() {
+   printString("foo");
+   return;
+}
diff --git a/tester/testsuite/good/core002.output b/tester/testsuite/good/core002.output
new file mode 100644
index 0000000..257cc56
--- /dev/null
+++ b/tester/testsuite/good/core002.output
@@ -0,0 +1 @@
+foo
diff --git a/tester/testsuite/good/core003.jl b/tester/testsuite/good/core003.jl
new file mode 100644
index 0000000..5232245
--- /dev/null
+++ b/tester/testsuite/good/core003.jl
@@ -0,0 +1,23 @@
+// Testing the return checker
+
+int f () {
+   if (true)
+     return 0;
+   else
+     {}
+}
+
+int g () {
+  if (false) 
+      {}
+  else
+      return 0;
+}
+
+void p () {}
+  
+
+int main() {
+  p();
+  return 0;
+}
diff --git a/tester/testsuite/good/core003.output b/tester/testsuite/good/core003.output
new file mode 100644
index 0000000..e69de29
diff --git a/tester/testsuite/good/core004.jl b/tester/testsuite/good/core004.jl
new file mode 100644
index 0000000..74e9853
--- /dev/null
+++ b/tester/testsuite/good/core004.jl
@@ -0,0 +1,7 @@
+/* allow comparing booleans. */
+
+int main() {
+  if (true == true) { printInt(42); }
+  return 0 ;
+
+}
\ No newline at end of file
diff --git a/tester/testsuite/good/core004.output b/tester/testsuite/good/core004.output
new file mode 100644
index 0000000..d81cc07
--- /dev/null
+++ b/tester/testsuite/good/core004.output
@@ -0,0 +1 @@
+42
diff --git a/tester/testsuite/good/core005.jl b/tester/testsuite/good/core005.jl
new file mode 100644
index 0000000..905a5ee
--- /dev/null
+++ b/tester/testsuite/good/core005.jl
@@ -0,0 +1,14 @@
+/* usage of variable initialized in both branches. */
+
+int main () {
+  int x;
+  int y = 56;
+  if (y + 45 <= 2) {
+    x = 1;
+  } else {
+    x = 2;
+  }
+  printInt(x);
+  return 0 ;
+
+}
\ No newline at end of file
diff --git a/tester/testsuite/good/core005.output b/tester/testsuite/good/core005.output
new file mode 100644
index 0000000..0cfbf08
--- /dev/null
+++ b/tester/testsuite/good/core005.output
@@ -0,0 +1 @@
+2
diff --git a/tester/testsuite/good/core006.jl b/tester/testsuite/good/core006.jl
new file mode 100644
index 0000000..e9c9eb6
--- /dev/null
+++ b/tester/testsuite/good/core006.jl
@@ -0,0 +1,11 @@
+// Declaration of multiple variables of the same type in one statement:
+
+int main () {
+  int x, y;
+  x = 45;
+  y = -36;
+  printInt(x);
+  printInt(y);
+  return 0 ;
+
+}
\ No newline at end of file
diff --git a/tester/testsuite/good/core006.output b/tester/testsuite/good/core006.output
new file mode 100644
index 0000000..626b863
--- /dev/null
+++ b/tester/testsuite/good/core006.output
@@ -0,0 +1,2 @@
+45
+-36
diff --git a/tester/testsuite/good/core007.jl b/tester/testsuite/good/core007.jl
new file mode 100644
index 0000000..142dbbe
--- /dev/null
+++ b/tester/testsuite/good/core007.jl
@@ -0,0 +1,8 @@
+// declaration and initialization in same statement
+
+int main() {
+ int x = 7;
+ printInt(x);
+ return 0 ;
+
+}
\ No newline at end of file
diff --git a/tester/testsuite/good/core007.output b/tester/testsuite/good/core007.output
new file mode 100644
index 0000000..7f8f011
--- /dev/null
+++ b/tester/testsuite/good/core007.output
@@ -0,0 +1 @@
+7
diff --git a/tester/testsuite/good/core008.jl b/tester/testsuite/good/core008.jl
new file mode 100644
index 0000000..1bd76e5
--- /dev/null
+++ b/tester/testsuite/good/core008.jl
@@ -0,0 +1,11 @@
+// multiple variables of the same type declared 
+// and possibly initialized in the same statement
+
+int main() {
+ int x, y = 7;
+ x = -1234234;
+ printInt(x);
+ printInt(y);
+ return 0 ;
+
+}
\ No newline at end of file
diff --git a/tester/testsuite/good/core008.output b/tester/testsuite/good/core008.output
new file mode 100644
index 0000000..a7d3de6
--- /dev/null
+++ b/tester/testsuite/good/core008.output
@@ -0,0 +1,2 @@
+-1234234
+7
diff --git a/tester/testsuite/good/core009.jl b/tester/testsuite/good/core009.jl
new file mode 100644
index 0000000..9d19562
--- /dev/null
+++ b/tester/testsuite/good/core009.jl
@@ -0,0 +1,13 @@
+// Calling functions which take zero parameters
+
+int main() {
+ int x = foo();
+ printInt(x);
+ return 0 ;
+
+}
+
+int foo() {
+ return 10;
+}
+
diff --git a/tester/testsuite/good/core009.output b/tester/testsuite/good/core009.output
new file mode 100644
index 0000000..f599e28
--- /dev/null
+++ b/tester/testsuite/good/core009.output
@@ -0,0 +1 @@
+10
diff --git a/tester/testsuite/good/core010.jl b/tester/testsuite/good/core010.jl
new file mode 100644
index 0000000..16e21d9
--- /dev/null
+++ b/tester/testsuite/good/core010.jl
@@ -0,0 +1,19 @@
+// count function parameters as initialized
+
+int main() {
+  printInt(fac(5));
+  return 0 ;
+}
+
+int fac (int a) {
+  int r;
+  int n;
+  r = 1;
+  n = a;
+  while (n > 0)
+  {
+    r = r * n;
+    n = n - 1;
+  }
+  return r;
+}
diff --git a/tester/testsuite/good/core010.output b/tester/testsuite/good/core010.output
new file mode 100644
index 0000000..52bd8e4
--- /dev/null
+++ b/tester/testsuite/good/core010.output
@@ -0,0 +1 @@
+120
diff --git a/tester/testsuite/good/core011.jl b/tester/testsuite/good/core011.jl
new file mode 100644
index 0000000..34a2538
--- /dev/null
+++ b/tester/testsuite/good/core011.jl
@@ -0,0 +1,6 @@
+/* Test pushing -1. */
+
+int main() {
+  printInt(-1);
+  return 0 ;
+}
\ No newline at end of file
diff --git a/tester/testsuite/good/core011.output b/tester/testsuite/good/core011.output
new file mode 100644
index 0000000..3a2e3f4
--- /dev/null
+++ b/tester/testsuite/good/core011.output
@@ -0,0 +1 @@
+-1
diff --git a/tester/testsuite/good/core012.jl b/tester/testsuite/good/core012.jl
new file mode 100644
index 0000000..0b37d02
--- /dev/null
+++ b/tester/testsuite/good/core012.jl
@@ -0,0 +1,26 @@
+/* Test arithmetic and comparisons. */
+
+int main() {
+    int x = 56;
+    int y = -23;
+    printInt(x+y);
+    printInt(x-y);
+    printInt(x*y);
+    printInt(45/2);
+    printInt(78%3);
+    double z = -9.3;
+    double w = 5.1;
+    printBool(z+w > z-w);
+    printBool(z/w <= z*w);
+    return 0 ;
+}
+
+void printBool(boolean b) {
+  if (b) {
+    printString("true");
+    return;
+  } else {
+    printString("false");
+    return;
+ }
+}
\ No newline at end of file
diff --git a/tester/testsuite/good/core012.output b/tester/testsuite/good/core012.output
new file mode 100644
index 0000000..f8842ed
--- /dev/null
+++ b/tester/testsuite/good/core012.output
@@ -0,0 +1,7 @@
+33
+79
+-1288
+22
+0
+true
+false
diff --git a/tester/testsuite/good/core013.jl b/tester/testsuite/good/core013.jl
new file mode 100644
index 0000000..8b15a0b
--- /dev/null
+++ b/tester/testsuite/good/core013.jl
@@ -0,0 +1,33 @@
+/* Test boolean operators. */
+
+int main() {
+  printString("&&");
+  printBool(test(-1) && test(0));
+  printBool(test(-2) && test(1));
+  printBool(test(3) && test(-5));
+  printBool(test(234234) && test(21321));
+  printString("||");
+  printBool(test(-1) || test(0));
+  printBool(test(-2) || test(1));
+  printBool(test(3) || test(-5));
+  printBool(test(234234) || test(21321));
+  printString("!");
+  printBool(true);
+  printBool(false);
+  return 0 ;
+
+}
+
+void printBool(boolean b) {
+  if (!b) {
+    printString("false");
+  } else {
+    printString("true");
+ }
+ return;
+}
+
+boolean test(int i) {
+  printInt(i);
+  return i > 0;
+}
\ No newline at end of file
diff --git a/tester/testsuite/good/core013.output b/tester/testsuite/good/core013.output
new file mode 100644
index 0000000..5aecdcc
--- /dev/null
+++ b/tester/testsuite/good/core013.output
@@ -0,0 +1,25 @@
+&&
+-1
+false
+-2
+false
+3
+-5
+false
+234234
+21321
+true
+||
+-1
+0
+false
+-2
+1
+true
+3
+true
+234234
+true
+!
+true
+false
diff --git a/tester/testsuite/good/core014.jl b/tester/testsuite/good/core014.jl
new file mode 100644
index 0000000..15f46a9
--- /dev/null
+++ b/tester/testsuite/good/core014.jl
@@ -0,0 +1,17 @@
+/* Fibonacci. */
+
+int main () {
+  int lo,hi,mx ;
+  lo = 1 ;
+  hi = lo ;
+  mx = 5000000 ;
+  printInt(lo) ;
+  while (hi < mx) {
+    printInt(hi) ;
+    hi = lo + hi ;
+    lo = hi - lo ;
+  }
+  return 0 ;
+
+}
+
diff --git a/tester/testsuite/good/core014.output b/tester/testsuite/good/core014.output
new file mode 100644
index 0000000..99a6cce
--- /dev/null
+++ b/tester/testsuite/good/core014.output
@@ -0,0 +1,33 @@
+1
+1
+2
+3
+5
+8
+13
+21
+34
+55
+89
+144
+233
+377
+610
+987
+1597
+2584
+4181
+6765
+10946
+17711
+28657
+46368
+75025
+121393
+196418
+317811
+514229
+832040
+1346269
+2178309
+3524578
diff --git a/tester/testsuite/good/core015.jl b/tester/testsuite/good/core015.jl
new file mode 100644
index 0000000..366141b
--- /dev/null
+++ b/tester/testsuite/good/core015.jl
@@ -0,0 +1,16 @@
+/* parity of positive integers by recursion */
+
+int main () {
+  printInt(ev(17)) ;
+  return 0 ;
+}
+
+int ev (int y) {
+  if (y > 0)
+    return ev (y-2) ;
+  else
+    if (y < 0)
+      return 0 ;
+    else
+      return 1 ;
+}
\ No newline at end of file
diff --git a/tester/testsuite/good/core015.output b/tester/testsuite/good/core015.output
new file mode 100644
index 0000000..573541a
--- /dev/null
+++ b/tester/testsuite/good/core015.output
@@ -0,0 +1 @@
+0
diff --git a/tester/testsuite/good/core016.jl b/tester/testsuite/good/core016.jl
new file mode 100644
index 0000000..143ae88
--- /dev/null
+++ b/tester/testsuite/good/core016.jl
@@ -0,0 +1,15 @@
+/* parity of positive integers by loop */
+
+int main () {
+  int y = 17;
+  while (y > 0)
+    y = y - 2;
+  if (y < 0) {
+    printInt(0);
+    return 0 ;
+    }
+  else {
+    printInt(1);
+    return 0 ;
+    }
+}
diff --git a/tester/testsuite/good/core016.output b/tester/testsuite/good/core016.output
new file mode 100644
index 0000000..573541a
--- /dev/null
+++ b/tester/testsuite/good/core016.output
@@ -0,0 +1 @@
+0
diff --git a/tester/testsuite/good/core017.jl b/tester/testsuite/good/core017.jl
new file mode 100644
index 0000000..be1412b
--- /dev/null
+++ b/tester/testsuite/good/core017.jl
@@ -0,0 +1,40 @@
+/* Test boolean operators */
+
+int main () {
+  int x = 4;
+  if (3 <= x && 4 != 2 && true) {
+    printBool(true);
+  } else {
+    printString("apa");
+  }
+
+  printBool(true == true || dontCallMe(1));
+  printBool(4.0 < -50.0 && dontCallMe(2));
+
+  printBool(4 == x && true == !false && true);
+
+  printBool(implies(false,false));
+  printBool(implies(false,true));
+  printBool(implies(true,false));
+  printBool(implies(true,true));
+  return 0 ;
+
+}
+
+boolean dontCallMe(int x) {
+  printInt(x);
+  return true;
+}
+
+void printBool(boolean b) {
+  if (b) {
+    printString("true");
+  } else {
+    printString("false");
+ }
+ return;
+}
+
+boolean implies(boolean x, boolean y) {
+  return !x || x == y;
+}
diff --git a/tester/testsuite/good/core017.output b/tester/testsuite/good/core017.output
new file mode 100644
index 0000000..f1e314f
--- /dev/null
+++ b/tester/testsuite/good/core017.output
@@ -0,0 +1,8 @@
+true
+true
+false
+true
+true
+true
+false
+true
diff --git a/tester/testsuite/good/core018.input b/tester/testsuite/good/core018.input
new file mode 100644
index 0000000..6ea24f8
--- /dev/null
+++ b/tester/testsuite/good/core018.input
@@ -0,0 +1,2 @@
+-5673
+42.5
diff --git a/tester/testsuite/good/core018.jl b/tester/testsuite/good/core018.jl
new file mode 100644
index 0000000..9d6b365
--- /dev/null
+++ b/tester/testsuite/good/core018.jl
@@ -0,0 +1,15 @@
+/* test input */
+
+int main() {
+  int x = readInt();
+  double y = readDouble();
+
+  printInt(x-5);
+  
+  if (y > 42.0 || y < 43.0) 
+    printString("yay!");
+  else
+    printString("nay!");
+  return 0 ;
+
+}
\ No newline at end of file
diff --git a/tester/testsuite/good/core018.output b/tester/testsuite/good/core018.output
new file mode 100644
index 0000000..f13282a
--- /dev/null
+++ b/tester/testsuite/good/core018.output
@@ -0,0 +1,2 @@
+-5678
+yay!
diff --git a/tester/testsuite/good/core019.jl b/tester/testsuite/good/core019.jl
new file mode 100644
index 0000000..972e819
--- /dev/null
+++ b/tester/testsuite/good/core019.jl
@@ -0,0 +1,26 @@
+int main() {
+  int i = 78;
+  {
+    int i = 1;
+    printInt(i);
+  }
+  printInt(i);
+  while (i > 76) {
+    i--;
+    printInt(i);
+   // this is a little tricky
+   // on the right hand side, i refers to the outer i
+   int i = i + 7;
+   printInt(i);
+  }
+  printInt(i);
+  if (i > 4) {
+    int i = 4;
+    printInt(i);
+  } else {
+    printString("foo");
+  } 
+  printInt(i);
+  return 0 ;
+
+}
\ No newline at end of file
diff --git a/tester/testsuite/good/core019.output b/tester/testsuite/good/core019.output
new file mode 100644
index 0000000..47c3ff5
--- /dev/null
+++ b/tester/testsuite/good/core019.output
@@ -0,0 +1,9 @@
+1
+78
+77
+84
+76
+83
+76
+4
+76
diff --git a/tester/testsuite/good/core020.jl b/tester/testsuite/good/core020.jl
new file mode 100644
index 0000000..11325a3
--- /dev/null
+++ b/tester/testsuite/good/core020.jl
@@ -0,0 +1,7 @@
+int main() {
+    p();
+    printInt(1);
+    return 0;
+}
+
+void p() {}
diff --git a/tester/testsuite/good/core020.output b/tester/testsuite/good/core020.output
new file mode 100644
index 0000000..d00491f
--- /dev/null
+++ b/tester/testsuite/good/core020.output
@@ -0,0 +1 @@
+1
diff --git a/tester/testsuite/good/core021.jl b/tester/testsuite/good/core021.jl
new file mode 100644
index 0000000..3b7db67
--- /dev/null
+++ b/tester/testsuite/good/core021.jl
@@ -0,0 +1,6 @@
+int main() {
+    if (true) {
+      printInt(1);
+      return 0;
+    }
+}
\ No newline at end of file
diff --git a/tester/testsuite/good/core021.output b/tester/testsuite/good/core021.output
new file mode 100644
index 0000000..d00491f
--- /dev/null
+++ b/tester/testsuite/good/core021.output
@@ -0,0 +1 @@
+1
diff --git a/tester/testsuite/good/core022.jl b/tester/testsuite/good/core022.jl
new file mode 100644
index 0000000..2bb6dc4
--- /dev/null
+++ b/tester/testsuite/good/core022.jl
@@ -0,0 +1,7 @@
+int main() {
+    int x;
+    double y;
+    printInt(x);
+    printDouble(y);
+    return 0;
+}
diff --git a/tester/testsuite/good/core022.output b/tester/testsuite/good/core022.output
new file mode 100644
index 0000000..10e3f43
--- /dev/null
+++ b/tester/testsuite/good/core022.output
@@ -0,0 +1,2 @@
+0
+0.0