A CKY parser for picture grammars

We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident with Matz's context-free picture grammars). We describe a new parsing algorithm, which extends the Cocke, Kasami and Younger's classical parsing technique for string languages and preserves the polynomial time complexity. Key words: formal languages, picture languages, 2D languages, context-free picture grammars, CKY parsing, Kolam Array grammars, Matrix grammars, Siromoney grammars

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Stefano Crespi-Reghizzi, Matteo Pradella
• Keywords: Grammars, IPL 2008, Picture, Picture Grammars