[pandorabots-general] AIML Recursion - root, branch, leaf, then back to root...

[Brian Hoecht]

For the below examples from the Alice AAA reducer file, please
assume <that> = * and <topic> = *.

Also assume that flaq is entered where the pattern has a *.  It
is a nonsensical word that won't have a pattern match of its own.

I am trying to understand how AIML requires an interpreter to
operate in producing the bot response.

So, my questions are:

If the user inputs "Hmm flaq":

1)  does the bot gather the "I see you are..." portion of the
response, then re-run through the usual matching routines for
just <star/>,*,* adding whatever matches to the initial response?

If the user inputs "Hmmm flaq":

2)  does the bot re-run the now split pattern twice through the
usual matching routines for um,*,* and then add it to the result
for <star/>,*,*?

These are how I think they work, but would like to hear from the
experts.  Thank you in advance.

<category>
	<pattern>HMM *</pattern>
	<template>
		I see you are one of those people who writes
"Hmm" with 2 m's. 
		<sr/>
	</template>
</category>

<category>
	<pattern>HMMM *</pattern>
	<template>
		<srai>um</srai>
		<sr/>
	</template>
</category>