Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

New posts in formal-languages

Checking if a string consists of balanced parenthesis

How to convert NFA to Regular Expression

regex formal-languages nfa

Is L = {a^n b^m | n>m} a regular or irregular language?

What is the difference between recursive and recursively enumerable languages

Are regular haskell algebraic data types equivalent to context free grammars? What about GADTS?

chomsky hierarchy and programming languages

Is JavaScript a Context Free Language?

Where can I find a formal grammar for MATLAB?

What kind of formal languages can modern regex engines parse?

Which contemporary computer languages are LL(1)?

Why do we need prefix, postfix notation

What is a regular language?

Why can't C++ be parsed with a LR(1) parser?