In the process of implementing a new computer language, the point at which the language is sufficiently effective that one can implement the language in itself. That is, for a new language called, hypothetically, FOOGOL, one has reached break-even when one can write a demonstration compiler for FOOGOL in FOOGOL, discard the original implementation language, and thereafter use working versions of FOOGOL to develop newer ones. This is an important milestone. See {My Favourite Toy Language}. [There actually is a language called Foogol].

In addition suitable contents:
[ = ] [ af ] [ ag ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ av ] [ b ] [ br ] [ break ] [ ca ] [ card ] [ ch ] [ ci ] [ co ] [ com ] [ compiler ] [ computer ] [ computer language ] [ de ] [ demo ] [ demon ] [ disc ] [ du ] [ ec ] [ ed ] [ ee ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ G ] [ ge ] [ gi ] [ GOL ] [ gu ] [ h ] [ hat ] [ hr ] [ id ] [ ie ] [ il ] [ import ] [ in ] [ int ] [ io ] [ is ] [ it ] [ ki ] [ la ] [ language ] [ Lex ] [ ly ] [ M ] [ mil ] [ mo ] [ mod ] [ module ] [ mp ] [ My Favourite Toy Language ] [ na ] [ ne ] [ ng ] [ ns ] [ O ] [ om ] [ OO ] [ op ] [ ph ] [ pl ] [ point ] [ port ] [ pr ] [ process ] [ query ] [ rc ] [ re ] [ ro ] [ S ] [ sc ] [ se ] [ si ] [ st ] [ su ] [ T ] [ th ] [ to ] [ tone ] [ tr ] [ ua ] [ us ] [ ve ] [ version ] [ write ]