First Page | Document Content | |
---|---|---|
![]() Date: 2011-08-24 08:03:05Number Recursive transition network Truthiness Formal grammar 0.999... Regular expression Backus–Naur Form Formal languages Mathematics Combinatorics | Add to Reading List |
![]() | Internet Engineering Task Force (IETF) Request for Comments: 6350 Obsoletes: 2425, 2426, 4770 Updates: 2739 Category: Standards Track ISSN:DocID: 1amzh - View Document |
![]() | C ODE W ORKER Parsing tool and Code generator — User’s guide & Reference manual Release 4.5.3DocID: 18Shw - View Document |
![]() | Introduction to Computing: Explorations in Language, Logic, and MachinesDocID: 18suD - View Document |
![]() | June 21, 1967 CGTM No. 16 Dan Ross BOX SYNTAX A 2-DIMENSIONAL METALANGUAGEDocID: 18oMh - View Document |
![]() | An Analyzer for Pascal W. M. Waite August 27, 2008 This document describes an analyzer for Pascal (ANSI/IEEE 770X3It was generated from an Eli1 specification of that analyzer. An abstract syntax tree structureDocID: 18jwJ - View Document |