Tag formal-grammars - This is page 5 - GeneraCodice

Predicitve Parser LL(1) condition

https://www.generacodice.com/en/articolo/2470175/predicitve-parser-ll-1-condition
  formal-grammars  -  context-free  -  compilers
cs.stackexchange cs.stackexchange

Is s-grammar powerful enough to generate all possible DCFL?

https://www.generacodice.com/en/articolo/2469242/is-s-grammar-powerful-enough-to-generate-all-possible-dcfl
  formal-grammars  -  nondeterminism  -  context-free
cs.stackexchange cs.stackexchange

Why is this language a regular language?

https://www.generacodice.com/en/articolo/2467321/why-is-this-language-a-regular-language
  finite-automata  -  formal-grammars  -  regular-languages  -  regular-expressions
cs.stackexchange cs.stackexchange

Regular expression for a palindrome of finite length?

https://www.generacodice.com/en/articolo/2467293/regular-expression-for-a-palindrome-of-finite-length
  finite-automata  -  formal-grammars  -  regular-languages  -  regular-expressions
cs.stackexchange cs.stackexchange

how to formally arrive at a correct EBNF grammar of a language

https://www.generacodice.com/en/articolo/2466520/how-to-formally-arrive-at-a-correct-ebnf-grammar-of-a-language
  formal-grammars  -  parsers
cs.stackexchange cs.stackexchange

Grammar with a long derivation generates an infinite language

https://www.generacodice.com/en/articolo/2466182/grammar-with-a-long-derivation-generates-an-infinite-language
  formal-languages  -  formal-grammars  -  context-free
cs.stackexchange cs.stackexchange

Context free grammar for $L = \{u\#v \mid u,v \in \{a,b\}^* , \vert u \vert_a \neq \vert v \vert_a \text{ or } \vert u \vert_b \neq \vert v \vert_b\}$

https://www.generacodice.com/en/articolo/2465215/context-free-grammar-for-l-u-v-mid-u-v-in-a-b-vert-u-vert-a-neq-vert-v-vert-a-text-or-vert-u-vert-b-neq-vert-v-vert-b
  formal-languages  -  formal-grammars  -  context-free
cs.stackexchange cs.stackexchange

Is the following language is a context free grammar language?

https://www.generacodice.com/en/articolo/2464733/is-the-following-language-is-a-context-free-grammar-language
  formal-languages  -  formal-grammars  -  context-free
cs.stackexchange cs.stackexchange

Is grammar that describes an equation in prefix (Polish) notation always unambiguous?

https://www.generacodice.com/en/articolo/2463778/is-grammar-that-describes-an-equation-in-prefix-polish-notation-always-unambiguous
  notation  -  ambiguity  -  formal-grammars
cs.stackexchange cs.stackexchange

Defining nullable symbols and the first set of a grammar

https://www.generacodice.com/en/articolo/2463723/defining-nullable-symbols-and-the-first-set-of-a-grammar
  formal-grammars
cs.stackexchange cs.stackexchange
Results found: 1010
scroll top