Transcript Lecture - 13: Writing RPAL Programs

Writing RPAL Programs
Programming Language Concepts
Lecture 13
Prepared by
Manuel E. Bermúdez, Ph.D.
Associate Professor
University of Florida
Writing RPAL Programs
• First, review RPAL's syntax
Let's Write a Few Programs
1. Factorial:
1. Bottom-up (classic)
2. Top down.
3. Top-down, counting from 1 to n,
4. Bottom-up, counting from 1 to n.
2. Palindrome (classic)
3. Add up numbers in a list.
• Variation: find smallest one.
Let's Write a Few Programs (cont’d)
4. Remove repeated numbers from a
tuple.
5. Create pairs of characters from two
strings.
P('abc','def')=('ad', 'be', 'cf')
6. Inner product of two vectors:
IP( (1,2,3), (1,2,3)) = 14
Let's Write a Few Programs (cont’d)
7. Pretty-print a tree.
• Recursively build a string.
• NOTE: parentheses required !
• Variation 1: structure the program
using 'lets'.
• Variation 2: print the number of
children for each node.
Writing RPAL Programs
Programming Language Concepts
Lecture 13
Prepared by
Manuel E. Bermúdez, Ph.D.
Associate Professor
University of Florida