Cerca Petizioni

• 

  TIV Monthly test

  Abstract
  A fast algorithm is given to produce a small set of short sentences from a context free grammar such that each production of the grammar is used at least once. The sentences are useful for testing parsing programs and for debugging grammars...  altroAbstract
  A fast algorithm is given to produce a small set of short sentences from a context free grammar such that each production of the grammar is used at least once. The sentences are useful for testing parsing programs and for debugging grammars (finding errors in a grammar which causes it to specify some language other than the one intended). Some experimental results from using the sentences to test some automatically generated simpleLR(1) parsers are also given.  

  • In Utenti / Amministratore's Petizioni

  • 28 agosto 2014
  • 4 Firme
  • 0 commenti
  • 1 Mi Piace
  • 1.935 visite