Modular parser generation:
Abstract: "We consider a parser generator MPG for grammars having a modular structure. Each grammar module contains a partial or incomplete grammar, which has to be supplemented with the grammars defined by the modules imported in it. MPG generates a parser for each module by generating a parse...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1989
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
89,33 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We consider a parser generator MPG for grammars having a modular structure. Each grammar module contains a partial or incomplete grammar, which has to be supplemented with the grammars defined by the modules imported in it. MPG generates a parser for each module by generating a parser for the union of a given set of modules in such a way that parsers for the individual modules can be selected from it. This yields a separate parser for each module which is as efficient as a conventionally generated one, while the generation work invested in it can be re-used for other modules. The generator works fully incrementally, as a modification of the grammar propagated to all parsers whose generation depends on it." |
| Beschreibung: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009258281 | ||
| 003 | DE-604 | ||
| 005 | 19950504 | ||
| 007 | t | ||
| 008 | 940313s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)22336134 | ||
| 035 | |a (DE-599)BVBBV009258281 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Rekers, Jan G. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Modular parser generation |
| 264 | 1 | |a Amsterdam |c 1989 | |
| 300 | |a 14 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 89,33 | |
| 520 | 3 | |a Abstract: "We consider a parser generator MPG for grammars having a modular structure. Each grammar module contains a partial or incomplete grammar, which has to be supplemented with the grammars defined by the modules imported in it. MPG generates a parser for each module by generating a parser for the union of a given set of modules in such a way that parsers for the individual modules can be selected from it. This yields a separate parser for each module which is as efficient as a conventionally generated one, while the generation work invested in it can be re-used for other modules. The generator works fully incrementally, as a modification of the grammar propagated to all parsers whose generation depends on it." | |
| 650 | 4 | |a Parsing (Computer grammar) | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 89,33 |w (DE-604)BV008928356 |9 89,33 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006160337 | ||
Datensatz im Suchindex
| _version_ | 1804123705547161600 |
|---|---|
| any_adam_object | |
| author | Rekers, Jan G. |
| author_facet | Rekers, Jan G. |
| author_role | aut |
| author_sort | Rekers, Jan G. |
| author_variant | j g r jg jgr |
| building | Verbundindex |
| bvnumber | BV009258281 |
| ctrlnum | (OCoLC)22336134 (DE-599)BVBBV009258281 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01647nam a2200289 cb4500</leader><controlfield tag="001">BV009258281</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950504 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22336134</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009258281</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 G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modular parser generation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 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">89,33</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We consider a parser generator MPG for grammars having a modular structure. Each grammar module contains a partial or incomplete grammar, which has to be supplemented with the grammars defined by the modules imported in it. MPG generates a parser for each module by generating a parser for the union of a given set of modules in such a way that parsers for the individual modules can be selected from it. This yields a separate parser for each module which is as efficient as a conventionally generated one, while the generation work invested in it can be re-used for other modules. The generator works fully incrementally, as a modification of the grammar propagated to all parsers whose generation depends on it."</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">89,33</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">89,33</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006160337</subfield></datafield></record></collection> |
| id | DE-604.BV009258281 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:34:01Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006160337 |
| oclc_num | 22336134 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 14 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Rekers, Jan G. Verfasser aut Modular parser generation Amsterdam 1989 14 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,33 Abstract: "We consider a parser generator MPG for grammars having a modular structure. Each grammar module contains a partial or incomplete grammar, which has to be supplemented with the grammars defined by the modules imported in it. MPG generates a parser for each module by generating a parser for the union of a given set of modules in such a way that parsers for the individual modules can be selected from it. This yields a separate parser for each module which is as efficient as a conventionally generated one, while the generation work invested in it can be re-used for other modules. The generator works fully incrementally, as a modification of the grammar propagated to all parsers whose generation depends on it." Parsing (Computer grammar) Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 89,33 (DE-604)BV008928356 89,33 |
| spellingShingle | Rekers, Jan G. Modular parser generation Parsing (Computer grammar) |
| title | Modular parser generation |
| title_auth | Modular parser generation |
| title_exact_search | Modular parser generation |
| title_full | Modular parser generation |
| title_fullStr | Modular parser generation |
| title_full_unstemmed | Modular parser generation |
| title_short | Modular parser generation |
| title_sort | modular parser generation |
| topic | Parsing (Computer grammar) |
| topic_facet | Parsing (Computer grammar) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT rekersjang modularparsergeneration |