Chomsky-Schützenberger parsing for weighted multiple context-free languages


Tobias Denkinger, Technische Universität Dresden, Germany

Abstract


We prove a Chomsky-Schützenberger representation theorem for multiple context-free languages weighted over complete commutative strong bimonoids. Using this representation we devise a parsing algorithm for a restricted form of those devices.

Keywords


Chomsky-Schützenberger, parsing, multiple context-free grammars,linear context-free rewriting systems

Full Text:

PDF


DOI: http://dx.doi.org/10.15398/jlm.v5i1.159

ISSN of the paper edition: 2299-856X