pushdown_automata.go 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326
  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 (
  31. intInvalidRunes = []rune{'e', 'E', ' ', '\n', '\t', '{', '}', ':', ',', '"'}
  32. validIntRunes = []rune{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '-'}
  33. )
  34. var validNumberRunes = []rune{'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '.', '-', '+', 'e', 'E'}
  35. var validBoolRunes = []rune{'t', 'r', 'u', 'e', 'f', 'a', 'l', 's', 'e'}
  36. var validNullRunes = []rune{'n', 'u', 'l', 'l'}
  37. type PDA struct {
  38. State JSONState
  39. TransitionEdges map[rune]*PDA
  40. MaskTokenIDToNode map[int32]*PDA
  41. }
  42. func NewPDANode(state JSONState) *PDA {
  43. return &PDA{
  44. State: state,
  45. TransitionEdges: make(map[rune]*PDA),
  46. MaskTokenIDToNode: make(map[int32]*PDA),
  47. }
  48. }
  49. type PDAGraphBuilder struct {
  50. proc model.TextProcessor
  51. decodedToks []string
  52. stateToNodeMap map[JSONState]*PDA
  53. tokenToStatesMap map[int32][]JSONState
  54. }
  55. func (b *PDAGraphBuilder) BuildGraph() error {
  56. stateToNodeMap := make(map[JSONState]*PDA)
  57. for _, state := range JSONStates {
  58. stateToNodeMap[state] = NewPDANode(state)
  59. }
  60. stateToNodeMap[StateStart].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  61. stateToNodeMap[StateStart].TransitionEdges['['] = stateToNodeMap[StateInListStartJSON]
  62. // TODO: update naming here - and revisit values
  63. stateToNodeMap[StateInListStartJSON].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  64. stateToNodeMap[StateInListStartJSON].TransitionEdges['['] = stateToNodeMap[StateInListStartJSON]
  65. stateToNodeMap[StateInObject].TransitionEdges['"'] = stateToNodeMap[StateInObjectKey]
  66. stateToNodeMap[StateInObject].TransitionEdges['\n'] = stateToNodeMap[StateInNewline]
  67. stateToNodeMap[StateInObject].TransitionEdges[' '] = stateToNodeMap[StateInObjSpace]
  68. stateToNodeMap[StateInObject].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  69. // new line
  70. stateToNodeMap[StateInNewline].TransitionEdges['"'] = stateToNodeMap[StateInObjectKey]
  71. stateToNodeMap[StateInNewline].TransitionEdges['\t'] = stateToNodeMap[StateInTab]
  72. stateToNodeMap[StateInNewline].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  73. stateToNodeMap[StateInNewline].TransitionEdges[' '] = stateToNodeMap[StateInObjSpace]
  74. // stateToNodeMap[StateInNewline].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  75. // new line end value
  76. // stateToNodeMap[StateInNewlineEndValue].TransitionEdges[' '] = stateToNodeMap[StateInSpaceEndValue]
  77. stateToNodeMap[StateInNewlineEndValue].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  78. stateToNodeMap[StateInNewlineEndValue].TransitionEdges[']'] = stateToNodeMap[StateInListEnd]
  79. stateToNodeMap[StateInObjSpace].TransitionEdges['"'] = stateToNodeMap[StateInObjectKey]
  80. stateToNodeMap[StateInObjSpace].TransitionEdges['\n'] = stateToNodeMap[StateInNewline]
  81. // TODO: see if this is needed for formatting
  82. stateToNodeMap[StateInObjSpace].TransitionEdges[' '] = stateToNodeMap[StateInObjSpace]
  83. stateToNodeMap[StateInTab].TransitionEdges['"'] = stateToNodeMap[StateInObjectKey]
  84. stateToNodeMap[StateInObjectKey].TransitionEdges[rune(-1)] = stateToNodeMap[StateInObjectKey]
  85. stateToNodeMap[StateInObjectKey].TransitionEdges['"'] = stateToNodeMap[StateInObjectKeyEnd]
  86. stateToNodeMap[StateInObjectKeyEnd].TransitionEdges[':'] = stateToNodeMap[StateInColon]
  87. stateToNodeMap[StateInObjectEnd].TransitionEdges[','] = stateToNodeMap[StateInComma]
  88. stateToNodeMap[StateInObjectEnd].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  89. // where values should be
  90. // this could be combined but the probl might change, we're alr doing a skip ahead
  91. stateToNodeMap[StateInColon].TransitionEdges[' '] = stateToNodeMap[StateInSpaceToValue]
  92. stateToNodeMap[StateInColon].TransitionEdges['\n'] = stateToNodeMap[StateInSpaceToValue]
  93. stateToNodeMap[StateInColon].TransitionEdges['['] = stateToNodeMap[StateInList]
  94. stateToNodeMap[StateInColon].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  95. addValueConnections(stateToNodeMap[StateInColon], stateToNodeMap)
  96. // Leads to a value
  97. stateToNodeMap[StateInSpaceToValue].TransitionEdges['['] = stateToNodeMap[StateInList]
  98. stateToNodeMap[StateInSpaceToValue].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  99. addValueConnections(stateToNodeMap[StateInSpaceToValue], stateToNodeMap)
  100. stateToNodeMap[StateInSpaceToValue].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  101. stateToNodeMap[StateInSpaceToValue].TransitionEdges['\n'] = stateToNodeMap[StateInSpaceToValue]
  102. // Values
  103. // string node
  104. stateToNodeMap[StateInString].TransitionEdges[rune(-1)] = stateToNodeMap[StateInString]
  105. stateToNodeMap[StateInString].TransitionEdges['"'] = stateToNodeMap[StateInStringEnd]
  106. // String end node
  107. addEnds(stateToNodeMap[StateInStringEnd], stateToNodeMap)
  108. // stateToNodeMap[StateInStringEnd].TransitionEdges[' '] = stateToNodeMap[StateInSpaceEndValue]
  109. stateToNodeMap[StateInStringEnd].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  110. // TODO: add counters for allowable number of decimals, e, E, etc
  111. // number node
  112. for _, r := range validNumberRunes {
  113. stateToNodeMap[StateInNumber].TransitionEdges[r] = stateToNodeMap[StateInNumber]
  114. }
  115. addEnds(stateToNodeMap[StateInNumber], stateToNodeMap)
  116. // stateToNodeMap[StateInNumber].TransitionEdges[' '] = stateToNodeMap[StateInSpaceEndValue]
  117. stateToNodeMap[StateInNumber].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  118. // list node
  119. stateToNodeMap[StateInList].TransitionEdges[','] = stateToNodeMap[StateInComma]
  120. stateToNodeMap[StateInList].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  121. stateToNodeMap[StateInList].TransitionEdges[' '] = stateToNodeMap[StateInList]
  122. stateToNodeMap[StateInList].TransitionEdges['\n'] = stateToNodeMap[StateInList]
  123. // early end
  124. stateToNodeMap[StateInList].TransitionEdges[']'] = stateToNodeMap[StateInListEnd]
  125. // list end node
  126. stateToNodeMap[StateInListEnd].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  127. // stateToNodeMap[StateInListEnd].TransitionEdges[' '] = stateToNodeMap[StateInSpaceEndValue]
  128. stateToNodeMap[StateInListEnd].TransitionEdges[','] = stateToNodeMap[StateInComma]
  129. stateToNodeMap[StateInListEnd].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  130. // empty list
  131. stateToNodeMap[StateInList].TransitionEdges[']'] = stateToNodeMap[StateInListEnd]
  132. addValueConnections(stateToNodeMap[StateInList], stateToNodeMap)
  133. // null node
  134. for _, r := range validNullRunes {
  135. stateToNodeMap[StateInNull].TransitionEdges[r] = stateToNodeMap[StateInNull]
  136. }
  137. addEnds(stateToNodeMap[StateInNull], stateToNodeMap)
  138. stateToNodeMap[StateInNull].TransitionEdges[' '] = stateToNodeMap[StateInSpaceToValue]
  139. stateToNodeMap[StateInNull].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  140. // list comma
  141. // should point to values
  142. stateToNodeMap[StateInListComma].TransitionEdges[' '] = stateToNodeMap[StateInListComma]
  143. stateToNodeMap[StateInListComma].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  144. stateToNodeMap[StateInListComma].TransitionEdges['\n'] = stateToNodeMap[StateInList]
  145. stateToNodeMap[StateInListComma].TransitionEdges[' '] = stateToNodeMap[StateInList]
  146. stateToNodeMap[StateInListComma].TransitionEdges['\t'] = stateToNodeMap[StateInList]
  147. addValueConnections(stateToNodeMap[StateInListComma], stateToNodeMap)
  148. // list object end
  149. stateToNodeMap[StateInListObjectEnd].TransitionEdges[','] = stateToNodeMap[StateInListComma]
  150. stateToNodeMap[StateInListObjectEnd].TransitionEdges[']'] = stateToNodeMap[StateInListEnd]
  151. // TODO: not sure if this is needed
  152. stateToNodeMap[StateInListObjectEnd].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  153. // bool node
  154. for _, r := range validBoolRunes {
  155. stateToNodeMap[StateInBool].TransitionEdges[r] = stateToNodeMap[StateInBool]
  156. }
  157. stateToNodeMap[StateInBool].TransitionEdges['\n'] = stateToNodeMap[StateInNewline]
  158. addEnds(stateToNodeMap[StateInBool], stateToNodeMap)
  159. // stateToNodeMap[StateInBool].TransitionEdges[' '] = stateToNodeMap[StateInSpaceEndValue]
  160. stateToNodeMap[StateInBool].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  161. // comma node
  162. stateToNodeMap[StateInComma].TransitionEdges['{'] = stateToNodeMap[StateInObject]
  163. stateToNodeMap[StateInComma].TransitionEdges['\n'] = stateToNodeMap[StateInNewline]
  164. stateToNodeMap[StateInComma].TransitionEdges['"'] = stateToNodeMap[StateInObjectKey]
  165. stateToNodeMap[StateInComma].TransitionEdges[' '] = stateToNodeMap[StateInObjSpace]
  166. // todo: review this space transition
  167. // stateToNodeMap[StateInComma].TransitionEdges[' '] = stateToNodeMap[StateInSpaceToValue]
  168. // space end value
  169. // stateToNodeMap[StateInSpaceEndValue].TransitionEdges[' '] = stateToNodeMap[StateInSpaceEndValue]
  170. stateToNodeMap[StateInSpaceEndValue].TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  171. stateToNodeMap[StateInSpaceEndValue].TransitionEdges[']'] = stateToNodeMap[StateInListEnd]
  172. stateToNodeMap[StateInSpaceEndValue].TransitionEdges['\n'] = stateToNodeMap[StateInNewlineEndValue]
  173. b.stateToNodeMap = stateToNodeMap
  174. if err := b.preComputeValidStates(); err != nil {
  175. return err
  176. }
  177. return nil
  178. }
  179. func addEnds(node *PDA, stateToNodeMap map[JSONState]*PDA) {
  180. node.TransitionEdges[','] = stateToNodeMap[StateInComma]
  181. node.TransitionEdges['}'] = stateToNodeMap[StateInObjectEnd]
  182. node.TransitionEdges[']'] = stateToNodeMap[StateInListEnd]
  183. }
  184. func addValueConnections(node *PDA, stateToNodeMap map[JSONState]*PDA) {
  185. node.TransitionEdges['"'] = stateToNodeMap[StateInString]
  186. for _, r := range validNumberRunes {
  187. node.TransitionEdges[r] = stateToNodeMap[StateInNumber]
  188. }
  189. // TODO(parthsareen): force the output and shift similar to structured outputs
  190. node.TransitionEdges['t'] = stateToNodeMap[StateInBool]
  191. node.TransitionEdges['f'] = stateToNodeMap[StateInBool]
  192. node.TransitionEdges['n'] = stateToNodeMap[StateInNull]
  193. }
  194. func (b *PDAGraphBuilder) preComputeValidStates() error {
  195. for _, node := range b.stateToNodeMap {
  196. // if node.State == StateInObjectKey {
  197. // if len(b.stateToNodeMap[StateInString].MaskTokenIDToNode) > 0 {
  198. // b.stateToNodeMap[StateInObjectKey].MaskTokenIDToNode = b.stateToNodeMap[StateInString].MaskTokenIDToNode
  199. // fmt.Println("copying string mask to object key mask")
  200. // }
  201. // }
  202. if err := b.CreateMask(node); err != nil {
  203. return err
  204. }
  205. }
  206. return nil
  207. }
  208. func (b *PDAGraphBuilder) preComputeTokenToStatesMap() error {
  209. // TODO: make can be somewhere else too
  210. b.tokenToStatesMap = make(map[int32][]JSONState)
  211. for i, t := range b.decodedToks {
  212. for _, r := range t {
  213. if r == '"' {
  214. b.tokenToStatesMap[int32(i)] = append(b.tokenToStatesMap[int32(i)], StateInString)
  215. }
  216. }
  217. }
  218. return nil
  219. }
  220. // TODO: the mask for obj key and string should be the same?
  221. func (b *PDAGraphBuilder) CreateMask(node *PDA) error {
  222. if node == nil {
  223. return fmt.Errorf("node cannot be nil")
  224. }
  225. for i := range b.decodedToks {
  226. token := b.decodedToks[i]
  227. // Skip EOS/BOS tokens and empty tokens since they are not valid in JSON
  228. if b.proc.Is(uint32(i), model.SpecialEOS) || b.proc.Is(uint32(i), model.SpecialBOS) || token == "" || token == "\"\"" {
  229. continue
  230. }
  231. curNode := node
  232. valid := true
  233. consumedSpecialRunes := make(map[rune]bool)
  234. for _, r := range token {
  235. curNode, valid = isRuneValid(r, curNode, consumedSpecialRunes)
  236. if curNode == nil || !valid {
  237. break
  238. }
  239. }
  240. if valid {
  241. node.MaskTokenIDToNode[int32(i)] = curNode
  242. }
  243. }
  244. return nil
  245. }
  246. func isRuneValid(r rune, curNode *PDA, consumedSpecialRunes map[rune]bool) (*PDA, bool) {
  247. if consumedSpecialRunes[r] {
  248. return nil, false
  249. }
  250. specialRune := slices.Contains(stringInvalidRunes, r)
  251. if specialRune {
  252. if curNode.State == StateInString || curNode.State == StateInObjectKey {
  253. return nil, false
  254. }
  255. }
  256. // Check for specific rune transition
  257. if nextNode, ok := curNode.TransitionEdges[r]; ok {
  258. // fmt.Println("next node", nextNode)
  259. if specialRune {
  260. if curNode.State == nextNode.State {
  261. return nil, false
  262. }
  263. consumedSpecialRunes[r] = true
  264. }
  265. return nextNode, true
  266. }
  267. // Check for sentinel value - if present, any rune is valid
  268. if nextNode, ok := curNode.TransitionEdges[rune(-1)]; ok {
  269. return nextNode, true
  270. }
  271. return nil, false
  272. }