draft: LR Parsing of Permutation Phrases

John R Levine <johnl@taugh.com>
Thu, 10 Oct 2024 09:12:23 -0400

          From comp.compilers
Related articles
draft: LR Parsing of Permutation Phrases johnl@taugh.com (John R Levine) (2024-10-10)
| List of all articles for this month |
From: John R Levine <johnl@taugh.com>
Newsgroups: comp.compilers
Date: Thu, 10 Oct 2024 09:12:23 -0400
Organization: Compilers Central
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="66505"; mail-complaints-to="abuse@iecc.com"
Keywords: parse, paper
Posted-Date: 10 Oct 2024 09:14:37 EDT

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

Post a followup to this message

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