Various restricted forms of DCFGs can be parsed by simpler, less resource-intensive parsers, and thus are often used.
These grammar classes are referred to by the type of parser that parses them, and important examples are LALR, SLR, and LL.
But using context-free grammars to help automate the parsing part of the compiler simplified the task.
In 1969 Frank DeRemer invented the LALR and Simple LR parsers, both based on the LR parser and having greatly reduced memory requirements at the cost of less language recognition power.
Recent research has identified methods by which canonical LR parsers may be implemented with dramatically reduced table requirements over Knuth's table-building algorithm.