Substring parsing for arbitrary context-free grammars:
Abstract: "A substring recognizer for a language L determines whether a string s is a substring of a sentence in L, i.e., substring- recognize(s) succeeds if and only if [formula]. The algorithm for substring recognition presented here accepts general context-free grammars and uses the same par...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1990
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
90,37 |
| Subjects: | |
| Online Access: | Volltext |
| Summary: | Abstract: "A substring recognizer for a language L determines whether a string s is a substring of a sentence in L, i.e., substring- recognize(s) succeeds if and only if [formula]. The algorithm for substring recognition presented here accepts general context-free grammars and uses the same parse tables as the parsing algorithm from which it was derived. Substring recognition is useful for noncorrecting syntax error recovery and for incremental parsing. By extending the substring recognizer with the ability to generate trees for the possible contextual completions of the substring, we obtain a substring parser, which can be used in a syntax-directed editor to complete fragments of sentences." |
| Physical Description: | 9 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008973936 | ||
| 003 | DE-604 | ||
| 005 | 20220221 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25617070 | ||
| 035 | |a (DE-599)BVBBV008973936 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Rekers, J. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Substring parsing for arbitrary context-free grammars |c J. Rekers ; J. W. C. Koorn |
| 264 | 1 | |a Amsterdam |c 1990 | |
| 300 | |a 9 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 90,37 | |
| 520 | 3 | |a Abstract: "A substring recognizer for a language L determines whether a string s is a substring of a sentence in L, i.e., substring- recognize(s) succeeds if and only if [formula]. The algorithm for substring recognition presented here accepts general context-free grammars and uses the same parse tables as the parsing algorithm from which it was derived. Substring recognition is useful for noncorrecting syntax error recovery and for incremental parsing. By extending the substring recognizer with the ability to generate trees for the possible contextual completions of the substring, we obtain a substring parser, which can be used in a syntax-directed editor to complete fragments of sentences." | |
| 650 | 4 | |a Parsing (Computer grammar) | |
| 700 | 1 | |a Koorn, J. W. |e Verfasser |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 90,37 |w (DE-604)BV008928356 |9 90,37 | |
| 856 | 4 | 1 | |u https://ir.cwi.nl/pub/5683 |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005925586 | ||
Record in the Search Index
| _version_ | 1804123311904391168 |
|---|---|
| any_adam_object | |
| author | Rekers, J. Koorn, J. W. |
| author_facet | Rekers, J. Koorn, J. W. |
| author_role | aut aut |
| author_sort | Rekers, J. |
| author_variant | j r jr j w k jw jwk |
| building | Verbundindex |
| bvnumber | BV008973936 |
| collection | ebook |
| ctrlnum | (OCoLC)25617070 (DE-599)BVBBV008973936 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01872nam a2200337 cb4500</leader><controlfield tag="001">BV008973936</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220221 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25617070</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008973936</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><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rekers, J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Substring parsing for arbitrary context-free grammars</subfield><subfield code="c">J. Rekers ; J. W. C. Koorn</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 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">90,37</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A substring recognizer for a language L determines whether a string s is a substring of a sentence in L, i.e., substring- recognize(s) succeeds if and only if [formula]. The algorithm for substring recognition presented here accepts general context-free grammars and uses the same parse tables as the parsing algorithm from which it was derived. Substring recognition is useful for noncorrecting syntax error recovery and for incremental parsing. By extending the substring recognizer with the ability to generate trees for the possible contextual completions of the substring, we obtain a substring parser, which can be used in a syntax-directed editor to complete fragments of sentences."</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">Koorn, J. W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</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">90,37</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">90,37</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://ir.cwi.nl/pub/5683</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005925586</subfield></datafield></record></collection> |
| id | DE-604.BV008973936 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005925586 |
| oclc_num | 25617070 |
| open_access_boolean | 1 |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 9 S. |
| psigel | ebook |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Rekers, J. Verfasser aut Substring parsing for arbitrary context-free grammars J. Rekers ; J. W. C. Koorn Amsterdam 1990 9 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 90,37 Abstract: "A substring recognizer for a language L determines whether a string s is a substring of a sentence in L, i.e., substring- recognize(s) succeeds if and only if [formula]. The algorithm for substring recognition presented here accepts general context-free grammars and uses the same parse tables as the parsing algorithm from which it was derived. Substring recognition is useful for noncorrecting syntax error recovery and for incremental parsing. By extending the substring recognizer with the ability to generate trees for the possible contextual completions of the substring, we obtain a substring parser, which can be used in a syntax-directed editor to complete fragments of sentences." Parsing (Computer grammar) Koorn, J. W. Verfasser aut Erscheint auch als Online-Ausgabe Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 90,37 (DE-604)BV008928356 90,37 https://ir.cwi.nl/pub/5683 Verlag kostenfrei Volltext |
| spellingShingle | Rekers, J. Koorn, J. W. Substring parsing for arbitrary context-free grammars Parsing (Computer grammar) |
| title | Substring parsing for arbitrary context-free grammars |
| title_auth | Substring parsing for arbitrary context-free grammars |
| title_exact_search | Substring parsing for arbitrary context-free grammars |
| title_full | Substring parsing for arbitrary context-free grammars J. Rekers ; J. W. C. Koorn |
| title_fullStr | Substring parsing for arbitrary context-free grammars J. Rekers ; J. W. C. Koorn |
| title_full_unstemmed | Substring parsing for arbitrary context-free grammars J. Rekers ; J. W. C. Koorn |
| title_short | Substring parsing for arbitrary context-free grammars |
| title_sort | substring parsing for arbitrary context free grammars |
| topic | Parsing (Computer grammar) |
| topic_facet | Parsing (Computer grammar) |
| url | https://ir.cwi.nl/pub/5683 |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT rekersj substringparsingforarbitrarycontextfreegrammars AT koornjw substringparsingforarbitrarycontextfreegrammars |