This assignment test understanding of BNF grammars, parse trees, the EBNF formalism and syntax charts.
Below is the EBNF grammar of the language spken by babies with I.Q.'s of more than 200. They always follow the rules of the grammar very closely so as not to appear stupid. Note that the superscript on the repetition braces means "at least one".
word ::= ['a'] {'da''da'}1 'd' | ['a'] {'ma' 'ma'}1 'm' | {'mm'}
sentence ::= {word}
One day at pre-school, after the advanced calculus class, three babies were talking. Below are three of their utterances.
baby 1: dadadamamammmmm
baby 2: amamamamammmdadadmm
baby 3: dadadamamamammamamam
Hand in your completed assignment by Thursday, September 19th., in class.