search for: algol

On 2008-04-29, at 08:41, Hendrik Boom wrote: > On Mon, 28 Apr 2008 17:54:31 -0400, Gordon Henriksen wrote: > >> On Apr 28, 2008, at 17:32, Hendrik Boom wrote: >> >>> In http://llvm.org/docs/FAQ.html, when taking about writing a >>> compiler >>> that uses LLVM (at least I think that's what the FAQ question is >>> asking), >>> the

...interpreter (shell) ... > > HISTORY > A sh command appeared in Version 1 AT&T UNIX. It was, however, > unmaintainable so we wrote this one. > The V1 shell was of course not Bourne's. However Bourne's code was consider "unmaintainable" as he was an algol coder, not a C coder. He had numerous macros defined to allow him to use his algol coding style with a C compiler. jl -- Jon H. LaBadie jon at jgcomp.com 11226 South Shore Rd. (703) 787-0688 (H) Reston, VA 20190 (703) 935-6720 (C)

On Mon, 28 Apr 2008 17:54:31 -0400, Gordon Henriksen wrote: > On Apr 28, 2008, at 17:32, Hendrik Boom wrote: > >> In http://llvm.org/docs/FAQ.html, when taking about writing a compiler >> that uses LLVM (at least I think that's what the FAQ question is >> asking), >> the FAQ recommends >> >>> # Call into the LLVM libraries code using your

Hello list, Is there any way to perform a block comment in R? In C++, anything in between a /* and */ is considered a comment, and it allows programmers to comment out chunks of code for testing and debugging. Is there such a feature in R? Cheers, Wee-Jin

Hello, I have a number centos3.8 installations. Recently I have figured out that version of coreutils is : [ivan at algol ivan]$ rpm -q coreutils coreutils-4.5.3-28.1 while RedHat has released an bux fix errata to that package: https://rhn.redhat.com/errata/RHBA-2006-0670.html Actually I discovered that when I encounter bug that should be fixed by this update: http://bugzilla.redhat.com/bugzilla/show_bug.cgi?id=200...

...>= 0)) (X[i,3] <- 4; X[i,4] <- atan(X[i,1]/X[i,2]) + 2*pi) else ( In the first instance the ';' seems to the source of a syntax error. Removing the second elements of the compound statement solves the syntax problem and the code runs. As the R syntax is supposed to be 'Algol-like' I had thought if <A> then <B> else <C> should work for compound <B> ... ie that the bracket (X[i,3] <- NA; X[i,4] <-NA) should be actioned 1) any elegant solutions to what must be a common task? 2) any explanations for the ';' effect ? thanks Ri...

...h game) Product: swfdec Version: git Platform: x86 (IA32) OS/Version: Linux (All) Status: NEW Severity: normal Priority: medium Component: library AssignedTo: swfdec at lists.freedesktop.org ReportedBy: algol at firenze.linux.it QAContact: swfdec at lists.freedesktop.org Desktop Tower Defense (http://www.handdrawngames.com/DesktopTD/DesktopTD15k.swf) isn't displayed appropriately. On the start screen there are some white squares flashing on the left and the top part of the screen isn'...

...n(x) { roundcolor(cbind(palette[[1L]](x), palette[[2L]](x), palette[[3L]](x), palette[[4L]](x))) * 255 } } } ____________________________________________________ Universidade de Lisboa - Laborat?rio SIM Alberto Krone-Martins http://www.astro.iag.usp.br/~algol

I spent more time than I should have debugging a script because I wanted x<-seq(0,100)*0.1 but typed x<-seq(O:100)*0.1 seq(0:100) yields 1 to 101, Clearly my own brain to fingers fumble, but possibly one others may want to avoid it. JN

...k}=a_{t-l_k} } ---------------------------------------------------------------------------------- #{ X_{t-l_1}=a_{t-l_1}, X_{t-l_2}=a_{t-l_2}, ..., X_{t-l_k}=a_{t-l_k} } for any given sequence of a_t, a_{t-l_1}, a_{t-l_2}, ..., a_{t-l_k}. If I should do this in C, Fortran or some other algol-like programming language I've no doubt it will take to me no more than few minutes to write down the code. But I'm interested in doing it within R framework in order to further use such a result in a statistical context, where other powerfull tools are available. Shurly I can try to impl...

