whenever
is a move of the LBA
The two rules 5 and 6 are used to handle the two special extreme cases as indicate in the definition of the lba.
Hence every move of the LBA can be simulated by G using the above rules. It is clear that if the LBA ever enters a final state qf , then simulating this step the CSG G will produce a variable 
in the sentential form. At this point, the derivation must generate the original input string.
Using the production
7. 
a, 
and 
, (i.e. 
and/or 
could include <, > and onre tape symbol).
The ordered pair is transformed into the terminal symbol contained in the first component.