Josh Haberman personal blog
Parsing C++ is literally undecidable (2013)
Many programmers are aware that C++ templates are Turing-complete, andthis was proved in the 2003 paper C++ Templates areTuring Complete.
- Points
- 111
- HN comments
- 142
- Submissions
- 1
- Cited by
- 13 commenters
Software EngineeringProgramming Languages2019
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Oct 4, 2019 | Parsing C++ is literally undecidable (2013) by umanwizard | 111 | 142 |
Cited in comments
Linked from 13 Hacker News comments by 13 different people, from Sep 2015 to Nov 2024.
Most recent:
- swolchok · Nov 2, 2024
- armchairhacker · Jun 5, 2023
- praptak · Feb 16, 2022
- echlebek · Jul 15, 2020
- antisemiotic · Jun 17, 2019
- Gladdyu · Mar 17, 2019
