Lexical Analysis

The first step in compiling a program is to break it into tokens. For example, given the j-- programwe want to produce the sequence of tokens package, pass, ;, import, java, ., lang, ., System, ;, public, class, Factorial, {, public, static, int, factorial, (, int, n,), {, if, (, n, <=, 0, ), },...

Full description

Saved in:

Bibliographic Details
Published in:	Introduction to Compiler Construction in a Java World pp. 55 - 84
Main Authors:	Campbell, Bill, Iyer, Swami, Akbal-Delibas, Bahar
Format:	Book Chapter
Language:	English
Published:	United Kingdom Chapman and Hall/CRC 2013 CRC Press LLC
Subjects:	Computer architecture & logic design Computing: general Programming & scripting languages: general Control Flow Graph Lexical Analyzer Start State Context Free Grammar Dollar Sign String Literals Register Allocation Lexical Syntax Lexical Grammar Semi Input Symbol State Transition Diagram Regular Expression White Space Reserved Words Common Sub-expression Elimination Non-final States Deterministic Finite State Automaton Integer State Java Language Specification Java World Single Line Comments
ISBN:	1439860882, 9781439860885
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!