In one of my assignments for Compiler course at my university, I have to deal with this problem: build an attributed grammar tree in order to recognize Roman numbers, and convert it into Arabic format. Well, it doesn’t seem a simple mission.
An CFG for Roman numerals
19/05/2009
Leave a Comment » | 
Algorithms, School Subjects | Tagged: arabic, attribute grammar, automata, CFG, compiler, context free grammar, numeral, RE, roman, semantic rules | 
Permalink
Posted by phvu
