Lex Yacc tutorial课件.ppt

Lex Yacc tutorial Kun-Yuan Hsieh kyshieh@.tw Programming Language Lab., NTHU Overview take a glance at Lex! Compilation Sequence What is Lex? The main job of a lexical analyzer (scanner) is to break up an input stream into more usable elements (tokens) a = b + c * d; ID ASSIGN ID PLUS ID MULT ID SEMI Lex is an utility to help you rapidly generate your scanners Lex – Lexical Analyzer Lexical analyzers tokenize input streams Tokens are the terminals of a language English words, punctuation marks, … Programming language Identifiers, operators, keywords, … Regular expressions define terminals/tokens Lex Source Program Lex source is a table of regular expressions and corresponding program fragments Lex Source to C Program The table is translated to a C program (lex.yy.c) which reads an input stream partitioning the input into strings which match the given expressions and copying it to an output stream if necessary An Overview of Lex Lex Source Lex source is separated into three sections by %% delimiters The general format of Lex source is The absolute minimum Lex program is thus Lex v.s. Yacc Lex Lex generates C code for a lexical analyzer, or scanner Lex uses patterns that match strings in the input and converts the strings to tokens Yacc Yacc generates C code for syntax analyzer, or parser. Yacc uses grammar rules that allow it to analyze tokens from Lex and create a syntax tree. Lex with Yacc Regular Expressions Lex Regular Expressions (Extended Regular Expressions) A regular expression matches a set of strings Regular expression Operators Character classes Arbitrary character Optional expressions Alternation and grouping Context sensitivity Repetitions and definitions Operators “ \ [ ] ^ - ? . * + | ( ) $ / { } % If they are to be used as text characters, an escape should be used \$ = “$” \\ = “\” Every character but blank, tab (\t), newline (\n) and the list above is always a text character Character Classes [] [abc] matches a single characte