tags:

views:

206

answers:

1
+5  Q: 

Grammar that is LR(1) but not LL(1)

This might look like a basic question to some of you but I expect intelligent replies here.

Why can't a LR(1) grammar with left recursion or the LR(1) grammar that is not left factored be LL(1)?

+2  A: 

Because you can never expect the termination of the string in LR(1) with left recursion.

sza  2010-04-12 14:16:08
what abt the second part?
Prasoon Saurav  2010-04-12 15:11:03

related questions

Java Compiler Options to produce .exe files.
Which compiles to faster code: "n * 3" or "n+(n*2)"?
profile-guided optimization (C)
Tools for converting non-Java into Java source
What's safe for a C++ plug-in system?
C++ Compiler Error C2371 - Redefinition of WCHAR
function declaration isn't a prototype
Learning Resources on Parsers, Interpreters, and Compilers
Compiler Error C2143 when using a struct
Which 4.x version of gcc should one use?
How to remove debug statements from production code in Java
.NET Compiler -- DEBUG vs. RELEASE
C on Visual Studio
What's a 'null defined macro'?
Warning: Found conflicts between different versions of the same dependent assembly
Mixed C++/CLI TypeLoadException Internal limitation: too many fields.
Bootstrapping a language
Checking for string contents? string Length Vs Empty String
What are the best resources on designing a new language?
Code crash in MS Visual Studio 2005 in RELEASE configuration
Invalid Resource File
C# logic order and compiler behavior
CSharpCodeProvider Compilation Performance
Learning to write a compiler
Adding Scripting functionality to .NET applications