Richard Suchenwirth 2002-12-16 - For people experienced in other languages, it may be interesting to compare code snippets between Tcl and other languages, to demonstrate similarities and differences. Please add more from your experience!
void countdown(int n) { | proc countdown {n} { int i; | for(i=n; i>0; i--) { | for {set i $n} {$i>0} {incr i -1} { printf("%d...\n", i); | puts [format %d... $i] } | } } | }
2014-12-19: the call to format isn't really necessary, puts $i... will do. But strictly speaking the equivalent of C's printf is puts with the output from format as an argument.
My alternative loop shows the relation between For and While:
void countdown(int n) { | proc countdown {n} { | subroutine countdown (i) while (n>0) { | while {$n>0} { | do printf("%d...\n", i); | puts $n... | write (*,*) n n--; | incr n -1 | n=n-1 } | } | while (n>0) } | } | endsubroutine
The main difference is that a FORTRAN while loop is executed at least once; a for loop can terminate before entry.
C /* The above could be: */
void countdown(int n) { for (; n>0; n--) printf("%d...\n",n); }
slebetman: which has an equivalent Tcl construct:
proc countdown {n} { for {} {$n>0} {incr n -1} { puts [format %d... $n] } }
AM The above proc could look like this in Fortran (90):
subroutine countdown( n ) integer :: n integer :: i do i = n,1,-1 write(*,*) i, '...' enddo endsubroutine
The main difference with either C or Tcl is that in Fortran the do-loop is very different kind of control construct: it is really an iteration over a predefined set of values, whereas in C and Tcl the three parts gouverning the iteration can be almost anything. (The Fortran control variable can be an integer only).
(define foo 42) | set foo 42 (define (square x) (* x x)) | proc square x {expr $x * $x} (define bar (square foo)) | set bar [square $foo] (define grill '(square foo)) | set grill {square $foo}
(define (abs x) | proc abs x { (cond ((> x 0) x) | expr { $x > 0? $x : ((= x 0) 0) | $x == 0? 0 : ((< x 0) (- x)))) | $x < 0? -$x} | } | or: proc abs x {expr abs($x)} | or: proc abs x {expr {$x<0? -$x: $x}}
(define (abs x) | proc abs x { (if (< x 0) | if {$x < 0} { (- x) | expr -$x x)) | } else {return $x} | }
\IfFileExists{foobar}{ | if {[file exists foobar]} { \saved@cnt=\cnt | set saved@cnt $cnt \input foobar | source foobar \cnt=\numexpr\saved@cnt+1\relax | set cnt [expr {${saved@cnt} + 1}] }{\errmessage{No file foobar}} | } else {error {No file foobar}}}
Some differences:
Tcl | (La)TeX |
---|---|
Tcl has explicit separators: newlines or semicolons between commands, whitespace between words, etc. Only some forms of variable and backslash substitution exhibit greedy parsing. | Parser is greedy and considers a syntactic entity to consist of everything up to the first token that cannot be part of it (this is a common source of strange errors and also the reason for most uses of \relax). LaTeX often replaces greedy TeX constructions by self-delimited constructions (e.g. \frac instead of \over), but sometimes the underlying greediness shines through. |
Commands and variables are different things. | Variables are mostly a kind of command: macros defined to expand to the values they store. There are some families of registers which are purely variables, but even these are typically accessed via (and often informally identified with) particular commands. |
Substitution is a one-step process; one needs an explicit subst, eval, or the like to do more than one round of substitution | Substitution is unbounded; the parser typically expands the next token repeatedly until an unexpandable token is found. |
Contexts are tied to command invocations: a proc-local context comes into existence when the proc is called and ceases to exist when the proc returns, a namespace context is placed onto the stack by e.g. a namespace eval command and is removed when that command returns. upvar and uplevel give access to contexts other than the current. | Contexts (groups) are generally independent of command expansion, although each environment (\begin{somehting}…\end{something}) also begins and ends a group. It is not possible to access saved values. In order to export a value from a group one must either make a global assignment or operate on tokens past the end-of-group. |
Recursion should be used with restraint; recursion depth is often limited unless you use tailcall. Imperative repetition constructions are preferable. | Tail-end recursion is the main approach to achieve repetition. |
See also BOOK Programming Language Examples Alike Cookbook, http://www.merd.net/pixel/language-study/scripting-language/ and CL's ill-maintained personal notes on language comparison [L1 ].
WJG - 2014-12-21 18:14:35
The Rosetta Code website contains a whole bag of such code comparisions. The programming task index page is found here