Skip to content

SimpleTechTalks

To make technologies simpler

  • Home
  • Data Structures
    • Linked List
    • Graph
    • Hashing
    • Stack
    • Queue
    • Priority Queue
    • Tree
      • Binary Tree
      • Binary Search Tree
    • wordpress
  • Programming
    • Unix
    • Dynamic Programming
    • C
    • C++
      • C++11
    • Python
  • Technology
    • Diameter
    • Microservices
    • Networking
    • Telecom
    • Tools
  • Questions & Answers
    • Programming Questions
    • Interview Questions
  • Contact Us
  • Home
  • Data Structures
    • Linked List
    • Graph
    • Hashing
    • Stack
    • Queue
    • Priority Queue
    • Tree
      • Binary Tree
      • Binary Search Tree
    • wordpress
  • Programming
    • Unix
    • Dynamic Programming
    • C
    • C++
      • C++11
    • Python
  • Technology
    • Diameter
    • Microservices
    • Networking
    • Telecom
    • Tools
  • Questions & Answers
    • Programming Questions
    • Interview Questions
  • Contact Us

Tag: AST

C++ / Interview Questions / Programming

Interpreter Design Pattern explained with simple example

adminby admin

Interpreter design pattern is mainly used in compiler and other language processing programs. This design pattern used to identify various language mainly textual such as numbers, regular expression etc. This design pattern interprets every language syntax and assign a class accordingly, to do further processing.

Before going ahead have a look at Design pattern simplified version.

(more…)
Interpreter Design Pattern explained with simple example Read More

Search

  • new vs malloc() and delete vs free() in C++
  • Binary Search Tree Deletion Of Node Explained With Simple Example
  • Diameter Protocol Message Structure
  • AVL Tree Deletion Of Node Explained With Simple Example
  • Diameter Protocol AVP Structure
  • Program To Check Whether A Binary Search Tree Is AVL Tree
  • Shortest Path in an Unweighted Graph Using BFS
  • AVL Tree Self Balancing Rotations – Right Left(RL) Rotation explained
  • Maximum Heap Explained With Simple Example
  • AVL Tree Self Balancing Rotations – Left Right (LR) Rotation explained
Copyright © 2026 SimpleTechTalks. Powered by WordPress and Bam.