Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re^2: Beyond Golf - reading between the tokens

by Aristotle (Chancellor)
on Dec 28, 2002 at 13:21 UTC ( #222725=note: print w/ replies, xml ) Need Help??


in reply to Re: Beyond Golf - reading between the tokens
in thread Beyond Golf - reading between the tokens

Yes, I thought about eval, that would need special rules indeed. The "nodes in the compiled tree" approach is a good proposal - I was trying to formulate the rules in such a way as to be unambiguous, and that would be a watertight way to get it right. Kudos to Juerd for a great suggestion on how to implement that with very little effort.

As to the point, it's true that these rules favour experienced programmers, but then these folks tend to be hard to beat in the pro league anyway. What usually leaves me unsatisfied at least about most simpler golf challenges is that concise in terms of expressiveness approaches tend to be too long when written out, so simplistic, brute force approaches, often really hackish ones, are favoured.

Basically, what I'd like to see is a challenge to use the language's expressive power to the maximum.

Makeshifts last the longest.


Comment on Re^2: Beyond Golf - reading between the tokens

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://222725]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (6)
As of 2014-12-20 10:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (95 votes), past polls