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, ), },...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Introduction to Compiler Construction in a Java World s. 55 - 84
Hlavní autoři: Campbell, Bill, Iyer, Swami, Akbal-Delibas, Bahar
Médium: Kapitola
Jazyk:angličtina
Vydáno: United Kingdom Chapman and Hall/CRC 2013
CRC Press LLC
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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, ), }, return, 1, ;, else, return, n, *, factorial, (, n, -, 1, ), }, ;, }, public, static, void, main, (, String, [, ], args, ), }, {, int, x, =, n, ;, System, ., out, ., println, (, x, +, "!=", +, factorial, (, x, ), ), }, ;, }, static, int, n, =, 5, ;, and }.
ISBN:1439860882
9781439860885
DOI:10.1201/9781482215076-8