Skip to content
Conference

A Simple Recipe for Writing Decent Recursive Descent Parsers (Pearl/Brave New Idea)

2026 · European Conference on Object-Oriented Programming · pp. 30:1-30:28 · 1 citation · 21 references
Computer Science

TL;DR

This paper serves both as a pedagogical introduction to Pratt parsing in a modern programming language and as a practical guide to programmers who just want to implement a computer language that is easy to parse and easy to read.

View source

Similar papers

Preprint Sep 2026

Where the LLM Ends and Reliable Decisions Begin

The ANVIL compiler architecture is proposed, where ANVIL performs exceptionally well on leading benchmarks by using language models purely where they are effective, rather than as a catch-all tool.

Priyadarshan Patil, A. Basu, Vikas Reddy et al. · 0 citations
Sep 2026

Compiling with the Sequent Calculus

This work is a continuation, and generalization, of Andrew Appel's landmark work on “Compiling with Continuations”, but instead of natural-deduction-based languages like the lambda calculus, it uses sequent-calculus-inspired languages throughout all intermediate stages.

Marius Müller, David Binder, Marco Tzschentke et al. · 0 citations
Open access Oct 2026

Programming with Composable Recursive Patterns and Transformations

Data processing using traditional pattern matching syntax and direct recursive functions is straightforward to write but becomes awkward in ambiguous (i.e., nondeterministic) cases: when programmers wish to avoid backtracking, they often end up having to write complicated code that sacrifices clarity and modularity. Ho...

Lu-Yu Cheng, Florent Ferrari, Michael D. Adams et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Compile by Training: Turning Natural-Language Specifications into Local Neural Functions

Many recurring text functions are easy to describe but difficult to implement with rules, while calling a large remote model for every input introduces repeated cost, latency, and dependency on a provider. We present compile by training, which turns a natural-language specification into a reusable neural function. At c...

Yun-Tian Deng, Peng-Yu Nie, Stuart M. Shieber · 0 citations
Book Open access Oct 2026

SwiftGram: Dynamic Lexical Forking for Precise and Efficient Grammar-Constrained Decoding

Large Language Models (LLMs) must strictly adhere to grammatical constraints for reliable structured generation in agentic workflows, code synthesis, and domain-specific language (DSL) generation. Grammar-Constrained Decoding (GCD) enforces this by masking out tokens incompatible with the target grammar at each decodin...

Shu-Yi Ling, Liang-Yi Kang, Jie Liu et al. · 0 citations
Book Open access Oct 2026

Fastbelt: An Architecture for Efficient Language Engineering

Language workbenches such as Xtext and Langium have made it substantially easier to build IDE tooling for domain-specific languages. However, as workspaces grow, build times and memory consumption of these frameworks exceed acceptable levels, negatively impacting user experience. In this paper, we present Fastbelt, a n...

Mark Sujew, Steven Smyth · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.