The green path follows a symmetrical pattern in visiting G i one column at a time, with a switch in the middle of column 2k.
theorem 3 suggests that designing a polynomial time algorithm for finding the parsing strategy of an SCFG rule having optimal time complexity is a difficult task.