|
|
|
|
|
|
by tgv
658 days ago
|
|
|
Same. LR(k) and LL(k) are readable and completely unambiguous, in contrast to PEG, where ambiguity is resolved ad hoc: PEG doesn't have a single definition, so implementations may differ, and the original PEG uses the order of the rules and backtracking to resolve ambiguity, which may lead to different resolutions in different contexts. Ambiguity does not leap out to the programmer. OTOH, an LL(1) grammar can be used to generate a top-down/recursive descent parser, and will always be correct. |
|
|