{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:26Z","timestamp":1725663386008},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540508205"},{"type":"electronic","value":"9783540460923"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50820-1_46","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:33:16Z","timestamp":1330201996000},"page":"146-160","source":"Crossref","is-referenced-by-count":1,"title":["A bottom-up adaptation of earley's parsing algorithm"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Voisin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"10_CR1","unstructured":"A. Aho & J. Ullman: The theory of Parsing, Translation and Compiling, Vol. 1: Parsing, Prentice-Hall, Englewoods Cliffs, N.J."},{"issue":"4","key":"10_CR2","first-page":"259","volume":"6","author":"M. Bidoit","year":"1987","unstructured":"M. Bidoit, F. Capy, C. Choppy, N. Choquet, C. Gresse, S. Kaplan, F. Schlienger & F. Voisin: ASSPRO: an Interactive and Integrated Programming Environment, Technology and Science of Informatics (John Wiley and Sons), Vol. 6, N. 4, 1987, pp. 259\u2013278.","journal-title":"Technology and Science of Informatics (John Wiley and Sons)"},{"key":"10_CR3","unstructured":"M. Bidoit, M.C. Gaudel & A. Mauboussin: How to make algebraic specifications more understandable? An experiment with the PLUSS specification Language, L.R.I. Research Report 343, April 1987."},{"key":"10_CR4","unstructured":"P. Boullier: Contribution \u00e0 la construction automatique d'analyseurs lexicographiques et syntaxiques, Th\u00e8se d'Etat, Universit\u00e9 d'Orl\u00e9ans, Jan. 1984."},{"key":"10_CR5","unstructured":"F. Capy: ASSPEGIQUE: un environment d'exceptions. Une s\u00e9mantique op\u00e9rationnelle des E,R-alg\u00e8bres, formalisme prenant en compte les exceptions., Th\u00e8se de 3\u00e8me cycle, Universit\u00e9 de Paris-Sud, Orsay, D\u00e9c. 87."},{"issue":"2","key":"10_CR6","first-page":"94","volume":"13","author":"J. Earley","year":"1970","unstructured":"J. Earley: An Efficient Context-Free Parsing Algorithm, C.A.C.M., Vol. 13, N. 2, Feb. 1970, pp. 94\u2013102.","journal-title":"C.A.C.M."},{"key":"10_CR7","unstructured":"M.C. Gaudel: Towards Structured Algebraic Specifications, ESPRIT Technical Week, Bruxelles 1985, ESPRIT'85 Status Report, North-Holland, pp. 493\u2013510."},{"issue":"3","key":"10_CR8","first-page":"415","volume":"2","author":"S. Graham","year":"1980","unstructured":"S. Graham, M. Harrison & W. Ruzzo: An Improved Context-Free Recognizer, A.C.M.-T.O.P.L.A.S., Vol. 2, N. 3, Jul. 1980, pp. 415\u2013462.","journal-title":"A.C.M.-T.O.P.L.A.S."},{"issue":"2","key":"10_CR9","first-page":"118","volume":"29","author":"S. L. Peyton-Jones","year":"1986","unstructured":"S.L. Peyton-Jones: Parsing Distfix Operators, Computing Practices, Vol. 29. N. 2, 1986, pp. 118\u2013122.","journal-title":"Computing Practices"},{"key":"10_CR10","unstructured":"M. Tomita: An Efficient Context-Free Parsing Algorithm for Natural Languages, Proc. 9\n                  th\n                 I.J.C.A.I., Los Angeles, Aug. 1985, pp. 756\u2013764."},{"issue":"1","key":"10_CR11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6423(86)90006-7","volume":"7","author":"F. Voisin","year":"1986","unstructured":"F. Voisin: CIGALE: a Tool for Interactive Grammar Construction and Expression Parsing, Science of Computer Programming, Vol. 7, N. 1, 1986, pp. 61\u201386.","journal-title":"Science of Computer Programming"},{"key":"10_CR12","unstructured":"F. Voisin: Une version ascendante de l'algorithme d'Earley, L.R.I. Research Report, to appear, 1988."}],"container-title":["Lecture Notes in Computer Science","Programming Languages Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50820-1_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:57:17Z","timestamp":1619571437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50820-1_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540508205","9783540460923"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-50820-1_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}