(no subject)

[VolChris@aol.com]

I read the rather informative posts on eliminating shift-reduce
conflicts. Unfortunately, I am unsure as to how to eliminate a conflict
generated by recursion. For example, if I have:
 
M -> r E s
E -> E [ E ] |
       ! E
. . .
 
I get the shift-reduce with
(stack) r ! E
M -> r E s
E -> E (.) [ E ] |
       ! E (.)          // => followed by [
 
I cannot simply inline because the recursion leads me right back to the
error. I shouldn't have to remove left recursion because this is an LALR
parser. Can you please clarify?
 
Thanks for your time with such a basic question.