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
669 Views Asked by Alex At
1
There are 1 best solutions below
Related Questions in GRAMMAR
- What could be the cause of this if condition getting skipped even the condition inside is True?
- Inheritance and protected attribute
- Link error missing vtable
- Newton method for computing an inverse
- Xcode iOS Build - copy only specific sub-folders as Bundle Resources
- New iOS project, free hosted repository: Xcode 4 or Xcode 3.2?
- symbol(s) not found for architecture i386
- Deleting/Removing Group in Xcode
- In Xcode 4 GM, how do I turn on LLDB? All I see is GDB
- Upgrading to xcode 4 error No architectures to compile for
Related Questions in LL-GRAMMAR
- What could be the cause of this if condition getting skipped even the condition inside is True?
- Inheritance and protected attribute
- Link error missing vtable
- Newton method for computing an inverse
- Xcode iOS Build - copy only specific sub-folders as Bundle Resources
- New iOS project, free hosted repository: Xcode 4 or Xcode 3.2?
- symbol(s) not found for architecture i386
- Deleting/Removing Group in Xcode
- In Xcode 4 GM, how do I turn on LLDB? All I see is GDB
- Upgrading to xcode 4 error No architectures to compile for
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 # Hahtags
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.