Is an answer in big O notation sufficient for part b?
I may be wrong, but I think it’s possible to calculate the actual number of steps.
I think the number of steps required to parse a sentence with n words depends on the actual words. Are you sure there exists a closed formula that always holds?
Again, I may be wrong, but I think that since the operations you can do on any word are the same, there’s a way to calculate exactly how many steps it takes for the parser to parse.