Data Structures Tutorial

Data Structures Tutorial Asymptotic Notation Structure and Union Array Data Structure Linked list Data Structure Type of Linked list Advantages and Disadvantages of linked list Queue Data Structure Implementation of Queue Stack Data Structure Implementation of Stack Sorting Insertion sort Quick sort Selection sort Heap sort Merge sort Bucket sort Count sort Radix sort Shell sort Tree Traversal of the binary tree Binary search tree Graph Spanning tree Linear Search Binary Search Hashing Collision Resolution Techniques

Misc Topic:

Priority Queue in Data Structure Deque in Data Structure Difference Between Linear And Non Linear Data Structures Queue Operations In Data Structure About Data Structures Data Structures Algorithms Types of Data Structures Big O Notations Introduction to Arrays Introduction to 1D-Arrays Operations on 1D-Arrays Introduction to 2D-Arrays Operations on 2D-Arrays Strings in Data Structures String Operations Application of 2D array Bubble Sort Insertion Sort Sorting Algorithms What is DFS Algorithm What Is Graph Data Structure What is the difference between Tree and Graph What is the difference between DFS and BFS Bucket Sort Dijkstra’s vs Bellman-Ford Algorithm Linear Queue Data Structure in C Stack Using Array Stack Using Linked List Recursion in Fibonacci Stack vs Array What is Skewed Binary Tree Primitive Data Structure in C Dynamic memory allocation of structure in C Application of Stack in Data Structures Binary Tree in Data Structures Heap Data Structure Recursion - Factorial and Fibonacci What is B tree what is B+ tree Huffman tree in Data Structures Insertion Sort vs Bubble Sort Adding one to the number represented an array of digits Bitwise Operators and their Important Tricks Blowfish algorithm Bubble Sort vs Selection Sort Hashing and its Applications Heap Sort vs Merge Sort Insertion Sort vs Selection Sort Merge Conflicts and ways to handle them Difference between Stack and Queue AVL tree in data structure c++ Bubble sort algorithm using Javascript Buffer overflow attack with examples Find out the area between two concentric circles Lowest common ancestor in a binary search tree Number of visible boxes putting one inside another Program to calculate the area of the circumcircle of an equilateral triangle Red-black Tree in Data Structures Strictly binary tree in Data Structures 2-3 Trees and Basic Operations on them Asynchronous advantage actor-critic (A3C) Algorithm Bubble Sort vs Heap Sort Digital Search Tree in Data Structures Minimum Spanning Tree Permutation Sort or Bogo Sort Quick Sort vs Merge Sort Boruvkas algorithm Bubble Sort vs Quick Sort Common Operations on various Data Structures Detect and Remove Loop in a Linked List How to Start Learning DSA Print kth least significant bit number Why is Binary Heap Preferred over BST for Priority Queue Bin Packing Problem Binary Tree Inorder Traversal Burning binary tree Equal Sum What is a Threaded Binary Tree? What is a full Binary Tree? Bubble Sort vs Merge Sort B+ Tree Program in Q language Deletion Operation from A B Tree Deletion Operation of the binary search tree in C++ language Does Overloading Work with Inheritance Balanced Binary Tree Binary tree deletion Binary tree insertion Cocktail Sort Comb Sort FIFO approach Operations of B Tree in C++ Language Recaman’s Sequence Tim Sort Understanding Data Processing Applications of trees in data structures Binary Tree Implementation Using Arrays Convert a Binary Tree into a Binary Search Tree Create a binary search tree Horizontal and Vertical Scaling Invert binary tree LCA of binary tree Linked List Representation of Binary Tree Optimal binary search tree in DSA Serialize and Deserialize a Binary Tree Tree terminology in Data structures Vertical Order Traversal of Binary Tree What is a Height-Balanced Tree in Data Structure Convert binary tree to a doubly linked list Fundamental of Algorithms Introduction and Implementation of Bloom Filter Optimal binary search tree using dynamic programming Right side view of binary tree Symmetric binary tree Trim a binary search tree What is a Sparse Matrix in Data Structure What is a Tree in Terms of a Graph What is the Use of Segment Trees in Data Structure What Should We Learn First Trees or Graphs in Data Structures All About Minimum Cost Spanning Trees in Data Structure Convert Binary Tree into a Threaded Binary Tree Difference between Structured and Object-Oriented Analysis FLEX (Fast Lexical Analyzer Generator) Object-Oriented Analysis and Design Sum of Nodes in a Binary Tree What are the types of Trees in Data Structure What is a 2-3 Tree in Data Structure What is a Spanning Tree in Data Structure What is an AVL Tree in Data Structure Given a Binary Tree, Check if it's balanced B Tree in Data Structure Convert Sorted List to Binary Search Tree Flattening a Linked List Given a Perfect Binary Tree, Reverse Alternate Levels Left View of Binary Tree What are Forest Trees in Data Structure Compare Balanced Binary Tree and Complete Binary Tree Diameter of a Binary Tree Given a Binary Tree Check the Zig Zag Traversal Given a Binary Tree Print the Shortest Path Given a Binary Tree Return All Root To Leaf Paths Given a Binary Tree Swap Nodes at K Height Given a Binary Tree Find Its Minimum Depth Given a Binary Tree Print the Pre Order Traversal in Recursive Given a Generate all Structurally Unique Binary Search Trees Perfect Binary Tree Threaded Binary Trees