Gabor Csardi writes: > Btw. for some motivation, here is a (surely incomplete) list of > languages with '+' as the string concatenation operator: > > ALGOL 68, BASIC, C++, C#, Cobra, Pascal, Object Pascal, Eiffel, Go, > JavaScript, Java, Python, Turing, Ruby, Windows Powers hell, > Objective-C, F#, Sc-ala, Ya. The situation for R is rather different from that of a language (as many of the above) in which variables are declared to be of a speci...

>>> >>last OS I can think of with an actual Bourne shell was Solaris. >>> >> >>> >> >> > >> >The various *BSD's have & use the actual Bourne shell .... >> > >> > > Which one? All the BSDs I know of use the Almquist Shell except for > OpenBSD which uses a patched version of the Public Domain Korn Shell

the following is a trivialized version of some functional code i tried to use in r: (funcs = lapply(1:5, function(i) function() i)) # a list of no-parameter functions, each with its own closure environment, # each supposed to return the corresponding index when applied to no arguments sapply(funcs, function(func) func()) # supposed to return c(1,2,3,4,5) there is absolutely nothing unusual in

...ich associates an operator and its arguments. Every kind of operation is cast in this form -- infix, prefix, postfix, function calls, array references, lists, and even control structures such as if-then-else and do-loops. Maxima usually parses an input written in the Maxima language (yet another Algol derivative) and then calls MEVAL, the main evaluation function, with the Lisp representation of the input as its argument. However, if R could construct a suitable Lisp object, R could bypass the parsing and just call MEVAL directly. Although several interfaces which are based on sockets have been...

thomas weidner wrote: >>The reason why I ask is that I expressed an outrageous opinion at >>Supercomputing back in November, to wit, that CL is probably the best >>language suited for today's multicore problems... but I don't have the >>time to hack one of the current implementations to proove the point. > > > interesting, what makes lisp superior in this

...Few, if any, other > languages have this feature or plan to implement it. I realize there might be Lisp macro-like packages for other languages, such as OCaml. Dylan, for all intents and purposes, is A Dead Parrot (as much as it pains me to say so [*]), but was a good example of how to take an Algol-like syntax and incorporate Lisp-like macros in the d-expression paper. For other languages that feature 'eval', such as Python, the AST is relatively complex enough that macros may not ever be viable, i.e., that one could easily perform 'macroexpand-1' before 'eval'. But...

Esta pregunta nos la hicimos muchos, alguien aproxima una respuesta a través de esta publicación: http://www.scielo.org.ar/pdf/ecoaus/v18n2/v18n2a07.pdf Saludos cordiales Teresa -- Ing. Agr. M.Sc.Teresa Boca Instituto de Clima y Agua INTA Castelar. Las Cabañas y Los Reseros s/n° 1712 Castelar Pcia de Buenos Aires, Argentina Cel: 01115-3572-9584 Tel: (54-11)-4621-0125/1684 Fax:(54-11)-4621-5663

We have just installed Samba 1.9.18p10 on an Ultra Sparc, Solaris 2.5.1 . So far we have been very impressed with the resilience and performance of Samba in contrast to Hummingbird and Solstice NFS products while doing large product builds on our NT4.0 sp4 machines. However we have come across one little problem, which may be down to configuration, that has left us "worried" about

...ld just avoid the stack walking entirely > and add $k-1$ arguments to each function at level $k$, i.e., at most 2 > arguments in all. This may even be an easy first implementation. > > --Vikram Very true. Manipulation of thread-local storage is the reason why displays, after the early Algol implementations, have never been in favour with compiler writers. The first generation of Modula-3 compilers (with C backends) generally opted for inlining nested functions. Nowadays the use of static links is the only game in town. llvm makes this difficult as the static link technique obliges to...

I wonder if the real confusino is not R's scope rules? (begin .) is not Lisp, it's Scheme (a major Lisp dialect), and in Scheme, (begin (define x ...) (define y ...) ...) declares variables x and y that are local to the (begin ...) form, just like Algol 68. That's weirdness 1. Javascript had a similar weirdness, when the ECMAscript process eventually addressed. But the real weirdness in R is not just that the existence of variables is indifferent to the presence of curly braces, it's that it's *dynamic*. In f <- function (...) {...