pushdown_automata.go 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287
  1. package sample
  2. import (
  3. "fmt"
  4. "slices"
  5. "github.com/ollama/ollama/model"
  6. )
  7. /*
  8. Key JSON rules to consider:
  9. 1. Whitespace handling:
  10. - Need to handle all valid JSON whitespace characters (\r, spaces between tokens)
  11. - Current code only handles some whitespace cases
  12. 2. Number validation:
  13. - Need proper validation for special number cases like -0
  14. - Should handle .5 style decimals
  15. - Need limits on scientific notation (e, E)
  16. 3. String escaping:
  17. - Currently marks \ as invalid but should allow escaped sequences:
  18. - \"
  19. - \n
  20. - \u1234 unicode escapes
  21. 4. Empty object/array transitions:
  22. - Direct {} and [] cases could be more explicit
  23. - Need clear transitions for these edge cases
  24. 5. Nested depth limits:
  25. - No protection against excessive nesting
  26. - Could cause stack overflow with deeply nested structures
  27. */
  28. // TODO: / should be valid but an escape character
  29. var stringInvalidRunes = []rune{'\\', '\n', '\t', '{', '}', ':', ',', '/'}
  30. var intInvalidRunes = []rune{'e', 'E', ' ', '\n', '\t', '{', '}', ':', ',', '"'}
  31. var validIntRunes = []rune{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '-'}
  32. var validNumberRunes = []rune{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.', '-', '+', 'e', 'E'}
  33. var validBoolRunes = []rune{'t', 'r', 'u', 'e', 'f', 'a', 'l', 's', 'e'}
  34. var validNullRunes = []rune{'n', 'u', 'l', 'l'}
  35. type PDA struct {
  36. State JSONState
  37. TransitionEdges map[rune]*PDA
  38. MaskTokenIDToNode map[int32]*PDA
  39. }
  40. func NewPDANode(state JSONState) *PDA {
  41. return &PDA{
  42. State: state,
  43. TransitionEdges: make(map[rune]*PDA),
  44. MaskTokenIDToNode: make(map[int32]*PDA),
  45. }
  46. }
  47. type PDAGraphBuilder struct {
  48. proc model.TextProcessor
  49. decodedToks []string
  50. stateToNodeMap map[JSONState]*PDA
  51. }
  52. func (b *PDAGraphBuilder) BuildGraph() error {
  53. stateToNodeMap := make(map[JSONState]*PDA)
  54. for _, state := range JSONStates {
  55. stateToNodeMap[state] = NewPDANode(state)
  56. }
  57. stateToNodeMap[StateStart].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  58. stateToNodeMap[StateStart].TransitionEdges['['] = stateToNodeMap[StateInList]
  59. stateToNodeMap[StateInObject].TransitionEdges['"'] = stateToNodeMap[StateInObjectKey]
  60. stateToNodeMap[StateInObject].TransitionEdges['\n'] = stateToNodeMap[StateInNewline]
  61. stateToNodeMap[StateInObject].TransitionEdges[' '] = stateToNodeMap[StateInObjSpace]
  62. // new line
  63. stateToNodeMap[StateInNewline].TransitionEdges['"'] = stateToNodeMap[StateInObjectKey]
  64. stateToNodeMap[StateInNewline].TransitionEdges['\t'] = stateToNodeMap[StateInTab]
  65. stateToNodeMap[StateInNewline].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  66. stateToNodeMap[StateInNewline].TransitionEdges[' '] = stateToNodeMap[StateInObjSpace]
  67. // new line end value
  68. stateToNodeMap[StateInNewlineEndValue].TransitionEdges[' '] = stateToNodeMap[StateInSpaceEndValue]
  69. stateToNodeMap[StateInNewlineEndValue].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  70. stateToNodeMap[StateInNewlineEndValue].TransitionEdges[']'] = stateToNodeMap[StateInListEnd]
  71. stateToNodeMap[StateInObjSpace].TransitionEdges['"'] = stateToNodeMap[StateInObjectKey]
  72. stateToNodeMap[StateInObjSpace].TransitionEdges['\n'] = stateToNodeMap[StateInNewline]
  73. // TODO: see if this is needed for formatting
  74. stateToNodeMap[StateInObjSpace].TransitionEdges[' '] = stateToNodeMap[StateInObjSpace]
  75. stateToNodeMap[StateInTab].TransitionEdges['"'] = stateToNodeMap[StateInObjectKey]
  76. stateToNodeMap[StateInObjectKey].TransitionEdges[rune(-1)] = stateToNodeMap[StateInObjectKey]
  77. stateToNodeMap[StateInObjectKey].TransitionEdges['"'] = stateToNodeMap[StateInObjectKeyEnd]
  78. stateToNodeMap[StateInObjectKeyEnd].TransitionEdges[':'] = stateToNodeMap[StateInColon]
  79. stateToNodeMap[StateInObjectEnd].TransitionEdges[','] = stateToNodeMap[StateInComma]
  80. stateToNodeMap[StateInObjectEnd].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  81. // where values should be
  82. // this could be combined but the probl might change, we're alr doing a skip ahead
  83. stateToNodeMap[StateInColon].TransitionEdges[' '] = stateToNodeMap[StateInSpaceToValue]
  84. stateToNodeMap[StateInColon].TransitionEdges['['] = stateToNodeMap[StateInList]
  85. stateToNodeMap[StateInColon].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  86. addValueConnections(stateToNodeMap[StateInColon], stateToNodeMap)
  87. // Leads to a value
  88. stateToNodeMap[StateInSpaceToValue].TransitionEdges['['] = stateToNodeMap[StateInList]
  89. stateToNodeMap[StateInSpaceToValue].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  90. addValueConnections(stateToNodeMap[StateInSpaceToValue], stateToNodeMap)
  91. stateToNodeMap[StateInSpaceToValue].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  92. // Values
  93. // string node
  94. stateToNodeMap[StateInString].TransitionEdges[rune(-1)] = stateToNodeMap[StateInString]
  95. stateToNodeMap[StateInString].TransitionEdges['"'] = stateToNodeMap[StateInStringEnd]
  96. // String end node
  97. addEnds(stateToNodeMap[StateInStringEnd], stateToNodeMap)
  98. stateToNodeMap[StateInStringEnd].TransitionEdges[' '] = stateToNodeMap[StateInSpaceEndValue]
  99. stateToNodeMap[StateInStringEnd].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  100. // TODO: add counters for allowable number of decimals, e, E, etc
  101. // number node
  102. for _, r := range validNumberRunes {
  103. stateToNodeMap[StateInNumber].TransitionEdges[r] = stateToNodeMap[StateInNumber]
  104. }
  105. addEnds(stateToNodeMap[StateInNumber], stateToNodeMap)
  106. stateToNodeMap[StateInNumber].TransitionEdges[' '] = stateToNodeMap[StateInSpaceEndValue]
  107. stateToNodeMap[StateInNumber].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  108. // list node
  109. stateToNodeMap[StateInList].TransitionEdges[','] = stateToNodeMap[StateInComma]
  110. stateToNodeMap[StateInList].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  111. stateToNodeMap[StateInList].TransitionEdges[' '] = stateToNodeMap[StateInList]
  112. stateToNodeMap[StateInList].TransitionEdges['\n'] = stateToNodeMap[StateInList]
  113. // list end node
  114. stateToNodeMap[StateInListEnd].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  115. stateToNodeMap[StateInListEnd].TransitionEdges[' '] = stateToNodeMap[StateInSpaceEndValue]
  116. stateToNodeMap[StateInListEnd].TransitionEdges[','] = stateToNodeMap[StateInComma]
  117. stateToNodeMap[StateInListEnd].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  118. // empty list
  119. stateToNodeMap[StateInList].TransitionEdges[']'] = stateToNodeMap[StateInListEnd]
  120. addValueConnections(stateToNodeMap[StateInList], stateToNodeMap)
  121. // null node
  122. for _, r := range validNullRunes {
  123. stateToNodeMap[StateInNull].TransitionEdges[r] = stateToNodeMap[StateInNull]
  124. }
  125. addEnds(stateToNodeMap[StateInNull], stateToNodeMap)
  126. stateToNodeMap[StateInNull].TransitionEdges[' '] = stateToNodeMap[StateInSpaceToValue]
  127. stateToNodeMap[StateInNull].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  128. // list comma
  129. // should point to values
  130. stateToNodeMap[StateInListComma].TransitionEdges[' '] = stateToNodeMap[StateInListComma]
  131. stateToNodeMap[StateInListComma].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  132. stateToNodeMap[StateInListComma].TransitionEdges['\n'] = stateToNodeMap[StateInList]
  133. addValueConnections(stateToNodeMap[StateInListComma], stateToNodeMap)
  134. // list object end
  135. stateToNodeMap[StateInListObjectEnd].TransitionEdges[','] = stateToNodeMap[StateInListComma]
  136. stateToNodeMap[StateInListObjectEnd].TransitionEdges[']'] = stateToNodeMap[StateInListEnd]
  137. // TODO: not sure if this is needed
  138. stateToNodeMap[StateInListObjectEnd].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  139. // bool node
  140. for _, r := range validBoolRunes {
  141. stateToNodeMap[StateInBool].TransitionEdges[r] = stateToNodeMap[StateInBool]
  142. }
  143. stateToNodeMap[StateInBool].TransitionEdges['\n'] = stateToNodeMap[StateInNewline]
  144. addEnds(stateToNodeMap[StateInBool], stateToNodeMap)
  145. stateToNodeMap[StateInBool].TransitionEdges[' '] = stateToNodeMap[StateInSpaceEndValue]
  146. stateToNodeMap[StateInBool].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  147. // comma node
  148. stateToNodeMap[StateInComma].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  149. stateToNodeMap[StateInComma].TransitionEdges['\n'] = stateToNodeMap[StateInNewline]
  150. stateToNodeMap[StateInComma].TransitionEdges['"'] = stateToNodeMap[StateInObjectKey]
  151. stateToNodeMap[StateInComma].TransitionEdges[' '] = stateToNodeMap[StateInObjSpace]
  152. // space end value
  153. stateToNodeMap[StateInSpaceEndValue].TransitionEdges[' '] = stateToNodeMap[StateInSpaceEndValue]
  154. stateToNodeMap[StateInSpaceEndValue].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  155. stateToNodeMap[StateInSpaceEndValue].TransitionEdges[']'] = stateToNodeMap[StateInListEnd]
  156. stateToNodeMap[StateInSpaceEndValue].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  157. b.stateToNodeMap = stateToNodeMap
  158. if err := b.preComputeValidStates(); err != nil {
  159. return err
  160. }
  161. return nil
  162. }
  163. func addEnds(node *PDA, stateToNodeMap map[JSONState]*PDA) {
  164. node.TransitionEdges[','] = stateToNodeMap[StateInComma]
  165. node.TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  166. node.TransitionEdges[']'] = stateToNodeMap[StateInListEnd]
  167. }
  168. func addValueConnections(node *PDA, stateToNodeMap map[JSONState]*PDA) {
  169. node.TransitionEdges['"'] = stateToNodeMap[StateInString]
  170. for _, r := range validNumberRunes {
  171. node.TransitionEdges[r] = stateToNodeMap[StateInNumber]
  172. }
  173. // TODO(parthsareen): force the output and shift similar to structured outputs
  174. node.TransitionEdges['t'] = stateToNodeMap[StateInBool]
  175. node.TransitionEdges['f'] = stateToNodeMap[StateInBool]
  176. node.TransitionEdges['n'] = stateToNodeMap[StateInNull]
  177. }
  178. func (b *PDAGraphBuilder) preComputeValidStates() error {
  179. for _, node := range b.stateToNodeMap {
  180. if err := b.CreateMask(node); err != nil {
  181. return err
  182. }
  183. }
  184. return nil
  185. }
  186. func (b *PDAGraphBuilder) CreateMask(node *PDA) error {
  187. if node == nil {
  188. return fmt.Errorf("node cannot be nil")
  189. }
  190. for i := range b.decodedToks {
  191. token := b.decodedToks[i]
  192. // Skip EOS/BOS tokens and empty tokens since they are not valid in JSON
  193. if b.proc.Is(uint32(i), model.SpecialEOS) || b.proc.Is(uint32(i), model.SpecialBOS) || token == "" || token == "\"\"" {
  194. continue
  195. }
  196. curNode := node
  197. valid := true
  198. consumedSpecialRunes := make(map[rune]bool)
  199. for _, r := range token {
  200. curNode, valid = isRuneValid(r, curNode, consumedSpecialRunes)
  201. if curNode == nil || !valid {
  202. break
  203. }
  204. }
  205. if valid {
  206. node.MaskTokenIDToNode[int32(i)] = curNode
  207. }
  208. }
  209. return nil
  210. }
  211. func isRuneValid(r rune, curNode *PDA, consumedSpecialRunes map[rune]bool) (*PDA, bool) {
  212. if consumedSpecialRunes[r] {
  213. return nil, false
  214. }
  215. specialRune := slices.Contains(stringInvalidRunes, r)
  216. if specialRune {
  217. if curNode.State == StateInString || curNode.State == StateInObjectKey {
  218. return nil, false
  219. }
  220. }
  221. // Check for specific rune transition
  222. if nextNode, ok := curNode.TransitionEdges[r]; ok {
  223. // fmt.Println("next node", nextNode)
  224. if specialRune {
  225. if curNode.State == nextNode.State {
  226. return nil, false
  227. }
  228. consumedSpecialRunes[r] = true
  229. }
  230. return nextNode, true
  231. }
  232. // Check for sentinel value - if present, any rune is valid
  233. if nextNode, ok := curNode.TransitionEdges[rune(-1)]; ok {
  234. return nextNode, true
  235. }
  236. return nil, false
  237. }