Abstract
For most problems we can ‘find our way’ through the program structure by reading one record ahead. By inspecting the next record to be processed (that is, the record just read), we can determine whether or not there is a further occurrence of the iterated part of an iteration and which part of a selection is to be executed.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1992 M. J. King and J. P. Pardoe
About this chapter
Cite this chapter
King, M.J., Pardoe, J.P. (1992). Recognition Problems and Backtracking. In: Program Design Using JSP. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-22081-6_10
Download citation
DOI: https://doi.org/10.1007/978-1-349-22081-6_10
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-57674-8
Online ISBN: 978-1-349-22081-6
eBook Packages: Computer ScienceComputer Science (R0)