由买买提看人间百态

topics

全部话题 - 话题: parsing
首页 上页 1 2 3 4 5 6 7 8 9 10 (共10页)
q**********n
发帖数: 4160
1
记得小的时候跟妈妈闹别扭之后她总爱用一锅蘑菇韭菜汤来对付我,因为就这样就可以很好的把我给打发了,而且也不会记前仇。
爱吃蘑菇是从小养成的习惯,不只是草菇,还有金针菇,日本蘑菇,美国的圆圆胖胖白
色和巧克力颜色的那种,我统统喜欢。甚至那种贵的出奇的一种蘑菇也被我大言不惭的尝试
过,是应邀的,那玩意是咱们买不起的......
是因为蘑菇那种奇特的味道还是在嘴里面咀嚼的细腻,这种喜欢是我自己也不知道的,
还是在小的时候的最初,因为蘑菇是某种奖励或者贿赂的缘由?我统统可以不去计较
,剩下的是难得的钟爱。
这也是不需要理由的,如爱。
Portobello,那种大大的,黑黑的,如小雨伞状的大蘑菇,如果不是吃意大利餐吃过,
我想我自己是不会主动靠近的,有种莫名的恐惧对它。
感觉也总是茫然,直到吃过之后,发现它还是不错的,有着浓厚的水汁,强烈的特殊自
己的味道,越吃越会被吸引。
Portobello Mushroom Pizza, 425华氏的烤箱预热,然后去掉蘑菇的把心,撒上盐,
黑胡椒,铺到刷了橄榄油的锡纸上,两面各烤15分钟,然后,打碎一个加了盐和黑胡椒
的西红柿酱,撒上mozzarella c... 阅读全帖
b*******t
发帖数: 33714
2
来自主题: Food版 - 【獭獭学JOC】红酒炖牛肉
不知道,觉得一起炖会味道融合比较好一些,炖菜的话上桌前上面撒一把新鲜parsely
碎就很好看了
q**********n
发帖数: 4160
3
来自主题: Food版 - 【秋水】海鲜意面
热锅,橄榄油,bacon,蒜蓉,紫包菜,黑胡椒,garlic salt, 红酒,切成丁的番茄,
小煮,mussels 进锅, 开口就熟,撒上parsely,黑橄榄, 装盘,然后再放些pamasean
cheese 味道也很好。
R*****s
发帖数: 41236
4
来自主题: Food版 - 【秋水】在家做意面
赞,小菜园子真棒..

parsely
b********a
发帖数: 5418
5
来自主题: Food版 - 【秋水】在家做意面
盘子很赞!我一直在找这样中间凹进去一点的盘子。

parsely
y*********8
发帖数: 2820
6
来自主题: Food版 - 【秋水】在家做意面
好吃

parsely
t*****u
发帖数: 8966
7
来自主题: Food版 - 上个肘花
是“shoulder”吗?
去骨刀是不是parsing knife啊?
l********l
发帖数: 9452
8

server
yes for 7.6 and lower, no for 7.7 and upper.
its not a bug and they did it no purpose. perl sucks and makes parsing cue
slow, especially when u have > 1T audio library.
if u wanna use st as your major music player use cuecuter to convert single
ape or flac file to separate ones.
for chinese follow http://www.pandeqiang.com/squeezebox-radio-squeezebox-touch-and-the-squeezebox-duet-remote-controller-displays-the-correct-way-to-display-chinese.htm
any dac cheaper than 1k is just waste of $$... 阅读全帖
o****e
发帖数: 916
9
来自主题: HiFi版 - okeoke试用报告
for windows, you need 2012 version.
Here is the source code of one import plugin:
http://okeoke.net/downloads/EhanText.zip
It takes an text file and parse the info from the file. Should be a good
example.
After open the project file, you need to add reference to okeoke.common.dll
and okeoke.sdk.dll, you can find them in the program folder.
p****2
发帖数: 387
10
来自主题: JobHunting版 - Samsung实习电话面试
今天面试了Samsung的实习职位,请大家指点其中的不足:
面试我的是个印度人,第一个问题让我介绍自己,我说了下自己的研究。
第二个问题是我用Java的什麽IDE,我回答NetBeans和Eclipse。他问我在NetBeans里如
何customize JDK。一个小插曲是我当时正在用NetBeans,我就边点击电脑边回答。他
问我是不是在用电脑,我回答是。然后他不高兴地说我不能用电脑,我说我不是故意的
,碰巧正在用而已。然后他又问如何在NetBeans里customize compiling parameter,
我不明白什麽意思,他说譬如可否customize command line parameters,我回答可以
。他问如何做,说我记不清具体的菜单了,但大致介绍了一下。
第三个问题让我说说感兴趣的一个Project,我介绍了几年前参与的一个研究项目,SDL
Coverage Analysis Tool。我说首先parse SDL specification, 然后instrument
parser tree, 然后获取coverage的一些信息。然或他问我什麽是SDL,我说
m*****n
发帖数: 5245
11
☆─────────────────────────────────────☆
somewhat (nick) 于 (Sun Aug 9 23:09:41 2009, 美东) 提到:
计算表达式的值:
比如 1*100+50-(8+199)的值。
好像是当年的编译原理里学的。
弄一个tree,然后poster ordering DFS。还是想找个人互相写写代码比较好。光想觉
得不是事。
☆─────────────────────────────────────☆
goodbug (好虫) 于 (Sun Aug 9 23:11:39 2009, 美东) 提到:
Easy, post to google, parse the page and get the result back.
I can do it in 10 minutes.

