An Object-oriented LL(1) parser generator

Show simple item record

dc.contributor.author Kuhl, Bernd
dc.contributor.author Schreiner, Axel-Tobias
dc.date.accessioned 2009-03-11T17:48:32Z
dc.date.available 2009-03-11T17:48:32Z
dc.date.issued 2000
dc.identifier.issn 0362-1340
dc.identifier.uri http://hdl.handle.net/1850/8563
dc.description Copyright ACM, 2000. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM SIGPLAN Notices, Volume 35, Issue 12 (December 2000). http://doi.acm.org/10.1145/369928.369941 en_US
dc.description.abstract This paper describes oops, an object-oriented parser generator implemented in Java [1]. Oops takes a grammar written in EBNF, checks that it is indeed LL(1), i.e., suitable for recursive descent parsing, and produces a parser as a set of serialized objects. A scanner must be provided and classes satisfying certain interfaces can be implemented which the parser uses to build parse trees. The paper discusses the ideas behind oops — which are not specific to an implementation in Java — and shows the advantages of an object-oriented approach to grammar verification and parsing.
dc.language.iso en_US
dc.publisher ACM SIGPLAN Notices
dc.relation.ispartofseries Vol. 35
dc.relation.ispartofseries No. 12
dc.subject Compiler en_US
dc.subject Object-orientation en_US
dc.subject Parser en_US
dc.title An Object-oriented LL(1) parser generator
dc.type Article

Files in this item

Files Size Format View
BKuhlArticle2000.pdf 126.7Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse