Hi Folks, I am reading a compiler book [1] and it says this:
"An important practical criterion is that a parser should not backtrack. At all stages it should operate deterministically. A number of authors have described backtracking parsers, but those are rarely used in practice. It is difficult to undo semantic actions carried out by the parser as is necessary if it has to backtrack." Why does Daffodil do backtracking? Is it due to an inherent limitation of the DFDL language or is it due to the way Daffodil is implemented? /Roger [1] Introduction to Compiling Techniques by J.R. Bennett, see bottom of page 80
