Path: csiph.com!weretis.net!feeder9.news.weretis.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end
From: John R Levine <johnl@taugh.com>
Newsgroups: comp.compilers
Subject: draft: LR Parsing of Permutation Phrases
Date: Thu, 10 Oct 2024 09:12:23 -0400
Organization: Compilers Central
Sender: johnl%iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <24-10-003@comp.compilers>
MIME-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
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
X-submission-address: compilers@iecc.com
X-moderator-address: compilers-request@iecc.com
X-FAQ-and-archives: http://compilers.iecc.com
Xref: csiph.com comp.compilers:3602

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