扑克手范围分析器…如何编写语法?

我想构建一个扑克手范围解析器,通过它我可以提供如下字符串(假设一个标准的52牌组,等级2-a,s=适合,o=不适合):

"22+,A2s+,AKo-ATo,7d6d"

6 combinations for each of 22, 33, 44, 55, 66, 77, 88, 99, TT, JJ, KK, QQ, AA
4 combinations for each of A2s, A3s, A4s, A5s, A6s, A7s, A8s, A9s, ATs, AJs, AQs, AKs
12 combinations for each of ATo, AJo, AQo, AKo
1 combination of 7(diamonds)6(diamonds)

我想我知道语法的一部分,但不是全部:

NM+ --> NM, N[M+1], ... ,N[N-1]
NN+ --> NN, [N+1][N+1], ... ,TT where T is the top rank of the deck (e.g. Ace)
NP - NM --> NM, N[M+1], ... ,NP
MM - NN --> NN, [N+1][N+1], ..., MM

我是一个编程新手,所以请原谅这个基本问题:这是语法归纳问题还是语法分析问题?

谢谢,

迈克