Tag formal-grammars - This is page 1 - GeneraCodice

What are the closure properties of LL(k) languages?

https://www.generacodice.com/en/articolo/2511932/what-are-the-closure-properties-of-ll-k-languages
  automata  -  formal-languages  -  formal-grammars
cs.stackexchange cs.stackexchange

Is every unambiguous grammar regular?

https://www.generacodice.com/en/articolo/2478673/is-every-unambiguous-grammar-regular
  formal-languages  -  ambiguity  -  formal-grammars  -  proof-techniques
cs.stackexchange cs.stackexchange

Converting PDA to CFG

https://www.generacodice.com/en/articolo/2474524/converting-pda-to-cfg
  automata  -  formal-grammars  -  pushdown-automata  -  context-free
cs.stackexchange cs.stackexchange

If a grammar G is left and right regular, why $||L(G)|| \leq ||P||$?

https://www.generacodice.com/en/articolo/2473340/if-a-grammar-g-is-left-and-right-regular-why-l-g-leq-p
  formal-languages  -  formal-grammars
cs.stackexchange cs.stackexchange

Is there any official terminology about something like double quotes “” grammar?

https://www.generacodice.com/en/articolo/2473240/is-there-any-official-terminology-about-something-like-double-quotes-grammar
  terminology  -  formal-grammars  -  parsers
cs.stackexchange cs.stackexchange

removing indirect left recursion

https://www.generacodice.com/en/articolo/2471561/removing-indirect-left-recursion
  left-recursion  -  formal-grammars
cs.stackexchange cs.stackexchange

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
Results found: 1010
scroll top