D:\Silvano\WWW\RLA\Automata>java -classpath D:/Silvano/Applicazioni/Traduttori/Cup_JFlex/JFlex/jflex-1.4.3/lib/JFlex.jar JFlex.Main *.flex Reading "rla.flex" Constructing NFA : 167 states in NFA Converting NFA to DFA : ................................................. 51 states before minimization, 33 states in minimized DFA Old file "Scanner.java" saved as "Scanner.java~" Writing code to "Scanner.java" ERRORLEVEL=0 D:\Silvano\WWW\RLA\Automata>java -classpath D:/Silvano/Applicazioni/Traduttori/Cup_JFlex/Cup/java-cup-11a.jar java_cup.Main -parser rlac -interface *.cup Warning : Terminal "ILLEGAL_CHARACTER" was declared but never used ------- CUP v0.11a beta 20060608 Parser Generation Summary ------- 0 errors and 1 warning 24 terminals, 28 non-terminals, and 63 productions declared, producing 106 unique parse states. 1 terminal declared but not used. 0 non-terminal declared but not used. 0 productions never reduced. 0 conflicts detected (0 expected). Code written to "rlac.java", and "sym.java". ---------------------------------------------------- (v0.11a beta 20060608) ERRORLEVEL=0 D:\Silvano\WWW\RLA\Automata>javac -classpath .;D:/Silvano/Applicazioni/Traduttori/Cup_JFlex/Cup/java-cup-11a-runtime.jar Scanner.java sym.java rlac.java JavaSymbol.java symtab/*.java Note: Some input files use unchecked or unsafe operations. Note: Recompile with -Xlint:unchecked for details. ERRORLEVEL=0 D:\Silvano\WWW\RLA\Automata>java -classpath .;D:/Silvano/Applicazioni/Traduttori/Cup_JFlex/Cup/java-cup-11a.jar rlac Sample.rla Parsing [Sample.rla] DEFINITIONS: {$1= DFA STATES: 0:= [a -> 1] 1:= [a -> 2, b -> 3] 2:= [b -> 3] 3:= [a -> 2] FINAL: [0, 1, 3] , $2= DFA STATES: 0:= [a -> 1] 1:= [a -> 2, b -> 3] 2:= [b -> 3] 3:= [a -> 2] FINAL: [1, 3] , $3= DFA STATES: 0:= [a -> 1, b -> 2, c -> 2, d -> 2] 1:= [a -> 2, b -> 0, c -> 2, d -> 2] 2:= [a -> 2, b -> 2, c -> 2, d -> 2] FINAL: [1, 2] , $4= DFA STATES: 0:= [] FINAL: [0] , $5= DFA STATES: 0:= [a -> 1] 1:= [a -> 2, b -> 3] 2:= [b -> 3] 3:= [a -> 2] FINAL: [0, 1, 3] , $6= DFA STATES: 0:= [a -> 1] 1:= [a -> 2, b -> 3] 2:= [b -> 3] 3:= [a -> 2] FINAL: [1, 3] , $7= DFA STATES: 0:= [a -> 1] 1:= [a -> 2, b -> 3] 2:= [b -> 3] 3:= [a -> 2] FINAL: [0, 1, 3] , $8= DFA STATES: 0:= [a -> 1] 1:= [a -> 2, b -> 3] 2:= [b -> 3] 3:= [a -> 2] FINAL: [1, 3] } $1 != $2 $2 in $1 () in $1 (a a b a b) in $1 (a a a b a b) !in $1 $5 == $7 $6 == $8 Number of errors = 0.