Supercombinator driven grammar reconstruction

In this paper we discuss the possibility of super-combinator driven grammar reconstruction. We present the way how to reconstruct a CFG to its original form from the super-combinator set. We also show that we can achieve mild form of grammar refactoring while performing the process. Additionally, we process multiple grammars into a single supercombinator set and from it we reconstruct the grammars back. We choose most used supercombinators with the arity of 10 to perform the reconstruction. We then analyze the reconstructed sentence parts.