“…This tour has a i as its first label. After that, there are three possibilities: (1) we have reached h, which is a leaf, and we produce some element of Nf K (at the terminal point it may be = ε), (2) we have reached h, produce an element of Nf K and perform additional loops around some of the branches emanating from h, (3) we have not yet reached h, produce an element of Nf K , perform loops around some of the branches that do not contain h and proceed further towards h. Now suppose that Nf K is regular and that C K is an unambiguous, left or right linear grammar. In the dependency di-graph associated with our grammar C for Nf G , we see that S is isolated, and the other strong components are V T = {T 1 , .…”