Groups | Search | Server Info | Login | Register
Groups > comp.compilers > #3602
| From | John R Levine <johnl@taugh.com> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | draft: LR Parsing of Permutation Phrases |
| Date | 2024-10-10 09:12 -0400 |
| Organization | Compilers Central |
| Message-ID | <24-10-003@comp.compilers> (permalink) |
A permutation phrase is one where the elements can appear in any order. They are a pain to parse using LR methods since the an N element phrase expands to N! possible alternative rules. This paper proposes a tweak to LR parsing to handle them efficiently that produces smaller parse tables. https://arxiv.org/abs/2410.06769 Regards, John Levine, johnl@taugh.com, Taughannock Networks, Trumansburg NY Please consider the environment before reading this e-mail. https://jl.ly
Back to comp.compilers | Previous | Next | Find similar
draft: LR Parsing of Permutation Phrases John R Levine <johnl@taugh.com> - 2024-10-10 09:12 -0400
csiph-web