The equivalence problem for LL- and LR-regular grammars
type: Item
instance of: scholarly article
title: The equivalence problem for LL- and LR-regular grammars
zbMATH Open document ID: 0482.68070
DOI: 10.1016/0022-0000(82)90044-7
author: Anton Nijholt
published in: Journal of Computer and System Sciences
publication date: 1982-01-01T00:00:00Z
full work available at URL: the-equivalence-problem-for-ll-and-lrregular-grammars(8b69ffc3-cabf-42ff-8c10-b428b026a68e).html
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68N20
zbMATH DE Number: 3757730
zbMATH Keywords: context-free languages
zbMATH Keywords: strict deterministic grammars
zbMATH Keywords: LL(k) grammars
zbMATH Keywords: decidability
MaRDI profile type: Publication
OpenAlex ID: W1987076568
cites work: LR-regular grammars - an extension of LR(k) grammars
cites work: Q4185830
cites work: Q4198075
cites work: Strict deterministic grammars
cites work: Real-Time Strict Deterministic Languages
cites work: On equivalence of grammars through transformation trees
cites work: Q5592246
cites work: LL-regular grammars
cites work: Q4072875
cites work: Q4102758
cites work: Ll-regular grammars
cites work: Q3964031
cites work: On the relationship between the LL(k) and LR(k) grammars
cites work: A direct algorithm for checking equivalence of LL(k) grammars
cites work: The equivalence problem for real-time strict deterministic languages
cites work: On LL-regular grammars
cites work: Properties of deterministic top-down grammars
cites work: Some remarks on the KH algorithm fors-grammars
description: scientific article; zbMATH DE number 3757730