"Straight-line grammar"@en . "October 2013"@en . . . . . . . . "3405"^^ . . . . . . . . . . . . . . "1082081188"^^ . . . . . . . "A straight-line grammar (sometimes abbreviated as SLG) is a formal grammar that generates exactly one string. Consequently, it does not branch (every non-terminal has only one associated production rule) nor loop (if non-terminal A appears in a derivation of B, then B does not appear in a derivation of A)."@en . . . . . . "A straight-line grammar (sometimes abbreviated as SLG) is a formal grammar that generates exactly one string. Consequently, it does not branch (every non-terminal has only one associated production rule) nor loop (if non-terminal A appears in a derivation of B, then B does not appear in a derivation of A)."@en . . . "19282986"^^ . . . . . "Indicate how SLGs are used in each of these fields. E.g. in the current version of the 'Kolmogorov complexity' article, they are mentioned nowhere."@en . . .