Compute Pascal's triangle up to a given number of rows.
In Pascal's Triangle each number is computed by adding the numbers to the right and left of the current position in the previous row.
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 # ... etc
make chez if you're using ChezScheme or
make guile if you're using GNU Guile.
Sometimes the name for the scheme binary on your system will differ from the defaults.
When this is the case, you'll need to tell make by running
make chez chez=your-chez-binary or
make guile guile=your-guile-binary.
(load "test.scm")at the repl prompt.
pascals-triangle.scmreloading as you go.
(test)to check your solution.
If some of the test cases fail, you should see the failing input and the expected output.
The failing input is presented as a list because the tests call your solution by
(apply pascals-triangle input-list).
To learn more about
apply see The Scheme Programming Language -- Chapter 5