Dynamic \(\text{LL} (k)\) parsing
type: Item
instance of: scholarly article
title: Dynamic \(\text{LL} (k)\) parsing
zbMATH Open document ID: 0865.68077
author: Arnd Rußmann
published in: Acta Informatica
publication date: 1996-09-25T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 918716
zbMATH Keywords: \(\text{LL} (k)\) parsing
zbMATH Keywords: dynamic context-free grammars
zbMATH Keywords: deterministic context-free language
MaRDI profile type: Publication
Recommended article: Q3325071
Recommended article: Q4955250
Recommended article: Q3327739
Recommended article: An incremental LL(1) parsing algorithm
Recommended article: On parsing LL-languages
Recommended article: Robust Parsing Using Dynamic Programming
Recommended article: Semantic routines and \(LR(k)\) parsers
Recommended article: Parallel \(LL\) parsing
Recommended article: Parsing with dynamic rule selection
description: scientific article; zbMATH DE number 918716