All LL grammars are LR grammars, but not the other way around, but I still struggle to deal with the distinction. I'm curious about small examples, if any exist, of LR grammars which do not have an equivalent LL representation.
Example of an LR grammar that cannot be represented by LL?
3.1k Views Asked by Puppy At
1
There are 1 best solutions below
Related Questions in PARSING
- How to resize images with PHP PARSE SDK
- Constraint not propagated upon instantiation of list members
- How can I parse fixed-length, non-delimited integers with attoparsec?
- jSon result optional value error
- Date parse with Timezone - Android
- URL Variable is not being recognized using NSURL
- Regex to get vCard base64 string (C#)
- Retrieving string value from label and then parsing into an integer, pyqt4
- How to use Papa Parse for javascript csv parsing
- How to parse/split a string?
- String concatenation with padded integers
- Is this file an XML or HTML file? How can I parse it?
- json parser to spinner
- Use DateTime format in a class but restrict time tokens
- Saving multiple occurrences of strstr() from a line in C?
Related Questions in LR-GRAMMAR
- How many ways are there to build a parser?
- Solution in shift/reduce conflict at bison grammar
- Trying to write a parser
- Is there a general way to convert an unambiguous context-free-grammar into a LALR(1) grammar?
- Difference between LL and LR Parsing
- Example of an LR grammar that cannot be represented by LL?
- Parsing the Context-free-Grammars
- How to solve this S/R conflict
- LR(k) to LR(1) grammar conversion
- Python lrparsing module; cannot parse simple recursive grammar
- Building parse trees with shift-reduce parsing
- Does Golang have LR(1) grammar?
- How can I resolve a reduce reduce conflict:
- What are the columns in a LR Parsing Table?
- LR-Parsing-Table: What determines next state in reduce-actions?
Related Questions in LL-GRAMMAR
- can removing left recursion introduce ambiguity?
- How many ways are there to build a parser?
- What other tools can help me create a small language targeting JVM, besides ANTLR?
- Which contemporary computer languages are LL(1)?
- Ilustrate the left-most derivation on a token stream
- ANTLR failure due to left recursion. How to solve?
- How to prove that a grammar is LL(k) for k>1
- Finding an LL(1) grammar?
- Finding FIRST sets in a grammar
- Removing nullable productions
- Is this a LL(1) grammar?
- Convert LALR to LL
- Writing correct LL(1) grammars?
- Can an LL(1) parse table be valid if there is a column with no entries in its cells?
- Difference between LL and LR Parsing
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Well, as far as grammars are concerned, its easy -- any simple left-recursive grammar is LR (probably LR(1)) and not LL. So a list grammar like:
is LR(1) (assuming the production for element is) but not LL. Such grammars can be fairly easily converted into LL grammars by left-factoring and such, so this is not too interesting however.
Of more interest is LANGUAGES that are LR but not LL -- that is a language for which there exists an LR(1) grammar but no LL(k) grammar for any k. An example is things that need optional trailing matches. For example, the language of any number of
asymbols followed by the same number or fewerbsymbols, but not morebs -- { a^i b^j | i >= j }. There's a trivial LR(1) grammar:but no LL(k) grammar. The reason is that an LL grammar needs to decide whether to match an a+b pair or an odd a when looking at an a, while the LR grammar can defer that decision until after it sees the b or the end of the input.
This post on cs.stackechange.com has lots of references about this