Implement the following problem in prolog. The file should include a predicate variable_definition and any additional helper axioms if necessary. Example executions of variable_definition:

variable_definition([int, id, comma, id, comma, id, semicolon, char, id, semicolon]).

return true

variable_definition([int, id, comma, id, comma, id, char, id, semicolon]).

return false

The problem:

Write a grammar that recognizes a list of variable definition lines. Each line contains a type (either int or char) followed by a list of simple variables (id) separated by comma, and each line ends with a semicolon. The grammar has only four terminal symbols:

int

id

comma

semicolon

For example, the grammar should recognize the following tokens:

int id comma id comma id semicolon char id semicolon int id comma id semicolon

I have seen this question being asked before, but nobody ever answers it with anything in prolog, so please read this question! I would greatly appreciate it!