Chapter 4, Problem 3PA

Program Plan Intro

Program to implement the algorithm “delimiterMatching()”:

Program Plan:

• In “delimiterMatching()” function
  • Function “delimiterMatching()” takes input file name as parameter.
  • Read characters from input file one by one till end of file
  • If character is “(”or “[” or “{” push it into stack “stackk1”.
  • If character is “)”or “]” or “}” check stack “stackk1” is empty or not.
    • If stack is empty return “false”.
    • Otherwise check delimiter is properly matched or not.
      • If stack top is “(” and character is “)” pop stack top from “stackk1”.
      • If stack top is “[” and character is “]” pop stack top from “stackk1”.
      • If stack top is “{” and character is “}” pop stack top from “stackk1”.
      • If stack top is any other character, return “false”.
  • If character is “/” and next character is “*” set “flagg” as “false”.
  • Continuously read characters till finds “*/”. If it finds before end of file set “flagg” as “true”.
  • If stack is not empty, set “flagg” as “false”.
  • Return “flagg”.
• In “main()” function
  • Read a file name from keyboard and call function “delimiterMatching()” by passing file name as parameter.
  • If “delimiterMatching()” return “true” print message that input is delimiter matched.
  • Otherwise print message that input is not delimiter matched.