6 ms·
Not quite, but as the paper says: Corollary: No probabilistic regular grammar exhibits criticality. In the next section, we will show that thi
by xtacy 10y ago
Not quite, but as the paper says:
Corollary: No probabilistic regular grammar
exhibits criticality.
In the next section, we will show that this statement is
not true for context-free grammars (CFGs).
That is, there exists CFGs that exhibit criticality. Programming languages are often parsed by CFGs, so it's likely that some programming languages exhibit the same criticality structure as natural languages.
- rntz 10y agoI think that means only that programs written in a language described by a CFG could exhibit "criticality", not that they will. "Exhibiting criticality" is a property of a distribution (e.g. a corpus of human-written programs or an algorithm for generating programs), not of a grammar, IIUC.