Patent · US Expired

Interpreter for stack-based languages

US6205578A · kind A · utility

23Cited by
15References
21Claims
0Family size

Assignee

Inventor

Key dates

Filing dateAug 14, 1998
Grant dateMar 20, 2001
Priority date
Expiry dateAug 14, 2018

Classification

  • Technology area (CPC G)Physics
  • CPC primaryG06F9/45508
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

The present invention provides an improved interpreter for stack-based languages. In one embodiment, a method includes executing a first interpreter for a first state, and executing a second interpreter for a second state. In particular, the first state indicates that no elements of a stack are stored in registers of a microprocessor, and a second state indicates that an element of the stack is stored in a register of the microprocessor.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.