Re: SUMMARY: BNF definition (EBNF acceptance)

"Nathan K. Inada" <nathan@stc.com>
Wed, 18 May 1994 12:58:40 GMT

          From comp.compilers
Related articles
SUMMARY: BNF definition rdwi@se.bel.alcatel.be (Ronny De Winter) (1994-05-18)
Re: SUMMARY: BNF definition (EBNF acceptance) nathan@stc.com (Nathan K. Inada) (1994-05-18)
Re: SUMMARY: BNF definition (EBNF acceptance) parrt@s1.arc.umn.edu (Terence Parr) (1994-05-20)
Re: SUMMARY: BNF definition (EBNF acceptance) adrian@platon.cs.rhbnc.ac.uk (1994-05-22)
Re: SUMMARY: BNF definition (EBNF acceptance) max@Kolmogorov.gac.edu (1994-05-23)
| List of all articles for this month |
Newsgroups: comp.compilers
From: "Nathan K. Inada" <nathan@stc.com>
Keywords: syntax, parse
Organization: Software Technologies Corporation
References: 94-05-067
Date: Wed, 18 May 1994 12:58:40 GMT

    .> Although they can significantly improve the readability of the
    .> grammar, they complicate the matter when it comes to parser or
    .> code generation, so EBNF is generally unpopular in compilers
    .> theory.


is this true?


the PCCTS manual sez regarding its use of EBNF:


  "This also has the advantage of being more consistent with the
    regular expression notation and providing additional information
    which can be used to create a more efficient parser."


is EBNF unpopular to the compiler theorist but not compiler
practitioner, maybe?


humbly
  nathan
--

Post a followup to this message

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