Generating Context-Free Grammars using Classical Planning

This paper presents a novel approach for generating Context-Free Grammars (CFGs) from small sets of input strings (a single input string in some cases). Our approach is to compile this task into a classical planning problem whose solutions are sequences of actions that build and validate a CFG compliant with the input strings. In addition, we show that our compilation is suitable for implementing the two canonical tasks for CFGs, string production and string recognition.

Authors

• Javier Segovia-Aguas
• Sergio Jiménez
• Anders Jonsson

Keywords

• Planning and Scheduling: Applications of Planning
• Planning and Scheduling: Hierarchical Planning