In Linguistics, a Grammar consists of a Start Symbol, terminal symbols, non-terminal symbols and rules which govern ...now I'm going out on a limb here... how about
"State transition" supposing each non terminal to be a node within a finite state
graph. Now that's complexity and detail for yer ass...
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment