A Bounded Graph-Connect Construction for LR-regular Parsers
Abstract elided by the publisher.
Related papers
- The Construction of Stack-Controlling LR Parsers for Regular Right Part Grammars TOPLAS 1981
- An LR Substring Parser for Noncorrecting Syntax Error Recovery PLDI 1989
- Generalised Regular Parsers CC 2003
- Functional Correctness of C Implementations of Dijkstra's, Kruskal's, and Prim's Algorithms CAV 2021
- Morbig: a static parser for POSIX shell SLE 2018
- Membership Testing for Semantic Regular Expressions PLDI 2025
- A GPU implementation of inclusion-based points-to analysis PPoPP 2012
- Algebraic construction of graphs with bounded tree width and its applications - Catamorphic Approach to Program Analyses APLAS 2002