From: johnl@taugh.com   
      
   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   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)