[XML-DEV Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] Re: Infinity
On Sun, Mar 4, 2018 at 6:36 PM, C. M. Sperberg-McQueen <cmsmcq@blackmesatech.com> wrote:
Actually, a state-machine based implementation can report with high confidence, and with strict bounds on memory usage, the presence, or failure to be present, of a '5' after any number of 0's. Infinity isn't a thing that exists in actual texts, so there's no need to state that any given string must be finite. The closest you can get is say “any number of” and there you go. BTW, this argument is not entirely theoretical. Those who remember the Billion Laughs exploit may also remember that my first-gen "Lark" processor sailed through it, where by "sailed through" I mean "completed successfully after a few hours processing with no memory stress". Because it had a state machine inside. There is, practically, no limit on the length of the input such a processor can handle. So, if I claim it can manage infinite input, you can't prove me wrong. Fortunately, there's no such thing.
[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] |
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|