FLEX (Fast Lexical Analyzer Generator)

FLEX stands for Fast Lexical Analyzer Generator. Around 1987, Vern Paxson created Flex in C with a great deal of input and inspiration from Van Jacobson. Van Jacobson's approach is partially implemented in the fast table representation. Vern Paxson and Kevin Gong carried out the execution. These programs use a deterministic finite automaton to accomplish character parsing and tokenizing (DFA). A DFA is a hypothetical computer that understands regular languages. In other words, it aids in the transformation of a string of characters into a string of tokens. This syntax is divided into several tokens by the lexical analyzer. It eliminates any additional blank lines or code comments.A subset of the Turing machine collection includes these devices. DFAs are analogous to right-moving, read-only Turing machines.

Regular expressions are used as the foundation for the syntax. Lexical analysers, often known as lexers, are programs that carry out lexical analysis during compiler design. A tokenizer or scanner is found in a lexer. In the design of the compiler, the Lexical Analyzer's job is to receive character streams from the source code, look for valid tokens, and then transfer the information to the Syntax Analyzer when needed. When generating the tokens, the Lexical Analyzer skips over whitespace and comments. Lexical analyzer will associate any errors with the source file and line number if they are present.

How does FLEX work?

The FLEX works in the three steps and below mentioned are the steps in which the processes will be carried out by FLEX

Step 1: A lex language input file entitled lex.l that describes the lexical analyser that will be created. The lex compiler converts the lex.l programme to a C programme, which is stored in a file with the name lex.yy.c.

Step 2: The C compiler creates an executable file called a.out from the lex.yy.c file.

Step 3: The output file a.out creates a stream of tokens from a stream of input text.

Note: Here lex.l , lex.yy.c and a.out are the file names that are particularly used in the FLEX.

Program structure of FLEX

Definition section

Variable declarations, standard definitions, and manifest constants are all found in the definition section. Text within the definition section's "%%%" brackets. Anything typed between these brackets is immediately transferred to the file lex.yy.c

Rulers section

A list of regulations is contained in the rules section and is formatted as follows: pattern action, pattern must be unanticipated, action must start on the same line, etc. "%%%%" surrounds the rule section.

User code section

This section includes extra functions and C statements. Additionally, these procedures may be individually assembled and put into the lexical analyzer.

Advantages of FLEX

  • Makes it easier to find a token in the symbol table.
  • Removes comments and blank lines from the source program.
  • Connects error messages to the origin of the program.
  • If there are macros in the source program, it extends them for you.
  • The read-only input characters from the source program.
  • The lexical analyzer method is used by program like compilers, which may take the parsed data from a programmer's code and produce a built binary executable code.
  • With the aid of a separate lexical analyzer, you can construct a customized and potentially more effective processor for the task.

Disadvantages of FLEX

  • It takes a long time to read the source code and divide it into tokens.
  • Compared to PEG or EBNF rules, some regular expressions could be more challenging to comprehend.
  • The lexer and its token descriptions require additional testing and improvement.
  • The creation of tokens and lexer tables add additional runtime overhead.


The initial step in the compiler design process is lexical analysis. Lexemes and tokens are groups of characters that are incorporated in a source program in accordance with a token's matching pattern. The program's whole source code is scanned using a lexical analyzer. Token identification in the symbol table is aided by a lexical analyzer. A lexical error is a character string that cannot be converted into a valid token. Useful error recovery technique is to remove one character from the remaining input. While the parser performs syntax analysis, the lexical analyzer scans the input program. By removing unwanted tokens, it makes lexical analysis and syntactic analysis easier.