Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Code Completion by Modeling Flattened Abstract Syntax Trees as Graphs   Code completion has become an essential component of integrated development
environments. Contemporary code completion methods rely on the abstract syntax
tree (AST) to generate syntactically correct code. However, they cannot fully
capture the sequential and repetitive patterns of writing code and the
structural information of the AST. To alleviate these problems, we propose a
new code completion approach named CCAG, which models the flattened sequence of
a partial AST as an AST graph. CCAG uses our proposed AST Graph Attention Block
to capture different dependencies in the AST graph for representation learning
in code completion. The sub-tasks of code completion are optimized via
multi-task learning in CCAG, and the task balance is automatically achieved
using uncertainty without the need to tune task weights. The experimental
results show that CCAG has superior performance than state-of-the-art
approaches and it is able to provide intelligent code completion.

23
The categories of this paper are: solv-int
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th
24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
4
The categories of this paper are: cond-mat
11
The categories of this paper are: hep-lat
21
The categories of this paper are: adap-org
30
The categories of this paper are: q-alg
22
The categories of this paper are: chao-dyn
2
The categories of this paper are: math
17
The categories of this paper are: q-fin
25
The categories of this paper are: patt-sol
13
The categories of this paper are: quant-ph
32
The categories of this paper are: atom-ph
37
The categories of this paper are: supr-con