Dynamic LL (k) parsing
From MaRDI portal
Publication:1920233
A new class of context-free grammars, called dynamic context-free grammars, is introduced. These grammars have the ability to change the set of production rules dynamically during the derivation of some terminal string. The notion of \(\text{LL} (k)\) parsing is adapted to this grammar model. We show that dynamic \(\text{LL} (k)\) parsers are as powerful as \(\text{LR} (k)\) parsers, i.e. that they are capable to analyze every deterministic context-free language while using only one symbol of lookahead.
Recommendations
- scientific article; zbMATH DE number 3856438
- scientific article; zbMATH DE number 1452980
- scientific article; zbMATH DE number 3860423
- An incremental LL(1) parsing algorithm
- On parsing LL-languages
- Robust Parsing Using Dynamic Programming
- Semantic routines and \(LR(k)\) parsers
- Parallel \(LL\) parsing
- Parsing with dynamic rule selection
Cited in
(10)- An on-the-fly grammar modification mechanism for composing and defining extensible languages
- A polynomial-time parsing algorithm for \(K\)-depth languages
- DynGenPar -- a dynamic generalized parser for common mathematical language
- Weighted Deductive Parsing and Knuth's Algorithm
- Robust Parsing Using Dynamic Programming
- LL(1) grammars and Sub-LL(1) grammars
- Identifying justifications in written dialogs by classifying text as argumentative
- Properties of deterministic top down grammars
- Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems
- On the complexity of LL(k) testing
This page was built for publication: Dynamic \(\text{LL} (k)\) parsing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920233)
