Generalized LR parsing for general context-free grammars:
Abstract: "Which methods for parser generation and parsing are best suited for an interactive development system of syntax definitions? In this chapter we argue that a Generalized LR parsing algorithm is the best choice. We present an enhanced version of Tomita's GLR algorithm, and compare...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Amsterdam
1991
|
Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,53 |
Schlagworte: | |
Zusammenfassung: | Abstract: "Which methods for parser generation and parsing are best suited for an interactive development system of syntax definitions? In this chapter we argue that a Generalized LR parsing algorithm is the best choice. We present an enhanced version of Tomita's GLR algorithm, and compare its efficiency with two competitors, YACC and Earley's algorithm." |
Beschreibung: | 31 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV008993172 | ||
003 | DE-604 | ||
005 | 19950508 | ||
007 | t | ||
008 | 940206s1991 |||| 00||| eng d | ||
035 | |a (OCoLC)27638381 | ||
035 | |a (DE-599)BVBBV008993172 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Rekers, Jan |e Verfasser |4 aut | |
245 | 1 | 0 | |a Generalized LR parsing for general context-free grammars |c J. Rekers |
264 | 1 | |a Amsterdam |c 1991 | |
300 | |a 31 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 91,53 | |
520 | 3 | |a Abstract: "Which methods for parser generation and parsing are best suited for an interactive development system of syntax definitions? In this chapter we argue that a Generalized LR parsing algorithm is the best choice. We present an enhanced version of Tomita's GLR algorithm, and compare its efficiency with two competitors, YACC and Earley's algorithm." | |
650 | 4 | |a Natural language processing (Computer science) | |
650 | 4 | |a Parsing (Computer grammar) | |
810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,53 |w (DE-604)BV008928356 |9 91,53 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005941995 |
Datensatz im Suchindex
_version_ | 1804123335660929024 |
---|---|
any_adam_object | |
author | Rekers, Jan |
author_facet | Rekers, Jan |
author_role | aut |
author_sort | Rekers, Jan |
author_variant | j r jr |
building | Verbundindex |
bvnumber | BV008993172 |
ctrlnum | (OCoLC)27638381 (DE-599)BVBBV008993172 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01380nam a2200301 cb4500</leader><controlfield tag="001">BV008993172</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950508 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27638381</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993172</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rekers, Jan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Generalized LR parsing for general context-free grammars</subfield><subfield code="c">J. Rekers</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">31 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">91,53</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Which methods for parser generation and parsing are best suited for an interactive development system of syntax definitions? In this chapter we argue that a Generalized LR parsing algorithm is the best choice. We present an enhanced version of Tomita's GLR algorithm, and compare its efficiency with two competitors, YACC and Earley's algorithm."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Natural language processing (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parsing (Computer grammar)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">91,53</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,53</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941995</subfield></datafield></record></collection> |
id | DE-604.BV008993172 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:28:08Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941995 |
oclc_num | 27638381 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 31 S. |
publishDate | 1991 |
publishDateSearch | 1991 |
publishDateSort | 1991 |
record_format | marc |
series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
spelling | Rekers, Jan Verfasser aut Generalized LR parsing for general context-free grammars J. Rekers Amsterdam 1991 31 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,53 Abstract: "Which methods for parser generation and parsing are best suited for an interactive development system of syntax definitions? In this chapter we argue that a Generalized LR parsing algorithm is the best choice. We present an enhanced version of Tomita's GLR algorithm, and compare its efficiency with two competitors, YACC and Earley's algorithm." Natural language processing (Computer science) Parsing (Computer grammar) Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,53 (DE-604)BV008928356 91,53 |
spellingShingle | Rekers, Jan Generalized LR parsing for general context-free grammars Natural language processing (Computer science) Parsing (Computer grammar) |
title | Generalized LR parsing for general context-free grammars |
title_auth | Generalized LR parsing for general context-free grammars |
title_exact_search | Generalized LR parsing for general context-free grammars |
title_full | Generalized LR parsing for general context-free grammars J. Rekers |
title_fullStr | Generalized LR parsing for general context-free grammars J. Rekers |
title_full_unstemmed | Generalized LR parsing for general context-free grammars J. Rekers |
title_short | Generalized LR parsing for general context-free grammars |
title_sort | generalized lr parsing for general context free grammars |
topic | Natural language processing (Computer science) Parsing (Computer grammar) |
topic_facet | Natural language processing (Computer science) Parsing (Computer grammar) |
volume_link | (DE-604)BV008928356 |
work_keys_str_mv | AT rekersjan generalizedlrparsingforgeneralcontextfreegrammars |