A sentence generator for testing parsers-Reference-Cited by-同舟云学术

A sentence generator for testing parsers

Published:1972-09 Issue:3 Volume:12 Page:366-375
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Purdom Paul

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01932308.pdf

Reference7 articles.

1. Richard L. Sander,A General Test Data Generator for Cobol, Spring Joint Computer Conference 1962.

2. K. V. Hanford,Automatic Generation of Test Cases, I.B.M. System Journal Vol. 9 No. 4 (1970), 242–257.

3. F. L. DeRemer,Simple LR(k) Grammars, CACM 14 (1971), 453.

4. John Reynolds, See J. C. Earley,An Efficient Context-Free Parsing Algorithm, Thesis (1968), 128, 129, Computer Science Department, Carnegie-Mellon University.

5. F. L. DeRemer,Practical Translators for LR(k), Languages, Project MAC TY-65 MIT.

Cited by 122 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Stateful black-box fuzzing for encryption protocols and its application in IPsec;Computer Networks;2024-09

2. Spectrum-based rule- and item-level localization of faults in context-free grammars;Journal of Systems and Software;2024-09

3. Grammar-based test suite construction using coverage-directed algorithms over LR-graphs;Journal of Systems and Software;2024-08

4. Evolutionary Generative Fuzzing for Differential Testing of the Kotlin Compiler;Companion Proceedings of the 32nd ACM International Conference on the Foundations of Software Engineering;2024-07-10

5. Look Ma, No Input Samples! Mining Input Grammars from Code with Symbolic Parsing;Companion Proceedings of the 32nd ACM International Conference on the Foundations of Software Engineering;2024-07-10