The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Two languages for estimating program efficiency
Communications of the ACM
Communications of the ACM
On the relative efficiencies of context-free grammar
Communications of the ACM
Algorithms + Data Structures = Programs
Algorithms + Data Structures = Programs
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Experimental comparison of some parsing methods
ACM SIGPLAN Notices
Estimating the Speedup in Parallel Parsing
IEEE Transactions on Software Engineering
Upper Bounds for Speedup in Parallel Parsing
Journal of the ACM (JACM)
Computer-assisted microanalysis of programs
Communications of the ACM
Computer-aided micro-analysis of programs
ICSE '79 Proceedings of the 4th international conference on Software engineering
Interactive language implementation system
IBM Journal of Research and Development
| Hi-index | 48.24 |
This paper describes an approach for determining the minimum, maximum, and average times to parse sentences acceptable by a deterministic parser. These quantities are presented in the form of symbolic formulas, called time-formulas. The variables in these formulas represent not only the length of the input string but also the time to perform elementary operations such as pushing, popping, subscripting, iterating, etc. By binding to the variables actual numerical values corresponding to a given compiler-machine configuration, one can determine the execution time for that configuration. Time-formulas are derived by examining the grammar rules and the program representing the algorithm one wishes to analyze. The approach is described by using a specific grammar that defines simple arithmetic expressions. Two deterministic parsers are analyzed: a top-down recursive descent LL(1) parser, and a bottom-up SLR(1) parser. The paper provides estimates for the relative efficiencies of the two parsers. The estimates applicable to a specific machine, the PDP-10, are presented and substantiated by benchmarks. Finally, the paper illustrates the proposed approach by applying it to the analyses of parsers for a simple programming language.