[antlr-interest] State Machines Galore

[Terence Parr]

On Jan 5, 2006, at 8:23 PM, Jeff Barnes wrote:

> Thanks, Terrence, for the project/assignment posted at
> http://www.cs.usfca.edu/~parrt/course/652/projects-Spring-2004/ 
> nfa.html.
>
> You said the following NFA generates (a | b | c):
>
> .s0 -> .a1 -> . -a-> . -> .s5 -> :
>        .a2 -> . -b-> . -> @s5
>        .a3 -> . -c-> . -> @s5
> @a1 -> @a2
> @a2 -> @a3
>
> What not use a simpler graph?
>
> .s0 -> .a1 -a-> .s5 -> :
>        .a2 -b-> @s5
>        .a3 -c-> @s5
> @a1 -> @a2
> @a2 -> @a3

You could...i was showing the output of another tool actually (ANTLR  
v3) ;)

> Where can I find more info about constructing NFA's?

Well, lots of courses have info on constructing them, but you don't  
see a lot of code to do so...i can't give out the course solution  
unfortunately  ;)

> Thanks again for the web page.

My pleasure.

Ter