NoTerminales = { P F B S H L U C T A K Q E E1 G G1 V V1 W X }
Axioma = P
Terminales = { eof , function id ( ) { } ; input print var switch return int bool str case : default cteInt true false cteStr + ++ == = && }

Producciones = {

P -> F P
P -> B P
P -> eof

B -> input ( id ) ;
B -> print ( E ) ;
B -> return E ;
B -> var T id ;
B -> id S
B -> switch ( E ) { C }

F -> function H id ( A ) { Q } ;

S -> = E ;
S -> ( L ) ;

H -> T
H ->

L -> E U
L ->

U -> , E U
U ->

C -> case E : B C
C -> default : B
C ->

T -> int
T -> bool
T -> str

A -> T id K

K -> , T id K
K ->

Q -> B Q
Q ->

E -> G E1

E1 -> && E
E1 ->

G -> V G1

G1 -> == G
G1 ->

V -> id X
V -> cteInt
V -> cteStr
V -> true
V -> false
V -> ( E )

X -> ++
X -> ( L )
X ->
}


2 7 22 2 8 11 31 34 37 40 39 36 33 3