A polynomial-time parsing algorithm for \(K\)-depth languages
type: Item
instance of: scholarly article
title: A polynomial-time parsing algorithm for \(K\)-depth languages
zbMATH Open document ID: 0846.68058
author: Pierluigi San Pietro
author: A. Cherubini
published in: Journal of Computer and System Sciences
publication date: 1996-07-16T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 890892
zbMATH Keywords: \(K\)-depth grammars
zbMATH Keywords: context-free grammars
MaRDI profile type: Publication
full work available at URL: jcss.1996.0006
OpenAlex ID: W2012906089
DOI: 10.1006/JCSS.1996.0006
Recommended article: Q3787517
Recommended article: A Polynomial Time Algorithm for Parsing with the Bounded Order Lambek Calculus
Recommended article: Q3313283
Recommended article: On LR(k)-Parsers of Polynomial Size
Recommended article: Dynamic \(\text{LL} (k)\) parsing
Recommended article: Q5203697
Recommended article: On the complexity of parallel parsing of general context-free languages
Recommended article: Q3495660
Recommended article: Upper bounds on the size of LR(k) parsers
Recommended article: A Polynomial Algorithm for the Inference of Context Free Languages
description: scientific article; zbMATH DE number 890892