[Date Prev][Date Next][Thread Prev][Thread Next]
[Date Index]
[Thread Index]
- Subject: Re: lpeg could infer the validity of this grammar.
- From: Dirk Laurie <dirk.laurie@...>
- Date: Mon, 15 Dec 2014 06:24:03 +0200
2014-12-15 4:49 GMT+02:00 Sam Putman <atmanistan@gmail.com>:
> The grammar, as written, will not loop, and the compiler can reason through
> the call chain, just like we do, to confirm that.
In this case, it can. But a mechanism that can in general determine whether
a given grammar will terminate for all input --- didn't Alan Turing prove that
to be impossible?
