Table

Lessema	Token	Attributo
Delimitatori
* *	-	-
\n	-	-
\t	-	-
"	-	-
Separatori
(	SEPA	OPT
)	SEPA	QTT
{	SEPA	OPG
}	SEPA	QTG
[	SEPA	OPQ
]	SEPA	QTQ
,	SEPA	VIR
;	SEPA	PVIR
Relop
<	RELOP	MIN
<=	RELOP	MINEQ
=	RELOP	EQ
<>	RELOP	DIS
>	RELOP	MAX
>=	RELOP	MAXEQ
<--	ASSIGN	-
Identificatori
id	-	-
Numeri
numero	-	-
Operatori Aritmetici
+	AOP	ADD
-	AOP	SUB
*	AOP	MUL
/	AOP	DIV
%	AOP	MOD
Operatori Logici
&&	RELOP	AND
||	RELOP	OR

Grammar

N = {S, Program, Stmt, Expr},

T = {EOF, ';' , IF, THEN, ELSE, END, ID, ASSIGN, WHILE, LOOP, RELOP, NUMBER}

S

P = {

      S -> Program  EOF

      Program -> Program ; Stmt
                       |  Stmt
       Stmt -> IF Expr THEN Stmt END IF
                 | IF Expr THEN Stmt ELSE Stmt END IF
                 | ID ASSIGN Expr
                 | WHILE Epr LOOP Stmt END LOOP

      Expr ->  Expr  RELOP Expr

      Expr ->   ID
                 |  NUMBER
   }

Per questa grammatica è stato necessario trasformarla, applicando la ricorsione sinistra.

La grammatica risultante è la seguente:

  S -> Program EOF
  Program -> Stmt S'
  S' -> ; Stmt S'
  S' -> ''
  Stmt -> IF Expr THEN Stmt R' END IF
  Stmt -> ID ASSIGN Expr
  Stmt -> WHILE Expr LOOP Stmt END LOOP
  R' -> ELSE Stmt
  R' -> ''
  Expr -> ID E'
  Expr -> NUMBER E'
  E' -> RELOP Expr E'
  E' -> ''

Note