On 22 Mar 2011, at 19:00, Stéphane Ducasse wrote:
Can you explain rapidly register-case byte code?
And for those who still wonder why that might be useful, an article titled: 'Virtual Machine Showdown: Stack Versus Registers' @article{1328197, address = {New York, NY, USA}, author = {Yunhe Shi and Kevin Casey and M. Anton Ertl and David Gregg}, interhash = {5fbfc20a2129ec1897d295cace8e3595}, intrahash = {e329d8905cc5c93be9782963125d9644}, journal = {ACM Trans. Archit. Code Optim.}, number = 4, pages = {1--36}, publisher = {ACM}, title = {Virtual Machine Showdown: Stack Versus Registers}, url = {http://portal.acm.org/citation.cfm?id=1328195.1328197}, volume = 4, year = 2008, added-at = {2008-09-03T21:02:27.000+0200}, issn = {1544-3566}, description = {Virtual machine showdown}, biburl = {http://www.bibsonomy.org/bibtex/2e329d8905cc5c93be9782963125d9644/gron}, doi = {http://doi.acm.org/10.1145/1328195.1328197} } -- Stefan Marr Software Languages Lab Vrije Universiteit Brussel Pleinlaan 2 / B-1050 Brussels / Belgium http://soft.vub.ac.be/~smarr Phone: +32 2 629 2974 Fax: +32 2 629 3525