[Oberon] any ideas remarks about compiler construction for TinyGo?
joerg.straube at iaeth.ch
Tue Feb 19 11:08:59 CET 2019
In my point of view this is more a kind of "religious debate" whether to follow recursive descent or table driven.
I personally like recursive descent...
Am 19.02.19, 10:39 schrieb "Oberon im Auftrag von Frans-Pieter Vonck" <oberon-bounces at lists.inf.ethz.ch im Auftrag von fp at vonck.nl>:
I'm,on the side, following the process of the construction of a compiler
for Golang for microcontrollers, Tinygo.
They use the LLVM compiler toolchain. My question is, is this the right
way to create a new language.
Being inspire by this talk of Robert Greisemer
where he shows the resemblance (heritage) of Go with Oberon, I wondered
if LLVM is the right way to do it.
Griesemer is educated at ETHZ, see for instance his research work.
So I think using the compiler construction principles of Oberon would be
a better a way.
Especially when you consider that LLVM is not a "one man system" but a
"conference" - system
https://llvm.org/devmtg/2019-04/ that keeps a lot of good minds occupied
What are your thoughts?
Oberon at lists.inf.ethz.ch mailing list for ETH Oberon and related systems
More information about the Oberon