DFA in LEX code which accepts strings ending with 11
Prerequisite: Designing Finite Automata
Problem: Design a LEX code to construct a DFA which accepts the language: all the strings ending with “11” over inputs ‘0’ and ‘1’.
Examples:
Input: 100011 Output: Accepted Input: 100101 Output: Not Accepted Input: asdf Output: Invalid
Approach:
LEX provides us with an INITIAL state by default. So in order to make a DFA, use this as the initial state of the DFA. Now we define three more states A, B and DEAD where DEAD state would be use if encounter a wrong or invalid input. When user input invalid character, move to DEAD state and print message “INVALID” and if input string ends at state B then display a message “Accepted”. If input string ends at state INITIAL and A then display a message “Not Accepted”.
Note:
To compile a LEX program, user need a UNIX system and flex which can be installed using sudo apt-get install flex. With all the above specification open UNIX terminal and do the following:
- Use the lex program to change the specification file into a C language program. The resulting program is in the lex.yy.c file.
- Use the cc command with the -ll flag to compile and link the program with a library of lex subroutines. The resulting executable program is in the a.out file.
lex lextest cc lex.yy.c -lfl
LEX Code:
%{ %} %s A B DEAD %% <INITIAL>1 BEGIN A; <INITIAL>0 BEGIN INITIAL; <INITIAL>[^01\n] BEGIN DEAD; <INITIAL>\n BEGIN INITIAL; { printf ( "Not Accepted\n" );} <A>1 BEGIN B; <A>0 BEGIN INITIAL; <A>[^01\n] BEGIN DEAD; <A>\n BEGIN INITIAL; { printf ( "Not Accepted\n" );} <B>1 BEGIN B; <B>0 BEGIN INITIAL; <B>[^01\n] BEGIN DEAD; <B>\n BEGIN INITIAL; { printf ( "Accepted\n" );} <DEAD>[^\n] BEGIN DEAD; <DEAD>\n BEGIN INITIAL; { printf ( "Invalid\n" );} %% int main() { printf ( "Enter String\n" ); yylex(); return 0; } |
Output:
Recommended Posts:
- DFA in LEX code which accepts even number of zeros and even number of ones
- DFA in LEX code which accepts Odd number of 0’s and even number of 1’s
- Three address code in Compiler
- Code Optimization in Compiler Design
- Frequency Reduction in Code Optimization
- Issues in the design of a code generator
- Intermediate Code Generation in Compiler Design
- LEX code to extract HTML tags from a file
- Lex code to count total number of tokens
- Introduction of Object Code in Compiler Design
- Compiler Design | Detection of a Loop in Three Address Code
- Lex code to replace a word with another word in a file
- YACC program to recognize strings of { anb | n≥5 }
- YACC program which accept strings that starts and ends with 0 or 1
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.