☆─────────────────────────────────────☆
NND (牛牛的) 于 (Sun Aug 9 23:23:37 2009, 美东) 提到:
这个compiler就constant pr
z***e
发帖数: 5393
12
来自主题: JobHunting版 - 一道题,我觉得挺难
两种方法,一种是照compiler的parse tree实现 expression:=expression op
expression,不过比较麻烦;
另外就是直接算,因为给的例子只有两个priority的op: + -, * /,所以直接读3个
operand和两个op,就可以开算了(如果有括号就不行,只能构建tree了),可以用
stack,不过我觉得没必要。
P********l
发帖数: 452
13
来自主题: JobHunting版 - Permutation一问
你的想法是对的。但是实现起来还是优点麻烦。
如果一个数组的长度是n,那末,一共有n!种排列. 每种都可以写成基数{n, n-1, ..
., 2, 1, 0}的格式。比如,第一个到第三个是{0,0...,1,0},{0,0...1,0,0},{0,0..
.2,1,0}.
这个序列的含义是左边有多少个数比当前的数大。
比如,给定一个排列 {3,2,1,4}, 那末对应的序列是{2,1,0,0}.
根据这种方法,对于一个随机数,可以在o(n)内产生对应的排列。
代码:
完整的代码在:
http://code.google.com/p/sureinterview/source/browse/src/lib/combination/PermutationImpl.java
看看有问题没?
@Override
public T[] get(Long index) {
// adjust to 1-based.
index++;
// parse the index to {n-1, n-2, ... 3, 2, 1, 0}-bas... 阅读全帖
g**e
发帖数: 6127
14
来自主题: JobHunting版 - Amazon onsite interview
the point here is, how to get the number of results, not simply parsing the
website html code
l********n
发帖数: 54
15
来自主题: JobHunting版 - 请问一道c++题目
这个问题有点意思,有个陷阱。
咋一眼看,我选B. a = a+5+c; 因为数学运算都是right-associative,所以加法的顺
序是 a = a+(5+c); 但是因为+被overload了,所以必须是b+5而不能是5+b,否则会有
compile error.
不过当把LZ的code放倒cpp中,a=a+5+b 是可以编译的。想了半天发现跟编译器的原理
相关。通常来说一个assignment的右段如:a+5+b是用LR (Left-to-right, Right most
derivation) parser来进行parsing.
上面的class X通过overloading +,定义一些derivation
X->X+int
X->X+X
当5+b不能derive的时候, b会被push_stack, 先对a+5进行derive,生成一个X object
, push_stack, 然后这个object和b根据X->X+X进行derive。所以变成了 a = (a+5)+b
,这样就没有编译的问题了。
不过,a=5+b; 是不对的, 一定要a=b+5;
b********e
发帖数: 693
16
来自主题: JobHunting版 - Amazon(6)
Most frequent path of 3 websites.
Given a log file, which contains a series of websites, which the user has vi
sited, find the most frequent path of 3 websites.
e.g: If this is a log file
A B C D E
A C D B E
C D E B A
A C D E B
C D E A B
Clearly, C D E in the most frequent website?
First I said graph, then I said hash table. Hash every 3 consecutive web sit
es and increment in Hash Table. Parse through HT and keep a variable which s
tores the max value you get the answer.
z******e
发帖数: 76
17
Sr. Software Engineer - BOI23220
Description
Micron Technology is currently developing the tool chain for compiling and
programming new applications based on advanced programmable semiconductor
architectures. The tool chain is delivered as a Software Development Kit
which includes: compiler, emulator, and runtime programming interfaces plus
support applications. The SDK is a complex code base which relies on
disciplines such as ASIC/FPGA placement and route theory, graph algorithms,
parsing, com
r**u
发帖数: 1567
18
c code will be compiled to object file so it can directly execute on the
hardware.
shell is script. It needs first to be parsed, translated, ..., and then
compiled to machine code that can execute on hardware at runtime.
So shell is slower.
b**********r
发帖数: 225
19
Please C*********************[email protected] Miss Wu
待遇不高,大概400k/年,但是可以带团队。
公司简介:
Teradata Corporation(美国纽约证券交易所交易代码NYSE:TDC)是全球最大的专注于数
据库软件、数据仓库、数据仓库专用平台、咨询服务及企业分析方案的提供商,致力于
通过先进的数据库信息系统和服务提升企业智能,业务遍布全球六十多个国家,公司网
址为: www.teradata.com
其北京办事处地址为北京海淀区五道口清华科技园内。
Teradata is the world's largest company solely focused on creating
enterprise agility through database software, enterprise data warehousing,
data warehouse appliances, and analytics. It’s our passion and it’s all we
do. We deliver award-winnin... 阅读全帖
s*******f
发帖数: 1114
20
Name address
• 5+ years of experience in software
development.
• 3+ years of experience in large scale
software design, network, multithreaded
programming, Inter-process communication and
distributed system.
• Skills: C, C++, Python, Shell, Java,
C#, Perl; SQL, SQL server, MySQL; JavaScript,
Ajax, Asp.Net, XML; UNIX, Windows; Design
Patterns
• Available Immediately
EXPERIENCE
Senior Software Engineer Tencent, Inc
(China's largest internet company) ... 阅读全帖
c******n
发帖数: 4965
21
来自主题: JobHunting版 - 问道 facebook 面试题
多谢,
我原来写的deserialize binary tree, 非找matching ) 才去做recursive parsing
你这样直接consume ")" ( 加assert) 简单多了
a****t
发帖数: 249
22
来自主题: JobHunting版 - 写个自动填简历程序吧
我也是在学习中
难道不是从website读取数据, 然后parse form, 然后fill client form
再submit嘛?
i****c
发帖数: 102
23
来自主题: JobHunting版 - 问Amazon一组递进面试题
for 3) I guess the major purpose is not to save space. Instead, is to get th
e path when parsing (and without constructing a tree in memory)
Also, level-based serialization is not necessary to save much space comparin
g with pre-order+in order or other methods.

