RACSODFACFGOperations: Reg, CFPDAReductions: K, WP, CFG, NP, SATANTLR: lexical, syntacticExams | log in, register, become guest |

- Expressions over binary +
- Expressions over binary + (with right associativity)
- Expressions over binary + (with AST +(1,2,3,4) for 1+2+3+4)
- Expressions over binary + (with AST sum(1,2,3,4) for 1+2+3+4)
- Expressions over binary + and -
- Expressions over binary + and *
- Expressions over binary + and * (with AST +(1,2,*(3,4,5)) for 1+2+3*4*5)
- Parenthesized expressions over binary + and *
- Parenthesized expressions over binary + and * (with AST +(1,*(+(2,3,4),5,6)) for 1+(2+3+4)*5*6)
- Expressions over binary +, -, *, and /
- Parenthesized expressions over binary +, -, *, /, and ^
- Parenthesized expressions over binary +, -, *, /, and ^ (^ with lower precedence than * and /)
- Parenthesized expressions over binary +, -, *, /, and ^ (^ with lowest precedence)
- Expressions over unary signs and binary +, -, * and /
- Expressions over unary signs and ^
- Expressions over unary signs and ^ (^ with highest precedence)
- Parenthesized expressions over unary signs and binary +, -, and ^
- Parenthesized expressions over unary signs and binary +, -, and ^ (^ with highest precedence)
- Parenthesized expressions over unary signs and not, and binary +, -, *, /, <, >, =, and and or
- Expressions over binary + and field access with .
- Expressions over binary + and indexed access with brackets
- Expressions over binary + and function calls
- Expressions over binary + and dereferences with ^
- Parenthesized expressions over binary +, function calls, indexed access, field access and dereferences
- Parenthesized expressions over unary signs and not, binary +, -, *, /, ^, <, >, =, and and or, function calls, indexed access and field access
- Lists of items separated by commas with optional ending comma
- Conflict resolution: left recursion
- Conflict resolution: two valid alternatives with the same lookahead
- Conflict resolution: loop may iterate too many times
- Conflict resolution: infinite loops
- Conflict resolution: AST ambiguity
- Number lists
- Trade routes
- Hierarchic Graphs
- Identifiers with subscripts