{"repository":{"description":"With the use of the STL library (Stack and Queue)- Infix notation to a Postfix and Prefix notation. Also, evaluates the result of each operation.    - C++ data structures course.","homepage":"","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":204,"owner":"ferrufino","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-09-29T11:58:41-07:00","pushed_at":"2013-10-01T07:35:20-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Gustavo","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/ferrufino/InfixPosfixPrefix/compare/a56b6745d9...4cbc0b90e2"}