A practical method is presented for the automatic generation of a non-recursive context-free grammar (cfg) from a set of strings that the cfg is required to be capable of producing. The method is efficient in computing time by comparison with enumerative methods.
Homogeneous grammars with a reduced number of non-context-free productions
✍ Scribed by A. Meduna; D. Kolář
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 70 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
✦ Synopsis
A homogeneous production has its left-hand side formed by a non-empty string of identical nonterminals. A phrase-structure grammar is homogeneous if each of its productions is homogeneous. The present paper discusses the reduction of homogeneous grammars with respect to the number of non-context-free productions. More specifically, it demonstrates that for every phrasestructure grammar, there exists an equivalent homogeneous grammar that has only three non-context-free productions of the form 00 → ε, 11 → ε, and 22 → ε.
📜 SIMILAR VOLUMES
## Abstract Large‐scale RCL circuits with a large number of ports have been widely employed to model interconnect circuits, such as the power/ground networks, clock distribution networks and large data buses in VLSI. The input‐dependent moment‐matching technique, which takes the input excitations i
In this paper, we consider some non-homogeneous Poisson models to estimate the probability that an air quality standard is exceeded a given number of times in a time interval of interest. We assume that the number of exceedances occurs according to a non-homogeneous Poisson process (NHPP). This Pois