First let me start off by saying hello. :-) I am a CS student who is struggling in my final class (compilers). Is compilers the most difficult class always? This is my final class and I feel as though I have taken stupid pills before each and every class. :(
Okay I am sure everyone on here has answered a bizillian homework questions but here goes a bizillian and one (pretty please)!
I have a beginning understanding of how to eliminate left recursion, but I just don't understand how to set up one of my homework questions, I think.
I am supposed to eliminate left recurison on this, I am not sure if my interference is the initial set up of the problem that is very different from the form E-> E + T sort of thing or what. So please help me set up this problem to eliminate left recursion
name -> identifier
| name.identifier
| name[expression]
| procedure call
I am getting very little out of the letures in class and I have been at them all! The book (Aho) is my only source of support.
TIA
Tricia
