The Research Of Test Coverage Measurement For TTCN-3 Compiler

Now, test cases for compiler testing are mainly designed, developed and executed manually, with low efficiency and high error rate. The test sets generation method, the rule coverage algorithm based on grammar testing theory only considers syntax test coverage for grammar of a language tested. Semantic coverage has become a fascinating study field in order to improve comprehensive testing for language tested.A semantic coverage algorithm has been provided combining the development of TTCN-3 compiler: the semantic rules of the language tested are formalized by its attribute grammar constructions, then a kind of heuristic search algorithm is used to generate test sets which will achieve double coverage of the syntax and the semantics of the language tested. Additionally, a test coverage measurement which includes the coverage of both context-free grammar and semantic rules is defined. The semantic rules represented in the form of its attributes are used to decide the termination of the semantic coverage algorithm.Not only the semantic coverage algorithm considers the syntax and the semantic test coverage for the language tested, but testers can control the size and guidance of test sets generated freely. And testers can generate the specific test sets to cover some parts of the language specification using heuristic strategies. This is different from the fixed test sets generated by the rule coverage algorithm.To solve the problem that the semantic coverage algorithm can only generate test sets which involve black-box information such as grammar definition, a test case extension scheme is given. The test sets generated contain source codes branch information of the TTCN-3 compiler tested and guarantee condition coverage.Test coverage measurement defined above and test system framework et al are universal and feasible for other compilers'testing.