Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||
|
|
Sikkel, K.
(1994)
A framework for parsing algorithm specification and analysis.
In: 2. Konferenz Verarbeitung natürlicher Sprache (KONVENS'94), 28-30 Sep 1994, Wien.
pp. 300-309.
Informatik Xpress 6.
Springer Verlag.
ISBN not assigned
Full text available as:
AbstractParsing Schemata are defined as an intermediate level of abstraction between context-free grammars and parsers. Chelar, concise specification of radically different parsing algorithms can be expressed as parsing schemata. Moreover, because of the uniformity of these specifications, relations between different parsing algorithms can be formally established. The framework is introduced in an informal manner.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||
