Take the 2-minute tour ×
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It's 100% free, no registration required.

I try to teach myself the usage of bison. The manpage bison(1) says about bison:

Generate a deterministic LR or generalized LR (GLR) parser employing LALR(1), IELR(1), or canonical LR(1) parser tables.

What is an IELR-parser? All relevant articles I found on the world wide web are paywalled.

share|improve this question
4  
Including cs.clemson.edu/~malloy/papers/sac08/paper.pdf ? –  reinierpost Sep 7 '12 at 17:56
    
@reinierpost I feel so stupid right now. Why didn't I find this? –  FUZxxl Sep 7 '12 at 18:59
    
I don't know - Google does personalize results ... –  reinierpost Sep 10 '12 at 7:43
    
@reinierpost, would you like to answer this question by quoting your link, so as to clean this question up? –  Merbs Nov 27 '12 at 7:26
    
Hmmm ... if that's all it takes, OK. –  reinierpost Dec 5 '12 at 10:39

1 Answer 1

An article that claims to introduce it: IELR(1): Practical LR(1) Parser Tables for Non-LR(1) Grammars with Conflict Resolution by Joel E. Denny and Brian A. Malloy, Clemson University, is freely available from Malloy's site.

What they are worth is something I can't answer. (Personally I don't understand the need for such crippled CFG parsing - why limit your expressive power when you can just use GLR? What does make sense to me is something like TAG or PEG (they seem natural and add expressive power) or tree grammars (for languages such as XML in which recognizing parse trees is trivial by design).)

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.