{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T21:31:04Z","timestamp":1672349464905},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1987,10,1]],"date-time":"1987-10-01T00:00:00Z","timestamp":560044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1987,10]]},"DOI":"10.1016\/0020-0255(87)90031-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"55-83","source":"Crossref","is-referenced-by-count":5,"title":["Parallel parsing of programming languages"],"prefix":"10.1016","volume":"43","author":[{"given":"Y.N.","family":"Srikant","sequence":"first","affiliation":[]},{"given":"Priti","family":"Shankar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(87)90031-4_BIB1","volume":"Vol. 1","author":"Aho","year":"1973"},{"key":"10.1016\/0020-0255(87)90031-4_BIB2","series-title":"Principles of Compiler Designer","author":"Aho","year":"1977"},{"issue":"1","key":"10.1016\/0020-0255(87)90031-4_BIB3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/357121.357123","article-title":"A multiprocessing approach to compile-time symbol resolution","volume":"3","author":"Andre","year":"1981","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"2","key":"10.1016\/0020-0255(87)90031-4_BIB4","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/3318.3478","article-title":"Optimal parallel generation of a computation tree form","volume":"7","author":"Bar-On","year":"1985","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0020-0255(87)90031-4_BIB5","series-title":"CONPAR 81","first-page":"480","article-title":"Binary trees and parallel scheduling algorithms","volume":"Vol. 111","author":"Dekel","year":"1981"},{"issue":"3","key":"10.1016\/0020-0255(87)90031-4_BIB6","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/2166.357211","article-title":"Parallel generation of postfix and tree forms","volume":"5","author":"Dekel","year":"1983","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0020-0255(87)90031-4_BIB7","article-title":"On Parsing Context-Free Languages in Parallel Environments","author":"Fischer","year":"1975"},{"key":"10.1016\/0020-0255(87)90031-4_BIB8","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0020-0255(87)90031-4_BIB9","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"issue":"7","key":"10.1016\/0020-0255(87)90031-4_BIB10","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TC.1978.1675167","article-title":"New parallel-sorting schemes","volume":"C-27","author":"Preparata","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0255(87)90031-4_BIB11","series-title":"Proceedings of the 23rd symposium on Foundations of Computer Science","first-page":"290","article-title":"Parallel time O(log n) acceptance of deterministic CFL's","author":"Reif","year":"1982"},{"key":"10.1016\/0020-0255(87)90031-4_BIB12","first-page":"318","article-title":"On the recognition of context-free languages","author":"Rytter","year":"1985"},{"key":"10.1016\/0020-0255(87)90031-4_BIB13","article-title":"Methods for Constructing Parallel Compilers for Use in a Multiprocessor Environment","author":"Schell","year":"1979"},{"key":"10.1016\/0020-0255(87)90031-4_BIB14","article-title":"Parallel Algorithms for Compilation","author":"Srikant","year":"1986"},{"key":"10.1016\/0020-0255(87)90031-4_BIB15","doi-asserted-by":"crossref","unstructured":"Y. N. Srikant and P. Shankar, A new parallel algorithm for parsing arithmetic infix expressions, Parallel Comput., to appear.","DOI":"10.1016\/0167-8191(87)90028-7"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025587900314?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025587900314?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:20:06Z","timestamp":1552915206000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025587900314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,10]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1987,10]]}},"alternative-id":["0020025587900314"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(87)90031-4","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1987,10]]}}}