{"_id":"9iwtx6SgokFSJLr3Y","bibbaseid":"earley-sturgis-aformalismfortranslatorinteractions-1970","downloads":0,"creationDate":"2017-12-10T11:20:55.552Z","title":"A formalism for translator interactions","author_short":["Earley, J.","Sturgis, H."],"year":1970,"bibtype":"article","biburl":"http://ddi.uni-wuppertal.de/forschung/Komplett.bib","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Jay"],"propositions":[],"lastnames":["Earley"],"suffixes":[]},{"firstnames":["Howard"],"propositions":[],"lastnames":["Sturgis"],"suffixes":[]}],"title":"A formalism for translator interactions","journal":"Comm. ACM","pages":"607--617","year":"1970","month":"10","volume":"13","number":"10","url":"http://www.iro.umontreal.ca/~feeley/cours/ift6232/doc/a-formalism-for-translator-interactions.ps","urldate":"2009-01-14","annote":"erster Vorschlag fuer T-Diagramme Abstract: A formalism is presented for describing the actions of processors for programming annotes compilers, interpreters, assemblers and their interactions in complex systems such as compiler-compilers or extendible annotes. The formalism might be used to define and answer such a question as \"Can one do bootstrapping using a metacompiler whose metaphase is interpretive?\" In addition an algorithm is presented for deciding whether or not a given system can be produced from a given set of component processors.","issn":"0001-0782","publisher":"ACM Press","bibtex":"@article{EarleySturgis1970,\n author = {Jay Earley and Howard Sturgis},\n title = {A formalism for translator interactions},\n journal = {Comm. ACM},\n pages = {607--617},\n year = 1970,\n month = 10,\n volume = {13},\n number = {10},\n url={http://www.iro.umontreal.ca/~feeley/cours/ift6232/doc/a-formalism-for-translator-interactions.ps},\n urldate={2009-01-14},\n annote = {erster Vorschlag fuer T-Diagramme\n Abstract: A formalism is presented for describing the\n actions of processors for programming annotes compilers, interpreters, assemblers\n and their interactions in complex systems such\n as compiler-compilers or extendible annotes.\n The formalism might be used to define and\n answer such a question as\n \"Can one do bootstrapping using a metacompiler whose metaphase is interpretive?\"\n In addition an algorithm\n is presented for deciding whether or not a given\n system can be produced from a given set of component processors.},\n issn = {0001-0782},\n publisher = {ACM Press},\n}\n\n","author_short":["Earley, J.","Sturgis, H."],"key":"EarleySturgis1970","id":"EarleySturgis1970","bibbaseid":"earley-sturgis-aformalismfortranslatorinteractions-1970","role":"author","urls":{"Paper":"http://www.iro.umontreal.ca/~feeley/cours/ift6232/doc/a-formalism-for-translator-interactions.ps"},"downloads":0,"html":""},"search_terms":["formalism","translator","interactions","earley","sturgis"],"keywords":[],"authorIDs":[],"dataSources":["6BepyHGwnjChmJuia"]}