pushdown_automata.go 13 KB

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