Regrettably, no, though it should be suitable for that. If I were you, I would define a very simple grammar (only two or three types of tokens) and try to build the parser from there. It should be relatively easy to port the state machine from this article to FSA::Rules. The nice thing is, if you have GraphViz installed, you can then print out the graph to see if it's equivalent to the diagram in the article:
my $graph = $fsa->graph; print FH $graph->as_png;
Cheers,
Ovid
New address of my CGI Course.
In reply to Re^3: Creating a module with DFA::Simple
by Ovid
in thread Creating a module with DFA::Simple
by adjohan
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |