👋Learning to code? Check out ourbrand new Bootcampfor beginners!
You're given the opportunity to write software for the Bracketeerâ„¢, an ancient but powerful mainframe. The software that runs on it is written in a proprietary language. Much of its syntax is familiar, but you notice lots of brackets, braces and parentheses. Despite the Bracketeerâ„¢ being powerful, it lacks flexibility. If the source code has any unbalanced brackets, braces or parentheses, the Bracketeerâ„¢ crashes and must be rebooted. To avoid such a scenario, you start writing code that can verify that brackets, braces, and parentheses are balanced before attempting to run it on the Bracketeerâ„¢.
Given a string containing brackets [], braces {}, parentheses (), or any combination thereof, verify that any and all pairs are matched and nested correctly.
Any other characters should be ignored.
For example, "{what is (42)}?" is balanced and "[text}" is not.
Simply type 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.matching-brackets.scm reloading 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 matching-brackets input-list).
To learn more about apply see The Scheme Programming Language -- Chapter 5
Edit via GitHub
Sign up to Exercism to learn and master Scheme with 39 exercises, and real human mentoring, all for free.