search for: modula

GPM Modula-2 and Oberon-2 Compilers File locations: ftp.fit.qut.edu.au:/pub/gpm ftp.psg.com:/pub/modula-2/gpm WEB Site: http://www.fit.qut.edu.au/CompSci/PLAS/GPM/ The Gardens Point Modula (GPM) compilers are an ongoing development project for the Programming Languages and Systems Group in...

Hi all, Is there function on R for calculating Modula generators? For example for primes above 100, e.g 157, i want to know which number generates the group under multiplication mod 157. i.e i want to find an element whose order is 156. The problem I occur is that modular arithmetic becomes inaccurate when dealing with large numbers. Thanks for any h...

> On Feb 5, 2017, at 7:13 PM, Rodney M. Bates via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > A couple of Modula-3 developers have worked on splicing LLVM on as an alternative > back end to the Modula-3 compiler, out-of-tree (the LLVM tree), of course. A major > portion of the necessary glue code is there, and at one time, I was able to get the > M3 compiler and the libraries it needs to rebuild the...

On 04/10/2014 09:02 PM, Krzysztof Parzyszek wrote: > On 4/10/2014 8:40 PM, Rodney M. Bates wrote: >> >> I could probably create llvm IR in this style by generating explicit >> address arithmetic, but I suspect that might hurt the optimization >> possibilities, perhaps a lot. It looks like re-raising the level to >> field numbers would not be horribly difficult,

I am doing some preliminary investigation into splicing the Modula-3 compiler front end onto llvm. I have a number of questions and will no doubt have more, but will start by asking for advice on this one. The M3 front end has lowered things farther than the llvm IR expects. Whereas llvm accesses fields/data members of records/structs by field number, M3 has alr...

...inters. Linear lists, as described e.g. by N.Wirth in "Algorithms and Data Structures", seem not to be implemented in S/R, although in lisp we have cons, car, cdr. Nevertheless I want to implement an algorithm using such linear lists, porting a trusted program to R (S). I need: (from Modula/Oberon) pSC* = POINTER TO SC; SC* = RECORD Next*: pSC; ...... ... END; # generate and fill a linked list: VAR p, pA, Kol: pSC; NEW( Kol); pA := Kol; while () { NEW( p ); pA.Next := p; pA := p; ... } Mapping this list management to R's list() is possible, but may not be so...

The language I am working on connecting to an llvm back-end (Modula-3) allows a fairly extensive set of recursive declarations. It looks like I can translate all its high-level types using four llvm types that refer to another type: function, struct, pointer, and array. It looks like I can alter an llvm struct type in place after it has been created, using Struct...

...-March/029910.html On Tue, Mar 9, 2010 at 6:26 AM, Elmar Stellnberger <elmstel at gmail.com>wrote: > I have posted this issue at llvmdev, but no one has answered me so far. > Therefore I would greatly appreciate your commitment. > > I am planning to implement an llvm backend for Modula-3 an would need > some help in asserting that all required features are in deed provided by > llvm. > > Thanks, > Elmar Stellnberger > > http://lists.cs.uiuc.edu/pipermail/llvmdev/2010-March/029907.html > > > Chris Lattner schrieb: > > Please email llvmdev instea...

Hi folks, Happy new year! Last LLVM Developers' Meeting I had a BoF: 'Raising Next Generation LLVM Developers'. It was suggested that we should update our open projects page and possibly restructure it a little bit. I volunteered to do this work and I need your help. Chandler and I started working on a google doc [1]. We pinged few code owners asking them to list of

...$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 reify stack frames as structures in order for individual entries to be accessible through the &q...

Hi. I am looking for an IPv6 capable CVSUP mirror. I found a discussion from one year ago where it was stated that CVSUP was not IPv6-capable. Does anyone know if this has changed? Sam -- Samuel Tardieu -- sam@rfc1149.net -- http://www.rfc1149.net/sam

