{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,22]],"date-time":"2024-12-22T17:40:07Z","timestamp":1734889207809,"version":"3.32.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1979,12]]},"DOI":"10.1007\/bf00995501","type":"journal-article","created":{"date-parts":[[2005,1,18]],"date-time":"2005-01-18T17:56:40Z","timestamp":1106071000000},"page":"523-539","source":"Crossref","is-referenced-by-count":2,"title":["Semantic equivalence of covering attribute grammars"],"prefix":"10.1007","volume":"8","author":[{"given":"Gregor V.","family":"Bochmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/356669.356672","volume":"8","author":"M. Marcotty","year":"1976","unstructured":"M. Marcotty, H. F. Ledgard, and G. V. Bochmann, ?A sampler of formal definitions,?ACM Comput. Surv. 8(2):191?276 (June 1976).","journal-title":"ACM Comput. Surv."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","volume":"2","author":"D. E. Knuth","year":"1968","unstructured":"D. E. Knuth, ?Semantics of context-free languages,?Math. Syst. Theory 2:127?145 (1968);5:95 (1971).","journal-title":"Math. Syst. Theory"},{"key":"CR3","first-page":"95","volume-title":"Algol 68 Implementation","author":"C. H. A. Koster","year":"1971","unstructured":"C. H. A. Koster, ?Affix Grammars,? in J. E. L. Peck, ed.,Algol 68 Implementation (North Holland, Amsterdam, 1971), pp. 95?109."},{"issue":"2","key":"CR4","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1145\/359997.359999","volume":"19","author":"G. V. Bochmann","year":"1976","unstructured":"G. V. Bochmann, ?Semantic evaluation from left to right,?Commun. ACM 19(2): 55?62 (February 1976).","journal-title":"Commun. ACM"},{"key":"CR5","unstructured":"J. C. Reynolds and R. Haskeil, ?Grammatical Coverings,? unpublished manuscript, 1970. See also A. V. Aho and J. P. Ullman,The Theory of Parsing, Translation and Compiling, Vol. I, Sec. 3.4.5 (Prentice Hall, Englewood Cliffs, New Jersey, 1972)."},{"key":"CR6","unstructured":"G. Godbout, ?D\u00e9finition d'un langage interm\u00e9diaire pour un systeme d'\u00e9criture de compilateurs,? Master's thesis, D\u00e9partement d'Informatique et de Recherche Op\u00e9rationnelle, Univrsit\u00e9 de Montr\u00e9al (1976)."},{"key":"CR7","volume-title":"Correstness Proofs of Text-Processing Descriptions by Attributes","author":"C. Pair","year":"1976","unstructured":"C. Pair, M. Amirchahy, and D. Neel,Correstness Proofs of Text-Processing Descriptions by Attributes (IRIA-Laboria, France, 1976)."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"P. M. Lewis, D. J. Rosenkrantz, and R. E. Stearns, ?Attributed Translations,?Proceedings of the ACM Symposium on Theory of Computing, Austin (May 1973), pp. 160?171.","DOI":"10.1145\/800125.804047"},{"key":"CR9","unstructured":"G. V. Bochmann, ?Semantic Equivalence of Covering Attribute Grammars,? Publication #218, D\u00e9partement d'I.R.O., Universit\u00e9 de Montr\u00e9al (1975)."},{"key":"CR10","first-page":"139","volume-title":"Formal Semantics of Programming Languages","author":"C. L. McGowan","year":"1972","unstructured":"C. L. McGowan, ?An Inductive Proof Technique for Interpreter Equivalence,? in R. Austin, ed.,Formal Semantics of Programming Languages (Prentice Hall, Englewood Cliffs, New Jersey, 1972), pp. 139?147."},{"key":"CR11","unstructured":"C. A. R. Hoare, ?Hints on Programming Language Design,? invited address at SIGACT\/SIGPLAN Symposium on Principles of Programming Languages, Boston (October 973), and Stanford CS Report."}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00995501.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00995501\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00995501","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,22]],"date-time":"2024-12-22T17:09:00Z","timestamp":1734887340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00995501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["BF00995501"],"URL":"https:\/\/doi.org\/10.1007\/bf00995501","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"type":"print","value":"0091-7036"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}