ada - How does rendezvous work? -

i studying exam , having difficult time understanding rendezvous. here's example i'm looking a

while(1) {  select{   when == true :    accept a() {f1; b=false}   when b == true :    accept b() {f2; a=false}   else {a=true; b=true}  } }

the following calls arrive in given order: a(), b(), b(), a(), a(), b()

in order calls accepted? , can caller of or b starve?

i'd appreciate help. in advance.

that's not ada. @ all.

for guidance on tasking actual ada read chapter 14 of ada distilled.

and honest, if didn't recognize example not ada, ought start chapter 1.

Sohocode