similar to: Modula Generators

> 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

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 the Faculty of Information Technology at the Queensland University of Technology.

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 already laid out the format of

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 StructType::setBody. I don't see a

Hi, In a second try I will ask this list to give me some useful pointers. 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

Hello, Apologies if this question has already arised, hope you can help me to the find the solution to this or point the place to look at. I have a multidimensional piece-wise regression linear problem, i.e. to find not only the regression coefficients for each "interval" but also the beginning and ends of the intervals. To simplify it to the one dimensional case and two intervals,

Hi, Am i doing something silly here in expecting Euler's formula to be handled by exp? exp( ix ) = cos x + i sin x. The first example below follows this, the others not. Thanks for the education! > exp( complex(real = 0, imag = 2*pi) ) [1] 1-0i > exp( complex(real = pi, imag = 2*pi) ) [1] 23.14069-0i > exp( complex(real = pi/2, imag = 0) ) [1] 4.810477+0i [[alternative HTML

Elmar, As Chris mentioned below, please don't contact individual developers, but email llvmdev instead. For your specific question, which you asked on March 3rd, there was a response posted the same day -- did you see it? If you visit the link you provided below, at the bottom of the page is the "Next message" link which will show you the response:

Also, how are default moduli shipped with OpenSSH for use in diffie-hellman-group-exchange-sha1/sha256 chosen? Are they chosen randomly by developers or are they chosen for security properties? If they are random, why not use moduli from RFC 7919 instead, like Mozilla recommends? On Fri, Feb 15, 2019 at 3:48 AM Mark D. Baushke <mdb at juniper.net> wrote: > > Yegor Ievlev <koops1997

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,

Hello, I was trying to join a samba DC to an existing AD. But it failed when I used the command ‘samba-tool domain join euler.huawei.com DC ‘ to join it to the domain. Here’s the log: euler-2:/usr/custom # samba-tool domain join euler.huawei.com DC --option='idmap_ldb:use rfc2307 = yes' -U vdsadmin at euler.huawei.com Finding a writeable DC for domain 'euler.huawei.com'

I need to set the 'next' attribute on a parameter. If the function is to be directly called, i.e., a function constant, I am getting what I want as follows (using the C 'Core.h' binding) 1) Build a function type, using LLVMFunctionType. 2) Build a function value, passing the result of 1) to LLVMAddFunction 3) Go through the formal parameters of 2), using LLVMGet[First|Next]Param,

Hola a todos: Tengo un problema con las fechas, básicamente necesito una diferencia en días y siempre se sale en segundos. Salvo un ejemplo copiado de un libro, pero yo necesito procesar los datos propios. Les paso el código en R (copiar y pegar, son solo dos días que se comparan) y al final como me salen los resultados porque es medio complicada mi redacción. ¿Alguna idea? fechas1

Hello all, In the course of trying to implement the CDF of an InverseGammaDistribution, I have run across the need for an igamma() function. Several others have needed this function but the answers I have found so far are not totally clear to me. I'm writing for three reasons: 1) to present a small error in the docs 2) to clarify the approach we are expected to take 3) to request,for the

Hi, all, Does anybody got the most general expression of a unitary matrix? I found one in the book, four entries of the matrix are: (cos\theta) exp(j\alpha); -(sin\theta)exp(j(\alpha-\Omega)); (sin\theta)exp(j(\beta+\Omega)); (cos\theta) exp(j\beta); where "j" is for complex. However, since for any two unitary matrices, their product should also be a unitary matrix. When I

I am trying to create a set of wavelets in frequency space--namely Cauchy wavelets for an intensity analysis (von Tscharner, 2000). The wavelets are defined by the following formula: [(f/cf)^(cf*scale)]*[e^((-f/cf)+1)^(cf*scale)] where *f *is frequency of length *n*, *cf* is center frequency (defined below) and is an array of *j *columns and *n* row, and scale is a constant. cf = (1/scale)*(j

Hello, Peter, thanks for your reply 1. Huawei DOES change the distribution EULA, if type in the following command: vi /usr/share/eula/eula.en_US you can see it changed to "HUAWEI EulerOS-2.0" which is a copyright one, let alone original GPL license. According to CentOS Linux EULA The Distribution is released as GPLv2. Individual packages in the distribution come with their own

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

On Nov 22, 2004, at 10:00 AM, Vikram S. Adve wrote: > I have not seen a discussion of this and none of our current front-ends > need it. A straightforward way to add support for this would be: > > (a) Lower nested procedures into ordinary top-level functions in LLVM, > with name-mangling to enforce scopes for each name. > > (b) I assume you don't want to use a display (a

Hello, CentOS team and everyone who cares about CentOS, Huawei release an Euler OS, which is an distribution based on CentOS. http://developer.huawei.com/ict/en/site-euleros/euleros-introduction According to CentOS's statement, CentOS is distributed under the GPLv2 License. http://mirror.centos.org/centos/7.4.1708/os/x86_64/EULA The GPL license requires the modified version to be