js的
k***t
发帖数: 276
24
来自主题: JobHunting版 - 收到G家拒信,发面经
我也试一个,in-placed的。先把要删掉的mark成'*'。第二次遍历时再删掉。
#include
// /a/b/./../../c/d => /c/d
void path (char *in) {
char *p, *q;
bool isSlash;
char inv='*';
if (!in || !*in) return;
int i=0;
// parse
p=in; isSlash=false;
while (*p) {
/* first slash */
if (*p=='/') {
if (!isSlash) {
isSlash=true;
} else {
*p=inv;
}
p++; continue;
}
isSlash=false;
... 阅读全帖
g**e
发帖数: 6127
25
string encode就是把每个string加上xml tag

STRING1


STRING2

恢复就是parse这个xml了。加'\0'不管用,因为有可能string本身就包含\0
F**********r
发帖数: 237
26
来自主题: JobHunting版 - 问个算法题9
就是说比如((A1)(A2)(A3)(A4))虽然也能parse,但是不count
c******g
发帖数: 69
27
来自主题: JobHunting版 - 问个google面试题
recursive top down parsing 不仅能分析正则表达式,还能分析上下文无关文法。感
觉杀鸡用牛刀了。
p**f
发帖数: 49
28
来自主题: JobHunting版 - job openings: Software Engineer in Seattle
Openings available for all levels. Please contact s*********[email protected]
for details.
Specific job responsibilities will include:
- Design and build large scale metrics systems used to track traffic from
search engines, trends in search terms, conversion and other key traffic
metrics.
- Design and build dynamic website components used to improve ranking and
indexing of web pages
- Design and build machine-learning systems to optimize the landing page
experience and improve sales conversion for ... 阅读全帖
t**r
发帖数: 3428
29
Required Skills:
• Object oriented Perl, development of Perl modules and tests (*.t
files)
• XML, its validation/parsing and basic Web Services (SOAP)
• Excellent UNIX scripting skills in bash and ksh and proficiency in
gcc/make/ar for compiling XS portions of non-pure Perl modules.
• Good knowledge of networking (TCP/IP, DNS, TLS) and socket
programming
• C/C++
• Knowledge of build release processes
• Java
• Apache advanced web server configuratio... 阅读全帖
r****s
发帖数: 1025
30
没啥,就一个front end的工程师,做Perl的,工作里可能要parse一些XML之类。至于
Apache配置之类,用用就会了。没有到Tomcat dynamic content和数据库一级,体会不
到CS的乐趣。
B*******1
发帖数: 2454
31
来自主题: JobHunting版 - 任意输入STRING,转换为INTEGER,
atoi
function

int atoi ( const char * str );
Convert string to integer
Parses the C string str interpreting its content as an integral number,
which is returned as an int value.
The function first discards as many whitespace characters as necessary until
the first non-whitespace character is found. Then, starting from this
character, takes an optional initial plus or minus sign followed by as many
numerical digits as possible, and interprets them as a numerical value.
p**f
发帖数: 49
32
来自主题: JobHunting版 - Job Openings in Seattle
Openings available for all levels. Please contact s*********[email protected]
for details.
Specific job responsibilities will include:
- Design and build large scale metrics systems used to track traffic from
search engines, trends in search terms, conversion and other key traffic
metrics.
- Design and build dynamic website components used to improve ranking and
indexing of web pages
- Design and build machine-learning systems to optimize the landing page
experience and improve sales conversion for ... 阅读全帖
j******d
发帖数: 10
33
If you feel interested, please email your resume to d****[email protected]
===
[Job Description]
Work within a dynamic and fast-paced intrusion protection R&D team within
McAfee Labs to fight the cyber threat. McAfee Network IPS is the industry
leader in the intrusion detection and protection area. The NSS Labs 2010
competitive group test concludes that McAfee NSP has the highest attack
detection rate as well as the best throughput among all IPS vendors. Gartner
2010 IPS Magic Quadrant credits McAfee ... 阅读全帖
n*******w
发帖数: 687
34
来自主题: JobHunting版 - atoi很不好写,头都大了...
这个题面试中经常问。最好一次性写到bug free。
个人感觉,一开始先别考虑那么多exception。容易忘。
另外还有一个处理exception的方法。可以尽量parse input string并返回一个整数值
。感觉更好。比如输入 “-123abc”,不要抛出异常,返回-123.
l*******0
发帖数: 176
35
来自主题: JobHunting版 - 发一个MSFT bing的onsite面经
当时我说的跟你差不多,我说的是,在parse文档的时候维持一个大小为N的window。
然后把window里的词算作是bush的关联词. 然后按照取Top-K. 面试官不置可否。
不知道对不对。
r*******3
发帖数: 35
36
Ask.com, Oakland, CA
Java Engineer
Responsibilities
Hands-on end-to-end development to create new technical solutions and evolve
our current question and answer site.
Provide architectural, design and engineering leadership to influence Java
and client-side solutions
Work closely with other engineering teams to define and develop solutions to
real-world problems
Perform research and development to evaluate new technologies, ideas and
communicate value for company
Required Experience
Java - 5 ye... 阅读全帖
S**I
发帖数: 15689
37
来自主题: JobHunting版 - [合集] 收到G家拒信,发面经
☆─────────────────────────────────────☆
recursive (递归) 于 (Mon Apr 11 10:56:49 2011, 美东) 提到:
大半夜收到HR的thank you note。不用管什么NDA了
本人ECE fresh PhD,背景是电路/EDA,跟G业务基本没什么关系
同学内部推荐的,很简单的一次电面就给了onsite
题都不难,但是自己没把握好机会,出了一些小bug。
总的感觉,出错就是硬伤,宁可从最简单的算法写起,也不能出错。
电面:
1,Skip list, http://en.wikipedia.org/wiki/Skip_list
写code实现struct skip_list * find(struct skip_list *head, int value)
2,sorted array with repeated elements
for given element, find out its range.
e.g. A A B B B B B C C D D E F G, given B, the out... 阅读全帖
d****o
发帖数: 1055
38
来自主题: JobHunting版 - 最近面试碰到的题目
prefix tree parsing
TRIE
matrix find word
utf8 format decoding
这几个能不能展开说怎么考的?具体输入输出。

the
b******c
发帖数: 70
39
来自主题: JobHunting版 - 最近面试碰到的题目
oh, sorry, it is prefix representation parsing, like * 5 - 6 2
b******c
发帖数: 70
40
来自主题: JobHunting版 - 最近面试碰到的题目
prefix representation parsing, like * 5 - 6 2
Trie, write the Trie data structure, insert, find, and some optimization
matrx one, give a matrix of chars, find a word
utf8 is an encoding where first or first several bits representing how many
bytes used for a character, asked to verify whether it is valid foramt
c*****n
发帖数: 96
41
来自主题: JobHunting版 - amazon面试题目讨论贴3
Use factory pattern:
//Define a abstract class Cell which the application (Excel) will
//process.
public abstract class Cell {
....
public TValue getValue();
}
// Define concrete cell class
public class LiteralCell : Cell { // '500'
public override TValue getValue() { ... }
}
public class ExpressionCell :Cell { // 'A5 + A10'
public override TValue getValue() { ....}
}
public class FunctionCell : Cell { // 'f(A1, A2, A5)'
public override TValue getValue() { ....}
}
// define ... 阅读全帖
m*******m
发帖数: 82
42
来自主题: JobHunting版 - 攒人品之Amazon电面题目
I Applied Online and the interview consisted of a Phone Interview.
1. What are final, finalize and finalize in java?
2. Why can’t you just use "==" instead of "equals"?
3. You are given a series of XML file. How will you parse the XML and
convert to a java object?
g****e
发帖数: 172
43
来自主题: JobHunting版 - 一道程序题
You
scanning
frequent
shoppers
cards.
Your
cash
register
logs
all
transactions
to
a
pipe-‐delimited

("|")
flat
text
file
in
the
following
format:

customer_name|product_category|item_description|cost


An
Pedro|groceries|apple|1.42
Nitin|tobacco|cigarettes|15.00
Susie|groceries|cereal|5.50
Susie|groceries|milk|4.75
Susie|tobacco|cigarettes|15.00
Susie|fuel|gasoline|44.90
Pedro|fuel|... 阅读全帖
S******t
发帖数: 151
44
但是即使是这样的话,那这个题目也是线性啊?
不是直接读入每个单词,parse一下看这个单词是不是由一堆non overlapping的化学元
素组成就可以了?
c****9
发帖数: 164
45
来自主题: JobHunting版 - Another DP Problem: Balanced Partition
can we sort it then do a linear parse to get partition? use bucket sort
p*****2
发帖数: 21240
46
来自主题: JobHunting版 - Another DP Problem: Balanced Partition

how to do linear parse?
c********7
发帖数: 8
47
面的是test 职位,做了debug test3小时 + NYC onsite 5轮,每轮一小时,总体感觉
还不错,所以还挺期待。上周三面完,请问何时能给结果...
Onsite Technical questions:
1. Judge whether a number is a cube number. (For example, 1,8,27), and
write test cases.
2. Basic sql question, join two tables.
Brain teasers.
1000 bottles of water, only one poison, how many write rats do you need to
find the poison within the shortest possible time.
On the earth, you walk 1 mile south, 1 mile east, 1mile north, then you find
you are in the same position. Find a... 阅读全帖
c********7
发帖数: 8
48
面的是test 职位,做了debug test3小时 + NYC onsite 5轮,每轮一小时,总体感觉
还不错,所以还挺期待。上周三面完,请问何时能给结果...
Onsite Technical questions:
1. Judge whether a number is a cube number. (For example, 1,8,27), and
write test cases.
2. Basic sql question, join two tables.
Brain teasers.
1000 bottles of water, only one poison, how many write rats do you need to
find the poison within the shortest possible time.
On the earth, you walk 1 mile south, 1 mile east, 1mile north, then you find
you are in the same position. Find a... 阅读全帖
m*p
发帖数: 1331
49
来自主题: JobHunting版 - G面试一问
i've been involved in some serious platform backend deployment projects that
have 50K+ users. most of your time is spent on parsing the log, using
scripting.
well, lots of creativity is required too coz the log is TB/day.
p**e
发帖数: 533
50
来自主题: JobHunting版 - 递归法parse计算数字string
operator 在两个数字前面(不是中间),给一个string(空格分隔的操作符和数字)
,利用递归计算result。
比如:
+ 3 2 表示3+2=5
+ + 3 -2 * 1 6 表示(3+ -2)+(1*6) = 7
大家来写写code。
首页 上页 1 2 3 4 5 6 7 8 9 10 (共10页)