1996/06/20 by Noriko Tomuro, Tomuro, Noriko
Computer Science · #Embedded Systems Design Techniques #Formal Methods in Verification #cmp-lg #cs.CL
paper · pdf · doi:10.48550/arxiv.cmp-lg/9606028
1 postscript figure, uses psfig.sty and aclap.sty
arxiv created 1996/06/20 · arxiv updated 2009/11/30
A left-corner parsing algorithm with top-down filtering has been reported to show very efficient performance for unification-based systems. However, due to the nontermination of parsing with left-recursive grammars, top-down constraints must be weakened. In this paper, a general method of maximizing top-down constraints is proposed. The method provides a procedure to dynamically compute *restrictor*, a minimum set of features involved in an infinite loop for every propagation path; thus top-down constraints are maximally propagated.