2010-05-25 21:26:55 -07:00
|
|
|
%% The MIT License
|
|
|
|
|
2010-05-25 21:48:36 -07:00
|
|
|
%% Copyright (c) 2010 Alisdair Sullivan <alisdairsullivan@yahoo.ca>
|
2010-05-25 21:26:55 -07:00
|
|
|
|
|
|
|
%% Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
%% of this software and associated documentation files (the "Software"), to deal
|
|
|
|
%% in the Software without restriction, including without limitation the rights
|
|
|
|
%% to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
%% copies of the Software, and to permit persons to whom the Software is
|
|
|
|
%% furnished to do so, subject to the following conditions:
|
|
|
|
|
|
|
|
%% The above copyright notice and this permission notice shall be included in
|
|
|
|
%% all copies or substantial portions of the Software.
|
|
|
|
|
|
|
|
%% THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
%% IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
%% FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
%% AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
%% LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
%% OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
%% THE SOFTWARE.
|
|
|
|
|
|
|
|
|
2010-06-11 22:01:58 -07:00
|
|
|
%% this module is an example of how to use the raw parser api
|
|
|
|
|
2010-05-25 15:52:49 -07:00
|
|
|
-module(jsx_parser).
|
2010-05-25 22:23:06 -07:00
|
|
|
-author("alisdairsullivan@yahoo.ca").
|
2010-05-25 15:52:49 -07:00
|
|
|
|
2010-05-25 21:48:36 -07:00
|
|
|
-export([decode/1, event/2]).
|
2010-06-02 21:47:59 -07:00
|
|
|
|
|
|
|
%% export to allow the dirty hack below
|
2010-06-01 02:36:02 -07:00
|
|
|
-export([literal/1, string/1, float/1, integer/1]).
|
2010-05-25 15:52:49 -07:00
|
|
|
|
|
|
|
|
|
|
|
%% this is a strict parser, no comments, no naked values and only one key per object. it
|
|
|
|
%% also is not streaming, though it could be modified to parse partial objects/lists.
|
|
|
|
|
2010-06-11 22:01:58 -07:00
|
|
|
%% event takes two arguments, the result of calling the parser on a json argument (or the
|
|
|
|
%% generator returned by the parser) and a term that holds the erlang representation of
|
|
|
|
%% the json.
|
|
|
|
|
2010-05-25 21:48:36 -07:00
|
|
|
decode(JSON) ->
|
2010-06-11 22:01:58 -07:00
|
|
|
F = jsx:parser(),
|
|
|
|
try event(F(JSON), [])
|
|
|
|
catch error:badjson -> {error, badjson}
|
2010-05-25 15:52:49 -07:00
|
|
|
end.
|
|
|
|
|
2010-05-25 21:52:56 -07:00
|
|
|
|
2010-06-02 21:19:05 -07:00
|
|
|
%% erlang representation is dicts for objects and lists for arrays.
|
2010-05-25 15:52:49 -07:00
|
|
|
|
2010-06-11 22:01:58 -07:00
|
|
|
event({start_object, Next}, Stack) ->
|
|
|
|
event(Next(), [dict:new()] ++ Stack);
|
|
|
|
event({start_array, Next}, Stack) ->
|
|
|
|
event(Next(), [[]] ++ Stack);
|
2010-05-25 15:52:49 -07:00
|
|
|
|
2010-06-11 22:01:58 -07:00
|
|
|
event({end_object, Next}, [Object, {key, Key}, Parent|Stack]) when is_tuple(Parent) ->
|
|
|
|
event(Next(), [insert(Key, Object, Parent)] ++ Stack);
|
|
|
|
event({end_array, Next}, [Array, {key, Key}, Parent|Stack]) when is_tuple(Parent) ->
|
|
|
|
event(Next(), [insert(Key, lists:reverse(Array), Parent)] ++ Stack);
|
|
|
|
event({end_object, Next}, [Object, Parent|Stack]) when is_list(Parent) ->
|
|
|
|
event(Next(), [[Object] ++ Parent] ++ Stack);
|
|
|
|
event({end_array, Next}, [Array, Parent|Stack]) when is_list(Parent) ->
|
|
|
|
event(Next(), [[lists:reverse(Array)] ++ Parent] ++ Stack);
|
2010-05-25 15:52:49 -07:00
|
|
|
|
|
|
|
%% special cases for closing the root objects
|
2010-05-25 21:52:56 -07:00
|
|
|
|
2010-06-11 22:01:58 -07:00
|
|
|
event({end_object, Next}, [Object]) ->
|
|
|
|
event(Next(), [Object]);
|
|
|
|
event({end_array, Next}, [Array]) ->
|
|
|
|
event(Next(), [lists:reverse(Array)]);
|
2010-05-25 15:52:49 -07:00
|
|
|
|
2010-06-11 22:01:58 -07:00
|
|
|
%% keys are just pushed onto the stack until their corresponding value is
|
|
|
|
%% encountered
|
|
|
|
|
|
|
|
event({{key, Key}, Next}, [Stack]) ->
|
|
|
|
event(Next(), [{key, Key}] ++ Stack);
|
2010-05-25 15:52:49 -07:00
|
|
|
|
2010-05-31 02:36:16 -07:00
|
|
|
%% reject values that aren't wrapped by an array or object
|
|
|
|
|
2010-06-11 22:01:58 -07:00
|
|
|
event({{_Type, _Value}, _Next}, []) ->
|
|
|
|
{error, badjson};
|
2010-05-31 02:36:16 -07:00
|
|
|
|
2010-05-25 15:52:49 -07:00
|
|
|
%% this is kind of a dirty hack, but erlang will interpret atoms when applied to (Args)
|
2010-06-02 21:19:05 -07:00
|
|
|
%% as a function. so naming our formatting functions string, integer, float and literal will
|
2010-05-25 15:52:49 -07:00
|
|
|
%% allow the following shortcut
|
|
|
|
|
2010-06-11 22:01:58 -07:00
|
|
|
event({{Type, Value}, Next}, [{key, Key}, Object|Stack]) ->
|
|
|
|
event(Next(), [insert(Key, ?MODULE:Type(Value), Object)] ++ Stack);
|
|
|
|
event({{Type, Value}, Next}, [Array|Stack]) when is_list(Array) ->
|
|
|
|
event(Next(), [[?MODULE:Type(Value)] ++ Array] ++ Stack);
|
|
|
|
|
|
|
|
event({end_json, _}, [Stack]) ->
|
2010-05-25 15:52:49 -07:00
|
|
|
Stack.
|
|
|
|
|
2010-05-25 21:52:56 -07:00
|
|
|
|
2010-05-25 15:52:49 -07:00
|
|
|
%% we're restricting keys to one occurence per object, as the spec implies.
|
|
|
|
|
|
|
|
insert(Key, Val, Dict) ->
|
|
|
|
case dict:is_key(Key, Dict) of
|
|
|
|
false -> dict:store(Key, Val, Dict)
|
2010-05-30 16:39:58 -07:00
|
|
|
; true -> erlang:error(badjson)
|
2010-05-25 15:52:49 -07:00
|
|
|
end.
|
|
|
|
|
|
|
|
|
2010-06-01 02:36:02 -07:00
|
|
|
%% strings and literals we just return with no post-processing, numbers we convert
|
|
|
|
%% from strings to integers/floats as appropriate
|
2010-05-25 15:52:49 -07:00
|
|
|
|
|
|
|
string(String) ->
|
|
|
|
String.
|
2010-06-01 02:36:02 -07:00
|
|
|
integer(Number) ->
|
|
|
|
list_to_integer(Number).
|
|
|
|
float(Number) ->
|
|
|
|
list_to_float(Number).
|
2010-05-25 15:52:49 -07:00
|
|
|
literal(Literal) ->
|
2010-06-02 21:47:59 -07:00
|
|
|
Literal.
|