{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:11Z","timestamp":1725493451150},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_21","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T01:44:48Z","timestamp":1193449488000},"page":"214-225","source":"Crossref","is-referenced-by-count":5,"title":["Analyzing Ambiguity of Context-Free Grammars"],"prefix":"10.1007","author":[{"given":"Claus","family":"Brabrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Giegerich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"M\u00f8ller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","volume":"8","author":"D.E. Knuth","year":"1965","unstructured":"Knuth, D.E.: On the translation of languages from left to right. Information and Control\u00a08, 607\u2013639 (1965)","journal-title":"Information and Control"},{"issue":"1","key":"21_CR3","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0022-0000(73)80050-9","volume":"7","author":"K. Culik II","year":"1973","unstructured":"Culik II, K., Cohen, R.S.: LR-regular grammars - an extension of LR(k) grammars. Journal of Computer and System Sciences\u00a07(1), 66\u201396 (1973)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR4","unstructured":"Scott, E., Johnstone, A., Hussein, S.S.: Tomita style generalised parsers. Technical Report CSD-TR-00-A, Royal Holloway, University of London (2000)"},{"key":"21_CR5","unstructured":"Visser, E.: Syntax Definition for Language Prototyping. PhD thesis, University of Amsterdam (1997)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Compiler Construction","author":"S. McPeak","year":"2004","unstructured":"McPeak, S., Necula, G.C.: Elkhound: A fast, practical GLR parser generator. In: Duesterwald, E. (ed.) CC 2004. LNCS, vol.\u00a02985, Springer, Heidelberg (2004)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45937-5_12","volume-title":"Compiler Construction","author":"M. Brand van den","year":"2002","unstructured":"van den Brand, M., Scheerder, J., Vinju, J.J., Visser, E.: Disambiguation filters for scannerless generalized LR parsers. In: Horspool, R.N. (ed.) CC 2002 and ETAPS 2002. LNCS, vol.\u00a02304, Springer, Heidelberg (2002)"},{"key":"21_CR8","volume-title":"LDTA 2003","author":"C. Brabrand","year":"2003","unstructured":"Brabrand, C., Schwartzbach, M.I., Vanggaard, M.: The metafront system: Extensible parsing and transformation. In: LDTA 2003. Proc. 3rd ACM SIGPLAN Workshop on Language Descriptions, Tools and Applications, ACM Press, New York (2003)"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/321160.321168","volume":"10","author":"S. Gorn","year":"1963","unstructured":"Gorn, S.: Detection of generative ambiguities in context-free mechanical languages. Journal of the ACM\u00a010(2), 196\u2013208 (1963)","journal-title":"Journal of the ACM"},{"key":"21_CR10","volume-title":"SAC 1995","author":"B.S.N. Cheung","year":"1995","unstructured":"Cheung, B.S.N., Uzgalis, R.C.: Ambiguity in context-free grammars. In: SAC 1995. Proc. ACM Symposium on Applied Computing, ACM Press, New York (1995)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Schmitz, S.: Conservative ambiguity detection in context-free grammars. In: ICALP 2007. Proc. 34th International Colloquium on Automata, Languages and Programming (2007)","DOI":"10.1007\/978-3-540-73420-8_60"},{"issue":"2","key":"21_CR12","first-page":"95","volume":"6","author":"W. Kuich","year":"1970","unstructured":"Kuich, W.: Systems of pushdown acceptors and context-free grammars. Elektronische Informationsverarbeitung und Kybernetik\u00a06(2), 95\u2013114 (1970)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"21_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological Sequence Analysis","author":"R. Durbin","year":"1998","unstructured":"Durbin, R., Eddy, S.R., Krogh, A., Mitchison, G.: Biological Sequence Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"3","key":"21_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.scico.2003.12.005","volume":"51","author":"R. Giegerich","year":"2004","unstructured":"Giegerich, R., Meyer, C., Steffen, P.: A discipline of dynamic programming over sequence data. Science of Computer Programming\u00a051(3), 215\u2013263 (2004)","journal-title":"Science of Computer Programming"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/3-540-45123-4_6","volume-title":"Combinatorial Pattern Matching","author":"R. Giegerich","year":"2000","unstructured":"Giegerich, R.: Explaining and controlling ambiguity in dynamic programming. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 46\u201359. Springer, Heidelberg (2000)"},{"key":"21_CR16","unstructured":"Dowell, R.D., Eddy, S.R.: Evaluation of several lightweight stochastic context-free grammars for RNA secondary structure prediction. BMC Bioinformatics\u00a05(71) (2004)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11601524_2","volume-title":"Database Programming Languages","author":"C. Brabrand","year":"2005","unstructured":"Brabrand, C., M\u00f8ller, A., Schwartzbach, M.I.: Dual syntax for XML languages. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol.\u00a03774, Springer, Heidelberg (2005)"},{"key":"21_CR18","volume-title":"Robustness in Language and Speech Technology","author":"M. Mohri","year":"2001","unstructured":"Mohri, M., Nederhof, M.J.: 9: Regular Approximation of Context-Free Grammars through Transformation. In: Robustness in Language and Speech Technology, Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Brabrand, C., Giegerich, R., M\u00f8ller, A.: Analyzing ambiguity of context-free grammars. Technical Report RS-07-10, BRICS (2007)","DOI":"10.7146\/brics.v14i10.21932"},{"key":"21_CR20","unstructured":"M\u00f8ller, A.: dk.brics.automaton \u2013 finite-state automata and regular expressions for Java (2007), http:\/\/www.brics.dk\/automaton\/"},{"key":"21_CR21","volume-title":"The Theory of Parsing, Translation and Compiling","author":"A.V. Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation and Compiling, vol.\u00a01: Parsing. Prentice-Hall, Englewood Cliffs (1972)"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Reeder, J., Steffen, P., Giegerich, R.: Effective ambiguity checking in biosequence analysis. BMC Bioinformatics\u00a06(153) (2005)","DOI":"10.1186\/1471-2105-6-153"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Voss, B., Giegerich, R., Rehmsmeier, M.: Complete probabilistic analysis of RNA shapes. BMC Biology\u00a04(5) (2006)","DOI":"10.1186\/1741-7007-4-5"},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/1173706.1173727","volume-title":"GPCE 2006","author":"J. Reeder","year":"2006","unstructured":"Reeder, J., Giegerich, R.: A graphical programming system for molecular motif search. In: GPCE 2006. Proc. 5th International Conference on Generative Programming and Component Engineering, pp. 131\u2013140. ACM Press, New York (2006)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:48:08Z","timestamp":1619506088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_21","relation":{},"subject":[]}}