How do rule-based systems deal with recursion? -


i beginning learn rule-based systems, , having trouble understanding how can handle recursion.

some quick background. have studied little programming language theory , pretty familiar context-free grammars , stuff that. have come across rule-based systems , wondering how may related automata , recursion.

my question is: how rule-based systems handle recursion? in particular, rule-based system used parsing nested parentheses? (or parsing cfg)?

i don't have deep understanding of rule-based systems yet, seems, rules never organized hierarchy or network. true, or there way represent them hierarchy or network?

without ability create hierarchy of rules, seems rule-system memory have keep track of context manually, , context used test conditions. like:

if parentconditionx , parentparentconditiony {   perform action } 

but problem is, how return "parent" rule (like parent function context)? if rules can't organized/executed hierarchically, seems can't recursion? that's i'm confused.

any ideas?


Comments

Popular posts from this blog

node.js - Using Node without global install -

How to access a php class file from PHPFox framework into javascript code written in simple HTML file? -

java - Null response to php query in android, even though php works properly -