{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:40Z","timestamp":1759638160677},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2007,4,27]],"date-time":"2007-04-27T00:00:00Z","timestamp":1177632000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2007,6,26]]},"DOI":"10.1007\/s00236-007-0045-0","type":"journal-article","created":{"date-parts":[[2007,4,26]],"date-time":"2007-04-26T12:10:37Z","timestamp":1177589437000},"page":"167-189","source":"Crossref","is-referenced-by-count":19,"title":["Recursive descent parsing for Boolean grammars"],"prefix":"10.1007","volume":"44","author":[{"given":"Alexander","family":"Okhotin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,27]]},"reference":[{"key":"45_CR1","volume-title":"Compilers: principles, techniques and tools","author":"A.V. Aho","year":"1986","unstructured":"Aho A.V., Sethi R. and Ullman J.D. (1986). Compilers: principles, techniques and tools. Addison-Wesley, Reading"},{"key":"45_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(73)90851-6","volume":"23","author":"A. Birman","year":"1973","unstructured":"Birman A. and Ullman J.D. (1973). Parsing algorithms with backtrack. Inf. Control 23: 1\u2013134","journal-title":"Inf. Control"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Ford, B.: Parsing expression grammars: a recognition-based syntactic foundation. Proceedings of POPL 2004 (Venice, Italy, January 14\u201316, 111\u2013122 2004)","DOI":"10.1145\/964001.964011"},{"key":"45_CR4","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/321127.321132","volume":"9","author":"S. Ginsburg","year":"1962","unstructured":"Ginsburg S. and Rice H.G. (1962). Two families of languages related to ALGOL. J. ACM 9: 350\u2013371","journal-title":"J. ACM"},{"key":"45_CR5","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"S.A. Greibach","year":"1965","unstructured":"Greibach S.A. (1965). A new normal-form theorem for context-free phrase structure grammars. J. ACM 12: 42\u201352","journal-title":"J. ACM"},{"issue":"1","key":"45_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/spe.4380180105","volume":"18","author":"D. Grune","year":"1988","unstructured":"Grune D. and Jacobs C.J.H. (1988). A programmer-friendly LL(1) parser generator. Softw. Pract. Exp. 18(1): 29\u201338","journal-title":"Softw. Pract. Exp."},{"key":"45_CR7","volume-title":"Rationale for the design of the Ada programming language","author":"J. Ichbiah","year":"1991","unstructured":"Ichbiah J., Barnes J.G.P., Firth R.J. and Woodger M. (1991). Rationale for the design of the Ada programming language. Cambridge University Press, Cambridge"},{"key":"45_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF00289517","volume":"1","author":"D.E. Knuth","year":"1971","unstructured":"Knuth D.E. (1971). Top-down syntax analysis. Acta Informatica 1: 79\u2013110","journal-title":"Acta Informatica"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Kountouriotis, V., Nomikos, Ch., Rondogiannis, P.: Well-founded semantics for Boolean grammars. Developments in Language Theory (DLT 2006, Santa Barbara, USA, June 26\u201329, 2006), LNCS 4036, 203\u2013214","DOI":"10.1007\/11779148_19"},{"key":"45_CR10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01946814","volume":"9","author":"R. Kurki-Suonio","year":"1969","unstructured":"Kurki-Suonio R. (1969). Notes on top-down languages. BIT 9: 225\u2013238","journal-title":"BIT"},{"issue":"3","key":"45_CR11","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1145\/321466.321477","volume":"15","author":"P.M. Lewis","year":"1968","unstructured":"Lewis P.M. and Stearns R.E. (1968). Syntax-directed transduction. J. ACM 15(3): 465\u2013488","journal-title":"J. ACM"},{"issue":"2","key":"45_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.entcs.2006.10.007","volume":"164","author":"A. Megacz","year":"2006","unstructured":"Megacz A. (2006). Scannerless Boolean parsing. Electron. Notes Theor. Comput. Sci. 164(2): 97\u2013102","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"45_CR13","first-page":"91","volume":"17","author":"P. Norvig","year":"1991","unstructured":"Norvig P. (1991). Techniques for automatic memoization with applications to context-free parsing. Comput. Linguistics 17(1): 91\u201398","journal-title":"Comput. Linguistics"},{"issue":"4","key":"45_CR14","first-page":"519","volume":"6","author":"A. Okhotin","year":"2001","unstructured":"Okhotin A. (2001). Conjunctive grammars. J. Automata Lang. Combinatorics 6(4): 519\u2013535","journal-title":"J. Automata Lang. Combinatorics"},{"issue":"1","key":"45_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1014219530875","volume":"5","author":"A. Okhotin","year":"2002","unstructured":"Okhotin A. (2002). Top-down parsing of conjunctive languages. Grammars 5(1): 21\u201340","journal-title":"Grammars"},{"issue":"1","key":"45_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ic.2004.03.006","volume":"194","author":"A. Okhotin","year":"2004","unstructured":"Okhotin A. (2004). Boolean grammars. Inf. Comput. 194(1): 19\u201348","journal-title":"Inf. Comput."},{"issue":"2\u20133","key":"45_CR17","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.tcs.2005.07.019","volume":"345","author":"A. Okhotin","year":"2005","unstructured":"Okhotin A. (2005). The dual of concatenation. Theor. Comput. Sci. 345(2\u20133): 425\u2013447","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"45_CR18","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1142\/S0129054106004029","volume":"17","author":"A. Okhotin","year":"2006","unstructured":"Okhotin A. (2006). Generalized LR parsing algorithm for Boolean grammars. Int. J. Found. Comput. Sci. 17(3): 629\u2013664","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"7","key":"45_CR19","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1002\/spe.4380250705","volume":"25","author":"T.J. Parr","year":"1995","unstructured":"Parr T.J. and Quong R.W. (1995). ANTLR: a predicated-LL(k) parser generator. Softw. Pract. Exp. 25(7): 789\u2013810","journal-title":"Softw. Pract. Exp."},{"key":"45_CR20","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/S0019-9958(70)90446-8","volume":"17","author":"D.J. Rozenkrantz","year":"1970","unstructured":"Rozenkrantz D.J. and Stearns R.E. (1970). Properties of deterministic top-down grammars. Inf. Control 17: 226\u2013256","journal-title":"Inf. Control"},{"issue":"4, 349\u2013356","key":"45_CR21","first-page":"12","volume":"12","author":"D. Wood","year":"1969","unstructured":"Wood D. (1969). The theory of left factored languages. (I, II). Comput. J. 12(4, 349\u2013356): 12\u20134, 349356","journal-title":"Comput. J."},{"issue":"1","key":"45_CR22","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1093\/comjnl\/13.1.55","volume":"13","author":"D. Wood","year":"1970","unstructured":"Wood D. (1970). The theory of left factored languages. (I, II). Comput. J. 13(1): 55\u201362","journal-title":"Comput. J."},{"key":"45_CR23","doi-asserted-by":"crossref","unstructured":"Wrona, M.: Stratified Boolean grammars mathematical foundations of computer science. In: Proceedings of MFCS 2005, Gdansk, Poland, August 29\u2013September 2, 2005. LNCS, vol. 3618, pp. 801\u2013812 (2005)","DOI":"10.1007\/11549345_69"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-007-0045-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-007-0045-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-007-0045-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:54Z","timestamp":1558705314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-007-0045-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,27]]},"references-count":23,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2007,6,26]]}},"alternative-id":["45"],"URL":"https:\/\/doi.org\/10.1007\/s00236-007-0045-0","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4,27]]}}}