← Back to context Comment by jhncls 5 years ago You seem to be hinting to Chesterton's fence [0].[0]: https://fs.blog/2020/03/chestertons-fence/ 2 comments jhncls Reply resonantjacket5 5 years ago Accept in this case I don't really see why you'd want a naive o(n^2) parser when it isn't needed. Well besides for slow loading times. asadlionpk 5 years ago Thanks for sharing this, didn't have a name for this scenario.
resonantjacket5 5 years ago Accept in this case I don't really see why you'd want a naive o(n^2) parser when it isn't needed. Well besides for slow loading times.
Accept in this case I don't really see why you'd want a naive o(n^2) parser when it isn't needed. Well besides for slow loading times.
Thanks for sharing this, didn't have a name for this scenario.