Toward a theory of input-driven locally parsable languages

If a context-free language enjoys the local parsability property then, no matter how the source string is segmented, each segment can be parsed independently, and an efficient parallel parsing algorithm becomes possible. The new class of locally chain parsable languages (LCPLs), included in the dete...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2017-01, Vol.658, p.105-121
Hauptverfasser:	Crespi Reghizzi, Stefano, Lonati, Violetta, Mandrioli, Dino, Pradella, Matteo
Format:	Artikel
Sprache:	eng
Schlagworte:	Chains Context free languages Derivation Input-driven languages Languages Operator precedence languages Parallel parsing Parsing algorithms Segments Strings Terminals Visibly pushdown languages
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!