of a language may be defined as ally string derived from the start symbol composed of only terminal symbols in the method according to the invention a unified grammar specification is created for the grammars g 1 to g n of all the languages l 1 to l n respectively then the text in the source language is separated into a list of tokens using conventional lexical analyser for the source language a nonterminal symbol is set to the start symbol of the unified grammar specification then a set of grammar production rules is obtained for the said non terminal symbol form the unified grammar specifications take each symbol one by one from a list of terminal symbols and or nonterminal symbols corresponding to the source language grammar determine whether it is a terminal symbol or a nonterminal symbol for each terminal symbol obtained which is equivalent to a corresponding symbol in the list of tokens form the source language consider the next symbol in the list of said terminal symbols and or nonterminal symbols for each nonterminal symbol obtained which refers to another non terminal symbol obtain a set of grammar production rules for that nonterminal symbol and repeat the previous steps if all the symbols in the said list of terminal symbols and or non terminal symbols corresponding to the source language grammar match with symbols in the said list of tokens of the input text obtain a list of symbols corresponding to the target language grammar from the said unified grammar production rule for those symbols in the said list.