Abstract

The present invention includes an interpreter in which a parser examines a message using grammar and lexical tables to produce a parse table. The parse table is compared to data needed in a semantics table to fire a rule. The firing of a rule causes a function table to be evaluated. The function table includes function calls which can perform user desired functions. Among the functions is a generate function which will take the contents of a table and turn it into a message and route the message to a destination where the destination can be a table, process or device. Plural interpreters can be created where each interpreter includes a workspace containing the above-mentioned tables. Each interpreter can perform a different task such as recognizing the meaning of a message in one language and performing some action such as sending out a message in a different language or updating a database. The present invention is particularly suitable for managing a machining workcell including machines from different vendors.

Other References

• Foster, D. M., "A Simple List-Processing Interpreter," The Computer Journal, vol. 6, Issue 2, Jul. 1965, pp. 120-129, L 7140 1358
• Bourne et al., "Autonomous Manufacturing: Automating the Job-Shop, IEEE, Sep., 1984, pp. 76-86
• Bourne et al., "Designing Programming Languages for Manufacturing Cells," Robotics Institute, Carnegie Mellon University, Apr., 1982, pp. 1-18
• Bourne, "Artificial Intelligence in Flexible Manufacturing", Robotics Institute, Carnegie Mellon University, pp. 66-76
• Fussell et al, "A Design of A Controller as a Component of a Robotic Manufacturing System," Robotics Inst., Carnegie Mellon Univ., Journal of Manufacturing Systems, vol. 3, No. 1, pp. 1-11
• Bourne, "A Numberless Tensed Language for Action Oriented Tasks", The Robotics Institute, Carnegie Mellon University, Oct., 1982, pp. 1-19
• Bourne et al, "Designing Programming Languages for Manufacturing Cells, The Robotics Institute, Carnegie-Mellon University, Apr. 1982, pp. 1-17