Alexander parser:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Tokyo, Japan
1990
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
548 |
| Schlagwörter: | |
| Abstract: | Abstract: "This paper presents a hybrid (i.e., bi-directional) parser using the bottom-up interpreter of logic programs, called Alexander Parser. The algorithm once translates a given context free grammar into a logic program, and then interpretes [sic] it in the bottom-up manner. Not only reflects the translation the behavior of top-down parsing but also the bottom-up interpretation avoids the infinite loops due to left-recursive rules. This algorithm is an adaptation of Seki's query evaluation method in deductive databases, called 'Alexander Templates,' to parsing algorithms as well as refinement of Fuchi's description of Earley's parsing algorithm within the framework of logic programming." |
| Umfang: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010949160 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 960913s1990 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)24838848 | ||
| 035 | |a (DE-599)BVBBV010949160 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Kanamori, Tadashi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Alexander parser |c by T. Kanamori |
| 264 | 1 | |a Tokyo, Japan |c 1990 | |
| 300 | |a 15 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 548 | |
| 520 | 3 | |a Abstract: "This paper presents a hybrid (i.e., bi-directional) parser using the bottom-up interpreter of logic programs, called Alexander Parser. The algorithm once translates a given context free grammar into a logic program, and then interpretes [sic] it in the bottom-up manner. Not only reflects the translation the behavior of top-down parsing but also the bottom-up interpretation avoids the infinite loops due to left-recursive rules. This algorithm is an adaptation of Seki's query evaluation method in deductive databases, called 'Alexander Templates,' to parsing algorithms as well as refinement of Fuchi's description of Earley's parsing algorithm within the framework of logic programming." | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Parsing (Computer grammar) | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 548 |w (DE-604)BV010923438 |9 548 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007323096 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6123-548 |
|---|---|
| DE-BY-TUM_katkey | 765376 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010305438 |
| _version_ | 1821938071318298625 |
| any_adam_object | |
| author | Kanamori, Tadashi |
| author_facet | Kanamori, Tadashi |
| author_role | aut |
| author_sort | Kanamori, Tadashi |
| author_variant | t k tk |
| building | Verbundindex |
| bvnumber | BV010949160 |
| ctrlnum | (OCoLC)24838848 (DE-599)BVBBV010949160 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01634nam a2200301 cb4500</leader><controlfield tag="001">BV010949160</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960913s1990 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24838848</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010949160</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kanamori, Tadashi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Alexander parser</subfield><subfield code="c">by T. Kanamori</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">548</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents a hybrid (i.e., bi-directional) parser using the bottom-up interpreter of logic programs, called Alexander Parser. The algorithm once translates a given context free grammar into a logic program, and then interpretes [sic] it in the bottom-up manner. Not only reflects the translation the behavior of top-down parsing but also the bottom-up interpretation avoids the infinite loops due to left-recursive rules. This algorithm is an adaptation of Seki's query evaluation method in deductive databases, called 'Alexander Templates,' to parsing algorithms as well as refinement of Fuchi's description of Earley's parsing algorithm within the framework of logic programming."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parsing (Computer grammar)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">548</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">548</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007323096</subfield></datafield></record></collection> |
| id | DE-604.BV010949160 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T10:03:39Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007323096 |
| oclc_num | 24838848 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 15 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spellingShingle | Kanamori, Tadashi Alexander parser Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Logic programming Parsing (Computer grammar) |
| title | Alexander parser |
| title_auth | Alexander parser |
| title_exact_search | Alexander parser |
| title_full | Alexander parser by T. Kanamori |
| title_fullStr | Alexander parser by T. Kanamori |
| title_full_unstemmed | Alexander parser by T. Kanamori |
| title_short | Alexander parser |
| title_sort | alexander parser |
| topic | Logic programming Parsing (Computer grammar) |
| topic_facet | Logic programming Parsing (Computer grammar) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT kanamoritadashi alexanderparser |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6123-548 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |