Re: DFA's and LR machine (was Re: Trouble understanding...)

# The core idea is to translate the DPDA generated by, say, LALR(1) into
# a DFA-with-counters. How? A stack in the DPDA completely describes the


Do you mean like http://www.rawbw.com/~wyrmwif/html/wyrm-cow.html#194 ?


# longer stacks will always have repeated parts - where loops appear in
# the DPDA. Instead of repeating these parts in the stack, we can just


Left recursive only does not result in loops. Left recursion reductions
can be changed to e-moves, transforming the LR(k) state graphs into a
DFA. Loops come from right and embedding recursion. In simple cases, the
reduction through the loop can be replaced with a loop counter.


http://www.rawbw.com/~wyrmwif/html/wyrm-cow.html#196


# I've been meaning to code up an example, but haven't had the time. I
# would be interested in comments on the idea though.


My code is mostly written but still not working completely because I have
to look for income, being outside the university grant system.


--
SM Ryan http://www.rawbw.com/~wyrmwif/
I love the smell of commerce in the morning.

Return to the comp.compilers page.
Search the comp.compilers archives again.