Consider the task of building a parser for the programming language Scheme. Contrast the effort required for a top-down, recursive-descent parser with that needed for a table-driven lr(1) parser. (Assume that you have a table-generator handy.) Now, consider the same contrast for the write statement in Fortran 77. Its syntax is given by the following set of rules.