Abstract
A programming exercise on recursion in which students create drawings of simple and bracketed Lindenmayer Systems provides a context for exploring additional computer science concepts. The resulting drawings give students a better understanding of the power of recursion as well as the rate of growth of time complexity with multiple successive recursive calls. We describe the exercise, the concepts that need to be addressed to solve the problems, and the results of using this exercise in our classes.
- 1 Prusinkiewicz, P. and Lindenmayer, A. The Algorithmic Beauty of Plants, Springer Verlag, New York, 1990. Google Scholar
Digital Library
- 2 JRyder, J. Using Parallel String Rewriting Systems to Generate Fractal Images, Proceedings of the Twelfth Annual Eastern Small College Computing Conference, October 25-26, 1996, pp. 76-78.Google Scholar
Index Terms
Recursion and grammars for CS2
Recommendations
Recursion and grammars for CS2
ITiCSE '97: Proceedings of the 2nd conference on Integrating technology into computer science educationA programming exercise on recursion in which students create drawings of simple and bracketed Lindenmayer Systems provides a context for exploring additional computer science concepts. The resulting drawings give students a better understanding of the ...
Left recursion in Parsing Expression Grammars
Parsing Expression Grammars (PEGs) are a formalism that can describe all deterministic context-free languages through a set of rules that specify a top-down parser for some language. PEGs are easy to use, and there are efficient implementations of PEG ...
Left recursion in parsing expression grammars
SBLP'12: Proceedings of the 16th Brazilian conference on Programming LanguagesParsing Expression Grammars (PEGs) are a formalism that can describe all deterministic context-free languages through a set of rules that specify a top-down parser for some language. PEGs are easy to use, and there are efficient implementations of PEG ...







Comments