Implementation and evaluation of yet another generalized LR parsing algorithm:
Abstract: "This paper presents an implementation and evaluation of our new generalized LR parsing algorithm called Yet Another Generalized LR parsing algorithm (YAGLR). In its original version, YAGLR uses graph- structured stack (GSS) whereas in the preliminary implementation we use tree-struct...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1992
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
783 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper presents an implementation and evaluation of our new generalized LR parsing algorithm called Yet Another Generalized LR parsing algorithm (YAGLR). In its original version, YAGLR uses graph- structured stack (GSS) whereas in the preliminary implementation we use tree-structured stack (trss). The merge operation of stack in our algorithm is deeper than top nodes and is effective. Hence the parsing time and the reduction in memory space are remarkable. Due to effective merge operations, even when using trss, we retain packed nature of GSS and thus not causing heavy loss of memory space. Through reduce actions, YAGLR creates items called drit which are symmetrically different from Earley's item. The advantages in creating drit are realized. Through our implementation, we practically prove that for a context-free grammar with reasonable size and complexity, YAGLR's parsing time is in the order of n³, where n is the length of an imput sentence. We conclude that YAGLR has the advantages of both Earley's and Tomita's algorithm." |
| Beschreibung: | 10 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010956303 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960918s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)34387004 | ||
| 035 | |a (DE-599)BVBBV010956303 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Suresh, K. G. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Implementation and evaluation of yet another generalized LR parsing algorithm |c by K. G. Suresh & H. Tanaka |
| 264 | 1 | |a Tokyo, Japan |c 1992 | |
| 300 | |a 10 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 783 | |
| 520 | 3 | |a Abstract: "This paper presents an implementation and evaluation of our new generalized LR parsing algorithm called Yet Another Generalized LR parsing algorithm (YAGLR). In its original version, YAGLR uses graph- structured stack (GSS) whereas in the preliminary implementation we use tree-structured stack (trss). The merge operation of stack in our algorithm is deeper than top nodes and is effective. Hence the parsing time and the reduction in memory space are remarkable. Due to effective merge operations, even when using trss, we retain packed nature of GSS and thus not causing heavy loss of memory space. Through reduce actions, YAGLR creates items called drit which are symmetrically different from Earley's item. The advantages in creating drit are realized. Through our implementation, we practically prove that for a context-free grammar with reasonable size and complexity, YAGLR's parsing time is in the order of n³, where n is the length of an imput sentence. We conclude that YAGLR has the advantages of both Earley's and Tomita's algorithm." | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Parsing (Computer grammar) | |
| 700 | 1 | |a Tanaka, Hozumi |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 783 |w (DE-604)BV010923438 |9 783 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007328457 | ||
Datensatz im Suchindex
| _version_ | 1804125443501064192 |
|---|---|
| any_adam_object | |
| author | Suresh, K. G. Tanaka, Hozumi |
| author_facet | Suresh, K. G. Tanaka, Hozumi |
| author_role | aut aut |
| author_sort | Suresh, K. G. |
| author_variant | k g s kg kgs h t ht |
| building | Verbundindex |
| bvnumber | BV010956303 |
| ctrlnum | (OCoLC)34387004 (DE-599)BVBBV010956303 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02100nam a2200313 cb4500</leader><controlfield tag="001">BV010956303</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960918s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34387004</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010956303</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">Suresh, K. G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Implementation and evaluation of yet another generalized LR parsing algorithm</subfield><subfield code="c">by K. G. Suresh & H. Tanaka</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">10 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">783</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents an implementation and evaluation of our new generalized LR parsing algorithm called Yet Another Generalized LR parsing algorithm (YAGLR). In its original version, YAGLR uses graph- structured stack (GSS) whereas in the preliminary implementation we use tree-structured stack (trss). The merge operation of stack in our algorithm is deeper than top nodes and is effective. Hence the parsing time and the reduction in memory space are remarkable. Due to effective merge operations, even when using trss, we retain packed nature of GSS and thus not causing heavy loss of memory space. Through reduce actions, YAGLR creates items called drit which are symmetrically different from Earley's item. The advantages in creating drit are realized. Through our implementation, we practically prove that for a context-free grammar with reasonable size and complexity, YAGLR's parsing time is in the order of n³, where n is the length of an imput sentence. We conclude that YAGLR has the advantages of both Earley's and Tomita's algorithm."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parsing (Computer grammar)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tanaka, Hozumi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">783</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">783</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007328457</subfield></datafield></record></collection> |
| id | DE-604.BV010956303 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:39Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007328457 |
| oclc_num | 34387004 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 10 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| 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 |
| spelling | Suresh, K. G. Verfasser aut Implementation and evaluation of yet another generalized LR parsing algorithm by K. G. Suresh & H. Tanaka Tokyo, Japan 1992 10 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 783 Abstract: "This paper presents an implementation and evaluation of our new generalized LR parsing algorithm called Yet Another Generalized LR parsing algorithm (YAGLR). In its original version, YAGLR uses graph- structured stack (GSS) whereas in the preliminary implementation we use tree-structured stack (trss). The merge operation of stack in our algorithm is deeper than top nodes and is effective. Hence the parsing time and the reduction in memory space are remarkable. Due to effective merge operations, even when using trss, we retain packed nature of GSS and thus not causing heavy loss of memory space. Through reduce actions, YAGLR creates items called drit which are symmetrically different from Earley's item. The advantages in creating drit are realized. Through our implementation, we practically prove that for a context-free grammar with reasonable size and complexity, YAGLR's parsing time is in the order of n³, where n is the length of an imput sentence. We conclude that YAGLR has the advantages of both Earley's and Tomita's algorithm." Algorithms Parsing (Computer grammar) Tanaka, Hozumi Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 783 (DE-604)BV010923438 783 |
| spellingShingle | Suresh, K. G. Tanaka, Hozumi Implementation and evaluation of yet another generalized LR parsing algorithm Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Algorithms Parsing (Computer grammar) |
| title | Implementation and evaluation of yet another generalized LR parsing algorithm |
| title_auth | Implementation and evaluation of yet another generalized LR parsing algorithm |
| title_exact_search | Implementation and evaluation of yet another generalized LR parsing algorithm |
| title_full | Implementation and evaluation of yet another generalized LR parsing algorithm by K. G. Suresh & H. Tanaka |
| title_fullStr | Implementation and evaluation of yet another generalized LR parsing algorithm by K. G. Suresh & H. Tanaka |
| title_full_unstemmed | Implementation and evaluation of yet another generalized LR parsing algorithm by K. G. Suresh & H. Tanaka |
| title_short | Implementation and evaluation of yet another generalized LR parsing algorithm |
| title_sort | implementation and evaluation of yet another generalized lr parsing algorithm |
| topic | Algorithms Parsing (Computer grammar) |
| topic_facet | Algorithms Parsing (Computer grammar) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT sureshkg implementationandevaluationofyetanothergeneralizedlrparsingalgorithm AT tanakahozumi implementationandevaluationofyetanothergeneralizedlrparsingalgorithm |