Results 21 to 30 of about 283,476 (338)
A survey of normal form covers for context-free grammars [PDF]
, 1980 An overview is given of cover results for normal forms of context-free grammars. The emphasis in this paper is on the possibility of constructing ɛ-free grammars, non-left-recursive grammars and grammars in Greibach normal form. Among others it is proved
Nijholt, Anton
core +8 more sources
Binary Context-Free Grammars [PDF]
Symmetry, 2020 A binary grammar is a relational grammar with two nonterminal alphabets, two terminal alphabets, a set of pairs of productions and the pair of the initial nonterminals that generates the binary relation, i.e., the set of pairs of strings over the terminal alphabets.
Sherzod Turaev +4 more
openaire +2 more sources
Gamma oscillations and application of 40‐Hz audiovisual stimulation to improve brain function
Brain and Behavior, Volume 12, Issue 12, December 2022., 2022 Abstract Background Audiovisual stimulation, such as auditory stimulation, light stimulation, and audiovisual combined stimulation, as a non‐invasive stimulation, which can induce gamma oscillation, has received increased attention in recent years, and it has been preliminarily applied in the clinical rehabilitation of brain dysfunctions, such as ...
Xixi Chen +6 more
wiley +1 more source
From left-regular to Greibach normal form grammars [PDF]
, 1979 Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that is, a context-free grammar where each right-hand side of a prorfuction begins with a terminal symbol and the remainder of the right-hand side consists of
Nijholt, A.
core +3 more sources
On Restricted Context-Free Grammars
Journal of Computer and System Sciences, 2010 AbstractContext-free grammars are widely used for the simple form of their rules. A derivation step consists of the choice of a nonterminal of the sentential form and of an application of a rule rewriting it. Several regulations of the derivation process have been studied to increase the power of context-free grammars.
Dassow, J., Masopust, T. (Tomáš)
openaire +4 more sources
The Curriculum Journal, Volume 34, Issue 1, Page 100-117, March 2023., 2023 Abstract This article draws on the experiences of teachers and teacher educators within the “Bristol Decolonising Network”, an informal professional learning network based in South West England, to share examples of teacher‐led decolonising/antiracist initiatives. The seven vignettes presented cover a range of subject areas across the English Secondary
Terra Glowach +9 more
wiley +1 more source
Algorithms, 2016 LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar.
Laura Kallmeyer, Wolfgang Maier
doaj +1 more source
On the covering of left recursive grammars [PDF]
, 1976 In this paper we show that some prevailing ideas on the elimination of left recursion in a context-free grammar are not valid. An algorithm and a proof are given to show that every proper context-free grammar is covered by a non-left-recursive ...
Nijholt, A.
core +2 more sources
Multiple Context-Free Tree Grammars: Lexicalization and Characterization [PDF]
, 2017 Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an equivalent one ...
Engelfriet, Joost +2 more
core +3 more sources
Journal of Computer and System Sciences, 1974 In an attempt to provide a unified theory of grammars, a model is introduced which has two components. The first is a ''grammar form,'' which provides the general structure of the productions in the grammars to be defined. The second is an ''interpretation'', which yields a specific grammar.
Seymour Ginsburg, Armin B. Cremers
openaire +3 more sources