Tag
The paper introduces Stoicheia, a 405M-parameter character-level masked diffusion encoder for Ancient Greek that unifies textual restoration, parsing, and metrical scansion in a single model, outperforming prior systems like Ithaca on benchmark tasks.
LlamaIndex argues that document OCR is not being commoditized by frontier models, using benchmark data showing specialized parsers remain more accurate and cheaper.
This article explains that modern regex engines like PCRE can parse far more than regular languages, debunking the common claim that HTML cannot be parsed with regex.
This article explores the challenges of parsing the C `sizeof` operator, which can take either an expression or a parenthesized type, and the extra complications introduced by compound literals and postfix operators. It discusses parsing strategies and notes that C2y's newly introduced `_Countof` operator faces similar issues.
A blog post introducing bx::Scanner, a small zero-copy, allocation-free set of scanning primitives that simplify writing parsers without full parser generators or complex PEG libraries.
A tutorial on building parser combinators in Scheme (Gambit), explaining how to write quick and readable parsers using functional programming techniques.
ast-grep rewrote Tree-sitter's C core in Rust, achieving up to 30% faster parsing and 22% faster end-to-end performance in ast-grep, at the cost of slightly higher memory usage.
This blog post explores parsing ambiguities in C23 involving `auto` as a type inference specifier or storage-class specifier, showing how GCC and Clang disagree on parsing declarations like `auto x = 67;` when `x` is a typedef, and how attributes complicate the situation.
An article explaining how to consume and use microformats 2 data on personal websites, covering parser selection, fetching considerations, and data storage strategies.
This blog post starts a series on building an APL interpreter in Python, covering tokenization and parsing of basic APL expressions with numbers, functions, and operators.
An overview of seventy years of parsing theory and its practical implications in computer science.
This paper investigates using LLMs to rewrite fragmentary dialogue utterances for improving frozen discourse parsers, finding that zero-shot clarification is unreliable and that error repair through rewriting has a practical ceiling, suggesting rewritability prediction as a key missing capability.
A blog post exploring the 'parse, don't validate' principle in TypeScript, showing how to use branded types to preserve type information after parsing, despite TypeScript's structural typing making this less idiomatic than in languages like Elm or Haskell.
The author shares a concrete example of using Claude AI to debug a parsing regression in hyperscript, highlighting the strengths and weaknesses of AI-assisted development and cautioning against over-reliance.
A paper presenting a typed, algebraic approach to parsing, likely from the University of Cambridge.
The paper presents simdjson, the first validating JSON parser capable of processing gigabytes per second on a single core using SIMD instructions, achieving substantial speedups over existing parsers like RapidJSON.
A technical guide on implementing a custom query language (EHQL) using Python and Apache Spark, with a focus on grammar definition and parsing using Lark.
Baidu releases Unlimited-OCR, an open-source model for one-shot long-horizon document parsing, building upon Deepseek-OCR with support for single images, multi-page documents, and PDFs.
A comprehensive guide on how an HTTP server works, covering networking protocols, chunked encoding, state machines, parser writing, and concurrency basics, with instructions to build one yourself.
C++26's #embed and static reflection, combined with the simdjson library, allow JSON parsing at compile time, turning configuration files into compile-time constants with no runtime overhead.