ANTLR4 Write grammar and lexer rules for "Datalog Rules". A Datalog rule is of the form: p ql,...,qn. where n>0 and p, qi,., and qn are atomic formulas of the form: r(xi, ., xm) where m>0 and r is a relation name and x1,.xm are either numbers or variables. Relation names and variables are made up of alphabetic letters or digits and start with a lower-case alphabetic letter. Numbers are positive integers or zero very much like numbers in the WAE example. Some examples of Datalog rules are: ancestor (xi,yl)-parent (xl,yi) teaches (tno,cno) -faculty(tno), course(cno), assigned (tno, cno) p(x,y) -q(2,x),x(y,45,z), s(a,b,22) Put the grammar in a file, DLG.g4 and test it out. ANTLR4 Write grammar and lexer rules for "Datalog Rules". A Datalog rule is of the form: p ql,...,qn. where n>0 and p, qi,., and qn are atomic formulas of the form: r(xi, ., xm) where m>0 and r is a relation name and x1,.xm are either numbers or variables. Relation names and variables are made up of alphabetic letters or digits and start with a lower-case alphabetic letter. Numbers are positive integers or zero very much like numbers in the WAE example. Some examples of Datalog rules are: ancestor (xi,yl)-parent (xl,yi) teaches (tno,cno) -faculty(tno), course(cno), assigned (tno, cno) p(x,y) -q(2,x),x(y,45,z), s(a,b,22) Put the grammar in a file, DLG.g4 and test it out