Re:Proving that C++'s grammar is undecidable
by jlebar on Tuesday April 28, 2020 @11:13PM
(#23014896)
There is a finite set of Domino "prototypes" (a pair of strings), and you are allowed to use as many of each prototype as you like.
[ Parent
| on HN ]
There are no comments on this comment yet.