search for: wixsit

...ite many tutorials but I am still not able to determine whether llvm can be used for my project: implementing a backend for the famous Texas Instruments 59 Calculator (sold from 1977 to 1982). This is not a CPU but it uses a kind of bytecode that is interpreted (see examples in http://ti59compiler.wixsite.com/ti59/t-compiler). It has no stack, no frame, only floating point registers. The memory is split between program (up to 960 steps) and registers (up to 100). A register consumes 8 program steps, reducing the program size accordingly. The most tricky part is the following: a simple instruction...

...5(4-6) , 5(2-6) Specie3, 10(5-15) ,NA, 2(1-3) Specie1, 3(1-4), 8(6-9) , NA Muchas gracias. Joan -- *Joan Giménez, PhD* *Postdoctoral Researcher* Institut de Ciències del Mar (ICM-CSIC) Passeig Maritim 37-49 E-08003 Barcelona (Spain). www.icm.csic.es --- Personal website: http://gimenezverdugo.wixsite.com/joangimenez Research Gate: Joan Giménez <https://www.researchgate.net/profile/Joan_Gimenez2> Phone: +34 619 176 849 ü Please consider the environment before printing this E-mail [[alternative HTML version deleted]]

...tutorials but I am still not able to determine whether llvm can be used for my project: implementing a backend for the famous Texas Instruments 59 Calculator (sold from 1977 to 1982). > > This is not a CPU but it uses a kind of bytecode that is interpreted (see examples in http://ti59compiler.wixsite.com/ti59/t-compiler). It has no stack, no frame, only floating point registers. The memory is split between program (up to 960 steps) and registers (up to 100). A register consumes 8 program steps, reducing the program size accordingly. > > The most tricky part is the following: a simple ins...

...o determine whether llvm can be used for my project: >> implementing a backend for the famous Texas Instruments 59 Calculator (sold >> from 1977 to 1982). >> >> This is not a CPU but it uses a kind of bytecode that is interpreted (see >> examples in http://ti59compiler.wixsite.com/ti59/t-compiler). It has no >> stack, no frame, only floating point registers. The memory is split between >> program (up to 960 steps) and registers (up to 100). A register consumes 8 >> program steps, reducing the program size accordingly. >> >> The most tricky...

...te many tutorials but I am still not able to determine whether llvm can be used for my project: implementing a backend for the famous Texas Instruments 59 Calculator (sold from 1977 to 1982). This is not a CPU but it uses a kind of bytecode that is interpreted (see examples in http://ti59compiler.wixsite.com/ti59/t-compiler ). It has no stack, no frame, only floating point registers. The memory is split between program (up to 960 steps) and registers (up to 100). A register consumes 8 program steps, reducing the program size accordingly. The most tricky part is the following: a simple instructio...