I have this exercise which gives me a grammar and asks to prove that it is not an LL(1). All good with that part, though afterwards it asks me if that grammar can be an LL(k)(for k>1) or not. What procedure do I follow to determine that?
How to prove that a grammar is LL(k) for k>1
671 Views Asked by Alex At
1
There are 1 best solutions below
Related Questions in GRAMMAR
- VoiceXML Grammar Input sequence
- Is the grammars in Java7 spec really equivalent?
- int* const* foo(int x); is a valid C function prototype. How do you "read" this return type?
- Identifier terminal except certain keywords
- Grammar: Precedence of grammar alternatives
- Context Free Grammar BNF
- ANTLR4 grammar conflicting rules
- Is it incorrect online version of EBNF standard, or incorrect the chapter's name by mr. Pattis?
- Cross reference to multiple names in the same grammar rule
- Xtext grammar describing cron expression not working as expected
- What are the Bison/yacc grammars for these
- Correct way of conjugating 3rd person singular in comments
- Xtext grammar rule composite
- Trying to find Shift/Reduce conflict in Grammar
- Why do we need the alternative definition `nested-name-specifier identifier ::` in the definition of the grammar production `nested-name-specifier`?
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?
For a given
kand a non-left-recursive grammar, all you have to do is to build theLA(k)table (by algorithms readily available everywhere). If there is no ambiguity, the grammar isLL(k), and the language is too.Knowing if there exists a
kfor which a given language isLL(k)is undecidable. You'd have to try one value ofkafter the other until you succeed, or the universe runs out.