Removing left recursion

Posted by equilibrium on Stack Overflow See other posts from Stack Overflow or by equilibrium
Published on 2010-04-16T10:06:26Z Indexed on 2010/04/16 10:23 UTC
Read the original article Hit count: 369

Filed under:

compiler

|

grammar

The following grammar has left recursion

E= E+T|T
T= T*F|F
F= a|b|c

How to remove it? Is there any general procedure for it?

© Stack Overflow or respective owner

Related posts about compiler

IDEA modular problem (jsp)

as seen on Stack Overflow - Search for 'Stack Overflow'
I have project in with 2 separate modules(frontend and backend, first depends on second). When I'm trying to access backend code from frontend code, things going fine. Things turn for the worse when I do the same from jsp. This is stacktrase for simple accessign bean <jsp:useBean id="mybean"… >>> More
Help with a compiler warning: Initialization from distinct Objective-C type when types match

as seen on Stack Overflow - Search for 'Stack Overflow'
Here is the function where I get the compiler warning, I can't seem to figure out what is causing it. Any help is appreciated. -(void)displaySelector{ //warning on the following line: InstanceSelectorViewController *controller = [[InstanceSelectorViewController alloc] initWithCreator:self]; … >>> More
Sometimes Java web app hang

as seen on Stack Overflow - Search for 'Stack Overflow'
The web app occasionally get hang for about 30 seconds when user request a web page, the server's CPU and memory usage are ok, and the jstack shows: "http-9999-3" daemon prio=6 tid=0x552f3400 nid=0xf40 runnable [0x578fc000] java.lang.Thread.State: RUNNABLE at org.eclipse.jdt.internal.compiler… >>> More
Need help regarding one LALR(1) parsing.

as seen on Stack Overflow - Search for 'Stack Overflow'
I am trying to parse a context-free language, called Context Free Art. I have created its parser in Javascript using a YACC-like JS LALR(1) parser generator JSCC. Take the example of following CFA (Context Free Art) code. This code is a valid CFA. startshape A rule A { CIRCLE { s 1} } Notice the… >>> More
Port Compiler Options (8 replies)

as seen on .NET 247 - Search for '.NET 247'
I currently own a license for Crossworks for ARM and would like to compile the port using it. With the code for the CLR now available, is it possible to compile the port with any ARM compiler or are we still restricted to the Keil ARM gcc compilers? >>> More

Related posts about grammar

Convert The Context Free Grammar to LL1 Grammar

as seen on Stack Overflow - Search for 'Stack Overflow'
hi I want to write a program to gives grammar as input and change it to LL1. my problem is converting to LL1 I don't have any algorithm to convert. I earn grammar from some input text by a simple text analyzer but how I can change it to LL1 ? is there any algorithm that is clear to implement. >>> More
English Grammar Parsing in PHP (Link Grammar)

as seen on Stack Overflow - Search for 'Stack Overflow'
Is there anyway to use the Link Grammar or AbiSource grammar checker in PHP (or C# but I'd prefer php)? I need to have a tree structure for english sentences. Any ideas? The only things I found were in C and I can't use them on a shared host. >>> More
Good grammar for date data type for recursive descent parser LL(1)

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm building a custom expression parser and evaluator for production enviroment to provide a limited DSL to the users. The parser itself as the DSL, need to be simple. The parser is going to be built in an exotic language that doesn't support dynamic expression parsing nor has any parser generator… >>> More
Parsing a string, Grammar file.

as seen on Stack Overflow - Search for 'Stack Overflow'
How would I separate the below string into its parts. What I need to separate is each < Word including the angle brackets from the rest of the string. So in the below case I would end up with several strings 1. "I have to break up with you because " 2. "< reason " (without the spaces) 3. "… >>> More
Efficient Context-Free Grammar parser, preferably Python-friendly

as seen on Stack Overflow - Search for 'Stack Overflow'
I am in need of parsing a small subset of English for one of my project, described as a context-free grammar with (1-level) feature structures (example) and I need to do it efficiently . Right now I'm using NLTK's parser which produces the right output but is very slow. For my grammar of ~450 fairly… >>> More