Paull's Algorithm (Eliminating the Left Recursion
2016-08-23
1 0 0
no vote
Other
Earn points
Assign an ordering A1;:::;An to the nonterminals of the grammar.
for i := 1 to n do begin for j := 1 to i 1 do begin for each production of the form Ai ! Aj do begin remove Ai ! Aj from the grammar for each production of the form Aj ! do begin add Ai ! to the grammar end end end transform the Ai-productions to eliminate direct left recursion end
for i := 1 to n do begin for j := 1 to i 1 do begin for each production of the form Ai ! Aj do begin remove Ai ! Aj from the grammar for each production of the form Aj ! do begin add Ai ! to the grammar end end end transform the Ai-productions to eliminate direct left recursion end
c
Related Source Codes
PClite
0
0
no vote
generic embeded FTP Client
0
0
no vote
UDP Test Demo
0
0
no vote
TMS320F28335 DSP transmits data to EEPROM through
0
0
no vote
TMS320F28335 CAN communication source code
0
0
no vote
No comment