On Restricted Context-Free Grammars

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F10%3A00346738" target="_blank" >RIV/67985840:_____/10:00346738 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

On Restricted Context-Free Grammars

Original language description

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 ofnatural 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 applicableif 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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Developments in Language Theory

ISBN

978-3-642-14455-4

ISSN

—

e-ISSN

—

Number of pages

2

Pages from-to

—

Publisher name

Springer

Place of publication

Berlin

Event location

London

Event date

Aug 17, 2010

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—