concatenation two strings recursive...

Can all iterative algorithms be expressed recursively?...

What is the name of this programming language feature and are there any real-world languages that su...

Program to convert context free language to push down automata?...

Does aabbabb belong to the regular expression ((a*| b*)bb)*?...

Recursive vs recursively enumerable language in Turing Machines?...

Theory of formal languages - Automaton...

Algorithm for regular expression intersection with cfg...

Why is TryParse the way round that it is?...

The while language...

What is the exact problem with multiple inheritance?...

what exactly is a "register machine"?...

Why can't a left-recursive, non-deterministic, or ambiguous grammar be LL(1)?...

Confusion over the abstract formatting of an AST declaration of functions...

Exactly what is the difference between a "closure" and a "block"?...

What is the definition of a "true" multidimensional array and what languages support them?...

SLR(1) Parser and epsilon involved...

Defining a finite automata Coq...

What is the possible benefit (if any) of allowing recursive constructors?...

Static types and conversions...

Reason for precedence of instanceof/is...

Why is it not possible to define an XML like element using a context free grammar?...

Context Free pumping lemma...

Can a language be turing complete but incomplete in other ways?...

Can someone give a simple but non-toy example of a context-sensitive grammar?...

How to write a concise regular expression for all strings containing "a"s, "b"s,...

Is the language of all strings over the alphabet "a,b,c" with the same number of substring...

The recognizing power of "modern" regexes...

Regular expression for strings that cointains a and an even number of b's...

Given grammar ambiguous or not?...