2017
DOI: 10.1016/j.tcs.2016.05.003
|View full text |Cite
|
Sign up to set email alerts
|

Toward a theory of input-driven locally parsable languages

Abstract: 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 deterministic context-free language family, is here defined by means of the chain-driven automaton and characterized by decidable properties of grammar derivations. Such automaton decides whether to reduce or not a subs… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 22 publications
0
4
0
Order By: Relevance
“…Very recently, we defined a class of deterministic grammars and automata, called locally chain parsable [28] (LCP) which is locally parsable and preserves the closure properties of OPL, except for concatenation and Kleene star. Moreover, any locally chain-parsable grammar is in operator form but it may have conflictual OP relations; notice that the Extended CF form has not been considered for LCP.…”
Section: Discussionmentioning
confidence: 99%
“…Very recently, we defined a class of deterministic grammars and automata, called locally chain parsable [28] (LCP) which is locally parsable and preserves the closure properties of OPL, except for concatenation and Kleene star. Moreover, any locally chain-parsable grammar is in operator form but it may have conflictual OP relations; notice that the Extended CF form has not been considered for LCP.…”
Section: Discussionmentioning
confidence: 99%
“…In contrast, our technique focuses on a non-directional parsing algorithm that allows to confine the effect of any type misalignment/error, independently of its nature and origin. The property has been introduced in the context of Floyd grammars [21,26] to handle parsing errors [17,51].…”
Section: Related Workmentioning
confidence: 99%
“…Chain-driven languages [7] are a recent extension of OP languages, which shares with HOP the idea of specifying the syntax structure by non-conflictual tags, but differs in technical ways we cannot describe here. The resulting family offers some significant gain in expressive capacity over OP, enjoys local parsability, but it has poor closure properties, and cannot be easily formulated for contexts larger than one terminal.…”
Section: Related Work and Conclusionmentioning
confidence: 99%
“…The resulting family offers some significant gain in expressive capacity over OP, enjoys local parsability, but it has poor closure properties, and cannot be easily formulated for contexts larger than one terminal. Notice that the automata-theoretic approach presented in [7] can be naturally applied to HOP languages for proving their local parsability.…”
Section: Related Work and Conclusionmentioning
confidence: 99%