In article
<46365e1d-42d8-4b3b-8e69-941472467...@u25g2000pra.googlegroups.com>,
small Pox wrote:
> Rules :
No need to add any additional hurdles -- the code as presented is
thoroughly unreadable by humans.
> @1@ No execution of the function, only checking syntax
What about "desk checking"
In article <[EMAIL PROTECTED]>,
Lars Rune Nøstdal <[EMAIL PROTECTED]> wrote:
> Hi,
> Finite automata works for "nested things".
Only in the special case when the depth of nesting is bounded ahead of
time. If it's unbounded then there is an unbounded amount of "stack"
information that the aut
In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] wrote:
> Again I am depressed to encounter a fundamentally new concept that I
> was all along unheard of.
Don't be depressed about that. There are countless concepts out there
they you haven't yet heard of.
> Its not even in paul graham's book
