{"updated":"2025-01-19T20:42:42.961325+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00195816","sets":["934:935:9619:9764"]},"path":["9764"],"owner":"44499","recid":"195816","title":["一般化された解析表現文法とPackrat構文解析手法の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-05-21"},"_buckets":{"deposit":"1204ad66-b788-47df-beed-930e030a3a05"},"_deposit":{"id":"195816","pid":{"type":"depid","value":"195816","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"一般化された解析表現文法とPackrat構文解析手法の提案","author_link":["467650","467648","467651","467649"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"一般化された解析表現文法とPackrat構文解析手法の提案"},{"subitem_title":"GPEG: A Generalized Foundation for Packrat Parsing","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[通常論文] 解析表現文法，Packrat構文解析法，一般化構文解析法","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2019-05-21","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"横浜国立大学大学院"},{"subitem_text_value":"日本女子大学理学部数物科学科"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Yokohama National University","subitem_text_language":"en"},{"subitem_text_value":"Department of Mathematical and Physical Sciences, Japan Women's University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":44499,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/195816/files/IPSJ-TPRO1202002.pdf","label":"IPSJ-TPRO1202002.pdf"},"date":[{"dateType":"Available","dateValue":"2021-05-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TPRO1202002.pdf","filesize":[{"value":"797.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"15"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"1e377031-a4a1-4f78-a2ae-9c109b73c754","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2019 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"多田, 拓"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"倉光, 君郎"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Taku, Tada","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kimio, Kuramitsu","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464814","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7802","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"曖昧さのある形式文法から生成されたパーサは異なる解釈をした複数の結果が導出されうる．このような複数の可能性を試すパーサは非線形の計算時間を必要とし，プログラミング言語などの人工言語の構文解析において望ましくない．Parsing Expression Grammar（PEG）の強みは優先度付き選択と貪欲な繰り返しによって曖昧さがないように形式化されている点である．しかしながら，近年の文法推論や自然言語を含んだ解析への応用では曖昧さが重要となっている．本研究では，PEGに文法的な拡張を加えることで，曖昧さを追加した新しい形式化基盤Generalized PEG（GPEG）を提案する．GPEGは決定的なPEGの文法に対して，優先度なし選択を加えた拡張となっている．一般化構文解析手法であるGLRやGLLで構築される曖昧な木とは異なり，曖昧さを文法から制御可能であるため部分的に曖昧な木を構築する．さらに，本研究で提案しているgeneralized packrat parsingによって実用的な時間で構文解析が可能である．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Ambiguity in a formal grammar is undesirable in a parser generation of programming languages. The strength of Parsing Expression Grammars (PEGs) is ordered choice and greedy repetition which can eliminate ambiguity from grammars. Nevertheless, the elimination of ambiguity faces several new difficulties in grammar debugging and grammar inference. We propose a formal foundation of Generalized PEGs (GPEG) by introducing unordered choices. The ambiguity is still controlled, and GPEG allows partial ambiguous tree construction, unlike tree forests in a generalized parsing such as GLR and GLL parsing. The practical parsing can be built on a generalized packrat parsing.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"9","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌プログラミング（PRO）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2019-05-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"12"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:00:42.241356+00:00","id":195816,"links":{}}