Result Details
Canonical Derivations in Programmed Grammars
programmed grammar, canonical derivations, leftmost derivations, n-limited derivations, state grammar, unrestricted state grammar, infinite hierarchy of language families
This bachelor's thesis studies canonical derivations (with focus on leftmost derivations) in programmed grammars and left restriction range. It is shown that if we introduce n-limited derivations in programmed grammars as they were defined for state grammars, we get an infinite hierarchy of language families resulting from n-limited programmed grammars, so the left restriction range affects the generative power of n-limited programmed grammars. This result is significant for syntactical analysis based on programmed grammars.
@misc{BUT192722,
author="Petr {Zemek}",
title="Canonical Derivations in Programmed Grammars",
year="2008",
pages="37",
publisher="Faculty of Information Technology BUT",
address="Brno",
url="https://www.fit.vutbr.cz/study/DP/BP.php?id=6572"
}