On Restricted Context-Free Grammars

0346738 - MÚ 2011 RIV DE eng C - Conference Paper (international conference)
Dassow, J. - Masopust, Tomáš
On Restricted Context-Free Grammars.
Developments in Language Theory. Berlin: Springer, 2010 - (Gao, Y.; Lu, H.; Seki, S.), s. 434-435. Lecture Notes in Computer Science, 6224. ISBN 978-3-642-14455-4.
[DLT2010. 14th International Conference on Developments in Language Theory. London (CA), 17.08.2010-20.08.2010]
Institutional research plan: CEZ:AV0Z10190503
Keywords : regulated rewriting * context-free rules * generative power
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-14455-4_40

In context-free grammars, each derivation step can be characterized so that (i) a nonterminal of the current sentential form is chosen and (ii) rewritten by a rule. However, it is well-known that context-free grammars are not able to cover all aspects of natural languages and/or programming languages. Therefore, there were defined many grammars with context-free rules and some mechanism controlling the application of rules, e. g., in random context grammars and their variants, a rule is only applicable if the current sentential form contains some letters or subwords and some letters or words do not occur in it. Therefore, in grammars controlled by context, each derivation step can be characterized so that (i) subsets of applicable nonterminals and rules are determined according to the symbols appearing in the current sentential form, (ii) an applicable nonterminal is chosen and (iii) rewritten by an applicable rule.
Permanent Link: http://hdl.handle.net/11104/0187679