Section parser.
Variable X V R : Ensf.
Variable S' : Elt.
Hypothesis H : isGram X V R S'.
Let LL := LG X V R S'.
Let P := union X V.
Let f_R_d (a : Elt) :=
couple (word (cons (first a) nil)) (couple (eps X) (second a)).
Let f_X_d (x : Elt) := couple (word (cons x nil)) (couple x (word nil)).
Let d := union (map f_R_d R) (map f_X_d X).
Let wd := cons S' nil.
Let wa := nil.
Let L := LA X wd wa d.

(* Specifications: *)
Theorem Parser1 : forall u : Word, {LL u} + {~ LL u}.
intros.