Question

Consider the following grammar <word>= empty string<word><dash> |<ch><word><ch> <ch> AB <dash> = - Provide a recursive recognition method isIn(strg) that return true if the string strg is in this language and returns false otherwise

Answer 1

Below is the pseudocode recursive implementation

isIn(strg){

if(strg=="")return true;

if(strg.charAt(0)=='A' or strg.charAt(0)=='B' or strg.charAt(0)=='-')return isIn(strg.substring(1,end));

return false;

}