Greibach normal form

Known as: GNF, Normal form 
In formal language theory, a context-free grammar is in Greibach normal form (GNF) if the right-hand sides of all production rules start with a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
This paper presents an incremental version of the well-known algorithm for constructing the Greibach normal form (GNF) of a… (More)
  • table I
  • table II
Is this relevant?
2011
2011
Heap-based data structures play an important role in modern programming concepts. However standard verification algorithms cannot… (More)
  • figure 3
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
2008
2008
We consider context-free grammars Gn in Greibach normal form and, particularly, in Greibach m-form (m = 1, 2) which generates the… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Is this relevant?
2002
2002
We give inequational and equational axioms for semirings with a fixed-point operator and formally develop a fragment of the… (More)
Is this relevant?
1999
1999
We develop a new method for placing a given context-free grammar into Greibach normal form with only polynomial increase of its… (More)
Is this relevant?
1992
1992
An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a… (More)
Is this relevant?
1992
1992
In [1,6,7] elementary proofs are given of Greibach Normal Form of context-free grammars [4]. Here we do the same for Double… (More)
Is this relevant?
1985
1985
The reader is assumed to be familiar with notions and elementary facts of context-free grammars, derivations and normal forms… (More)
Is this relevant?
1979
1979
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that is, a con text-free grammar… (More)
  • figure 1
Is this relevant?