LL parsing, LR parsing, complexity, and automata

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 2002 English Publisher:Association for Computing Machinery (ACM)Journal:ACM SIGCSE Bulletin, volume 34, pages 71-75 (issn: 0097-8418,

Copyright policy )

Authors: R. Gregory Taylor;

doi: 10.1145/820127.820170

LL parsing, LR parsing, complexity, and automata

- Summary
- Metrics

Abstract

It is well known that pushdown-stack automata find application within the syntactic analysis phase of compilation. Nonetheless, in most compiler design textbooks the relation between popular parsing algorithms and the theory of deterministic pushdown-stack automata remains implicit. We show that it is not difficult to implement these algorithms as deterministic automata. These implementations in turn yield instructive time/space analyses of the implemented algorithms.

Related Organizations

University of Chicago
United States
Manhattan College
United States

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

0

Average

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now