. . . . . . . . . . . . "1009625783"^^ . . . . "Compiler Description Language (CDL) is a programming language based on affix grammars. It is very similar to Backus\u2013Naur form (BNF) notation. It was designed for the development of compilers. It is very limited in its capabilities and control flow, and intentionally so. The benefits of these limitations are twofold. On the one hand, they make possible the sophisticated data and control flow analysis used by the CDL2 optimizers resulting in extremely efficient code. The other benefit is that they foster a highly verbose naming convention. This, in turn, leads to programs that are, to a great extent, self-documenting. The language looks a bit like Prolog (this is not surprising since both languages arose at about the same time out of work on affix grammars). However, as opposed to Prolog, control flow in CDL is deterministically based on success/failure, i.e., no other alternatives are tried when the current one succeeds. This idea is also used in parsing expression grammars. CDL3 is the third version of the CDL language, significantly different from the previous two versions."@en . . . . . . . . . "Compiler Description Language"@nl . . . . . . . "Compiler Description Language"@en . . "Compiler Description Language (CDL) is a programming language based on affix grammars. It is very similar to Backus\u2013Naur form (BNF) notation. It was designed for the development of compilers. It is very limited in its capabilities and control flow, and intentionally so. The benefits of these limitations are twofold. CDL3 is the third version of the CDL language, significantly different from the previous two versions."@en . . . . . . . . . . . . . "10069097"^^ . "9085"^^ . . . . . .