Print a concrete syntax tree of regular expressions.

I'm not asking for a full solution to this, but I'm having trouble figuring out where to begin the approach. The first example seems trivial, but for the more complicated expressions I'm clueless. If I could just get some direction of the approach to take, that would be great. Thank you

A sample input file appears below. It consists of six regular expressions, one on each line. Call this inputFile2.txt. two two] "two] t (oo? wo) 4.2 Parser concrete syntax tree output For each statement in the file, you are to print a concrete syntax tree as the parse proceeds. The required output is shown below. The amount of horizontal indentation depicts the nesting level of the node within the tree. The node names "RE", "S RE", "BRE", and "E.RE" stand for regular expression, simple regular expression, basic regular expression, and elementary regular expression, respectively Processing expression: "two" RE S RE B RE E_RE CHAR_OR_META t CHAFR B RE E RE CHAR OR META W CHAR 4 B_RE E_RE CHAR OR META o CHAR A sample input file appears below. It consists of six regular expressions, one on each line. Call this inputFile2.txt. two two] "two] t (oo? wo) 4.2 Parser concrete syntax tree output For each statement in the file, you are to print a concrete syntax tree as the parse proceeds. The required output is shown below. The amount of horizontal indentation depicts the nesting level of the node within the tree. The node names "RE", "S RE", "BRE", and "E.RE" stand for regular expression, simple regular expression, basic regular expression, and elementary regular expression, respectively Processing expression: "two" RE S RE B RE E_RE CHAR_OR_META t CHAFR B RE E RE CHAR OR META W CHAR 4 B_RE E_RE CHAR OR META o CHAR