Writing the grammar file for given array

Lezer
1

const EXAMPLE_FUNCTIONS_ARRAY = [
{label: “contains”, type: “func”, detail: “(col, substr)”},
{label: “concat”, type: “func”, detail: “(col1, val, col2)”},
{label: “indexOf”, type: “func”, detail: “(col, str)”},
{label: “lastIndexOf”, type: “func”, detail: “(col, str)”},
{label: “slice”, type: “func”, detail: “(col, start_idx, end_idx)”},
{label: “split”, type: “func”, detail: “(col, delimiter, index}”},
{label: “splitByLengths”, type: “func”, detail: “(col, …len n}”},
{label: “length”, type: “func”, detail: “(col}”},
{label: “match”, type: “func”, detail: “(col, regex, match_idx}”},
{label: “startsWith”, type: “func”, detail: “(col, substr)”},
{label: “endsWith”, type: “func”, detail: “(col, substr)”},
{label: “replace”, type: “func”, detail: “(col, substr, str)”},
{label: “trim”, type: “func”, detail: “(col}”},
{label: “toUppercase”, type: “func”, detail: “(col}”},
{label: “toLowercase”, type: “func”, detail: “(col}”},
{label: “toNumber”, type: “func”, detail: “(col}”},
{label: “toText”, type: “func”, detail: “(col}”},
{label: “if”, type: “func”, detail: “(condition, value_if_true, value_if_false)”},
{label: “or”, type: “func”, detail: “(condition_1, condition_2 …)”},
{label: “not”, type: “func”, detail: “(condition)”},
{label: “and”, type: “func”, detail: “(condition_1, condition_2 …)”},
{label: “sum”, type: “func”, detail: “(col)”},
{label: “count”, type: “func”, detail: “(col, condition_1)”},
{label: “avg”, type: “func”, detail: “(col)”},
{label: “mediam”, type: “func”, detail: “(col)”},
{label: “min”, type: “func”, detail: “(col)”},
{label: “max”, type: “func”, detail: “(col)”},
{label: “notNull”, type: “func”, detail: “(col)”},
{label: “all”, type: “func”, detail: “(col, substr)”},
{label: “any”, type: “func”, detail: “(col, substr)”},
{label: “unique”, type: “func”, detail: “(col}”},
{label: “countUnique”, type: “func”, detail: “(col}”},
]
and
const exampleLanguage = LRLanguage.define({
parser: parser.configure({
props: [
styleTags({
ComparisonOperator: tags.operator,
PlusMinus: tags.operator,
StarObelus: tags.operator,
NotQuoteChar: tags.keyword,
String: tags.keyword,
TransformerName: tags.operator,
FunctionName: tags.operator,
Column: tags.variableName,
“Column/String”: tags.variableName,
RoundTerm: tags.operator,
})
]
}),
languageData: {
commentTokens: { line: “;” }
}
});

I am having the existing parser code as given below for the functions above “sum” in the given EXAMPLE_FUNCTIONS_ARRAY and want to append the functions “sum” and below “sum” in the EXAMPLE_FUNCTIONS_ARRAY. But unable to do reverse engineering for that as we do not have available grammar file. Please write a grammar file for the given info so that is can generate the parser.

