Is it easier to write a recursive-descent parser using an EBNF or a BNF?

Posted by Vivin Paliath on Stack Overflow See other posts from Stack Overflow or by Vivin Paliath
Published on 2010-03-24T18:03:25Z Indexed on 2010/03/24 18:13 UTC
Read the original article Hit count: 539

Filed under:

ebnf

|

bnf

|

recursive-descent-parser

|

grammar

I've got a BNF and EBNF for a grammar. The BNF is obviously more verbose. I have a fairly good idea as far as using the BNF to build a recursive-descent parser; there are many resources for this. I am having trouble finding resources to convert an EBNF to a recursive-descent parser. Is this because it's more difficult? I recall from my CS theory classes that we went over EBNFs, but we didn't go over converting them into a recursive-descent parser. We did go over converting BNF's into a recursive-descent parser.

The reason I'm asking is because the EBNF is more compact.

From looking at the EBNF's in general, I notice that terms enclosed between { and } can be converted into a while loop. Are there any other guidelines or rules?

© Stack Overflow or respective owner

Related posts about ebnf

Where can I get material for learning EBNF?

as seen on Stack Overflow - Search for 'Stack Overflow'
Extended Backus–Naur Form: EBNF I'm very new to parsing concepts. Where can I get sufficiently easy to read and follow material for writing a grammar for the boost::spirit library, which uses a grammar similar to EBNF? Currently I am looking into EBNF from Wikipedia. >>> More
Converting EBNF to BNF

as seen on Stack Overflow - Search for 'Stack Overflow'
It's been a few years since my computer-language class and so I've forgotten the finer points of BNF's and EBNF's and I don't have a textbook next to me. Specifically, I've forgotten how to convert an EBNF into BNF. From what little I remember, I know that one of the main points is to convert { term… >>> More
BNF vs EBNF vs ABNF: which to choose?

as seen on Stack Overflow - Search for 'Stack Overflow'
I want to come up with a language syntax. I have read a bit about these three, and can't really see anything that one can do that another can't. Is there any reason to use one over another? Or is it just a matter of preference? >>> More
Is it easier to write a recursive-descent parser using an EBNF or a BNF?

as seen on Stack Overflow - Search for 'Stack Overflow'
I've got a BNF and EBNF for a grammar. The BNF is obviously more verbose. I have a fairly good idea as far as using the BNF to build a recursive-descent parser; there are many resources for this. I am having trouble finding resources to convert an EBNF to a recursive-descent parser. Is this because… >>> More
Grammar for Java's annotations

as seen on Stack Overflow - Search for 'Stack Overflow'
Is there a BNF or EBNF that describes the grammar for Java's annotations? >>> More

Related posts about bnf

BNF – how to read syntax?

as seen on SQL Blog - Search for 'SQL Blog'
A few days ago I read post of Jen McCown (blog) about her idea of blogging about random articles from Books Online. I think this is a great idea, even if Jen says that it’s not exciting or sexy. I noticed that many of the questions that appear on forums and other media arise from pure fact that people… >>> More
Converting EBNF to BNF

as seen on Stack Overflow - Search for 'Stack Overflow'
It's been a few years since my computer-language class and so I've forgotten the finer points of BNF's and EBNF's and I don't have a textbook next to me. Specifically, I've forgotten how to convert an EBNF into BNF. From what little I remember, I know that one of the main points is to convert { term… >>> More
BNF vs EBNF vs ABNF: which to choose?

as seen on Stack Overflow - Search for 'Stack Overflow'
I want to come up with a language syntax. I have read a bit about these three, and can't really see anything that one can do that another can't. Is there any reason to use one over another? Or is it just a matter of preference? >>> More
URL BNF search part does not make sense

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, While implementing a Java regular expression for URL based on the URL BNF published by W3C, I've failed to understand the search part. As quoted: httpaddress h t t p : / / hostport [ / path ] [ ? search ] search xalphas [ + search ]… >>> More
Is it easier to write a recursive-descent parser using an EBNF or a BNF?

as seen on Stack Overflow - Search for 'Stack Overflow'
I've got a BNF and EBNF for a grammar. The BNF is obviously more verbose. I have a fairly good idea as far as using the BNF to build a recursive-descent parser; there are many resources for this. I am having trouble finding resources to convert an EBNF to a recursive-descent parser. Is this because… >>> More