{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T21:10:01Z","timestamp":1751145001471,"version":"3.41.0"},"reference-count":15,"publisher":"Information Processing Society of Japan","issue":"0","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Information Processing"],"published-print":{"date-parts":[[2017]]},"DOI":"10.2197\/ipsjjip.25.975","type":"journal-article","created":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T22:11:48Z","timestamp":1513289508000},"page":"975-982","source":"Crossref","is-referenced-by-count":0,"title":["Parsing Expression Grammars with Unordered Choices"],"prefix":"10.2197","volume":"25","author":[{"given":"Nariyoshi","family":"Chida","sequence":"first","affiliation":[{"name":"Graduate School of Electronic and Computer Engineering, Yokohama National University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kimio","family":"Kuramitsu","sequence":"additional","affiliation":[{"name":"Graduate School of Electronic and Computer Engineering, Yokohama National University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1012","reference":[{"key":"1","unstructured":"[1] Aho, A.V. and Ullman, J.D.: <i>The Theory of Parsing, Translation, and Compiling<\/i>, Prentice-Hall, Inc., Upper Saddle River, NJ, USA (1972)."},{"key":"2","unstructured":"[2] Birman, A.: The Tmg Recognition Schema, PhD Thesis, Princeton, NJ, USA (1970)."},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] Birman, A. and Ullman, J.D.: Parsing algorithms with backtrack, <i>Information and Control<\/i>, Vol.23, No.1, pp.1-34 (online), DOI: http:\/\/dx.doi.org\/10.1016\/S0019-9958(73)90851-6 (1973).","DOI":"10.1016\/S0019-9958(73)90851-6"},{"key":"4","unstructured":"[4] Cohen, S.B. and Johnson, M.: The Effect of Non-tightness on Bayesian Estimation of PCFGs, <i>Proc. ACL<\/i> (2013)."},{"key":"5","unstructured":"[5] Colin, H. and Daniel, F.: Parsing Expression Grammar Template Library, available from &lt;https:\/\/code.google.com\/p\/pegtl&gt; (2014)."},{"key":"6","unstructured":"[6] David, M.: PEG.js, available from &lt;https:\/\/pegjs.org&gt;. parser generator for JavaScript."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] Ford, B.: Parsing Expression Grammars: A Recognition-based Syntactic Foundation, <i>Proc. 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages<\/i>, New York, NY, USA, ACM, pp.111-122 (online), DOI: 10.1145\/964001.964011 (2004).","DOI":"10.1145\/964001.964011"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Grimm, R.: Better Extensibility Through Modular Syntax, <i>Proc. 27th ACM SIGPLAN Conference on Programming Language Design and Implementation<\/i>, PLDI &apos;06, New York, NY, USA, ACM, pp.38-51 (online), DOI: 10.1145\/1133981.1133987 (2006).","DOI":"10.1145\/1133981.1133987"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Kuramitsu, K.: Nez: Practical Open Grammar Language, <i>Proc. 2016 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software<\/i>, Onward! 2016, New York, NY, USA, ACM, pp.29-42 (online), DOI: 10.1145\/2986012.2986019 (2016).","DOI":"10.1145\/2986012.2986019"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] Medeiros, S., Mascarenhas, F. and Ierusalimschy, R.: From regexes to parsing expression grammars, <i>Science of Computer Programming<\/i>, Vol.93, Part A, pp.3-18 (online), available from &lt;http:\/\/dx.doi.org\/10.1016\/j.scico.2012.11.006&gt; (2014).","DOI":"10.1016\/j.scico.2012.11.006"},{"key":"11","unstructured":"[11] Orlando, H.: Waxeye, available from &lt;http:\/\/waxeye.org\/&gt;."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] Redziejowski, R.R.: Some Aspects of Parsing Expression Grammar, <i>Fundam. Inform.<\/i>, Vol.85, No.1-4, pp.441-451 (2008) (online), available from &lt;http:\/\/content.iospress.com\/articles\/fundamenta-informaticae\/fi85-1-4-30&gt;.","DOI":"10.3233\/FUN-2008-851-430"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Schmidt, A., Waas, F., Kersten, M., Carey, M.J., Manolescu, I. and Busse, R.: XMark: A Benchmark for XML Data Management, <i>Proc. 28th International Conference on Very Large Data Bases<\/i>, VLDB &apos;02, VLDB Endowment, pp.974-985 (2002) (online), available from &lt;http:\/\/dl.acm.org\/citation.cfm?id=1287369.1287455&gt;.","DOI":"10.1016\/B978-155860869-6\/50096-2"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] Scott, E. and Johnstone, A.: GLL Parsing., <i>Electr. Notes Theor. Comput. Sci.<\/i>, Vol.253, No.7, pp.177-189 (2010) (online), available from &lt;http:\/\/dblp.uni-trier.de\/db\/journals\/entcs\/entcs253.html#ScottJ10&gt;.","DOI":"10.1016\/j.entcs.2010.08.041"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] Scott, E. and Johnstone, A.: GLL Parse-tree Generation, <i>Sci. Comput. Program.<\/i>, Vol.78, No.10, pp.1828-1844 (online), DOI: 10.1016\/j.scico.2012.03.005 (2013).","DOI":"10.1016\/j.scico.2012.03.005"}],"container-title":["Journal of Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/ipsjjip\/25\/0\/25_975\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T20:29:56Z","timestamp":1751142596000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/ipsjjip\/25\/0\/25_975\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":15,"journal-issue":{"issue":"0","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.2197\/ipsjjip.25.975","relation":{},"ISSN":["1882-6652"],"issn-type":[{"type":"electronic","value":"1882-6652"}],"subject":[],"published":{"date-parts":[[2017]]}}}