This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Practical Method for Reducing Weak Precedence Parsers
January 1983 (vol. 9 no. 1)
pp. 25-30
J. Aoe, Department of Information Science and Systems Engineering, Faculty of Engineering, University of Tokushima
This paper presents a practical method for constructing a more compact matrix structure of the precedence information used in a new weak precedence parsing. The parsing algorithm differs from the conventional weak precedence algorithm in that the precedence relation .> signals a sequence of reduce actions, not just one. The method can be used for any weak precedence grammars without degrading the good error detection capability of the traditional weak precedence parsers. It is shown by the empirical results that the obtained matrices are the very reasonable size and that the presented parsing algorithm is very efficient.
Index Terms:
weak precedence parser, Parser optimization, parsing algorithm, programming languages, space saving, time efficiency
Citation:
J. Aoe, Y. Yamamoto, R. Shimada, "A Practical Method for Reducing Weak Precedence Parsers," IEEE Transactions on Software Engineering, vol. 9, no. 1, pp. 25-30, Jan. 1983, doi:10.1109/TSE.1983.236167
Usage of this product signifies your acceptance of the Terms of Use.