An Efficient Recognizer for the Boolean Closure of Context-Free Languages

Abstract The hci-grammars defined here generate the Boolean closure of the context-free languages. The improved Graham-Harrison-Ruzzo version of Earley's recognition algorithm is adapted to this grammar class and the resulting algorithm is proven correct.

[1]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[2]  Walter L. Ruzzo,et al.  An Improved Context-Free Recognizer , 1980, ACM Trans. Program. Lang. Syst..

[3]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[4]  Robert McNaughton,et al.  Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..

[5]  Leslie G. Valiant,et al.  General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..

[6]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .