Tests for the LR-, LL-, and LC-regular conditions

Stephan Heilbrunner
1983 Journal of computer and system sciences (Print)  
The original test for the U-regular property is not quite correct. Generalizing the item method which is well known from U(k) theory a decidable criterion and a parsing algorithm are obtained. The method can be applied to U-regular and K-regular parsing too. It yields tests and inclusion theorems for the various classes of grammars considered.
doi:10.1016/0022-0000(83)90026-0 fatcat:retbdczjuva7rjj66uy6fkqfoi