4.Input Matching in lex

-

BASIC PRINCIPLES.
(1) When the generated scanner is run, it analyses its input looking for strings which match any of its patterns.
(2) If the current input can be matched by several expressions, then the ambiguity is resolved by the following rules.
     (2.1) The longest match is preferred.
     (2.2) The rule given first is preferred.
(3) Once the match is determined,
    (3.1) the text corresponding to it is available in the global character pointer yytext its length is yyleng and the current line number is yylineno,
    (3.2) and the action corresponding to the matched pattern is then executed,
    (3.3) and then the remaining input is scanned for another match.
Note that yytext can be defined in two different ways: either as a character pointer or as a character array. You can control which definition flex uses by including one of the special directives %pointer or %array in the first (definitions) section of your flex input.

Comments

Post a Comment

Popular posts from this blog

KTU Compiler Lab CSL411

-
 About Me Preamble: This course aims to offer students hands-on experience on compiler design concepts. Students will be able to familiarize with tools such as LEX and YACC and automate different phases of a compiler. This course helps the learners to enhance the capability to design and implement a compiler. Prerequisite: A sound knowledge in C programming, Data Structures, Formal languages and Automata Theory and Compiler design. How to Install  flex and Bison Introduction to lex/flex Format of lex input files Lex Regular Expressions Input Matching in Lex Actions in Lex File Start Conditions in Lex Values available to the user in action section Reading and writing files Interfacing flex with yacc Introduction to yacc Grammer Specification in yacc Writing yacc programs Precedence and conflict resolution in yacc
Read more

13.Precedence and conflict resolution in yacc

-
We had seen that , when you feed yacc a grammar that is not LALR(1), it shows a warning and resolve the conflicts automatically. For a shift/reduce conflict, yacc will choose the shift. In a reduce/reduce conflict, it will reduce using the rule declared first in the file. We can control what happens by explicitly declaring precedence and associativity for operators. Rather than re-writing the grammar to implicitly control the precedence and associativity with a bunch of intermediate non-terminals, we can directly indicate the precedence so that yacc will know how to break ties. In the definitions section, we can add any number of precedence levels, one per line, from lowest to highest, and indicate the associativity (either left, right, or nonassoc). Several terminals can be on the same line to assign them equal precedence. Example: %token T_Int %left '+' %left '*' %right '^' %% E : E '+' E |E '*'
Read more

1.Introducion to lex/flex

-
lex (lexical analyzer) flex (fast lexical analyzer) is a tool for generating scanners: programs which recognized lexical patterns in text. Lex can generate analyzers in either C or Ratfor, a language which can be translated automatically to portable Fortran. It is available on the PDP-11 UNIX, Honeywell GCOS, and IBM OS systems. However, will only discuss generating analyzers in C on the UNIX based system.  flex reads the given input files(.lex), or its standard input if no file names are given, for a description of a scanner to generate. The description is in the form of pairs of regular expressions and C code, called rules. flex generates as output a C source file, lex.yy.c, which defines a routine yylex(). This file is compiled and linked with the -lfl library to produce an executable. When the executable is run, it analyzes its input for occurrences of the regular expressions. Whenever it finds one, it executes the corresponding C code. Lets create a sample lex file log.lex %% use
Read more