Page Menu
Home
c4science
Search
Configure Global Search
Log In
Files
F63204661
xhpast.cpp
No One
Temporary
Actions
Download File
Edit File
Delete File
View Transforms
Subscribe
Mute Notifications
Award Token
Subscribers
None
File Metadata
Details
File Info
Storage
Attached
Created
Sat, May 18, 11:19
Size
3 KB
Mime Type
text/x-c
Expires
Mon, May 20, 11:19 (2 d)
Engine
blob
Format
Raw Data
Handle
17744736
Attached To
rPHU libphutil
xhpast.cpp
View Options
/*
* Copyright 2012 Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "ast.hpp"
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <fstream>
using
namespace
std
;
int
xhpastparse
(
void
*
,
xhpast
::
Node
**
);
int
xhpast_process
(
std
::
string
&
in
);
void
print_node
(
xhpast
::
Node
*
node
);
int
main
(
int
argc
,
char
*
argv
[])
{
vector
<
string
>
files
;
if
(
argc
!=
1
)
{
//coupling: modify also libphutil/src/parser/xhpast/bin/xhpast_parse.php
cout
<<
"xhpast version 0.61
\n
"
;
return
0
;
}
ifstream
inputFile
;
istream
*
inputStream
;
// inputFile.open(argv[1]);
// inputStream = &inputFile;
inputStream
=
&
cin
;
std
::
stringbuf
sb
;
*
inputStream
>>
noskipws
>>
&
sb
;
std
::
string
buffer
=
sb
.
str
();
inputFile
.
close
();
return
xhpast_process
(
buffer
);
}
int
xhpast_process
(
std
::
string
&
in
)
{
char
*
buffer
;
in
.
reserve
(
in
.
size
()
+
1
);
buffer
=
const_cast
<
char
*>
(
in
.
c_str
());
buffer
[
in
.
size
()
+
1
]
=
0
;
// need double NULL for scan_buffer
void
*
scanner
;
yy_extra_type
extra
;
extra
.
idx_expr
=
true
;
//flags.idx_expr;
extra
.
include_debug
=
true
;
//flags.include_debug;
extra
.
insert_token
=
0
;
//flags.eval ? T_OPEN_TAG_FAKE : 0;
extra
.
short_tags
=
true
;
//flags.short_tags;
extra
.
asp_tags
=
false
;
//flags.asp_tags;
xhpast
::
Node
*
root
=
NULL
;
xhpastlex_init
(
&
scanner
);
xhpastset_extra
(
&
extra
,
scanner
);
xhpast_scan_buffer
(
buffer
,
in
.
size
()
+
2
,
scanner
);
xhpastparse
(
scanner
,
&
root
);
xhpastlex_destroy
(
scanner
);
if
(
extra
.
terminated
)
{
fprintf
(
stderr
,
"XHPAST Parse Error: %s on line %d
\n
"
,
extra
.
error
.
c_str
(),
(
int
)
extra
.
lineno
);
return
1
;
}
printf
(
"{"
);
printf
(
"
\"
tree
\"
:"
);
if
(
root
)
{
// Extend the right token for the root node to the end of the concrete
// token stream. This ensure all tokens appear in the tree. If we don't
// do this and the file ends in tokens which don't go to the parser (like
// comments and whitespace) they won't be represented in the tree.
root
->
r_tok
=
(
extra
.
token_list
.
size
()
-
1
);
print_node
(
root
);
}
else
{
printf
(
"null"
);
}
printf
(
","
);
printf
(
"
\"
stream
\"
:"
);
printf
(
"["
);
if
(
!
extra
.
token_list
.
empty
())
{
for
(
xhpast
::
token_list_t
::
iterator
ii
=
extra
.
token_list
.
begin
();;)
{
printf
(
"[%d, %d]"
,
(
*
ii
)
->
type
,
(
int
)(
*
ii
)
->
value
.
length
());
if
(
++
ii
!=
extra
.
token_list
.
end
())
{
printf
(
","
);
}
else
{
break
;
}
}
}
printf
(
"]"
);
printf
(
"}
\n
"
);
return
0
;
}
void
print_node
(
xhpast
::
Node
*
node
)
{
int
l
=
-
1
;
int
r
=
-
1
;
if
(
node
->
l_tok
!=
-
1
)
{
l
=
node
->
l_tok
;
}
if
(
l
==
-
1
)
{
printf
(
"[%d]"
,
node
->
type
);
}
else
{
if
(
node
->
r_tok
!=
-
1
)
{
r
=
node
->
r_tok
;
}
printf
(
"[%d, %d, %d"
,
node
->
type
,
l
,
r
);
if
(
!
node
->
children
.
empty
())
{
printf
(
", ["
);
for
(
xhpast
::
node_list_t
::
iterator
ii
=
node
->
children
.
begin
();;)
{
print_node
(
*
ii
);
if
(
++
ii
!=
node
->
children
.
end
())
{
printf
(
","
);
}
else
{
break
;
}
}
printf
(
"]"
);
}
printf
(
"]"
);
}
}
Event Timeline
Log In to Comment