The Grammar Tool Box: A Case Study Comparing GLR Parsing Algorithms | Zendy

Adrian Johnstone | Zendy; Elizabeth Scott | Zendy; Giorgios Economopoulos | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Grammar Tool Box: A Case Study Comparing GLR Parsing Algorithms

Author(s) -

Adrian Johnstone,

Elizabeth Scott,

Giorgios Economopoulos

Publication year - 2004

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.06.008

Subject(s) - computer science , parsing , programming language , cobol , pascal (unit) , grammar , rule based machine translation , context free grammar , parser combinator , java , lr parser , parsing expression grammar , algorithm , artificial intelligence , natural language processing , l attributed grammar , philosophy , linguistics

The Grammar Tool Box is a toolset for manipulating Context Free Grammars and objects associated with them such as parsers, languages and derivations. GTB has three main rôles: as a pedagogic tool; as an experimental platform for novel algorithms and representations; and as a production tool for translator front end generation. In this paper we give an overview of GTB and its companion Java-based animator tool PAT. We illustrate the use of the toolset in the construction of a comparative study of three variants of the Tomita-style GLR parsing algorithm running on LR(0), SLR(1) and LR(1) tables for ANSI-C, ISO-Pascal and IBM VS-COBOL, and give results showing the size of the structures constructed by these parsers and the amount of searching required during the parse, which abstracts their runtime

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research