This thread is permanently archived
To the g/u/rl asking about animation of quadrupeds
| Regular grammar according to the Chomsky hierarchy can be portrayed as a quadtuplet:
(N,T,S,P)
N is the set of non-terminal symbols
T is the set of terminal symbols
S is the start symbol
P is the set of the production rules
Funfact:
Finate state automata are able to solve decision problems for regular grammars.
This thread is permanently archived
| I tried answering but couldn't post my reply, and now I can't find the thread for some reason, so I'll post here.
It's called procedural animation, and I'm pretty sure there are guides out there to tell you how to implement it.