...frame 7 #7 0x00000000004264fd in M3CG_LLVM__InnerCallIndirect (self=16_0000000001b30830, proc=16_0000000001a7e388, t=Void, cc=16_0000000001b07928, Nested=TRUE) at ../src/M3CG_LLVM.m3:4750 4750 LLVM.LLVMAddAttribute(actual.lVal, LLVM.NestAttribute); Current language: auto; currently Modula-3 (m3gdb) p M3CG_LLVM__DumpLvVal(actual.lVal) %load_ind13 = load i8** %load_ind_toptr12 $1 = <void> (m3gdb) p M3CG_LLVM__LvType(actual.lVal) $2 = 16_0000000001a78620 (m3gdb) p M3CG_LLVM__DumpLvType($2) i8* $3 = <void> (m3gdb) -- Rodney Bates rodney.m.bates at acm.org

hey friends, I am trying to find out documentation on cvsup for backing up cvs repositories on Centos 4.0 Can somebody give me the link for the same ? Thanks & Regards Ankush Grover

...e party were just punch-drunk with my potential I have fhcked all of them THREE times but my dhck WAS able to do some more! Cbalis- it`s COOL!!! The best weekend stuff I've ever trhied! Haven`t you tried yet? DO IT NkOW at http://www.vow-meds.com/sv/index.php?pid=genviag pretended conserve Modula-2 satyr briars irritation caraway provisions fruitful.

Following the setup in Prof.Duncan Murdoch's page, I have successfully compiled the DLL for one Fortran 95 program using Gfortran and got 300 times speed boost. For the second set of fortran programs, However, I have this error message R CMD SHLIB -o jiangang kdtree2.f90 jian.f90 gang.f90 m2c -o jian.o jian.mod make: m2c: Command not found make: *** [jian.o] Error 127 Can anyone

...The Berkeley DB package, revision 3 db4-4.0.14_1,1 The Berkeley DB package, revision 4 db41-4.1.25_1 The Berkeley DB package, revision 4.1 db42-4.2.52_3 The Berkeley DB package, revision 4.2 expat-1.95.6_1 XML 1.0 parser written in C ezm3-1.1 Easier, more portable Modula-3 distribution for building CV gd-2.0.15_1,1 A graphics library for fast creation of images gdbm-1.8.3 The GNU database manager gettext-0.12.1 GNU gettext package glib-1.2.10_9 Some useful routines of C programming (previous stable vers gmake-3.80_1 GNU version of &...

On 10/26/13 7:40 AM, Filip Pizlo wrote: > You can implement a copying GC (what the kids these days call > relocating) without accurate roots. I use "relocating" to brush over the distinction between "copying" and "compacting" collectors. For the purposes of our discussions, the two are interchangeable though. > Why aren't you just using the well-known

..."Non-interactive tool to get files from FTP, GOPHER, HTTP(S cvsup-without-gui-16.1f General network file distribution system optimized for CVS db3-3.3.11,1 The Berkeley DB package, revision 3 expat-1.95.5 XML 1.0 parser written in C ezm3-1.0 Easier, more portable Modula-3 distribution for building CV firebird-1.0.2 The open-source InterBase(tm) 6.0 spin-off (Classic version flexbackup-1.0.2 Perl-based flexible tape backup system that uses dump/afio/ fontconfig-2.1_7 An XML-based font configuration API for X Windows freetype2-2.1.3_1 A free and portabl...

At 14:35 02/10/00 +0800, mohd zamri wrote: >new to R and starting to learn to program R. The underscore ("_") did some >suprising result. e.g > >> c <- c(1,2,3,4,5) >> mean(c) >[1] 3 >> c_mean <- mean(c) >> c >[1] 3 > >having some experience in C, I thought the underscore is "always" valid in >variable name. totally confuse

Hello everybody, I'm a newbie in this list, so I don't know if it's the appropriate place for my question. Anyway, I'd be happy to find out the solution. Please, has anyone simple answer for: I'm looking for an exact list of files, which: 1. MUST have... 2. HAVE FROM BSD INSTALLATION... 3. DO NOT NEED... 4. NEVER MAY... ...the suid-bit set. Of course, it's no problem to