MOVES Seminar 06. Oct, 2011, 11:00

Incremental Greibach Normal Form


An algorithm is shown that obtains the Greibach Normal Form (GNF) from a context-free grammar while allowing to subsequently add productions to the original grammar without reevaluating productions that already were transfered to GNF.

 

The algorithm simulates an algorithm that is known as being correct on a data structure that preserves information on how the GNF was established. This information is used to prevent the algorithm from doing the same operations twice.

 

Results of an implementation of this incremental algorithm are presented.