FSA for Syntax

Now, you are able to write your own automata. You can then use the recognize and generate predicates to test them. So, here is a task which is a bit more interesting: Write an FSA (First, as a graph and, then, in Prolog notation!) that recognizes English noun phrases constructed from the following words: a, the, witch, wizard, Harry, Ron, Hermione, broomstick, brave, fast, with, rat. E.g.

* the brave wizard
* the fast broomstick
* the wizard with the rat
* Ron

Solution

Do the same exercise but separeting the lexicon from the grammar rules

Hint

Back to lab 1.