1992/07/01 by Graham Hutton · 2 citations
Computer Science · Mathematics · #Natural Language Processing Techniques #semigroups and automata theory #Logic, programming, and type systems #Computer science #Parsing #Combinatory logic #LR parser #Parser combinator #Programming language #Notation #Top-down parsing #Natural language processing #Artificial intelligence #Simple (philosophy) #Arithmetic #Mathematics
paper · pdf · doi:10.1017/s0956796800000411
openalex publication_date 1992/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04
Abstract In combinator parsing , the text of parsers resembles BNF notation. We present the basic method, and a number of extensions. We address the special problems presented by white-space, and parsers with separate lexical and syntactic phases. In particular, a combining form for handling the ‘offside rule’ is given. Other extensions to the basic method include an ‘into’ combining form with many useful applications, and a simple means by which combinator parsers can produce more informative error messages.