Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. L-attributed grammars are a special type of attribute grammars. They allow the attributes to be evaluated in one left-to-right traversal of the abstract syntax tree. As a result, attribute evaluation in L-attributed grammars can be incorporated conveniently in top-down parsing. Many programming languages are L-attributed. Special types of compilers, the narrow compilers, are based on some form of L-attributed grammar. These are comparable with S-attributed grammars. Used for code synthesis.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.