laziness, impatience, and hubris | |
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
This task gets absurdly easy in UCBLogo (a Logo dialect that is, in effect, an M-expression dialect of Lisp complete with macros). It is, in fact, so easy as to be almost meaningless in the context of UCBLogo. You don't have to create the procedure (aka function/subroutine) at all because it already exists in the form of the language primitive procedure reverse. The reason it works that way is pretty simple: in UCBLogo, the way one represents a "string" made up of a number of words is as a bracketed list, what in UCBLogo parlance is the list, or sentence, data type. The reverse procedure operates on lists, same as the Perl function of the same name, but the fact that the list data type in UCBLogo is in effect its string data type eliminates a middleman. Thus, no procedure definition is needed, and using it looks like this: reverse [ one two three four ]The output looks like this: [four three two one]There are some definite advantages to treating all data as lists (the other type of lists in UCBLogo being known as words).
In reply to Re: Five Ways to Reverse a String of Words (C#, Perl 5, Perl 6, Ruby, Haskell)
by apotheon
|
|