What maps to Semantic Analysis the way automata like Finite State Machines and Pushdown automatons map to Lexing and Parsing?
A couple of years ago I came across a paper that presented such a construct; I don't remember much about the paper to be useful, but here's what I think I remember:
- I think the paper was from the late 80s or early 90s,
- The construct had/employed a double-ended queue,
- Elements were replaced in the queue until the replacement rules could no longer be applied [and replacements were longer sequences than what they replaced],
- The paper mentioned that while it mapped to the Semantic Analysis, it was somewhat unwieldy to use.
Any help locating this paper would be most welcome, as would info on other constructs mapping to Semantic Analysis.