Data Structures in C++: Parsing page ranges

Hello there, I have an assignment due for my C++ data structures class and I am struggling to code this problem.

Although it may not be an easy assignment, I'll really apprciate it if you could implement this code successfully.

Thank you in advance! I really apprciate your help.

Assignment 6, parsing page ranges Home Due: 2017-05-01" 6 OO PM You know how when you go to print a document theres an option to print "pages In some applications its just two boxes, "from" and "to, but other programs are more flexible, allowing you to write things like 1,2,4,5 1 to 10 1,3 5,8 1 10 odd and so forth. In this assignment, you're going to build an expression tree type and a parser for these "page set'' expressions. The grammar page sets of Looking at the above, we can begin to form an idea of what a valid "page set expression" looks like: A comma-separated list with at least one item where each item is either a single page number or a range of pages where a range of pages is two page numbers, separated by either a dash or the word "to, and optionally followed by the words "odd" or "even (Printing only odd/even pages is useful for duplexing.)