RUS  ENG
Full version
JOURNALS // Informatics and Automation // Archive

Tr. SPIIRAN, 2010 Issue 13, Pages 106–121 (Mi trspy385)

Algorithms of analyzing left context terminal grammars used for automated programs testing

A. S. Stankevich

St. Petersburg State University of Information Technologies, Mechanics and Optics

Abstract: After designing testing scripts, sometimes it is needed to analyze their properties. To make script specification formal, one can use left context terminal grammars. The article gives proof of left context terminal grammars and context free grammars equivalence and develops algorithms for analyzing properties of such grammars that are useful in analyzing testing script properties

Keywords: algorithm, testing script, program testing, formal grammar, left context grammar.

UDC: 004.423.25

Received: 13.12.2010



© Steklov Math. Inst. of RAS, 2024