Issue No. 05 - September (1979 vol. 5)
J. Cohen , Department of Physics, Brandeis University
Time formulas are symbolic formulas which express the execution time of a program as a function of its input data and of variables representing the time to execute individual operations (e.g., push, pop, transfer, etc.). It is shown that in many cases the time formulas for recursive descent parsers may be generated automatically by a simple inspection of the parser code. These time formulas are instrumental in estimating the gains attained by various types of optimizations. Several of these optimizations are presented and their efficiency gains are estimated. A parser for a simple programming language is generated, optimized, and evaluated using the proposed techniques.
transformation rules, Efficiency, optimization, parser analysis, top-down parsing
D. Auty, R. Sitver and J. Cohen, "Evaluating and Improving Recursive Descent Parsers," in IEEE Transactions on Software Engineering, vol. 5, no. , pp. 472-480, 1979.