{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T10:46:31Z","timestamp":1749033991170,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662466629"},{"type":"electronic","value":"9783662466636"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46663-6_1","type":"book-chapter","created":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T14:37:47Z","timestamp":1427899067000},"page":"3-27","source":"Crossref","is-referenced-by-count":2,"title":["A Graphical Model for Context-Free Grammar Parsing"],"prefix":"10.1007","author":[{"given":"Keshav","family":"Pingali","sequence":"first","affiliation":[]},{"given":"Gianfranco","family":"Bilardi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-06841-4_57","volume-title":"Automata, Languages and Programming","author":"J.C. Reynolds","year":"1974","unstructured":"Reynolds, J.C.: On the relation between direct and continuation semantics. In: Loeckx, I.J. (ed.) ICALP 1974. LNCS, vol.\u00a014, pp. 141\u2013156. Springer, Heidelberg (1974)"},{"key":"1_CR2","unstructured":"Sussman, G., Steele, G.: Scheme: An interpreter for extended lambda calculus. Technical Report AI Memo 349, AI Lab, M.I.T. (December 1975)"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/362007.362035","volume":"13","author":"J. Earley","year":"1970","unstructured":"Earley, J.: An efficient context-free parsing algorithm. Commun. ACM\u00a013(2), 94\u2013102 (1970)","journal-title":"Commun. ACM"},{"key":"1_CR4","unstructured":"Aho, A., Lam, M., Sethi, R., Ullman, J.: Compilers: principles, techniques, and tools. Addison Wesley (2007)"},{"key":"1_CR5","unstructured":"Grune, D., Jacobs, C.: Parsing Techniques: A practical guide. Springer (2010)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/S0304-3975(02)00034-8","volume":"290","author":"P. Cousot","year":"2003","unstructured":"Cousot, P., Cousot, R.: Parsing as abstract interpretation of grammar semantics. Theoret. Comput. Sci.\u00a0290, 531\u2013544 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Woods, W.A.: Transition network grammars for natural language analysis. Commun. ACM 13(10) (October 1970)","DOI":"10.1145\/355598.362773"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Parr, T., Fisher, K.: LL(*): The foundation of the ANTLR parser generator. In: PLDI (2011)","DOI":"10.1145\/1993498.1993548"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Graph-theoretic methods in database theory. In: Principles of Database Systems (1990)","DOI":"10.1145\/298514.298576"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Sippu, S., Soisalon-Soininen, E.: Parsing theory. Springer (1988)","DOI":"10.1007\/978-3-642-61345-6"},{"key":"1_CR11","unstructured":"Sharir, M., Pnueli, A.: Two approaches to interprocedural dataflow analysis. In: Program Flow Analysis: Theory and Applications, pp. 189\u2013234. Prentice-Hall (1981)"},{"key":"1_CR12","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C. (eds.): Introduction to Algorithms. MIT Press (2001)"},{"key":"1_CR13","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2006)","edition":"3"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/3-540-15670-4_22","volume-title":"Seminar on Concurrency","author":"W.D. Clinger","year":"1985","unstructured":"Clinger, W.D., Halpern, C.: Alternative semantics for mccarthy\u2019s amb. In: Brookes, S.D., Roscoe, A.W., Winskel, G. (eds.) Seminar on Concurrency. LNCS, vol.\u00a0197, pp. 467\u2013478. Springer, Heidelberg (1985)"},{"key":"1_CR15","unstructured":"Terese: Term Rewriting Systems. Combridge University Press (2003)"},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1145\/357103.357112","volume":"2","author":"S.L. Graham","year":"1980","unstructured":"Graham, S.L., Ruzzo, W.L., Harrison, M.: An improved context-free recognizer. ACM TOPLAS\u00a02(3), 415\u2013462 (1980)","journal-title":"ACM TOPLAS"},{"issue":"6","key":"1_CR17","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1093\/comjnl\/45.6.620","volume":"45","author":"J. Aycock","year":"2002","unstructured":"Aycock, J., Horspool, N.: Practical Earley parsing. The Computer Journal\u00a045(6), 620\u2013630 (2002)","journal-title":"The Computer Journal"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Perlin, M.: LR recursive transition networks for Earley and Tomita parsing. In: ACL 1991 (1991)","DOI":"10.3115\/981344.981357"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"137","DOI":"10.3115\/981311.981338","volume-title":"21st Annual Meeting of the Association for Computational Linguistics","author":"F.C.N. Pereira","year":"1983","unstructured":"Pereira, F.C.N., Warren, D.: Parsing as deduction. In: 21st Annual Meeting of the Association for Computational Linguistics, pp. 137\u2013144. MIT, Cambridge (1983)"},{"issue":"1 & 2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0743-1066(95)00035-I","volume":"24","author":"S.M. Shieber","year":"1995","unstructured":"Shieber, S.M., Schabes, Y., Pereira, F.C.N.: Principles and implementation of deductive parsing. Journal of Logic Programming\u00a024(1 & 2), 3\u201336 (1995)","journal-title":"Journal of Logic Programming"},{"key":"1_CR21","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60541-3","volume-title":"Parsing Schemata","author":"K. Sikkel","year":"1997","unstructured":"Sikkel, K.: Parsing Schemata. Texts in Theoretical Computer Science. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46663-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:25:51Z","timestamp":1559139951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46663-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662466629","9783662466636"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46663-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}