Abstract
An attempt to devise a methodology of compiler design is described, and an outline is given for a possible course on this subject. The theoretical basis is formed by the concepts of phrase-structure language, finite-state- and stack-acceptor, and transducer. As their extension capable of processing context-dependent elements of languages, a so-called Table-Transducer is postulated, and it serves as the core-algorithm upon which compilers are based. The developed theory and method of compiler construction is applied to an example of a simple programming language.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
