Related articles |
---|
[3 earlier articles] |
Re: Syntax diagram driven parser eodell@sfmedia.net (2000-09-25) |
Re: Syntax diagram driven parser dancohen@canuck.com (Dan Cohen) (2000-09-25) |
Re: Syntax diagram driven parser dimock@deas.harvard.edu (Allyn Dimock) (2000-09-28) |
Re: Syntax diagram driven parser brian_d_webb@hotmail.com (Brian Webb) (2000-09-28) |
Re: Syntax diagram driven parser brian_d_webb@hotmail.com (Brian Webb) (2000-09-28) |
Re: Syntax diagram driven parser cfc@world.std.com (Chris F Clark) (2000-09-28) |
Re: Syntax diagram driven parser vbdis@aol.com (2000-09-28) |
Re: Syntax diagram driven parser phantom@southcom.com.au (Paul Nicholls) (2000-10-01) |
Re: Syntax diagram driven parser sebmol@gmx.net (Sebastian Moleski) (2000-10-01) |
Re: Syntax diagram driven parser irobot@swbell.net (Brian Webb) (2000-10-01) |
Re: Syntax diagram driven parser vbdis@aol.com (2000-10-01) |
Re: Syntax diagram driven parser vbdis@aol.com (2000-10-08) |
Re: Syntax diagram driven parser vbdis@aol.com (2000-10-08) |
[3 later articles] |
From: | vbdis@aol.com (VBDis) |
Newsgroups: | comp.compilers |
Date: | 28 Sep 2000 22:16:25 -0400 |
Organization: | AOL Bertelsmann Online GmbH & Co. KG http://www.germany.aol.com |
References: | 00-09-177 |
Keywords: | parse, tools |
"Paul Nicholls" <phantom@southcom.com.au> schreibt:
>I think that developing a language using syntax diagrams instead of BNF or
>lex and yacc is great!.
Perhaps you know the "railroad" diagrams of the Pascal syntax. In Delphi this
representation is no longer used, since the actual grammar would require a 3D
view of those diagrams, with crossing rails without interconnections.
A graph can be very complex, perhaps recursive, and I do not see a general
benefit from using such unrestricted graphs, as opposed to other unrestricted
representations of a grammar.
2D Graphs may be useful to represent *conforming* grammars in a more
comprehensible way, but...
DoDi
Return to the
comp.compilers page.
Search the
comp.compilers archives again.