Laurence Tratt: Structured Editing and Incremental Parsing

Efficient and flexible incremental parsing | ACM Transactions on Programming Languages and Systems

Previously published algorithms for LR (k) incremental parsing are inefficient, unnecessarily restrictive, and in some cases incorrect. We present a simple algorithm based on parsing LR(k) sentential forms that can incrementally parse an arbitrary number ...

Introduction - Tree-sitter

Tree-sitter is a parser generator tool and an incremental parsing library. It can build a concrete syntax tree for a source file and efficiently update the syntax tree as the source file is edited. Tree-sitter aims to be:

Execution vs Parse-based Language Servers: Tradeoffs and Opportunities for Language-Agnostic Tooling for Dynamic Languages

Paper on low-effort language server implementations, comparing an execution-based approach with one that requires a little more effort by extracting information during parsing. Presented at the Dynamic Language Symposium, Auckland, New Zealand, December 7, 2022

Crowdsourcing the evolution of text parsing with unified

unified is a tool for manipulating content using syntax trees. Today, we’re announcing the unified collective to make it sustainable

Tree-sitter - a new parsing system for programming tools - Strange Loop

Strange Loop is a conference for software developers covering programming langs, databases, distributed systems, security, machine learning, creativity, and more!

Harper | Privacy-First Offline Grammar Checker

Blazing-fast, open-source grammar & spell checking that never sends your words to the cloud.

Elias Stengel-Eskin, Aaron Steven White, Sheng Zhang, Benjamin Van Durme · Universal Decompositional Semantic Parsing · SlidesLive

Professional Conference Recording

Packrat parsing: | Proceedings of the seventh ACM SIGPLAN international conference on Functional programming

For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols. The power of generative grammars to express ...

Collaborative Text Editing without CRDTs or OT - Matthew Weidner

Matthew Weidner | May 21st, 2025 Home | RSS Feed Keywords: text editing, server reconciliation, Articulated

GrammarCheck — Free Writing Editor

Check grammar, track writing goals, measure readability, and time focused writing sessions.

Writing with AI help can shift your opinions | Cornell Chronicle

Artificial intelligence-powered writing assistants that autocomplete sentences or offer “smart replies” not only put words into people’s mouths, they also put ideas into their heads, according to new research.

par-team/par-lang

Par (⅋) is an experimental concurrent programming language. It's an attempt to bring the expressive power of linear logic into practice.

Back-to-basics approach can match or outperform AI in language analysis

A new study led by Dr Andrea Nini at The University of Manchester has found that a grammar-based approach to language analysis can match or outperform advanced AI systems in identifying who wrote a text. The method, called LambdaG, uses patterns in grammar and sentence construction rather than large-scale AI models, offering comparable accuracy ...

Toward a durable writing stack – Writings and rehearsals by Nathan Schneider

I have benefited over the years from others who have documented their writing setups, and so I feel some obligation to pay the favor forward by doing so with my own. The stack I’ll describe here is one I’ve been iterating on for about twenty years, starting from when I began discovering the pleasures of plain-text writing. Every aspect of it has changed over that period, but the some basic goals and flows have been with me through the writing of my college thesis, five books, and hundreds of articles. I am quite happy with where I am, and others might benefit from what I’ve come up with.