32 views
Implement Algorithm $3.23$, which converts a regular expression into a nondeterministic finite automaton, by an L-attributed SDD on a top-down parsable grammar. Assume that there is a token char representing any character, and that char.$lexval$ is the character it represents. You may also assume the existence of a function $new()$ that returns a new state, that is, a state never before returned by this function. Use any convenient notation to specify the transitions of the $NFA$.
| 32 views