News for hackers. Stuff that matters.

A comment on Monoid machines: a O(log n) parser for regular languages (2006) [pdf]. Parent comment

Re:Monoid machines: a O(log n) parser for regular languages ... by Dylan16807 on Friday July 13, 2018 @12:52AM (#17520593)
So each thread might have to do up to m times the work, where m is the number of states? That sounds like it might be a pretty bad hit on the number of processors you need just to break even.
[ Parent | on HN ]

There are no comments on this comment yet.