生成一个算符优先文法并给出可行的分析串

以下是一个简单的算符优先文法：

E -> E + T | E - T | T
T -> T * F | T / F | F
F -> ( E ) | id

其中，id表示一个变量或常量。

下面给出一个可行的分析串：`id + id * id / id - id`

对应的分析过程如下：

Step 1: E -> E + T
Stack: E +
Input: id * id / id - id
Action: Shift

Step 2: E -> T
Stack: E + T
Input: * id / id - id
Action: Shift

Step 3: T -> F
Stack: E + T F
Input: * id / id - id
Action: Shift

Step 4: F -> id
Stack: E + T F id
Input: * id / id - id
Action: Reduce T -> F

Step 5: T -> T * F
Stack: E + T
Input: / id - id
Action: Reduce E -> E + T

Step 6: E -> E + T
Stack: E +
Input: / id - id
Action: Shift

Step 7: E -> T
Stack: E + T
Input: / id - id
Action: Shift

Step 8: T -> F
Stack: E + T F
Input: / id - id
Action: Shift

Step 9: F -> id
Stack: E + T F id
Input: / id - id
Action: Reduce T -> F

Step 10: T -> T / F
Stack: E + T
Input: - id
Action: Reduce E -> E + T

Step 11: E -> E + T
Stack: E +
Input: - id
Action: Shift

Step 12: E -> T
Stack: E + T
Input: - id
Action: Shift

Step 13: T -> F
Stack: E + T F
Input: - id
Action: Shift

Step 14: F -> id
Stack: E + T F id
Input: - id
Action: Reduce T -> F

Step 15: T -> T - F
Stack: E + T
Input: END
Action: Reduce E -> E + T

Step 16: E -> E + T
Stack: E
Input: END
Action: Reduce E -> T

分析过程结束，输入串被成功分析。