bripc

'''
Lisp parser

Write code that takes some Lisp code and returns an abstract syntax tree. The AST should represent the structure of the
code and the meaning of each token. For example, if your code is given "(first (list 1 (+ 2 3) 9))", it could return a
nested array like ["first", ["list", 1, ["+", 2, 3], 9]].

During your interview, you will pair on writing an interpreter to run the AST. You can start by implementing a single
built-in function (for example, +) and add more if you have time.
'''

bripc

(function () {
    'use strict';

    angular
        .module('app')
        .factory('OfflineInterceptor', ["$q", function ($q) {
           // queue for saving requests to be sent to the server when connection is down
            var queue = [];

            return {