The existing parser is as given below:
const parser = LRParser.deserialize({
version: 14,
states: “!|QQOPOOOOOO’#C_‘#C_O#WOPO’#C^QQOPOOOOOO’#Cg’#CgO#]OPO,58xOOOO-E6e-E6eOOOO’#Ca’#CaO#jOPO’#CO#rOPO1G.dO#]OPO'#ChO#wOPO,58zOOOO7+$O7+$OOOOO,59S,59SOOOO-E6f-E6f", stateData: "$P~O^PO_POPOaPObPOcPOdPOePOfPOgPOhPOiPOjPOkPOlPOmPOnPOoPOpPOqPOrPOsPOtPOuPOvPOwPOxPOyPOzPO{PO|PO}PO~O!OTO~OUVOVVOWVO~PQOXYOYSX~OY[O~OXYOYSa~O”,
goto: “!R]PP^floPPPPPu{SSORTVTYXQORTYRXTQWTR]YQRORURQZWR^Z”,
nodeNames: “:warning: BuilderExpression FunctionCall FunctionName ArgumentList Argument Identifier String Number , )”,
maxTerm: 46,
skippedNodes: [0],
repeatNodeCount: 2,
tokenData: “:e~Rirs!pxy$^yz$c|}$h!Q![$m!c!}$r#R#S$r#T#U$w#U#V$r#V#W&Q#W#X$r#X#Y(u#Y#]$r#]#^)x#^#$r##a*}#a#b-U#b#c.}#c#d/|#d#f$r#f#g0Z#g#h1W#h#i5V#i#j9n#j#o$r~!sVOr!prs#Ys#O!p#O#P##P;'S!p;'S;=$W<%lO!p~#_OV~~#bRO;'S!p;'S;=#k;=O!p~#nWOr!prs#Ys#O!p#O#P#_#P;'S!p;'S;=$W;=<%l!p<%lO!p~$ZP;=<%l!p~$cO!O~~$hOY~~$mOX~~$rOW~~$wOU~~$|RU~##a%V#b#c%b#j#k%u~%YP##a%]~%bOz~~%eQ#W#X%k#m#n%p~%pOr~~%uO{%xP#Z#[%{~&QOu&VPU~#c#d&Y~&]Q#b#c&c#i#j’l~&fQ#V#W&l#h#i&}~&oP#T#U&r~&uP#h#i&x~&}O’QP#T#U’T~'WP#]#^‘Z~’^P#b#c’a~'dP#g#h’g~'lO^'oP#b#c’r~‘uP#h#i’x~’}Pt~!w!x(Q~(TP#b#c(W~(ZP#]#^(^~(aP#e#f(d~(gP#i#j(j~(mP#X#Y(p~(uO}(zPU~#b#c(}~)QP#W#X)T~)WP#g#h)Z~)^P!y!z)a~)dP#]#^)g~)jP#h#i)m~)pP#[#])s~)xOh)}QU~#Y#ZT#b#cY~YOo~~]P#W#X*~*cP#X#Y*f~*iP#l#m*l~*oP!q!r*r~*uP#Y#Z*x~*}O+SQU~#T#U+Y#X#Y,g~+]P#g#h+~+cP#h#i+f~+iP!k!l+l~+oP#b#c+r~+uP#W#X+x~+{P#X#Y,O~,RP#l#m,U~,XP!q!r,[~,_P#Y#Z,b~,gOa~~,jP#b#c,m~,pP#Z#[,s~,vP#h#i,y~,|P#[#]-P~-UOe~~-ZRU~#T#U-d#X#Y.T#]#^.r~-gQ#h#i-m#l#m.O~-pP#V#W-s~-vP#[#]-y~.OOf~~.TOx~~.WP#W#X.Z~.^P#]#^.a~.dP#T#U.g~.jP#b#c.m~.rOv~~.uP#b#c.x~.}Ow~~/SPU~#c#d/V~/YP#h#i/]~/bPq~!p!q/e~/hP#i#j/k~/nP##a/q~/tP##a/w~/|Oy~~0RPU~#f#g0U~0ZOp~~0PU~#X#Y0c~0fP#d#e0i~0lP##a0o~0rP#T#U0u~0xP#V#W0{~1OP#X#Y1R~1WOi~~1]SU~##a1i#d#e2Q#h#i3s#i#j4z~1lP#]#^1o~1rP#V#W1u~1xP#X#Y1{~2QOb2TP##a2W~2ZP#]#^2^~2aP#h#i2d~2iPc~!d!e2l~2oP#m#n2r~2uP!n!o2x~2{P#X#Y3O~3RP#b#c3U~3XP#Z#[3[~3_P#h#i3b~3eP#[#]3h~3kP#g#h3n~3sOd~~3vP#T#U3y~3|P#f#g4P~4SP#h#i4V~4YP#g#h4]~4P!y!z4c~4fP#]#^4i~4lP#h#i4o~4rP#[#]4u~4zOg4}P#a#b5Q~5VOs5[QU~#c#d5b#f#g9]~5eS!n!o5q!p!q6x!v!w7m!w!x8U~5tP#c#d5w~5zP#k#l5}~6QP#X#Y6T~6WP#f#g6Z~6^P#V#W6a~6dP#T#U6g~6jP#g#h6m~6pP#X#Y6s~6xOl6{P#i#j7O~7RP#a#b7U~7XP#U#V7[~7_P#X#Y7b~7eP#f#g7h~7mOm7pP#X#Y7s~7vP#l#m7y~7|P#h#i8P~8UOn8XP#d#e8[~8_P#d#e8b~8eP#X#Y8h~8kP#f#g8n~8qP#V#W8t~8wP#T#U8z~8}P#g#h9Q~9TP#X#Y9W~9]Ok9P#]#^9c~9fP#a#b9i~9nOj~~9sPU~#b#c9v~9yP#]#^9|~:PP#e#f:S~:VP#i#j:Y~:]P#X#Y:~:eO|~”,
tokenizers: [0],
topRules: {“BuilderExpression”:[0,1]},
tokenPrec: 0
})