Testing Grammars For Top-Down Parsers

9 years 4 months ago
Testing Grammars For Top-Down Parsers
According to the software engineering perspective, grammars can be viewed as "Specifications for defining languages or compilers". They form the basics of languages and several important kinds of software rely on grammars; e.g. compilers and parsers, debuggers, code processing tools, software modification tools, and software analysis tools. Testing a grammar to make sure that it is correct and defines the language for which it is developed is also very important. We implemented Purdom's algorithm to produce test data automatically for testing the MACS 1 grammar ( an LL(1) grammar) and the parser. Two different implementations of Purdom's algorithm were carried out in this project, one in Java and the other in C++; test strings and other analysis data automatically generated by these implementations are given in the paper.
A. M. Paracha, F. Franek
Added 13 Oct 2010
Updated 13 Oct 2010
Type Conference
Year 2008
Authors A. M. Paracha, F. Franek
Comments (0)