Tag
博客文章论证 Pratt 解析应被视为黑盒来使用,强调理解 nuds/leds 心智模型比记忆 9 行算法实现更重要,并对比了与 GNU Bison 等传统解析技术的差异。
The blog post describes building OrgWebAlchemy, a Guile Scheme library using Parsing Expression Grammars to parse Org mode documents and convert them to HTML via SXML, comparing PEGs to regular expressions for this task.
Tilia is a new formatter for Haskell that addresses challenges like comment handling, operator fixity inference, and CPP support.
An LLM benchmark's scoring pipeline could erroneously treat unsupported tool-call responses as stable empty outputs due to preprocessing, highlighting the importance of distinguishing between parsing failures and genuine outputs in evaluation.
The blog post details techniques to optimize memory usage in a C++ markdown parser, significantly reducing AST node size from 232 bytes to 16 bytes through arena allocation and pointer compression, while maintaining parsing speed.
The article shares personal opinions on modern compiler building, advocating for tools like OhmJS for parsing and Prolog for type checking, with a focus on simplicity and iterative development.
SecretSpec has released dotenv-ng, a modern Rust fork of dotenvy, to fix parsing issues with secrets like bcrypt fragments and address maintenance gaps in .env file handling.
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.