Q42

There exist parsing algorithms for some programming languages whose complexities are less than $\Theta(n^3)$

A programming language which allows recursion can be implemented with static storage allocation.

No L-attributed definition can be evaluated in the framework of bottom-up parsing.

Code improving transformations can be performed at both source language and intermediate code level.