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,
[email protected], Taughannock Networks, Trumansburg NY
Please consider the environment before reading this e-mail.
https://jl.ly
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)