Re: Syntax diagram driven parser

"Paul Nicholls" <phantom@southcom.com.au>
1 Oct 2000 00:04:47 -0400

          From comp.compilers

Related articles
[4 earlier articles]
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)
Re: Syntax diagram driven parser aaron1000@webtv.net (2000-10-08)
[2 later articles]
| List of all articles for this month |

From: "Paul Nicholls" <phantom@southcom.com.au>
Newsgroups: comp.compilers
Date: 1 Oct 2000 00:04:47 -0400
Organization: Enitel Internet Public Access
References: 00-09-177 00-09-199
Keywords: parse, tools

> 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.


You are correct about the Pascal diagrams :) I think the only reason
that Delphi doesn't use "syntax diagrams" is because they take up more
room, not because of any problems with them I don't see why a 3d view
would be required and "syntax diagrams" because any computer language
can be written as 2d diagrams.


>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.


.. "syntax diagrams" can handle recursive languages just fine with no
problems and they can be "quicker" to look at and read than text BNF
or EBNF files in most cases, can't they?


--
Paul Nicholls (Delphi 5) Live long and optimise!
  Home Page: www.southcom.com.au/~phantom


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.