Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T16:17:28.120Z Has data issue: false hasContentIssue false

An innovative finite state concept for recognition and parsing of context-free languages

Published online by Cambridge University Press:  01 December 1996

M. J. NEDERHOF
Affiliation:
University of Groningen, Humanities Computing, P.O. Box 716, NL-9700 AS Groningen, The Netherlands. e-mail: markjan@let.rug.nl
E. BERTSCH
Affiliation:
Ruhr University, Faculty of Mathematics, Universitätsstraße 150, D-44780 Bochum, Germany. e-mail: bertsch@lpi.ruhr-uni-bochum.de
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In the full paper in the companion volume, we introduce a new subclass of the context free languages, the meta-deterministic languages, which includes the deterministic languages, but also the languages that result if deterministic languages are combined via regular expressions.

Information

Type
Research Article
Copyright
1997 Cambridge University Press