Abstract

The paper presents a technique for generating translators for problem-oriented and other command- or data-oriented languages which can be interpretively executed. The system consists of: (a) a stored grammar or table, representing in a modified graph form the syntactically valid statements and the corresponding semantic actions; (b) a set of application procedures, written in a procedural language; (c) a universal translator, which performs reading, input conversion, matching input items against the grammar, and calling the procedures specified by the grammar. The generator consists of the translator and a specific grammar and set of procedures, which together convert the problem-oriented description of the source grammar into the table used by the translator for execution.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.