On the size of unambiguous context-free grammars
type: Item
instance of: scholarly article
title: On the size of unambiguous context-free grammars
zbMATH Open document ID: 0621.68047
DOI: 10.1016/0304-3975(86)90138-6
author: Piotr Wyrostek
published in: Theoretical Computer Science
publication date: 1986-01-01T00:00:00Z
review text: It is shown that every unambiguous CFG with p productions has size at least 2p-1.
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4007741
zbMATH Keywords: unambiguous context-free grammars
zbMATH Keywords: size
MaRDI profile type: Publication
full work available at URL: 0304-3975(86)90138-6
OpenAlex ID: W1820667573
cites work: Optimization of LR(k) parsers
cites work: Q4198075
description: scientific article; zbMATH DE number 4007741