Symbolic encoding of LL(1) parsing and its applications

DOI10.1007/s10703-023-00420-3OpenAlexW4381742552MaRDI QIDQ6151762

Pankaj Kumar Kalita, Saket Jhunjhunwala, Subhajit Roy, Dhruv Singal, Palak Agarwal

Publication date: 11 March 2024

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-023-00420-3

zbMATH Keywords

first setfollow setLL1 parserparse conditionparse table

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient LL(1) error correction and recovery using only insertions
• A simple, fast, and effective LL(1) error repair algorithm
• Grammar constraints
• Incremental learning of context free grammars based on bottom-up parsing and search
• A lattice-theoretical fixpoint theorem and its applications
• Abstraction-driven Concolic Testing
• E-matching for Fun and Profit
• Analyzing Context-Free Grammars Using an Incremental SAT Solver
• Incremental Learning of Context Free Grammars by Bridging Rule Generation and Search for Semi-optimum Rule Sets
• On the relationship between LL(1) and LR(1) grammars
• Semi-automatic grammar recovery
• Avoiding exponential explosion
• Parse Condition: Symbolic Encoding of LL(1) Parsing
• Tools and Algorithms for the Construction and Analysis of Systems
• Syntax-Directed Transduction
• An axiomatic basis for computer programming
• Lazy Abstraction with Interpolants

This page was built for publication: Symbolic encoding of LL(1) parsing and its applications