TL;DR This tutorial explains how to design test cases that effectively cover features of a given context-free grammar using the k-path strategy. Note: The k-path strategy discussed here is unrelated to the k-path cover from graph theory. Definitions For this post, we use the following terms as we have defiend previously: The alphabet is the set all of symbols in the input language. For example, in this post, we use all ASCII characters as alphabet. A terminal is a single alphabet symbol. For ...
