Re: One possible future of parsing Graph::Easy input texts

Hi Folks I've been using the Perl module Marpa to design a parser for Graph::Easy style graph definitions, with great success. So far, I haven't written a lexer to turn the definitions into an intermediary language, but I've designed that intermediary language along with a Marpa-style grammar, wh

Re: One possible future of parsing Graph::Easy input texts

Hi All On Tue, 2011-03-22 at 12:38 +0200, Shlomi Fish wrote: > Hi all, > > On Tuesday 22 Mar 2011 00:10:49 David Nicol wrote: > > On Mon, Mar 21, 2011 at 4:04 PM, wrote: > > > An interesting concept but describing the syntax as a grammar is not the > > > same as an FSA. The FSA is part of the pa

Re: One possible future of parsing Graph::Easy input texts

Hi all, On Tuesday 22 Mar 2011 00:10:49 David Nicol wrote: > On Mon, Mar 21, 2011 at 4:04 PM, 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

Re: One possible future of parsing Graph::Easy input texts

I reviewed the list of bugs at https://rt.cpan.org/Public/Dist/Display.html?Name=Graph-Easy Very few seem related to parsing or the input language. The layouter hanging on a 749 edge graph would seem a problem even if you explicitly did it with calls from perl code. Indeed most of the bugs seem t

Re: One possible future of parsing Graph::Easy input texts

> On Mon, Mar 21, 2011 at 4:04 PM, 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-

Re: One possible future of parsing Graph::Easy input texts

Hi On Mon, 2011-03-21 at 14:04 -0700, dhu...@hudes.org wrote: > > > > One could describe the Graph::Easy format grammar as a state machine, draw > > the state machine with Graph::Easy, then implement a parser from your > > diagram, with > > Graph::Easy::StateMachine

Re: One possible future of parsing Graph::Easy input texts

On Mon, Mar 21, 2011 at 4:04 PM, 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. > The thing about parsing and Pe

Re: One possible future of parsing Graph::Easy input texts

> > One could describe the Graph::Easy format grammar as a state machine, draw > the state machine with Graph::Easy, then implement a parser from your > diagram, with > Graph::Easy::StateMachine > , > for a future