> On Mon, Mar 21, 2011 at 4:04 PM, <dhu...@hudes.org> wrote: > > >> An interesting concept but describing the syntax as a grammar is not the >> same as an FSA. The FSA is part of the parser and lexer. >> > > I disagree. "State Machine" is a powerful abstraction that is useful in > many > places. > FSA/FSM are -very- useful. I've never used your module but I have implemented FSM though it has been quite some time since I tried to describe one mathematically. A parser has states it is certainly true but is not quite the same thing. >
> Yes, yes! Perhaps Shlomi will explain exactly what the itch is that he's > scratching? I'm just guessing: does the existing Graph::Easy have issues > with mixed-direction unicode? That's a lexer issue not a parser issue. Parsers deal with symbols which are the output of the lexer. Switching from left->right to right->left word order is certainly an odd thing to do but in the end a parser deals with a sequence of symbols. > > > -- > simple interpolable credential obfuscator: > perl -ple 's/(.)/sprintf "\\%03o",ord $1/ge;' >
