Chomsky-Schützenberger parsing for weighted multiple context-free languages
Keywords:Chomsky-Schützenberger, parsing, multiple context-free grammars, linear context-free rewriting systems
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.
How to Cite
Copyright (c) 2017 Tobias Denkinger
This work is licensed under a Creative Commons Attribution 3.0 Unported License.