Appeal 2007-2127
Reexamination Control No. 90/006,621
9. Patent Owner filed an amendment on July 24, 2003, in this
reexamination proceeding to amend the '604 patent add the following:
As first disclosed in said prior application Serial No. 425,612
filed September 28, 1982, and then disclosed again in said prior
application Serial No. 719,507 filed April 3, 1985, and then disclosed
again in said prior application Serial No. 496,282, filed March 20,
1990, now Patent No. 5,694,603: In addition to translation, the
compiler must also perform lexical, syntactic and semantic analyses of
the source code. Lexical analysis is performed by a "scanner" and is
the process of grouping a sequence of source code bytes into symbols
or tokens and determining their correctness, somewhat like grouping a
sequence of characters into English words. If the sequence of bytes
does not constitute a properly spelled symbol an error message is
emitted. These symbols are then subjected to the syntactic analysis by
a "parser" which determines if they are arranged in a relation which
conforms to the rigid grammatical rules of the programming language.
The semantic analysis determines if the symbols conform to
additional rules which cannot be conveniently expressed by the
language grammar. These analyses are very much like parsing the
words of an English sentence. If the sequence of symbols violates a
syntactic or semantic rule an "error" is said to have been committed
and the compiler must so inform the programmer by emitting a visible
error message.
As disclosed in said prior copending application Ser. No.
496,282 filed March 20, 1990: The language or other alphanumeric
code processed by the present invention may be either a natural
language such as English, or a formal language such as a
programming language, or the numbers and strings of a spreadsheet or
database. Both natural and formal languages are generally written in
the same ASCII code, and the methods of lexical and syntactic
analysis and the mode of operation of the present invention are
substantially the same for both natural and formal languages.
Spreadsheet and database entries are also generally entered in ASCII
code or the equivalent binary code. For purposes of illustration of the
structure and operation of the present invention the disclosed
embodiment is shown and described herein as a processor of a formal
120
Page: Previous 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 Next
Last modified: September 9, 2013