File Edit View Tools Help

Objectives

create BNF rules for an LL $(1)$ parser for a language similar to what we did in class for algebra expressions.

enter the grammar into the BNFParser python program.

Directions

Here is the grammar from page $190$ of the textbook.

$(sentence)$ : :$=(simple-$sentence :$)[$ and $($: simple$-$sentence :$)]dots$

$(simple-$sentence$)$ ::$=($: nout$-$part :$)($: verb$-$part :$)$

$($: noun$-$part :$)$::$=($: article :$)($: noun :$)[$ who $($: verb$-$part :$)]dots$

$($: verb$-$part :$)$::$=($: intransitive$-$verb :$)|(transitive-$verb :$)($: noun$-$part :) $)|$

$article$

Transform the grammar into an equivalent grammar that can be used with LL $(1)$ parser. As we did in class. Look at the rules in the

BNFParser.py program.

A rule name must be enclosed in angle brackets.

Valid examples are $>($:$A$:$)|in|$