Reginald Braithwaite personal blog
A Brutal Look at Balanced Parentheses, Computing Machines, and Pushdown Automata
As discussed in Pattern Matching and Recursion , a well-known programming puzzle is to write a function that determines whether a string of parentheses is “balanced,” i.e. each opening parenthesis has a corresponding closing parenthesis, and the parentheses are properly nested.
- Points
- 146
- HN comments
- 109
- Submissions
- 2
- Cited by
- 0 commenters
Software EngineeringMath & Algorithms2019
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Feb 22, 2019 | A Brutal Look at Balanced Parentheses, Computing Machines, and Pushdown Automata by braythwayt | 146 | 77 |
| Nov 5, 2025 | A Brutal Look at Balanced Parentheses, Computing Machines, and Pushdown Automata by warrenm | 59 | 32 |
