search for: ti59compil

...rk. I read quite 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 ins...

...d quite 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 s...

...ll 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 mos...

...k. I read quite 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 i...