By Topic

A Practical Method for Reducing Weak Precedence Parsers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
J. Aoe ; Department of Information Science and Systems Engineering, Faculty of Engineering, University of Tokushima ; Y. Yamamoto ; R. Shimada

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.

Published in:

IEEE Transactions on Software Engineering  (Volume:SE-9 ,  Issue: 1 )